PythonOT / COOT

Related projects ⓘ

Alternatives and complementary repositories for COOT

• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆43Updated last year
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆41Updated 4 years ago
• iamalexkorotin / Wasserstein2Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)
  ☆35Updated 2 years ago
• cscarv / riemannian-metric-learning-ot
  ☆16Updated last year
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆66Updated 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 4 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆55Updated 6 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 3 years ago
• KrishnaswamyLab / DiffusionEMD
  Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings
  ☆35Updated last month
• BorgwardtLab / JointMDS
  Official implementation of Joint Multidimensional Scaling
  ☆21Updated last year
• LituRout / OptimalTransportModeling
  The repository contains reproducible PyTorch source code of our paper Generative Modeling with Optimal Transport Maps, ICLR 2022.
  ☆54Updated 2 years ago
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆15Updated 3 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆71Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆23Updated last year
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆56Updated 3 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆38Updated last year
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆40Updated last year
• audeg / Sinkhorn-GAN
  Learning generative models with Sinkhorn Loss
  ☆28Updated 6 years ago
• claying / OTK
  A Pytorch implementation of the optimal transport kernel embedding
  ☆114Updated 3 years ago
• hichamjanati / debiased-ot-barycenters
  ☆23Updated 3 years ago
• xieyujia / IPOT
  Implementation of Inexact Proximal point method for Optimal Transport
  ☆45Updated 3 years ago
• iamalexkorotin / Wasserstein2GenerativeNetworks
  PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)
  ☆50Updated last year
• meyerscetbon / LOT
  ☆16Updated 2 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆44Updated 4 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆54Updated 5 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 last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆30Updated 3 years ago
• kasparmartens / NeuralDecomposition
  PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"
  ☆25Updated 4 years ago