Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Combining PAC-Bayesian and Generic Chaining Bounds

Published: 01 December 2007 Publication History

Abstract

There exist many different generalization error bounds in statistical learning theory. Each of these bounds contains an improvement over the others for certain situations or algorithms. Our goal is, first, to underline the links between these bounds, and second, to combine the different improvements into a single bound. In particular we combine the PAC-Bayes approach introduced by McAllester (1998), which is interesting for randomized predictions, with the optimal union bound provided by the generic chaining technique developed by Fernique and Talagrand (see Talagrand, 1996), in a way that also takes into account the variance of the combined functions. We also show how this connects to Rademacher based bounds.

Cited By

View all
  • (2023)A unified framework for information-theoretic generalization boundsProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669591(79260-79278)Online publication date: 10-Dec-2023
  • (2019)Fast-rate PAC-bayes generalization bounds via shifted rademacher processesProceedings of the 33rd International Conference on Neural Information Processing Systems10.5555/3454287.3455256(10803-10813)Online publication date: 8-Dec-2019
  • (2015)Risk and regret of hierarchical Bayesian learnersProceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 3710.5555/3045118.3045272(1442-1451)Online publication date: 6-Jul-2015
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image The Journal of Machine Learning Research
The Journal of Machine Learning Research  Volume 8, Issue
12/1/2007
2736 pages
ISSN:1532-4435
EISSN:1533-7928
Issue’s Table of Contents

Publisher

JMLR.org

Publication History

Published: 01 December 2007
Published in JMLR Volume 8

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)41
  • Downloads (Last 6 weeks)11
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)A unified framework for information-theoretic generalization boundsProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669591(79260-79278)Online publication date: 10-Dec-2023
  • (2019)Fast-rate PAC-bayes generalization bounds via shifted rademacher processesProceedings of the 33rd International Conference on Neural Information Processing Systems10.5555/3454287.3455256(10803-10813)Online publication date: 8-Dec-2019
  • (2015)Risk and regret of hierarchical Bayesian learnersProceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 3710.5555/3045118.3045272(1442-1451)Online publication date: 6-Jul-2015
  • (2010)Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and Stationary β-Mixing ProcessesThe Journal of Machine Learning Research10.5555/1756006.185991611(1927-1956)Online publication date: 1-Aug-2010
  • (undefined)Learning data triage: Linear decoding works for compressive MRI2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)10.1109/ICASSP.2016.7472435(4034-4038)

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media