Approximate Sampling using an Accelerated Metropolis-Hastings based on Bayesian Optimization and Gaussian Processes
원문 초록
Markov Chain Monte Carlo (MCMC) methods have a drawback when working with a target distribution or likelihood function that is computationally expensive to evaluate, specially when working with big data. This paper focuses on Metropolis-Hastings (MH) algorithm for unimodal distributions. Here, an enhanced MH algorithm is proposed that requires less number of expensive function evaluations, has shorter burn-in period, and uses a better proposal distribution. The main innovations include the use of Bayesian optimization to reach the high probability region quickly, emulating the target distribution using Gaussian processes (GP), and using Laplace approximation of the GP to build a proposal distribution that captures the underlying correlation better. The experiments show significant improvement over the regular MH. Statistical comparison between the results from two algorithms is presented.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
LLINBO: Trustworthy LLM-in-the-Loop Bayesian Optimization
Turbocharging Gaussian Process Inference with Approximate Sketch-and-Project
Causal Discovery via Bayesian Optimization
Scalable Bayesian Optimization via Focalized Sparse Gaussian Processes
Constrained Bayesian Optimization under Bivariate Gaussian Process with Application to Cure Process Optimization
Wasserstein Barycenter Gaussian Process based Bayesian Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.