Gradient Algorithms for Complex Non-Gaussian Independent Component/Vector Extraction, Question of Convergence
Zbyn\v{e}k Koldovsk\'y, Petr Tichavsk\'y

TL;DR
This paper revises gradient algorithms for extracting a non-Gaussian independent component from mixtures, analyzing convergence properties and proposing modifications to improve global convergence in different source dominance scenarios.
Contribution
It introduces new gradient-based algorithms for component extraction, compares them with existing methods, and studies their convergence behavior considering source power ratios.
Findings
Proposed algorithms outperform existing methods in convergence.
Convergence size depends on source power ratios.
Modifications improve global convergence in weak/dominant source scenarios.
Abstract
We revise the problem of extracting one independent component from an instantaneous linear mixture of signals. The mixing matrix is parameterized by two vectors, one column of the mixing matrix and one row of the de-mixing matrix. The separation is based on the non-Gaussianity of the source of interest, while the other background signals are assumed to be Gaussian. Three gradient-based estimation algorithms are derived using the maximum likelihood principle and are compared with the Natural Gradient algorithm for Independent Component Analysis and with One-unit FastICA based on negentropy maximization. The ideas and algorithms are also generalized for the extraction of a vector component when the extraction proceeds jointly from a set of instantaneous mixtures. Throughout the paper, we address the problem of the size of the region of convergence for which the algorithms guarantee the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
