atlas

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

Exact Recovery of Hard Thresholding Pursuit

NeurIPS 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse regression with guarantees · 15 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
Add debiasing step (S3, least-squares/loss minimization on selected support) to IHT, yielding HTP (ablation)HTP vs IHT · Simulated linear regression and logistic regression, k=70Perc. of relaxed and exact support recovery successHelped
Use sparsity level k slightly above true sparsity k̄ (relaxed k) in HTPHTP · Simulated linear regression, k̄=50Perc. of relaxed and exact support successHelped
Increase sample size nHTP · Simulated linear and logistic regressionPerc. of relaxed/exact support recovery successHelped
Relaxed support recovery is less sensitive to sparsity level k than exact recoveryHTP · Simulated linear regressionPerc. of success across kNo clear effect

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