Alternatives and similar repositories for TMD

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

• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• FilippoMB / Total-variation-graph-neural-networks
  Pytorch (PyG) and Tensorflow (Keras/Spektral) implementation of Total Variation Graph Neural Network (TVGNN), as presented at ICML 2023.
  ☆20Updated 3 months ago
• DeepGraphLearning / SPN
  ☆29Updated 2 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 4 years ago
• GentleZhu / Shift-Robust-GNNs
  "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')
  ☆48Updated 3 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated last year
• pbielak / graph-barlow-twins
  The official implementation of the Graph Barlow Twins method with the experimental pipeline
  ☆31Updated last year
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 5 years ago
• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆23Updated 4 years ago
• cscarv / riemannian-metric-learning-ot
  ☆17Updated 2 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆31Updated 2 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆36Updated 3 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆20Updated 3 years ago
• hadarser / SetToGraphPaper
  SetToGraph paper repository
  ☆22Updated 4 years ago
• cvignac / SMP
  ☆28Updated 3 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆56Updated 3 years ago
• FFTYYY / TWIRLS
  The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".
  ☆43Updated 4 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• danielegrattarola / GINR
  Code for "Generalised Implicit Neural Representations" (NeurIPS 2022).
  ☆71Updated 2 years ago
• SwiftieH / SpGAT
  Spectral Graph Attention Network with Fast Eigen-approximation
  ☆12Updated 3 years ago
• NNReasoning / What-Can-Neural-Networks-Reason-About
  ☆44Updated 5 years ago
• xiyou3368 / DGVAE
  ☆24Updated 3 years ago
• mfederici / dsit
  Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"
  ☆25Updated 3 years ago
• PurdueMINDS / JanossyPooling
  ☆26Updated 6 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 5 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago