PAC-Bayes bounds for supervised classification
From MaRDI portal
Publication:2805734
DOI10.1007/978-3-319-21852-6_20zbMATH Open1381.62157OpenAlexW2311606286MaRDI QIDQ2805734FDOQ2805734
Authors: Olivier Catoni 
Publication date: 13 May 2016
Published in: Measures of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_20
Recommendations
Bayesian inference (62F15) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inequalities; stochastic orderings (60E15)
Cites Work
Cited In (15)
- A PAC-Bayesian margin bound for linear classifiers
- Comment: Transductive PAC-Bayes bounds seen as a generalization of Vapnik-Chervonenkis bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Simplified PAC-Bayesian margin bounds.
- Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- PAC-Bayes bounds with data dependent priors
- Title not available (Why is that?)
- Combining PAC-Bayesian and generic chaining bounds
- Tighter PAC-Bayes bounds through distribution-dependent priors
- 10.1162/153244303768966111
- PACMAN: PAC-style bounds accounting for the mismatch between accuracy and negative log-loss
- Title not available (Why is that?)
This page was built for publication: PAC-Bayes bounds for supervised classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805734)
