Different Paradigms for Choosing Sequential Reweighting Algorithms

DOI10.1162/089976604322860712MaRDI QIDQ4819817zbMATH OpenOpenAlexFDO

Authors Gilles Blanchard

Publication date 5 October 2004

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976604322860712

zbMATH Keywords

boosting-type algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2089372
• Efficient margin maximizing with boosting
• Soft margins for AdaBoost
• Parallelizing AdaBoost by weights dynamics
• Logistic regression, AdaBoost and Bregman distances

Cites work

• A general class of adaptive strategies
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• An analog of the minimax theorem for vector payoffs
• Arcing classifiers. (With discussion)
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Random forests
• Soft margins for AdaBoost

Cited in

(2)

• Optimal dyadic decision trees
• A re-weighting strategy for improving margins

This page was built for publication: Different Paradigms for Choosing Sequential Reweighting Algorithms

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