Wasserstein-based methods for convergence complexity analysis of MCMC with applications
From MaRDI portal
Publication:2117437
Cites work
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- A concise course on stochastic partial differential equations
- A study of variable selection using \(g\)-prior distribution with ridge parameter
- Asymptotic coupling and a general form of Harris' theorem with applications to stochastic delay equations
- Bayesian Analysis of Binary and Polychotomous Response Data
- Bounds on regeneration times and convergence rates for Markov chains
- Computable bounds for geometric convergence rates of Markov chains
- Convergence Rates and Asymptotic Standard Errors for Markov Chain Monte Carlo Algorithms for Bayesian Probit Regression
- Convergence analysis of the Gibbs sampler for Bayesian general linear mixed models with improper priors
- Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression
- Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration
- Convergence properties of Gibbs samplers for Bayesian probit regression with proper priors
- Coupling and convergence for Hamiltonian Monte Carlo
- Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model
- Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo.
- Locally contracting iterated functions and stability of Markov chains
- Locally contractive iterated function systems
- MCMC for imbalanced categorical data
- Markov Chains
- Markov Chains and Stochastic Stability
- Markov chains and de-initializing processes
- Matrix concentration inequalities via the method of exchangeable pairs
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics
- On the computational complexity of high-dimensional Bayesian variable selection
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- On the limitations of single-step drift and minorization in Markov chain convergence analysis
- One-shot coupling for certain stochastic recursive sequences.
- Propriety of posterior distribution for dichotomous quantal response models
- Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances
- Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis adjusted Langevin algorithm
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Ricci curvature of Markov chains on metric spaces
- Subgeometric rates of convergence of Markov processes in the Wasserstein metric
- Variable Selection in Regression Mixture Modeling for the Discovery of Gene Regulatory Networks
- Yet Another Look at Harris’ Ergodic Theorem for Markov Chains
Cited in
(10)- Geometric convergence bounds for Markov chains in Wasserstein distance based on generalized drift and contraction conditions
- Wasserstein-based methods for convergence complexity analysis of MCMC with applications
- Mixing times of a Gibbs sampler for probit hierarchical models
- Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models
- Convergence rate bounds for iterative random functions using one-shot coupling
- Exact convergence analysis for metropolis–hastings independence samplers in Wasserstein distances
- Convergence rates of Metropolis-Hastings algorithms
- Limitations of the Wasserstein MDE for univariate data
- Spectral telescope: convergence rate bounds for random-scan Gibbs samplers based on a hierarchical structure
- Dimension free convergence rates for Gibbs samplers for Bayesian linear mixed models
This page was built for publication: Wasserstein-based methods for convergence complexity analysis of MCMC with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117437)
