Learning as search optimization: Approximate large margin methods for structured prediction

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 169-176

  Daumé III, Hal ^a   Marcu, Daniel ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONFORMAL MAPPING; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; SEARCH ENGINES;

CLASSIFICATION ALGORITHMS; COMPUTATIONAL COSTS; LEARNING MODELS; SEARCH OPTIMIZATIONS;

LEARNING SYSTEMS;

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

References (32)

1. Altun, Y., Hofmann, T., & Smola, A. (2004). Gaussian process classification for segmenting and annotating sequences. ICML.
2. Bartlett, P. L., Collins, M., Taskar, B., & McAllester, D. (2004). Exponentiated gradient algorithms for large-margin structured classification. NIPS.
3. Barto, A., & Anandan, P. (1985). Pattern recognizing stochastic learning automata. IEEE Trans. Systems, Man and Cybernetics.
4. Barto, A., Sutton, R., & Watkins, C. (1981). Associative search network: A reinforcement learning associative memory. Biological Cybernetics.
5. Bellman, R., Kalaba, R., & Kotkin, B. (1963). Polynomial approximation - a new computational technique in dynamic programming: Allocation processes. Mathematics of Computation
6. Boyan, J., & Moore, A. W. (1996). Learning evaluation functions for large acyclic domains. ICML.
7. Collins, M. (2002). Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. EMNLP.
8. Collins, M., & Roark, B. (2004). Incremental parsing with the perceptron algorithm. ACL.
9. Crammer, K., & Singer, Y. (2003). A family of additive online algorithms for category ranking. JMLR, 3.
10. Farley, B., & Clark, W. (1954). Simulation of self-organizing systems by digital computer. I.R.E Trans. Information Theory.
11. Freund, Y., & Shapire, R. (1999). Large margin classification using the perceptron algorithm. ML, 87.
12. Gentile, C. (2001). A new approximate maximal margin classification algorithm. JMLR, 2.
13. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. ICML.
14. Kearns, M., Mansour, Y., & Singh, S. (2000). Nash convergence of gradient dynamics in General-Sum games. UAI.
15. LeCun, Y., & Huang, F.J. (2005). Loss functions and discriminitive training of energy-based models. AI-Stats.
16. McAllester, D., Collins, M., & Pereira, F. (2004). Case-factor digrams for structured probabilistic modeling. UAI.
17. McCallum, A., Freitag, D., & Pereira, F. (2000). Maximum entropy Markov models for information extraction and segmentation. ICML.
18. McCallum, A., & Wellner, B. (2004), Conditional models of identity uncertainty with application to noun coreference. NIPS.
19. McDonald, R., Crammer, K., & Pereira, F. (2004). Large margin online learning algorithms for scalable structured classification. NIPS Workshop on Structured Outputs.
20. Punyakanok, V., & Roth, D. (2001). The use of classifiers in sequential inference. NIPS.
21. Rosenblatt, F. (1958). The perceptron: A probabilistic model for information storage and organization in the brain. Psychological Review, 65.
22. Russell, S., & Norvig, P. (1995). Artificial intelligence: A modern approach. New Jersey: Prentice Hall.
23. Sarawagi, S., & Cohen, W. (2004). Semi-Markov conditional random fields for information extraction. NIPS.
24. Sha, F., & Pereira, F. (2002). Shallow parsing with conditional random fields. NAACL/HLT.
25. Sutton, C., Rohanimanesh, K., & McCallum, A. (2004). Dynamic conditional random fields: Factorized probabilistic models for labeling and segmenting sequence data. ICML.
26. Sutton, R. (1996). Generalization in reinforcement learning: Successful examples using sparse coarse coding. NIPS.
27. Taskar, B., Guestrin, C., & Koller, D. (2003). Max-margin Markov networks. NIPS.
28. Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004). Support vector machine learning for interde-pendent and structured output spaces. ICML.
29. Weston, J., Chapelle, O., Elisseeff, A., Schoelkopf, B., & Vapnik, V. (2002). Kernel dependency estimation. NIPS.
30. Zhang, T., Damerau, F., & Johnson, D. (2002). Text chunking based on a generalization of winnow. JMLR 2.
31. Zhang, W., & Dietterich, T. G. (1997). Solving combinatorial optimization tasks by reinforcement learning: A general methodology applied to resouce-constrained scheduling (Technical Report). Oregon State University.
32. Zinkevich, M., Riley, P., Bowling, M., & Blum, A. (2005). Marginal Best Response, Nash Equilibria, and Iterated Gradient Ascent. In preparation.