lttam / TreeWassersteinLinks
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)
☆11Updated 5 years ago
Alternatives and similar repositories for TreeWasserstein
Users that are interested in TreeWasserstein are comparing it to the libraries listed below
Sorting:
- 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 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Python implementation of smooth optimal transport.☆58Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- EigenPro2 iteration in Tensorflow (Keras)☆23Updated 6 years ago
- A matlab toolbox to perform Wasserstein Dictionary Learning or NMF☆32Updated 8 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- ☆12Updated 6 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- ☆17Updated 6 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆56Updated 6 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Supporting code for "Parallel Streaming Wasserstein Barycenters"☆10Updated 7 years ago
- ☆38Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- A study of performance of optimal transport.☆10Updated 4 years ago
- WKPI: A kernel based on persistent homology☆12Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago