Welcome to Randal Douc's wiki

A collaborative site on maths but not only!

Trace:

world:projet-mda-2024

You've loaded an old revision of the document! If you save it, you will create a new version with this data.

{{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      |
| 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                |              |
| 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                |              |
| 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                |              |
| 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                |              |
| Laureline Legros                                                                                                                                 |  Convergence of diffusions and their discretizations: from continuous to discrete processes and back             |  [[https://arxiv.org/pdf/1904.09808|paper]]       |  (Al) Room 1A09                |              |
| 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 ======
  * <color /yellow>Defense with Alain: Thursday 25 jan. Room 1A9.</color> 
  * <color /lightblue> Defense with Randal:  Thursday 25 jan. Room 1A11. </color>
  * A short summary (5 pages max) of the paper is requested before the defense. 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 <color /yellow>{{ :world:guidelinesmda.pdf |guidelines for the report}}</color>.    
  * If there is any question, please contact [[alain.durmus@polytechnique.edu|Alain Durmus]] or [[randal.douc@polytechnique.edu|Randal Douc]].

Please fill all the letters into the box to prove you're human. D W R T Z Please keep this field empty:

Edit summary

world/projet-mda-2024.1704752176.txt.gz · Last modified: 2024/01/08 23:16 by rdouc