mlsanityData to 14 Oct 2026

SketchBoost: Fast Gradient Boosted Decision Tree for Multioutput Problems

arXiv 2211.12858 ↗First posted 23 Nov 2022cs.LG stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 11 of its 54 references that are in the map. First posted on arXiv 23 Nov 2022.

Builds on

11 of 54 references.

References · 11

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  3. 2021Revisiting Deep Learning Models for Tabular Datacited by 740
  4. 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
  5. 2021Deep Neural Networks and Tabular Data: A Surveycited by 491
  6. 2014Sketching as a Tool for Numerical Linear Algebracited by 288
  7. 2019GBDT-MO: Gradient Boosted Decision Trees for Multiple Outputscited by 16
  8. 2021Simple Modifications to Improve Tabular Neural Networkscited by 14
  9. 2019Minimal Variance Sampling in Stochastic Gradient Boostingcited by 5
  10. 2013Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Boundscited by 3
  11. 2014Approximate Matrix Multiplication with Application to Linear Embeddingscited by 3

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 3; 2025: 2.

6 papers.