Alternatives and similar repositories for graph-scattering-transforms:

Users that are interested in graph-scattering-transforms are comparing it to the libraries listed below

• jliu / graph-normalizing-flows
  Code for Graph Normalizing Flows.
  ☆62Updated 5 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 4 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆100Updated 2 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆55Updated 3 years ago
• Haggaim / InvariantGraphNetworks
  Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"
  ☆24Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• edouardoyallon / interferometric-graph-transform
  This repository contains the code corresponding to the ICML-2020 publication: https://arxiv.org/abs/2006.05722
  ☆11Updated 4 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• tk-rusch / GraphCON
  GraphCON (ICML 2022)
  ☆59Updated 2 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• j-zarka / SparseScatNet
  Code implementation of paper: Deep Network Classification by Scattering and Homotopy Dictionary Learning
  ☆25Updated 4 years ago
• crisbodnar / ndp
  Official code for the ICLR 2021 paper Neural ODE Processes
  ☆72Updated 3 years ago
• a-norcliffe / sonode
  Experiments from the paper "On Second Order Behaviour in Augmented Neural ODEs"
  ☆58Updated 7 months ago
• dimkal89 / rvae
  ☆38Updated 4 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• hichamjanati / spatio-temporal-alignements
  Spatio-temporal alignements: Optimal transport in space and time
  ☆45Updated 2 weeks ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• dms-net / scatteringGCN
  Scattering GCN: overcoming oversmoothness in graph convolutional networks
  ☆25Updated 2 years ago
• joeybose / HyperbolicNF
  ICML 2020 Paper: Latent Variable Modelling with Hyperbolic Normalizing Flows
  ☆53Updated 2 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆41Updated 4 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 4 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• juntang-zhuang / TorchDiffEqPack
  ☆46Updated last year