Data-Driven Adversarial Online Control for Unknown Linear Systems

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Liu, Zishun, Chen, Yongxin
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910360058986496
author Liu, Zishun
Chen, Yongxin
author_facet Liu, Zishun
Chen, Yongxin
contents We consider the online control problem with an unknown linear dynamical system in the presence of adversarial perturbations and adversarial convex loss functions. Although the problem is widely studied in model-based control, it remains unclear whether data-driven approaches, which bypass the system identification step, can solve the problem. In this work, we present a novel data-driven online adaptive control algorithm to address this online control problem. Our algorithm leverages the behavioral systems theory to learn a non-parametric system representation and then adopts a perturbation-based controller updated by online gradient descent. We prove that our algorithm guarantees an $\tmO(T^{2/3})$ regret bound with high probability, which matches the best-known regret bound for this problem. Furthermore, we extend our algorithm and performance guarantee to the cases with output feedback.
format Preprint
id arxiv_https___arxiv_org_abs_2308_08138
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Data-Driven Adversarial Online Control for Unknown Linear Systems
Liu, Zishun
Chen, Yongxin
Systems and Control
Machine Learning
Optimization and Control
We consider the online control problem with an unknown linear dynamical system in the presence of adversarial perturbations and adversarial convex loss functions. Although the problem is widely studied in model-based control, it remains unclear whether data-driven approaches, which bypass the system identification step, can solve the problem. In this work, we present a novel data-driven online adaptive control algorithm to address this online control problem. Our algorithm leverages the behavioral systems theory to learn a non-parametric system representation and then adopts a perturbation-based controller updated by online gradient descent. We prove that our algorithm guarantees an $\tmO(T^{2/3})$ regret bound with high probability, which matches the best-known regret bound for this problem. Furthermore, we extend our algorithm and performance guarantee to the cases with output feedback.
title Data-Driven Adversarial Online Control for Unknown Linear Systems
topic Systems and Control
Machine Learning
Optimization and Control
url https://arxiv.org/abs/2308.08138