pith. sign in

arxiv: 1604.01348 · v1 · pith:QZDPGLLYnew · submitted 2016-04-05 · 📊 stat.ML · cs.LG

Bayesian Optimization with Exponential Convergence

classification 📊 stat.ML cs.LG
keywords optimizationbayesianconvergenceexponentialauxiliarydelta-covermethodsampling
0
0 comments X
read the original abstract

This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard to implement in practice. Also, the existing Bayesian optimization method with exponential convergence requires access to the delta-cover sampling, which was considered to be impractical. Our approach eliminates both requirements and achieves an exponential convergence rate.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Bayesian Optimistic Optimisation with Exponentially Decaying Regret

    cs.LG 2021-05 unverdicted novelty 7.0

    BOO achieves exponentially decaying regret O(N^{-√N}) by combining Bayesian optimisation and partitioning-based optimistic optimisation for Matérn GP functions with ν > 4 + D/2.