mblondel / smooth-otLinks
Python implementation of smooth optimal transport.
☆59Updated 4 years ago
Alternatives and similar repositories for smooth-ot
Users that are interested in smooth-ot are comparing it to the libraries listed below
Sorting:
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆56Updated 6 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Code for Sliced Gromov-Wasserstein☆68Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- ☆54Updated 11 months ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆20Updated 7 years ago
- Monotone operator equilibrium networks☆53Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Learning generative models with Sinkhorn Loss☆29Updated 6 years ago
- Spatio-temporal alignements: Optimal transport in space and time☆47Updated 2 months ago
- Learning the optimal transport map via input convex neural neworks☆41Updated 5 years ago
- ☆24Updated 3 years ago
- ☆30Updated 4 years ago
- Pytorch Implemetation for our NAACL2019 Paper "Riemannian Normalizing Flow on Variational Wasserstein Autoencoder for Text Modeling" http…☆62Updated 5 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Updated 5 years ago
- Mixed-curvature Variational Autoencoders (ICLR 2020)☆62Updated 4 years ago
- A Pytorch implementation of the optimal transport kernel embedding☆117Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Tensorflow implementation and notebooks for Implicit Maximum Likelihood Estimation☆67Updated 3 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 7 years ago
- ☆63Updated last year
- [AAAI 2020 Oral] Low-variance Black-box Gradient Estimates for the Plackett-Luce Distribution☆38Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated last year
- L. Chizat, G. Peyré, B. Schmitzer, F-X. Vialard. Scaling Algorithms for Unbalanced Transport Problems. Preprint Arxiv:1607.05816, 2016.☆42Updated 8 years ago
- ☆38Updated 5 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆63Updated 2 years ago
- Code for "Variational Autoencoder with Learned Latent Structure"☆34Updated 4 years ago
- implements optimal transport algorithms in pytorch☆99Updated 3 years ago