mlsanityData to 14 Oct 2026

Optimal transport with some directed distances

arXiv 2105.05989 ↗First posted 12 May 2021cs.IT math.IT math.PRcited by 1

Not on the map. Why?

Abstract (arXiv)

We present a toolkit of directed distances between quantile functions. By employing this, we solve some new optimal transport (OT) problems which e.g. considerably flexibilize some prominent OTs expressed through Wasserstein distances.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 43 references that are in the map. First posted on arXiv 12 May 2021.

Builds on

3 of 43 references.

References · 3

  1. 2018Computational Optimal Transportcited by 780
  2. 2018Sparsemax and Relaxed Wasserstein for Topic Sparsitycited by 9
  3. 2017Relaxed Wasserstein with Applications to GANscited by 5

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.

  1. 2022A Unifying Framework for Some Directed Distances in Statisticscited by 0