Permutation invariant networks to learn Wasserstein metrics release_s3adhxeqnzhqpknsxq2ap77n24

by Arijit Sehanobish, Neal Ravindra, David van Dijk

Released as a article .

2020  

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.
In text/plain format

Archived Files and Locations

application/pdf  1.7 MB
file_3cq2vuas2rb2fhcdyszivttupu
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-10-12
Version   v1
Language   en ?
arXiv  2010.05820v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e94f2a59-ad03-4692-9f0e-3736f3a1758f
API URL: JSON