Searcharxiv⌕ Search

arXiv · 2609.31487

Singular Backward SDEs for Optimal Control with State Constraints

Abstract

We investigate a class of backward stochastic differential equations (BSDEs) with at most quadratic growth which explode at a possibly unbounded random horizon, defined through the first hitting of zero of an adapted Ito process. In contrast with the classical theory of singular BSDEs, the explosion is generated by the nonlinear dependence of the generator on the martingale integrand, rather than by a superlinear coercivity condition in the solution component. We construct a minimal singular solution and derive two-sided estimates on its explosion, together with weighted BMO estimates for the martingale integrand. We also obtain the uniqueness and exact explosion rates under additional structural assumptions. For Hamiltonian generators, we establish a verification theorem for an infinite-horizon stochastic optimal control problem with possible non-Markovian state constraints, showing that the BSDE feedback induces the unique optimal constrained law. We finally specialize the theory to exit times of uniformly elliptic Markov diffusions and recover the connection with large solutions of viscous Hamilton-Jacobi equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mathieu Lise, Nizar Touzi. 2026-09-29. Singular Backward SDEs for Optimal Control with State Constraints. https://arxiv.org/abs/2609.31487

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The discrete periodic Pitman transform: invariances, braid relations, and Burke properties

We develop the theory of the discrete periodic Pitman transform, first introduced by Corwin, Gu, and the fifth author. We prove that the discrete periodic Pitman transform satisfies the same braid relations that are satisfied for the full-line Pitman transform shown by Biane, Bougerol, and O'Connell. This defines a group action of the infinite symmetric group on sequences of vectors in $\mathbb R^{\mathbb Z_N}$. We prove that, for polymers in a periodic environment, single-path and multi-path partition functions are preserved under the action of this transform on the weights in the polymer model. Combined with a new inhomogeneous Burke property for the periodic Pitman transform, we prove a multi-path invariance result for the periodic inverse-gamma polymer under permutations of the column parameters. In the limit to the full-line case, we obtain a multi-path extension of a recent invariance result of Bates, Emrah, Martin, Seppäläinen, and the fifth author, in both positive and zero-temperature.

math.PR↗

The Berry-Esseen Constant Conjecture is Eventually True

We prove that the Esseen's constant $0.4097...$ is valid in the iid Berry--Esseen inequality as long as the sample sizes $n\ge N$. The threshold $N$ is universal over all real summand distributions with positive variance and a finite third absolute moment. In particular, one may take $N=2\left\lceil\exp(10^{17})\right\rceil. $

math.PR↗

Local decisions, diffusive influence, and lower bounds for graphical balanced allocation

In graphical two-choice allocation, each arriving ball is assigned to one endpoint of a random edge. We study rules whose decision is a monotone function of the two endpoint loads, allowing edge-dependent thresholds and fresh randomization. Such a rule has an exact unit-discrepancy coupling: adding one ball to the initial state produces one tagged discrepancy at every later time. We represent the tag by conditional-expectation projections on the marked edge space and obtain diffusive displacement bounds. A transport-volume inequality then converts slow propagation of influence into lower bounds for the load gap. On the cycle with $n$ vertices, from every initial distribution and at every physical time $t\ge 1/n$, the expected gap is at least a constant times $\min\{\sqrt n,t^{1/4}\}$, and the gap exceeds this scale with probability at least $1/8$. After exactly $k\ge1$ allocations, the corresponding scale is $\min\{\sqrt n,(k/n)^{1/4}\}$. No stationarity, symmetry, recurrence, or moment assumption is used. The general inequality also yields a lower bound of order $\sqrt{L/K+\log K}$ on the $L\times K$ discrete torus $C_L\square C_K$. These results separate endpoint-local rules from global-information strategies that achieve polylogarithmic gaps on cycles.

math.PR↗