lntk / uot
The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".
☆11Updated 4 years ago
Alternatives and similar repositories for uot:
Users that are interested in uot are comparing it to the libraries listed below
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated last year
- 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 "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 4 years ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆37Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆17Updated last year
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- ☆12Updated 6 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
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Douglas-Rachford Splitting for Optimal Transport☆10Updated 3 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 5 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆16Updated 6 years ago
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 3 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆31Updated 7 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- ☆12Updated 7 months ago
- ☆17Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆67Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago