LGMLSep 16, 2019

Learning to Tune XGBoost with XGBoost

arXiv:1909.07218v413 citations
Originality Incremental advance
AI Analysis

This is an incremental improvement for machine learning practitioners needing efficient hyperparameter optimization.

The paper tackles hyperparameter tuning for gradient-boosted decision trees by proposing MeSH, a meta-learning variant of successive halving, and shows it often outperforms standard successive halving and random search, using data from 95 datasets.

In this short paper we investigate whether meta-learning techniques can be used to more effectively tune the hyperparameters of machine learning models using successive halving (SH). We propose a novel variant of the SH algorithm (MeSH), that uses meta-regressors to determine which candidate configurations should be eliminated at each round. We apply MeSH to the problem of tuning the hyperparameters of a gradient-boosted decision tree model. By training and tuning our meta-regressors using existing tuning jobs from 95 datasets, we demonstrate that MeSH can often find a superior solution to both SH and random search.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes