kilianFatras / unbiased_minibatch_sinkhorn_GAN
Official repository of "Minibatch optimal transport distances; analysis and applications" (https://arxiv.org/pdf/2101.01792.pdf)
☆10Updated 3 years ago
Alternatives and similar repositories for unbiased_minibatch_sinkhorn_GAN:
Users that are interested in unbiased_minibatch_sinkhorn_GAN are comparing it to the libraries listed below
- ☆13Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 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
- This repo contains the implementation of the Wasserstein Barycenter Transport proposed in "Wasserstein Barycenter Transport for Acoustic …☆30Updated 2 years ago
- Implementation of DeepJDOT in Keras☆61Updated 5 years ago
- Sliced Wasserstein Distance (SWD) in PyTorch☆110Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 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
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆45Updated 2 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆47Updated 3 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- ☆39Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- Robust Optimal Transport code☆42Updated 2 years ago
- Distributional Sliced-Wasserstein distance code☆49Updated 7 months ago
- PyTorch implementation for the ICLR 2020 paper "Understanding the Limitations of Variational Mutual Information Estimators"☆74Updated 5 years ago
- Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"☆10Updated 5 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
- ☆12Updated 6 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
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated last year
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆52Updated 2 years ago
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆101Updated 6 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆16Updated 6 years ago
- Implementation of 'DIVA: Domain Invariant Variational Autoencoders'☆100Updated 5 years ago
- This is the repository to reproduce the experiments of the IJCAI 2020 paper "Metric Learning in Optimal Transport for Domain Adaptation"☆22Updated 4 years ago
- Code for the paper Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift☆37Updated 4 years ago