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
Signed reviews
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.
Forward citations
Cited by 2 Pith papers
-
Optimal transport mapping via input convex neural networks
A principled minimax training procedure over input convex neural networks learns the optimal quadratic-cost transport map as the gradient of a convex potential.
-
Compositional Synthetic Controls
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.
Discussion (0). Continue with ORCID to comment.