Alternatives and similar repositories for COOT

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

• AmirTag / OT-ICNN
  Learning the optimal transport map via input convex neural neworks
  ☆42Updated 5 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• ratschlab / SVGP-VAE
  Tensorflow implementation for the SVGP-VAE model.
  ☆22Updated 4 years ago
• KrishnaswamyLab / DiffusionEMD
  Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings
  ☆38Updated last year
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 6 years ago
• kasparmartens / NeuralDecomposition
  PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"
  ☆25Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• cscarv / riemannian-metric-learning-ot
  ☆18Updated 2 years ago
• iamalexkorotin / Wasserstein2Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-2 transport maps computation (NeurIPS 2021)
  ☆43Updated 3 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆103Updated 3 years ago
• justkolesov / Wasserstein1Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).
  ☆21Updated last year
• hchau630 / LSC
  Code for "Disentangling images with Lie group transformations and sparse coding" (2023).
  ☆13Updated 4 years ago
• siplab-gt / VAELLS
  Code for "Variational Autoencoder with Learned Latent Structure"
  ☆34Updated 4 years ago
• pfnet-research / hyperbolic_wrapped_distribution
  ☆33Updated 6 years ago
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 4 years ago
• BorgwardtLab / topological-autoencoders
  Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.
  ☆152Updated 3 years ago
• rajesh-lab / deep_permutation_invariant
  Code accompanying paper "Set Norm and Equivariant Skip Connections: Putting the Deep in Deep Sets."
  ☆29Updated 3 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• samirchowdhury / HyperCOT
  Code for computing Hypergraph Co-Optimal Transport distances
  ☆17Updated 2 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…
  ☆20Updated 5 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆57Updated 6 years ago
• ParthaEth / Regularized_autoencoders-RAE-
  ☆125Updated 2 years ago
• audeg / Sinkhorn-GAN
  Learning generative models with Sinkhorn Loss
  ☆30Updated 7 years ago
• akandykeller / TopographicVAE
  Official implementation of the paper "Topographic VAEs learn Equivariant Capsules"
  ☆81Updated 3 years ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆42Updated 2 years ago
• GiulsLu / Sinkhorn-Barycenters
  Sinkhorn Barycenters via Frank-Wolfe algorithm
  ☆27Updated 5 years ago
• geomstats / challenge-iclr-2021
  GitHub repository for the ICLR Computational Geometry & Topology Challenge 2021
  ☆53Updated 3 years ago