Fast and discriminative semantic embedding

4Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

Abstract

The embedding of words and documents in compact, semantically meaningful vector spaces is a crucial part of modern information systems. Deep Learning models are powerful but their hyperparameter selection is often complex and they are expensive to train, and while pre-trained models are available, embeddings trained on general corpora are not necessarily well-suited to domain specific tasks. We propose a novel embedding method which extends random projection by weighting and projecting raw term embeddings orthogonally to an average language vector, thus improving the discriminating power of resulting term embeddings, and build more meaningful document embeddings by assigning appropriate weights to individual terms. We describe how updating the term embeddings online as we process the training data results in an extremely efficient method, in terms of both computational and memory requirements. Our experiments show highly competitive results with various state-of-the-art embedding methods on different tasks, including the standard STS benchmark and a subject prediction task, at a fraction of the computational cost.

Cite

CITATION STYLE

APA

Koopman, R., Wang, S., & Englebienne, G. (2019). Fast and discriminative semantic embedding. In IWCS 2019 - Proceedings of the 13th International Conference on Computational Semantics - Long Papers (pp. 235–246). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/w19-0420

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free