REVIEW 2 cited by
Importance is Important: Generalized Markov Chain Importance Sampling Methods
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We show that for any multiple-try Metropolis algorithm, one can always accept the proposal and evaluate the importance weight that is needed to correct for the bias without extra computational cost. This results in a general, convenient, and rejection-free Markov chain Monte Carlo (MCMC) sampling scheme. By further leveraging the importance sampling perspective on Metropolis--Hastings algorithms, we propose an alternative MCMC sampler on discrete spaces that is also outside the Metropolis--Hastings framework, along with a general theory on its complexity. Numerical examples suggest that the proposed algorithms are consistently more efficient than the original Metropolis--Hastings versions.
Forward citations
Cited by 2 Pith papers
-
From Minimax Optimal Importance Sampling to Uniformly Ergodic Importance-tempered MCMC
A minimax analysis identifies the optimal importance-sampling proposal for atomic targets, and an exact uniform ergodicity criterion is proved for importance-tempered random-walk Metropolis on polynomial-tail targets.
-
GS-BART: Bayesian Additive Regression Trees with Graph-split Decision Rules
GS-BART extends BART to use graph-split decision rules on arborescence encodings of features, with an informed MCMC sampler, and shows predictive gains on spatial and network data.
Discussion (0). Continue with ORCID to comment.