阶数未知的隐状态LTI状态空间模型的有效学习
Efficient learning of hidden state LTI state space models of unknown order
摘要:
本文的目的是解决两个相关的隐藏状态线性时不变(LTI)的状态空间系统的设置时,隐藏状态的维数是未知的估计问题。也就是说,任何有限数量的系统的马尔可夫参数的估计和系统的最小实现的估计,两者都来自单个轨迹的部分观测。对于这两个问题,我们提供了各种形式的估计误差上界,$\rank$恢复条件,和样本复杂性估计的统计保证。具体而言,我们首先表明,低$\rank$解决方案的汉克尔惩罚最小二乘估计满足估计误差$S_p$ -规范的$p \in [1,2]$,捕获的效果比现有的运营商规范上界的简单的最小二乘的系统顺序。然后,我们提供了一个稳定性分析的估计过程的基础上的一个变体的Ho-Kalman算法,提高了对维数和马尔可夫参数的汉克尔矩阵的最小奇异值的依赖。最后,我们提出了一个估计算法的最小实现,使用汉克尔惩罚最小二乘估计和Ho-Kalman估计过程,并保证与高概率,我们恢复正确的顺序的系统,并满足一个新的快速率在$S_2$ -范数多项式减少的依赖的尺寸和其他参数的问题。
英文摘要:
The aim of this paper is to address two related estimation problems arising in the setup of hidden state linear time invariant (LTI) state space systems when the dimension of the hidden state is unknown. Namely, the estimation of any finite number of the system's Markov parameters and the estimation of a minimal realization for the system, both from the partial observation of a single trajectory. For both problems, we provide statistical guarantees in the form of various estimation error upper bounds, $\rank$ recovery conditions, and sample complexity estimates. Specifically, we first show that the low $\rank$ solution of the Hankel penalized least square estimator satisfies an estimation error in $S_p$-norms for $p \in [1,2]$ that captures the effect of the system order better than the existing operator norm upper bound for the simple least square. We then provide a stability analysis for an estimation procedure based on a variant of the Ho-Kalman algorithm that improves both the dependence on the dimension and the least singular value of the Hankel matrix of the Markov parameters. Finally, we propose an estimation algorithm for the minimal realization that uses both the Hankel penalized least square estimator and the Ho-Kalman based estimation procedure and guarantees with high probability that we recover the correct order of the system and satisfies a new fast rate in the $S_2$-norm with a polynomial reduction in the dependence on the dimension and other parameters of the problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。