Statistical learning theory for control: A finite-sample perspective
Learning algorithms have become an integral component to modern engineering solutions.
Examples range from self-driving cars and recommender systems to finance and even …
Examples range from self-driving cars and recommender systems to finance and even …
A tutorial on the non-asymptotic theory of system identification
This tutorial serves as an introduction to recently developed non-asymptotic methods in the
theory of-mainly linear-system identification. We emphasize tools we deem particularly …
theory of-mainly linear-system identification. We emphasize tools we deem particularly …
Logarithmic regret bound in partially observable linear dynamical systems
We study the problem of system identification and adaptive control in partially observable
linear dynamical systems. Adaptive and closed-loop system identification is a challenging …
linear dynamical systems. Adaptive and closed-loop system identification is a challenging …
Linear systems can be hard to learn
In this paper, we investigate when system identification is statistically easy or hard, in the
finite sample regime. Statistically easy to learn linear system classes have sample …
finite sample regime. Statistically easy to learn linear system classes have sample …
Sample complexity of kalman filtering for unknown systems
In this paper, we consider the task of designing a Kalman Filter (KF) for an unknown and
partially observed autonomous linear time invariant system driven by process and sensor …
partially observed autonomous linear time invariant system driven by process and sensor …
Learning to control linear systems can be hard
In this paper, we study the statistical difficulty of learning to control linear systems. We focus
on two standard benchmarks, the sample complexity of stabilization, and the regret of the …
on two standard benchmarks, the sample complexity of stabilization, and the regret of the …
A new approach to learning linear dynamical systems
Linear dynamical systems are the foundational statistical model upon which control theory is
built. Both the celebrated Kalman filter and the linear quadratic regulator require knowledge …
built. Both the celebrated Kalman filter and the linear quadratic regulator require knowledge …
Online learning of the kalman filter with logarithmic regret
In this article, we consider the problem of predicting observations generated online by an
unknown, partially observable linear system, which is driven by Gaussian noise. In the linear …
unknown, partially observable linear system, which is driven by Gaussian noise. In the linear …
Identification and adaptive control of markov jump systems: Sample complexity and regret bounds
Learning how to effectively control unknown dynamical systems is crucial for intelligent
autonomous systems. This task becomes a significant challenge when the underlying …
autonomous systems. This task becomes a significant challenge when the underlying …
Topology learning of linear dynamical systems with latent nodes using matrix decomposition
In this article, we present a novel approach to reconstruct the topology of networked linear
dynamical systems with latent nodes. The network is allowed to have directed loops and bi …
dynamical systems with latent nodes. The network is allowed to have directed loops and bi …