Research map / Optimization / Nonconvex and smooth optimization
Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex 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
- Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization (NeurIPS 2022 · similarity 0.93)
- Breaking Reversibility Accelerates Langevin Dynamics for Non-Convex Optimization (NeurIPS 2020 · similarity 0.92)
- Regularized Langevin Dynamics for Combinatorial Optimization (ICML 2025 · similarity 0.90)
- Generalization of noisy SGD in unbounded non-convex settings (ICML 2025 · similarity 0.90)
- Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management (AAAI 2025 · similarity 0.89)
- Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems (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.