Research map / Optimization / Implicit bias and generalization
Breaking Reversibility Accelerates Langevin Dynamics for Non-Convex Optimization
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
- Generalization of noisy SGD in unbounded non-convex settings (ICML 2025 · similarity 0.88)
- Mean-field Underdamped Langevin Dynamics and its Spacetime Discretization (ICML 2024 · similarity 0.88)
- The Expected Loss of Preconditioned Langevin Dynamics Reveals the Hessian Rank (AAAI 2024 · similarity 0.88)
- Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems (ICLR 2024 · similarity 0.88)
- From stability of Langevin diffusion to convergence of proximal MCMC for non-log-concave sampling (NeurIPS 2025 · similarity 0.87)
- Constrained Exploration via Reflected Replica Exchange Stochastic Gradient Langevin Dynamics (ICML 2024 · 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.