francoispierrepaty / SubspaceRobustWasserstein
Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
☆28Updated 5 years ago
Alternatives and similar repositories for SubspaceRobustWasserstein:
Users that are interested in SubspaceRobustWasserstein are comparing it to the libraries listed below
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- ☆39Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Code for Sliced Gromov-Wasserstein☆67Updated 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
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆55Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Updated 3 years ago
- ☆38Updated 4 years ago
- ☆12Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 5 years ago
- ☆31Updated 4 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆15Updated 3 years ago
- Sliced Wasserstein Generator☆23Updated 6 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆33Updated 4 years ago
- Robust Optimal Transport code☆42Updated 2 years ago
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- Code to accompany paper 'Bayesian Deep Ensembles via the Neural Tangent Kernel'☆27Updated 4 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 3 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
- Closed form Entropic OT for balanced and unbalanced Gaussians☆17Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- CO-Optimal Transport☆42Updated 4 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆23Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- ☆17Updated 2 years ago
- ☆24Updated 3 years ago