Fast Calculation of the Knowledge Gradient for Optimization of Deterministic Engineering Simulations
원문 초록
A novel efficient method for computing the Knowledge-Gradient policy for Continuous Parameters (KGCP) for deterministic optimization is derived. The differences with Expected Improvement (EI), a popular choice for Bayesian optimization of deterministic engineering simulations, are explored. Both policies and the Upper Confidence Bound (UCB) policy are compared on a number of benchmark functions including a problem from structural dynamics. It is empirically shown that KGCP has similar performance as the EI policy for many problems, but has better convergence properties for complex (multi-modal) optimization problems as it emphasizes more on exploration when the model is confident about the shape of optimal regions. In addition, the relationship between Maximum Likelihood Estimation (MLE) and slice sampling for estimation of the hyperparameters of the underlying models, and the complexity of the problem at hand, is studied.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
Reinforcement Learning Increases Wind Farm Power Production by Enabling Closed-Loop Collaborative Control
Fast Bayesian Optimization of Function Networks with Partial Evaluations
Amortized variational transdimensional inference
VirnyFlow: A Design Space for Responsible Model Development
Bridging Quantum and Classical Computing in Drug Design: Architecture Principles for Improved Molecule Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.