Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm

zbMATH Open1337.68223arXiv1503.08329MaRDI QIDQ5502136FDOQ5502136

Alexandre Lacasse, François Laviolette, Jean-Francis Roy, Mario Marchand, Pascal Germain

Publication date: 17 August 2015

Full work available at URL: https://arxiv.org/abs/1503.08329

Recommendations

• Learning a priori constrained weighted majority votes
• scientific article
• scientific article; zbMATH DE number 2044039
• Boosting a weak learning algorithm by majority
• Learning Theory and Kernel Machines

zbMATH Keywords

learning theoryensemble methodsmajority votesample compressionPAC-Bayesian theory

Mathematics Subject Classification ID

Bayesian inference (62F15) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cited In (11)

• Fast greedy \(\mathcal{C} \)-bound minimization with guarantees
• Title not available (Why is that?)
• Adaptive transfer learning
• Erratum to: ``Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
• Title not available (Why is that?)
• On PAC-Bayesian bounds for random forests
• Title not available (Why is that?)
• 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
• User-friendly Introduction to PAC-Bayes Bounds

Uses Software

• UCI-ml
• Scikit
• BayesDA
• MNIST

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)