Pith. sign in

REVIEW 1 cited by

Error Bounds for Sequential Monte Carlo Samplers for Multimodal Distributions

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

arxiv 1509.08775 v4 pith:S5VWA2AW submitted 2015-09-29 math.PR stat.COstat.ME

classification math.PRstat.COstat.ME
keywords distributionsboundscarlomethodsmonteableapplycase
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper, we provide bounds on the asymptotic variance for a class of sequential Monte Carlo (SMC) samplers designed for approximating multimodal distributions. Such methods combine standard SMC methods and Markov chain Monte Carlo (MCMC) kernels. Our bounds improve upon previous results, and unlike some earlier work, they also apply in the case when the MCMC kernels can move between the modes. We apply our results to the Potts model from statistical physics. In this case, the problem of sharp peaks is encountered. Earlier methods, such as parallel tempering, are only able to sample from it at an exponential (in an important parameter of the model) cost. We propose a sequence of interpolating distributions called interpolation to independence, and show that the SMC sampler based on it is able to sample from this target distribution at a polynomial cost. We believe that our method is generally applicable to many other distributions as well.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficiently learning and sampling multimodal distributions with data-based initialization

    cs.LG 2024-11 conditional novelty 8.0 of 10

    By starting a Markov chain from the empirical distribution of samples, mixing time depends on a higher-order spectral gap, and sample complexity grows only linearly in the number of modes.

Pith tools