PythonOT / COOT
CO-Optimal Transport
☆42Updated 4 years ago
Alternatives and similar repositories for COOT:
Users that are interested in COOT are comparing it to the libraries listed below
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆67Updated 5 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆35Updated 3 months ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 3 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆47Updated 3 years ago
- Tensorflow implementation for the SVGP-VAE model.☆21Updated 3 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆28Updated 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
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- ☆17Updated 2 years ago
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- ☆17Updated last year
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆38Updated 2 years ago
- The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022☆62Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆40Updated last year
- A Pytorch implementation of the optimal transport kernel embedding☆114Updated 4 years ago