Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kanakeri, Vinay, Mitra, Aritra
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908337720786944
author Kanakeri, Vinay
Mitra, Aritra
author_facet Kanakeri, Vinay
Mitra, Aritra
contents We consider the problem of system identification of partially observed linear time-invariant (LTI) systems. Given input-output data, we provide non-asymptotic guarantees for identifying the system parameters under general heavy-tailed noise processes. Unlike previous works that assume Gaussian or sub-Gaussian noise, we consider significantly broader noise distributions that are required to admit only up to the second moment. For this setting, we leverage tools from robust statistics to propose a novel system identification algorithm that exploits the idea of boosting. Despite the much weaker noise assumptions, we show that our proposed algorithm achieves sample complexity bounds that nearly match those derived under sub-Gaussian noise. In particular, we establish that our bounds retain a logarithmic dependence on the prescribed failure probability. Interestingly, we show that such bounds can be achieved by requiring just a finite fourth moment on the excitatory input process.
format Preprint
id arxiv_https___arxiv_org_abs_2504_18444
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise
Kanakeri, Vinay
Mitra, Aritra
Systems and Control
Machine Learning
Optimization and Control
We consider the problem of system identification of partially observed linear time-invariant (LTI) systems. Given input-output data, we provide non-asymptotic guarantees for identifying the system parameters under general heavy-tailed noise processes. Unlike previous works that assume Gaussian or sub-Gaussian noise, we consider significantly broader noise distributions that are required to admit only up to the second moment. For this setting, we leverage tools from robust statistics to propose a novel system identification algorithm that exploits the idea of boosting. Despite the much weaker noise assumptions, we show that our proposed algorithm achieves sample complexity bounds that nearly match those derived under sub-Gaussian noise. In particular, we establish that our bounds retain a logarithmic dependence on the prescribed failure probability. Interestingly, we show that such bounds can be achieved by requiring just a finite fourth moment on the excitatory input process.
title Boosting-Enabled Robust System Identification of Partially Observed LTI Systems Under Heavy-Tailed Noise
topic Systems and Control
Machine Learning
Optimization and Control
url https://arxiv.org/abs/2504.18444