AI Paper Atlas

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

Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Sets

Jie Wang, Zhanqiu Zhang, Jieping Ye

JMLR 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse regression with guarantees

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
add TLFre screening to the SGL solverSGL solver (Liu et al., 2009) · Synthetic 1speedup: 84.46 at tan(5°) down to 10.18 at tan(85°)Improved
add TLFre screening to the SGL solverSGL solver (Liu et al., 2009) · ADNI+GMVspeedup: 30652.56 -> 372.04 seconds at tan(5°), speedup 82.39Improved
add TLFre screening to the SGL solverSGL solver (Liu et al., 2009) · news20.binaryspeedup: 1233401.05 -> 1434.49 seconds, speedup 859.82Improved
add DPC screening to the nonnegative Lasso solvernonnegative Lasso solver · MNISTspeedup: 3000.69 -> 9.31 seconds, speedup 322.31Improved
add DPC screening to the nonnegative Lasso solvernonnegative Lasso solver · SVHNspeedup: 24761.07 -> 104.93 seconds, speedup 235.98Improved
increase alpha (larger group-lasso weight) in TLFre (ablation)TLFre · Synthetic 1speedup: 84.46 -> 10.18Hurt

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