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
- ☆37Updated 4 years ago
- ChebLieNet, a spectral graph neural network turned equivariant by Riemannian geometry on Lie groups.☆14Updated last year
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆20Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- ☆13Updated 2 years ago
- Official implementation of "Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks", NeurIPS 2021.☆30Updated 5 months ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 3 years ago
- ☆41Updated 5 years ago
- Code for Graph Normalizing Flows.☆63Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Uncertainty Aware Semi-Supervised Learning on Graph Data☆38Updated 4 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- ☆27Updated 2 years ago
- ☆12Updated 4 years ago
- The repository for Hyperbolic Representation Learning for Computer Vision, ECCV 2022☆64Updated 2 years ago
- ☆17Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 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
- Implementation of Inexact Proximal point method for Optimal Transport☆49Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆27Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- ☆30Updated 4 years ago