Fast Algorithms for Computational Optimal Transport and Wasserstein
Barycenter

v1v2v3v4 (latest)

Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter

23 May 2019

Michael I. Jordan

ArXiv (abs)PDF HTML

Papers citing "Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter"

11 / 11 papers shown

Title
Probabilistic Multilevel Clustering via Composite Transportation Distance Nhat Ho Viet Huynh Dinh Q. Phung Michael I. Jordan 33 21 0 29 Oct 2018
Sparsemax and Relaxed Wasserstein for Topic Sparsity Tianyi Lin Zhibo Hu Xin Guo 50 39 0 22 Oct 2018
Uncoupled isotonic regression via minimum Wasserstein deconvolution Philippe Rigollet Jonathan Niles-Weed 66 64 0 27 Jun 2018
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters Pavel Dvurechensky D. Dvinskikh Alexander Gasnikov César A. Uribe Angelia Nedić 47 105 0 11 Jun 2018
Wasserstein Auto-Encoders Ilya O. Tolstikhin Olivier Bousquet Sylvain Gelly B. Schölkopf DRL 122 1,057 0 05 Nov 2017
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration Jason M. Altschuler Jonathan Niles-Weed Philippe Rigollet OT 72 594 0 26 May 2017
Stochastic Optimization for Large-scale Optimal Transport Aude Genevay Marco Cuturi Gabriel Peyré Francis R. Bach OT 75 468 0 27 May 2016
Optimal Transport for Domain Adaptation Nicolas Courty Rémi Flamary D. Tuia A. Rakotomamonjy OT OOD 145 1,123 0 02 Jul 2015
Fast Computation of Wasserstein Barycenters Marco Cuturi Arnaud Doucet OT 105 741 0 16 Oct 2013
Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances Marco Cuturi OT 218 4,288 0 04 Jun 2013
Convergence of latent mixing measures in finite and infinite mixture models X. Nguyen 98 184 0 15 Sep 2011

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.