Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representations
Not on the map. Why?
Abstract (arXiv)
We present a framework for building unsupervised representations of entities and their compositions, where each entity is viewed as a probability distribution rather than a vector embedding. In particular, this distribution is supported over the contexts which co-occur with the entity and are embedded in a suitable low-dimensional space. This enables us to consider representation learning from the perspective of Optimal Transport and take advantage of its tools such as Wasserstein distance and barycenters. We elaborate how the method can be applied for obtaining unsupervised representations of text and illustrate the performance (quantitatively as well as qualitatively) on tasks such as measuring sentence similarity, word entailment and similarity, where we empirically observe significant gains (e.g., 4.1% relative improvement over Sent2vec, GenSen). The key benefits of the proposed approach include: (a) capturing uncertainty and polysemy via modeling the entities as distributions, (b) utilizing the underlying geometry of the particular task (with the ground cost), (c) simultaneously providing interpretability with the notion of optimal transport between contexts and (d) easy applicability on top of existing point embedding methods. The code, as well as prebuilt histograms, are available under https://github.com/context-mover/.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
11 papers.
- 2021Automatic Text Evaluation through the Lens of Wasserstein Barycenterscited by 38
- 2021Wasserstein barycenters are NP-hard to computecited by 28
- 2021Using Optimal Transport as Alignment Objective for fine-tuning Multilingual Contextualized Embeddingscited by 19
- 2021Re-evaluating Word Mover's Distancecited by 10
- 2022Measure Estimation in the Barycentric Coding Modelcited by 9
- 2021Unsupervised Sentence-embeddings by Manifold Approximation and Projectioncited by 4
- 2021Order Constraints in Optimal Transportcited by 4
- 2021Extending Multi-Sense Word Embedding to Phrases and Sentences for Unsupervised Semantic Applicationscited by 3
- 2024Approximate Algorithms For k-Sparse Wasserstein Barycenter With Outlierscited by 3
- 2023Learning representations that are closed-form Monge mapping optimal with application to domain adaptationcited by 2
- 2025Schr"odinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentrescited by 2
- 2025Schr"odinger Bridge Matching for Tree-Structured Costs and Entropic Wasserstein Barycentres20 Jun 2025
- 2024Approximate Algorithms For k-Sparse Wasserstein Barycenter With Outliers20 Apr 2024
- 2023Learning representations that are closed-form Monge mapping optimal with application to domain adaptation12 May 2023
- 2022Measure Estimation in the Barycentric Coding Model28 Jan 2022
- 2021Order Constraints in Optimal Transport14 Oct 2021
- 2021Using Optimal Transport as Alignment Objective for fine-tuning Multilingual Contextualized Embeddings6 Oct 2021
- 2021Automatic Text Evaluation through the Lens of Wasserstein Barycenters27 Aug 2021
- 2021Re-evaluating Word Mover's Distance30 May 2021
- 2021Extending Multi-Sense Word Embedding to Phrases and Sentences for Unsupervised Semantic Applications29 Mar 2021
- 2021Unsupervised Sentence-embeddings by Manifold Approximation and Projection7 Feb 2021
- 2021Wasserstein barycenters are NP-hard to compute4 Jan 2021