# Optimal transport with some directed distances

arXiv: https://arxiv.org/abs/2105.05989 · HTML: https://mlsanity.com/paper/2105.05989/

## Key facts

- Cited by 1 papers 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 (most cited first, 3 of 3)

- [Computational Optimal Transport](https://mlsanity.com/paper/1803.00567/) (2018)
- [Sparsemax and Relaxed Wasserstein for Topic Sparsity](https://mlsanity.com/paper/1810.09079/) (2018)
- [Relaxed Wasserstein with Applications to GANs](https://mlsanity.com/paper/1705.07164/) (2017)

## Built on by (most cited first, 1 of 1)

- [A Unifying Framework for Some Directed Distances in Statistics](https://mlsanity.com/paper/2203.00863/) (2022)

## 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.