Alternatives and similar repositories for LOT:

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

• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆34Updated 4 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• Landmine598 / OT-DA
  ☆14Updated 4 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• PythonOT / OTML_course_2022
  ☆10Updated 2 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• khainb / Mini-batch-OT
  A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…
  ☆37Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 3 years ago
• nerdslab / latentOT
  Latent optimal transport (LOT) for low rank transport and clustering
  ☆19Updated 3 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 4 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 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…
  ☆21Updated 5 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆42Updated 5 years ago
• cedricvincentcuaz / GDL
  Code for Online Graph Dictionary Learning
  ☆16Updated 3 years ago
• allenhaozhu / COLES
  ☆21Updated 3 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆67Updated 5 years ago
• CSDUlm / wsingular
  Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".
  ☆9Updated 7 months ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• xiongbo010 / QGCN
  PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))
  ☆16Updated 9 months ago
• yang-han / P-reg
  Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)
  ☆34Updated 3 years ago
• hans66hsu / GATS
  Source code of "What Makes Graph Neural Networks Miscalibrated?" (NeurIPS 2022)
  ☆22Updated last year
• ratschlab / SVGP-VAE
  Tensorflow implementation for the SVGP-VAE model.
  ☆22Updated 3 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• zxj32 / uncertainty-GNN
  Uncertainty Aware Semi-Supervised Learning on Graph Data
  ☆40Updated 4 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year