Research map / Optimization / Nonconvex and smooth optimization
Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
Hongzhou Lin, Julien Mairal, Zaid Harchaoui
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| wrap full gradient method in Catalyst acceleration | FG · Strongly convex finite sum | complexity | Improved |
| wrap incremental methods (SAG/SAGA/SVRG/MISO/SDCA) in Catalyst acceleration | incremental methods · Strongly convex finite sum | complexity | Improved |
Closest papers by meaning
- RECAPP: Crafting a More Efficient Catalyst for Convex Optimization (ICML 2022 · similarity 0.92)
- Nesterov acceleration despite very noisy gradients (NeurIPS 2024 · similarity 0.88)
- Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints (NeurIPS 2024 · similarity 0.88)
- Fundamental Benefit of Alternating Updates in Minimax Optimization (ICML 2024 · similarity 0.88)
- Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique (ICML 2024 · similarity 0.88)
- Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality (NeurIPS 2025 · 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.
