AI Paper Atlas

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

A Tight Bound of Hard Thresholding

Jie Shen, Ping Li

JMLR 2018 · Learning theory and algorithms › Matrix and tensor methods · approach: Sparse regression with guarantees · 64 citations (OpenAlex)

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
use HT-SVRG (stochastic) instead of batch PGDhard thresholding sparse recovery · Sparse recovery phase transitionpercentage of successful recoveryNo clear effect
use PGD with flexible sparsity k and step size instead of IHT (k=K, eta=1)batch hard thresholding · Sparse recovery phase transitionpercentage of successful recoveryImproved
raise sparsity parameter k above the true sparsity K (ablation)HT-SVRG · Sparse recovery, K=4, n=100signal recoveryImproved
increase update frequency m (larger inner loop) (ablation)HT-SVRG · Sparse recovery, K=4, n=100convergence speed per full gradientMixed
increase step size eta to 3 or above (ablation)HT-SVRG · Sparse recovery, K=4, n=100convergence: divergence when eta >= 3Hurt
increase m for very small step size eta (ablation)HT-SVRG · Sparse recovery, small stepconvergenceImproved

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