Alternatives and similar repositories for wsingular

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

• 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
• lmotte / graph-prediction-with-fused-gromov-wasserstein
  Python implementation of the supervised graph prediction method proposed in http://arxiv.org/abs/2202.03813 using PyTorch library and POT…
  ☆13Updated 3 years ago
• cscarv / riemannian-metric-learning-ot
  ☆17Updated last year
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆44Updated 2 years ago
• clbonet / Spherical_Sliced-Wasserstein
  Implementation of our ICLR2023 paper "Spherical-Sliced Wasserstein"
  ☆13Updated last year
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆40Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago
• iamalexkorotin / Wasserstein2Barycenters
  PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)
  ☆23Updated 2 years ago
• twistedcubic / copt
  [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs
  ☆16Updated 4 years ago
• yogeshbalaji / robustOT
  Robust Optimal Transport code
  ☆43Updated 2 years ago
• PythonOT / OTML_course_2022
  ☆10Updated 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
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 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
  ☆36Updated last year
• Mishne-Lab / IGNR
  Implementation of Implicit Graphon Neural Representation
  ☆12Updated last year
• csyanbin / LSMI-Sinkhorn
  Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
  ☆16Updated 3 years ago
• haguettaz / ChebLieNet
  ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.
  ☆16Updated 8 months ago
• Newbeeer / orthogonal_classifier
  Code for ICLR 2022 Paper, "Controlling Directions Orthogonal to a Classifier"
  ☆35Updated last year
• gnobitab / ConstrainedDiffusionBridge
  ☆12Updated 2 years ago
• meyerscetbon / LOT
  ☆17Updated 2 years ago
• iamalexkorotin / KernelNeuralOptimalTransport
  PyTorch implementation of "Kernel Neural Optimal Transport" (ICLR 2023)
  ☆25Updated last year
• danielegrattarola / GINR
  Code for "Generalised Implicit Neural Representations" (NeurIPS 2022).
  ☆70Updated 2 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• KingJamesSong / latent-flow
  NeurIPS23 "Flow Factorized Representation Learning"
  ☆35Updated 6 months ago
• khainb / EBSW
  Official PyTorch implementation for paper: Energy-Based Sliced Wasserstein Distance
  ☆18Updated 2 months ago
• Pseudomanifold / pyper
  Python-based persistent homology algorithms
  ☆19Updated last year
• zengyi-li / NMCE-release
  Code for Neural Manifold Clustering and Embedding
  ☆59Updated 3 years ago