Return
Recursive Identification Based on Local Likelihood Function With Binary-Valued Observations
DOI:10.1109/TAC.2025.3649296.png)
Abstract
En 中文
This article studies the control-oriented recursive identification of finite impulse response systems with binary-valued observations. Inspired by the maximum likelihood method, a novel recursive algorithm is proposed using the statistical property of system noises and observations. Unlike existing research, the gradient of the proposed algorithm is derived from the local likelihood function, which has not been previously considered. The core advantage of the algorithm is the adaptation of the recursive weight term, and especially, it has an accelerating effect when the estimated value deviates far from the true value. Besides, compared with existing algorithm based on time-varying thresholds, the proposed algorithm makes it applicable to fixed threshold scenarios through weighting, thus avoiding the complexity caused by time-varying thresholds. The proposed algorithm is proved to be convergent in both almost sure and mean square sense. Furthermore, the almost sure and mean square convergence rates are also obtained under some mild conditions. Two simulations are presented to demonstrate the effectiveness of the proposed algorithm and the advantage of the convergence rate over existing algorithm.
Keywords:
Binary-valued observations
likelihood function
stochastic approximation
system identification
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
Almost sure convergence rates for system identification using binary, quantized, and regular sensors
AUTOMATICA
IF5.9

