Polyhedral outer approximations with application to natural language parsing

Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learning algorithms act as if computational cost was constant within the model class. This paper sheds some light on the first issue by establishing risk bounds for max-margin learning with LP relaxed inference and addresses the second issue by proposing a new paradigm that attempts to penalize "timeconsuming" hypotheses. Our analysis relies on a geometric characterization of the outer polyhedra associated with the LP relaxation. We then apply these techniques to the problem of dependency parsing, for which a concise LP formulation is provided that handles non-local output features. A significant improvement is shown over arc-factored models.

• Type: Conference
• Year: 2009
• Where: ICML
• Authors: André F. T. Martins, Noah A. Smith, Eric P. Xing
• Keywords: Concise Lp Formulation, ICML 2009, LP Relaxation, LP Relaxed Inference, Machine Learning