Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression

Pattern Recognition

Volumn 48, Issue 1, 2015, Pages 231-243

  Pan, Zheng ^a,b   Zhang, Changshui ^a,b  

^a TSINGHUA UNIVERSITY   (China)

^b TSINGHUA NATIONAL LABORATORY FOR INFORMATION SCIENCE AND TECHNOLOGY   (China)

Author keywords

Coordinate descent; Non convex regularization; Sparse eigenvalue; Sparse estimation

Indexed keywords

COORDINATE DESCENT; EIGEN-VALUE; NON-CONVEX REGULARIZATION; SPARSE ESTIMATION;

EID: 84908024543     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2014.06.018     Document Type: Article

References (42)

1. A. Beck, and M. Teboulle A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM J. Imaging Sci. 2 1 2009 183 202
2. P.J. Bickel, Y. Ritov, and A.B. Tsybakov Simultaneous analysis of Lasso and Dantzig selector Ann. Stat. 37 4 2009 1705 1732
3. P. Breheny, and J. Huang Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection Ann. Appl. Stat. 5 1 2011 232
4. 1 minimization IEEE Trans. Inf. Theory 55 7 2009 3388 3397
5. E. Candès, and T. Tao The Dantzig selector: statistical estimation when p is much larger than n Ann. Stat. 35 6 2007 2313 2351
6. E.J. Candès, and Y. Plan A probabilistic and ripless theory of compressed sensing IEEE Trans. Inf. Theory 57 November (11) 2011 7235 7254
7. E.J. Candès, and T. Tao Decoding by linear programming IEEE Trans. Inf. Theory 51 12 2005 4203 4215
8. 1 minimization J. Fourier Anal. Appl. 14 5 2008 877 905
9. R. Chartrand, Fast algorithms for nonconvex compressive sensing: MRI reconstruction from very few data, in: IEEE International Symposium on Biomedical Imaging: From Nano to Macro, ISBI'09, IEEE, 2009, pp. 262-265.
10. S.S. Chen, D.L. Donoho, and M.A. Saunders Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 1 1999 33 61
11. Xiaojun Chen, Dongdong Ge, Zizhuo Wang, Yinyu Ye, Complexity of unconstrained L2-Lp minimization, Math. Programm. (2011) 1-13.
12. p sparse recovery can fail for 0 < p ≤ 1 IEEE Trans. Inf. Theory 55 May (5) 2009 2203 2214
13. Marco F. Duarte, Mark A. Davenport, Dharmpal Takhar, Jason N. Laska, Ting Sun, Kevin F. Kelly, and Richard G. Baraniuk Single-pixel imaging via compressive sampling IEEE Signal Process. Mag. 25 2 2008 83 91
14. J. Fan, and R. Li Variable selection via nonconcave penalized likelihood and its oracle properties J. Am. Stat. Assoc. 96 456 2001 1348 1360
15. S. Foucart, and M.J. Lai Sparsest solutions of underdetermined linear systems via lq-minimization for 0 < q ≤ 1 Appl. Comput. Harmon. Anal. 26 3 2009 395 407
16. R. Garg, R. Khandekar, Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property, in: ICML 2009, 2009.
17. D. Geman, and C. Yang Nonlinear image recovery with half-quadratic regularization IEEE Trans. Image Process. 4 7 1995 932 946
18. Pinghua Gong, Changshui Zhang, Zhaosong Lu, Jianhua Z. Huang, Jieping Ye, A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems, in: ICML 2013, 2013.
19. J. Huang, S. Ma, and C.H. Zhang Adaptive Lasso for sparse high-dimensional regression models Stat. Sin. 18 4 2008 1603
20. D.R. Hunter, and R. Li Variable selection using MM algorithms Ann. Stat. 33 4 2005 1617
21. V. Koltchinskii The Dantzig selector and sparsity oracle inequalities Bernoulli 15 3 2009 799 828
22. J. Mairal, M. Elad, and G. Sapiro Sparse representation for color image restoration IEEE Trans. Image Process. 17 1 2008 53 69
23. R. Mazumder, J.H. Friedman, and T. Hastie Sparsenet: coordinate descent with nonconvex penalties J. Am. Stat. Assoc. 106 495 2011 1125 1138
24. Sahand N. Negahban, Pradeep Ravikumar, Martin J. Wainwright, and Bin Yu A unified framework for high-dimensional analysis of m-estimators with decomposable regularizers Stat. Sci. 27 4 2012 538 557
25. Zheng Pan, Changshui Zhang, High-dimensional inference via Lipschitz sparsity-yielding regularizers, in: AISTATS 2013, 2013.
26. J.C. Ramirez-Giraldo, J. Trzasko, S. Leng, L. Yu, A. Manduca, and C.H. McCollough Nonconvex prior image constrained compressed sensing (NCPICCS): theory and simulations on perfusion CT Med. Phys. 38 4 2011 2157
27. Xiaotong Shen, Wei Pan, and Yunzhang Zhu Likelihood-based selection and sharp parameter estimation J. Am. Stat. Assoc. 107 497 2012 223 232
28. Xiaotong Shen, Wei Pan, Yunzhang Zhu, and Hui Zhou On constrained and regularized high-dimensional regression Ann. Inst. Stat. Math. 1 2013 1 26
29. J. Shi, X. Ren, G. Dai, J. Wang, Z. Zhang, A non-convex relaxation approach to sparse dictionary learning, in: CVPR 2011, 2011.
30. E.Y. Sidky, R. Chartrand, X. Pan, Image reconstruction from few views by non-convex optimization, in: Nuclear Science Symposium Conference Record, 2007 (NSS'07), vol. 5, IEEE, 2007, pp. 3526-3530.
31. J.A. Tropp, and A.C. Gilbert Signal recovery from random measurements via orthogonal matching pursuit IEEE Trans. Inf. Theory 53 12 2007 4655 4666
32. J. Trzasko, and A. Manduca Relaxed conditions for sparse signal recovery with general concave priors IEEE Trans. Signal Process. 57 11 2009 4347 4354
33. J. Trzasko, A. Manduca, E. Borisch, Sparse MRI reconstruction via multiscale l0-continuation, in: IEEE/SP 14th Workshop on SSP'07, 2007.
34. J. Trzasko, A. Manduca, and E. Borisch Highly undersampled magnetic resonance image reconstruction via homotopic l0-minimization IEEE Trans. Med. Imaging 28 1 2009 106 121
35. 0-minimization with application to MR image recovery, in: Medical Imaging, International Society for Optics and Photonics, 2008.
36. F. Ye, and C.H. Zhang Rate minimaxity of the Lasso and Dantzig selector for the lq loss in lr balls J. Mach. Learn. Res. 2010 3519 3540
37. C.H. Zhang Nearly unbiased variable selection under minimax concave penalty Ann. Stat. 38 2 2010 894 942
38. C.H. Zhang, T. Zhang, A general theory of concave regularization for high dimensional sparse estimation problems, Stat. Sci., 2012.
39. Tong Zhang Analysis of multi-stage convex relaxation for sparse regularization J. Mach. Learn. Res. 11 2010 1081 1107
40. Tong Zhang Sparse recovery with orthogonal matching pursuit under rip IEEE Trans. Inf. Theory 57 September (9) 2011 6215 6221
41. Tong Zhang Multi-stage convex relaxation for feature selection Bernoulli 19 5B 2013 2277 2293
42. H. Zou The adaptive Lasso and its oracle properties J. Am. Stat. Assoc. 101 476 2006 1418 1429