PAC-Bayes bounds for supervised classification
From MaRDI portal
Publication:2805734
Recommendations
Cites work
Cited in
(15)- scientific article; zbMATH DE number 1804114 (Why is no real title available?)
- Combining PAC-Bayesian and generic chaining bounds
- Comment: Transductive PAC-Bayes bounds seen as a generalization of Vapnik-Chervonenkis bounds
- Simplified PAC-Bayesian margin bounds.
- Tighter PAC-Bayes bounds through distribution-dependent priors
- Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge
- PAC-Bayes bounds with data dependent priors
- A PAC-Bayesian margin bound for linear classifiers
- scientific article; zbMATH DE number 5957470 (Why is no real title available?)
- scientific article; zbMATH DE number 7219345 (Why is no real title available?)
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- 10.1162/153244303768966111
- scientific article; zbMATH DE number 5544465 (Why is no real title available?)
- PACMAN: PAC-style bounds accounting for the mismatch between accuracy and negative log-loss
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
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)