HongtengXu / gwl
Gromov-Wasserstein Learning for Graph Matching and Node Embedding
☆70Updated 5 years ago
Related projects: ⓘ
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated last year
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆40Updated 5 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆20Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆95Updated last year
- Learning Autoencoders with Relational Regularization☆44Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated 10 months ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆53Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆77Updated 2 weeks ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆65Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆53Updated 5 years ago
- Code for reproducing results in GraphMix paper☆71Updated last year
- Pytorch Implementation of Graph Convolutional Kernel Networks☆53Updated last year
- Variational Graph Convolutional Networks☆20Updated 3 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
- Code for Graphite iterative graph generation☆56Updated 5 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆15Updated 4 years ago
- ☆24Updated 3 years ago
- Code for: Gradient-based Hierarchical Clustering using Continuous Representations of Trees in Hyperbolic Space. Nicholas Monath, Manzil Z…☆41Updated 4 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆23Updated 4 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆100Updated 4 years ago
- ☆35Updated 5 years ago
- Source code for PairNorm (ICLR 2020)☆77Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆48Updated 3 years ago
- LEARNING LATENT PERMUTATIONS WITH GUMBEL-SINKHORN NETWORKS IMPLEMENTATION WITH PYTORCH☆76Updated last year
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago