Can dynamic adaptation gain speed up recursive least squares algorithm?
Dynamic adaptation gain/learning rate have been introduced in the context of adaptation/learning algorithms using scalar adaptation gains/learning rates in order to accelerate the adaptation transients. This paper shows by means of theoretical analysis, simulations and experimental results (on an active noise control system) that inserting a dynamic adaptation gain into the recursive least squares algorithm speeds up the adaptation transients in a deterministic environment and the asymptotic convergence in the stochastic case.
Authors
- Ioan Doré Landau (ORCID: https://orcid.org/0000-0002-8335-4036)
- Gabriel Buche (ORCID: https://orcid.org/0000-0001-6256-0474)
- Tudor-Bogdan Airimiţoaie (ORCID: https://orcid.org/0000-0001-9987-8566)
- Bernard Vau (ORCID: https://orcid.org/0009-0004-5126-5188)
Institutions
- Institut polytechnique de Grenoble (FR)
- Centre National de la Recherche Scientifique (FR)
- Université de Bordeaux (FR)
- GIPSA-Lab (FR)
- Institut Polytechnique de Bordeaux (FR)
- Université Grenoble Alpes (FR)
Publication Details
- Published
- 2024-12-16
- DOI
- https://doi.org/10.1109/cdc56724.2024.10886185
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00