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 …

Transformers as algorithms: Generalization and stability in in-context learning

Y Li, ME Ildiz, D Papailiopoulos… - … conference on machine …, 2023 - proceedings.mlr.press
In-context learning (ICL) is a type of prompting where a transformer model operates on a
sequence of (input, output) examples and performs inference on-the-fly. In this work, we …

A tutorial on the non-asymptotic theory of system identification

I Ziemann, A Tsiamis, B Lee, Y Jedra… - 2023 62nd IEEE …, 2023 - ieeexplore.ieee.org
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 …

From self-attention to markov models: Unveiling the dynamics of generative transformers

ME Ildiz, Y Huang, Y Li, AS Rawat, S Oymak - arxiv preprint arxiv …, 2024 - arxiv.org
Modern language models rely on the transformer architecture and attention mechanism to
perform language understanding and text generation. In this work, we study learning a 1 …

Microcontroller unit chip temperature fingerprint informed machine learning for IIoT intrusion detection

T Wang, K Fang, W Wei, J Tian… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Physics-informed learning for industrial Internet is essential especially to safety issues.
Consequently, various methods have been developed to conduct Industrial Internet of …

Kernel methods and gaussian processes for system identification and control: A road map on regularized kernel-based learning for control

A Carè, R Carli, A Dalla Libera… - IEEE Control …, 2023 - ieeexplore.ieee.org
The commonly adopted route to control a dynamic system and make it follow the desired
behavior consists of two steps. First, a model of the system is learned from input–output data …

Learning linear dynamics from bilinear observations

Y Sattar, Y Jedra, S Dean - arxiv preprint arxiv:2409.16499, 2024 - arxiv.org
We consider the problem of learning a realization of a partially observed dynamical system
with linear state transitions and bilinear observations. Under very mild assumptions on the …

Pac-bayes generalisation bounds for dynamical systems including stable rnns

D Eringis, J Leth, ZH Tan, R Wisniewski… - Proceedings of the …, 2024 - ojs.aaai.org
In this paper, we derive a PAC-Bayes bound on the generalisation gap, in a supervised time-
series setting for a special class of discrete-time non-linear dynamical systems. This class …

[HTML][HTML] Sample complexity of the Sign-Perturbed Sums method

S Szentpéteri, BC Csáji - Automatica, 2024 - Elsevier
We study the sample complexity of the Sign-Perturbed Sums (SPS) method, which
constructs exact, non-asymptotic confidence regions for the true system parameters under …

On the sample complexity of the linear quadratic gaussian regulator

AAR Al Makdah, F Pasqualetti - 2023 62nd IEEE Conference …, 2023 - ieeexplore.ieee.org
In this paper we provide direct data-driven expressions for the Linear Quadratic Regulator
(LQR), the Kalman filter, and the Linear Quadratic Gaussian (LQG) controller using a finite …