SOTAVerified

Learning to Transport with Neural Networks

2019-08-04Code Available0· sign in to hype

Andrea Schioppa

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We compare several approaches to learn an Optimal Map, represented as a neural network, between probability distributions. The approaches fall into two categories: ``Heuristics'' and approaches with a more sound mathematical justification, motivated by the dual of the Kantorovitch problem. Among the algorithms we consider a novel approach involving dynamic flows and reductions of Optimal Transport to supervised learning.

Reproductions