paper-with-me

Papers

Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficulty

2022-10-20 · Felix Biggs, Benjamin Guedj

We introduce a modified version of the excess risk, which can be used to obtain tighter, fast-rate PAC-Bayesian generalisation bounds. This modified excess risk leverages information about the relative hardness of data examples to reduce the variance of its empirical counterpart, tightening the bound. We combine this with a new bound for $[-1, 1]$-valued (and potentially non-independent) signed losses, which is more favourable when they empirically have low variance around $0$. The primary new technical tool is a novel result for sequences of interdependent random vectors which may be of independent interest. We empirically evaluate these new bounds on a number of real-world datasets.

📄 PDF Abstract BibTeX arXiv:2210.11289

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Chained Generalisation Bounds

2022-03-02 · Eugenio Clerico, Amitis Shidani, George Deligiannidis, Arnaud Doucet

This work discusses how to derive upper bounds for the expected generalisation error of supervised learning algorithms by means of the chaining technique. By developing a general theoretical framework, we establish a dua…

Tighter Generalisation Bounds via Interpolation

2024-02-07 · Paul Viallard, Maxime Haddouche, Umut Şimşekli, Benjamin Guedj

This paper contains a recipe for deriving new PAC-Bayes generalisation bounds based on the $(f, \Gamma)$-divergence, and, in addition, presents PAC-Bayes generalisation bounds where we interpolate between a series of pro…

A PAC-Bayesian View of Generalisation for Physics-Informed Machine Learning

2026-05-25 · Thien V. Nguyen, Amaury Habrard, Benjamin Guedj arxiv

Physics-informed machine learning (PIML) integrates mechanistic knowledge, typically in the form of partial differential equations (PDE), into data-driven models. Despite strong empirical performance, its statistical gen…

Learning via Surrogate PAC-Bayes

2024-10-14 · Antoine Picard-Weibel, Roman Moscoviz, Benjamin Guedj

PAC-Bayes learning is a comprehensive setting for (i) studying the generalisation ability of learning algorithms and (ii) deriving new learning algorithms by optimising a generalisation bound. However, optimising general…

Meta-Learning

How Tight Can PAC-Bayes be in the Small Data Regime?

2021-06-07 · NeurIPS 2021 12 · Andrew Y. K. Foong, Wessel P. Bruinsma, David R. Burt, Richard E. Turner

In this paper, we investigate the question: Given a small number of datapoints, for example N = 30, how tight can PAC-Bayes and test set bounds be made? For such small datasets, test set bounds adversely affect generalis…