Maximizing the margin with boosting

DOI10.1007/3-540-45435-7_23MaRDI QIDQ3046716zbMATH OpenFDO

Authors Gunnar Rätsch, Manfred K. Warmuth

Publication date 12 August 2004

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/2375/23750334.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Efficient margin maximizing with boosting
• Learning Theory
• scientific article; zbMATH DE number 5251641
• Boosting as a regularized path to a maximum margin classifier
• Analysis of boosting algorithms using the smooth margin function

Cited in

(29)

• A Real generalization of discrete AdaBoost
• Improved generalization through explicit optimization of margins
• A re-weighting strategy for improving margins
• A new maximum margin algorithm for one-class problems and its boosting implementation
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Boosting a weak learning algorithm by majority
• On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
• Analysis of boosting algorithms using the smooth margin function
• Online boosting algorithms based on exponential and 0-1 loss
• The rate of convergence of AdaBoost
• Computing optimal hypotheses efficiently for boosting
• Boosting as a regularized path to a maximum margin classifier
• The dynamics of adaboost: cyclic behavior and convergence of margins
• Efficient margin maximizing with boosting
• Geometric bounds for generalization in boosting
• Entropy Regularized LPBoost
• Further results on the margin explanation of boosting: new algorithm and experiments
• Error bounds for aggressive and conservative AdaBoost
• On the generalization of soft margin algorithms
• Learning Theory
• Scaling boosting by margin-based inclusionof features and relations
• scientific article; zbMATH DE number 2101360 (Why is no real title available?)
• Different Paradigms for Choosing Sequential Reweighting Algorithms
• A selective boosting algorithm for maximizing the soft margin
• scientific article; zbMATH DE number 6253924 (Why is no real title available?)
• The synergy between PAV and AdaBoost
• The synergy between PAV and AdaBoost
• Soft margins for AdaBoost
• Linear programming boosting via column generation

This page was built for publication: Maximizing the margin with boosting

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