nerdslab / latentOT
Latent optimal transport (LOT) for low rank transport and clustering
☆19Updated 3 years ago
Alternatives and similar repositories for latentOT:
Users that are interested in latentOT are comparing it to the libraries listed below
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated last year
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 3 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- PyTorch Implementation - Mine Your Own vieW: Self-Supervised Learning Through Across-Sample Prediction☆31Updated 3 years ago
- Alignment between clustered datasets via hierarchical Wasserstein distance☆37Updated last year
- Tensorflow implementation for the SVGP-VAE model.☆21Updated 3 years ago
- Hierarchical Wasserstein Alignment☆9Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆96Updated 3 years ago
- ☆17Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 5 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆45Updated 2 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆37Updated 2 years ago
- This repository holds the code for the paper "Deep Conditional Gaussian Mixture Model forConstrained Clustering".☆31Updated 2 years ago
- ☆17Updated 6 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆32Updated 4 years ago
- Classifier based mutual information, conditional mutual information estimation; conditional independence testing☆34Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆23Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆9Updated 5 months ago
- Code for Neural Manifold Clustering and Embedding☆57Updated 2 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆28Updated 2 years ago
- Code accompanying paper: Meta-Learning to Improve Pre-Training☆37Updated 3 years ago
- This is the code for the paper Embrace the Gap: VAEs perform Independent Mechanism Analysis, showing that optimizing the ELBO is equivale…☆23Updated 9 months ago
- ☆33Updated last year
- ☆32Updated 2 years ago
- ☆36Updated 3 years ago