arXiv · 2604.16730
Multitask LQG Control: Performance and Generalization Bounds
Abstract
We study multitask learning for stochastic and partially observed control systems, focusing on the linear quadratic Gaussian (LQG) problem. Our goal is to learn a common stabilizing controller that generalizes across a distribution of systems and objectives. To this end, we leverage a history-dependent lifting that recasts the multitask LQG problem into an equivalent high-dimensional multitask LQR problem, allowing for the analysis of policy gradient methods. We show that learning a common lifted controller induces a heterogeneity bias which we characterize via a "bisimulation function". We establish performance and generalization guarantees that explicitly depend on such bisimulation-based heterogeneity measures. For model-free, we demonstrate that multitask learning reduces policy gradient estimation variance proportionally to the number of tasks in the training set.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Leonardo F. Toso, Kasra Fallah, Charis Stamouli, George J. Pappas, James Anderson. 2026-04-17. Multitask LQG Control: Performance and Generalization Bounds. https://arxiv.org/abs/2604.16730
Cite the original work for its findings. Save a collection to share your selection of sources.