Statistical learning theory for control: A finite-sample perspective

A Tsiamis, I Ziemann, N Matni… - IEEE Control Systems …, 2023 - ieeexplore.ieee.org
Learning algorithms have become an integral component to modern engineering solutions.
Examples range from self-driving cars and recommender systems to finance and even …

Efficient model-based reinforcement learning through optimistic policy search and planning

S Curi, F Berkenkamp, A Krause - Advances in Neural …, 2020 - proceedings.neurips.cc
Abstract Model-based reinforcement learning algorithms with probabilistic dynamical
models are amongst the most data-efficient learning methods. This is often attributed to their …

Reinforcement learning with fast stabilization in linear dynamical systems

S Lale, K Azizzadenesheli, B Hassibi… - International …, 2022 - proceedings.mlr.press
In this work, we study model-based reinforcement learning (RL) in unknown stabilizable
linear dynamical systems. When learning a dynamical system, one needs to stabilize the …

Minimal expected regret in linear quadratic control

Y Jedra, A Proutiere - International Conference on Artificial …, 2022 - proceedings.mlr.press
We consider the problem of online learning in Linear Quadratic Control systems whose state
transition and state-action transition matrices $ A $ and $ B $ may be initially unknown. We …

Learning to control linear systems can be hard

A Tsiamis, IM Ziemann, M Morari… - … on Learning Theory, 2022 - proceedings.mlr.press
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 …

Regret lower bounds for learning linear quadratic gaussian systems

I Ziemann, H Sandberg - IEEE Transactions on Automatic …, 2024 - ieeexplore.ieee.org
In this article, we establish regret lower bounds for adaptively controlling an unknown linear
Gaussian system with quadratic costs. We combine ideas from experiment design …

Thompson Sampling Achieves Regret in Linear Quadratic Control

T Kargin, S Lale, K Azizzadenesheli… - … on Learning Theory, 2022 - proceedings.mlr.press
Thompson Sampling (TS) is an efficient method for decision-making under uncertainty,
where an action is sampled from a carefully prescribed distribution which is updated based …

Identification and adaptive control of markov jump systems: Sample complexity and regret bounds

Y Sattar, Z Du, DA Tarzanagh, L Balzano… - arxiv preprint arxiv …, 2021 - arxiv.org
Learning how to effectively control unknown dynamical systems is crucial for intelligent
autonomous systems. This task becomes a significant challenge when the underlying …

NeoRL: Efficient Exploration for Nonepisodic RL

L Treven, F Dorfler, S Coros… - Advances in Neural …, 2025 - proceedings.neurips.cc
We study the problem of nonepisodic reinforcement learning (RL) for nonlinear dynamical
systems, where the system dynamics are unknown and the RL agent has to learn from a …

Task-optimal exploration in linear dynamical systems

AJ Wagenmaker, M Simchowitz… - … on Machine Learning, 2021 - proceedings.mlr.press
Exploration in unknown environments is a fundamental problem in reinforcement learning
and control. In this work, we study task-guided exploration and determine what precisely an …