Research map / Learning theory and algorithms / Sample complexity
Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds
Rishikesh Srinivasan, Dheeraj Mysore Nagaraj
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
- Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited (ICLR 2024 · similarity 0.94)
- The Poisson Midpoint Method for Langevin Dynamics: Provably Efficient Discretization for Diffusion Models (NeurIPS 2024 · similarity 0.91)
- 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.90)
- Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel (ICLR 2025 · similarity 0.89)
- Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing (NeurIPS 2025 · similarity 0.88)
- Provable Convergence and Limitations of Geometric Tempering for Langevin Dynamics (ICLR 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.
