atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Feature-distributed sparse regression: a screen-and-clean approach

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse regression with guarantees · 6 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use sketching (sketch size n ~ s log d) in the cleaning stage instead of sending full Gram datafeature-distributed sparse regression (SCREEN-AND-CLEAN) · theoretical communication costcommunication cost (bits): O(mN^2) reduced to Õ(mNs)Helped
Increase sketch size n so contraction factor shrinks (fewer iterations, more bits per round) (ablation)SCREEN-AND-CLEAN cleaning stage · simulation N=1000, D=10000, s=10prediction error convergence per iterationHelped
Screen features by SIS before cleaning (vs. using all D features)SCREEN-AND-CLEAN · simulation D=3000, varying Nprediction errorNo clear effect
Replace DECO with SCREEN-AND-CLEAN (SC)feature-distributed sparse regression · simulation D=3000, varying N, Gaussian and correlated designsprediction errorHelped
Spark implementation: increase number of machines from 1 to 16SCREEN-AND-CLEAN Spark implementation · 6000 x 200000 Gaussian, 20 nodesrunning time (s): running time roughly halves per doubling of machinesHelped

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