tvayer / FGW
Code for Optimal Transport for structured data with application on graphs
☆98Updated 2 years ago
Alternatives and similar repositories for FGW:
Users that are interested in FGW are comparing it to the libraries listed below
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆67Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 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
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".☆124Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Code for Graph Normalizing Flows.☆62Updated 5 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆62Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 7 months ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021☆26Updated 3 years ago
- Gaussian Process Prior Variational Autoencoder☆83Updated 6 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- ☆38Updated 4 years ago
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆110Updated last year
- ☆42Updated 7 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago