Research map / Learning theory and algorithms / Sample complexity
Multiclass Boosting and the Cost of Weak Learning
Nataly Brukhim, Elad Hazan, Shay Moran, Indraneel Mukherjee, Robert E. Schapire
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
- The Many Faces of Optimal Weak-to-Strong Learning (NeurIPS 2024 · similarity 0.89)
- Weak-to-Strong Generalization Even in Random Feature Networks, Provably (ICML 2025 · similarity 0.88)
- Revisiting Agnostic Boosting (NeurIPS 2025 · similarity 0.88)
- Provable weak-to-strong generalization via benign overfitting (ICLR 2025 · similarity 0.88)
- Theoretical Analysis of Weak-to-Strong Generalization (NeurIPS 2024 · similarity 0.87)
- Relating Misfit to Gain in Weak-to-Strong Generalization Beyond the Squared Loss (ICML 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.
