HongtengXu / gwl
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
☆72Updated 5 years ago
Alternatives and similar repositories for gwl:
Users that are interested in gwl are comparing it to the libraries listed below
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Source code for PairNorm (ICLR 2020)☆76Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 8 months ago
- ☆37Updated 6 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 years ago
- [ICML 2020] "When Does Self-Supervision Help Graph Convolutional Networks?" by Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen☆110Updated 3 years ago
- The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields☆58Updated 5 years ago
- ☆27Updated 3 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆52Updated 5 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 4 years ago
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆54Updated 5 years ago
- ☆25Updated 3 years ago
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆45Updated 4 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- A Flexible Generative Framework for Graph-based Semi-supervised Learning (NeurIPS 2019)☆16Updated 3 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 2 years ago