Research map / Optimization / Nonconvex and smooth optimization
Implicit Langevin Algorithms for Sampling From Log-concave Densities
Liam Hodgkinson, Robert Salomone, Fred Roosta
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
- Log-concave sampling: Metropolis-Hastings algorithms are fast (JMLR 2019 · similarity 0.91)
- Bounding the Error of Discretized Langevin Algorithms for Non-Strongly Log-Concave Targets (JMLR 2022 · similarity 0.91)
- Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds (ICLR 2026 · similarity 0.90)
- Wasserstein distance estimates for the distributions of numerical approximations to ergodic stochastic differential equations (JMLR 2021 · similarity 0.90)
- From stability of Langevin diffusion to convergence of proximal MCMC for non-log-concave sampling (NeurIPS 2025 · similarity 0.89)
- Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited (ICLR 2024 · similarity 0.89)
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.
