lchapel / partial-GW-for-PU
Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs/2002.08276
☆21Updated 4 years ago
Alternatives and similar repositories for partial-GW-for-PU:
Users that are interested in partial-GW-for-PU are comparing it to the libraries listed below
- Learning Autoencoders with Relational Regularization☆45Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆43Updated last year
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 4 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆47Updated 3 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆40Updated last year
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆44Updated 2 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- ☆16Updated 4 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆31Updated 7 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆22Updated 5 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆15Updated 3 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆54Updated 5 years ago
- ☆24Updated 3 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆28Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆40Updated last year
- ☆13Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆31Updated 4 years ago
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 3 years ago
- ☆64Updated 4 years ago
- ☆12Updated 6 years ago