navid-naderi / WEGLLinks
The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
☆35Updated 4 years ago
Alternatives and similar repositories for WEGL
Users that are interested in WEGL are comparing it to the libraries listed below
Sorting:
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆86Updated last year
- A Pytorch implementation of missing data imputation using optimal transport.☆104Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 3 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆22Updated 6 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆43Updated 2 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Updated 5 years ago
- Variational Graph Convolutional Networks☆23Updated 5 years ago
- Implicit Graph Neural Networks☆64Updated 4 years ago
- Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021☆26Updated 4 years ago
- ☆25Updated 6 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- ☆29Updated 4 years ago
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 4 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- CO-Optimal Transport☆42Updated 5 years ago
- Python package for graph-based clustering and semi-supervised learning☆100Updated 2 months ago