stat.ML · 2026-10-29 · No. 157

Machine Learning, 2026-10-29.

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

    QD-PINN:A Physics-Informed Neural Network Approach to Bayesian Quickest Detection in High-Dimensional Diffusions

    Hang Ye, Yi Liu, Haipeng Xing

    stat.ML · cs.LG

    Quickest detection problems (QDPs) arise in a wide range of applications. However, the complementarity structure of the associated variational inequalities poses substantial challenges for traditional numerical methods, particularly in high-dimensional settings. We propose a PINN-based framework for estimating the optimal stopping boundary in QDPs with high-dimensional diffusion processes and spatial dependence, while overcoming the curse of...

    arxiv.org/abs/2610.37473 · PDF

  2. 02

    Graph Representation Learning via Adaptive Expectile Aggregation

    Tianyi Zhu, Wei Lan

    stat.ML · cs.LG

    Graph neural networks (GNNs) rely critically on neighborhood aggregation, yet conventional mean aggregation may fail to capture class-relevant distributional information, particularly in heterophilic graphs. We propose ExpectileGCN, an adaptive graph aggregation framework that introduces a learnable expectile level to capture neighborhood information beyond the mean. The proposed operator continuously adjusts aggregation between minimum- and...

    arxiv.org/abs/2610.37450 · PDF

  3. 03

    An end-to-end framework for uncertainty-aware validation of generative models

    Giada Badaracco, Sean Benevedes, Christina Reissel, Philip Harris, Gaia Grosso

    stat.ML · cs.LG · hep-ex · hep-ph

    Density estimation with generative models is a common task in the physical sciences, for example in background estimation in particle physics. Existing machine learning techniques, however, lack methods to quantify uncertainties that can be propagated into a statistical test. That limits the validation of generative models to standard goodness-of-fit tests, in which the generative model is treated as exact (point-null hypothesis). But a model...

    arxiv.org/abs/2610.37398 · PDF

  4. 04

    Low-degree polynomials lower bounds for clustering in small dimension

    Alexandra Carpentier, Nicolas Verzelen

    stat.ML · cs.LG

    We study the computational limits of clustering $n$ observations drawn from a mixture of $K$ isotropic distributions in $\mathbb R^d$, in the regime where the number $K$ of groups is much larger than the dimension $d$. In this regime, tensor-based procedures recover the partition with a polylogarithmic separation between the centers, but they require a sample size that is a large and non-explicit polynomial of $dK$, whereas the existing...

    arxiv.org/abs/2610.37272 · PDF

  5. 05

    Doubly Robust Deep Kernel Tests for Structured Outcomes

    Robin Leman, Bariscan Bozkurt, Sofiane Tanji, Arthur Gretton, Houssam Zenati

    stat.ML · cs.LG

    We propose a test of whether two interventions induce the same outcome distribution when outcomes are structured and high-dimensional, such as images, text and graphs. We represent the interventional distributions as mean embeddings on learned deep features, such that the treatment effect is a doubly robust representation of the difference in mean embeddings. Our test, DR-KTE-Deep, optimises the learned features so as to maximise an estimated...

    arxiv.org/abs/2610.37227 · PDF

  6. 06

    Intrinsic Information-Theoretic Analysis of ReLU Nets

    Johan Mylius-Kroken, Elisabeth Wetzer, Ali Ramezani-Kebrya, Robert Jenssen, Kristoffer Knutsen Wickstrøm

    stat.ML · cs.LG

    Mutual information (MI) is fundamental to representation-learning analysis in deep networks, but in high dimensions MI estimators depend on hyperparameters whose bias often dominates the signal. We show that continuous piecewise-linear (CPWL) networks, including ReLU networks, admit an intrinsic information-theoretic analysis that avoids this pitfall: their inherent partition of the input space into convex linear regions assigns to every...

    arxiv.org/abs/2610.36864 · PDF

  7. 07

    Boundary Geometry Determines Optimal Shallow ReLU Approximation under Weighted Coefficient Constraints

    Jia-Qi Yang, Lei Shi

    stat.ML · cs.LG · math.FA · math.MG

    We study how boundary geometry affects $L^q$ approximation by shallow ReLU neural networks on convex bodies $K\subset\mathbb R^d$. The target classes are unit balls of weighted variation spaces that can enlarge classical spaces by incorporating domain geometry into constraints on output coefficients. We establish upper and lower bounds for arbitrary convex bodies and determine the optimal polynomial approximation exponents for all planar...

    arxiv.org/abs/2610.36854 · PDF

  8. 08

    Joint Distributional Copula Regression for Insurance Claim Frequency and Severity via Boosting

    Banghee So, Na Zhang

    stat.ML · cs.LG · stat.ME

    In this paper, we propose a model-based boosting approach for fitting structured additive distributional copula regression models with bivariate responses, focusing particularly on the joint modeling of claim frequency and claim severity. The proposed approach is based on generalized additive models for location, scale, and shape (GAMLSS), which extend the general idea of GAMs by allowing multiple parameters of a response distribution, rather...

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