Why every GBDT speed benchmark is wrong

10/24/2018
by   Anna Veronika Dorogush, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2021

YAHPO Gym – Design Criteria and a new Multifidelity Benchmark for Hyperparameter Optimization

When developing and analyzing new hyperparameter optimization (HPO) meth...
research
11/30/2006

Lossless fitness inheritance in genetic algorithms for decision trees

When genetic algorithms are used to evolve decision trees, key tree qual...
research
06/26/2011

Temporal Decision Trees: Model-based Diagnosis of Dynamic Systems On-Board

The automatic generation of decision trees based on off-line reasoning o...
research
11/23/2022

This is the way: designing and compiling LEPISZCZE, a comprehensive NLP benchmark for Polish

The availability of compute and data to train larger and larger language...
research
09/16/2022

Exploring the Whole Rashomon Set of Sparse Decision Trees

In any given machine learning problem, there may be many models that cou...
research
10/12/2021

Codabench: Flexible, Easy-to-Use and Reproducible Benchmarking for Everyone

Obtaining standardized crowdsourced benchmark of computational methods i...
research
03/04/2022

A Typology to Explore and Guide Explanatory Interactive Machine Learning

Recently, more and more eXplanatory Interactive machine Learning (XIL) m...

Please sign up or login with your details

Forgot password? Click here to reset