L2-Stability Analysis of The Set-Membership Affine Projection Algorithm
In this letter, we study the local and the global robustness of the set-membership affine projection (SM-AP) algorithm. We demonstrate that the SM-AP algorithm has l2-stability. In fact, the SM-AP algorithm never diverges; no matter how the parameters of the SM-AP algorithm has been adopted. Finally, the simulation results substantiate the validity of the proposed analysis.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Study of Set-Membership Kernel Adaptive Algorithms and Applications
Adaptive algorithms based on kernel structures have been a topic of significant research over the past few years. The main advantage is that they form a family of universal approximators, offering an elegant solution to …
On Data-Selective Learning
Adaptive filters are applied in several electronic and communication devices like smartphones, advanced headphones, DSP chips, smart antenna, and teleconference systems. Also, they have application in many areas such as …
A Control Lyapunov Perspective on Episodic Learning via Projection to State Stability
The goal of this paper is to understand the impact of learning on control synthesis from a Lyapunov function perspective. In particular, rather than consider uncertainties in the full system dynamics, we employ Control L…
L2-Stability Analysis of the SM-NLMS Algorithm
In this letter, we analyze, two properties, the local and the global robustness of the set-membership normalized least mean square (SM-NLMS) algorithm. We will show that the SM-NLMS algorithm has l2-stability. Indeed, th…
Projection-free Adaptive Regret with Membership Oracles
In the framework of online convex optimization, most iterative algorithms require the computation of projections onto convex sets, which can be computationally expensive. To tackle this problem HK12 proposed the study of…