Research map / Learning theory and algorithms / Matrix and tensor methods
Structured Sparse Regression via Greedy Hard Thresholding
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use IHT-FC instead of CoGEnT | overlapping group regression · poorly conditioned synthetic data | runtime: about 10 times faster | Helped |
| Use IHT rather than GOMP | overlapping group regression · poorly conditioned synthetic data, condition numbers as high as 200 | exact recovery: n∼1500 | Helped |
| Add the fully corrective step after greedy projection (ablation) | IHT · breast cancer tumor classification | misclassification rate | Helped |
| Use IHT-FC instead of GOMP | compressed sensing wavelet recovery · Blocks | MSE: .0011 -> .00029 | Helped |
| Use IHT-FC instead of CoGEnT | compressed sensing wavelet recovery · Blocks | MSE: .00066 -> .00029 | Helped |
| Use IHT-FC instead of CoGEnT | compressed sensing wavelet recovery · HeaviSine | MSE: .0021 -> .0026 | Hurt |
| Use IHT-FC instead of GOMP | compressed sensing wavelet recovery · Piece-Polynomial | MSE: .0017 -> .0016 | Helped |
| Use IHT-FC instead of CoGEnT | compressed sensing wavelet recovery · Piece-Polynomial | MSE: .0022 -> .0016 | Helped |
| Use IHT-FC instead of CoGEnT | compressed sensing wavelet recovery · Piece-Regular | MSE: .0015 -> .0025 | Hurt |
| Use IHT-FC instead of GOMP | compressed sensing wavelet recovery · Piece-Regular | MSE: .0039 -> .0025 | Helped |
Closest papers by meaning
- Hardness and Algorithms for Robust and Sparse Optimization (ICML 2022 · similarity 0.90)
- Learning Sparse Distributions using Iterative Hard Thresholding (NeurIPS 2019 · similarity 0.89)
- Sample Efficient Stochastic Gradient Iterative Hard Thresholding Method for Stochastic Sparse Linear Regression with Limited Attribute Observation (NeurIPS 2018 · similarity 0.88)
- Sparse Convex Optimization via Adaptively Regularized Hard Thresholding (ICML 2020 · similarity 0.88)
- Robust Sparse Regression with Non-Isotropic Designs (NeurIPS 2024 · similarity 0.86)
- Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees (ICML 2025 · similarity 0.86)
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.