chingyaoc / TMDLinks
NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
☆37Updated 2 years ago
Alternatives and similar repositories for TMD
Users that are interested in TMD are comparing it to the libraries listed below
Sorting:
- SetToGraph paper repository☆22Updated 5 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- ☆39Updated 3 years ago
- Pytorch (PyG) and Tensorflow (Keras/Spektral) implementation of Total Variation Graph Neural Network (TVGNN), as presented at ICML 2023.☆20Updated 8 months ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- ☆17Updated 2 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- ☆12Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 3 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆65Updated 4 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆12Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …☆19Updated 2 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 4 years ago
- Code for reproducing experiments in "On the Ability of Graph Neural Networks to Model Interactions Between Vertices"☆25Updated 2 years ago
- Code for "Generalised Implicit Neural Representations" (NeurIPS 2022).☆70Updated 2 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 5 years ago
- ☆38Updated last year
- CO-Optimal Transport☆42Updated 5 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆21Updated last year
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 4 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.☆14Updated last year
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- Differentiable Top-k Classification Learning☆87Updated 2 years ago