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
- Scalable framework for comparing metric measure spaces with up to 1M points.☆14Updated 3 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Hierarchical Wasserstein Alignment☆9Updated 5 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 3 years ago
- ☆17Updated 2 years ago
- PyTorch Implementation - Mine Your Own vieW: Self-Supervised Learning Through Across-Sample Prediction☆31Updated 3 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆16Updated 3 years ago
- Alignment between clustered datasets via hierarchical Wasserstein distance☆37Updated last year
- Deep Large-Scale Inference UsingKnockoffs☆11Updated 3 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
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- Code for Sliced Gromov-Wasserstein☆67Updated 5 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
- Code for the paper "End-to-end training of deep probabilistic CCA on paired biomedical observations".☆25Updated 3 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆34Updated 4 years ago
- Code for Neural Manifold Clustering and Embedding☆59Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆96Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆46Updated 2 years ago
- ☆36Updated 3 years ago
- A Shared Nearest Neighbors clustering implementation. This code is basically a wrapper of sklearn DBSCAN, implementing the neighborhood s…☆14Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆40Updated last year
- ☆19Updated last year
- Official codes for Scalable Infomin Learning, NeurIPS 2022☆13Updated 2 years ago
- ☆34Updated 4 years ago