atlas

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

On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit

ICML 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Signal recovery and phase retrieval · 18 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 approximate (gradient-descent) solutions for the restricted subproblem instead of exact solves (ablation)HTP · Numerical study, sparsity sweep s=1 to 50iterations to support recoveryNo clear effect
Use approximate subproblem solutions (GD with 50 steps) instead of exact solves (ablation)HTP · Numerical study, sparsity sweep s=1 to 50percentage of successNo clear effect
Increase number of measurements N (condition number decreases) (ablation)HTP · Numerical study, s=5, N from 1 to 100iterations to support recoveryHelped
Increase number of measurements N above threshold of 20 (ablation)HTP · Numerical study, s=5percentage of successHelped
Use a proxy function F(x) with added l2 regularization (e.g., least squares plus alpha||x||^2) rather than the sparsity-constrained objectiveHTP · Theoretical statistical models (sparse linear / logistic regression)support recovery guaranteeHelped

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