Online Learning of Task-specific Word Representations with a Joint Biconvex Passive-Aggressive Algorithm
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.
Code (0)
등록된 구현이 없습니다.
Tasks
General ClassificationSentiment Analysistext-classificationText ClassificationWord EmbeddingsSimilar Papers 제목 키워드 기반
Multidirectional Associative Optimization of Function-Specific Word Representations
We present a neural framework for learning associations between interrelated groups of words such as the ones found in Subject-Verb-Object (SVO) structures. Our model induces a joint function-specific word vector space, …
Jointly modelling the evolution of social structure and language in online communities
Group interactions take place within a particular socio-temporal context, which should be taken into account when modelling interactions in online communities. We propose a method for jointly modelling community structur…
Word Embeddings"The Sum of Its Parts": Joint Learning of Word and Phrase Representations with Autoencoders
Recently, there has been a lot of effort to represent words in continuous vector spaces. Those representations have been shown to capture both semantic and syntactic information about words. However, distributed represen…
A Probabilistic Framework for Learning Domain Specific Hierarchical Word Embeddings
The meaning of a word often varies depending on its usage in different domains. The standard word embedding models struggle to represent this variation, as they learn a single global representation for a word. We propose…
Word EmbeddingsLearning grounded word meaning representations on similarity graphs
This paper introduces a novel approach to learn visually grounded meaning representations of words as low-dimensional node embeddings on an underlying graph hierarchy. The lower level of the hierarchy models modality-spe…
Graph Embedding