lchapel / partial-GW-for-PULinks
Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs/2002.08276
☆21Updated 5 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
Sorting:
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆65Updated 4 years ago
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆103Updated 6 years ago
- ☆16Updated 4 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- implements optimal transport algorithms in pytorch☆100Updated 3 years ago
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆117Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- LEARNING LATENT PERMUTATIONS WITH GUMBEL-SINKHORN NETWORKS IMPLEMENTATION WITH PYTORCH☆79Updated 2 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆48Updated 4 years ago
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 3 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 3 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Anonymized code for ICLR 2019 submission "Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer"☆20Updated 6 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Updated 5 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 http://proceedings.mlr.press/v80/dvurechensky18a.html☆17Updated 7 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆66Updated 2 years ago
- ☆32Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year