Alternatives and similar repositories for FGW

Users that are interested in FGW are comparing it to the libraries listed below

• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 6 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 5 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆42Updated last year
• lchapel / partial-GW-for-PU
  Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…
  ☆20Updated 5 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆83Updated last year
• jliu / graph-normalizing-flows
  Code for Graph Normalizing Flows.
  ☆63Updated 5 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• emilemathieu / pvae
  code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".
  ☆128Updated last year
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• BorgwardtLab / topological-autoencoders
  Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.
  ☆151Updated 3 years ago
• sigvae / SIGraphVAE
  ☆25Updated 5 years ago
• BorgwardtLab / TOGL
  Topological Graph Neural Networks (ICLR 2022)
  ☆123Updated 3 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• oskopek / mvae
  Mixed-curvature Variational Autoencoders (ICLR 2020)
  ☆65Updated 4 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• alelab-upenn / graph-scattering-transforms
  Code for experimentation on graph scattering transforms
  ☆30Updated 5 years ago
• F-Bekerman / Graph-VAE
  ☆44Updated 8 years ago
• lucfra / LDS-GNN
  Learning Discrete Structures for Graph Neural Networks (TensorFlow implementation)
  ☆199Updated last year
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆101Updated 4 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• KelestZ / CondGen
  Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.
  ☆54Updated 6 years ago
• ermongroup / GraphScoreMatching
  Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling
  ☆111Updated 2 years ago