Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models
From MaRDI portal
Publication:6608672
DOI10.1214/24-aos2367MaRDI QIDQ6608672
Filippo Ascolani, Giacomo Zanella
Publication date: 20 September 2024
Published in: The Annals of Statistics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general framework for the parametrization of hierarchical models
- On the computational complexity of high-dimensional Bayesian variable selection
- Spectral bounds for certain two-factor non-reversible MCMC algorithms
- General state space Markov chains and MCMC algorithms
- Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions
- On rates of convergence of stochastic relaxation for Gaussian and non- Gaussian distributions
- Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms
- Exponential convergence of Langevin distributions and their discrete approximations
- A comparison of centring parameterisations of Gaussian process-based models for Bayesian computation using MCMC
- The Bernstein-von Mises theorem under misspecification
- Convergence of latent mixing measures in finite and infinite mixture models
- Wasserstein-based methods for convergence complexity analysis of MCMC with applications
- Dimension free convergence rates for Gibbs samplers for Bayesian linear mixed models
- Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression
- On the computational complexity of MCMC-based estimators in large samples
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Local consistency of Markov chain Monte Carlo methods
- Optimal tuning of the hybrid Monte Carlo algorithm
- Markov Chains and De-initializing Processes
- Handbook of Markov Chain Monte Carlo
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Asymptotic Statistics
- Random walks in a convex body and an improved volume algorithm
- Spatial Modeling With Spatially Varying Coefficient Processes
- Adaptive Rejection Sampling for Gibbs Sampling
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Efficient parametrisations for normal linear mixed models
- Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions
- Conjugate Bayes for probit regression via unified skew-normal distributions
- MCMC for Imbalanced Categorical Data
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Dimension-Free Mixing for High-Dimensional Bayesian Variable Selection
- Complexity results for MCMC derived from quantitative bounds
- On polynomial-time computation of high-dimensional posterior measures by Langevin-type algorithms
- Computing Bayes: from then `til now
This page was built for publication: Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models