trneedham / Spectral-Gromov-WassersteinLinks
Graph matching and clustering by comparing heat kernels via optimal transport.
☆27Updated 2 years ago
Alternatives and similar repositories for Spectral-Gromov-Wasserstein
Users that are interested in Spectral-Gromov-Wasserstein are comparing it to the libraries listed below
Sorting:
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Embedding graphs in symmetric spaces☆30Updated 3 years ago
- ☆12Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Ultrahyperbolic Representation Learning☆13Updated 5 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 5 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- ☆18Updated 3 years ago
- ☆17Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Code for Graph Normalizing Flows.☆63Updated 5 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- SetToGraph paper repository☆22Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- informal exposition of Weisfeiler-Leman similarity☆28Updated 4 years ago
- Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning☆20Updated 3 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 3 years ago
- ☆28Updated 3 years ago
- ☆20Updated 4 years ago
- Deep Graph Mapper: Seeing Graphs through the Neural Lens☆58Updated 2 years ago