Research map / Learning theory and algorithms / Sample complexity
Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions
Yin Tat Lee, Ruoqi Shen, Kevin Tian
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling (JMLR 2022 · similarity 0.92)
- Log-concave sampling: Metropolis-Hastings algorithms are fast (JMLR 2019 · similarity 0.91)
- Constrained Sampling with Primal-Dual Langevin Monte Carlo (NeurIPS 2024 · similarity 0.89)
- Provable Convergence and Limitations of Geometric Tempering for Langevin Dynamics (ICLR 2025 · similarity 0.88)
- Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited (ICLR 2024 · similarity 0.88)
- Non-asymptotic Error Bounds in $\mathcal{W}_2$-Distance with Sqrt(d) Dimension Dependence and First Order Convergence for Langevin Monte Carlo beyond Log-Concavity (ICML 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
