Stability Analysis of Learning Algorithms for Blind Source Separation
β Scribed by Shun-ichi Amari; Tian-ping Chen; Andrzej Cichocki
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 226 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0893-6080
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
We present several modifications of blind separation adaptive algorithms which have significant advantages over the well-known Herault-Jutten learning algorithm in handling ill-conditioned signals. In particular, the proposed algorithms are more stable and converge to the correct solutions in cases
In many s(enal processing applications, the s(~nals provided b)' the sensors are mi.vlttres t?/'man), sources. The problem qlseparation t!/'sm#z'es is to ~:vtract the original s~enals fi'om these mixtures...1 new algorithm, based on ideas o/back propagation learning, is proposed.lbr source separatio