Langevin type limiting processes for adaptive MCMC
From MaRDI portal
Publication:2520143
DOI10.1007/s13226-016-0189-0zbMath1362.65019arXiv1201.1433OpenAlexW2964189877MaRDI QIDQ2520143
Arunangshu Biswas, Gopal Krishna Basak
Publication date: 13 December 2016
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.1433
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diffusion limits of the random walk Metropolis algorithm in high dimensions
- An adaptive approach to Langevin MCMC
- Stochastic approximation. A dynamical systems viewpoint.
- Exponential convergence of Langevin distributions and their discrete approximations
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Langevin-type models. I: Diffusions with given stationary distributions and their discretizations
- Langevin-type models II: Self-targeting candidates for MCMC algorithms
- ARCH models as diffusion approximations
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- A Stochastic Approximation Method
- An adaptive Metropolis algorithm
This page was built for publication: Langevin type limiting processes for adaptive MCMC
