{{page>:defs}} ^ Associated team (at most 2 students). To register, double click and fill your first name, your family name. And do the same for your classmate. ^ Title ^ Paper ^ Jury (Al: Alain, Rdl: Randal) ^ Defense (Thursday, 25th jan) ^ | Yichuan Huang | Log-concave sampling: Metropolis-Hastings algorithms are fast | [[https://arxiv.org/pdf/1801.02309.pdf| paper]] | (Rdl) Room 1A11 | 9H45-10H15 | | Rafaël Digneaux & Côme Eupherte | Computable bounds on convergence of Markov chains in Wassertein distance | [[https://arxiv.org/pdf/2308.10341.pdf| paper]] | (Al) Room 1A09 | 10h-10h30 | | Anna Bahrii | On the limitations of single-step drift and minorization in Markov chain convergence analysis | [[https://arxiv.org/pdf/2003.09555.pdf| paper]] | (Rdl) Room 1A11 | 10H15-10H45 | | Sturma Thomas & Victor-Emmanuel Grün | Lower bounds on the rate of convergence for accept-reject-based Markov chains | [[https://arxiv.org/pdf/2212.05955.pdf| paper]] | (Al) Room 1A09 | 11h30-12h | | Ekin Arikök & Gaspard Gomez | The pseudo-marginal approach for efficient Monte Carlo computations | [[https://arxiv.org/pdf/0903.5480.pdf| paper]] | (Al) Room 1A09 | 10h45-11h30 | | Emile Averous & Nathan de Montgolfier | Poincaré inequalities for Markov chains: a meeting with Cheeger, Lyapunov and Metropolis | [[https://arxiv.org/pdf/2208.05239.pdf| paper]] | (Al) Room 1A09 | 18/01 | | Hugo Malafosse & Philippe Sarotte | Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm | [[https://arxiv.org/pdf/2201.05002|paper]] | (Rdl) Room 1A11 | 11H00-11H30 | | Jérôme Taupin & Ales Brahiti | Convergence rate bounds for iterative random functions using one-shot coupling | [[https://arxiv.org/pdf/2112.03982| paper]] | (Rdl) Room 1A11 | 11H30-12H00 | ====== Instructions ====== * Defense with Alain: Thursday 25 jan. Room 1A9. * Defense with Randal: Thursday 25 jan. Room 1A11. * A short summary (5 pages max) of the paper is requested before the defense by sending an email to Alain or Randal (depending on your jury) before Tuesday, 23rd of January, 12H00. You can add technical appendix (with no limitation size) if needed. * The defense will be 20 minutes long per project + questions. * Be as pedagogical as possible, you can highlight a particular proof that interests you if you find it interesting. * Please read the {{ :world:guidelinesmda.pdf |guidelines for the report}}. * If there is any question, please contact [[alain.durmus@polytechnique.edu|Alain Durmus]] or [[randal.douc@polytechnique.edu|Randal Douc]].