world:projet-mda-2024
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
world:projet-mda-2024 [2024/01/08 12:45] rdouc [Table] |
world:projet-mda-2024 [2024/01/20 09:47] (current) 2001:861:3cc0:a960:53fe:fef8:2d14:ff64 [Table] |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| - | ^ 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 ^ Comments ^ | + | ^ 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]] | R | | + | | 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]] | R | | + | | 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]] | R | | + | | 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]] | | | + | | 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]] | | | + | | 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]] | | | + | | 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 | |
| - | | Laureline Legros | Convergence of diffusions and their discretizations: from continuous to discrete processes and back | [[https://arxiv.org/pdf/1904.09808|paper]] | | | + | | 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 | |
| - | | 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]] | R | | + | | 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 | |
| - | | Jérôme Taupin & Ales Brahiti | Convergence rate bounds for iterative random functions using one-shot coupling | [[https://arxiv.org/pdf/2112.03982| paper]] | | | + | |
| ====== Instructions ====== | ====== Instructions ====== | ||
| - | * 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. | + | * <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 by sending an email to Alain or Randal (depending on your jury) <color /lightblue> before Tuesday, 23rd of January, 12H00</color>. You can add technical appendix (with no limitation size) if needed. | ||
| * The defense will be 20 minutes long per project + questions. | * 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. | * Be as pedagogical as possible, you can highlight a particular proof that interests you if you find it interesting. | ||
world/projet-mda-2024.1704714344.txt.gz · Last modified: 2024/01/08 12:45 by rdouc
Page Tools
