thibsej / unbalanced_gromov_wasserstein
Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
☆43Updated last year
Related projects ⓘ
Alternatives and complementary repositories for unbalanced_gromov_wasserstein
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated last year
- Learning Autoencoders with Relational Regularization☆44Updated 4 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆26Updated 4 years ago
- Tensorflow implementation for the SVGP-VAE model.☆21Updated 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
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆28Updated last year
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆55Updated 6 years ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 4 years ago
- GP Sinkhorn Implementation, paper: https://www.mdpi.com/1099-4300/23/9/1134☆22Updated 2 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆16Updated last year
- CO-Optimal Transport☆42Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆38Updated last year
- A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)☆35Updated 2 years ago
- ☆36Updated 4 years ago
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- ☆16Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- ☆12Updated 6 years ago
- Supervised Training of Conditional Monge Maps☆13Updated last year
- ☆39Updated 4 years ago
- ☆17Updated 10 months ago
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 3 years ago
- Code for the paper "Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)" (2020)☆31Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago