Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.19124 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- This paper investigates the optimality analysis of the recursive least-squares (RLS) algorithm for autoregressive systems with exogenous inputs (ARX systems). A key challenge in analyzing is managing the potential unboundedness of the parameter estimates, which may diverge to infinity. Previous approaches addressed this issue by assuming that both the true parameter and the RLS estimates remain confined within a known compact set, thereby ensuring uniform boundedness throughout the analysis. In contrast, we propose a new analytical framework that eliminates the need for such a boundness assumption. Specifically, we establish a quantitative relationship between the bounded moment conditions of quasi-stationary input/output signals and the convergence rate of the tail probability of the RLS estimation error. Based on this technique, we prove that when system inputs/outputs have bounded twentieth-order moments, the RLS algorithm achieves asymptotic normality and the covariance matrix of the RLS algorithm converges to the Cramér-Rao lower bound (CRLB), confirming its asymptotic efficiency. These results demonstrate that the RLS algorithm is an asymptotically optimal identification algorithm for ARX systems, even without the projection operators to ensure that parameter estimates reside within a prior known compact set.