francoispierrepaty / SubspaceRobustWassersteinLinks
Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
☆29Updated 6 years ago
Alternatives and similar repositories for SubspaceRobustWasserstein
Users that are interested in SubspaceRobustWasserstein are comparing it to the libraries listed below
Sorting:
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆59Updated 4 years ago
- ☆41Updated 5 years ago
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆20Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- ☆12Updated 7 years ago
- Implementation of the Sliced Wasserstein Autoencoder using PyTorch☆102Updated 7 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆27Updated 5 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆66Updated 2 years ago
- [NeurIPS 2020]. COPT - Coordinated Optimal Transport on Graphs☆16Updated 4 years ago
- NeurIPS 2021, Code for Measuring Generalization with Optimal Transport☆28Updated 4 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
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- A Python implementation of Monge optimal transportation☆49Updated 2 years ago
- This is the source code for Learning Deep Kernels for Non-Parametric Two-Sample Tests (ICML2020).☆51Updated 4 years ago
- ☆37Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆65Updated 4 years ago
- Code for "Variational Autoencoder with Learned Latent Structure"☆34Updated 4 years ago
- ☆30Updated 5 years ago
- Code to accompany paper 'Bayesian Deep Ensembles via the Neural Tangent Kernel'☆26Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 6 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Learning generative models with Sinkhorn Loss☆30Updated 6 years ago
- PyTorch implementation of the paper "Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization" (ICLR 2021)☆24Updated 3 years ago