Search-based structured prediction

By Hal Daumé Iii, J. Langford, John Langford, Daniel Marcu, Daniel Marcu. 2009

602 citations recorded by the source corpus.

We present Searn, an algorithm for integrating search and learning to solve complex structured prediction problems such as those that occur in natural language, speech, computational biology, and vision. Searn is a meta-algorithm that transforms these complex problems into simple classification problems to which any binary classifier may be applied. Unlike current algorithms for structured learning that require decomposition of both the loss function and the feature functions over the predicted structure, Searn is able to learn prediction functions for any loss function and any class of features. Moreover, Searn comes with a strong, natural theoretical guarantee: good performance on the derived classification problems implies good performance on the structured prediction problem.

Subfields: Artificial Intelligence, Molecular Biology, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Mohit Bansal
  3. Yoshua Bengio
  4. Jianfeng Gao
  5. Percy Liang
  6. Quoc V. Le
  7. Ruslan Salakhutdinov
  8. Kyunghyun Cho

In Molecular Biology

  1. Christopher D. Manning
  2. Percy Liang
  3. Phil Blunsom
  4. Kyunghyun Cho
  5. Iryna Gurevych
  6. Chris Dyer
  7. Ruslan Salakhutdinov
  8. Yoshua Bengio

In Natural Language Processing

  1. Mohit Bansal
  2. Jianfeng Gao
  3. Luke S. Zettlemoyer
  4. Graham Neubig
  5. Yejin Choi
  6. Christopher D. Manning
  7. Kyunghyun Cho
  8. Percy Liang

Citations in the corpus