Latent Variable Perceptron Algorithm for Structured Classification
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1236-1241.
Abstract
We propose a perceptron-style algorithm for fast discriminative training of structured latent variable model. This method extends the perceptron algorithm for the learning with latent dependencies, as an alternative to existing probabilistic latent variable models. It relies on Viterbi decoding over latent variables, combined with simple additive updates. Its training cost is significantly lower than that of probabilistic latent variable models, while it gives comparable or even superior classification accuracy on our tasks. Experiments on natural language processing problems demonstrate that its results are among those good reports on corresponding data sets.Xu Sun, Takuya Matsuzaki, Daisuke Okanohara, Jun'ichi Tsujii
@inproceedings{ijcai2009p208,
title = {Latent Variable Perceptron Algorithm for Structured Classification},
author = {Sun, Xu and Matsuzaki, Takuya and Okanohara, Daisuke and Tsujii, Jun'ichi},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1236--1241},
year = {2009},
url = {https://ijcai.org/proceedings/2009/208},
}
TY - CPAPER TI - Latent Variable Perceptron Algorithm for Structured Classification AU - Sun, Xu AU - Matsuzaki, Takuya AU - Okanohara, Daisuke AU - Tsujii, Jun'ichi T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1236 EP - 1241 UR - https://ijcai.org/proceedings/2009/208 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
