csyanbin / LSMI-Sinkhorn
Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
☆15Updated 3 years ago
Alternatives and similar repositories for LSMI-Sinkhorn:
Users that are interested in LSMI-Sinkhorn are comparing it to the libraries listed below
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆40Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆40Updated last year
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆47Updated 3 years ago
- ☆35Updated 4 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- ☆39Updated 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
- Robust Optimal Transport code☆41Updated 2 years ago
- ☆17Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated last year
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 3 years ago
- ☆12Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 5 years ago
- Multimodal Generative Learning Utilizing Jensen-Shannon-Divergence☆18Updated 2 years ago
- ☆31Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"☆10Updated 5 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆31Updated 7 years ago
- Repository for conditional transport☆14Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- ☆13Updated 4 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆23Updated 2 years ago
- Hierarchical Wasserstein Alignment☆9Updated 5 years ago
- Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…☆34Updated 2 years ago