navid-naderi / WEGL
The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
☆35Updated 4 years ago
Alternatives and similar repositories for WEGL:
Users that are interested in WEGL are comparing it to the libraries listed below
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- ☆27Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- ☆30Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 2 years ago
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆16Updated 10 months ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 8 months ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- MetA-Train to Explain☆17Updated 3 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 2 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- ☆17Updated 2 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 3 years ago
- GraphCON (ICML 2022)☆59Updated 2 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- The official implementation of the Graph Barlow Twins method with the experimental pipeline☆31Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Updated 2 years ago
- ☆20Updated 4 years ago