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
- [2604.04891] Muon Dynamics as a Spectral Wasserstein Flowarxiv.org
- practicalqmc.pdfartowen.su.domains
- rakhlin_mathstat_sp24.pdfmit.edu
- [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
- SIAG on Optimization Views and News 33(1)siagoptimization.github.io
- [2403.14606] The Elements of Differentiable Programmingarxiv.org
- probmethod_notes.pdfyufeizhao.com
- Dynamical Approach to RMT.pdfpeople.math.harvard.edu
- [2505.02621] Mirror Mean-Field Langevin Dynamicsarxiv.org
- High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithmarxiv.org
- A Gallery of Methods Beyond RL — Part I: Sampling Methodsshengyu-feng.github.io