Hermina / GOT
Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
☆38Updated 10 months ago
Related projects: ⓘ
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆70Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Code for Online Graph Dictionary Learning☆15Updated 2 years ago
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021)☆37Updated last year
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆104Updated last year
- Learning Autoencoders with Relational Regularization☆44Updated 3 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆53Updated last year
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated last year
- ☆25Updated 2 years ago
- ☆9Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆95Updated last year
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆20Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- ☆25Updated 4 years ago
- Embedding graphs in symmetric spaces☆28Updated 2 years ago
- Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …☆34Updated last month
- ☆24Updated 3 years ago
- Reference implementation for SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators (ICML …☆22Updated 2 years ago
- Code accompanying the AAAI 2022 paper "fGOT: Graph Distances based on Filters and Optimal Transport"☆13Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Learning Graphons via Structured Gromov-Wasserstein Barycenters☆23Updated 3 years ago
- Code and dataset to test empirically the expressive power of graph pooling operators.☆31Updated 10 months ago
- ☆60Updated 3 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆45Updated 3 years ago
- Implementation of Implicit Graphon Neural Representation☆12Updated last year
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆39Updated 3 years ago
- GraphCON (ICML 2022)☆52Updated last year
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆15Updated 3 years ago