Show simple item record

dc.contributor.authorLale, Sahin
dc.contributor.authorAzizzadenesheli, Kamyar
dc.contributor.authorHassibi, Babak
dc.contributor.authorAnandkumar, Anima
dc.date.accessioned2020-04-01T13:28:01Z
dc.date.available2020-04-01T13:28:01Z
dc.date.issued2020-03-25
dc.identifier.urihttp://hdl.handle.net/10754/662418
dc.description.abstractWe study the problem of adaptive control in partially observable linear dynamical systems. We propose a novel algorithm, adaptive control online learning algorithm (AdaptOn), which efficiently explores the environment, estimates the system dynamics episodically and exploits these estimates to design effective controllers to minimize the cumulative costs. Through interaction with the environment, AdaptOn deploys online convex optimization to optimize the controller while simultaneously learning the system dynamics to improve the accuracy of controller updates. We show that when the cost functions are strongly convex, after $T$ times step of agent-environment interaction, AdaptOn achieves regret upper bound of $\text{polylog}\left(T\right)$. To the best of our knowledge, AdaptOn is the first algorithm which achieves $\text{polylog}\left(T\right)$ regret in adaptive control of unknown partially observable linear dynamical systems which includes linear quadratic Gaussian (LQG) control.
dc.description.sponsorshipS. Lale is supported in part by DARPA PAI. K. Azizzadenesheli gratefully acknowledge the financial support of Raytheon and Amazon Web Services. B. Hassibi is supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA’s Jet Propulsion Laboratory through the President and Director’s Fund, and by King Abdullah University of Science and Technology. A. Anandkumar is supported in part by Bren endowed chair, DARPA PAIHR00111890035 and LwLL grants, Raytheon, Microsoft, Google, and Adobe faculty fellowships.
dc.publisherarXiv
dc.relation.urlhttps://arxiv.org/pdf/2003.11227
dc.rightsArchived with thanks to arXiv
dc.titleLogarithmic Regret Bound in Partially Observable Linear Dynamical Systems
dc.typePreprint
dc.eprint.versionPre-print
dc.contributor.institutionCalifornia Institute of Technology, Pasadena
dc.identifier.arxivid2003.11227
refterms.dateFOA2020-04-01T13:28:21Z


Files in this item

Thumbnail
Name:
Preprintfile1.pdf
Size:
448.9Kb
Format:
PDF
Description:
Pre-print

This item appears in the following Collection(s)

Show simple item record