arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2404.17331eess.SYcs.SY
收藏

一类子空间辨识方法的有限样本分析

Finite Sample Analysis for a Class of Subspace Identification Methods

Jiabao He, Ingvar Ziemann, Cristian R. Rojas, Håkan Hjalmarsson

AI总结:

本研究针对一类子空间辨识方法(SIMs)提供有限样本分析,通过选择绕过投影步骤的简约SIM并并行估计一组ARX模型,推导出Markov参数和系统矩阵的O(1/√N)收敛率及误差界限。

摘要:

尽管子空间辨识方法(SIMs)因对MIMO系统具有简单的参数化方式和鲁棒的数值实现而备受青睐,但对其进行全面的统计分析仍是一个开放问题,尤其是在非渐近情形下。在本研究中,我们对一类SIMs提供了有限样本分析,揭示了估计Markov参数和系统矩阵的收敛率为O(1/√N),这与经典的渐近结果一致。基于经典SIMs中的模型格式因投影步骤而变得非因果的观察,我们选择了一种简约的SIM,它绕过了投影步骤并严格强制因果模型以促进分析,其中一组ARX模型被并行估计。利用单个ARX模型有限样本分析的最新结果,我们获得了ARX模型阵列的总体误差界限,并通过奇异值分解的鲁棒性结果进一步推导出系统矩阵的误差界限。

英文摘要:

While subspace identification methods (SIMs) are appealing due to their simple parameterization for MIMO systems and robust numerical realizations, a comprehensive statistical analysis of SIMs remains an open problem, especially in the non-asymptotic regime. In this work, we provide a finite sample analysis for a class of SIMs, which reveals that the convergence rates for estimating Markov parameters and system matrices are $\mathcal{O}(1/\sqrt{N})$, in line with classical asymptotic results. Based on the observation that the model format in classical SIMs becomes non-causal because of a projection step, we choose a parsimonious SIM that bypasses the projection step and strictly enforces a causal model to facilitate the analysis, where a bank of ARX models are estimated in parallel. Leveraging recent results from finite sample analysis of an individual ARX model, we obtain an overall error bound of an array of ARX models and proceed to derive error bounds for system matrices via robustness results for the singular value decomposition.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑