tvayer / SGW
Code for Sliced Gromov-Wasserstein
☆67Updated 5 years ago
Alternatives and similar repositories for SGW:
Users that are interested in SGW are comparing it to the libraries listed below
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 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
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 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
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 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☆72Updated 5 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 5 years ago
- Gaussian Process Prior Variational Autoencoder☆83Updated 6 years ago
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆101Updated 6 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- ☆12Updated 6 years ago
- ☆38Updated 4 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago
- ☆24Updated 3 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 5 years ago
- ☆39Updated 5 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- PyTorch implementation for the ICLR 2020 paper "Understanding the Limitations of Variational Mutual Information Estimators"☆74Updated 5 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆43Updated 3 years ago
- Sliced Wasserstein Generator☆23Updated 6 years ago
- This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).☆49Updated 3 years ago