Sharp Critical Minimax Laws and No-Learning Thresholds in Continuous-Time Adaptive Control
Not on the map. Why?
Abstract (arXiv)
We study episodic continuous-time control with an unknown vector control gain, scalar state, quadratic action cost, and smooth convex terminal cost. In the scalar Gaussian experiment, let Delta(H) denote the minimax improvement over zero control and set δ=√2H2-1. We prove the critical law Delta(H)asymp δ4√log(1/δ) qquad (δdownarrow0), with a matching lower and upper bound. The lower bound follows from a uniform deficit--energy inequality valid for fully adaptive controls with unbounded amplitudes, while a moving soft-threshold feedback attains the rate. For local parameters θ=N-1/4h, |h|≤ H, we show that the normalized minimax regret over N episodes is within O(N-1/2) of a fixed-horizon Gaussian sequential control problem, without an additional dimension factor. The terminal task enters the limit only through cg=operatornameVar(g(Z)). The Gaussian problem exhibits an exact no-learning phase transition: CdT(H)=TH2/2 iff H4T≤ d2/2, yielding the asymptotic task boundary cgH4=d2/2.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 18 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
2 of 18 references.
References · 2
Built on by
Not cited yet.