Fast greedy \(\mathcal{C} \)-bound minimization with guarantees

DOI10.1007/s10994-020-05902-7OpenAlexW3088086419MaRDI QIDQ2217455

Jean-Francis Roy, Cécile Capponi, François Laviolette, Baptiste Bauvin

Publication date: 29 December 2020

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-020-05902-7

zbMATH Keywords

boostingensemble methodsgreedy optimizationPAC-Bayes\( \mathcal{C} \)-bound

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Uses Software

• SHOGUN
• UCI-ml
• AdaBoost.MH
• MNIST
• AdaBoost-SAMME

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Bagging predictors
• A decision-theoretic generalization of on-line learning and an application to boosting
• PAC-Bayesian stochastic model selection
• Some PAC-Bayesian theorems
• PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
• A theory of the learnable
• 10.1162/jmlr.2003.3.4-5.723
• Random forests
• Linear programming boosting via column generation

This page was built for publication: Fast greedy \(\mathcal{C} \)-bound minimization with guarantees