Alternatives and similar repositories for COOT:

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

• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 4 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆41Updated 4 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
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆67Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆42Updated 2 years ago
• KrishnaswamyLab / DiffusionEMD
  Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings
  ☆36Updated 4 months ago
• iamalexkorotin / Wasserstein2Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)
  ☆39Updated 2 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…
  ☆28Updated 2 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆57Updated 3 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆55Updated 5 years ago
• kasparmartens / NeuralDecomposition
  PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"
  ☆25Updated 4 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆24Updated 5 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• BorgwardtLab / JointMDS
  Official implementation of Joint Multidimensional Scaling
  ☆22Updated last year
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 3 years ago
• meyerscetbon / LOT
  ☆17Updated 2 years ago
• tolgabirdal / PHDimGeneralization
  Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.
  ☆31Updated last week
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆98Updated 2 years ago
• zengyi-li / NMCE-release
  Code for Neural Manifold Clustering and Embedding
  ☆59Updated 3 years ago
• xieyujia / IPOT
  Implementation of Inexact Proximal point method for Optimal Transport
  ☆47Updated 3 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• samirchowdhury / HyperCOT
  Code for computing Hypergraph Co-Optimal Transport distances
  ☆16Updated 2 years ago
• claying / OTK
  A Pytorch implementation of the optimal transport kernel embedding
  ☆115Updated 4 years ago
• trneedham / QuantizedGromovWasserstein
  Scalable framework for comparing metric measure spaces with up to 1M points.
  ☆14Updated 3 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago