We lifted 3 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| clbonet/sliced-wasserstein_distances_and_flows_on_cartan-hadamard_manifolds | canonical | 2 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| get_quantiles | Ran | clbonet/sliced-wasserstein_distances_and_flows_on_cartan-hadamard_manifolds/hswfs/sw.py pointer only (licence: NONE) · get_code("aaf32efcd24f9a5d") |
| sliced_wasserstein | Ran | clbonet/sliced-wasserstein_distances_and_flows_on_cartan-hadamard_manifolds/hswfs/sw.py pointer only (licence: NONE) · get_code("edd10f03b9c6b7ad") |
| emd1D | Not yet run | clbonet/sliced-wasserstein_distances_and_flows_on_cartan-hadamard_manifolds/hswfs/sw.py pointer only (licence: NONE) · get_code("be5c32614c736b28") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
While many Machine Learning methods were developed or transposed on Riemannian manifolds to tackle data with known non Euclidean geometry, Optimal Transport (OT) methods on such spaces have not received much attention. The main OT tool on these spaces is the Wasserstein distance which suffers from a heavy computational burden. On Euclidean spaces, a popular alternative is the Sliced-Wasserstein distance, which leverages a closed-form solution of the Wasserstein distance in one dimension, but which is not readily available on manifolds. In this work, we derive general constructions of Sliced-Wasserstein distances on Cartan-Hadamard manifolds, Riemannian manifolds with non-positive curvature, which include among others Hyperbolic spaces or the space of Symmetric Positive Definite matrices. Then, we propose different applications. Additionally, we derive non-parametric schemes to minimize these new distances by approximating their Wasserstein gradient flows.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2403.06560")
get_code_for_paper("2403.06560")
have("2403.06560")
Connect an agent — have() is free.