stat.ML · 2026-10-17 · No. 146

Machine Learning, 2026-10-17.

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

01 — The papers

7 entries
  1. 01

    SurvICL: a Foundation Model for in-context Survival Analysis

    Julie Alberge, Linus Bleistein, Judith Abécassis, Marine Le Morvan, Gaël Varoquaux, David Holzmüller

    stat.ML · cs.LG

    Tabular foundation models (TFMs) now outperform gradient-boosted trees in classification and regression. Yet in survival analysis, which predicts when an event occurs from censored data, often on small clinical cohorts, we find that no existing TFM beats the half-century-old Cox model. We address this issue by introducing SurvICL, a TFM that predicts survival curves in-context. SurvICL is pretrained on purely synthetic datasets generated from...

    arxiv.org/abs/2610.22242 · PDF

  2. 02

    Learning Changes the World and Then What Was Learned has Changed: Training and Deploying Neural Networks in the Control Loop

    Vittorio Lippi

    stat.ML · cs.LG

    Neural networks offer critical adaptability for controlling complex systems where nominal modeling proves intractable. However, when offline-trained neural networks are deployed within closed-loop control systems, their actions fundamentally alter the state distribution upon which they were trained. This paper introduces a unified taxonomy to categorize these sequential failure modes: the initial Closed-Loop Identification Error, the...

    arxiv.org/abs/2610.22084 · PDF

  3. 03

    Rethinking Successive Rejects Algorithms

    Mohamed Khair, Junpei Komiyama

    stat.ML · cs.LG

    In the best-arm identification problem, an algorithm adaptively selects arms to find the arm of the largest mean reward. Successive Rejects (SR) is a simple fixed-budget best-arm identification algorithm that eliminates one candidate arm at each phase. At first glance, SR seems to have limited adaptivity, since it follows predetermined phase lengths. However, for Gaussian arms with common variance, SR's worst-instance error exponent...

    arxiv.org/abs/2610.22051 · PDF

  4. 04

    Designing Experiments for External Decision Makers

    Sahel Iqbal, Tom Rainforth

    stat.ML · cs.LG · econ.TH

    Standard Bayesian experimental design (BED) methods assume the experimenter alone will act on the data, choosing the best action given their own beliefs and goals. In practice, data are often acted on by external parties whose procedures the experimenter cannot change and may not know, particularly when the data are released publicly. To extend BED to such settings, we introduce usage-aware experimental design, a framework in which an...

    arxiv.org/abs/2610.22032 · PDF

  5. 05

    SelectPFN: Amortized Bayesian Variable Selection for Sparse Nonlinear Regression with Prior-Data Fitted Networks

    Bin Luo

    stat.ML · cs.LG

    Tabular foundation models based on prior-data fitted networks (PFNs) predict on a new data set in a single forward pass, but they cannot report which inputs their predictions depend on. We propose SelectPFN, a PFN that performs Bayesian variable selection and prediction jointly for sparse nonlinear regression. In one forward pass it returns posterior inclusion probabilities for every variable, and its predictions are computed from sampled...

    arxiv.org/abs/2610.21950 · PDF

  6. 06

    Robust Covariance Estimation for Entry-wise Contaminated and Partially Observed Data via Expectation Maximization Algorithm

    Matys Savidan, Mohammed Nabil El Korso

    stat.ML · cs.LG

    Robust covariance estimation under entry-wise contamination and missing data is challenging in various signal processing applications. Under the Student-$t$ model, observation-level reweighting induces a uniform attenuation across samples, which can lead to cumulative information loss even when most coordinates remain informative. The alternative Student-$t^*$ model enables coordinate-wise robustness, but its E-step is not available in closed...

    arxiv.org/abs/2610.21709 · PDF

  7. 07

    Conditional Mean Flows: Few-Step Densities for Simulation-Based Inference

    Jonas Arruda, Jan Hasenauer, Stefan T. Radev

    stat.ML · cs.LG

    Flow matching has emerged as a powerful generative family for simulation-based inference (SBI). However, sampling and density evaluation require numerical integration at inference time. This makes posterior sampling in neural posterior estimation costly. More importantly, it can make repeated likelihood evaluation prohibitively expensive and impractical for Markov chain Monte Carlo (MCMC) sampling, which may require thousands of repeated...

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