Convex optimization techniques for fitting sparse Gaussian graphical models

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 89-96

  Banerjee, Onureena ^a   El Ghaoui, Laurent ^a   D'Aspremont, Alexandre ^b   Natsoulis, Georges ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c Entelos Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION TECHNIQUES; COVARIANCE MATRIX; FITTING SPARSE GAUSSIAN GRAPHICAL MODELS; INTERIOR POINT ALGORITHMS;

DATA REDUCTION; GRAPHIC METHODS; LARGE SCALE SYSTEMS; LEARNING ALGORITHMS; MAXIMUM LIKELIHOOD ESTIMATION; PROBLEM SOLVING;

OPTIMIZATION;

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

References (18)

1. Bertsekas, D. (1998). Nonlinear programming. Athena Scientific.
2. Dahl, J., Roychowdhury, V., & Vandenberghe, L. (2005). Maximum likelihood estimation of gaussian graphical models: numerical implementation and topology selection. UCLA preprint.
3. d'Aspremont, A., El Ghaoui, L., Jordan, M., & Lanckriet, G. R. G. (2004). A direct formulation for sparse PCA using semidefinite programming. Advances in Neural Information Processing Systems, 17.
4. Dempster, A. P. (1972). Covariance selection. Biometrics, 28, 157-75.
5. Dobra, A., Hans, C., Jones, B., Nevins, J. J. R., Yao, G., & West, M. (2004). Sparse graphical models for exploring gene expression data. Journal of Multivariate Analysis, 90, 196-212.
6. Dobra, A., & West, M. (2004). Bayesian covariance selection. Working paper, ISDS, Duke University.
7. Huang, J. Z., Liu, N., & Pourahmadi, M. (2005). Covariance selection and estimation via penalized normal likelihood. Wharton Preprint.
8. Hughes, T. R., Marton, M. J., Jones, A. R., Roberts, C. J., Stoughton, R., Armour, C. D., Bennett, H. A., Coffey, E., Dai, H., He, Y. D., Kidd, M. J., King, A. M., Meyer, M. R., Slade, D., Lum, P. Y., Stepaniants, S. B., Shoemaker, D. D., Gachotte, D., Chakraburtty, K., Simon, J., Bard, M., & Friend, S. H. (2000). Functional discovery via a compendium of expression profiles. Cell, 102, 109-126.
9. Lauritzen, S. (1996). Graphical models. Springer Verlag.
10. Li, H., & Gui, J. (2005). Gradient directed regularization for sparse gaussian concentration graphs, with applications to inference of genetic networks. University of Pennsylvania Technical Report.
11. Luo, Z. Q., & Tseng, P. (1992). On the convergence of the coordinate descent method for convex differentiable minimization. Journal of Optimization Theory and Applications, 72, 7-35.
12. Meinshausen, N., & Bühlmann, P. (2005). High dimensional graphs and variable selection with the lasso. Annals of statistics, in press.
13. Muirhead, R. J. (1982). Aspects of multivariate statistical theory. John Wiley and Sons, Inc.
14. Natsoulis, G., El Ghaoui, L., Lanckriet, G., Tolley, A., Leroy, F., Dunlea, S., Eynon, B., Pearson, C., Tugendreich, S., & Jarnagin, K. (2005). Classification of a large microarray data set: algorithm comparison and analysis of drug signatures. Genome Research, 15, 724-736.
15. Nesterov, Y. (2005). Smooth minimization of non-smooth functions. Math. Prog., Ser. A, 103, 127-152.
16. Schäfer, J., & Strimmer, K. (2005). A shrinkage approach to large-scale covariance matrix estimation and implications for functional genomics. Statistical Applications in Genetics and Molecular Biology, 4.
17. Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal statistical society, series B, 58.
18. Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998). Determinant maximization with linear matrix inequality constraints. SIAM Journal on Matrix Analysis and Applications, 19, 499-533.