csyanbin / LSMI-Sinkhorn
Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
☆15Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for LSMI-Sinkhorn
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆44Updated 4 years ago
- ☆34Updated 4 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆40Updated last year
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 3 years ago
- Robust Optimal Transport code☆40Updated 2 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- ☆39Updated 4 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆45Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆39Updated last year
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆26Updated 4 years ago
- ☆12Updated 6 years ago
- ☆31Updated 4 years ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆39Updated 3 years ago
- Code for our paper "On Out-of-distribution detection with Energy-based Models" accepted to the ICML 2021 Workshop on Uncertainty & Robus…☆20Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆23Updated last year
- Stochastic algorithms for computing Regularized Optimal Transport☆55Updated 6 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆30Updated 2 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆30Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆53Updated 3 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆28Updated last year
- A Tensorflow implementation Mutual Information estimation methods☆45Updated last year
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆30Updated 3 years ago