Failure of ambient closed-set large-deviation upper bounds in entropic optimal transport
Pith reviewed 2026-05-09 22:56 UTC · model grok-4.3
The pith
Large-deviation upper bounds valid on compact sets fail on closed sets in entropic optimal transport.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We construct a fixed-cost model with continuous cost and nonatomic marginals for which the entropic minimisers converge in total variation to an optimal plan with noncompact support. The known compact-set large-deviation upper bound remains valid, but the corresponding closed-set upper bound fails on a specific closed subset of the ambient space. For a fixed closed set we identify the exact tail criterion for passing from compact to closed sets. There does not exist a full large-deviation principle on the ambient space at speed 1/ε with an arbitrary lower semicontinuous rate function.
What carries the argument
A fixed-cost model with continuous cost and nonatomic marginals that forces entropic minimizers to converge in total variation to a noncompactly supported optimal plan; this model serves as a counterexample showing that compact-set upper bounds do not extend automatically to closed sets.
If this is right
- For any fixed closed set the closed-set upper bound holds precisely when a specific tail criterion is satisfied.
- No full large-deviation principle exists on the ambient space at speed 1/ε with an arbitrary lower semicontinuous rate function.
- Entropic minimizers can converge to noncompactly supported plans even under continuous costs and nonatomic marginals.
- The obstruction to extending large-deviation bounds from compact to closed sets already appears in static entropic optimal transport.
Where Pith is reading between the lines
- Users of large-deviation bounds in transport problems must verify explicit tail conditions before invoking closed-set versions.
- The same construction may be adapted to detect analogous failures in dynamic or multi-marginal entropic settings.
- Rate functions arising in these problems may need built-in tail decay to guarantee closed-set validity.
Load-bearing premise
The existence of a fixed-cost model with continuous cost and nonatomic marginals such that entropic minimizers converge in total variation to a noncompactly supported optimal plan.
What would settle it
A calculation in the constructed model that shows the closed-set upper bound holds on the chosen closed subset, or that the limit plan actually has compact support.
read the original abstract
Large-deviation upper bounds on compact sets do not, in general, extend to arbitrary closed sets without additional tightness. We show that this obstruction already occurs in static entropic optimal transport. More precisely, we construct a fixed-cost model with continuous cost and nonatomic marginals for which the entropic minimisers converge in total variation to an optimal plan with noncompact support, the known compact-set upper bound remains valid, but the corresponding closed-set upper bound fails on a specific closed subset of the ambient space. For a fixed closed set, we identify the exact tail criterion for passing from compact to closed sets. We show that there does not exist a full large-deviation principle (LDP) on the ambient space at speed $1/\varepsilon$ with an arbitrary lower semicontinuous rate function.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper shows that large-deviation upper bounds on compact sets for the entropic optimal transport problem do not extend in general to arbitrary closed sets in the ambient space without additional tightness. It constructs an explicit fixed-cost model with continuous cost and nonatomic marginals in which the entropic minimizers converge in total variation to an optimal plan whose support is noncompact; the known compact-set upper bound continues to hold, but the closed-set upper bound fails on a chosen closed subset. For any fixed closed set the authors identify the precise tail criterion separating the compact and closed cases, and they prove that no large-deviation principle holds on the whole ambient space at speed 1/ε with a lower-semicontinuous rate function.
Significance. The result supplies a concrete, parameter-free counterexample that isolates the exact obstruction (noncompact support of the limiting plan) preventing closed-set upper bounds in entropic OT. By exhibiting both the failure on a specific closed set and the tail criterion that restores the bound, the paper clarifies the boundary between compact and closed large-deviation statements in this setting. The explicit construction and the negative result on the existence of a full LDP are the main contributions.
major comments (2)
- [Construction and proof of the counterexample] The central construction (fixed-cost model, continuous cost, nonatomic marginals, TV convergence to noncompact-support plan) is load-bearing for every claim. The manuscript must supply a fully detailed verification that the chosen marginals are indeed nonatomic, that the cost is continuous, and that the tail behavior produces the stated violation of the closed-set upper bound on the chosen closed subset.
- [Non-existence of full LDP] The argument that no lsc rate function can yield a full LDP on the ambient space relies on the same noncompact-support limit plan. A self-contained proof that any candidate rate function would have to be infinite on the chosen closed set while remaining finite on compact sets should be given explicitly.
minor comments (2)
- Notation for the entropic functional, the speed 1/ε, and the topology on the space of measures should be introduced once and used consistently.
- The precise statement of the tail criterion (for a fixed closed set) would benefit from being isolated as a numbered proposition or corollary.
Simulated Author's Rebuttal
We thank the referee for the careful reading of the manuscript and the constructive comments. We address each major comment below and will revise the manuscript to incorporate the requested clarifications.
read point-by-point responses
-
Referee: [Construction and proof of the counterexample] The central construction (fixed-cost model, continuous cost, nonatomic marginals, TV convergence to noncompact-support plan) is load-bearing for every claim. The manuscript must supply a fully detailed verification that the chosen marginals are indeed nonatomic, that the cost is continuous, and that the tail behavior produces the stated violation of the closed-set upper bound on the chosen closed subset.
Authors: We agree that a fully detailed verification of the central construction is essential. In the revised manuscript we will expand the relevant section to include: (i) an explicit check that both marginals are nonatomic, by verifying that every singleton has measure zero; (ii) a direct verification that the cost function is continuous on the product space; and (iii) a step-by-step computation of the relevant tail probabilities that produces the violation of the closed-set upper bound on the chosen closed subset. These additions will render the counterexample self-contained. revision: yes
-
Referee: [Non-existence of full LDP] The argument that no lsc rate function can yield a full LDP on the ambient space relies on the same noncompact-support limit plan. A self-contained proof that any candidate rate function would have to be infinite on the chosen closed set while remaining finite on compact sets should be given explicitly.
Authors: We agree that the non-existence argument can be made more explicit. In the revision we will supply a self-contained proof in a dedicated subsection: assuming an LDP holds at speed 1/ε with a lower-semicontinuous rate function I, the known compact-set upper bounds imply that I is finite on every compact set; lower semicontinuity together with the total-variation convergence to the noncompact-support limit plan then forces I to be infinite on the chosen closed set, yielding the desired contradiction. This argument will be written out in full detail without relying on external references. revision: yes
Circularity Check
No significant circularity identified
full rationale
The manuscript establishes its main result via an explicit counterexample construction: a fixed-cost model with continuous cost and nonatomic marginals in which entropic minimizers converge in total variation to a noncompact-support optimal plan, compact-set upper bounds hold, and a chosen closed set violates the closed-set upper bound. This is a direct, self-contained existence argument that does not reduce any claimed prediction or rate function to a fitted parameter, self-definition, or prior self-citation chain. The tail criterion separating compact from closed sets and the non-existence of a full LDP are derived from the constructed model itself rather than imported via ansatz or uniqueness theorem. No load-bearing step collapses to its own inputs by construction.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Standard properties of large deviation upper bounds on compact sets and lower semicontinuity of rate functions hold in the ambient space.
- domain assumption Convergence in total variation of entropic minimizers to an optimal plan is well-defined for the chosen model.
Reference graph
Works this paper leans on
-
[1]
S. Aryan and P. Ghosal,Entropic selection principle for Monge’s optimal transport, arXiv:2502.16370 [math.PR], 2025, Preprint
-
[2]
E. Bernton, P. Ghosal, and M. Nutz,Entropic optimal transport: geometry and large deviations, Duke Mathematical Journal171(2022), no. 16, 3363–3400
work page 2022
-
[3]
G. Carlier, V. Duval, G. Peyr´ e, and B. Schmitzer,Convergence of entropic schemes for optimal transport and gradient flows, SIAM Journal on Mathematical Analysis49(2017), no. 2, 1385–1418
work page 2017
-
[4]
G. Carlier, P. Pegon, and L. Tamanini,Convergence rate of general entropic optimal transport costs, Calculus of Variations and Partial Differential Equations62(2023), no. 4, Art. 116. 31
work page 2023
-
[5]
R. Cominetti and J. San Mart´ ın,Asymptotic analysis of the exponential penalty trajectory in linear programming, Mathematical Programming67(1994), 169–187
work page 1994
-
[6]
A. Dembo and O. Zeitouni,Large deviations techniques and applications, second ed., Applications of Mathematics, vol. 38, Springer, New York, 1998
work page 1998
-
[7]
S. Di Marino and J. Louet,The entropic regularization of the Monge problem on the real line, SIAM Journal on Mathematical Analysis50(2018), no. 4, 3451–3477
work page 2018
-
[8]
S. Eckstein and M. Nutz,Convergence rates for regularized optimal transport via quanti- zation, Mathematics of Operations Research49(2024), no. 2, 1223–1240
work page 2024
-
[9]
K. Kato,Large deviations for dynamical Schr¨ odinger problems, Journal of Applied Probability (2025), 1–22
work page 2025
-
[10]
C. L´ eonard,From the Schr¨ odinger problem to the Monge–Kantorovich problem, Journal of Functional Analysis262(2012), no. 4, 1879–1920
work page 2012
-
[11]
,A survey of the Schr¨ odinger problem and some of its connections with optimal transport, Discrete and Continuous Dynamical Systems34(2014), no. 4, 1533–1574
work page 2014
-
[12]
Entropic selection for optimal transport on the line with distance cost
A. Ley,Entropic selection for optimal transport on the line with distance cost, arXiv:2512.05282 [math.OC], 2025, Preprint
-
[13]
P. L´ opez-Rivera,A uniform rate of convergence for the entropic potentials in the quadratic Euclidean setting, ESAIM: Control, Optimisation and Calculus of Variations32(2026), Art. 27
work page 2026
-
[14]
H. Malamut and M. Sylvestre,Convergence rates of the regularized optimal transport: Disentangling suboptimality and entropy, SIAM Journal on Mathematical Analysis57 (2025), no. 3, 2533–2558
work page 2025
-
[15]
V. Nilsson and P. Nyquist,Large deviations for scaled families of Schr¨ odinger bridges with reflection, arXiv:2506.03999 [math.PR], 2025, Preprint
- [16]
-
[17]
M. Nutz and J. Wiesel,Entropic optimal transport: convergence of potentials, Probability Theory and Related Fields184(2022), no. 1, 401–424
work page 2022
-
[18]
J. Weed,An explicit analysis of the entropic penalty in linear programming, Proceedings of the 31st Conference On Learning Theory, PMLR, vol. 75, 2018, pp. 1841–1855. 32
work page 2018
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.