Sequence Labelling SVMs Trained in One Pass
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.
Cite
Text
Bordes et al. "Sequence Labelling SVMs Trained in One Pass." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008. doi:10.1007/978-3-540-87479-9_28Markdown
[Bordes et al. "Sequence Labelling SVMs Trained in One Pass." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008.](https://mlanthology.org/ecmlpkdd/2008/bordes2008ecmlpkdd-sequence/) doi:10.1007/978-3-540-87479-9_28BibTeX
@inproceedings{bordes2008ecmlpkdd-sequence,
title = {{Sequence Labelling SVMs Trained in One Pass}},
author = {Bordes, Antoine and Usunier, Nicolas and Bottou, Léon},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2008},
pages = {146-161},
doi = {10.1007/978-3-540-87479-9_28},
url = {https://mlanthology.org/ecmlpkdd/2008/bordes2008ecmlpkdd-sequence/}
}