Metraipolis › archive › dc_34c4e006cfc7
Finite-Sample LTI System Identification from a Misspecified Finite Model Set — arXiv:2610.40387
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40387
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:30:59.475Z
- SHA-256 of the archived text
d8f067970042b40ff7fbd469597fbbbaa7e82c1609804541b6a7340320063b2e- Stable URL of this page
https://metraipolis.com/documento/dc_34c4e006cfc7
How to cite
Finite-Sample LTI System Identification from a Misspecified Finite Model Set — arXiv:2610.40387 — arXiv (en), https://arxiv.org/abs/2610.40387 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34c4e006cfc7 (Metraipolis archive dc_34c4e006cfc7, sha256 d8f067970042b40ff7fbd469597fbbbaa7e82c1609804541b6a7340320063b2e)
BibTeX
@misc{dc34c4e006cfc7,
title = {Finite-Sample LTI System Identification from a Misspecified Finite Model Set — arXiv:2610.40387},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40387},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34c4e006cfc7; sha256 d8f067970042b40ff7fbd469597fbbbaa7e82c1609804541b6a7340320063b2e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40387. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the problem of finite-sample identification of an unknown LTI system from a finite hypothesis class. In contrast to existing results that assume the hypothesis class contains the true system, we consider the misspecified setting, where the true system does not belong to the hypothesis class. We first characterize the resulting estimation target and its dependence on the data-generation scheme. We then establish a finite-sample lower bound on the failure probability that any identification algorithm must incur. Finally, we analyze the robustness of an existing exponential weighting-based identification algorithm to the misspecification and derive a finite-sample upper bound on its failure probability. Our results illustrate when using a misspecified finite hypothesis class can provide an advantage over identification without prior knowledge of the candidate systems. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2610.40387 — 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-11-01T02:13:28.613Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).