Research map / Optimization / Nonconvex and smooth optimization
When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use cyclic instead of randomized coordinate selection | coordinate descent · Consistently ordered 2-cyclic quadratic, n=100 | asymptotic rate ratio: about 2.77 times faster | Helped |
| use inconsistent ordering (random permutation) for CCD (ablation) | CCD · 2-cyclic quadratic | convergence rate vs RCD | Mixed |
Closest papers by meaning
- Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent (ICML 2025 · similarity 0.91)
- Coordinate Descent Methods for DC Minimization: Optimality Conditions and Global Convergence (AAAI 2023 · similarity 0.89)
- Stochastic Spectral and Conjugate Descent Methods (NeurIPS 2018 · similarity 0.89)
- Stability-based Generalization Analysis of Randomized Coordinate Descent for Pairwise Learning (AAAI 2025 · similarity 0.87)
- Enhanced Cyclic Coordinate Descent Methods for Elastic Net Penalized Linear Models (NeurIPS 2025 · similarity 0.87)
- Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems (ICML 2025 · 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.