Metraipolis › archive › dc_40314b79c3af
RobustLDS: Learning linear dynamical systems under adversarial corruptions — arXiv:2610.11906
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11906
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:24:15.823Z
- SHA-256 of the archived text
db86974a7b2de7dace16395d950b60ce887bc782c88d010b8ce683f442482a44- Stable URL of this page
https://metraipolis.com/documento/dc_40314b79c3af
How to cite
RobustLDS: Learning linear dynamical systems under adversarial corruptions — arXiv:2610.11906 — arXiv (en), https://arxiv.org/abs/2610.11906 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_40314b79c3af (Metraipolis archive dc_40314b79c3af, sha256 db86974a7b2de7dace16395d950b60ce887bc782c88d010b8ce683f442482a44)
BibTeX
@misc{dc40314b79c3af,
title = {RobustLDS: Learning linear dynamical systems under adversarial corruptions — arXiv:2610.11906},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11906},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_40314b79c3af; sha256 db86974a7b2de7dace16395d950b60ce887bc782c88d010b8ce683f442482a44},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11906. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 the estimator with group-sparse penalty, we derive non-asymptotic error bounds which establish its robustness to outliers. We also show empirically that the proposed estimators work well in practice. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Systems and Control (eess.SY); Optimization and Control (math.OC); Statistics Theory (math.ST). Pagina del lavoro: https://arxiv.org/abs/2610.11906 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:50:32.188Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).