A Boosting Framework on Grounds of Online Learning
Tofigh Naghibi, Beat Pfister

TL;DR
This paper introduces a boosting framework based on online learning duality, enabling the development of versatile algorithms for sparse boosting, smooth-distribution boosting, and agnostic learning, leveraging online learning insights.
Contribution
It presents a novel boosting framework rooted in online learning duality, facilitating the creation of multiple new algorithms for diverse learning scenarios.
Findings
Developed algorithms for sparse boosting and smooth-distribution boosting.
Extended the framework to agnostic learning and double-projection online algorithms.
Demonstrated the framework's effectiveness through theoretical analysis.
Abstract
By exploiting the duality between boosting and online learning, we present a boosting framework which proves to be extremely powerful thanks to employing the vast knowledge available in the online learning area. Using this framework, we develop various algorithms to address multiple practically and theoretically interesting questions including sparse boosting, smooth-distribution boosting, agnostic learning and some generalization to double-projection online learning algorithms, as a by-product.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Machine Learning and Algorithms · Optimization and Search Problems
