paper-with-me

홈 › Papers

Improving Hyperparameter Optimization by Planning Ahead

2021-10-15 · Hadi S. Jomaa, Jonas Falkner, Lars Schmidt-Thieme

Hyperparameter optimization (HPO) is generally treated as a bi-level optimization problem that involves fitting a (probabilistic) surrogate model to a set of observed hyperparameter responses, e.g. validation loss, and consequently maximizing an acquisition function using a surrogate model to identify good hyperparameter candidates for evaluation. The choice of a surrogate and/or acquisition function can be further improved via knowledge transfer across related tasks. In this paper, we propose a novel transfer learning approach, defined within the context of model-based reinforcement learning, where we represent the surrogate as an ensemble of probabilistic models that allows trajectory sampling. We further propose a new variant of model predictive control which employs a simple look-ahead strategy as a policy that optimizes a sequence of actions, representing hyperparameter candidates to expedite HPO. Our experiments on three meta-datasets comparing to state-of-the-art HPO algorithms including a model-free reinforcement learning approach show that the proposed method can outperform all baselines by exploiting a simple planning-based policy.

📄 PDF Abstract BibTeX arXiv:2110.08028

Code (0)

등록된 구현이 없습니다.

Tasks

Hyperparameter OptimizationModel-based Reinforcement LearningModel Predictive Controlreinforcement-learningReinforcement LearningReinforcement Learning (RL)Transfer Learning

Methods 이 논문이 사용한 방법론

HPO In machine learning, a hyperparameter is a parameter whose value is used to control learning process, and HPO is the problem of choosing a set of optimal hyperparameters for a…

Similar Papers 제목 키워드 기반

Understanding Lookahead Dynamics Through Laplace Transform

2025-06-16 · Aniket Sanyal, Tatjana Chavdarova

We introduce a frequency-domain framework for convergence analysis of hyperparameters in game optimization, leveraging High-Resolution Differential Equations (HRDEs) and Laplace transforms. Focusing on the Lookahead algo…

The Planning-ahead SMO Algorithm

2013-07-31 · Tobias Glasmachers

The sequential minimal optimization (SMO) algorithm and variants thereof are the de facto standard method for solving large quadratic programs for support vector machine (SVM) training. In this paper we propose a simple …

Multi-step Planning for Automated Hyperparameter Optimization with OptFormer

2022-10-10 · Lucio M. Dery, Abram L. Friesen, Nando de Freitas, Marc'Aurelio Ranzato 외

As machine learning permeates more industries and models become more expensive and time consuming to train, the need for efficient automated hyperparameter optimization (HPO) has never been more pressing. Multi-step plan…

Hyperparameter Optimization

Multistep Brent Oil Price Forecasting with a Multi-Aspect Meta-heuristic Optimization and Ensemble Deep Learning Model

2024-07-15 · Mohammed Alruqimi, Luca Di Persio

Accurate crude oil price forecasting is crucial for various economic activities, including energy trading, risk management, and investment planning. Although deep learning models have emerged as powerful tools for crude …

energy tradingfeature selectionManagementMetaheuristic Optimization+1

EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimization

2024-10-31 · Mujin Cheon, Jay H. Lee, Dong-Yeun Koh, Calvin Tsay

Conventional methods for Bayesian optimization (BO) primarily involve one-step optimal decisions (e.g., maximizing expected improvement of the next step). To avoid myopic behavior, multi-step lookahead BO algorithms such…

Bayesian OptimizationDecision MakingHyperparameter OptimizationReinforcement Learning (RL)+1