Alternatives and similar repositories for LOT

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

• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• Landmine598 / OT-DA
  ☆14Updated 5 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…
  ☆36Updated 2 years ago
• 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
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• kimiandj / gsw
  ☆42Updated 5 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆43Updated 2 years ago
• facebookresearch / CausalRepID
  Experiments to reproduce results in Interventional Causal Representation Learning.
  ☆26Updated 2 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆37Updated 2 years ago
• cambridge-mlg / CLUE
  Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"
  ☆36Updated last year
• zxj32 / uncertainty-GNN
  Uncertainty Aware Semi-Supervised Learning on Graph Data
  ☆39Updated 4 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 5 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆24Updated 3 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 4 years ago
• zengyi-li / NMCE-release
  Code for Neural Manifold Clustering and Embedding
  ☆61Updated 3 years ago
• sharpenb / Posterior-Network
  Posterior Network: Uncertainty Estimation without OOD Samples via Density-Based Pseudo-Counts (Neurips 2020)
  ☆78Updated 3 years ago
• VinAIResearch / DSW
  Distributional Sliced-Wasserstein distance code
  ☆50Updated last year
• MinaGhadimiAtigh / hyperbolic_representation_learning
  The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022
  ☆66Updated 3 years ago
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆104Updated 4 years ago
• ChongYou / robust-image-recovery
  ☆15Updated 5 years ago
• xu-ji / information-bottleneck
  Deep Learning & Information Bottleneck
  ☆62Updated 2 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 5 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago
• ChengzijunAixiaoli / PPMM
  Python3 implementation of the paper [Large-scale optimal transport map estimation using projection pursuit]
  ☆15Updated 4 years ago
• hedixia / HeavyBallNODE
  ☆13Updated 4 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆73Updated 6 years ago
• PythonOT / OTML_course_2022
  ☆10Updated 3 years ago