lntk / uotLinks
The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".
☆12Updated 5 years ago
Alternatives and similar repositories for uot
Users that are interested in uot are comparing it to the libraries listed below
Sorting:
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Updated 6 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 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 Optimal Transport for structured data with application on graphs☆104Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Learning generative models with Sinkhorn Loss☆30Updated 7 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 6 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 4 years ago
- ☆12Updated 7 years ago
- Learning the optimal transport map via input convex neural neworks☆42Updated 5 years ago
- Python implementation of smooth optimal transport.☆61Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆23Updated 6 years ago
- CO-Optimal Transport☆42Updated 5 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Updated 5 years ago
- Official repository of "Minibatch optimal transport distances; analysis and applications" (https://arxiv.org/pdf/2101.01792.pdf)☆10Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆36Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆43Updated 2 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 5 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆27Updated 6 years ago
- Gaussian Process Prior Variational Autoencoder☆87Updated 7 years ago
- code for "Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders".☆130Updated 2 years ago
- Distributional Sliced-Wasserstein distance code☆50Updated last year
- VCCA Pytorch Implementation on MNIST dataset☆16Updated 7 years ago