stat.ML · 2026-10-09 · No. 138
Machine Learning, 2026-10-09.
13 new papers in stat.ML. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
13 entries-
01
Density Ratio Estimation with Stein Displacement Fields
Song Liu
stat.ML · cs.LG
Density ratios quantify distribution shift from a probability-mass point of view, whereas displacement fields describe, from a dynamical point of view, how one distribution is transported onto another. Although both offer complementary insights, they are usually estimated separately, and converting one into the other requires post-processing. In this paper, we estimate the density ratio between a target and a base distribution by...
-
02
Prediction-Powered Data Fusion for Treatment Effect Estimation
Yonghan Jung, Shu Yang
stat.ML · cs.AI · cs.LG · stat.ME
Randomized controlled trials (RCTs) identify treatment effects without confounding but are often small, whereas observational studies (OBS) are large but may be confounded. Many estimators combining a small RCT with a large OBS have been developed for the average treatment effect (ATE) and the conditional ATE (CATE). However, existing ATE estimators either make assumptions on the OBS or do not borrow enough power from them. The CATE has been...
-
03
ISBO: Scalable Spatio-Temporal Bayesian Optimization with Log Gaussian Cox Process Models via the INLA-SPDE Approach
Kaichuang Yang, Håvard Rue, Jakob Zeitler
stat.ML · cs.LG
Bayesian Optimization (BO) is a popular method for efficiently optimizing expensive black-box objectives. However, BO utilizing standard Gaussian Processes is ill-suited for doubly stochastic Cox Processes that are often used in spatio-temporal problem spaces. We introduce INLA-SPDE Spatio-Temporal Bayesian Optimization (ISBO): the first scalable BO framework for spatio-temporal data, that models the log-intensity with a Log-Gaussian Cox...
-
04
Quickest Change Detection with Diffusion-Integrated Scores
Arman Adibi, Mohammadreza Maleki, Sanjeev Kulkarni, H. Vincent Poor
stat.ML · cs.LG
Classical CUSUM relies on the log-likelihood ratio of the underlying distributions, which cannot generally be computed from finite pre- and post-change samples alone. We propose diffusion-integrated score CUSUM (DI-SCUSUM), a training-free detector. We add Gaussian noise to the samples to form two smooth density estimates and calculate their Hyvärinen scores exactly, without training a score network. For each incoming observation, we sample a...
-
05
Differentiable Systematic Resampling for Variational Sequential Monte Carlo
Fredrik Cumlin, Saikat Chatterjee
stat.ML · cs.LG · eess.SP
Particle filters are a standard tool for nonlinear state estimation, but their resampling step is discrete, preventing gradient-based learning in variational sequential Monte Carlo. We introduce Differentiable Systematic Resampling (DSR), a temperature-controlled relaxation of systematic resampling, that preserves the CDF-ordered, banded structure of systematic resampling while enabling full gradient flow. DSR converges to exact systematic...
-
06
Diffusion Removes Langevin's Conditioning Dependence: A Sharp Gaussian Analysis
Adam Perbost, Francis Bach, Pierre Marion
stat.ML · cs.LG
Despite their empirical success, why diffusion models overcome the bottlenecks of classical score-based samplers remains unclear. In this work, we leverage Gaussian distributions to isolate this phenomenon. We establish 2-Wasserstein convergence bounds for optimized hyperparameters, showing that diffusion processes achieve a sampling error of $O(\sqrt{dλ_{\max}}\log N/N)$, where $d$ is the dimension, $N$ the number of sampling steps, and...
-
07
Efficient and Generalizable Archetypal Analysis for Discrete Data
A. Emilie J. Wedenborg, Jesper Løve Hinrich, Morten Mørup
stat.ML · cs.LG
Archetypal Analysis (AA) represents observations as convex combinations of extremal data-driven profiles, yielding interpretable low-dimensional descriptions of complex datasets. Classical AA relies on a least-squares objective, which is poorly suited to discrete observations such as binary, count, and categorical data. We introduce an efficient likelihood-based framework for AA supporting Bernoulli, Poisson, and multinomial observation...
-
08
Efficient quadratic entropy with distance sketches
Steve Huntsman
stat.ML · cs.LG · math.ST · stat.CO
We detail scalable methods for approximating the quadratic entropy $p^T d p$ for arbitrary distributions $p$ and common distances $d$ of negative type. We focus on the Euclidean and spherical geodesic cases, which both use random feature embeddings and projections to dramatically improve computational complexity within a simple framework. Amortization of a single large matrix multiplication and control variates further enable computation at...
-
09
Score-Based Learning of Cluster DAGs from Interventions
Gaetano Tedesco, Alex Markham
stat.ML · cs.LG
Graphical approaches to causal abstraction transform a low-level causal directed acyclic graph (DAG) over many measured variables into a smaller, high-level DAG whose nodes cluster the original variables and whose edges summarize the causal relations between clusters. Such cluster DAGs are easier to interpret, but learning them requires finding the clusters and recovering the edges between them. Madaleno et al. (2026) learn the interventional...
-
10
RobustLDS: Learning linear dynamical systems under adversarial corruptions
Aravinda Kanchana Ruwanpathirana, Hemant Tyagi
stat.ML · cs.LG · eess.SY · math.OC · math.ST
We consider the problem of learning linear dynamical systems under adversarial contamination from a single trajectory of length $T$. While identification of linear dynamical systems itself is well-studied, the problem of robust system identification under adversarial contamination is relatively less explored. In this work, we study the setting where a fraction of the $T$ observations are contaminated by adversarial outliers. We propose...
-
11
Learning structured linear dynamical systems from missing observations
Aravinda Kanchana Ruwanpathirana, Hemant Tyagi, Sunny G. W. Wang
stat.ML · cs.LG · eess.SY · math.OC · math.ST
We consider the problem of learning structured linear dynamical systems over convex sets $\mathcal{K}$, where only a small subset of the observations are available at each time point. An estimator which minimizes a bias-corrected, potentially non-convex objective function is proposed. Non-asymptotic bounds are obtained for the statistical error, which depend on the local complexity of $\mathcal{K}$, the trajectory length $T$, and the...
-
12
Conditional Kernel Stein Discrepancy
Federico Matteucci, Florian Kalinke
stat.ML · cs.LG · math.ST
Kernel Stein discrepancies (KSDs) provide a versatile tool for comparing distributions. One of their main applications is in quantifying the goodness-of-fit (GoF) between a data-generating distribution and a prescribed target distribution. In this work, we study the related problem of conditional GoF quantification: given only a (possibly non-normalized) conditional target model, without information on the distribution of its covariates, and...
-
13
Softmax Attention on Gaussian Mixtures: Linear When It Can, Selective When It Must
Simon Gabet, Etienne Boursier, Claire Boyer
stat.ML · cs.LG
Softmax attention, at the heart of Transformers, has demonstrated remarkable capabilities. Yet its underlying mechanisms remain only partially understood. Recent theoretical work studies Gaussian prompts, where the infinite-prompt limit reduces softmax attention to a linear map, but also removes the query-dependent selection that distinguishes it from linear attention. This work studies the infinite-prompt limit of softmax attention on...
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.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.