Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions
From MaRDI portal
Publication:6193911
DOI10.1080/0305215x.2022.2144273MaRDI QIDQ6193911
No author found.
Publication date: 14 February 2024
Published in: Engineering Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Query efficient posterior estimation in scientific experiments via Bayesian active learning
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Efficient global optimization of expensive black-box functions
- Lipschitzian optimization without the Lipschitz constant
- A taxonomy of global optimization methods based on response surfaces
- pBO-2GP-3B: a batch parallel known/unknown constrained Bayesian optimization with feasibility classification and its applications in computational fluid dynamics
- Multi-fidelity optimization of super-cavitating hydrofoils
- An algorithm for fast optimal Latin hypercube design of experiments
- Safe Linear Thompson Sampling With Side Information
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function
This page was built for publication: Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions
