Recognition: unknown
Taking Bigger Metropolis Steps by Dragging Fast Variables
read the original abstract
I show how Markov chain sampling with the Metropolis-Hastings algorithm can be modified so as to take bigger steps when the distribution being sampled from has the characteristic that its density can be quickly recomputed for a new point if this point differs from a previous point only with respect to a subset of 'fast' variables. I show empirically that when using this method, the efficiency of sampling for the remaining 'slow' variables can approach what would be possible using Metropolis updates based on the marginal distribution for the slow variables.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
DESI 2024 VI: Cosmological Constraints from the Measurements of Baryon Acoustic Oscillations
First-year DESI BAO data are consistent with flat LambdaCDM and, when combined with CMB, show a 2.5-3.9 sigma preference for evolving dark energy (w0 > -1, wa < 0) that strengthens with certain supernova datasets.
-
GetDist: a Python package for analysing Monte Carlo samples
GetDist implements boundary-corrected KDE with automatic smoothing for analyzing weighted and correlated Monte Carlo samples, plus plotting and diagnostic tools.
-
Extended Dark Energy analysis using DESI DR2 BAO measurements
Extended analysis of DESI DR2 data confirms robust evidence for dynamical dark energy with phantom crossing preference, stable under parametric and non-parametric modeling.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.