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
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 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
- ☆38Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 3 years ago
- CO-Optimal Transport☆42Updated 5 years ago
- ☆17Updated 3 years ago
- Implementation of Implicit Graphon Neural Representation☆12Updated 2 years ago
- ☆42Updated 5 years ago
- ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.☆14Updated last year
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆43Updated 2 years ago
- PyTorch Implementation for Gromov-Wasserstein Autoencoders (GWAE)☆44Updated 2 years ago
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆39Updated 4 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 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
- ☆14Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 6 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Python notebooks for Optimal Transport between Gaussian Mixture Models☆47Updated 4 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆25Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆17Updated 7 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 3 years ago
- ☆12Updated 7 years ago
- Energy Based Models are a quite novel technique for density estimation. In this university project I explore this new research topic and …☆16Updated 4 years ago
- Official code for the CVPR 2022 (oral) paper "OrphicX: A Causality-Inspired Latent Variable Model for Interpreting Graph Neural Networks.…☆35Updated 3 years ago
- Robust Optimal Transport code☆43Updated 3 years ago
- Official PyTorch implementation of 🏁 MFCVAE 🏁: "Multi-Facet Clustering Variatonal Autoencoders (MFCVAE)" (NeurIPS 2021). A class of var…☆40Updated 2 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 4 years ago