mlsanityData to 7 Oct 2026

Frustratingly Easy Meta-Embedding -- Computing Meta-Embeddings by Averaging Source Word Embeddings

arXiv 1804.05262 ↗First posted 14 Apr 2018cs.CLcited by 15

Not on the map. Why?

Abstract (arXiv)

Creating accurate meta-embeddings from pre-trained source embeddings has received attention lately. Methods based on global and locally-linear transformation and concatenation have shown to produce accurate meta-embeddings. In this paper, we show that the arithmetic mean of two distinct word embedding sets yields a performant meta-embedding that is comparable or better than more complex meta-embedding learning methods. The result seems counter-intuitive given that vector spaces in different source embeddings are not comparable and cannot be simply averaged. We give insight into why averaging can still produce accurate meta-embedding despite the incomparability of the source vector spaces.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Apr 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 5; 2023: 2; 2024: 1; 2025: 0; 2026: 2.

15 papers.

Sort: