BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Chen Lu (MIT Mathematics)
DTSTART:20211014T213000Z
DTEND:20211014T230000Z
DTSTAMP:20260423T021100Z
UID:SPAMS/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SPAMS/3/">Sa
 mpling lower bounds</a>\nby Chen Lu (MIT Mathematics) as part of MIT Simpl
 e Person's Applied Mathematics Seminar\n\nLecture held in Room: 2 - 132 in
  the Simons Building.\n\nAbstract\nWe will discuss the following problem: 
 what is the smallest number of queries we need to make to a target distrib
 ution in order to sample from it? We will present some progress towards th
 is problem (based on joint work w/ Sinho Chewi\, Patrik Gerber\, Thibaut L
 e Gouic\, and Philippe Rigollet).\n
LOCATION:https://researchseminars.org/talk/SPAMS/3/
END:VEVENT
END:VCALENDAR