Online Learning of Task-specific Word Representations with a Joint Biconvex Passive-Aggressive Algorithm

Pascal Denis 1 Liva Ralaivola 2
1 MAGNET - Machine Learning in Information Networks
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189, Inria Lille - Nord Europe
2 QARMA - éQuipe AppRentissage et MultimediA [Marseille]
LIF - Laboratoire d'informatique Fondamentale de Marseille
Abstract : This paper presents a new, efficient method for learning task-specific word vectors using a variant of the Passive-Aggressive algorithm. Specifically, this algorithm learns a word embedding matrix in tandem with the classifier parameters in an online fashion, solving a bi-convex constrained optimization at each iteration. We provide a theoretical analysis of this new algorithm in terms of regret bounds, and evaluate it on both synthetic data and NLP classification problems, including text classification and sentiment analysis. In the latter case, we compare various pre-trained word vectors to initialize our word embedding matrix, and show that the matrix learned by our algorithm vastly outperforms the initial matrix, with performance results comparable or above the state-of-the-art on these tasks.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01590594
Contributor : Pascal Denis <>
Submitted on : Tuesday, September 19, 2017 - 5:06:28 PM
Last modification on : Friday, March 22, 2019 - 1:34:36 AM

File

eacl17_rpa.pdf
Files produced by the author(s)

Identifiers

Citation

Pascal Denis, Liva Ralaivola. Online Learning of Task-specific Word Representations with a Joint Biconvex Passive-Aggressive Algorithm. European Chapter of the Association for Computational Linguistics, Apr 2017, Valencia, Spain. pp.775 - 784, ⟨10.18653/v1/E17-1073⟩. ⟨hal-01590594⟩

Share

Metrics

Record views

431

Files downloads

216