Convex structure learning in log-linear models: Beyond pairwise potentials

Journal of Machine Learning Research

Volumn 9, Issue , 2010, Pages 709-716

  Schmidt, Mark ^a   Murphy, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE SET METHODS; ARBITRARY ORDER; CONVEX STRUCTURE; DYKSTRA'S ALGORITHM; EXPONENTIAL NUMBERS; HIGHER ORDER; LOGLINEAR MODEL; OVERLAPPING GROUPS; SPECTRAL PROJECTED GRADIENT METHOD; STRUCTURE-LEARNING; TEST SETS;

ARTIFICIAL INTELLIGENCE;

REGRESSION ANALYSIS;

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

References (33)

1. F. Bach. Exploring large feature spaces with hierarchical multiple kernel learning. NIPS, 2008.
2. O. Banerjee, L. El Ghaoui, and A. d'Aspremont. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. JMLR, 2008.
3. D. Bertsekas, A. Nedic, and A. Ozdaglar. Convex Analysis and Optimization. Athena Scientific, 2003.
4. J. Besag. Statistical analysis of non-lattice data. The Statistician, 24(3):179-195, 1975.
5. E. Birgin, J. Martínez, and M. Raydan. Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim., 10(4):1196-1211, 2000.
6. Y. Bishop, S. Fienberg, and P. Holland. Discrete Multivariate Analysis. MIT Press, 1975.
7. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
8. L. Bregman. The method of successive projection for finding a common point of convex sets. Dokl. Akad. Nauk SSSR, 162(3):487-490, 1965.
9. English translation in Soviet Math. Dokl., 6:688-692, 1965.
10. A. Chechetka and C. Guestrin. Efficient principled learning of thin junction trees. NIPS, 2007.
11. C. Dahinden, G. Parmigiani, M. Emerick, and P. Bühlmann. Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries. BMC Bioinf., 8(476), 2007.
12. F. Deutsch and H. Hundal. The rate of convergence of Dykstra's cyclic projections algorithm: The polyhedral case. Numer. Funct. Anal. Optim., 15(5):537-565, 1994.
13. A. Dobra and H. Massam. The mode oriented stochastic search (MOSS) algorithm for log-linear models with conjugate priors. Technical report, University of Washington, 2008.
14. R. Dykstra. An algorithm for restricted least squares regression. JASA, 78(384):837-842, 1983.
15. D. Edwards and T. Havránek. A fast procedure for model search in multidimensional contingency tables. Biometrika, 72(2):339-351, 1985.
16. A. Elisseeff and J. Weston. Kernel methods for multilabelled classification and categorical regression problems. In NIPS, 2002.
17. M. Everingham, L. Van Gool, C. Williams, J. Winn, and A. Zisserman. The PASCAL Visual Object Classes Challenge 2007 (VOC2007) Results, 2007.
18. M. Figueiredo, R. Nowak, and S. Wright. Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Sign. Proces., 1(4):586-597, 2007.
19. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Inf. Retrieval, 4(2):133-151, 2001.
20. H. Höing and R. Tibshirani. Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods. JMLR, 10:883-906, 2009.
21. L. Jacob, G. Obozinski, and J. Vert. Group Lasso with overlap and graph Lasso. Proceedings of the 26th Annual International Conference on Machine Learning, 2009.
22. S. Lee, V. Ganapathi, and D. Koller. Efficient structure learning of Markov networks using l1-regularization. NIPS, 2006.
23. Y. Nesterov. Introductory Lectures on Convex Optimization. Kluwer Academic Publishers, 2003.
24. M. Qazi, G. Fung, S. Krishnan, R. Rosales, H. Steck, R. Rao, D. Poldermans, and D. Chandrasekaran. Automated heart wall motion abnormality detection from ultrasound images using Bayesian networks. IJCAI, 2007.
25. K. Sachs, O. Perez, D. Pe'er, D. Laufienburger, and G. Nolan. Causal protein-signaling networks derived from multiparameter single-cell data. Science, 308 (5721):523-529, 2005.
26. M. Schmidt, K. Murphy, G. Fung, and R. Rosales. Structure learning in random fields for heart motion abnormality detection. CVPR, 2008.
27. M. Schmidt, E. van den Berg, M. Friedlander, and K. Murphy. Optimizing costly functions with simple constraints: A limited-memory projected quasi-Newton algorithm. AISTATS, 2009.
28. E. van den Berg and M. Friedlander. Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput., 31(2):890-912, 2008.
29. J. von Neumann. Functional Operators, vol. II, The Geometry of Orthogonal Spaces, volume 22 of Annals of Mathematical Studies. Princeton University Press, 1950. This is a reprint of notes first distributed in 1933.
30. M. Wainwright and M. Jordan. Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn., 1(1-2):1-305, 2008.
31. M. Wainwright, P. Ravikumar, and J. Lafferty. Highdimensional graphical model selection using l1- regularized logistic regression. NIPS, 2006.
32. J. Whittaker. Graphical Models in Applied Multivariate Statistics. Wiley, 1990.
33. P. Zhao, G. Rocha, and B. Yu. The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics, 37(6A):3468-3497, 2009.