Permutation invariant networks to learn Wasserstein metrics
Abstract
Understanding the space of probability measures on a metric space equipped with a Wasserstein distance is one of the fundamental questions in mathematical analysis. The Wasserstein metric has received a lot of attention in the machine learning community especially for its principled way of comparing distributions. In this work, we use a permutation invariant network to map samples from probability measures into a low-dimensional space such that the Euclidean distance between the encoded samples reflects the Wasserstein distance between probability measures. We show that our network can generalize to correctly compute distances between unseen densities. We also show that these networks can learn the first and the second moments of probability distributions.
Cite
@article{arxiv.2010.05820,
title = {Permutation invariant networks to learn Wasserstein metrics},
author = {Arijit Sehanobish and Neal Ravindra and David van Dijk},
journal= {arXiv preprint arXiv:2010.05820},
year = {2021}
}
Comments
Fix typos, Accepted as a spotlight at Topological Data Analysis and Beyond Workshop at Neurips 2020. Added more experiments and results. Comments welcome