Episodic Linear Quadratic Regulators with Low-rank Transitions

11/03/2020 ∙ by Tianyu Wang, et al. ∙ 0

Linear Quadratic Regulators (LQR) achieve enormous successful real-world applications. Very recently, people have been focusing on efficient learning algorithms for LQRs when their dynamics are unknown. Existing results effectively learn to control the unknown system using number of episodes depending polynomially on the system parameters, including the ambient dimension of the states. These traditional approaches, however, become inefficient in common scenarios, e.g., when the states are high-resolution images. In this paper, we propose an algorithm that utilizes the intrinsic system low-rank structure for efficient learning. For problems of rank-m, our algorithm achieves a K-episode regret bound of order O(m^3/2 K^1/2). Consequently, the sample complexity of our algorithm only depends on the rank, m, rather than the ambient dimension, d, which can be orders-of-magnitude larger.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.