Cover Image

No Free Lunch for Approximate MCMC

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Johndrow, James E., Pillai, Natesh S., Smith, Aaron
Format:	Preprint
Published:	2020
Subjects:	Computation Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Kac's walk on rotation matrices mixes in $n^2 \log n$ steps
by: Pillai, Natesh S., et al.
Published: (2026)

Microergodicity implies orthogonality of Matérn fields on bounded domains in $\mathbb{R}^4$
by: Pillai, Natesh S.
Published: (2026)

No Free Lunch for Stochastic Gradient Langevin Dynamics
by: Pillai, Natesh S., et al.
Published: (2024)

A Heavily Right Strategy for Statistical Inference with Dependent Studies in Any Dimension
by: Liu, Tianle, et al.
Published: (2025)

Adaptive Divide and Conquer with Two Rounds of Communication
by: Kal, Niladri, et al.
Published: (2025)

Policy Gradients for Optimal Parallel Tempering MCMC
by: Zhao, Daniel, et al.
Published: (2024)

MCMC-driven learning
by: Bouchard-Côté, Alexandre, et al.
Published: (2024)

Ergodicity of an Adaptive MCMC Sampler under a Probability Bound
by: Chotard, Alexandre
Published: (2026)

Multivariate strong invariance principle and uncertainty assessment for time in-homogeneous cyclic MCMC samplers
by: Li, Haoxiang, et al.
Published: (2024)

Sacred and Profane: from the Involutive Theory of MCMC to Helpful Hamiltonian Hacks
by: Glatt-Holtz, Nathan E., et al.
Published: (2024)

Efficient Sampling on Riemannian Manifolds via Langevin MCMC
by: Cheng, Xiang, et al.
Published: (2024)

Optimal Scaling for the Proximal Langevin Algorithm in High Dimensions
by: Pillai, Natesh S.
Published: (2022)

Mixing on $k$ Columns of the Transvection Walk
by: Pillai, Natesh, et al.
Published: (2026)

Quantifying the Speed-Up from Non-Reversibility in MCMC Tempering Algorithms
by: Roberts, Gareth O., et al.
Published: (2025)

On MCMC mixing for predictive inference under unidentified transformation models
by: Zhong, Chong, et al.
Published: (2024)

Improved Rates of Bootstrap Approximation for the Operator Norm: A Coordinate-Free Approach
by: Lopes, Miles E.
Published: (2022)

Efficient Robust Constrained Signal Detection via Kolmogorov Width Approximations
by: Li, Yikun, et al.
Published: (2026)

Exact and Approximate Conformal Inference for Multi-Output Regression
by: Johnstone, Chancellor, et al.
Published: (2022)

Approximate Computation via Le Cam Simulability
by: Akdemir, Deniz
Published: (2025)

A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
by: Tang, Runshi, et al.
Published: (2026)

Using Exponential Histograms to Approximate the Quantiles of Heavy- and Light-Tailed Data
by: Labo, Philip T.
Published: (2024)

The No-Underrun Sampler: A Locally-Adaptive, Gradient-Free MCMC Method
by: Bou-Rabee, Nawaf, et al.
Published: (2025)

On micromodes in Bayesian posterior distributions and their implications for MCMC
by: Agrawal, Sanket, et al.
Published: (2026)

A Fast Coordinate Descent Method for High-Dimensional Non-Negative Least Squares using a Unified Sparse Regression Framework
by: Yang, James, et al.
Published: (2024)

Iterating marginalized Bayes maps for likelihood maximization with application to nonlinear panel models
by: Wheeler, Jesse, et al.
Published: (2025)

Latent-IMH: Efficient Bayesian Inference for Inverse Problems with Approximate Operators
by: Chen, Youguang, et al.
Published: (2026)

Variance estimation after matching or re-weighting
by: Meng, Xiang, et al.
Published: (2025)

Convergence of Dirichlet Forms for MCMC Optimal Scaling with Dependent Target Distributions on Large Graphs
by: Ning, Ning
Published: (2022)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
by: Lovig, Maxwell, et al.
Published: (2024)

Tracy-Widom, Gaussian, and Bootstrap: Approximations for Leading Eigenvalues in High-Dimensional PCA
by: Dörnemann, Nina, et al.
Published: (2025)

Element-Free Probability Distributions and Random Partitions
by: Blanchi, Victor, et al.
Published: (2024)

Parallel MCMC Algorithms: Theoretical Foundations, Algorithm Design, Case Studies
by: Glatt-Holtz, Nathan E., et al.
Published: (2022)

On Gaussian Approximation for M-Estimator
by: Imaizumi, Masaaki, et al.
Published: (2020)

A Modified Satterthwaite (1941,1946) Effective Degrees of Freedom Approximation
by: von Davier, Matthias
Published: (2024)

Improved distance correlation estimation
by: Monroy-Castillo, Blanca E., et al.
Published: (2024)

On the Approximation Accuracy of Gaussian Variational Inference
by: Katsevich, Anya, et al.
Published: (2023)

Approximation by mixtures of multivariate Erlang distributions
by: Nguyen, Hien Duy
Published: (2026)

Dimension-Free Convergence of Diffusion Models for Approximate Gaussian Mixtures
by: Li, Gen, et al.
Published: (2025)

Quantifying the effectiveness of linear preconditioning in Markov chain Monte Carlo
by: Hird, Max, et al.
Published: (2023)

More Permutations Do Not Always Increase Power: Non-monotonicity in Monte Carlo Permutation Tests
by: Cha, Suman, et al.
Published: (2026)