Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs
From MaRDI portal
Publication:6094078
Abstract: We establish conditions under which Metropolis-Hastings (MH) algorithms with a position-dependent proposal covariance matrix will or will not have the geometric rate of convergence. Some of the diffusions based MH algorithms like the Metropolis adjusted Langevin algorithm (MALA) and the pre-conditioned MALA (PCMALA) have a position-independent proposal variance. Whereas, for other modern variants of MALA like the manifold MALA (MMALA) that adapt to the geometry of the target distributions, the proposal covariance matrix changes in every iteration. Thus, we provide conditions for geometric ergodicity of different variations of the Langevin algorithms. These results have important practical implications as these provide crucial justification for the use of asymptotically valid Monte Carlo standard errors for Markov chain based estimates. The general conditions are verified in the context of conditional simulation from the two most popular generalized linear mixed models (GLMMs), namely the binomial GLMM with the logit link and the Poisson GLMM with the log link. Empirical comparison in the framework of some spatial GLMMs shows that the computationally less expensive PCMALA with an appropriately chosen pre-conditioning matrix may outperform the MMALA.
Recommendations
- Convergence and accuracy of Gibbs sampling for conditional distributions in generalized linear models
- Convergence rate of MLE in generalized linear and nonlinear mixed-effects models: Theory and applications
- On the Convergence of the Monte Carlo Maximum Likelihood Method for Latent Variable Models
- Learning Theory
- On the consistency of conditional maximum likelihood estimators
- Convergence rates of MLE in a partly linear model
- Handy sufficient conditions for the convergence of the maximum likelihood estimator in observation-driven models
Cites work
- scientific article; zbMATH DE number 509169 (Why is no real title available?)
- scientific article; zbMATH DE number 646825 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- An adaptive Metropolis algorithm
- Convergence Rates and Asymptotic Standard Errors for Markov Chain Monte Carlo Algorithms for Bayesian Probit Regression
- Efficient estimation and prediction for the Bayesian binary spatial model with flexible link functions
- Equation of state calculations by fast computing machines
- Exponential convergence of Langevin distributions and their discrete approximations
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric ergodicity of Metropolis algorithms
- Geometric ergodicity of Metropolis-Hastings algorithms for conditional simulation in generalized linear mixed models
- Geometric ergodicity of Pólya-Gamma Gibbs sampler for Bayesian logistic regression with a flat prior
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Information-geometric Markov chain Monte Carlo methods using diffusions
- Langevin diffusions and Metropolis-Hastings algorithms
- Langevin diffusions and the Metropolis-adjusted Langevin algorithm
- Log Gaussian Cox Processes
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- MCMC using Hamiltonian dynamics
- Markov chains and stochastic stability
- Measuring sample quality with diffusions
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
- Model-Based Geostatistics
- Monte Carlo sampling methods using Markov chains and their applications
- Multivariate output analysis for Markov chain Monte Carlo
- Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- On estimation and prediction for spatial generalized linear mixed models
- On the geometric ergodicity of Hamiltonian Monte Carlo
- On the limitations of single-step drift and minorization in Markov chain convergence analysis
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm
- Rates of convergence of the Hastings and Metropolis algorithms
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Scaling Limits for the Transient Phase of Local Metropolis–Hastings Algorithms
This page was built for publication: Convergence of Position-Dependent MALA with Application to Conditional Simulation in GLMMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094078)
