Sign inGet started
Paper · arXiv

RobustLDS: Learning linear dynamical systems under adversarial corruptions

We consider the problem of learning linear dynamical systems under adversarial contamination from a single trajectory of length $T$. While identification of linear dynamical systems itself is well-studied, the problem of robust system identification under adversarial contamination is relatively less explored. In this work, we study the setting where a fraction of the $T$ observations are contaminated by adversarial outliers. We propose different estimators based on relaxations of least-trimmed squares along with an alternating minimization algorithm. Furthermore, we also propose two estimators which exploit the group-sparsity (through penalization/hard-constraints) of the outliers. For th...

AuthorsAravinda Kanchana Ruwanpathirana, Hemant Tyagi
Primary categorystat.ML
Published8 October 2026
Last updated at source8 October 2026
stat.MLcs.LGeess.SYmath.OCmath.ST
Embed this entry
<iframe src="https://silytics.si/embed/item/ae14d761-fc9b-4ae5-858f-4a46350ac89f" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.