Sequence Labelling SVMs Trained in One Pass

  • Authors:
  • Antoine Bordes;Nicolas Usunier;Léon Bottou

  • Affiliations:
  • LIP6, Université Paris 6, Paris, France 75016 and NEC Laboratories America, Inc., Princeton, USA NJ08540;LIP6, Université Paris 6, Paris, France 75016;NEC Laboratories America, Inc., Princeton, USA NJ08540

  • Venue:
  • ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper proposes an online solver of the dual formulation of support vector machines for structured output spaces. We apply it to sequence labelling using the exact and greedy inference schemes. In both cases, the per-sequence training time is the same as a perceptron based on the same inference procedure, up to a small multiplicative constant. Comparing the two inference schemes, the greedy version is much faster. It is also amenable to higher order Markov assumptions and performs similarly on test. In comparison to existing algorithms, both versions match the accuracies of batch solvers that use exact inference after a single pass over the training examples.