TheoremBase

Mean-Square Tracking of the Mean-Field Trajectory under an Open-Loop Control

Statement

Let (β0,β1)(\beta_0,\beta_1) be an affine-controlled transition-rate family on ll states with control set A⊆Rm\mathcal{A}\subseteq\mathbb{R}^m, let β\beta be its transition-rate family, with rate bound BB, aggregate state drift bb and state-Lipschitz constant Λb\Lambda_b, and let Δl\Delta^l be the probability simplex, with ∣⋅∣|\cdot| the Euclidean norm on Rl\mathbb{R}^l. Let β~\tilde{\beta} be an observation-rate family on ll states with l~\tilde{l} channels, let T>0T>0 be a real number, let NN be a natural number, and let (Ω,F,P)(\Omega,\mathcal{F},P) be an NN-agent driving system.

Let A:[0,T]→AA:[0,T]\to\mathcal{A} be a map whose components are measurable with respect to the trace Borel σ\sigma-algebra on [0,T][0,T], let hAh^A be the open-loop policy determined by AA, and let (σi,Υυ,α)(\sigma^i,\Upsilon^\upsilon,\alpha) be a solution of the controlled NN-agent dynamics on [0,T][0,T] for β\beta, β~\tilde{\beta}, this driving system and the policy hAh^A, with empirical state measure Σ\Sigma. Let S0∈ΔlS_0\in\Delta^l and let (S,A)(S,A) be the generalized mean-field trajectory pair with value S0S_0 at t=0t=0 provided by the existence and uniqueness theorem.

Let DD be the set of dyadic partition points of [0,T][0,T] and let Ω∗\Omega_* be any event with the properties listed in the martingale bound for the empirical state measure, with 1Ω∗\mathbf{1}_{\Omega_*} the function equal to 11 on Ω∗\Omega_* and 00 elsewhere. Then

Ψ=sup⁡t∈D(∣Σt−St∣ 1Ω∗)\Psi=\sup_{t\in D}\big(|\Sigma_t-S_t|\,\mathbf{1}_{\Omega_*}\big)

is a random variable with 0≤Ψ≤20\le\Psi\le2, it satisfies Ψ(ω)=sup⁡t∈[0,T]∣Σt(ω)−St∣\Psi(\omega)=\sup_{t\in[0,T]}|\Sigma_t(\omega)-S_t| for every ω∈Ω∗\omega\in\Omega_*, and

E[Ψ2]≤2 e2ΛbT(E[∣Σ0−S0∣2]+8 l (l−1) B TN).\mathbb{E}\big[\Psi^2\big]\le2\,e^{2\Lambda_bT}\Big(\mathbb{E}\big[|\Sigma_0-S_0|^2\big]+\frac{8\,l\,(l-1)\,B\,T}{N}\Big) .

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…