Alternatives and similar repositories for latentOT

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

• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 5 years ago
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆105Updated 4 years ago
• trneedham / QuantizedGromovWasserstein
  Scalable framework for comparing metric measure spaces with up to 1M points.
  ☆15Updated 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…
  ☆36Updated 2 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 6 years ago
• HongtengXu / Relational-AutoEncoders
  Learning Autoencoders with Relational Regularization
  ☆46Updated 5 years ago
• rpatrik96 / ima-vae
  This is the code for the paper Embrace the Gap: VAEs perform Independent Mechanism Analysis, showing that optimizing the ELBO is equivale…
  ☆23Updated last year
• ratschlab / SVGP-VAE
  Tensorflow implementation for the SVGP-VAE model.
  ☆22Updated 4 years ago
• gemoran / sparse-vae-code
  ☆31Updated 3 years ago
• danielgreenfeld3 / XIC
  Robust Learning with the Hilbert-Schmidt Independence Criterion
  ☆49Updated 5 years ago
• divamgupta / deep-clustering-kingdra
  Official implementation of ICLR 2020 paper Unsupervised Clustering using Pseudo-semi-supervised Learning
  ☆48Updated 4 years ago
• vivienseguy / Large-Scale-OT
  Stochastic algorithms for computing Regularized Optimal Transport
  ☆58Updated 7 years ago
• mfbalin / Concrete-Autoencoders
  ☆122Updated 3 years ago
• zengyi-li / NMCE-release
  Code for Neural Manifold Clustering and Embedding
  ☆61Updated 3 years ago
• atuannguyen / DIRT
  ☆10Updated 3 years ago
• ilkhem / icebeem
  Code for ICE-BeeM paper - NeurIPS 2020
  ☆87Updated 4 years ago
• is0383kk / Pytorch_VAE-GMM
  Implementation of mutual learning model between VAE and GMM.
  ☆28Updated 2 months ago
• chingyaoc / InfoOT
  [ICML2023] InfoOT: Information Maximizing Optimal Transport
  ☆42Updated 2 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• cyz-ai / infomin
  Official codes for Scalable Infomin Learning, NeurIPS 2022
  ☆13Updated 2 years ago
• aniruddhraghu / meta-pretraining
  Code accompanying paper: Meta-Learning to Improve Pre-Training
  ☆37Updated 4 years ago
• sudiptodip15 / CCMI
  Classifier based mutual information, conditional mutual information estimation; conditional independence testing
  ☆35Updated 6 years ago
• lazaratan / dyn-gfn
  DynGFN: Bayesian Dynamic Causal Discovery using Generative Flow Networks
  ☆58Updated 3 months ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 3 years ago
• BorgwardtLab / JointMDS
  Official implementation of Joint Multidimensional Scaling
  ☆23Updated 2 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• abidlabs / contrastive_vae
  Contrastive Variational Autoencoders
  ☆71Updated 6 years ago
• felipeangelimvieira / SharedNearestNeighbors
  A Shared Nearest Neighbors clustering implementation. This code is basically a wrapper of sklearn DBSCAN, implementing the neighborhood s…
  ☆15Updated 3 years ago