AI Paper Atlas

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

NeurIPS 2016 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 25 citations (OpenAlex)

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 changedWhereMeasuredEffect
use more CPU cores (1, 2, 4, 10, 20) for Asy-GCDAsy-GCD · ijcnn1, covtype, webspamobjective vs timeImproved
scale Asy-GCD up to 20 threads across two socketsAsy-GCD · ijcnn1, covtype, webspamspeedup: 13-15 times speedupImproved
greedy variable selection (Asy-GCD) instead of random selection (PSCD)kernel SVM solver · covtypeaccuracy over time: 93% after 4000 seconds -> 95% after 1500 secondsImproved
greedy selection instead of stochastic selectionkernel SVM solver · ijcnn1, covtype, webspamobjective convergenceImproved
compare against LIBSVM (OMP), which parallelizes only kernel computationAsy-GCD · ijcnn1, covtype, webspamtime to convergenceImproved
per-core LRU kernel cache in contiguous memory instead of shared LRUAsy-GCD · multi-socket NUMA machinescalabilityImproved
kmeans-based variable partitioning to minimize between-cluster connectionsAsy-GCD · kernel SVM datasetsconvergence speedImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy