SOURCE-LINKED INTELLIGENCE

Algorithmic Optimality Guarantees for Nonsmooth $H_\infty$ Output-Feedback Policy Search

arXiv · AI, language, vision and robotics · article · Sep 5, 2026 · UTC

We study continuous-time full-order dynamic output-feedback $H_\infty$ policy search, a nonconvex and nonsmooth problem. Direct policy search is a central paradigm in reinforcement learning and continuous control, but rigorous guarantees remain scarce in robust output-feedback settings. The $H_\infty$ problem is a canonical benchmark because it captures disturbance attenuation and robustness while exposing the hard nonsmooth geometry of policy-space optimization. We prove that on the exact identity-gauge slice of the extended convex lift, $\varepsilon$-stationarity yields $O(\varepsilon)$-subo

Read original source ↗ Open in workspace

recordType

paper

region

Global