Why every GBDT speed benchmark is wrong

Dorogush, Anna Veronika, Ershov, Vasily, Kruchinin, Dmitriy

arXiv.org Machine Learning 

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

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found