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
☆20Updated 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:
- Code for Sliced Gromov-Wasserstein☆69Updated 6 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆104Updated 3 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
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆66Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 4 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆15Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 3 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆42Updated 2 years ago
- HGCAE Pytorch implementation. CVPR2021 accepted.☆44Updated 2 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 4 years ago
- Python implementation of smooth optimal transport.☆61Updated 4 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆119Updated 4 years ago
- ☆16Updated 5 years ago
- Official PyTorch implementation of 🏁 MFCVAE 🏁: "Multi-Facet Clustering Variatonal Autoencoders (MFCVAE)" (NeurIPS 2021). A class of var…☆40Updated 2 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 4 years ago
- LEARNING LATENT PERMUTATIONS WITH GUMBEL-SINKHORN NETWORKS IMPLEMENTATION WITH PYTORCH☆81Updated 2 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆43Updated 2 years ago
- implements optimal transport algorithms in pytorch☆104Updated 3 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆31Updated 8 years ago
- Code for ICLR 2022 Paper, "Controlling Directions Orthogonal to a Classifier"☆35Updated 2 years ago
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆101Updated 7 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆50Updated 4 years ago
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 4 years ago
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆31Updated 3 years ago