Research map / Learning theory and algorithms / Prediction and decision losses
BoostTree and BoostForest for Ensemble Learning
Changming Zhao, Dongrui Wu, Jian Huang, Ye Yuan, Hai‐Tao Zhang, Ruimin Peng, Zhenhua Shi
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 |
|---|---|---|---|
| BoostTree ensemble with bootstrapping and random parameter pool (BoostForest) vs single BoostTree (ablation) | BoostTree · 32 datasets | datasets won: BoostForest outperformed BoostTree on all 32 datasets | Improved |
| use Extra-Tree in the BoostForest ensembling strategy (ETForest) | Extra-Tree · 32 datasets | datasets won: 30 of 32 datasets | Improved |
| use M5P in the BoostForest ensembling strategy (ModelForest) | M5P · 16 regression datasets | datasets won: 16 of 16 datasets | Improved |
| use LMT in the BoostForest ensembling strategy (LMForest) | LMT · 16 classification datasets | datasets won: 6 of 16 datasets | No clear effect |
| replace ridge regression node function with ELM, then ensemble into BoostForest-ELM | BoostTree-ELM · 15 regression datasets | significant wins: 13 (15) datasets vs ELM (BoostTree-ELM) | Improved |
| replace ridge regression node function with SVR, then ensemble into BoostForest-SVR | BoostTree-SVR · 15 regression datasets | significant wins: 14 (15) datasets vs SVR (BoostTree-SVR) | Improved |
| use complex nonlinear node functions (ELM, SVR) in a single BoostTree (ablation) | BoostTree · 15 regression datasets | RMSE | Hurt |
| use CNN node function in BoostForest instead of 150-epoch Bagging-CNN | BoostForest-CNN · MNIST | accuracy: 0.9871 -> 0.9887 | Improved |
| use DNN node function in BoostForest instead of 150-epoch Bagging-DNN | BoostForest-DNN · HIGGS | accuracy: 0.7873 -> 0.7886 | Improved |
| BoostForest vs Bagging-LightGBM with 600 LightGBMs | BoostForest · 18 classification datasets | datasets won: 14 of the 18 | Improved |
| BoostForest vs BaggedTAO-l | BoostForest · 17 classification datasets | datasets won: 16 of the 17 | Improved |
| BoostForest vs MultiBoosting | BoostForest · 15 classification datasets | average accuracy: 0.8458 -> 0.8669 | Improved |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- LightGBM — LightGBM: A Highly Efficient Gradient Boosting Decision Tree (NeurIPS 2017) · better on 4 of 4 shared results
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- Smaller, more accurate regression forests using tree alternating optimization (ICML 2020 · similarity 0.86)
- Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees (CVPR 2022 · similarity 0.86)
- Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles (AAAI 2025 · similarity 0.86)
- Compressing tree ensembles through Level-wise Optimization and Pruning (ICML 2025 · similarity 0.84)
- Minimax Rates and Spectral Distillation for Tree Ensembles (NeurIPS 2026 · similarity 0.83)
- NRGBoost: Energy-Based Generative Boosted Trees (ICLR 2025 · similarity 0.82)
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.
