CORTEXA
← Browse
arxivstat.MLcs.LGmath.ST2026-07-21

The Tractability Landscape of Sampling with Inexact Scores

Anming Gu, Kevin Tian, Hubert Yang, Yusong Zhu

We provide a simple and tight characterization of the types of inexact score oracle access that permit sampling with vanishing total variation bias, for a standard, well-behaved target family. Our main result shows that any weaker error than the sub-Gaussian assumption used by [YW26] rules out the tractability of unbiased sampling. This strengthens the conclusion of [CCSW26] to be algorithm-agnostic, and to hold for a wider range of error assumptions.

View free PDFSource page

Related papers

arxivstat.MLcs.LGmath.ST2026-06-26

Surprises in Proper Positive-Only Learning

Shai Ben-David, Farnam Mansouri, Anay Mehrotra, Manolis Zampetakis

Binary classification from positive-only samples is a variant of PAC learning in which the learner receives i.i.d. samples from the positive region of an unknown target concept, but is evaluated under the original distribution (which places mass on both positive and negative regi…

View free PDFSource page
arxivstat.MLcs.LGmath.STstat.ME2026-07-02

Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms

Ye Tian, Mengchu Li, Marco Avella Medina

Integrating information across related tasks can improve estimation and prediction in transfer, multi-task, and federated learning, but contamination and heterogeneity make robust borrowing challenging. We study a contaminated multi-task empirical risk minimization (ERM) framewor…

View free PDFSource page
arxivstat.MLcs.LGmath.ST2026-07-20

Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics

Vignesh Tirukkonda, Gautam Dasarathy

Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process. We study exact recovery of the graph from one trajectory of random-scan Gaussian Glauber dynamics. E…

View free PDFSource page
arxivmath.NAcs.LGmath.STstat.ML2026-07-21

Boundary-Adapted PINNs for Elliptic Dirichlet Problems: $H^2(Ω)$ A Priori Error Bounds with Application to Mean Escape Time Computation

Nathanael Tepakbong, Jun Fan, Xiang Zhou, Ding-Xuan Zhou

Motivated by the numerical computation of the Mean Escape Time (MET) $τ:Ω\to\mathbb{R}$ of a stochastic process from a bounded domain $Ω\subseteq\mathbb{R}^d$, we study elliptic Dirichlet boundary value problems (BVPs) using boundary-enforced Physics-Informed Neural Networks (PIN…

View free PDFSource page