stat.ML · 2026-11-16 · No. 173

Machine Learning, 2026-11-16.

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

    Elliptic Sampling: Optimal Interpolant Schedules for Gaussians and Beyond

    Cole Becker, Taylan Kargin, Kimia Hassibi, Asuman Ozdaglar, Pablo A. Parrilo

    stat.ML · cs.AI · cs.LG

    Generative modeling based on stochastic interpolants requires specifying two key choices: an interpolant schedule bridging the initial and target distributions, and an efficient discretization of the resulting probability-flow ODE. In this work, we introduce a new framework for joint schedule/discretization design based on the analyticity properties of the (complexified) ODE trajectories, which in turn ensure good numerical behavior. Our...

    arxiv.org/abs/2611.18542 · PDF

  2. 02

    Bregman geometry in regular exponential families: dual representations and relative smoothness

    Mame Diarra Fall, Éric Barat, Nicolas Dobigeon

    stat.ML · cs.LG · math.OC

    Regular exponential-family distributions are ubiquitous in statistics due to their appealing and convenient properties. Notably, they can be expressed in terms of Bregman divergences, revealing fundamental connections between statistics, convex analysis, and information geometry. However, this geometric structure has not been systematically exploited to characterize these distributions with respect to their expectation parametrization....

    arxiv.org/abs/2611.18480 · PDF

  3. 03

    Contrastive latent representation learning with denoising score matching

    Christopher Marouani, Grigory Bartosh, Christian A. Naesseth

    stat.ML · cs.LG

    Contrastive representation learning methods operate by pulling different views of the same data sample together while pushing them away from views of different samples. A fundamental challenge is the estimation of the repulsive force, which typically requires large batch sizes, can exhibit high variance, and is susceptible to the curse of dimensionality. We introduce ScoreCLR, a contrastive representation learning method that offers a novel...

    arxiv.org/abs/2611.18469 · PDF

  4. 04

    Lipschitz-Constrained Discriminators in Generative Modeling: Asymptotic Behavior and Support Mismatch

    Eduardo Pinto, Panagiota Birmpa

    stat.ML · cs.LG

    We study the asymptotic behavior of optimal discriminators associated to $L-$Lipschitz regularized KL-divergences of two probability distributions $Q$ and $P$ that interpolate between the rescaled Wasserstein$-1$ metric by some parameter $L>0$ and the KL divergence. The parameter $L$ plays the role of a Lipschitz constraint and is viewed as a regularization parameter: small values of $L$ enforce a more geometry-aware discriminator, while as...

    arxiv.org/abs/2611.18394 · PDF

  5. 05

    LaMe: a Joint Latent Mediation Framework for High-Dimensional Systems

    Gaël Poux-Médard, Kaniav Kamary, Yohann De Castro, Vivian Viallon

    stat.ML · cs.LG · q-bio.QM · stat.ME

    Mediation analysis seeks to understand how an exposure influences an outcome through intermediate variables. However, as increasingly rich datasets become available, hundreds to thousands of potential mediators make these systems difficult to model and hard to interpret. Latent-variable approaches offer a natural way to accommodate these high-dimensional settings. However, existing latent mediation methods face limitations, including...

    arxiv.org/abs/2611.18180 · PDF

  6. 06

    Detection and Classification in Latent Spaces: High-Dimensional Analysis and Validation

    Enis Chenchene, Anil S. Baslamisli, Paolo Braca

    stat.ML · cs.LG

    Foundation models produce high-dimensional latent representations in which suitably designed statistical decision rules can be effective yet analytically tractable. We study such detectors in the high-dimensional regime, where latent dimension and training sample size grow proportionally. For linear and quadratic statistics, we derive explicit large-deviation characterizations of false-alarm and miss-detection performance under the...

    arxiv.org/abs/2611.18164 · PDF

  7. 07

    Training-point consistency of kernel ridge regression with varying correlation scales

    Weiyan Mu, Shifeng Xiong, Yuming Shen

    stat.ML · cs.LG · math.ST

    The scale parameter in kernel ridge regression plays a pivotal role in modeling the correlation structure of data. In modern applications, sampling density and the underlying correlation range often change simultaneously, making a fixed-scale assumption highly restrictive. However, establishing asymptotic theories under varying scale parameters is fundamentally challenging. To address this gap, this paper develops a unified theoretical...

    arxiv.org/abs/2611.18095 · PDF

  8. 08

    Efficient and Practical Clustering of Variables in Causal Graphs

    Otto Tabell, Jani Nykänen, Santtu Tikka, Juha Karvanen

    stat.ML · cs.LG · stat.ME

    Clustering variables in a graph may improve visual clarity and simplify causal inference. Harnessing the full potential of clustering requires an automated method to detect useful clusters in a graph. We introduce a novel class of clusters called conduits, and present a sound, complete and efficient algorithm for detecting all conduits in the graph. In addition to algorithmic detectability, conduits appear naturally in causal graphs stemming...

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