A Convergence and Asymptotic Analysis of the Generalized Symmetric FastICA Algorithm

DOI10.1109/TSP.2015.2468686zbMATH Open1395.94176arXiv1408.0145OpenAlexW2048430129MaRDI QIDQ4580953FDOQ4580953

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: This contribution deals with the generalized symmetric FastICA algorithm in the domain of Independent Component Analysis (ICA). The generalized symmetric version of FastICA has been shown to have the potential to achieve the Cram'er-Rao Bound (CRB) by allowing the usage of different nonlinearity functions in its parallel implementations of one-unit FastICA. In spite of this appealing property, a rigorous study of the asymptotic error of the generalized symmetric FastICA algorithm is still missing in the community. In fact, all the existing results exhibit certain limitations, such as ignoring the impact of data standardization on the asymptotic statistics or being based on a heuristic approach. In this work, we aim at filling this blank. The first result of this contribution is the characterization of the limits of the generalized symmetric FastICA. It is shown that the algorithm optimizes a function that is a sum of the contrast functions used by traditional one-unit FastICA with a correction of the sign. Based on this characterization, we derive a closed-form analytic expression of the asymptotic covariance matrix of the generalized symmetric FastICA estimator using the method of estimating equation and M-estimator.

Full work available at URL: https://arxiv.org/abs/1408.0145

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (5)

This page was built for publication: A Convergence and Asymptotic Analysis of the Generalized Symmetric FastICA Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580953)