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:
- Pytorch (PyG) and Tensorflow (Keras/Spektral) implementation of Total Variation Graph Neural Network (TVGNN), as presented at ICML 2023.☆20Updated 7 months ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 4 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- Differentiable Top-k Classification Learning☆86Updated 2 years ago
- SetToGraph paper repository☆22Updated 5 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆12Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Implementation of the models and datasets used in "An Information-theoretic Approach to Distribution Shifts"☆25Updated 3 years ago
- Tensorflow implementation and notebooks for Implicit Maximum Likelihood Estimation☆67Updated 3 years ago
- ☆17Updated 2 years ago
- Code for "Generalised Implicit Neural Representations" (NeurIPS 2022).☆70Updated 2 years ago
- ☆38Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Hyperbolic Neural Networks, pytorch☆87Updated 6 years ago
- Pytorch code for "Improving Self-Supervised Learning by Characterizing Idealized Representations"☆41Updated 2 years ago
- Implicit Graph Neural Networks☆64Updated 3 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 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
- ☆39Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- [NeurIPS'21] Higher-order Transformers for sets, graphs, and hypergraphs, in PyTorch☆67Updated 2 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"☆36Updated last year
- This repository reproduces the results in the paper "How expressive are transformers in spectral domain for graphs?"(published in TMLR)☆12Updated 3 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆24Updated 3 years ago
- Energy Based Models are a quite novel technique for density estimation. In this university project I explore this new research topic and …☆16Updated 4 years ago