lttam / TreeWasserstein
Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Yamada, Kenji Fukumizu, Marco Cuturi) --- A valid positive definite Wasserstein kernel for persistence diagrams: exp(-TW/t)
☆12Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for TreeWasserstein
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆17Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Code for Optimal Transport for structured data with application on graphs☆98Updated last year
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆26Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Python implementation of smooth optimal transport.☆56Updated 3 years ago
- A Python implementation of Monge optimal transportation☆48Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- A matlab toolbox to perform Wasserstein Dictionary Learning or NMF☆31Updated 8 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆54Updated 5 years ago
- ☆36Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆53Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆42Updated 3 years ago
- ☆11Updated 6 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- Efficient LSH-based kernel density estimation☆28Updated 5 years ago
- Python implementation of Robust Continuous Clustering☆101Updated 5 years ago
- Legendre decomposition for tensors☆13Updated 6 years ago