Research map / Optimization / Nonconvex and smooth optimization
Convergence of Adam Under Relaxed Assumptions
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
- A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGD (ICML 2025 · similarity 0.96)
- On Convergence of Adam for Stochastic Optimization under Relaxed Assumptions (NeurIPS 2024 · similarity 0.93)
- Adam under Generalized Smoothness with Second-Moment-Type Stochastic Gradients (NeurIPS 2026 · similarity 0.92)
- ADOPT: Modified Adam Can Converge with Any $\beta_2$ with the Optimal Rate (NeurIPS 2024 · similarity 0.90)
- The Implicit Bias of Adam on Separable Data (NeurIPS 2024 · similarity 0.90)
- Understanding the Generalization of Stochastic Gradient Adam in Learning Neural Networks (NeurIPS 2025 · similarity 0.90)
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.