arXiv Machine Learning

Symmetries in PAC-Bayesian Learning

arXiv:2510. 17303v2 Announce Type: replace Abstract: Symmetries are known to improve the empirical performance of machine learning models, yet theoretical guarantees explaining these gains remain limited.

arXiv AI
Jun 30

Representation Learning for Equivariant Inference with Guarantees

arXiv:2505. 19809v3 Announce Type: replace-cross Abstract: In many real-world applications of regression, conditional probability estimation, and uncertainty quantification, exploiting symmetries rooted in physics or geometry can dramatically improve generalization and sample efficiency.

By Daniel Ordo\~nez-Apraez, Vladimir Kosti\'c, Alek Fr\"ohlich, Vivien Brandt, Karim Lounici, Massimiliano Pontil
arXiv Machine Learning
Sep 21

Sparse Priors for Efficient Distribution Learning

arXiv:2609. 20883v1 Announce Type: new Abstract: Despite the widespread use and success of generative AI techniques today, theoretical guarantees on learning a distribution supported in $d$ dimensions from $n$ samples degrade as $O(n^{-1/\Theta(d)})$, though shown to be minimax optimal.

By Saumya Goyal, Barnab\'as P\'oczos
Hugging Face Trending Papers
Jun 8

Data augmented bootstrap: Unifying confidence interval construction by approximate invariance

We propose the data augmented bootstrap (DAB), a framework for constructing confidence intervals from approximately invariant transformations of the data. As special cases, DAB recovers popular methods that rely on exact group symmetries, such as conformal prediction, wild bootstrap for Maximum Mean Discrepancy U-statistics and the recently proposed SymmPI.

arXiv Machine Learning
Sep 14

Quantifying the Value of Privileged Information Using a PAC-Bayesian Approach

The paper introduces a PAC‑Bayesian, algorithm‑agnostic framework to quantify the value of privileged information (PI) in Learning Using Privileged Information (LUPI). By comparing the tightest achievable risk bounds with and without PI, the authors derive a training‑time metric that estimates the maximum potential gain from PI without requiring test data. Experiments in supervised and unsupervised settings show a strong correspondence between this metric and actual test‑time performance improvements.

By Vasily Bokov (aQa, Leiden University, The Netherlands, LIACS, Leiden University, Leiden, The Netherlands, Honda Research Institute Europe GmbH, Offenbach, Germany), Sebastian Schmitt (Honda Research Institute Europe GmbH, Offenbach, Germany), Vedran Dunjko (aQa, Leiden University, The Netherlands, LIACS, Leiden University, Leiden, The Netherlands), Hao Wang (aQa, Leiden University, The Netherlands, LIACS, Leiden University, Leiden, The Netherlands)