Entropy Regularized LPBoost

DOI10.1007/978-3-540-87987-9_23MaRDI QIDQ3529927zbMATH OpenOpenAlexFDO

Authors Karen A. Glocer, S. V. N. Vishwanathan, Manfred K. Warmuth

Publication date 14 October 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-87987-9_23

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Linear programming boosting via column generation
• Soft margins for AdaBoost
• Boosting. Foundations and algorithms.
• scientific article; zbMATH DE number 2089372
• Boosting as a regularized path to a maximum margin classifier

Cited in

(6)

• On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
• Fully corrective boosting with arbitrary loss and regularization
• Novel approaches to entropic regularization
• Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
• Soft margins for AdaBoost
• Linear programming boosting via column generation

This page was built for publication: Entropy Regularized LPBoost

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