Research map / Optimization / Optimizers
Boulevard: Regularized Stochastic Gradient Boosted Trees and Their Limiting Distribution
Yichen Zhou, Giles Hooker
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 |
|---|---|---|---|
| use Boulevard (BLV, rBLV) instead of RF, GBT, SGBT | tree ensembles · simulated data, n=5000 | train/test error | Mixed |
| set lambda to 0.8 rather than 0.2 or 0.5 (ablation) | Boulevard · simulated data | test error: lambda 0.2, 0.5, 0.8; 0.8 best | Improved |
| make tree structure adaptive to gradients (BLV vs rBLV) (ablation) | Boulevard · simulated data | test error | Improved |
| Boulevard vs other ensembles on real data | tree ensembles · UCI Boston, Power Plant, Protein, Airfoil (5-fold CV) | train/test error | No clear effect |
| compare Boulevard to kernel ridge regression | non-adaptive Boulevard · simulated d=5, n=200 | prediction agreement, MSE | No clear effect |
Closest papers by meaning
- Statistical Inference for Gradient Boosting Regression (NeurIPS 2025 · similarity 0.91)
- Regularized Gradient Boosting (NeurIPS 2019 · similarity 0.89)
- Gradient Regularized Newton Boosting Trees with Global Convergence (NeurIPS 2026 · similarity 0.88)
- Minimax Rates and Spectral Distillation for Tree Ensembles (NeurIPS 2026 · similarity 0.86)
- Large Stepsizes Accelerate Gradient Descent for Regularized Logistic Regression (NeurIPS 2025 · similarity 0.85)
- Gradient Descent Converges Arbitrarily Fast for Logistic Regression via Large and Adaptive Stepsizes (ICML 2025 · similarity 0.85)
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.
