L1-Based Adaptive Identification with Saturated Observations
Not on the map. Why?
Abstract (arXiv)
It is well-known that saturated output observations are prevalent in various practical systems and that the ℓ1-norm is more robust than the ℓ2-norm-based parameter estimation. Unfortunately, adaptive identification based on both saturated observations and the ℓ1-optimization turns out to be a challenging nonlinear problem, and has rarely been explored in the literature. Motivated by this and the need to fit with the ℓ1-based index of prediction accuracy in, e.g., judicial sentencing prediction problems, we propose a two-step weighted ℓ1-based adaptive identification algorithm. Under certain excitation conditions much weaker than the traditional persistent excitation (PE) condition, we will establish the global convergence of both the parameter estimators and the adaptive predictors. It is worth noting that our results do not rely on the widely used independent and identically distributed (iid) assumptions on the system signals, and thus do not exclude applications to feedback control systems. We will demonstrate the advantages of our proposed new adaptive algorithm over the existing ℓ2-based ones, through both a numerical example and a real-data-based sentencing prediction problem.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 14 Dec 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.