Context Mover's Distance & Barycenters: Optimal transport of contexts for building representations
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 fixed length vector.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 the problem of representation learning with a perspective from Optimal Transport and take advantage of its numerous tools such as Wasserstein distance and Wasserstein 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 and word entailment, where we empirically observe significant gains.The key benefits of the proposed approach include: capturing uncertainty and polysemy via modeling the entities as distributions, utilizing the underlying geometry of the particular task, simultaneously providing interpretability with the notion of optimal transport between contexts and easy applicability on top of existing point embedding methods.In essence, the framework can be useful for any unsupervised or supervised problem; and only requires a co-occurrence structure inherent to many problems.The code, as well as pre-built histograms, are available under https://github.com/context-mover.
Represent each entity as a probability distribution over contexts embedded in a ground space.Proposes to construct word embeddings from a histogram over context words, instead of as point vectors, which allows for measuring distances between two words in terms of optimal transport between the histograms through a method that augments representation of an entity from standard "point in a vector space" to a histogram with bins located at some points in that vector space. 