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:
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆102Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 11 months ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year
- Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021☆46Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆22Updated 5 years ago
- ☆28Updated 3 years ago
- Implicit Graph Neural Networks☆62Updated 3 years ago
- ☆25Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- GraphCON (ICML 2022)☆59Updated 2 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Uncertainty Quantification over Graph with Conformalized Graph Neural Networks (NeurIPS 2023)☆82Updated last year
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago