
Massively scalable Sinkhorn distances via the Nyström method
The Sinkhorn distance, a variant of the Wasserstein distance with entrop...
read it

Nearlinear time approximation algorithms for optimal transport via Sinkhorn iteration
Computing optimal transport distances such as the earth mover's distance...
read it

Online learning in repeated auctions
Motivated by online advertising auctions, we consider repeated Vickrey a...
read it

Minimax Rates and Efficient Algorithms for Noisy Sorting
There has been a recent surge of interest in studying permutationbased ...
read it

Estimation under group actions: recovering orbits from invariants
Motivated by geometric problems in signal processing, computer vision, a...
read it

An explicit analysis of the entropic penalty in linear programming
Solving linear programs by using entropic penalization has recently attr...
read it

Statistical Optimal Transport via Geodesic Hubs
We propose a new method to estimate Wasserstein distances and optimal tr...
read it

Entropic optimal transport is maximumlikelihood deconvolution
We give a statistical interpretation of entropic optimal transport by sh...
read it

Uncoupled isotonic regression via minimum Wasserstein deconvolution
Isotonic regression is a standard problem in shapeconstrained estimatio...
read it

Approximating the Quadratic Transportation Metric in NearLinear Time
Computing the quadratic transportation metric (also called the 2Wassers...
read it

Estimation of smooth densities in Wasserstein distance
The Wasserstein distances are a set of metrics on probability distributi...
read it

Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
We prove several fundamental statistical bounds for entropic OT with the...
read it

Convergence of Smoothed Empirical Measures with Applications to Entropy Estimation
This paper studies convergence of empirical measures smoothed by a Gauss...
read it
Jonathan Weed
is this you? claim profile