A Comparison of the Lasso and Marginal Regression
暂无分享,去创建一个
Larry A. Wasserman | Zhigang Yao | Christopher R. Genovese | Jiashun Jin | L. Wasserman | C. Genovese | Jiashun Jin | Zhigang Yao
[1] D. Donoho,et al. Neighborliness of randomly projected simplices in high dimensions. , 2005, Proceedings of the National Academy of Sciences of the United States of America.
[2] N. Meinshausen,et al. High-dimensional graphs and variable selection with the Lasso , 2006, math/0608017.
[3] Lie Wang,et al. Shifting Inequality and Recovery of Sparse Signals , 2010, IEEE Transactions on Signal Processing.
[4] W Y Zhang,et al. Discussion on `Sure independence screening for ultra-high dimensional feature space' by Fan, J and Lv, J. , 2008 .
[5] P. Spirtes,et al. Causation, prediction, and search , 1993 .
[6] D. Donoho,et al. Higher criticism for detecting sparse heterogeneous mixtures , 2004, math/0410072.
[7] H. Zou. The Adaptive Lasso and Its Oracle Properties , 2006 .
[8] L. Wasserman,et al. HIGH DIMENSIONAL VARIABLE SELECTION. , 2007, Annals of statistics.
[9] Emmanuel J. Cand. Near-ideal model selection by '1 minimization , 2008 .
[10] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[11] Jiashun Jin,et al. UPS delivers optimal phase diagram in high-dimensional variable selection , 2010, 1010.5028.
[12] Xiaoming Huo,et al. Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.
[13] Wenjiang J. Fu,et al. Asymptotics for lasso-type estimators , 2000 .
[14] Cun-Hui Zhang,et al. Scaled sparse linear regression , 2011, 1104.4595.
[15] Tom Burr,et al. Causation, Prediction, and Search , 2003, Technometrics.
[16] R. Tibshirani,et al. Least angle regression , 2004, math/0406456.
[17] E. Candès,et al. Near-ideal model selection by ℓ1 minimization , 2008, 0801.0345.
[18] L. Wasserman. All of Nonparametric Statistics , 2005 .
[19] Peng Zhao,et al. On Model Selection Consistency of Lasso , 2006, J. Mach. Learn. Res..
[20] M. Maathuis,et al. Variable selection in high-dimensional linear models: partially faithful distributions and the PC-simple algorithm , 2009, 0906.3204.
[21] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[22] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[23] Jianqing Fan,et al. Variable Selection via Penalized Likelihood , 1999 .
[24] D. Donoho. For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .
[25] J. Robins,et al. Uniform consistency in causal inference , 2003 .
[26] Jean-Jacques Fuchs,et al. Recovery of exact sparse representations in the presence of noise , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[27] Martin J. Wainwright,et al. Sharp thresholds for high-dimensional and noisy recovery of sparsity , 2006, ArXiv.
[28] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[29] Jianqing Fan,et al. Sure independence screening for ultrahigh dimensional feature space , 2006, math/0612857.
[30] J. Wellner,et al. Empirical Processes with Applications to Statistics , 2009 .
[31] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[32] Larry Wasserman,et al. All of Nonparametric Statistics (Springer Texts in Statistics) , 2006 .
[33] David L. Donoho,et al. High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..
[34] N. Meinshausen,et al. Estimating the proportion of false null hypotheses among a large number of independently tested hypotheses , 2005, math/0501289.
[35] John D. Storey,et al. Empirical Bayes Analysis of a Microarray Experiment , 2001 .
[36] Deanna Needell,et al. Non-Asymptotic Theory of Random Matrices , 2006 .
[37] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[38] Jiashun Jin. Proportion of non‐zero normal means: universal oracle equivalences and uniformly consistent estimators , 2008 .
[39] Terence Tao,et al. The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.
[40] Jean-Jacques Fuchs,et al. Recovery of exact sparse representations in the presence of bounded noise , 2005, IEEE Transactions on Information Theory.