arXiv Analytics

Sign in

arXiv:1902.00532 [cs.LG]AbstractReferencesReviewsResources

Hyper-parameter Tuning under a Budget Constraint

Zhiyun Lu, Chao-Kai Chiang, Fei Sha

Published 2019-02-01Version 1

We study a budgeted hyper-parameter tuning problem, where we optimize the tuning result under a hard resource constraint. We propose to solve it as a sequential decision making problem, such that we can use the partial training progress of configurations to dynamically allocate the remaining budget. Our algorithm combines a Bayesian belief model which estimates the future performance of configurations, with an action-value function which balances exploration-exploitation tradeoff, to optimize the final output. It automatically adapts the tuning behaviors to different constraints, which is useful in practice. Experiment results demonstrate superior performance over existing algorithms, including the-state-of-the-art one, on real-world tuning tasks across a range of different budgets.

Related articles: Most relevant | Search more
arXiv:1909.13221 [cs.LG] (Published 2019-09-29)
Optimal Delivery with Budget Constraint in E-Commerce Advertising
arXiv:2312.05282 [cs.LG] (Published 2023-12-08)
Towards On-device Learning on the Edge: Ways to Select Neurons to Update under a Budget Constraint
arXiv:2103.12833 [cs.LG] (Published 2021-03-23)
Bandit Learning for Dynamic Colonel Blotto Game with a Budget Constraint