Research map / Optimization / Nonconvex and smooth optimization
Stochastic Spectral and Conjugate Descent Methods
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
- Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent (ICML 2025 · similarity 0.89)
- When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent (NeurIPS 2017 · similarity 0.89)
- Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson–Romberg Extrapolation (ICLR 2025 · similarity 0.87)
- The Sample Complexity of Gradient Descent in Stochastic Convex Optimization (NeurIPS 2024 · similarity 0.87)
- Learning Complexity of Gradient Descent and Conjugate Gradient Algorithms (AAAI 2025 · similarity 0.86)
- Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization (ICLR 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.