trneedham / gromov-wasserstein-statistics
Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
☆13Updated 4 years ago
Alternatives and similar repositories for gromov-wasserstein-statistics:
Users that are interested in gromov-wasserstein-statistics are comparing it to the libraries listed below
- 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 2 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
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆31Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆45Updated 4 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆16Updated last year
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- Persistence differentiation with Gudhi and Tensorflow☆18Updated last year
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆12Updated 4 years ago
- ☆37Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Code for Graph Normalizing Flows.☆60Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- ☆12Updated 6 years ago
- The essence of my research, distilled for reusability. Enjoy 🥃!☆62Updated 5 months ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆40Updated last year
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆54Updated 3 years ago
- Code for the paper "Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)" (2020)☆32Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆141Updated 3 years ago
- Code for experimentation on graph scattering transforms☆27Updated 5 years ago