Structured learning of Gaussian graphical models

Advances in Neural Information Processing Systems

Volumn 1, Issue , 2012, Pages 620-628

  Mohan, Karthik ^a   Chung, Michael Jae Yoon ^a   Han, Seungyeop ^a   Witten, Daniela ^a   Lee, Su In ^a   Fazel, Maryam ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING DIRECTIONS METHOD OF MULTIPLIERS; CONVEX OPTIMIZATION PROBLEMS; CONVEX PROBLEMS; GAUSSIAN GRAPHICAL MODELS; GENE REGULATORY NETWORKS; GRAPHICAL LASSOS; HIGH-DIMENSIONAL; STRUCTURED LEARNING;

CONVEX OPTIMIZATION; DISEASES; GENE EXPRESSION; GRAPHIC METHODS;

PROBLEM SOLVING;

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

References (28)

1. K.V. Mardia, J. Kent, and J.M. Bibby. Multivariate Analysis. Academic Press, 1979.
2. S.L. Lauritzen. Graphical Models. Oxford Science Publications, 1996.
3. M. Yuan and Y. Lin. Model selection and estimation in the Gaussian graphical model. Biometrika, 94(10):19-35, 2007.
4. J. Friedman, T. Hastie, and R. Tibshirani. Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9:432-441, 2007.
5. O. Banerjee, L. E. El Ghaoui, and A. d'Aspremont. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. JMLR, 9:485-516, 2008.
6. D.M. Witten, J.H. Friedman, and N. Simon. New insights and faster computations for the graphical lasso. Journal of Computational and Graphical Statistics, 20(4):892-900, 2011.
7. K. Scheinberg, S. Ma, and D. Goldfarb. Sparse inverse covariance selection via alternating linearization methods. Advances in Neural Information Processing Systems, 2010.
8. P. Ravikumar, M.J. Wainwright, G. Raskutti, and B. Yu. Model selection in gaussian graphical models: high-dimensional consistency of l1-regularized MLE. Advances in NIPS, 2008.
9. C.J. Hsieh, M. Sustik, I. Dhillon, and P. Ravikumar. Sparse inverse covariance estimation using quadratic approximation. Advances in Neural Information Processing Systems, 2011.
10. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58:267-288, 1996.
11. A. D'Aspremont, O. Banerjee, and L. El Ghaoui. First-order methods for sparse covariance selection. SIAM Journal on Matrix Analysis and Applications, 30(1):56-66, 2008.
12. J. Guo, E. Levina, G. Michailidis, and J. Zhu. Joint estimation of multiple graphical models. Biometrika, 98(1):1-15, 2011.
13. P. Danaher, P. Wang, and D. Witten. The joint graphical lasso for inverse covariance estimation across multiple classes, 2012. http://arxiv.org/abs/1111. 0324.
14. R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight. Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society, Series B, 67:91-108, 2005.
15. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B, 68:49-67, 2007.
16. L. Jacob, G. Obozinski, and J.P. Vert. Group lasso with overlap and graph lasso. Proceedings of the 26th International Conference on Machine Learning, 2009.
17. G. Obozinski, L. Jacob, and J.P. Vert. Group lasso with overlaps: the latent group lasso approach. 2011. http://arxiv.org/abs/1110.0413.
18. M. Grant and S. Boyd. cvx version 1.21. "http://cvxr.com/cvx", October 2010.
19. A. Argyriou, C.A. Micchelli, and M. Pontil. Efficient first order methods for linear composite regularizers. 2011. http://arxiv.org/pdf/1104.1436.
20. X. Chen, Q. Lin, S. Kim, J.G. Carbonell, and E.P. Xing. Smoothing proximal gradient method for general structured sparse learning. Proceedings of the conference on Uncertainty in Artificial Intelligence, 2011.
21. S. Mosci, S. Villa, A. Verri, and L. Rosasco. A primal-dual algorithm for group sparse regularization with overlapping groups. Neural Information Processing Systems, pages 2604 - 2612, 2010.
22. S.P. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in ML, 3(1):1-122, 2010.
23. M. Hong and Z. Luo. On the linear convergence of the alternating direction method of multipliers. 2012. Available at arxiv.org/abs/1208.3922.
24. B. He, M. Tao, and X. Yuan. Alternating direction method with gaussian back substitution for separable convex programming. SIAM Journal of Optimization, pages 313 - 340, 2012.
25. J. Duchi and Y. Singer. Efficient online and batch learning using forward backward splitting. Journal of Machine Learning Research, pages 2899 - 2934, 2009.
26. Verhaak et al. Integrated genomic analysis identifies clinically relevant subtypes of glioblastoma characterized by abnormalities in PDGFRA, IDH1, EGFR, and NF1. Cancer Cell, 17(1):98-110, 2010.
27. Grosso et al. Chemokine CXCL13 is overexpressed in the tumour tissue and in the peripheral blood of breast cancer patients. British Journal Cancer, 99(6):930-938, 2008.
28. El-Haibi et al. CXCL13-CXCR5 interactions support prostate cancer cell migration and invasion in a PI3K p110-, SRC- and FAK-dependent fashion. The Journal of Immunology, 15(19):5968-73, 2009.