stat.ML · 2026-10-25 · No. 153

Machine Learning, 2026-10-25.

8 new papers in stat.ML. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

8 entries
  1. 01

    Reliable AI-Assisted Decisions via Selective Auditing

    Isaac Gibbs, Elise L. Han, Ryan J. Tibshirani, Tijana Zrnic

    stat.ML · cs.LG · stat.ME

    We consider online monitoring of an AI system that produces a sequence of decisions. At each round, the system outputs a proposed decision together with a confidence score estimating the trustworthiness of the decision. The decision and confidence score need not be produced by the same model: for example, one agent may propose a decision, while a separate verifier agent evaluates it and outputs a correctness or safety score. Based on this...

    arxiv.org/abs/2610.31662 · PDF

  2. 02

    Nonparametric autoregressive estimation of probability distributions with parallel gradient boosting

    Rémy Chapelle

    stat.ML · cs.LG

    Nonparametric estimation of joint probability distributions is a core problem in statistics, which is notoriously challenging with high-dimensional data. Such challenges also arise with conditional distribution estimation and have led to flexible algorithms that aim to tackle the ''curse of dimensionality'' by exploiting predictive structures of lower dimension than the ambient space. In this paper, we study the use of such conditional...

    arxiv.org/abs/2610.31524 · PDF

  3. 03

    Dimension-free regimes for unadjusted Langevin in ridge-separable models: A subspace robust Wasserstein analysis

    Yuansi Chen, Francesco Pedrotti, Peter A. Whalley

    stat.ML · cs.LG · math.PR · math.ST · stat.CO

    The Unadjusted Langevin Algorithm (ULA) is widely used for high-dimensional Bayesian inference. Classical analyses in Wasserstein-2 distance predict an asymptotic bias and a mixing time that grow with dimension, but this metric is stronger than necessary for many statistical tasks. We instead analyze the bias in subspace robust Wasserstein distance, which controls the mean and arbitrary low-dimensional marginals and is therefore well suited...

    arxiv.org/abs/2610.31431 · PDF

  4. 04

    Metric Conformal Prediction via the Conditional Expected Local Radius

    Rui Qiu, Fang Yao, Zhou Yu

    stat.ML · cs.LG

    We introduce the conditional expected local radius (CELR) and develop a new conformal prediction method for non-Euclidean responses in general metric spaces. CELR measures local conditional probability concentration, allowing prediction sets to accommodate heterogeneity and multimodality without requiring densities or a vector space structure. Its conditional distribution yields a nonconformity score that is comparable across covariate values...

    arxiv.org/abs/2610.31336 · PDF

  5. 05

    Deep Learning for Random Objects in Metric Spaces: Beyond Manifold Assumptions

    Marcos Matabuena, Xiaokai Luo, Oscar Hernan Madrid Padilla

    stat.ML · cs.LG · math.ST · stat.ME

    Deep learning (DL) methods have substantially improved predictive performance across a wide range of downstream prediction tasks, enabling new discoveries in multiple domains. However, principled DL methods for non-Euclidean random objects remain relatively scarce, despite the growing importance of modern biomedical outcomes taking the form of probability distributions, random graphs, functions, and other random objects in metric spaces....

    arxiv.org/abs/2610.31328 · PDF

  6. 06

    Prediction Uncertainty Controlled Computer Model Calibration

    Ryan Heejoon Byun, Dayeon Yoon, Won Chang

    stat.ML · cs.LG · stat.AP · stat.CO · stat.ME

    Computer-model calibration is usually undertaken in service of prediction, yet neither Bayesian Kennedy-O'Hagan (KOH) calibration nor amortized simulation-based inference is built to control the predictive error of the calibrated simulator. When parameters are weakly identified or the data-model discrepancy is misspecified, the simulator-output bands induced by a nominal posterior level can be far from nominal. We propose a two-layer...

    arxiv.org/abs/2610.31163 · PDF

  7. 07

    Random Projections for Spectral Algorithms: Optimal Rates in Sobolev Norms

    Caixing Wang, Yue Wang

    stat.ML · cs.LG

    Random projections (RP) offer an effective method for reducing computational and storage overhead while preserving the geometric structure of data. However, existing studies have primarily focused on the optimal generalization performance of specific kernel-regularized algorithms with RP in the well-specified setting and under restrictive conditions. In this paper, we provide a comprehensive and improved analysis of the generalization...

    arxiv.org/abs/2610.30948 · PDF

  8. 08

    Continuous-depth Deep Gaussian Processes

    Ying Li, Sanyou Wu, Zi Yang, Qiaochu Xu, Yuhao Liu, Zhidi Lin, Michael Minyi Zhang, Petar Djuric, Alexandre H. Thiery

    stat.ML · cs.LG

    Deep Gaussian processes (DGPs) are appealing Bayesian regression models, but their standard discrete-depth parameterization often becomes harder to optimize as depth grows. We argue that depth is better treated as a latent continuous evolution than as a long discrete stack. We therefore propose a continuous-depth formulation in which the latent representation follows a stochastic differential equation with a depth-indexed drift family...

    arxiv.org/abs/2610.30890 · PDF

This edition is part of The Daily Abstract — stat.ML archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.