An Adaptive Independence Sampler MCMC Algorithm for Bayesian Inferences of Functions
From MaRDI portal
Publication:4641609
Recommendations
- Dimension-independent likelihood-informed MCMC
- On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference
- A hybrid adaptive MCMC algorithm in function spaces
- Proposals which speed up function-space MCMC
- Ensemble sampler for infinite-dimensional inverse problems
Cites work
- scientific article; zbMATH DE number 4031208 (Why is no real title available?)
- A computational framework for infinite-dimensional Bayesian inverse problems. II: stochastic Newton MCMC with application to ice sheet flow inverse problems
- A note on Metropolis-Hastings kernels for general state spaces
- A note on the Karhunen-Loève expansions for infinite-dimensional Bayesian inverse problems
- A stable manifold MCMC method for high dimensions
- A stochastic Newton MCMC method for large-scale statistical inverse problems with application to seismic inversion
- Adaptive construction of surrogates for the Bayesian solution of inverse problems
- Adaptive independent Metropolis-Hastings
- Algorithms for Kullback-Leibler approximation of probability measures in infinite dimensions
- An adaptive Metropolis algorithm
- An adaptive approach to Langevin MCMC
- An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
- An introduction to infinite-dimensional analysis
- Bayesian Nonparametrics
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Dimension-independent likelihood-informed MCMC
- Finite mixture models
- Inverse problems: a Bayesian perspective
- Kullback-Leibler approximation for probability measures on infinite dimensional spaces
- MAP estimators and their consistency in Bayesian nonparametric inverse problems
- MCMC METHODS FOR DIFFUSION BRIDGES
- MCMC methods for functions: modifying old algorithms to make them faster
- Markov chains for exploring posterior distributions. (With discussion)
- On an adaptive version of the Metropolis–Hastings algorithm with independent proposal distribution
- On the convergence properties of the EM algorithm
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Proposals which speed up function-space MCMC
- Statistical and computational inverse problems.
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(10)- A Bayesian level set method for an inverse medium scattering problem in acoustics
- Non-centered parametric variational Bayes’ approach for hierarchical inverse problems of partial differential equations
- Variational Bayes' Method for Functions with Applications to Some Inverse Problems
- Solving linear Bayesian inverse problems using a fractional total variation-Gaussian (FTG) prior and transport map
- Stein variational gradient descent on infinite-dimensional space and applications to statistical inverse problems
- Adaptive Gibbs samplers and related MCMC methods
- Bayesian Inference on Local Distributions of Functions and Multidimensional Curves with Spherical HMC Sampling
- A residual-driven adaptive Gaussian mixture approximation for Bayesian inverse problems
- An adaptive independence sampler MCMC algorithm for infinite dimensional Bayesian inferences
- On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference
This page was built for publication: An Adaptive Independence Sampler MCMC Algorithm for Bayesian Inferences of Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4641609)
