atlas

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

Sparse Convex Optimization via Adaptively Regularized Hard Thresholding

ICML 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse regression with guarantees · 0 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
Apply hard thresholding to an adaptively regularized objective, with sampling-based unregularizationARHT · Sparse convex optimizationsparsity required for f(x) ≤ f(x*) + ε: O(s^*κ) vs. O(s^*min{κ(f(x^0)-f(x^*) )/ε, κ^2})Helped
Use OMPR with sparsity s satisfying the stated RIP tradeoffOMPR · General functions satisfying the RIP conditionRIP condition: δ_{2s^*} < 0.33; δ_{3s^*} < 0.47; δ_{4s^*} < 0.55; δ_{31s^*} < 0.83Mixed
Use OMPR with s = s*OMPR · Compressed sensingRIP condition: δ_{2s^*} < 1/3≈0.33Helped
Use ARHT with the stated signal-to-noise conditionARHT · Sparse support recoverysupport recovery: s = O(s^*κ)Helped

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