Research map / Learning theory and algorithms / Prediction and decision losses
Cost efficient gradient boosting
Sven Peter, Ferran Diego, Fred A. Hamprecht, Boaz Nadler
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Best-first (leaf-wise) tree growth instead of breadth-first growth, with leaf count limit (ablation) | CEGB tree construction · Yahoo! LTR (fixed cost budget) | Average Precision@5 at given prediction cost | Improved |
| Shallow trees (16 leaves, depth 4) under CEGB instead of deep trees (ablation) | CEGB · Yahoo! LTR (feature + evaluation cost) | cost-accuracy tradeoff vs GreedyMiser | Improved |
| Allowing deep branches (unrestricted depth, leaf-limited) in CEGB | CEGB vs GreedyMiser · Yahoo! LTR (feature + evaluation cost) | accuracy at prediction cost | Improved |
| Training with uniform feature cost (beta=1) and applying original costs only at test time (ablation) | CEGB · Yahoo! LTR | cost-accuracy tradeoff | No clear effect |
| Large feature-cost penalty lambda (0.001 is too small/ lower accuracy); larger lambda reaches similar accuracy at much cheaper cost (ablation) | CEGB · Yahoo! LTR | accuracy vs cost | Mixed |
| Multi-scale features (coarse-resolution features shared across pixel blocks) with evaluation-cost-dominated setting | CEGB · Flies video multi-scale classification (SEGMeasure) | evaluation cost at similar accuracy | Improved |
| CEGB vs GreedyMiser and BudgetPrune under equal-contribution costs on MiniBooNE, Covertype, HEPMASS, Yahoo binarized | CEGB · Multiple datasets | cost-accuracy tradeoff | Improved |
Closest papers by meaning
- Boulevard: Regularized Stochastic Gradient Boosted Trees and Their Limiting Distribution (JMLR 2022 · similarity 0.87)
- Regularized Gradient Boosting (NeurIPS 2019 · similarity 0.87)
- Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees (CVPR 2022 · similarity 0.87)
- LightGBM: A Highly Efficient Gradient Boosting Decision Tree (NeurIPS 2017 · similarity 0.86)
- Statistical Inference for Gradient Boosting Regression (NeurIPS 2025 · similarity 0.85)
- NRGBoost: Energy-Based Generative Boosted Trees (ICLR 2025 · 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.
