Research map / Probabilistic and scientific modeling / Variational and generative sampling
On the Computational Complexity of Metropolis-Adjusted Langevin Algorithms for Bayesian Posterior Sampling
Rong Tang, Yun Yang
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.93)
- Log-concave sampling: Metropolis-Hastings algorithms are fast (JMLR 2019 · similarity 0.93)
- Posterior Sampling by Combining Diffusion Models with Annealed Langevin Dynamics (NeurIPS 2025 · similarity 0.88)
- Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Sampling (ICLR 2025 · similarity 0.88)
- Preconditioned Langevin Dynamics with Score-based Generative Models for Infinite-Dimensional Linear Bayesian Inverse Problems (NeurIPS 2025 · 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.
