AI Paper Atlas

Research map / Optimization / Distributed and compressed

A distributed block coordinate descent method for training l1 regularized linear classifiers

Dhruv Mahajan, S. Sathiya Keerthi, S. Sundararajan

JMLR 2017 · Optimization › Distributed and compressed · approach: Local and asynchronous SGD

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 greedy S-scheme instead of random R-scheme variable selection (ablation)DBCD · KDD (P=25, tau=-1)outer iterations: 236 -> 8Improved
use greedy S-scheme instead of random R-scheme variable selection (ablation)PCD · KDD (P=25, tau=-1)outer iterations: 294 -> 12Improved
use greedy S-scheme instead of random R-scheme variable selection (ablation)DBCD · URL (P=25, tau=0)outer iterations: 101 -> 6Improved
use greedy S-scheme instead of random R-scheme variable selection (ablation)PCD · URL (P=25, tau=-1)outer iterations: 796 -> 196Improved
replace decoupled quadratic with joint nonlinear block optimization (DBCD-S vs PCD-S) (ablation)S-scheme methods · URL (P=25, tau=0)outer iterations: 65 -> 6Improved
replace decoupled quadratic with joint nonlinear block optimization (DBCD-S vs PCD-S) (ablation)S-scheme methods · KDD (P=25, tau=-2)outer iterations: 311 -> 104Improved
replace decoupled quadratic with joint nonlinear block optimization (DBCD-S vs PCD-S) (ablation)S-scheme methods · KDD (P=100, tau=-3)outer iterations: 650 -> 668Hurt
add line search to Richtarik-style updates (PCD-R) (ablation)RICHTARIK · KDD (P=25, WSS r=0.1)computation time per iteration (s): 0.022 -> 0.138Hurt
add 10 inner CD cycles and S-scheme to block update (DBCD-S vs DBCD-R) (ablation)DBCD · KDD (P=25, WSS r=0.1)computation time per iteration (s): 0.991 -> 5.054Hurt
increase nodes from 25 to 100DBCD-S · KDD (tau=-2)outer iterations: 104 -> 137No clear effect
increase nodes from 25 to 100DBCD-S · URL (tau=-1)outer iterations: 22 -> 28No clear effect
use ADMM instead of RICHTARIKdistributed l1 solver · URL (P=25, tau=-1)outer iterations: >800 -> 214Improved

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