Scalable Bayesian Optimization with Sparse Gaussian Process Models
Ang Yang

TL;DR
This paper introduces scalable Bayesian optimization techniques that leverage derivative information and sparse Gaussian process models to improve convergence speed and handle large datasets efficiently.
Contribution
It presents novel methods combining derivative-enhanced Bayesian optimization with scalable GPs for large-scale problems.
Findings
Accelerated convergence using derivative information.
Effective handling of large datasets with sparse GPs.
Improved scalability of Bayesian optimization.
Abstract
This thesis focuses on Bayesian optimization with the improvements coming from two aspects:(i) the use of derivative information to accelerate the optimization convergence; and (ii) the consideration of scalable GPs for handling massive data.
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
TopicsGaussian Processes and Bayesian Inference · Advanced Multi-Objective Optimization Algorithms · Advanced Bandit Algorithms Research
MethodsGreedy Policy Search
