Group model selection using marginal correlations: The good, the bad and the Ugly
暂无分享,去创建一个
[1] Yonina C. Eldar,et al. Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques From Noisy Measurements , 2010, IEEE Journal of Selected Topics in Signal Processing.
[2] Richard K. Burdick. Linear Models in Statistics , 2001, Technometrics.
[3] H. Rauhut,et al. Atoms of All Channels, Unite! Average Case Analysis of Multi-Channel Sparse Recovery Using Greedy Algorithms , 2008 .
[4] M. Yuan,et al. Model selection and estimation in regression with grouped variables , 2006 .
[5] Francis R. Bach,et al. Consistency of the group Lasso and multiple kernel learning , 2007, J. Mach. Learn. Res..
[6] I. Johnstone,et al. Adapting to unknown sparsity by controlling the false discovery rate , 2005, math/0505374.
[7] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[8] Joel A. Tropp,et al. ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION , 2006 .
[9] A. Rinaldo,et al. On the asymptotic properties of the group lasso estimator for linear models , 2008 .
[10] Waheed U. Bajwa,et al. On the Conditioning of Random Block Subdictionaries , 2010 .
[11] Yonina C. Eldar,et al. Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation , 2009, IEEE Transactions on Information Theory.
[12] Y. Benjamini,et al. Controlling the false discovery rate: a practical and powerful approach to multiple testing , 1995 .
[13] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[14] Assaf Naor,et al. On the Banach-Space-Valued Azuma Inequality and Small-Set Isoperimetry of Alon–Roichman Graphs , 2010, Combinatorics, Probability and Computing.
[15] René Vidal,et al. Block-Sparse Recovery via Convex Optimization , 2011, IEEE Transactions on Signal Processing.
[16] Michael I. Jordan,et al. Union support recovery in high-dimensional multivariate regression , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[17] Kam D. Dahlquist,et al. Regression Approaches for Microarray Data Analysis , 2002, J. Comput. Biol..
[18] W Y Zhang,et al. Discussion on `Sure independence screening for ultra-high dimensional feature space' by Fan, J and Lv, J. , 2008 .
[19] Yonina C. Eldar,et al. Rank Awareness in Joint Sparse Recovery , 2010, IEEE Transactions on Information Theory.
[20] Bhaskar D. Rao,et al. Sparse solutions to linear inverse problems with multiple measurement vectors , 2005, IEEE Transactions on Signal Processing.
[21] Jianqing Fan,et al. Sure independence screening for ultrahigh dimensional feature space , 2006, math/0612857.
[22] C. Darken,et al. Constructive Approximation Rates of Convex Approximation in Non-hilbert Spaces , 2022 .
[23] Yonina C. Eldar,et al. Block-Sparse Signals: Uncertainty Relations and Efficient Recovery , 2009, IEEE Transactions on Signal Processing.
[24] J. Tropp. Algorithms for simultaneous sparse approximation. Part II: Convex relaxation , 2006, Signal Process..
[25] Junzhou Huang,et al. The Benefit of Group Sparsity , 2009 .
[26] Joel A. Tropp,et al. Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit , 2006, Signal Process..
[27] C GilbertAnna,et al. Algorithms for simultaneous sparse approximation. Part II , 2006 .
[28] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .