Optimal scaling for the proximal Langevin algorithm in high dimensions
From MaRDI portal
Cites work
- A Hamiltonian Monte Carlo Method for Non-Smooth Energy Sampling
- Analysis of SPDEs arising in path sampling. I: The Gaussian case
- Analysis of SPDEs arising in path sampling. II: The nonlinear case
- Asymptotic behaviour of a class of stochastic approximation procedures
- Convex analysis and monotone operator theory in Hilbert spaces
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Inverse problems: a Bayesian perspective
- MCMC METHODS FOR DIFFUSION BRIDGES
- MCMC methods for sampling function space
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal scalings for local Metropolis-Hastings chains on nonproduct targets in high dimensions
- Proximal Markov chain Monte Carlo algorithms
- Signal processing problems on function space: Bayesian formulation, stochastic PDEs and effective MCMC methods
- Stochastic Equations in Infinite Dimensions
- Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference
- The Global Dynamics of Discrete Semilinear Parabolic Equations
- Weak convergence and optimal scaling of random walk Metropolis algorithms
This page was built for publication: Optimal scaling for the proximal Langevin algorithm in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985729)