In this letter, we consider the problem of simultaneous blind signal extraction of arbitrary group sources from a rather large number of observations. Amari (2000) proposed a gradient algorithm that optimizes the maximum-likelihood (ML) criteria on the Stiefel manifold and solves the problem when the approximate (or hypothetical) densities of the desired signals are a priori known. This letter shows how to extend this result to other contrast functions that do not require explicit knowledge of the sources densities. We also present the algorithm necessary and sufficient local stability conditions, providing useful bounds for the learning step size.
No takes yet. Share an insight, caveat, or question.
Cruces et al. (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: