Semi-discrete optimal transport: hardness, regularization and numerical solution

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, machine learning and computer vision, howev...

Ausführliche Beschreibung