csyanbin / LSMI-SinkhornLinks
Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
☆16Updated 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
Sorting:
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 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
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 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"☆41Updated last year
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆40Updated 2 years ago
- ☆40Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- ☆10Updated 2 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆48Updated 4 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- ☆17Updated 2 years ago
- ☆36Updated 4 years ago
- Spectral Graph Attention Network with Fast Eigen-approximation☆12Updated 3 years ago
- Python implementation of smooth optimal transport.☆58Updated 4 years ago
- FGCS 2021: Mutual teaching for graph convolutional networks☆15Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Hierarchical Wasserstein Alignment☆9Updated 5 years ago
- Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"☆10Updated 5 years ago
- Code for ICLR 2022 Paper, "Controlling Directions Orthogonal to a Classifier"☆35Updated last year
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- Robust Optimal Transport code☆43Updated 2 years ago
- A Tensorflow implementation Mutual Information estimation methods☆47Updated 2 years ago
- Implementation of Implicit Graphon Neural Representation☆12Updated last year