Learning to Mutate with Hypergradient Guided Population

Computing the gradient of model hyperparameters, i. e. , hypergradient, enables a promising and natural way to solve the hyperparameter optimization task. However, gradient-based methods could lead to suboptimal solutions due to the non-convex nature of optimization in a complex hyperparameter space. In this study, we propose a hyperparameter mutation (HPM) algorithm to explicitly consider a learnable trade-off between using global and local search, where we adopt a population of student models to simultaneously explore the hyperparameter space guided by hypergradient and leverage a teacher model to mutate the underperforming students by exploiting the top ones. The teacher model is implemented with an attention mechanism and is used to learn a mutation schedule for different hyperparameters on the fly. Empirical evidence on synthetic functions is provided to show that HPM outperforms hypergradient significantly. Experiments on two benchmark datasets are also conducted to validate the effectiveness of the proposed HPM algorithm for training deep neural networks compared with several strong baselines.

Authors

• Zhiqiang Tao Rochester Institute of Technology
• Yaliang Li Alibaba Group
• Bolin Ding
• Ce Zhang Institute of Automation, CASIA & School of Artificial Intelligence, UCAS
• Jingren Zhou Alibaba Group
• Yun Fu Northeastern University

Keywords

No keywords are indexed for this paper.