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:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20260331T140000
DTEND;TZID=Europe/Helsinki:20260331T153000
DTSTAMP:20260709T194509
CREATED:20260223T092101Z
LAST-MODIFIED:20260316T091323Z
UID:18820-1774965600-1774971000@crest.science
SUMMARY:Krishna BALASUBRAMANIAN (UC DAVIS)- Finite-Particle Convergence of (Regularized) Stein Variational Gradient Descent
DESCRIPTION:Statistical Seminar: Every Monday at 2:00 pm.\nTime: 2:00 pm – 3:00 pm\nDate: 31th March\nPlace: 3001 \n  \nKrishna BALASUBRAMANIAN (UC DAVIS)- Finite-Particle Convergence of (Regularized) Stein Variational Gradient Descent \n  \n Abstract:  \nStein Variational Gradient Descent (SVGD) is a widely used particle-based algorithm for approximate Bayesian inference. To address the intrinsic bias of SVGD\, a regularized variant (R-SVGD) has been proposed that applies a resolvent-type preconditioner to the kernelized Wasserstein gradient. In this talk\, I present recent results establishing explicit non-asymptotic finite-particle convergence guarantees for both SVGD and R-SVGD. The analysis is based on an entropy method for interacting particle systems\, showing that the time derivative of the relative entropy between the joint law of the particles and the product target measure decomposes into a dominant negative term proportional to the number of particles times the expected squared Kernelized Stein Discrepancy (KSD²)\, together with a smaller positive correction. This structure yields finite-particle convergence rates of order (N^{-1/2}) in KSD and Fisher information for SVGD and R-SVGD respectively. Under mild assumptions on the kernel and the target potential\, the resulting bounds grow only polynomially with the dimension. The analysis further yields Wasserstein convergence rates for both algorithms\, as well as marginal convergence and long-time propagation of chaos for the interacting particle system. \n  \nOrganizers: \nAnna KORBA (CREST)\, Vincent DIVOL (CREST) \, Jaouad MOURTADA (CREST) \n  \nSponsors:\nCREST-CMAP \n
URL:https://crest.science/event/krishna-balasubramanian-uc-davis-tba/
CATEGORIES:Seminars,Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR