10 citations · 22 across the 11 of their papers we have counts for
11 papers
Generalization Bounds for Markov Algorithms through Entropy Flow Computations
Benjamin Dupuis, Maxime Haddouche, George Deligiannidis +1
Many learning algorithms can be represented as Markov processes, and understanding their generalization error is a central topic in learning theory. For specific continuous-time no…
Tighter Generalisation Bounds via Interpolation
Paul Viallard, Maxime Haddouche, Umut Şimşekli +1
This paper contains a recipe for deriving new PAC-Bayes generalisation bounds based on the -divergence, and, in addition, presents PAC-Bayes generalisation bounds where we…
A PAC-Bayesian Link Between Generalisation and Flat Minima
Maxime Haddouche, Paul Viallard, Umut Simsekli +1
Modern machine learning usually involves predictors in the overparameterised setting (number of trained parameters greater than dataset size), and their training yields not only go…
Federated Learning with Nonvacuous Generalisation Bounds
Pierre Jobic, Maxime Haddouche, Benjamin Guedj
We introduce a novel strategy to train randomised predictors in federated learning, where each node of the network aims at preserving its privacy by releasing a local predictor but…
Learning via Wasserstein-Based High Probability Generalisation Bounds
Paul Viallard, Maxime Haddouche, Umut Şimşekli +1
Minimising upper bounds on the population risk or the generalisation gap has been widely used in structural risk minimisation (SRM) -- this is in particular at the core of PAC-Baye…
Wasserstein PAC-Bayes Learning: Exploiting Optimisation Guarantees to Explain Generalisation
Maxime Haddouche, Benjamin Guedj
PAC-Bayes learning is an established framework to both assess the generalisation ability of learning algorithms, and design new learning algorithm by exploiting generalisation boun…
Online (Non-)Convex Learning via Tempered Optimism
Maxime Haddouche, Olivier Wintenberger, Benjamin Guedj
Optimistic Online Learning aims to exploit experts conveying reliable information to predict the future. However, such implicit optimism may be challenged when it comes to practica…
PAC-Bayes Generalisation Bounds for Heavy-Tailed Losses through Supermartingales
Maxime Haddouche, Benjamin Guedj
While PAC-Bayes is now an established learning framework for light-tailed losses (\emph{e.g.}, subgaussian or subexponential), its extension to the case of heavy-tailed losses rema…
Online PAC-Bayes Learning
Maxime Haddouche, Benjamin Guedj
Most PAC-Bayesian bounds hold in the batch learning setting where data is collected at once, prior to inference or prediction. This somewhat departs from many contemporary learning…
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…
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…