Chained generalisation bounds
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 duality between generalisation bounds based on the regularity of the loss function,...
Main Authors: | Clerico, E, Shidani, A, Deligiannidis, G, Doucet, A |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Proceedings of Machine Learning Research
2022
|
Similar Items
-
Conditionally Gaussian PAC-Bayes
by: Clerico, E, et al.
Published: (2022) -
Generalisation and expressiveness for over-parameterised neural networks
by: Clerico, E
Published: (2023) -
Error bounds for flow matching methods
by: Benton, J, et al.
Published: (2024) -
Nearly d-linear convergence bounds for diffusion models via stochastic localization
by: Benton, J, et al.
Published: (2024) -
Stable ResNet
by: Hayou, S, et al.
Published: (2021)