An optimization perspective on log-concave sampling and beyond | Sinho Chewi
chewisinho.github.io · 10,523 words · saved by 2 readers
N/A
An optimization perspective on log-concave sampling and beyond by Sinho Chewi B.S., University of California, Berkeley, 2018 Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the Massachusetts Institute of Technology. May 2023 © Sinho Chewi. This work is licensed under a CC BY-SA 2.0. The author hereby grants to MIT a…
saved by
related reading
- survey.dvimath.uchicago.edu
- CSE 599 Counting and Samplinghomes.cs.washington.edu
- SIAG on Optimization Views and News 33(1)siagoptimization.github.io
- Competing with sampling — Alignment Research Centeralignment.org
- ARC progress update: Competing with sampling — LessWronglesswrong.com
- Frederic Koehlerfrkoehle.github.io
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- ICML and isotropic position of a convex bodyweb.archive.org
- Writing - betanalpha.github.iobetanalpha.github.io
- A Simplified Overview of Langevin Dynamicsfriedmanroy.github.io
- [2411.13462] Sampling and Integration of Logconcave Functions by Algorithmic Diffusionarxiv.org
- Gregory Gundersengregorygundersen.com