Lazy Paired Hyper-Parameter Tuning
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1924-1930.
Abstract
In virtually all machine learning applications, hyper-parameter tuning is required to maximize predictive accuracy. Such tuning is computationally expensive, and the cost is further exacerbated by the need for multiple evaluations (via cross-validation or bootstrap) at each configuration setting to guarantee statistically significant results. This paper presents a simple, general technique for improving the efficiency of hyper-parameter tuning by minimizing the number of resampled evaluations at each configuration. We exploit the fact that train-test samples can easily be matched across candidate hyper-parameter configurations. This permits the use of paired hypothesis tests and power analysis that allow for statistically sound early elimination of suboptimal candidates to minimize the number of evaluations. Results on synthetic and real-world datasets demonstrate that our method improves over competitors for discrete parameter settings, and enhances state-of-the-art techniques for continuous parameter settings.
@inproceedings{ijcai2013p284,
title = {Lazy Paired Hyper-Parameter Tuning},
author = {Zheng, Alice X. and Bilenko, Mikhail},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1924--1930},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/284},
}
TY - CPAPER TI - Lazy Paired Hyper-Parameter Tuning AU - Zheng, Alice X. AU - Bilenko, Mikhail T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1924 EP - 1930 UR - https://ijcai.org/proceedings/2013/284 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: