Research map / Optimization / Optimizers
Multiclass Boosting: Margins, Codewords, Losses, and Algorithms
Mohammad Saberian, Nuno Vasconcelos
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- A Boosting-Type Convergence Result for AdaBoost.MH with Factorized Multi-Class Classifiers (NeurIPS 2024 · similarity 0.88)
- Multiclass Boosting and the Cost of Weak Learning (NeurIPS 2021 · similarity 0.88)
- Online multiclass boosting (NeurIPS 2017 · similarity 0.88)
- CatBoost: unbiased boosting with categorical features (NeurIPS 2018 · similarity 0.87)
- The Many Faces of Optimal Weak-to-Strong Learning (NeurIPS 2024 · similarity 0.86)
- Robust Minimax Boosting with Performance Guarantees (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
