activity
20152019
most citedNear-linear time approximation algorithms for optimal transport via Sinkhorn iteration

290 citations · 467 across the 9 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.DS2018★ 12 cited

Approximating the Quadratic Transportation Metric in Near-Linear Time

Jason Altschuler, Francis Bach, Alessandro Rudi +1

Computing the quadratic transportation metric (also called the -Wasserstein distance or root mean square distance) between two point clouds, or, more generally, two discrete dis…

math.ST2018

Entropic optimal transport is maximum-likelihood deconvolution

Philippe Rigollet, Jonathan Weed

We give a statistical interpretation of entropic optimal transport by showing that performing maximum-likelihood estimation for Gaussian deconvolution corresponds to calculating a…

math.OC2018★ 11 cited

An explicit analysis of the entropic penalty in linear programming

Jonathan Weed

Solving linear programs by using entropic penalization has recently attracted new interest in the optimization community, since this strategy forms the basis for the fastest-known…

math.ST2018

Uncoupled isotonic regression via minimum Wasserstein deconvolution

Philippe Rigollet, Jonathan Weed

Isotonic regression is a standard problem in shape-constrained estimation where the goal is to estimate an unknown nondecreasing regression function from independent pairs $(x_…

stat.ML2018★ 41 cited

Statistical Optimal Transport via Factored Couplings

Aden Forrow, Jan-Christian Hütter, Mor Nitzan +3

We propose a new method to estimate Wasserstein distances and optimal transport plans between two probability distributions from samples in high dimension. Unlike plug-in rules tha…