2017/08/11 by Vikas Raunak, Raunak, Vikas · 15 citations
Computer Science · Mathematics · #Artificial intelligence #Computation and Language (cs.CL) #Computer science #Curse of dimensionality #Dimension (graph theory) #Dimensionality reduction #Embedding #FOS: Computer and information sciences #Mathematics #Natural Language Processing Techniques #Natural language processing #Reduction (mathematics) #Similarity (geometry) #Text and Document Classification Technologies #Theoretical computer science #Topic Modeling #Word (group theory) #Word embedding #Word processing #cs.CL
paper · pdf · doi:10.48550/arxiv.1708.03629
published in arXiv (Cornell University) (Cornell University) · Accepted at NIPS 2017 LLD Workshop
openalex publication_date 2017/08/11 · arxiv created 2017/11/21 · arxiv updated 2017/11/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
Word embeddings have become the basic building blocks for several natural language processing and information retrieval tasks. Pre-trained word embeddings are used in several downstream applications as well as for constructing representations for sentences, paragraphs and documents. Recently, there has been an emphasis on further improving the pre-trained word vectors through post-processing algorithms. One such area of improvement is the dimensionality reduction of the word embeddings. Reducing the size of word embeddings through dimensionality reduction can improve their utility in memory constrained devices, benefiting several real-world applications. In this work, we present a novel algorithm that effectively combines PCA based dimensionality reduction with a recently proposed post-processing algorithm, to construct word embeddings of lower dimensions. Empirical evaluations on 12 standard word similarity benchmarks show that our algorithm reduces the embedding dimensionality by 50%, while achieving similar or (more often) better performance than the higher dimension embeddings.