tvayer / FGW
Code for Optimal Transport for structured data with application on graphs
☆98Updated last year
Related projects ⓘ
Alternatives and complementary repositories for FGW
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆44Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated last year
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- Code for Graph Normalizing Flows.☆59Updated 5 years ago
- code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".☆123Updated last year
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆26Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆55Updated 6 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆101Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆106Updated last year
- Wasserstein Weisfeiler-Lehman Graph Kernels☆78Updated 2 months ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆53Updated 3 years ago
- A PyTorch Implementation of VaDE(https://arxiv.org/pdf/1611.05148.pdf)☆33Updated 3 years ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆140Updated 2 years ago
- Code for: Gradient-based Hierarchical Clustering using Continuous Representations of Trees in Hyperbolic Space. Nicholas Monath, Manzil Z…☆41Updated 4 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆23Updated 4 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆58Updated 3 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- ☆40Updated 7 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆28Updated last year
- ☆121Updated last year