BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20251210
DTEND;VALUE=DATE:20251213
DTSTAMP:20260709T235910
CREATED:20251208T092822Z
LAST-MODIFIED:20251208T092834Z
UID:18626-1765324800-1765583999@crest.science
SUMMARY:Workshop on Advances in MCMC Methods
DESCRIPTION:Nicolas Chopin will participate to the workshop on Advances in MCMC Methods and present his paper “What is actual the complexity of tempering (SMC)? \nWhat is actual the complexity of tempering (SMC) ? \nThere is some discrepancy in the literature regarding the complexity of tempering with respect to d\, the dimension of the sampling space. The complexity is partly determined by the length of the temperature ladder\, that is\, the sequence of tempering exponents 0=lambda_0 < … < lambda_T = 1. In the AIS (annealed importance sampling) literature\, it is often recommended to take T = O(d). Some SMC (Sequential Monte Carlo) papers instead suggest that ESS-based criteria leads to T=O(d^{1/2}).\nIn this talk\, I will present results from both a recent paper (with Francesca Crucinio and Anna Korba\, ICML 2024) and some preliminary work (with Yvann Le Fay and Matti Vihola) that shed light on this discrepancy. Basically\, for moments with respect to the target distribution\, T=O(d^{1/2})$ suffices to leads to estimates with variance O(1). However\, for the normalising constant\, variance is then O(T) = O(d^{1/2})$.\nThe actual complexity of the considered sampler will also depend\, of course\, on the mixing properties of the MCMC kernels used to rejuvenate the particles. I will explain how we can exploit some existing\, non-asymptotic results on such kernels to obtain the overall complexity of the sampler. \n
URL:https://crest.science/event/advances-in-mcmc-methods/
CATEGORIES:Conferences and Workshops,Statistics
END:VEVENT
END:VCALENDAR