High-Dimensional Graphical Model Selection Using ℓ1-Regularized Logistic Regression

NIPS 2006: Proceedings of the 19th International Conference on Neural Information Processing Systems

Volumn , Issue , 2006, Pages 1465-1472

  Wainwright, Martin J ^a   Ravikumar, Pradeep ^b   Lafferty, John D ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

concentration; convex risk minimization; Graphical models; high dimensional asymptotics; Markov random fields; model selection; structure learning; 1 regularization

Indexed keywords

GRAPH THEORY; IMAGE SEGMENTATION; MARKOV PROCESSES; REGRESSION ANALYSIS;

ASYMPTOTICS; CONCENTRATION; CONVEX RISK MINIMIZATION; GRAPHICAL MODEL; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL ASYMPTOTIC; HIGHER-DIMENSIONAL; MARKOV RANDOM FIELDS; MODEL SELECTION; REGULARISATION; RISK MINIMIZATION; STRUCTURE-LEARNING; ℓ1-REGULARIZATION;

GRAPHIC METHODS;

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

References (12)

1. D. Chickering. Learning Bayesian networks is NP-complete. Proceedings of AI and Statistics, 1995.
2. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans. Info. Theory, 14(3):462-467, 1968.
3. S. Dasgupta. Learning polytrees. In Uncertainty on Artificial Intelligence, pages 134-14, 1999.
4. 1 minimization. Proc. Natl. Acad. Sci., 100:2197-2202, March 2003.
5. N. Meinshausen and P. Bühlmann. High dimensional graphs and variable selection with the lasso. Annals of Statistics, 34(3), 2006.
6. 2 regularization, and rotational invariance. In International Conference on Machine Learning, 2004.
7. D. Pollard. Convergence of stochastic processes. Springer-Verlag, New York, 1984.
8. P. Spirtes, C. Glymour, and R. Scheines. Causation, prediction and search. MIT Press, 2000.
9. N. Srebro. Maximum likelihood bounded tree-width Markov networks. Artificial Intelligence, 143(1):123-138, 2003.
10. J. A. Tropp. Just relax: Convex programming methods for identifying sparse signals. IEEE Trans. Info. Theory, 51(3):1030-1051, March 2006.
11. 1-constrained quadratic programs. In Proc. Allerton Conference on Communication, Control and Computing, October 2006.
12. P. Zhao and B. Yu. Model selection with the lasso. Technical report, UC Berkeley, Department of Statistics, March 2006. Accepted to Journal of Machine Learning Research.