csyanbin / LSMI-SinkhornLinks
Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
☆16Updated 4 years ago
Alternatives and similar repositories for LSMI-Sinkhorn
Users that are interested in LSMI-Sinkhorn are comparing it to the libraries listed below
Sorting:
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- PyTorch Implementation for Gromov-Wasserstein Autoencoders (GWAE)☆43Updated 2 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆48Updated 4 years ago
- ☆36Updated 4 years ago
- The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022☆63Updated 2 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
- Implementation of Implicit Graphon Neural Representation☆12Updated last year
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆10Updated 10 months ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated last year
- Generative Modeling with Optimal Transport Maps - ICLR 2022☆60Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- A Tensorflow implementation Mutual Information estimation methods☆47Updated 2 years ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆46Updated 4 years ago
- ☆13Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 3 years ago
- ☆17Updated 2 years ago
- Official PyTorch implementation of 🏁 MFCVAE 🏁: "Multi-Facet Clustering Variatonal Autoencoders (MFCVAE)" (NeurIPS 2021). A class of var…☆40Updated last year
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆41Updated 2 years ago
- Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…☆34Updated 3 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- HGCAE Pytorch implementation. CVPR2021 accepted.☆44Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆101Updated 2 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago