SketchBoost: Fast Gradient Boosted Decision Tree for Multioutput Problems
Leonid Iosipoi, Anton Vakhrushev
Abstract
Gradient Boosted Decision Tree (GBDT) is a widely-used machine learning algorithm that has been shown to achieve state-of-the-art results on many standard data science problems. We are interested in its application to multioutput problems when the output is highly multidimensional. Although there are highly effective GBDT implementations, their scalability to such problems is still unsatisfactory. In this paper, we propose novel methods aiming to accelerate the training process of GBDT in the multioutput scenario. The idea behind these methods lies in the approximate computation of a scoring function used to find the best split of decision trees. These methods are implemented in SketchBoost, which itself is integrated into our easily customizable Python-based GPU implementation of GBDT called Py-Boost. Our numerical study demonstrates that SketchBoost speeds up the training process of GBDT by up to over 40 times while achieving comparable or even better performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f4208813-a893-489f-8989-e9cf813d81caCited by top-tier papers4
- Learning Gradient Boosted Decision Trees with Algorithmic RecourseKentaro Kanamori, Ken Kobayashi, Takuya TakagiNeurIPS 2025 · 2 citations
- Fréchet Geodesic BoostingYidong Zhou, Su I Iao, Hans-Georg MüllerNeurIPS 2025
- Robust Watermarking on Gradient Boosting Decision TreesJun Woo Chung, Yingjie Lao, Weijie ZhaoAAAI 2026
- ScalaGBM: Memory Efficient GBDT Training for High-Dimensional Data on GPUBorui Xu, Zeyi Wen, Yao Chen, Weiguo Liu et al.KDD 2025
Builds on3
- TabNet: Attentive Interpretable Tabular LearningSercan Ö. Arik, Tomas PfisterAAAI 2021 · 2,148 citations
- Revisiting Deep Learning Models for Tabular DataYury Gorishniy, Ivan Rubachev, Valentin Khrulkov, Artem BabenkoNeurIPS 2021 · 1,847 citations
- Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay et al.ICLR 2021 · 41 citations
Related papers
- Quantized Training of Gradient Boosting Decision TreesYu Shi, Guolin Ke, Zhuoming Chen, Shuxin Zheng et al.NeurIPS 2022 · 51 citations
- Probabilistic Gradient Boosting Machines for Large-Scale Probabilistic RegressionOlivier Sprangers, Sebastian Schelter, Maarten de RijkeKDD 2021 · 38 citations
- Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision TreeLichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li et al.CCS 2025
- DeltaBoost: Gradient Boosting Decision Trees with Efficient Machine UnlearningZhaomin Wu, Junhui Zhu, Qinbin Li, Bingsheng HeSIGMOD 2023 · 18 citations
- Breiman meets Bellman: Non-Greedy Decision Trees with MDPsHector Kohler, Riad Akrour, Philippe PreuxKDD 2025
