Geometric bounds for generalization in boosting

DOI10.1007/3-540-44581-1_30MaRDI QIDQ3148820zbMATH OpenFDO

Authors Shie Mannor, Ron Meir

Publication date 22 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2111/21110461

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• On the existence of linear weak learners and applications to boosting
• Boosting. Foundations and algorithms.
• A consistent strategy for boosting algorithms
• Maximizing the margin with boosting
• Boosting in the presence of noise

Cited in

(5)

• A geometric approach to leveraging weak learners
• A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers
• Quantum adiabatic machine learning
• Theory of Classification: a Survey of Some Recent Advances
• On the existence of linear weak learners and applications to boosting

This page was built for publication: Geometric bounds for generalization in boosting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148820)