Pith. sign in

REVIEW 4 cited by

Sharp convergence rates for mean field control in the region of strong regularity

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 2312.11373 v1 pith:VBMUS66Z submitted 2023-12-18 math.OC math.APmath.PR

classification math.OCmath.APmath.PR
keywords mathcalconvergenceoptimalratecontrolmathbbfieldknown
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study the convergence problem for mean field control, also known as optimal control of McKean-Vlasov dynamics. We assume that the data is smooth but not convex, and thus the limiting value function $\mathcal{U} :[0,T] \times \mathcal{P}_2(\mathbb{R}^d) \to \mathbb{R}$ is Lipschitz, but may not be differentiable. In this setting, the first and last named authors recently identified an open and dense subset $\mathcal{O}$ of $[0,T] \times \mathcal{P}_2(\mathbb{R}^d)$ on which $\mathcal{U}$ is $\mathcal{C}^1$ and solves the relevant infinite-dimensional Hamilton-Jacobi equation in a classical sense. In the present paper, we use these regularity results, and some non-trivial extensions of them, to derive sharp rates of convergence. In particular, we show that the value functions for the $N$-particle control problems converge towards $\mathcal{U}$ with a rate of $1/N$, uniformly on subsets of $\mathcal{O}$ which are compact in the $p$-Wasserstein space for some $p > 2$. A similar result is also established at the level of the optimal feedback controls. The rate $1/N$ is the optimal rate in this setting even if $\mathcal{U}$ is smooth, while, in general, the optimal global rate of convergence is known to be slower than $1/N$. Thus our results show that the rate of convergence is faster inside of $\mathcal{O}$ than it is outside. As a consequence of the convergence of the optimal feedbacks, we obtain a concentration inequality for optimal trajectories of the $N$-particle problem started from i.i.d. initial conditions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Optimal rate of convergence in the vanishing viscosity for uniformly convex Hamilton-Jacobi equations

    math.AP 2025-06 conditional novelty 8.0 of 10

    Vanishing viscosity for uniformly convex Hamilton-Jacobi equations converges at the optimal rate O(epsilon log epsilon), improving the old O(sqrt(epsilon)) bound.

  2. Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

    math.OC 2025-07 conditional novelty 7.0 of 10

    For a continuum-depth ResNet model with entropic regularization, an open dense set of initial feature-label distributions admits a unique stable minimizer and a local Polyak-Lojasiewicz inequality near it.

  3. Optimal rate of convergence in the vanishing viscosity for quadratic Hamilton-Jacobi equations

    math.AP 2025-02 conditional novelty 7.0 of 10

    The vanishing-viscosity error for quadratic Hamilton-Jacobi equations is of order ε log ε (not √ε), sharp in every dimension, with leading constant d/2.

  4. Quantitative Particle Approximation for Controlled Nonlinear Filtering

    math.OC 2026-08 conditional novelty 6.0 of 10

    Under smooth data and Hamiltonian regularity, the value-function error between controlled nonlinear filtering and its N-particle approximation is O(N^{-1/6}) in d=1, O(N^{-1/6}(log N)^{1/3}) in d=2, and O(N^{-1/(3d)})...

Pith tools