Sampling lower bounds
Chen Lu (MIT Mathematics)
14-Oct-2021, 21:30-23:00 (3 years ago)
Abstract: We will discuss the following problem: what is the smallest number of queries we need to make to a target distribution in order to sample from it? We will present some progress towards this problem (based on joint work w/ Sinho Chewi, Patrik Gerber, Thibaut Le Gouic, and Philippe Rigollet).
Computer scienceMathematicsPhysics
Audience: researchers in the topic
MIT Simple Person's Applied Mathematics Seminar
Organizers: | André Lee Dixon*, Ranjan Anantharaman, Aaron Berger |
*contact for this listing |
Export talk to