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
- Embedding graphs in symmetric spaces☆30Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 3 years ago
- CO-Optimal Transport☆42Updated 5 years ago
- Ultrahyperbolic Representation Learning☆13Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 4 years ago
- ☆12Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆103Updated 2 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Updated 5 years ago
- ☆18Updated 3 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Updated 6 years ago
- ☆17Updated 2 years ago
- Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".☆53Updated last week
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 4 years ago
- Learning the optimal transport map via input convex neural neworks☆42Updated 5 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 6 years ago
- Graph signal processing tutorial, presented at the GraphSiP summer school.☆78Updated 6 years ago
- SetToGraph paper repository☆22Updated 5 years ago
- Python implementation of smooth optimal transport.☆61Updated 4 years ago
- Official code for the ICLR 2021 paper Neural ODE Processes☆75Updated 3 years ago