Alternatives and similar repositories for unbalanced_gromov_wasserstein

Users that are interested in unbalanced_gromov_wasserstein are comparing it to the libraries listed below

• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 6 years ago
• thibsej / unbalanced-ot-functionals
  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
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆100Updated 2 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• bunnech / jkonet
  Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)
  ☆20Updated 2 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• lchapel / partial-GW-for-PU
  Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…
  ☆21Updated 5 years ago
• ratschlab / SVGP-VAE
  Tensorflow implementation for the SVGP-VAE model.
  ☆22Updated 3 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• vislearn / GIN
  Code for the paper "Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (GIN)" (2020)
  ☆32Updated 3 years ago
• dimkal89 / rvae
  ☆38Updated 4 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆41Updated 4 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• trneedham / QuantizedGromovWasserstein
  Scalable framework for comparing metric measure spaces with up to 1M points.
  ☆14Updated 4 years ago
• iamalexkorotin / Wasserstein2Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)
  ☆41Updated 3 years ago
• akekic / causal-component-analysis
  ☆25Updated last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• cscarv / riemannian-metric-learning-ot
  ☆17Updated last year
• fpcasale / GPPVAE
  Gaussian Process Prior Variational Autoencoder
  ☆84Updated 6 years ago
• franciscovargas / GP_Sinkhorn
  GP Sinkhorn Implementation, paper: https://www.mdpi.com/1099-4300/23/9/1134
  ☆23Updated 3 years ago
• ilkhem / icebeem
  Code for ICE-BeeM paper - NeurIPS 2020
  ☆87Updated 3 years ago
• MichaelArbel / MMD-gradient-flow
  ☆12Updated 11 months ago
• audeg / Sinkhorn-GAN
  Learning generative models with Sinkhorn Loss
  ☆29Updated 6 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• lgresele / independent-mechanism-analysis
  Code for the paper: "Independent mechanism analysis, a new concept?"
  ☆24Updated last year
• sciai-lab / BranchedOT
  ☆13Updated last year