Recursive Sparse Parameter Identification of Multivariate ARMAX Systems with Non-stationary Observations and Colored Noise
Yanxin Fu, Wenxiao Zhao

TL;DR
This paper develops recursive algorithms for online sparse parameter identification in multivariate ARMAX systems with non-stationary data and colored noise, ensuring accurate support and parameter estimation.
Contribution
It introduces a novel bivariate criterion with explicit recursive solutions, and proves convergence properties under challenging non-stationary conditions.
Findings
Algorithms achieve set convergence for sparse support
Algorithms ensure consistent estimation of non-zero parameters
Numerical examples validate theoretical results
Abstract
The classical sparse parameter identification methods are usually based on the iterative basis selection such as greedy algorithms, or the numerical optimization of regularized cost functions such as LASSO and Bayesian posterior probability distribution, etc., which, however, are not suitable for online sparsity inference when data arrive sequentially. This paper presents recursive algorithms for sparse parameter identification of multivariate stochastic systems with non-stationary observations. First, a new bivariate criterion function is presented by introducing an auxiliary variable matrix into a weighted regularization criterion. The new criterion function is subsequently decomposed into two solvable subproblems via alternating optimization of the two variable matrices, for which the optimizers can be explicitly formulated into recursive equations. Second, under the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
