Meta-Learning Online Control for Linear Dynamical Systems

08/18/2022
by   Deepan Muthirayan, et al.
0

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 N (similar) control tasks. Each task involves controlling a linear dynamical system for a finite horizon of T 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 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 smaller by a factor D/D^* compared to an independent-learning online control algorithm which does not perform learning across the tasks, where D is a problem constant and D^* is a scalar that decreases with increase in the similarity between tasks. Thus, when the sequence of tasks are similar the regret of the proposed meta-learning online control is significantly lower than that of the naive approaches without meta-learning. We also present experiment results to demonstrate the superior performance achieved by our meta-learning algorithm.

READ FULL TEXT
research
10/21/2020

Meta-Learning Guarantees for Online Receding Horizon Control

In this paper we provide provable regret guarantees for an online meta-l...
research
08/30/2020

A Meta-Learning Control Algorithm with Provable Finite-Time Guarantees

In this work we provide provable regret guarantees for an online meta-le...
research
12/15/2020

Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication

Online meta-learning is emerging as an enabling technique for achieving ...
research
12/30/2022

POMRL: No-Regret Learning-to-Plan with Increasing Horizons

We study the problem of planning under model uncertainty in an online me...
research
02/04/2021

Meta-strategy for Learning Tuning Parameters with Guarantees

Online gradient methods, like the online gradient algorithm (OGA), often...
research
08/21/2021

Fairness-Aware Online Meta-learning

In contrast to offline working fashions, two research paradigms are devi...
research
08/13/2020

Meta Learning MPC using Finite-Dimensional Gaussian Process Approximations

Data availability has dramatically increased in recent years, driving mo...

Please sign up or login with your details

Forgot password? Click here to reset