JasonAltschuler / OptimalTransportNIPS17
Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Altschuler, Jonathan Weed, and Philippe Rigollet. Full paper available at: https://papers.nips.cc/paper/6792-near-linear-time-approximation-algorithms-for-optimal-transport-via-sinkhorn-iteration.
☆31Updated 7 years ago
Alternatives and similar repositories for OptimalTransportNIPS17:
Users that are interested in OptimalTransportNIPS17 are comparing it to the libraries listed below
- demo codes for several approximate optimal transport solvers☆20Updated 6 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆16Updated 6 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆47Updated 3 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- L. Chizat, G. Peyré, B. Schmitzer, F-X. Vialard. Scaling Algorithms for Unbalanced Transport Problems. Preprint Arxiv:1607.05816, 2016.☆42Updated 8 years ago
- Python implementation of smooth optimal transport.☆57Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆57Updated 6 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆24Updated 5 years ago
- Code for Sliced Gromov-Wasserstein☆66Updated 5 years ago
- ☆12Updated 6 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- A collection of adaptive sparse multi-scale solvers for optimal transport and related optimization problems.☆53Updated 3 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆27Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Optimal transport and generalizations☆62Updated 5 years ago
- Tensorflow Implementation of "Large-scale Optimal Transport and Mapping Estimation"(ICLR2018/NIPS 2017 OTML)☆19Updated 6 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆62Updated last year
- J-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, G. Peyré. Iterative Bregman Projections for Regularized Transportation Problems. SIAM Jour…☆32Updated 8 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 5 years ago
- Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …☆25Updated 5 years ago
- ☆13Updated 5 years ago
- Stochastic Optimization for Optimal Transport☆22Updated 8 years ago
- The code for Differentiable Linearized ADMM (ICML 2019)☆34Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated last year
- Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"☆10Updated 5 years ago
- Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"☆15Updated 3 years ago
- Sliced Wasserstein Generator☆37Updated 6 years ago