Alternatives and similar repositories for OT-gradients

Users that are interested in OT-gradients are comparing it to the libraries listed below

• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆22Updated 5 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• fengliu90 / DK-for-TST
  This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).
  ☆50Updated 4 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• kimiandj / gsw
  ☆40Updated 5 years ago
• rflamary / JDOT
  Joint distribution optimal transportation for domain adaptation
  ☆102Updated 7 years ago
• skolouri / swgmm
  Sliced Wasserstein Distance for Learning Gaussian Mixture Models
  ☆63Updated 2 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• mrojascarulla / causal_transfer_learning
  ☆32Updated 7 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆26Updated 5 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
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆59Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• namkoong-lab / robustopt
  ☆43Updated 6 years ago
• fpcasale / GPPVAE
  Gaussian Process Prior Variational Autoencoder
  ☆84Updated 6 years ago
• ermongroup / smile-mi-estimator
  PyTorch implementation for the ICLR 2020 paper "Understanding the Limitations of Variational Mutual Information Estimators"
  ☆73Updated 5 years ago
• eifuentes / swae-pytorch
  Implementation of the Sliced Wasserstein Autoencoder using PyTorch
  ☆103Updated 6 years ago
• ilkhem / icebeem
  Code for ICE-BeeM paper - NeurIPS 2020
  ☆87Updated 3 years ago
• anonymous-iclr-2019 / acai-iclr-2019
  Anonymized code for ICLR 2019 submission "Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer"
  ☆20Updated 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
• vodp / py-kmm
  A Python implementation of Kernel Mean Matching data reweighting algorithm
  ☆32Updated 9 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆101Updated 2 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆56Updated 3 years ago
• charlesjin / adversarial_regularization
  A method based on manifold regularization for training adversarially robust neural networks
  ☆9Updated 5 years ago
• AMLab-Amsterdam / DIVA
  Implementation of 'DIVA: Domain Invariant Variational Autoencoders'
  ☆102Updated 5 years ago
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆49Updated last year