Research map / Optimization / Nonconvex and smooth optimization
Efficient constrained sampling via the mirror-Langevin algorithm
Read the paperCheck your idea against 108,967 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
- Constrained Exploration via Reflected Replica Exchange Stochastic Gradient Langevin Dynamics (ICML 2024 · similarity 0.89)
- Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing (NeurIPS 2025 · similarity 0.88)
- A connection between Tempering and Entropic Mirror Descent (ICML 2024 · similarity 0.88)
- Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited (ICLR 2024 · similarity 0.87)
- In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies (NeurIPS 2024 · similarity 0.87)
- NETS: A Non-equilibrium Transport Sampler (ICML 2025 · similarity 0.87)
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.