High-dimensional analysis of semidefinite relaxations for sparse principal components

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2454-2458

  Amini, Arash A ^a   Wainwright, Martin J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

A-PRIORI; COMPUTATIONALLY INEXPENSIVE; CUT-OFF; EIGEN VECTORS; HIGH-DIMENSIONAL; INTERNATIONAL SYMPOSIUM; PRINCIPAL COMPONENTS; PRINCIPAL COMPONENTS ANALYSIS; SAMPLE SIZES; SEMIDEFINITE RELAXATIONS;

COVARIANCE MATRIX; CYBERNETICS; INFORMATION THEORY; PRINCIPAL COMPONENT ANALYSIS; TECHNICAL PRESENTATIONS;

REUSABILITY;

EID: 52349090418     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595432     Document Type: Conference Paper

References (14)

1. A. Amini and M. J. Wainwright High-dimensional analysis of semidefinite relaxations for sparse principal components. Technical Report 747, UC Berkeley, Department of Statistics, March 2008. Posted at http://arxiv.org/abs/0803.4026.
2. T. W. Anderson. Introduction to Multivariate Statistical Analysis. Wiley Series in Probability and Mathematical Statistics. Wiley, New York, 1984.
3. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, Cambridge, UK, 2004.
4. E. Candes and T. Tao. The Dantzig selector: Statistical estimation when p is much larger than n. Annals of Statistics, 2006.
5. A. d'Aspremont, L. El Ghaoui, M. T. Jordan, and G. R. G. Lanckriet. A direct formulation for sparse PCA using semidefinite programming. SIAM Review, 49(3):434-448, July 2007.
6. D. Donoho. Compressed sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, April 2006.
7. S. Geman. A limit theorem for the norm of random matrices. Annals of Probability, 8(2):252-261, 1980.
8. I. M. Johnstone. On the distribution of the largest eigenvalue in principal components analysis. Annals of Statistics, 29(2):295-327, April 2001.
9. I. M. Johnstone and A. Lu. Sparse principal components. Technical report, Stanford University, July 2004.
10. I. T. Jolliffe, N. T. Trendafilov, and M. Uddin. A modified principal component technique based on the LASSO. Journal of Computational and Graphical Statistics, 12:531-547, 2003.
11. B. Moghaddam, Y. Weiss, and S. Avidan. Spectral bounds for sparse PCA: Exact and greedy algorithms. In Neural Information Processing Systems (NIPS), Vancouver, Canada, December 2005.
12. J. Tropp. Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Tram. Info Theory, 52(3):1030-1051, March 2006.
13. M. J. Wainwright. Sharp thresholds for high-dimensional and noisy recovery of sparsity using 11-constrained quadratic programs. Technical Report 709, Department of Statistics, UC Berkeley, 2006.
14. H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. Journal of Computational and Graphical Statistics, 15(2):265-286, 2004.