Stochastic Variance-Reduced Iterative Hard Thresholding in Graph Sparsity Optimization
Open Access
- 6 December 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 75-82
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF-REU (2349369)
This publication has 18 references indexed in Scilit:
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse ConstraintsIEEE Transactions on Information Theory, 2017
- Approximation Algorithms for Model-Based Compressive SensingIEEE Transactions on Information Theory, 2015
- A fast approximation algorithm for tree-sparse recovery2014
- Hard Thresholding Pursuit: An Algorithm for Compressive SensingSIAM Journal on Numerical Analysis, 2011
- Model-Based Compressive SensingIEEE Transactions on Information Theory, 2010
- Iterative hard thresholding for compressed sensingApplied and Computational Harmonic Analysis, 2009
- Model Selection and Estimation in Regression with Grouped VariablesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- A Gene-Expression Signature as a Predictor of Survival in Breast CancerNew England Journal of Medicine, 2002
- Atomic Decomposition by Basis PursuitSIAM Review, 2001
- Regression Shrinkage and Selection Via the LassoJournal of the Royal Statistical Society Series B: Statistical Methodology, 1996