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
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 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
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 4 years ago
- ☆18Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆65Updated 4 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆12Updated 3 years ago
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 4 years ago
- ☆12Updated 4 years ago
- Implicit Graph Neural Networks☆64Updated 4 years ago
- Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.☆32Updated 8 months ago
- Tensorflow implementation and notebooks for Implicit Maximum Likelihood Estimation☆67Updated 3 years ago
- Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"☆36Updated last year
- Differentiable Top-k Classification Learning☆88Updated 2 years ago
- Hyperbolic Neural Networks, pytorch☆87Updated 6 years ago
- Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.☆30Updated 5 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).☆21Updated last year
- Code for Sliced Gromov-Wasserstein☆69Updated 6 years ago
- Pytorch code for "Improving Self-Supervised Learning by Characterizing Idealized Representations"☆41Updated 3 years ago
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 3 years ago
- Code for "Generalised Implicit Neural Representations" (NeurIPS 2022).☆70Updated 2 years ago
- PyTorch Codes for Haar Graph Pooling☆11Updated 2 years ago
- ☆38Updated last year
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 4 years ago
- ☆39Updated 3 years ago
- ☆31Updated 4 years ago