DO SEMIDEFINITE RELAXATIONS SOLVE SPARSE PCA UP TO THE INFORMATION LIMIT
暂无分享,去创建一个
[1] R. Muirhead. Aspects of Multivariate Statistical Theory , 1982, Wiley Series in Probability and Statistics.
[2] J. Schmee. An Introduction to Multivariate Statistical Analysis , 1986 .
[3] C. O'Connor. An introduction to multivariate statistical analysis: 2nd edn. by T. W. Anderson. 675 pp. Wiley, New York (1984) , 1987 .
[4] V. N. Bogaevski,et al. Matrix Perturbation Theory , 1991 .
[5] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[6] Noga Alon,et al. Finding a large hidden clique in a random graph , 1998, SODA '98.
[7] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[8] U. Feige,et al. Finding and certifying a large hidden clique in a semirandom graph , 2000, Random Struct. Algorithms.
[9] P. Massart,et al. Adaptive estimation of a quadratic functional by model selection , 2000 .
[10] I. Johnstone. On the distribution of the largest eigenvalue in principal components analysis , 2001 .
[11] Hongyuan Zha,et al. Low-Rank Approximations with Sparse Factors I: Basic Algorithms and Error Analysis , 2001, SIAM J. Matrix Anal. Appl..
[12] Olivier Ledoit,et al. Some hypothesis tests for the covariance matrix when the dimension is large compared to the sample size , 2002 .
[13] I. Jolliffe,et al. A Modified Principal Component Technique Based on the LASSO , 2003 .
[14] Noureddine El Karoui. On the largest eigenvalue of Wishart matrices with identity covariance when n, p and p/n tend to infinity , 2003, math/0309355.
[15] J. W. Silverstein,et al. Eigenvalues of large sample covariance matrices of spiked population models , 2004, math/0408165.
[16] Anja Vogler,et al. An Introduction to Multivariate Statistical Analysis , 2004 .
[17] Shai Avidan,et al. Spectral Bounds for Sparse PCA: Exact and Greedy Algorithms , 2005, NIPS.
[18] R. Tibshirani,et al. Sparse Principal Component Analysis , 2006 .
[19] Shai Avidan,et al. Generalized spectral bounds for sparse LDA , 2006, ICML.
[20] Michael I. Jordan,et al. A Direct Formulation for Sparse Pca Using Semidefinite Programming , 2004, SIAM Rev..
[21] D. Paul. ASYMPTOTICS OF SAMPLE EIGENSTRUCTURE FOR A LARGE DIMENSIONAL SPIKED COVARIANCE MODEL , 2007 .
[22] P. Bickel,et al. Regularized estimation of large covariance matrices , 2008, 0803.1909.
[23] Jianhua Z. Huang,et al. Sparse principal component analysis via regularized low rank matrix approximation , 2008 .
[24] Alexandre d'Aspremont,et al. First-Order Methods for Sparse Covariance Selection , 2006, SIAM J. Matrix Anal. Appl..
[25] M. Wainwright,et al. High-dimensional analysis of semidefinite relaxations for sparse principal components , 2008, 2008 IEEE International Symposium on Information Theory.
[26] I. Johnstone,et al. On Consistency and Sparsity for Principal Components Analysis in High Dimensions , 2009, Journal of the American Statistical Association.
[27] U. Feige,et al. Finding hidden cliques in linear time , 2009 .
[28] R. Tibshirani,et al. A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. , 2009, Biostatistics.
[29] B. Nadler. Finite sample approximation results for principal component analysis: a matrix perturbation approach , 2009, 0901.3245.
[30] Heng Tao Shen,et al. Principal Component Analysis , 2009, Encyclopedia of Biometrics.
[31] Stephen A. Vavasis,et al. Nuclear norm minimization for the planted clique and biclique problems , 2009, Math. Program..
[32] Yong Zhang,et al. An augmented Lagrangian approach for sparse principal component analysis , 2009, Mathematical Programming.
[33] P. Rigollet,et al. Optimal detection of sparse principal components in high dimension , 2012, 1202.5070.
[34] T. Cai,et al. Sparse PCA: Optimal rates and adaptive estimation , 2012, 1211.1309.
[35] Vincent Q. Vu,et al. MINIMAX SPARSE PRINCIPAL SUBSPACE ESTIMATION IN HIGH DIMENSIONS , 2012, 1211.0373.
[36] Andrea Montanari,et al. Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time , 2013, ArXiv.
[37] Zongming Ma. Sparse Principal Component Analysis and Iterative Thresholding , 2011, 1112.2432.
[38] Philippe Rigollet,et al. Complexity Theoretic Lower Bounds for Sparse Principal Component Detection , 2013, COLT.
[39] Yuval Peres,et al. Finding Hidden Cliques in Linear Time with High Probability , 2010, Combinatorics, Probability and Computing.
[40] B. Nadler,et al. MINIMAX BOUNDS FOR SPARSE PCA WITH NOISY HIGH-DIMENSIONAL DATA. , 2012, Annals of statistics.
[41] Andrea Montanari,et al. Information-theoretically optimal sparse PCA , 2014, 2014 IEEE International Symposium on Information Theory.
[42] Zhaoran Wang,et al. Nonconvex Statistical Optimization: Minimax-Optimal Sparse PCA in Polynomial Time , 2014, ArXiv.
[43] Quentin Berthet,et al. Statistical and computational trade-offs in estimation of sparse principal components , 2014, 1408.5369.
[44] Vincent Q. Vu,et al. Sparsistency and agnostic inference in sparse PCA , 2014, 1401.6978.
[45] Andrea Montanari,et al. Finding Hidden Cliques of Size $$\sqrt{N/e}$$N/e in Nearly Linear Time , 2013, Found. Comput. Math..