We discuss the blind source separation problem where the sources are not independent but are dependent only through their variances. Some estimation methods have been proposed on this line. However, most of them require some additional assumptions: a parametric model for their dependencies or a temporal structure of the sources, for example. In previous work, we have proposed a generalized least squares approach using fourth-order moments to the blind source separation problem in the general case where those additional assumptions do not hold. In this article, we develop a simple optimization algorithm for the least squares approach, or a quasi-stochastic gradient algorithm. The new algorithm is able to estimate variance-dependent components even when the number of variables is large and the number of moments is computationally prohibitive. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Hyvärinen, A., & Shimizu, S. (2006). A quasi-stochastic gradient algorithm for variance-dependent component analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4132 LNCS-II, pp. 211–220). Springer Verlag. https://doi.org/10.1007/11840930_22
Mendeley helps you to discover research relevant for your work.