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 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 4 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 for Sliced Gromov-Wasserstein☆67Updated 5 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 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
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆34Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 3 years ago
- ☆17Updated 2 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆36Updated 4 months ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆37Updated 2 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆39Updated 2 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Euclidean Wasserstein-2 optimal transportation☆46Updated last year
- ☆17Updated last year
- A Pytorch implementation of the optimal transport kernel embedding☆116Updated 4 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"☆25Updated 4 years ago
- Robust Optimal Transport code☆42Updated 2 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 5 years ago
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆52Updated 2 years ago