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
  ☆45Updated 2 years ago
• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆42Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago
• ratschlab / SVGP-VAE
  Tensorflow implementation for the SVGP-VAE model.
  ☆22Updated 4 years ago
• samirchowdhury / HyperCOT
  Code for computing Hypergraph Co-Optimal Transport distances
  ☆16Updated 2 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
  ☆69Updated 5 years ago
• kasparmartens / NeuralDecomposition
  PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"
  ☆25Updated 5 years ago
• siplab-gt / VAELLS
  Code for "Variational Autoencoder with Learned Latent Structure"
  ☆34Updated 4 years ago
• audeg / Sinkhorn-GAN
  Learning generative models with Sinkhorn Loss
  ☆30Updated 7 years ago
• Sanaelotfi / Bayesian_model_comparison
  Supporing code for the paper "Bayesian Model Selection, the Marginal Likelihood, and Generalization".
  ☆37Updated 3 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• chingyaoc / kV-Margin
  NeurIPS 2021, Code for Measuring Generalization with Optimal Transport
  ☆28Updated 4 years ago
• cscarv / riemannian-metric-learning-ot
  ☆17Updated 2 years ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆42Updated 2 years ago
• geomstats / challenge-iclr-2021
  GitHub repository for the ICLR Computational Geometry & Topology Challenge 2021
  ☆53Updated 3 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• KrishnaswamyLab / DiffusionEMD
  Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings
  ☆38Updated last year
• hichamjanati / spatio-temporal-alignements
  Spatio-temporal alignements: Optimal transport in space and time
  ☆48Updated 7 months ago
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆43Updated 3 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆59Updated 4 years ago
• fedelopez77 / sympa
  Embedding graphs in symmetric spaces
  ☆30Updated 4 years ago
• hchau630 / LSC
  Code for "Disentangling images with Lie group transformations and sparse coding" (2023).
  ☆13Updated 4 years ago
• spbu-math-cs / Graph-Gaussian-Processes
  Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".
  ☆53Updated last week
• 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…
  ☆20Updated 5 years ago
• aripakman / neural_clustering_process
  Implementation of the Neural Clustering Process algorithm in Pytorch
  ☆31Updated 5 years ago
• facebookresearch / w2ot
  Euclidean Wasserstein-2 optimal transportation
  ☆47Updated 2 years ago
• iamalexkorotin / Wasserstein2Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)
  ☆45Updated 3 years ago
• MarcTLaw / UltrahyperbolicRepresentation
  Ultrahyperbolic Representation Learning
  ☆13Updated 5 years ago