Laplace maximum margin Markov networks

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 1256-1263

  Zhu, Jun ^a,b   Xing, Eric P ^b   Zhang, Bo ^a  

^a TSINGHUA UNIVERSITY   (China)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; CONVEX OPTIMIZATION; FORECASTING; INFERENCE ENGINES; LAPLACE TRANSFORMS; MACHINE LEARNING; MARKOV PROCESSES; EDUCATION; IONIZING RADIATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; ROBOT LEARNING;

EFFICIENT LEARNING; GENERALIZATION BOUND; MARKOV NETWORKS; MAXIMUM MARGIN; OPTIMIZATION SOLVERS; STRUCTURAL BIAS; STRUCTURED PREDICTION; VARIATIONAL INFERENCE;

LEARNING ALGORITHMS; BAYESIAN NETWORKS;

BAYESIAN; EFFICIENT LEARNING; GENERAL CLASS; GENERALIZATION BOUNDS; MARKOV NETWORKS; MAXIMUM ENTROPIES; MAXIMUM MARGINS; OPTIMIZATION SOLVERS; STRUCTURAL BIAS; STRUCTURED PREDICTIONS; VARIATIONAL INFERENCES;

EID: 56449096750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390314     Document Type: Conference Paper

References (21)

1. Altun, Y., Tsochantaridis, I., & Hofmann, T. (2003). Hidden markov support vector machines. ICML.
2. 1-regularized log-linear models. ICML.
3. Bartlett, P., Collins, M., Taskar, B., & McAllester, D. (2004). Exponentiated gradient algorithms for larg-margin structured classification. NIPS.
4. Bennett, K. P., & Mangasarian, O. L. (1992). Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Softw, 23-34.
5. Chan, A. B., Vasconcelos, N., & Lanckriet, G. R. G. (2007). Direct convex relaxations of sparse svin. ICML.
6. Dudik, M., Phillips, S. J., & Schaphe, R. E. (2007). Maximum entropy density estimation with generalized regularization and an application to species distribution modeling. JMLR, 1217-1260.
7. Figueiredo, M. (2003). Adaptive sparseness for supervised learning. IEEE Trans, on PAMI, 25, 1150-1159.
8. Globerson, A., Koo, T. Y., Carreras, X., & Collins, M. (2007). Exponentiated gradient algorithms for log-linear structured prediction. ICML.
9. Jaakkola, T., Meila, M., & Jebara, T. (1999). Maximum entropy discrimination. NIPS.
10. Kaban, A. (2007). On bayesian classification with laplace priors. Pattern Recognition Letters, 28, 1271-1282.
11. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. ICML.
12. Langford, J., Seeger, M., & Megiddo, N. (2001). An improved predictive accuracy bound for averaging classifiers. ICML.
13. Lebanon, G., & Lafferty, J. (2001). Boosting and maximum likelihood for exponential models. NIPS.
14. Lee, S.-I., Ganapathi, V., & Koller, D. (2006). Efficient structure learning of markov networks using 11-regularization. NIPS.
15. Qi, Y. A., Szummer, M., & Minka, T. P. (2005). Bayesian conditional random fields. AISTATS.
16. Ratliff, N. D., Bagnell, J. A., & Zinkevich, M. A. (2007). (online) subgradient methods for structured prediction. AISTATS.
17. Taskar, B., Guestrin, C., & Koller, D. (2003). Max-margin markov networks. NIPS.
18. Taskar, B., Lacoste-Julien, S., & Jordan, M. I. (2006). Structured prediction via the extragradient method. NIPS.
19. Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J. Royal. Statist. Soc., B, 267-288.
20. Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004). Support vector machine learning for interdependent and structured output spaces. ICML.
21. Wainwright, M. J., Ravikumar, P., & Lafferty, J. (2006). High-dimensional graphical model selection using l1-regularized logistic regression. NIPS.