Robust Independent Component Analysis by Iterative Maximization of the Kurtosis Contrast with Algebraic Optimal Step Size
Vicente Zarzoso, Pierre Comon

TL;DR
RobustICA introduces an efficient deflation-based ICA method that optimizes kurtosis contrast via algebraic step size calculation, improving robustness and speed especially with short data records and complex sources.
Contribution
It proposes a novel ICA algorithm that avoids prewhitening, uses algebraic root-finding for optimal step size, and enhances robustness and convergence speed.
Findings
Outperforms existing ICA methods in synthetic data tests.
Effectively extracts atrial activity from complex ECG signals.
Demonstrates high convergence speed and robustness to local extrema.
Abstract
Independent component analysis (ICA) aims at decomposing an observed random vector into statistically independent variables. Deflation-based implementations, such as the popular one-unit FastICA algorithm and its variants, extract the independent components one after another. A novel method for deflationary ICA, referred to as RobustICA, is put forward in this paper. This simple technique consists of performing exact line search optimization of the kurtosis contrast function. The step size leading to the global maximum of the contrast along the search direction is found among the roots of a fourth-degree polynomial. This polynomial rooting can be performed algebraically, and thus at low cost, at each iteration. Among other practical benefits, RobustICA can avoid prewhitening and deals with real- and complex-valued mixtures of possibly noncircular sources alike. The absence of…
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.
