thibsej / unbalanced_gromov_wassersteinLinks
Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
☆45Updated 2 years ago
Alternatives and similar repositories for unbalanced_gromov_wasserstein
Users that are interested in unbalanced_gromov_wasserstein are comparing it to the libraries listed below
Sorting:
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 4 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆29Updated 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
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 6 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆20Updated 2 years ago
- Code for the paper "Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)" (2020)☆32Updated 3 years ago
- ☆38Updated 4 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 3 years ago
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆41Updated 3 years ago
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 3 years ago
- ☆17Updated 2 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Learning generative models with Sinkhorn Loss☆29Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- GP Sinkhorn Implementation, paper: https://www.mdpi.com/1099-4300/23/9/1134☆23Updated 3 years ago
- Python implementation of smooth optimal transport.☆58Updated 4 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 4 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆46Updated 2 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