Alternatives and similar repositories for LSMI-Sinkhorn

Users that are interested in LSMI-Sinkhorn are comparing it to the libraries listed below

• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• CSDUlm / wsingular
  Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".
  ☆10Updated 11 months ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• haguettaz / ChebLieNet
  ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.
  ☆15Updated last year
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• MinaGhadimiAtigh / hyperbolic_representation_learning
  The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022
  ☆64Updated 2 years ago
• bpucla / latent-space-EBM-prior
  ☆36Updated 4 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• xieyujia / IPOT
  Implementation of Inexact Proximal point method for Optimal Transport
  ☆48Updated 4 years ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆42Updated 2 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆42Updated last year
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• cscarv / riemannian-metric-learning-ot
  ☆17Updated 2 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆24Updated 3 years ago
• kimiandj / gsw
  ☆41Updated 5 years ago
• zengyi-li / NMCE-release
  Code for Neural Manifold Clustering and Embedding
  ☆61Updated 3 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
• ganmodokix / gwae
  PyTorch Implementation for Gromov-Wasserstein Autoencoders (GWAE)
  ☆43Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• justkolesov / Wasserstein1Benchmark
  A set of tests for evaluating large-scale algorithms for Wasserstein-1 transport computation (NeurIPS'22).
  ☆21Updated 11 months ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 5 years ago
• Newbeeer / orthogonal_classifier
  Code for ICLR 2022 Paper, "Controlling Directions Orthogonal to a Classifier"
  ☆35Updated 2 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 5 years ago
• a7b23 / H-Divergence
  ☆21Updated 3 years ago
• tolgabirdal / PHDimGeneralization
  Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.
  ☆30Updated 5 months ago
• clbonet / Spherical_Sliced-Wasserstein
  Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"
  ☆13Updated last year
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆43Updated 2 years ago
• chingyaoc / kV-Margin
  NeurIPS 2021, Code for Measuring Generalization with Optimal Transport
  ☆28Updated 3 years ago