paper-with-me

홈 › Papers

No-Regret Bayesian Optimization with Unknown Hyperparameters

2019-01-10 · Felix Berkenkamp, Angela P. Schoellig, Andreas Krause

Bayesian optimization (BO) based on Gaussian process models is a powerful paradigm to optimize black-box functions that are expensive to evaluate. While several BO algorithms provably converge to the global optimum of the unknown function, they assume that the hyperparameters of the kernel are known in advance. This is not the case in practice and misspecification often causes these algorithms to converge to poor local optima. In this paper, we present the first BO algorithm that is provably no-regret and converges to the optimum without knowledge of the hyperparameters. During optimization we slowly adapt the hyperparameters of stationary kernels and thereby expand the associated function class over time, so that the BO algorithm considers more complex function candidates. Based on the theoretical insights, we propose several practical algorithms that achieve the empirical sample efficiency of BO with online hyperparameter estimation, but retain theoretical convergence guarantees. We evaluate our method on several benchmark problems.

📄 PDF Abstract BibTeX arXiv:1901.03357

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian Optimization

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Online Sharp-Calibrated Bayesian Optimization

2026-05-11 · Marshal Arijona Sinaga, Julien Martinelli, Teemu Turpeinen, Samuel Kaski arxiv

Bayesian optimization (BO) is a widely used framework for optimizing expensive black-box functions, commonly based on Gaussian process (GP) surrogate models. Its effectiveness relies on uncertainty quantification that is…

Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior

2018-11-23 · NeurIPS 2018 12 · Zi Wang, Beomjoon Kim, Leslie Pack Kaelbling

Bayesian optimization usually assumes that a Bayesian prior is given. However, the strong theoretical guarantees in Bayesian optimization are often regrettably compromised in practice because of unknown parameters in the…

Bayesian OptimizationMotion PlanningTask and Motion Planning

Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal

2024-10-14 · Juliusz Ziomek, Masaki Adachi, Michael A. Osborne

Bayesian Optimization (BO) is widely used for optimising black-box functions but requires us to specify the length scale hyperparameter, which defines the smoothness of the functions the optimizer will consider. Most cur…

Bayesian OptimisationBayesian Optimization

Hyperparameters Optimization in Deep Convolutional Neural Network / Bayesian Approach with Gaussian Process Prior

2017-12-19 · Pushparaja Murugan

Convolutional Neural Network is known as ConvNet have been extensively used in many complex machine learning tasks. However, hyperparameters optimization is one of a crucial step in developing ConvNet architectures, sinc…

Bayesian Optimization

No-Regret Algorithms for Time-Varying Bayesian Optimization

2021-02-11 · Xingyu Zhou, Ness Shroff

In this paper, we consider the time-varying Bayesian optimization problem. The unknown function at each time is assumed to lie in an RKHS (reproducing kernel Hilbert space) with a bounded norm. We adopt the general varia…

Bayesian Optimization