HongtengXu / s-gwlLinks
Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
☆43Updated 5 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 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Code for Online Graph Dictionary Learning☆17Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆82Updated 9 months ago
- Variational Graph Convolutional Networks☆23Updated 4 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- ☆24Updated 3 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 3 years ago
- ☆25Updated 5 years ago
- ☆39Updated 2 years ago
- ☆28Updated 3 years ago
- Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".☆43Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- ☆29Updated 2 years ago
- Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021☆26Updated 3 years ago
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆46Updated 4 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 5 years ago
- Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification (NeurIPS 2021)☆43Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 4 years ago