On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit
暂无分享,去创建一个
[1] Po-Ling Loh,et al. Support recovery without incoherence: A case for nonconvex regularization , 2014, ArXiv.
[2] Martin J. Wainwright,et al. A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers , 2009, NIPS.
[3] Léon Bottou,et al. The Tradeoffs of Large Scale Learning , 2007, NIPS.
[4] Deanna Needell,et al. Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints , 2014, IEEE Transactions on Information Theory.
[5] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[6] Tong Zhang,et al. Accelerating Stochastic Gradient Descent using Predictive Variance Reduction , 2013, NIPS.
[7] Tong Zhang,et al. Sparse Recovery With Orthogonal Matching Pursuit Under RIP , 2010, IEEE Transactions on Information Theory.
[8] David L. Donoho,et al. Precise Undersampling Theorems , 2010, Proceedings of the IEEE.
[9] S. Osher,et al. Sparse Recovery via Differential Inclusions , 2014, 1406.7728.
[10] Inderjit S. Dhillon,et al. Orthogonal Matching Pursuit with Replacement , 2011, NIPS.
[11] I. Daubechies,et al. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.
[12] Lie Wang,et al. New Bounds for Restricted Isometry Constants , 2009, IEEE Transactions on Information Theory.
[13] Simon Foucart,et al. Hard Thresholding Pursuit: An Algorithm for Compressive Sensing , 2011, SIAM J. Numer. Anal..
[14] Deanna Needell,et al. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.
[15] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[16] Joel A. Tropp,et al. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.
[17] Xiao-Tong Yuan,et al. Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization , 2013, ICML.
[18] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[19] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[20] Mike E. Davies,et al. Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.
[21] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[22] M. Yuan,et al. On the non‐negative garrotte estimator , 2007 .
[23] Martin J. Wainwright,et al. Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$ -Constrained Quadratic Programming (Lasso) , 2009, IEEE Transactions on Information Theory.
[24] Tong Zhang,et al. On the Consistency of Feature Selection using Greedy Least Squares Regression , 2009, J. Mach. Learn. Res..
[25] Ping Li,et al. A Tight Bound of Hard Thresholding , 2016, J. Mach. Learn. Res..
[26] Jian Wang,et al. Recovery of Sparse Signals via Generalized Orthogonal Matching Pursuit: A New Analysis , 2016, IEEE Trans. Signal Process..
[27] Martin J. Wainwright,et al. Fast global convergence of gradient methods for high-dimensional statistical recovery , 2011, ArXiv.
[28] Trac D. Tran,et al. Robust Lasso With Missing and Grossly Corrupted Observations , 2011, IEEE Transactions on Information Theory.
[29] S. Frick,et al. Compressed Sensing , 2014, Computer Vision, A Reference Guide.
[30] Prateek Jain,et al. On Iterative Hard Thresholding Methods for High-dimensional M-Estimation , 2014, NIPS.
[31] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[32] Xiao-Tong Yuan,et al. Exact Recovery of Hard Thresholding Pursuit , 2016, NIPS.
[33] Peng Zhao,et al. On Model Selection Consistency of Lasso , 2006, J. Mach. Learn. Res..
[34] Olgica Milenkovic,et al. Subspace Pursuit for Compressive Sensing Signal Reconstruction , 2008, IEEE Transactions on Information Theory.
[35] S. Foucart,et al. Hard thresholding pursuit algorithms: Number of iterations ☆ , 2016 .