A Tutorial on Bayesian Optimization
원문 초록
Bayesian optimization is an approach to optimizing objective functions that take a long time (minutes or hours) to evaluate. It is best-suited for optimization over continuous domains of less than 20 dimensions, and tolerates stochastic noise in function evaluations. It builds a surrogate for the objective and quantifies the uncertainty in that surrogate using a Bayesian machine learning technique, Gaussian process regression, and then uses an acquisition function defined from this surrogate to decide where to sample. In this tutorial, we describe how Bayesian optimization works, including Gaussian process regression and three common acquisition functions: expected improvement, entropy search, and knowledge gradient. We then discuss more advanced techniques, including running multiple function evaluations in parallel, multi-fidelity and multi-information source optimization, expensive-to-evaluate constraints, random environmental conditions, multi-task Bayesian optimization, and the inclusion of derivative information. We conclude with a discussion of Bayesian optimization software and future research directions in the field. Within our tutorial material we provide a generalization of expected improvement to noisy evaluations, beyond the noise-free setting where it is more commonly applied. This generalization is justified by a formal decision-theoretic argument, standing in contrast to previous ad hoc modifications.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Distributional encoding for Gaussian process regression with qualitative inputs
BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL
Interim Report on Human-Guided Adaptive Hyperparameter Optimization with Multi-Fidelity Sprints
Multitask LSTM for Arboviral Outbreak Prediction Using Public Health Data
Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.