MCMC Methods for Functions: Modifying Old Algorithms to Make Them Faster
S. L. Cotter, G. O. Roberts, A. M. Stuart, D. White

TL;DR
This paper introduces modified MCMC algorithms for function spaces that maintain convergence speed under mesh refinement, applicable to Gaussian and certain non-Gaussian measures, with broad applications in statistics and physics.
Contribution
The paper presents a novel approach to adapt MCMC methods for functions, ensuring mesh-independent convergence speed and broadening applicability to Gaussian and non-Gaussian reference measures.
Findings
Algorithms show significant speed-up in applications
Applicable to density estimation, fluid mechanics, geophysics, image registration
Maintains robustness under mesh refinement
Abstract
Many problems arising in applications result in the need to probe a probability distribution for functions. Examples include Bayesian nonparametric statistics and conditioned diffusion processes. Standard MCMC algorithms typically become arbitrarily slow under the mesh refinement dictated by nonparametric description of the unknown function. We describe an approach to modifying a whole range of MCMC methods, applicable whenever the target measure has density with respect to a Gaussian process or Gaussian random field reference measure, which ensures that their speed of convergence is robust under mesh refinement. Gaussian processes or random fields are fields whose marginal distributions, when evaluated at any finite set of points, are -valued Gaussians. The algorithmic approach that we describe is applicable not only when the desired probability measure has density…
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.
