HongtengXu / s-gwlLinks
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
☆44Updated 6 years ago
Alternatives and similar repositories for s-gwl
Users that are interested in s-gwl are comparing it to the libraries listed below
Sorting:
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Code for Online Graph Dictionary Learning☆17Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated last year
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- ☆25Updated 5 years ago
- Graph meta learning via local subgraphs (NeurIPS 2020)☆126Updated last year
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆46Updated 4 years ago
- ☆31Updated 2 years ago
- ☆28Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Variational Graph Convolutional Networks☆23Updated 4 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- ☆25Updated 4 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Source code for PairNorm (ICLR 2020)☆79Updated 5 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- [ICLR 2023] "Graph Domain Adaptation via Theory-Grounded Spectral Regularization" by Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen☆23Updated 2 years ago
- ☆40Updated 2 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆53Updated 5 years ago