论文信息 - Why every GBDT speed benchmark is wrong

Why every GBDT speed benchmark is wrong

This article provides a comprehensive study of different ways to make speed benchmarks of gradient boosted decision trees algorithm. We show main problems of several straight forward ways to make benchmarks, explain, why a speed benchmarking is a challenging task and provide a set of reasonable requirements for a benchmark to be fair and useful.

Anna Veronika Dorogush | Dmitry Kruchinin | Vasily Ershov | Vasily Ershov | Dmitry Kruchinin

[1] Tianqi Chen,et al. XGBoost: A Scalable Tree Boosting System , 2016, KDD.

[2] B. Roe,et al. Boosted decision trees as an alternative to artificial neural networks for particle identification , 2004, physics/0408124.

[3] Tie-Yan Liu,et al. LightGBM: A Highly Efficient Gradient Boosting Decision Tree , 2017, NIPS.

[4] Yanru Zhang,et al. A gradient boosting method to improve travel time prediction , 2015 .

[5] Anna Veronika Dorogush,et al. Fighting biases with dynamic boosting , 2017, ArXiv.

[6] Qiang Wu,et al. Adapting boosting for information retrieval measures , 2010, Information Retrieval.

[7] Rich Caruana,et al. An empirical comparison of supervised learning algorithms , 2006, ICML.