Polyhedral outer approximations with application to natural language parsing

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 713-720

  Martins, André F T ^a,b   Smith, Noah A ^a   Xing, Eric P ^a  

^a Carnegie Mellon University   (United States)

^b INSTITUTO DE TELECOMUNICAÇÕES   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

APPROACHES TO LEARNING; APPROXIMATE INFERENCE; COMPUTATIONAL COSTS; DEPENDENCY PARSING; GEOMETRIC CHARACTERIZATION; LP FORMULATIONS; LP RELAXATION; NATURAL LANGUAGE PARSING; NONLOCAL; OUTER APPROXIMATION;

EDUCATION; GEOMETRY; ROBOT LEARNING;

LEARNING ALGORITHMS;

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

References (31)

1. Boros, E., & Hammer, P. (2002). Pseudo-Boolean optimization. Discrete Applied Math., 123, 155-225.
2. Buchholz, S., & Marsi, E. (2006). CoNLL-X shared task on multilingual dependency parsing. Conf. Comp. Nat. Lang. Learn., 189-210.
3. Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2004). On the generalization ability of on-line learning algorithms. IEEE Trans. on Inf. Theory, 50, 2050-2057.
4. Chang, M., Ratinov, L., & Roth, D. (2008). Constraints as prior knowledge. Int. Conf. Mach. Learn. Workshop on Prior Knowledge for Text and Language Processing.
5. Chu, Y. J., & Liu, T. H. (1965). On the shortest arborescence of a directed graph. Science Sinica, 14, 1396-1400.
6. Clarke, J., & Lapata, M. (2008). Global inference for sentence compression: An integer linear programming approach. J. Art. Intel. Res., 31, 399-429.
7. Collins, M. (2002). Discriminative training methods for HMMs: Theory and experiments with perceptron algorithms. Emp. Meth. Nat. Lang. Proc.
8. Crammer, K., Dekel, O., Keshet, J., Shalev-Shwartz, S., & Singer, Y. (2006). Online passive-aggressive algorithms. J. Mach. Learn. Res., 7, 551-585.
9. Daumé, H., & Marcu, D. (2005). Learning as search optimization: Approximate large margin methods for structured prediction. Int. Conf. Mach. Learn., 169-176.
10. Denis, P., & Baldridge, J. (2007). Joint determination of anaphoricity and coreference resolution using integer programming. North. Am. Assoc. Comp. Ling.
11. Edmonds, J. (1967). Optimum branchings. J. Res. National Bureau of Standards, 71B, 233-240.
12. Eisner, J. (1996). Three new probabilistic models for dependency parsing: An exploration. Int. Conf. Comp. Ling., 340-345.
13. Finley, T., & Joachims, T. (2008). Training structural SVMs when exact inference is intractable. Int. Conf. Mach. Learn., 304-311.
14. Kulesza, A., & Pereira, F. (2007). Structured learning with approximate inference. Neur. Inf. Proc. Sys. 20, 785-792.
15. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. Int. Conf. Mach. Learn., 282-289.
16. Levin, L. (1986). Average case complete problems. SIAM Journal on Computing, 15, 285.
17. Magnanti, T., & Wolsey, L. (1994). Optimal Trees (Tech. Rep. 290-94). MIT, Op. Res. Center.
18. Martins, A. F. T., Smith, N. A., & Xing, E. P. (2009). Concise integer linear programming formulations for dependency parsing. Assoc. Comp. Ling. To appear.
19. McDonald, R., Lerman, K., & Pereira, F. (2006). Multilingual dependency analysis with a two-stage discriminative parser. Conf. Comp. Nat. Lang. Learn., 216-220.
20. McDonald, R., & Satta, G. (2007). On the complexity of non-projective data-driven dependency parsing. Int. Conf. Pars. Tech., 121-132.
21. McDonald, R. T., Pereira, F., Ribarov, K., & Hajic, J. (2005). Non-projective dependency parsing using spanning tree algorithms. Emp. Meth. Nat. Lang. Proc, 523-530.
22. Ratliff, N., Bagnell, J., & Zinkevich, M. (2006). Sub-gradient methods for maximum margin structured learning. Int. Conf. Mach. Learn. Workshop on Learning in Structured Outputs Spaces.
23. Richardson, M., & Domingos, P. (2006). Markov logic networks. Mach. Learn., 62, 107-136.
24. Riedel, S., & Clarke, J. (2006). Incremental integer linear programming for non-projective dependency parsing. Emp. Meth. Nat. Lang. Proc., 129-137.
25. Roth, D., & Yih, W. (2005). Integer linear programming inference for conditional random fields. Int. Conf. Mach. Learn., 736-743.
26. Smith, D. A., & Eisner, J. (2008). Dependency parsing by belief propagation. Emp. Meth. Nat. Lang. Proc, 145-156.
27. Taskar, B., Guestrin, C., & Koller, D. (2004a). Maxmargin markov networks. Neur. Inf. Proc. Sys. 16.
28. Taskar, B., Chatalbashev, V., & Koller, D. (2004b). Learning associative Markov networks. Int. Conf. Mach. Learn.
29. Taskar, B., Lacoste-Julien, S., & Jordan, M. (2006). Structured prediction via the extragradient method. Neur. Inf. Proc. Sys. 18, 1345-1352.
30. Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004). Support vector machine learning for interdependent and structured output spaces. Int. Conf. Mach. Learn.
31. Vazirani, V. (2001). Approximation Algorithms. Springer.