chingyaoc / TMD
NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
☆36Updated last year
Alternatives and similar repositories for TMD
Users that are interested in TMD are comparing it to the libraries listed below
Sorting:
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Pytorch (PyG) and Tensorflow (Keras/Spektral) implementation of Total Variation Graph Neural Network (TVGNN), as presented at ICML 2023.☆20Updated 2 months ago
- ☆29Updated 2 years ago
- ☆12Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- Code for "Generalised Implicit Neural Representations" (NeurIPS 2022).☆70Updated 2 years ago
- ☆27Updated 3 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 3 years ago
- ☆20Updated 4 years ago
- ☆25Updated 3 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- ☆26Updated 6 years ago
- ☆31Updated 2 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 2 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆11Updated 3 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- SetToGraph paper repository☆22Updated 4 years ago
- The official implementation of the Graph Barlow Twins method with the experimental pipeline☆31Updated last year
- ☆45Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆35Updated 3 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- ☆12Updated 5 years ago
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆16Updated 10 months ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Updated 2 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 3 years ago
- ☆30Updated 4 years ago