MCMC Methods for Functions: ModifyingOld Algorithms to Make Them Faster
Explore this paper's citation graph
Summary
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.
- Type
- article
- Published
- 2012-02-03
- Cited by
- 468
- References
- 79
- Access
- Open access
- OpenAlex
- https://openalex.org/W32131910
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:36562755
Keywords
Algorithm, Gaussian process, Measure (data warehouse), Gaussian, Markov chain Monte Carlo
References
- Interpolation of spatial data
- Monte Carlo Statistical Methods (Springer Texts in Statistics)
- Gaussian Markov Random Fields: Theory and Applications
- On the random walk metropolis algorithm for Gaussian random field priors and the gradient flow
- Bayesian field theory
- Bayesian numerical analysis
- Group Actions, Homeomorphisms, and Matching: A General Framework
- 6th International Congress on Industrial and Applied Mathematics Zürich, Switzerland, 16-20 July 2007
- Surface Matching via Currents
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods
- Atmospheric Modeling, Data Assimilation and Predictability
- Applications of MCMC methods on function spaces
- MCMC Using Hamiltonian Dynamics
- TestU01: A C library for empirical testing of random number generators
- Spectral gaps for a Metropolis–Hastings algorithm in infinite dimensions
- Optimal scalings for local Metropolis--Hastings chains on nonproduct targets in high dimensions
- Optimal tuning of the hybrid Monte Carlo algorithm
- Exponential convergence of Langevin distributions and their discrete approximations
- Bayesian data assimilation in shape registration
- Analysis of SPDEs arising in path sampling. Part I: The Gaussian case
Cited by
- Consistency and Fluctuations For Stochastic Gradient Langevin Dynamics
- On the random walk metropolis algorithm for Gaussian random field priors and the gradient flow
- Algorithms for Kullback-Leibler Approximation of Probability Measures in Infinite Dimensions
- Efficient Adaptive MCMC Through Precision Estimation
- Metropolis-Hastings algorithms for perturbations of Gaussian measures in high dimensions: Contraction properties and error bounds in the logconcave case
- Assessment of Sequential and Simultaneous Ensemble-based History Matching Methods for Weakly Non-linear Problems
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Massively Parallel Dimension Independent Adaptive Metropolis
- Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors
- Statistical and numerical methods for diffusion processes with multiple scales
- Assimilating Eulerian and Lagrangian data to quantify flow uncertainty in testbed oceanography models
- Accelerating Bayesian Inference in Computationally Expensive Computer Models Using Local and Global Approximations
- Transport maps for accelerated Bayesian computation
- Efficient MCMC and posterior consistency for Bayesian inverse problems
- Sequential Monte Carlo methods for Bayesian elliptic inverse problems
- A Bayesian Level Set Method for Geometric Inverse Problems
- Bayesian computation: a perspective on the current state, and sampling backwards and forwards
- A Bayesian framework for the validation of models for subsurface flows: synthetic experiments
- Iterative ensemble smoothers in the annealed importance sampling framework
- An adaptive independence sampler MCMC algorithm for infinite dimensional Bayesian inferences
Related papers
- Robust MCMC Sampling with Non-Gaussian and Hierarchical Priors in High Dimensions
- Bayesian methods for non-gaussian data modeling and applications
- A TV-Gaussian prior for infinite-dimensional Bayesian inverse problems and its numerical implementations
- An adaptive independence sampler MCMC algorithm for infinite dimensional Bayesian inferences
- Unsupervised Selection and Estimation of Non-Gaussian Mixtures for High Dimensional Data Analysis
- SPEEDING UP THE INFERENCE IN GAUSSIAN PROCESS MODELS
- Iterative importance sampling algorithms for parameter estimation problems
- Importance Gaussian Quadrature