Normalized stochastic gradient descent learning of general complex‐valued models. Issue 12 (20th April 2021)

• Record Type: Journal Article
• Authors: Paireder, T.; Motz, C.; Huemer, M.
• Is Part Of: Electronics letters. Volume 57:Issue 12(2021)
• Page Start: 493
• Page End: 495
• Publication Date: 2021-04-20
• Subjects: Electronics -- Periodicals; 621.381
• DOI: 10.1049/ell2.12170
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract: The stochastic gradient descent (SGD) method is one of the most prominent first‐order iterative optimisation algorithms, enabling linear adaptive filters as well as general nonlinear learning schemes. It is applicable to a wide range of objective functions, while featuring low computational costs for online operation. However, without a suitable step‐size normalisation, the convergence and tracking behaviour of the stochastic gradient descent method might be degraded in practical applications. In this letter, a novel general normalisation approach is provided for the learning of (non‐)holomorphic models with multiple independent parameter sets. The advantages of the proposed method are demonstrated by means of a specific widely‐linear estimation example.