홈 › Papers

A Non-asymptotic Analysis for Learning and Applying a Preconditioner in MCMC

Preconditioning is a common method applied to modify Markov chain Monte Carlo algorithms with the goal of making them more efficient. In practice it is often extremely effective, even when the preconditioner is learned from the chain. We analyse and compare the finite-time computational costs of schemes which learn a preconditioner based on the target covariance or the expected Hessian of the target potential with that of a corresponding scheme that does not use preconditioning. We apply our results to various algorithms including the Unadjusted Langevin Algorithm (ULA) and the proximal sampler for an appropriately regular target, establishing non-asymptotic guarantees for versions of these algorithms that learn and use preconditioners. To do so, we establish non-asymptotic guarantees on the time taken to collect $N$ approximately independent samples from the target for schemes that learn their preconditioners under the assumption that the underlying Markov chain satisfies a contraction condition in the Wasserstein-2 distance. This approximate independence condition, that we formalize, allows us to bridge the non-asymptotic bounds of modern MCMC theory and classical heuristics of effective sample size and mixing time, and is needed to amortise the costs of learning a preconditioner across the many samples it will be used to produce.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반