On learning discrete graphical models using group-sparse regularization

Journal of Machine Learning Research

Volumn 15, Issue , 2011, Pages 378-387

  Jalali, Ali ^a   Ravikumar, Pradeep ^b   Vasuki, Vishvas ^b   Sanghavi, Sujay ^a  

^a ECE   (United States)

^b CS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSISTENCY ANALYSIS; GENERAL MODEL; GRAPH STRUCTURES; GRAPHICAL MODEL; HIGH PROBABILITY; HIGH-DIMENSIONAL; HIGHER ORDER; LOGISTIC REGRESSIONS; MAXIMUM DEGREE; MULTI-CLASS; NUMBER OF SAMPLES;

ARTIFICIAL INTELLIGENCE; C (PROGRAMMING LANGUAGE); GRAPHIC METHODS; LOGISTICS;

FACTOR ANALYSIS;

EID: 84862290493     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (37)

1. P. Abbeel, D. Koller, and A. Y. Ng. Learning factor graphs in polynomial time and sample complexity. Jour. Mach. Learning Res., 7:1743-1788, 2006.
2. F. Bach. Consistency of the group lasso and multiple kernel learning. Journal of Machine Learning Research, 9:1179-1225, 2008.
3. G. Bresler, E. Mossel, and A. Sly. Reconstruction of Markov random fields from samples:Some easy observations and algorithms. http://front.math.ucdavis. edu/0712.1402, 2008.
4. E. Candes and T. Tao. The Dantzig selector: Statistical estimation when p is much larger than n. Annals of Statistics, 2006.
5. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. Info. Theory, 14(3):462-467, 1968.
6. G. Cross and A. Jain. Markov random field texture models. IEEE Trans. PAMI, 5:25-39, 1983.
7. I. Csiszár and Z. Talata. Consistent estimation of the basic neighborhood structure of Markov random fields. The Annals of Statistics, 34(1):123-145, 2006.
8. C.Zhang and J.Huang. Model selection consistency of the lasso selection in high-dimensional linear regression. Annals of Statistics, 36:1567-1594, 2008.
9. C. Dahinden, G. Parmigiani, M.C. Emerick, and P. Buhlmann. Penalized likelihood for sparse contingency tables with an application to full-length cdna libraries.
10. C. Dahinden, M. Kalisch, and P. Buhlmann. Decomposition and model selection for large contingency tables. Biometrical Journal, 52(2):233-252, 2010.
11. S. Dasgupta. Learning polytrees. In Uncertainty on Artificial Intelligence, pages 134-14, 1999.
12. D. Donoho and M. Elad. Maximal sparsity representation via ℓ1 minimization. Proc. Natl. Acad. Sci., 100:2197-2202, March 2003.
13. M. Hassner and J. Sklansky. The use of Markov random fields as models of texture. Comp. Graphics Image Proc., 12:357-370, 1980.
14. E. Ising. Beitrag zur theorie der ferromagnetismus. Zeitschrift für Physik, 31:253-258, 1925.
15. B. Krishnapuram, L. Carin, M. A. T. Figueiredo, and A. J. Hartemink. Sparse multinomial logistic regression: Fast algorithms and generalization bounds. IEEE Trans. Pattern Anal. Mach. Intell., 27(6):957-968, 2005.
16. S. L. Lauritzen. Graphical Models. Oxford University Press, Oxford, 1996.
17. S.-I. Lee, V. Ganapathi, and D. Koller. Efficient structure learning of markov networks using l1-regularization. In Neural Information Processing Systems (NIPS) 19, 2007.
18. K. Lounici, A. B. Tsybakov, M. Pontil, and S. A. van de Geer. Taking advantage of sparsity in multi-task learning. In 22nd Conference On Learning Theory (COLT), 2009.
19. C. D. Manning and H. Schutze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
20. L. Meier, S. van de Geer, and P. Buhlmann. The group lasso for logistic regression. 70:53-71, 2008.
21. N. Meinshausen and P. Bühlmann. High dimensional graphs and variable selection with the lasso. Annals of Statistics, 34(3), 2006.
22. S. Negahban and M. J.Wainwright. Joint support recovery under high-dimensional scaling: Benefits and perils of ℓ1,∞-regularization. In Advances in Neural Information Processing Systems (NIPS), 2008.
23. A. Y. Ng. Feature selection, ℓ1 vs. ℓ2 regularization, and rotational invariance. In International Conference on Machine Learning, 2004.
24. G. Obozinski, M. J. Wainwright, and M. I. Jordan. Support union recovery in high-dimensional multivariate regression. Annals of Statistics, 2010.
25. P. Ravikumar, H. Liu, J. Lafferty, and L. Wasserman. Sparse additive models. Journal of the Royal Statistical Society, Series B, .
26. 1-regularized logistic regression. Annals of Statistics, 38(3):1287-1319, .
27. B. D. Ripley. Spatial statistics. Wiley, New York,1981.
28. A. Rothman, P. Bickel, E. Levina, and J. Zhu. Sparse permutation invariant covariance estimation. Electronic Journal on Statistics, 2:494-515, 2008.
29. P. Spirtes, C. Glymour, and R. Scheines. Causation, prediction and search. MIT Press, 2000.
30. N. Srebro. Maximum likelihood bounded treewidth Markov networks. Artificial Intelligence, 143(1):123-138, 2003.
31. J. A. Tropp. Just relax: Convex programming methods for identifying sparse signals. IEEE Trans. Info. Theory, 51(3):1030-1051, March 2006.
32. B. Turlach, W.N. Venables, and S.J. Wright. Simultaneous variable selection. Technometrics, 27:349-363, 2005.
33. M. J. Wainwright. Sharp thresholds for noisy and high-dimensional recovery of sparsity using ℓ1-constrained quadratic programming (lasso). IEEE Transactions on Information Theory, 55: 2183-2202, 2009.
34. 1-constrained quadratic programming (lasso). IEEE Transactions on Info. Theory, To appear. Original version: UC Berkeley Technical Report 709, May 2006.
35. J.W. Woods. Markov image modeling. IEEE Transactions on Automatic Control, 23:846-850, October 1978.
36. M. Yuan and Y. Lin. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society B, 1(68):49, 2006.
37. P. Zhao and B. Yu. On model selection consistency of lasso. J. of Mach. Learn. Res., 7:2541-2567, 2007.