lntk / uot
The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".
☆11Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for uot
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆55Updated 6 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- ☆12Updated 6 years ago
- Learning Autoencoders with Relational Regularization☆44Updated 4 years ago
- Tensorflow implementation for the SVGP-VAE model.☆21Updated 3 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆20Updated 5 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 4 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated last year
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆36Updated last year
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆26Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 3 years ago
- Python implementation of smooth optimal transport.☆56Updated 3 years ago
- ☆13Updated 4 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- ☆16Updated 2 years ago
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆30Updated 6 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆43Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆15Updated 3 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated last year
- Code for Online Graph Dictionary Learning☆15Updated 2 years ago