Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
From MaRDI portal
Publication:5502136
Recommendations
Cited in
(12)- User-friendly Introduction to PAC-Bayes Bounds
- Fast greedy \(\mathcal{C} \)-bound minimization with guarantees
- scientific article; zbMATH DE number 7626742 (Why is no real title available?)
- Adaptive transfer learning
- Erratum to: ``Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
- scientific article; zbMATH DE number 5957470 (Why is no real title available?)
- Learning a priori constrained weighted majority votes
- On PAC-Bayesian bounds for random forests
- scientific article; zbMATH DE number 2044039 (Why is no real title available?)
- A reduced-rank approach to predicting multiple binary responses through machine learning
- Machine truth serum: a surprisingly popular approach to improving ensemble methods
- High-dimensional sparse classification using exponential weighting with empirical hinge loss
This page was built for publication: Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502136)