Alternatives and similar repositories for OT-ICNN

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

• iamalexkorotin / Wasserstein2Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)
  ☆42Updated 3 years ago
• facebookresearch / w2ot
  Euclidean Wasserstein-2 optimal transportation
  ☆47Updated last year
• EmoryMLIP / OT-Flow
  PyTorch implementation of the OT-Flow approach in arXiv:2006.00104
  ☆55Updated 11 months ago
• iamalexkorotin / Wasserstein2GenerativeNetworks
  PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)
  ☆53Updated 2 years ago
• justkolesov / Wasserstein1Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).
  ☆21Updated 10 months ago
• MichaelArbel / MMD-gradient-flow
  ☆12Updated 11 months ago
• siplab-gt / VAELLS
  Code for "Variational Autoencoder with Learned Latent Structure"
  ☆34Updated 4 years ago
• facebookresearch / rcpm
  Riemannian Convex Potential Maps
  ☆67Updated 2 years ago
• dimkal89 / rvae
  ☆38Updated 5 years ago
• PetrMokrov / Large-Scale-Wasserstein-Gradient-Flows
  Source code for Large-Scale Wasserstein Gradient Flows (NeurIPS 2021)
  ☆33Updated 3 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆26Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆59Updated 4 years ago
• georgiosarvanitidis / geometric_ml
  This repository contains code for applying Riemannian geometry in machine learning.
  ☆77Updated 4 years ago
• franciscovargas / GP_Sinkhorn
  GP Sinkhorn Implementation, paper: https://www.mdpi.com/1099-4300/23/9/1134
  ☆23Updated 3 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• audeg / Sinkhorn-GAN
  Learning generative models with Sinkhorn Loss
  ☆29Updated 6 years ago
• MichaelArbel / GeneralizedEBM
  ☆54Updated 11 months ago
• ChengzijunAixiaoli / PPMM
  Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]
  ☆15Updated 4 years ago
• noamroze / moser_flow
  ☆17Updated 3 years ago
• wgrathwohl / VERA
  ☆63Updated last year
• gpeyre / 2017-MCOM-unbalanced-ot
  L. Chizat, G. Peyré, B. Schmitzer, F-X. Vialard. Scaling Algorithms for Unbalanced Transport Problems. Preprint Arxiv:1607.05816, 2016.
  ☆42Updated 8 years ago
• CW-Huang / CP-Flow
  Convex potential flows
  ☆83Updated 3 years ago
• xinshi-chen / ParticleFlowBayesRule
  Pytorch implementation for "Particle Flow Bayes' Rule"
  ☆14Updated 6 years ago
• crisbodnar / ndp
  Official code for the ICLR 2021 paper Neural ODE Processes
  ☆72Updated 3 years ago
• CUAI / Neural-Manifold-Ordinary-Differential-Equations
  [NeurIPS 2020] Neural Manifold Ordinary Differential Equations (https://arxiv.org/abs/2006.10254)
  ☆119Updated 2 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• cfinlay / ffjord-rnode
  Regularized Neural ODEs (RNODE)
  ☆82Updated 4 years ago
• take-koshizuka / NLSB
  ☆20Updated 5 months ago