207 citations · 565 across the 24 of their papers we have counts for
32 papers
Resampling in conditional SMC algorithms
Axel Finke, Adam M. Johansen, Anthony Lee +1
Conditional sequential Monte Carlo (CSMC) algorithms arise in particle Markov chain Monte Carlo and a number of related settings. As in standard sequential Monte Carlo (SMC) algori…
Explicit convergence bounds for Metropolis Markov chains: isoperimetry, spectral gaps and profiles
Christophe Andrieu, Anthony Lee, Sam Power +1
We derive the first explicit bounds for the spectral gap of a random walk Metropolis algorithm on for any value of the proposal variance, which when scaled appropriately reco…
Poincaré inequalities for Markov chains: a meeting with Cheeger, Lyapunov and Metropolis
Christophe Andrieu, Anthony Lee, Sam Power +1
We develop a theory of weak Poincaré inequalities to characterize convergence rates of ergodic Markov chains. Motivated by the application of Markov chains in the context of algori…
Solving the Poisson equation using coupled Markov chains
Randal Douc, Pierre E. Jacob, Anthony Lee +1
This article shows how coupled Markov chains that meet exactly after a random number of iterations can be used to generate unbiased estimators of the solutions of the Poisson equat…
Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC
Christophe Andrieu, Anthony Lee, Sam Power +1
We investigate the use of a certain class of functional inequalities known as weak Poincaré inequalities to bound convergence of Markov chains to equilibrium. We show that this ena…
A general perspective on the Metropolis-Hastings kernel
Christophe Andrieu, Anthony Lee, Sam Livingstone
Since its inception the Metropolis-Hastings kernel has been applied in sophisticated ways to address ever more challenging and diverse sampling problems. Its success stems from the…