Meta-Learning Online Control for Linear Dynamical Systems
Deepan Muthirayan, Dileep Kalathil, and Pramod P. Khargonekar

TL;DR
This paper introduces a meta-learning online control algorithm for linear dynamical systems that leverages task similarity to reduce regret across multiple control tasks, outperforming traditional methods.
Contribution
The paper proposes a novel meta-learning online control algorithm that exploits task similarity to improve performance in controlling linear dynamical systems across multiple tasks.
Findings
Meta-regret is reduced by a factor D/D* with increased task similarity.
The proposed approach outperforms independent-learning algorithms.
Experimental results confirm the superior performance of the meta-learning control algorithm.
Abstract
In this paper, we consider the problem of finding a meta-learning online control algorithm that can learn across the tasks when faced with a sequence of (similar) control tasks. Each task involves controlling a linear dynamical system for a finite horizon of time steps. The cost function and system noise at each time step are adversarial and unknown to the controller before taking the control action. Meta-learning is a broad approach where the goal is to prescribe an online policy for any new unseen task exploiting the information from other tasks and the similarity between the tasks. We propose a meta-learning online control algorithm for the control setting and characterize its performance by \textit{meta-regret}, the average cumulative regret across the tasks. We show that when the number of tasks are sufficiently large, our proposed approach achieves a meta-regret that is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research
