Faster Improvement Rate Population Based Training
arXiv:2109.13800
Abstract
The successful training of neural networks typically involves careful and time consuming hyperparameter tuning. Population Based Training (PBT) has recently been proposed to automate this process. PBT trains a population of neural networks concurrently, frequently mutating their hyperparameters throughout their training. However, the decision mechanisms of PBT are greedy and favour short-term improvements which can, in some cases, lead to poor long-term performance. This paper presents Faster Improvement Rate PBT (FIRE PBT) which addresses this problem. Our method is guided by an assumption: given two neural networks with similar performance and training with similar hyperparameters, the network showing the faster rate of improvement will lead to a better final performance. Using this, we derive a novel fitness metric and use it to make some of the population members focus on long-term performance. Our experiments show that FIRE PBT is able to outperform PBT on the ImageNet benchmark and match the performance of networks that were trained with a hand-tuned learning rate schedule. We apply FIRE PBT to reinforcement learning tasks and show that it leads to faster learning and higher final performance than both PBT and random hyperparameter search.
arXiv comment9 pages, 5 figures
References in corpus (7)
- Practical Bayesian Optimization of Machine Learning Algorithms
- Accurate, Large Minibatch SGD: Training ImageNet in 1 Hour
- A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
- Human-level performance in first-person multiplayer games with population-based deep reinforcement learning
- Batch Bayesian Optimization via Local Penalization
- Freeze-Thaw Bayesian Optimization
- Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions