trneedham / gromov-wasserstein-statisticsLinks
Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
☆15Updated 5 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
Sorting:
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆20Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆150Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Code for Graph Normalizing Flows.☆63Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- Topological Graph Neural Networks (ICLR 2022)☆123Updated 3 years ago
- Persistence differentiation with Gudhi and Tensorflow☆19Updated 2 years ago
- ☆37Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Updated 5 years ago
- The essence of my research, distilled for reusability. Enjoy 🥃!☆71Updated last year
- Wasserstein Weisfeiler-Lehman Graph Kernels☆85Updated last year
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".☆129Updated 2 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Updated 10 months ago