stat.ML · 2026-11-01 · No. 160

Machine Learning, 2026-11-01.

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

    Statistical Analysis of Synthetic Data with Verification: A Linear Regression Framework

    Heejune Sheen, Harrison H. Zhou

    stat.ML · cs.LG · math.ST

    Synthetic data are widely used for training modern AI systems. However, their statistical understanding remains limited. It is well recognized in statistics that repeated self-training on synthetic data can amplify errors inherited from pre-trained models, leading to model collapse. Verification plays a crucial role in selecting high-quality synthetic data to help prevent model collapse and improve model performance. We study verified...

    arxiv.org/abs/2610.40254 · PDF

  2. 02

    Understanding axial attention in TSFMs through single location regression

    Andrei-Tiberiu Pantea, Aymeric Dieuleveut

    stat.ML · cs.AI · cs.LG

    Recent advances in Time Series Foundation Models (TSFMs) increasingly rely on axial attention mechanisms, but despite their empirical success, the theoretical properties of axial attention remain largely unexplored. To bridge this gap, we extend the Single Location Regression framework introduced in Marion et al. [2025] to 2D structured data, in order to study sparse information settings where a target depends on a small number of tokens. We...

    arxiv.org/abs/2610.40188 · PDF

  3. 03

    Hidden Disparities in Ranking: Category-Aware Fairness via Distributional Stability

    Gayane Taturyan, Charlotte Laclau, Stephan Clémençon

    stat.ML · cs.LG

    We study the problem of fair ranking in recommender systems. We provide a formal probabilistic framework in which ranking policies are distributions over permutations, and the utility of a user is the exposure given to the items they interact with, relative to that of an ideal ranking. We consider utility parity across user groups, as well as its category-aware refinement, conditional utility parity, which requires parity within each category...

    arxiv.org/abs/2610.40182 · PDF

  4. 04

    Fisher Contrastive Learning to Mitigate Feature Suppression: A Case Study in Acute Promyelocytic Leukemia Diagnosis

    Shushan Wu, Yongkai Chen, Xilin Gong, Yufang Liu, Wenxuan Zhong, Ping Ma

    stat.ML · cs.LG

    Self-supervised contrastive learning (SSCL) learns representations by contrasting augmented views of the same sample, but it can exhibit feature suppression, where dominant or easy-to-learn factors suppress other class-relevant signals, degrading the performance of representations, particularly in high-dimensional data with heterogeneous features. We introduce Fisher Contrastive Learning (FCL), which uses a regularized Fisher trace criterion...

    arxiv.org/abs/2610.40162 · PDF

  5. 05

    Reinforcement Learning Under Runtime Confounding: Policy Learning and Off-Policy Evaluation

    Raphael Kim, Michele Santacatterina, Ramin Zabih, Keith Barnatchez

    stat.ML · cs.LG · stat.ME

    Reinforcement learning (RL) is increasingly used to train robust, adaptable systems across healthcare, e-commerce, and robotics. In these settings, legal, ethical, or logistical concerns may preclude certain key variables that drive decisions from being collected during deployment time. This gives rise to a setting known as runtime confounding: the logged data hold full observability, but deployment time lacks knowledge of certain variables,...

    arxiv.org/abs/2610.40056 · PDF

  6. 06

    Probabilistic Meshless Methods on Manifolds

    Federico Pavesi, Noémie Jaquier, Antonio Candelieri

    stat.ML · cs.LG

    Probabilistic meshless methods solve partial differential equations (PDEs) by placing a Gaussian process prior on the solution and conditioning it on the PDE at a finite set of collocation nodes. The posterior provides both an approximation of the solution and a Bayesian quantification of its error. While these methods are well established on Euclidean domains, their extension to manifolds lacks, to our knowledge, any convergence analysis. We...

    arxiv.org/abs/2610.39855 · PDF

  7. 07

    Bayes-Consistent Losses for Adaptive Inference in Classification

    Shirley Xiaoqi Liu, Florence Regol, Antonios Valkanas, Patrick Rebeschini, Mark Coates

    stat.ML · cs.LG

    Adaptive inference systems balance accuracy and inference cost by routing inputs to models with varying capabilities. Although jointly training models and routers is empirically more sample-efficient than training them separately, principled losses for joint training remain underexplored. We address this gap in a classification setting by proposing cost-sensitive hinge losses for jointly training classifiers with single-stage or cascade...

    arxiv.org/abs/2610.39709 · PDF

  8. 08

    Formalizing the Intrinsic Dimension of Objective Landscapes by a Generalized Notion of Co-dimension

    Ernesto Araya, Gitta Kutyniok, Weilin Li, Johannes Maly, Manjot Singh

    stat.ML · cs.LG · math.MG

    In this work, we formalize the concept of intrinsic dimension of objective landscapes introduced in Li et al. (2018), which measures the structural complexity of learning problems by training along randomly generated subspaces. We define the intrinsic dimension of a set $Θ\subset\mathbb{R}^p$ as the minimal dimension $d_{\mathrm{int}}(Θ)$ such that a random plane of dimension $d_{\mathrm{int}}(Θ)$ in $\mathbb{R}^p$ intersects $Θ$ with...

    arxiv.org/abs/2610.39674 · 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.