Name
Abstract | ||
|---|---|---|
Optimal transport theory has recently found many applications in machine learning thanks to its capacity to meaningfully compare various machine learning objects that are viewed as distributions. The Kantorovitch formulation, leading to the Wasserstein distance, focuses on the features of the elements of the objects, but treats them independently, whereas the Gromov-Wasserstein distance focuses on the relations between the elements, depicting the structure of the object, yet discarding its features. In this paper, we study the Fused Gromov-Wasserstein distance that extends the Wasserstein and Gromov-Wasserstein distances in order to encode simultaneously both the feature and structure information. We provide the mathematical framework for this distance in the continuous setting, prove its metric and interpolation properties, and provide a concentration result for the convergence of finite samples. We also illustrate and interpret its use in various applications, where structured objects are involved. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3390/a13090212 | ALGORITHMS |
Keywords | DocType | Volume |
optimal transport, GRAPHS and Structured objects, Wasserstein and Gromov-Wasserstein distances | Journal | 13 |
Issue | Citations | PageRank |
9 | 1 | 0.35 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Titouan Vayer | 1 | 3 | 2.06 |
| Laetitia Chapel | 2 | 6 | 2.80 |
| Rémi Flamary | 3 | 223 | 24.78 |
| Romain Tavenard | 4 | 159 | 16.16 |
| Nicolas Courty | 5 | 420 | 44.55 |