Pith. sign in

REVIEW 3 cited by

Parameter tuning and model selection in optimal transport with semi-dual Brenier formulation

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 2112.07275 v2 pith:4YKDFD53 submitted 2021-12-14 math.ST stat.TH

Parameter tuning and model selection in optimal transport with semi-dual Brenier formulation

classification math.ST stat.TH
keywords convexcriterionformulationgroundmodelsparametertruthbeen
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Over the past few years, numerous computational models have been developed to solve Optimal Transport (OT) in a stochastic setting, where distributions are represented by samples and where the goal is to find the closest map to the ground truth OT map, unknown in practical settings. So far, no quantitative criterion has yet been put forward to tune the parameters of these models and select maps that best approximate the ground truth. To perform this task, we propose to leverage the Brenier formulation of OT.Theoretically, we show that this formulation guarantees that, up to sharp a distortion parameter depending on the smoothness/strong convexity and a statistical deviation term, the selected map achieves the lowest quadratic error to the ground truth. This criterion, estimated via convex optimization, enables parameter tuning and model selection among entropic regularization of OT, input convex neural networks and smooth and strongly convex nearest-Brenier (SSNB) models.We also use this criterion to question the use of OT in Domain-Adaptation (DA). In a standard DA experiment, it enables us to identify the potential that is closest to the true OT map between the source and the target. Yet, we observe that this selected potential is far from being the one that performs best for the downstream transfer classification task.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Stability of the Monge Map in Semi-Dual Optimal Transport

    math.OC 2026-05 unverdicted novelty 6.0

    Semi-dual optimal transport has a degenerate saddle-point structure equivalent to constrained optimization, with necessary and sufficient conditions derived for Monge map convergence independent of dual potential optimality.

  2. Stability of the Monge Map in Semi-Dual Optimal Transport

    math.OC 2026-05 unverdicted novelty 5.0

    Semi-dual optimal transport has a degenerate saddle-point structure whose solution is a constrained optimization problem, giving necessary and sufficient conditions for Monge map convergence independent of dual optimality.

  3. Stability of the Monge Map in Semi-Dual Optimal Transport

    math.OC 2026-05 unverdicted novelty 5.0

    Semi-dual OT formulation has degenerate saddle-point structure; necessary and sufficient conditions for Monge map convergence are derived without requiring dual potential optimality.