Research map / Optimization / Nonconvex and smooth optimization
A Geometric Structure of Acceleration and Its Role in Making Gradients Small Fast
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
- Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis (ICML 2022 · similarity 0.88)
- Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k^2) Rate on Squared Gradient Norm (ICML 2021 · similarity 0.88)
- Rethinking the Variational Interpretation of Accelerated Optimization Methods (NeurIPS 2021 · similarity 0.88)
- Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique (ICML 2024 · similarity 0.87)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.87)
- Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints (NeurIPS 2024 · similarity 0.86)
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.