activity
20112026
most citedTighter risk certificates for neural networks

34 citations · 94 across the 15 of their papers we have counts for

collaborators

16 papers

stat.ML2026

Error Bounds for a Diffusion Model-Based Drift Estimator

Ioar Casado-Telletxea, Omar Rivasplata

Parameter estimation in stochastic differential equations is a classical statistical problem of much importance in many scientific fields. Recent work of Tapia Costa et al. (2026)…

stat.ML2024

A note on generalization bounds for losses with finite moments

Borja Rodríguez-Gálvez, Omar Rivasplata, Ragnar Thobaben +1

This paper studies the truncation method from Alquier [1] to derive high-probability PAC-Bayes bounds for unbounded losses with heavy tails. Assuming that the -th moment is boun…

cs.LG2023★ 1 cited

A Note on the Convergence of Denoising Diffusion Probabilistic Models

Sokhna Diarra Mbacke, Omar Rivasplata

Diffusion models are one of the most important families of deep generative models. In this note, we derive a quantitative upper bound on the Wasserstein distance between the data-g…

cs.LG2022

Semi-supervised Batch Learning From Logged Data

Gholamali Aminian, Armin Behnamnia, Roberto Vega +5

Off-policy learning methods are intended to learn a policy from logged data, which includes context, action, and feedback (cost or reward) for each sample point. In this work, we b…

cs.LG2021★ 1 cited

Progress in Self-Certified Neural Networks

Maria Perez-Ortiz, Omar Rivasplata, Emilio Parrado-Hernandez +2

A learning method is self-certified if it uses all available data to simultaneously learn a predictor and certify its quality with a tight statistical certificate that is valid on…

cs.LG2021★ 7 cited

Learning PAC-Bayes Priors for Probabilistic Neural Networks

Maria Perez-Ortiz, Omar Rivasplata, Benjamin Guedj +5

Recent works have investigated deep learning models trained by optimising PAC-Bayes bounds, with priors that are learnt on subsets of the data. This combination has been shown to l…

cs.LG2021★ 3 cited

On the Role of Optimization in Double Descent: A Least Squares Study

Ilja Kuzborskij, Csaba Szepesvári, Omar Rivasplata +2

Empirically it has been observed that the performance of deep neural networks steadily improves as we increase model size, contradicting the classical view on overfitting and gener…

math.PR2021

A note on a confidence bound of Kuzborskij and Szepesvári

Omar Rivasplata

In an interesting recent work, Kuzborskij and Szepesvári derived a confidence bound for functions of independent random variables, which is based on an inequality that relates conc…

cs.LG2020★ 3 cited

Upper and Lower Bounds on the Performance of Kernel PCA

Maxime Haddouche, Benjamin Guedj, John Shawe-Taylor

Principal Component Analysis (PCA) is a popular method for dimension reduction and has attracted an unfailing interest for decades. More recently, kernel PCA (KPCA) has emerged as…

cs.LG2020★ 34 cited

Tighter risk certificates for neural networks

María Pérez-Ortiz, Omar Rivasplata, John Shawe-Taylor +1

This paper presents an empirical study regarding training probabilistic neural networks using training objectives derived from PAC-Bayes bounds. In the context of probabilistic neu…

stat.ML2020★ 5 cited

PAC-Bayes Analysis Beyond the Usual Bounds

Omar Rivasplata, Ilja Kuzborskij, Csaba Szepesvari +1

We focus on a stochastic learning model where the learner observes a finite set of training examples and the output of the learning process is a data-dependent distribution over a…

cs.LG2020★ 8 cited

Logarithmic Pruning is All You Need

Laurent Orseau, Marcus Hutter, Omar Rivasplata

The Lottery Ticket Hypothesis is a conjecture that every large neural network contains a subnetwork that, when trained in isolation, achieves comparable performance to the large ne…

stat.ML2020★ 3 cited

PAC-Bayes unleashed: generalisation bounds with unbounded losses

Maxime Haddouche, Benjamin Guedj, Omar Rivasplata +1

We present new PAC-Bayesian generalisation bounds for learning problems with unbounded loss functions. This extends the relevance and applicability of the PAC-Bayes learning framew…

cs.LG2019★ 15 cited

PAC-Bayes with Backprop

Omar Rivasplata, Vikram M Tankasali, Csaba Szepesvari

We explore the family of methods "PAC-Bayes with Backprop" (PBB) to train probabilistic neural networks by minimizing PAC-Bayes bounds. We present two training objectives, one deri…

stat.ML2018★ 14 cited

PAC-Bayes bounds for stable algorithms with instance-dependent priors

Omar Rivasplata, Emilio Parrado-Hernandez, John Shawe-Taylor +2

PAC-Bayes bounds have been proposed to get risk estimates based on a training sample. In this paper the PAC-Bayes approach is combined with stability of the hypothesis learned by a…

math.PR2011

Smallest singular value of sparse random matrices

Alexander Litvak, Omar Rivasplata

We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previo…