Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
Abstrak
Performance of machine learning algorithms depends critically on identifying a good set of hyperparameters. While recent approaches use Bayesian optimization to adaptively select configurations, we focus on speeding up random search through adaptive resource allocation and early-stopping. We formulate hyperparameter optimization as a pure-exploration non-stochastic infinite-armed bandit problem where a predefined resource like iterations, data samples, or features is allocated to randomly sampled configurations. We introduce a novel algorithm, Hyperband, for this framework and analyze its theoretical properties, providing several desirable guarantees. Furthermore, we compare Hyperband with popular Bayesian optimization methods on a suite of hyperparameter optimization problems. We observe that Hyperband can provide over an order-of-magnitude speedup over our competitor set on a variety of deep-learning and kernel-based learning problems.
Topik & Kata Kunci
Penulis (5)
Lisha Li
Kevin G. Jamieson
Giulia DeSalvo
A. Rostamizadeh
Ameet Talwalkar
Akses Cepat
PDF tidak tersedia langsung
Cek di sumber asli →- Tahun Terbit
- 2016
- Bahasa
- en
- Total Sitasi
- 2706×
- Sumber Database
- Semantic Scholar
- Akses
- Open Access ✓