navid-naderi / WEGL
The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
☆33Updated 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☆42Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- ☆20Updated 3 years ago
- ☆30Updated last year
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated last year
- [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
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- ☆27Updated 3 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 3 years ago
- Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021☆25Updated 3 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 5 years ago
- ☆12Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆67Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- ☆38Updated 4 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago