arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2404.00199math.OCmath.DS
收藏

具有一般观测序列的随机系统的高效稀疏辨识算法

An Efficient Sparse Identification Algorithm For Stochastic Systems With General Observation Sequences

Ziming Wang, Xinghua Zhu

AI总结:

本文针对随机动态系统稀疏参数辨识问题,提出一种基于最小二乘和自适应阈值的稀疏辨识算法,在弱激励条件下实现有限观测下的正确辨识与几乎必然收敛,无需额外优化且优于 LASSO 等方法。

摘要:

本文研究随机动态系统中未知稀疏参数向量的稀疏辨识问题。首先,提出一种新的稀疏辨识算法,该算法可在最小二乘估计的基础上通过自适应调整阈值生成稀疏估计。其次,在一个可能最弱的非持续激励条件下,我们证明所提算法能够利用有限数量的观测正确辨识稀疏参数向量的零元素与非零元素,并且非零元素的估计几乎必然收敛到真实值。与相关工作(例如 LASSO)相比,我们的方法仅要求最弱的假设,且不需要求解额外的优化问题。此外,我们的理论结果不要求回归信号具有任何统计假设,包括独立性或平稳性,这使得我们的结果有望应用于随机反馈系统。第三,首次推导出保证 Hammerstein 系统未知稀疏参数零元素集合收敛所需的有限观测数量。最后,给出了数值仿真,验证了所提方法的有效性。由于不存在额外的优化问题,即不存在额外的数值误差,所提算法的性能远优于其他相关算法。

英文摘要:

This paper studies the sparse identification problem of unknown sparse parameter vectors in stochastic dynamic systems. Firstly, a novel sparse identification algorithm is proposed, which can generate sparse estimates based on least squares estimation by adaptively adjusting the threshold. Secondly, under a possibly weakest non-persistent excited condition, we prove that the proposed algorithm can correctly identify the zero and nonzero elements of the sparse parameter vector using a finite number of observations, and further estimates of the nonzero elements almost surely converge to the true values. Compared with the related works, e.g., LASSO, our method only requires the weakest assumptions and does not require solving additional optimization problems. Besides, our theoretical results do not require any statistical assumptions on the regression signals, including independence or stationarity, which makes our results promising for application to stochastic feedback systems. Thirdly, the number of finite observations that guarantee the convergence of the zero-element set of unknown sparse parameters of the Hammerstein system is derived for the first time. Finally, numerical simulations are provided, demonstrating the effectiveness of the proposed method. Since there is no additional optimization problem, i.e., no additional numerical error, the proposed algorithm performs much better than other related algorithms.

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

↑