Learning via Surrogate PAC-Bayes
Antoine Picard-Weibel, Roman Moscoviz, Benjamin Guedj

TL;DR
This paper introduces a new iterative learning strategy that optimizes surrogate objectives derived from PAC-Bayes bounds, enabling efficient generalisation bound optimization and application to meta-learning with practical experiments.
Contribution
It proposes a novel surrogate optimization method for PAC-Bayes bounds, with theoretical guarantees and a meta-learning framework, validated through numerical experiments.
Findings
Surrogate bounds can be optimized more efficiently than empirical risk.
Iterative surrogate optimization aligns with original PAC-Bayes bounds.
Method applied successfully to industrial biochemical problem.
Abstract
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 generalisation bounds might not always be viable for tractable or computational reasons, or both. For example, iteratively querying the empirical risk might prove computationally expensive. In response, we introduce a novel principled strategy for building an iterative learning algorithm via the optimisation of a sequence of surrogate training objectives, inherited from PAC-Bayes generalisation bounds. The key argument is to replace the empirical risk (seen as a function of hypotheses) in the generalisation bound by its projection onto a constructible low dimensional functional space: these projections can be queried much more efficiently than the initial risk. On top of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsMachine Learning and Data Classification · Domain Adaptation and Few-Shot Learning · Machine Learning and Algorithms
