Alternatives and similar repositories for LOT

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

• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 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"
  ☆29Updated 6 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• Landmine598 / OT-DA
  ☆14Updated 4 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆23Updated 3 years ago
• kimiandj / gsw
  ☆40Updated 5 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated last year
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 4 years ago
• FFTYYY / TWIRLS
  The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".
  ☆43Updated 4 years ago
• PythonOT / OTML_course_2022
  ☆10Updated 3 years ago
• xiongbo010 / QGCN
  PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))
  ☆16Updated last year
• mmderakhshani / KCL
  [ICML 2021] Kernel Continual Learning
  ☆7Updated 3 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆101Updated 4 years ago
• WanyuGroup / CVPR2022-OrphicX
  Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…
  ☆34Updated 3 years ago
• xu-ji / information-bottleneck
  Deep Learning & Information Bottleneck
  ☆61Updated 2 years ago
• SwiftieH / SpGAT
  Spectral Graph Attention Network with Fast Eigen-approximation
  ☆12Updated 3 years ago
• MinaGhadimiAtigh / hyperbolic_representation_learning
  The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022
  ☆63Updated 2 years ago
• RingBDStack / ACE-HGNN
  Code for “ACE-HGNN: Adaptive Curvature ExplorationHyperbolic Graph Neural Network”
  ☆16Updated 3 years ago
• clbonet / Spherical_Sliced-Wasserstein
  Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"
  ☆13Updated last year
• tnbar / tednet
  TedNet: A Pytorch Toolkit for Tensor Decomposition Networks
  ☆98Updated 3 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆101Updated 2 years ago
• tolgabirdal / PHDimGeneralization
  Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.
  ☆30Updated 3 months ago
• ChengzijunAixiaoli / PPMM
  Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]
  ☆15Updated 4 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago