Dimension-free relaxation times of informed MCMC samplers on discrete spaces
From MaRDI portal
Cites work
- Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
- Approximate spectral gaps for Markov chain mixing times in high dimensions
- Bayesian Graphical Models for Discrete Data
- Bayesian variable selection regression for genome-wide association studies and other large-scale problems
- CART and best-ortho-basis: a connection
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- Complexity results for MCMC derived from quantitative bounds
- Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
- Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression
- Convergence Rates and Asymptotic Standard Errors for Markov Chain Monte Carlo Algorithms for Bayesian Probit Regression
- Dimension free convergence rates for Gibbs samplers for Bayesian linear mixed models
- Dimension-Free Mixing for High-Dimensional Bayesian Variable Selection
- Dimension-free mixing times of Gibbs samplers for Bayesian hierarchical models
- Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
- Explicit constraints on the geometric rate of convergence of random walk Metropolis-Hastings
- Fast model-fitting of Bayesian variable selection regression using the iterative complex factorization algorithm
- Generating a random permutation with random transpositions
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric ergodicity of Metropolis algorithms
- Handbook of Bayesian Variable Selection
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- scientific article; zbMATH DE number 1350773 (Why is no real title available?)
- scientific article; zbMATH DE number 1034042 (Why is no real title available?)
- scientific article; zbMATH DE number 1563189 (Why is no real title available?)
- scientific article; zbMATH DE number 7370527 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- In search of lost mixing time: adaptive Markov chain Monte Carlo schemes for Bayesian variable selection with very large p
- Inference from iterative simulation using multiple sequences
- Informed proposals for local MCMC in discrete spaces
- Langevin diffusions and Metropolis-Hastings algorithms
- Lectures on probability theory and statistics. Ecole d'été de probabilités de Saint-Flour XXVI--1996. Lectures given at the Saint-Flour summer school of probability theory, August 19--September 4, 1996
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- Markov chain decomposition for convergence rate analysis
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- Mixing times are hitting times of large sets
- Monte Carlo sampling methods using Markov chains and their applications
- On the computational complexity of high-dimensional Bayesian variable selection
- On the computational complexity of MCMC-based estimators in large samples
- On the geometric ergodicity of hybrid samplers
- Optimal proposal distributions and adaptive MCMC
- Order-based structure learning without score equivalence
- Ordering and improving the performance of Monte Carlo Markov chains.
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Scalable approximate MCMC algorithms for the horseshoe prior
- Scalable Importance Tempering and Bayesian Variable Selection
- Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing
- The Multiple-Try Method and Local Optimization in Metropolis Sampling
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- Uncertainty quantification for Bayesian CART
- Wasserstein-based methods for convergence complexity analysis of MCMC with applications
This page was built for publication: Dimension-free relaxation times of informed MCMC samplers on discrete spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839760)
