Research map / Learning theory and algorithms / Prediction and decision losses
Boosting with Tempered Exponential Measures
Read the paperCheck your idea against 108,967 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.85)
- A Boosting-Type Convergence Result for AdaBoost.MH with Factorized Multi-Class Classifiers (NeurIPS 2024 · similarity 0.85)
- Learning Augmented Exact Exponential Algorithms (NeurIPS 2026 · similarity 0.85)
- Sample-Optimal Agnostic Boosting with Unlabeled Data (ICML 2025 · similarity 0.84)
- The Generative Leap: Tight Sample Complexity for Efficiently Learning Gaussian Multi-Index Models (NeurIPS 2025 · similarity 0.84)
- Gradient Regularized Newton Boosting Trees with Global Convergence (NeurIPS 2026 · similarity 0.84)
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.