Sequential learning of classifiers for structured prediction problems

Journal of Machine Learning Research

Volumn 5, Issue , 2009, Pages 440-447

  Roth, Dan ^a   Small, Kevin ^a   Titov, Ivan ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFIER LEARNING; IDENTIFICATION PROBLEM; INDIVIDUAL CLASSIFIERS; LEARNING PROTOCOLS; SEQUENTIAL LEARNING; STRUCTURED PREDICTION; SUB-PROBLEMS; VARIABLE ASSIGNMENT;

SOFTWARE ENGINEERING;

ARTIFICIAL INTELLIGENCE;

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

References (18)

1. Bunescu, R. C. (2008). Learning with probabilistic features for improved pipeline models. In Proc. of Conf. on Empirical Methods in Natural Language Processing.
2. Carreras, X. and Màrquez, L. (2004a). Introduction to the CoNLL-2004 shared tasks: Semantic role label- ing. In Proceedings of CoNLL-2004, pages 89-97.
3. Carreras, X. and Màrquez, L. (2004b). Online learn- ing via global feedback for phrase recognition. In Proceedings of NIPS-2003.
4. Collins, M. (2002). Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. of Conf. on Empirical Methods in Natural Language Processing.
5. Collobert, R. and Weston, J. (2008). A unified archi- tecture for natural language processing: Deep neural networks with multitask learning. In Proc. ICML.
6. Finkel, J. R., Manning, C. D., and Ng, A. Y. (2006). Solving the problem of cascading errors: Approx- imate bayesian inference for linguistic annotation pipelines. In In Proc. of Conference on Empirical Methods in Natural Language Processing.
7. Freund, Y. and Schapire, R. (1998). Large margin clas- sification using the Perceptron algorithm. In Proc. COLT.
8. Henderson, J., Merlo, P., Musillo, G., and Titov, I. (2008). A latent variable model of synchronous pars- ing for syntactic and semantic dependencies. In Proc. CoNLL-2008 Shared Task.
9. McAllester, D. (2007). Generalization bounds and con- sistency for structured labeling. In Bakir, G., Hof- mann, T., Scholkopf, B., Smola, A., Taskar, B., and Vishwanathan, S. V. N., editors, Predicting Struc- tured Data. MIT Press.
10. Novikoff, A. (1963). On convergence proofs for per- ceptrons. In Proceeding of the Symposium on the Mathematical Theory of Automata, volume 12.
11. Platt, J. C. (1999). Probabilistic outputs for sup- port vector machines and comparision to regular- ized likelihood methods. In Smola, A., Bartlett, P., Scholkopf, B., and Schuurmans, D., editors, Ad- vances in Large Margin Classifiers, pages 61-74. MIT Press.
12. Punyakanok, V., Roth, D., and Yih, W. (2008). The importance of syntactic parsing and inference in se- mantic role labeling. Computational Linguistics, 34(2).
13. Punyakanok, V., Roth, D., Yih, W., and Zimak, D. (2005). Learning and inference over constrained out- put. In Proc. IJCAI.
14. Roth, D. and Yih, W. (2004). A linear programming formulation for global inference in natural language tasks. In Proc. of the Annual Conference on Com- putational Natural Language Learning (CoNLL).
15. Surdeanu, M., Johansson, R., Meyers, A., Màrquez, L., and Nivre, J. (2008). The CoNLL-2008 shared task on joint parsing of syntactic and semantic de- pendencies. In Proceedings of the 12th Confer- ence on Computational Natural Language Learning (CoNLL-2008).
16. Taskar, B. (2004). Learning Structured Prediction Models: A Large Margin Approach. PhD thesis, Stanford University.
17. Taskar, B., Guestrin, C., and Koller, D. (2004). Max- margin markov networks. In Proc. NIPS 16.
18. Zhang, T. (2002). Covering number bounds of certain regularized linear function classes. J. Mach. Learn. Res., 2:527-550.