Estimation of simultaneously sparse and low rank matrices

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 2, Issue , 2012, Pages 1351-1358

  Richard, Emile ^a   Savalle, Pierre André ^b   Vayatis, Nicolas ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b ECOLE CENTRALE PARIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; GENERALIZATION ERROR; LINK PREDICTION; LOW-RANK MATRICES; MATRIX ESTIMATION; OPTIMIZATION PROBLEMS; PROTEIN INTERACTION; SOCIAL NETWORKS; SYNTHETIC AND REAL DATA; TARGET MATRICES; TRACE-NORMS; UNDERLYING GRAPHS;

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

LEARNING SYSTEMS;

EID: 84867132315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Banerjee, O., El Ghaoui, L., and d'Aspremont, A. Model selection through sparse maximum likelihood estimation. Machine Learning Research 101, 2007.
2. Beck, A. and Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal of Imaging Sciences, 2(1): 183-202, 2009.
3. Bertsekas, D.P. Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. Optimization for Machine Learning, pp. 85, 2011.
4. Bien, J. and Tibshirani, R. Sparse estimation of a covariance matrix. Biometrika, 2010.
5. Bock, J.R. and Gough, D.A. Predicting protein-protein interactions from primary structure. Bioinformatics, 17(5):455-460, 2001.
6. Cai, J.F., Candes, E.J., and Shen, Z. A singular value thresholding algorithm for matrix completion. Arxiv preprint Arxiv.0810.3286, 2008.
7. Candes, E.J., Li, X., Ma, Y., and Wright, J. Robust principal component analysis? Arxiv preprint ArXiv:0912.3599, 2009.
8. Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., and Willsky, A.S. Rank-sparsity incoherence for matrix decomposition. SIAM J. Opt, 21:572-596, 2011.
9. Combettes, P.L. and Pesquet, J.C. Proximal splitting methods in signal processing. Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185-212, 2011.
10. D'Aspremont, A., El Ghaoui, L., Jordan, M.I., and Lanckriet, G.R.G. A direct formulation for sparse pca using semidefinite programming. SIAM review, 49(3):434-448, 2007.
11. El Karoui, N. Operator norm consistent estimation of large-dimensional sparse covariance matrices. Annals of Statistics, 2009.
12. Friedman, J., Hastie, T., and Tibshirani, R. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3):432, 2008.
13. Hazan, E. Sparse approximate solutions to semidefinite programs. In Proceedings of the 8th Latin American conference on Theoretical informatics, pp. 306-316. Springer-Verlag, 2008.
14. Hoyer, P. O. Non-negative Matrix Factorization with Sparseness Constraints. Journal of Machine Learning Research, 5:1457-1469, 2004.
15. Hu, P., Janga, S.C., Babu, M., Díaz-Mejía, J.J., Butland, G., Yang, W., Pogoutse, O., Guo, X., Phanse, S., Wong, P., et al. Global functional atlas of escherichia coli encompassing previously uncharacterized proteins. PLoS biology, 7(4):e1000096, 2009.
16. Jaggi, M. Convex optimization without projection steps. Arxiv preprint arXiv.1108.1170, 2011.
17. Jalali, A.and Chen, Y., Sanghavi, S., and Xu, H. Clustering partially observed graphs via convex optimization. ICML '11, 2011.
18. Kim, J. and Park, H. Sparse nonnegative matrix factorization for clustering. Technical report, Georgia Institute of Technology, 2008.
19. Koltchinskii, V., Lounici, K., and Tsybakov, A. Nuclear norm penalization and optimal rates for noisy matrix completion. Annals of Statistics, 2011.
20. Lee, D.D., Seung, H.S., et al. Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755):788-791, 1999.
21. Liben-Nowell, D. and Kleinberg, J. The link-prediction problem for social networks. Journal of the American society for information science and technology, 58(7):1019-1031, 2007.
22. Luo, X. High dimensional low rank and sparse covariance matrix estimation via convex minimization. Arxiv preprint arXiv:1111.1133, 2011.
23. Olkin, I. and Pratt, J.W. A multivariate tchebycheff inequality. The Annals of Mathematical Statistics, 29(1):226-234, 1958.
24. Raguet, H., Fadili, J., and Peyré, G. Generalized forward-backward splitting. Arxiv preprint arXiv:1108.4404, 2011.
25. Richard, E., Baskiotis, N., Evgeniou, Th., and Vayatis, N. Link discovery using graph feature tracking. Proceedings of Neural Information Processing Systems (NIPS), 2010.
26. Srebro, N. Learning with matrix factorizations. PhD thesis, MIT, 2004.
27. Srebro, N., Rennie, J., and Jaakkola, T. Maximum-margin matrix factorization. Advances in Neural Information Processing Systems, 17:1329-1336, 2005.
28. Tibshirani, R. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, 58:267-288, 1996.
29. Traud, A. L., Mucha, P. J., and Porter, M. A. Social structure of facebook networks. arXiv:1102.2166, 2011.
30. Yuan, M. and Lin, Y. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68(1):49-67, 2006.
31. Zou, H., Hastie, T., and Tibshirani, R. Sparse principal component analysis. Journal of Computational and Graphical Statistics, pp. 1-30, 2004.
32. Zou, Hui and Hastie, Trevor. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society, Series B, 67:301-320, 2005.