Research map / Optimization / Nonconvex and smooth optimization
Asynchronous Parallel Greedy Coordinate Descent
Yang You, Xiangru Lian, Ji Liu, Hsiang-Fu Yu, Inderjit S Dhillon, James Demmel, Cho-Jui Hsieh
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 |
|---|---|---|---|
| use more CPU cores (1, 2, 4, 10, 20) for Asy-GCD | Asy-GCD · ijcnn1, covtype, webspam | objective vs time | Improved |
| scale Asy-GCD up to 20 threads across two sockets | Asy-GCD · ijcnn1, covtype, webspam | speedup: 13-15 times speedup | Improved |
| greedy variable selection (Asy-GCD) instead of random selection (PSCD) | kernel SVM solver · covtype | accuracy over time: 93% after 4000 seconds -> 95% after 1500 seconds | Improved |
| greedy selection instead of stochastic selection | kernel SVM solver · ijcnn1, covtype, webspam | objective convergence | Improved |
| compare against LIBSVM (OMP), which parallelizes only kernel computation | Asy-GCD · ijcnn1, covtype, webspam | time to convergence | Improved |
| per-core LRU kernel cache in contiguous memory instead of shared LRU | Asy-GCD · multi-socket NUMA machine | scalability | Improved |
| kmeans-based variable partitioning to minimize between-cluster connections | Asy-GCD · kernel SVM datasets | convergence speed | Improved |
Closest papers by meaning
- Fast Asynchronous Parallel Stochastic Gradient Descent: A Lock-Free Approach with Convergence Guarantee (AAAI 2016 · similarity 0.89)
- Asynchronous Iterations in Optimization: New Sequence Results and Sharper Algorithmic Guarantees (JMLR 2023 · similarity 0.89)
- Parallel Asynchronous Stochastic Variance Reduction for Nonconvex Optimization (AAAI 2017 · similarity 0.89)
- Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity (ICML 2025 · similarity 0.87)
- Stability and Generalization of Asynchronous SGD: Sharper Bounds Beyond Lipschitz and Smoothness (NeurIPS 2024 · similarity 0.86)
- Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity (NeurIPS 2026 · 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.
