PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Sequence Labelling SVMs Trained in One Pass
Antoine Bordes, Nicolas Usunier and Léon Botou
ECML PKDD 2008, Part I Volume LNAI 5211, pp. 146-161, 2008. ISSN 1611-3349

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.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Natural Language Processing
ID Code:4775
Deposited By:Antoine Bordes
Deposited On:24 March 2009