Alternatives and similar repositories for partial-GW-for-PU

Users that are interested in partial-GW-for-PU are comparing it to the libraries listed below

• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 4 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆57Updated 6 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆101Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• bunnech / gwgan
  Learning Generative Models across Incomparable Spaces (ICML 2019)
  ☆27Updated 5 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆13Updated 5 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• CUAI / Differentiable-Frechet-Mean
  [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).
  ☆56Updated 3 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• meyerscetbon / LinearSinkhorn
  ☆16Updated 4 years ago
• eifuentes / swae-pytorch
  Implementation of the Sliced Wasserstein Autoencoder using PyTorch
  ☆103Updated 6 years ago
• oskopek / mvae
  Mixed-curvature Variational Autoencoders (ICLR 2020)
  ☆62Updated 4 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆59Updated 4 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• rythei / PyTorchOT
  implements optimal transport algorithms in pytorch
  ☆99Updated 3 years ago
• skolouri / swgmm
  Sliced Wasserstein Distance for Learning Gaussian Mixture Models
  ☆63Updated 2 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆41Updated last year
• chervud / AGD-vs-Sinkhorn
  Code for http://proceedings.mlr.press/v80/dvurechensky18a.html
  ☆16Updated 6 years ago
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆49Updated last year
• chingyaoc / kV-Margin
  NeurIPS 2021, Code for Measuring Generalization with Optimal Transport
  ☆28Updated 3 years ago
• xieyujia / IPOT
  Implementation of Inexact Proximal point method for Optimal Transport
  ☆48Updated 4 years ago
• fpcasale / GPPVAE
  Gaussian Process Prior Variational Autoencoder
  ☆84Updated 6 years ago
• GiulsLu / OT-gradients
  ☆12Updated 6 years ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆41Updated 2 years ago
• HeddaCohenIndelman / Learning-Gumbel-Sinkhorn-Permutations-w-Pytorch
  LEARNING LATENT PERMUTATIONS WITH GUMBEL-SINKHORN NETWORKS IMPLEMENTATION WITH PYTORCH
  ☆79Updated 2 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 4 years ago
• xwshen51 / DEAR
  Disentangled gEnerative cAusal Representation (DEAR)
  ☆60Updated 2 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆56Updated 6 years ago