Pith. sign in

REVIEW 2 cited by

Minimax estimation of smooth optimal transport maps

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.05828 v3 pith:W27BB7TZ submitted 2019-05-14 math.ST stat.TH

classification math.STstat.TH
keywords transportminimaxoptimalestimationachievedataestimatorgoal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Brenier's theorem is a cornerstone of optimal transport that guarantees the existence of an optimal transport map $T$ between two probability distributions $P$ and $Q$ over $\mathbb{R}^d$ under certain regularity conditions. The main goal of this work is to establish the minimax estimation rates for such a transport map from data sampled from $P$ and $Q$ under additional smoothness assumptions on $T$. To achieve this goal, we develop an estimator based on the minimization of an empirical version of the semi-dual optimal transport problem, restricted to truncated wavelet expansions. This estimator is shown to achieve near minimax optimality using new stability arguments for the semi-dual and a complementary minimax lower bound. Furthermore, we provide numerical experiments on synthetic data supporting our theoretical findings and highlighting the practical benefits of smoothness regularization. These are the first minimax estimation rates for transport maps in general dimension.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal transport mapping via input convex neural networks

    cs.LG 2019-08 conditional novelty 6.0 of 10

    A principled minimax training procedure over input convex neural networks learns the optimal quadratic-cost transport map as the gradient of a convex potential.

  2. Compositional Synthetic Controls

    econ.EM 2026-07 conditional novelty 5.0 of 10

    For outcomes that are shares summing to one, the paper estimates counterfactuals as weighted geometric means of donor compositions in log-odds space, with weights fit before treatment.

Pith tools