Skip to main content
Article
Amortized auto-tuning: Cost-efficient transfer optimization for hyperparameter recommendation
arXiv
  • Yuxin Xiao, Carnegie Mellon University, United States
  • Eric P. Xing, Carnegie Mellon University, United States & Petuum Inc. & Mohamed bin Zayed University of Artificial Intelligence
  • Willie Neiswanger, Stanford University & Petuum
Document Type
Article
Abstract

With the surge in the number of hyperparameters and training times of modern machine learning models, hyperparameter tuning is becoming increasingly expensive. Although methods have been proposed to speed up tuning via knowledge transfer, they typically require the final performance of hyperparameters and do not focus on low-fidelity information. Nevertheless, this common practice is suboptimal and can incur an unnecessary use of resources. It is more cost-efficient to instead leverage the low-fidelity tuning observations to measure inter-task similarity and transfer knowledge from existing to new tasks accordingly. However, performing multi-fidelity tuning comes with its own challenges in the transfer setting: the noise in the additional observations and the need for performance forecasting. Therefore, we conduct a thorough analysis of the multi-task multi-fidelity Bayesian optimization framework, which leads to the best instantiation-AmorTized Auto-Tuning (AT2). We further present an offline-computed 27-task Hyperparameter Recommendation (HyperRec) database to serve the community. Extensive experiments on HyperRec and other real-world databases illustrate the effectiveness of our AT2 method. Copyright © 2021, The Authors. All rights reserved.

DOI
10.48550/arXiv.2106.09179
Publication Date
6-17-2021
Keywords
  • Artificial Intelligence (cs.AI),
  • Machine Learning (cs.LG),
  • Machine Learning (stat.ML)
Comments

IR Deposit conditions: non-described

Preprint: arXiv

Citation Information
Y. Xiao, E. Xing, and W. Neiswanger, "Amortized auto-tuning: Cost-efficient transfer optimization for hyperparameter recommendation", arXiv, Jun. 2021, doi: 10.48550/arXiv.2106.09179