Fast Bayesian hyperparameter optimization on large datasets
Author(s) -
Aaron Klein,
Stefan Falkner,
Simon Bartels,
Philipp Hennig,
Frank Hutter
Publication year - 2017
Publication title -
electronic journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.482
H-Index - 54
ISSN - 1935-7524
DOI - 10.1214/17-ejs1335si
Subject(s) - hyperparameter , bayesian optimization , machine learning , hyperparameter optimization , artificial intelligence , computer science , artificial neural network , bayesian probability , set (abstract data type) , support vector machine , programming language
Bayesian optimization has become a successful tool for optimizing the hyperparameters of machine learning algorithms, such as support vector machines or deep neural networks. Despite its success, for large datasets, training and validating a single configuration often takes hours, days, or even weeks, which limits the achievable performance. To accelerate hyperparameter optimization, we propose a generative model for the validation error as a function of training set size, which is learned during the optimization process and allows exploration of preliminary configurations on small subsets, by extrapolating to the full dataset. We construct a Bayesian optimization procedure, dubbed Fabolas, which models loss and training time as a function of dataset size and automatically trades off high information gain about the global optimum against computational cost. Experiments optimizing support vector machines and deep neural networks show that Fabolas often finds high-quality solutions 10 to 100 times faster than other state-of-the-art Bayesian optimization methods or the recently proposed bandit strategy Hyperband.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom