stat.ML · 2026-10-07 · No. 136

Machine Learning, 2026-10-07.

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

    Steering Diffusion Models to Rare Events with Sequential Monte Carlo

    Aavash Subedi, Tim Reichelt, Christopher Williams, Philip Stier, Yee Whye Teh, Saifuddin Syed

    stat.ML · cs.LG

    Diffusion models are increasingly used as surrogates for expensive simulators in weather prediction, molecular dynamics, and materials design. In these models, computing the probability $p_0[E]$ of an event $E$ is difficult, especially when the event of interest is rare. A stable estimate using Monte Carlo becomes computationally intractable, requiring a growing sample size $\propto\!1/p_0[E]$ to compensate for an increasing rarity. In this...

    arxiv.org/abs/2610.08652 · PDF

  2. 02

    Feature Information Dynamics in Diffusion

    Jia-Shu Pan, Tao Zhang, Yufei Huang, Yanjun Sheng, Tailin Wu

    stat.ML · cs.AI · cs.LG

    Diffusion models generate data through a continuum of denoising problems, and are widely observed to reveal coarse structure before fine detail. Yet, this intuition is mostly empirical and qualitative. We introduce feature information dynamics, an information-theoretic framework for localizing when a feature is generated during diffusion. Using the I-MMSE identity, we connect the rate of feature mutual information change to a gap between...

    arxiv.org/abs/2610.08626 · PDF

  3. 03

    Information-Dense Synthesis for Molecular Discovery

    Kasper K. Jakobsen, Eli N. Weinstein

    stat.ML · cs.LG · physics.chem-ph · q-bio.BM

    Machine learning can accelerate molecular discovery by designing molecules and planning experiments. However, many scientific challenges demand molecules with very rare properties, and in this sparse setting, existing algorithms offer little gain over random guessing. We propose a method to efficiently search large regions of molecular space using algorithmically controlled stochastic synthesis. Rather than design, make and test individual...

    arxiv.org/abs/2610.08495 · PDF

  4. 04

    High-Dimensional Statistical Inference for Sparse Support Vector Machines

    Peng Zeng, Hanwen Huang

    stat.ML · cs.LG · stat.ME

    Using a replica-symmetric high-dimensional characterization, we develop an inferential framework for sparse support vector machines when the sample size and number of features grow proportionally. The main challenge is the nonsmooth hinge loss, which prevents direct application of debiasing arguments developed for smooth classification losses. We overcome this difficulty by representing the $L_1$-penalized support vector machine (SVM) as a...

    arxiv.org/abs/2610.08345 · PDF

  5. 05

    Two-Sample Testing via Generative Processes

    Eshant English, Kenji Fukumizu, Taiji Suzuki

    stat.ML · cs.LG

    Deciding whether two samples come from the same distribution is a classical problem in statistics, and generative transport offers a new way to approach it. We build a stochastic interpolant directly between the two samples and observe that, for a symmetric schedule, its law is invariant under the time reflection $t \mapsto 1-t$ whenever the two distributions coincide. We therefore test whether the marginals at times t and 1-t agree by...

    arxiv.org/abs/2610.08277 · PDF

  6. 06

    How Many Independent Samples Does a Satellite Image Contain? Generalization Bounds for Spatially Dependent Data

    Robin Young

    stat.ML · cs.CV · cs.LG

    Machine learning classifiers for remote sensing imagery are typically evaluated as though every pixel were an independent sample. Spatial autocorrelation violates this assumption, since neighboring pixels carry redundant information which inflates sample sizes. How many independent samples does a satellite image actually contain? For an $n \times n$ image whose spatial correlation persists over a range of $r$ pixels, the effective sample size...

    arxiv.org/abs/2610.08227 · PDF

  7. 07

    Anytime-valid simulation-based hypothesis testing

    Patrick Forré, Lydia Brenner

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

    For a given data distribution $(X_t)_{t \in \mathbb{N}} \sim Q$ i.i.d., we investigate the hypothesis testing problem: $H_0: Q = P_0$ vs. $H_1: Q = P_1$, for two different model probability distributions $P_0$ and $P_1$. In contrast to the standard setting, where analytic densities $p_0$ and $p_1$ are given, here, we consider the density-free setting, where we only have access to i.i.d. simulations $(Z^0_t)_{t \in \mathbb{N}} \sim P_0$ and...

    arxiv.org/abs/2610.08210 · PDF

  8. 08

    ProximalFM: Amortized Proximal Causal Inference under Hidden Confounding

    Christophe Muller, Ayub Kharel, Alex Luedtke, Chan Park, Eric Tchetgen Tchetgen, Juan L. Gamella, Rahul Krishnan,...

    stat.ML · cs.LG

    Standard causal identification methods often assume no unmeasured confounding and can fail when relevant confounders are unobserved. Proximal causal inference instead uses proxy variables to identify effects under hidden confounding. However, nonparametric proximal estimation can be challenging in practice: recovering causal estimands such as the conditional average treatment effect (CATE) requires solving an ill-posed integral equation that...

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