csyanbin / LSMI-SinkhornLinks
Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
☆17Updated 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
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 3 years ago
- CO-Optimal Transport☆42Updated 5 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆20Updated 5 years ago
- ☆17Updated 3 years ago
- Python package for the ICML 2022 paper "Unsupervised Ground Metric Learning Using Wasserstein Singular Vectors".☆10Updated last year
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 years ago
- ☆38Updated 5 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 5 years ago
- ☆42Updated 5 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 6 years ago
- Robust Optimal Transport code☆43Updated 3 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆43Updated 2 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆50Updated 4 years ago
- The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022☆66Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆47Updated 4 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 4 years ago
- ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.☆14Updated last year
- PyTorch Implementation for Gromov-Wasserstein Autoencoders (GWAE)☆44Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- ☆10Updated 3 years ago
- ☆14Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- ☆18Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Official PyTorch implementation of 🏁 MFCVAE 🏁: "Multi-Facet Clustering Variatonal Autoencoders (MFCVAE)" (NeurIPS 2021). A class of var…☆40Updated 2 years ago
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆39Updated 4 years ago