Hermina / GOT
Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
☆38Updated last year
Related projects ⓘ
Alternatives and complementary repositories for GOT
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021)☆40Updated 2 years ago
- Learning Autoencoders with Relational Regularization☆44Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 3 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated last year
- ☆26Updated 3 years ago
- Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …☆34Updated 3 months ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆106Updated last year
- ☆62Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- ☆25Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆22Updated 3 years ago
- Code for Graph Normalizing Flows.☆59Updated 5 years ago
- GraphCON (ICML 2022)☆57Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- MetA-Train to Explain☆17Updated 2 years ago
- Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…☆34Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆13Updated last year
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆23Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated last year
- ☆49Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- ☆44Updated 3 years ago