Bayesian Optimization with Exponential Convergence
Kenji Kawaguchi, Leslie Pack Kaelbling, Tom\'as Lozano-P\'erez

TL;DR
This paper introduces a Bayesian optimization technique that guarantees exponential convergence without auxiliary optimization or delta-cover sampling, making it more practical and efficient.
Contribution
It proposes a novel Bayesian optimization method that removes the need for auxiliary optimization and delta-cover sampling, achieving exponential convergence.
Findings
Achieves exponential convergence rate in Bayesian optimization
Eliminates auxiliary optimization and delta-cover sampling requirements
Simplifies implementation and improves practicality
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Sparse and Compressive Sensing Techniques · Gaussian Processes and Bayesian Inference
