Stability Analysis of Learning Algorithms for Blind Source Separation

Recently a number of adaptive learning algorithms have been proposed for blind source separation. Although the underlying principles and approaches are different, most of them have very similar forms. Two important issues remained to be elucidated further: the statistical efficiency and the stabilit...

Full description

Saved in:
Bibliographic Details
Published inNeural networks Vol. 10; no. 8; pp. 1345 - 1351
Main Authors Amari, Shun-ichi, Chen, Tian-ping, Cichocki, Andrzej
Format Journal Article
LanguageEnglish
Published Oxford Elsevier Ltd 01.11.1997
Elsevier Science
Subjects
Online AccessGet full text
ISSN0893-6080
1879-2782
1879-2782
DOI10.1016/S0893-6080(97)00039-7

Cover

More Information
Summary:Recently a number of adaptive learning algorithms have been proposed for blind source separation. Although the underlying principles and approaches are different, most of them have very similar forms. Two important issues remained to be elucidated further: the statistical efficiency and the stability of learning algorithms. The present letter analyzes a general form of statistically efficient algorithms and gives a necessary and sufficient condition for the separating solution to be a stable equilibrium of a general learning algorithm. Moreover, when the separating solution is unstable, a simple method is given for stabilizing the separating solution by modifying the algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0893-6080
1879-2782
1879-2782
DOI:10.1016/S0893-6080(97)00039-7