A further result on the ICA one-bit-matching conjecture
Publication in refereed journal


Times Cited
Web of Science12WOS source URL (as at 23/09/2020) Click here for the latest count
Altmetrics Information
.

Other information
AbstractThe one-bit-matching conjecture for independent component analysis (ICA) has been widely believed in the ICA community. Theoretically, it has been proved that under the assumption of zero skewness for the model probability density functions, the global maximum of a cost function derived from the typical objective function on the ICA problem with the one-bit-matching condition corresponds to a feasible solution of the ICA problem. In this note, we further prove that all the local maximums of the cost function correspond to the feasible solutions of the ICA problem in the two-source case under the same assumption. That is, as long as the one-bit-matching condition is satisfied, the two-source ICA problem can be successfully solved using any local descent algorithm of the typical objective function with the assumption of zero skewness for all the model probability density functions.
All Author(s) ListMa JW, Liu ZY, Xu L
Journal nameNeural Computation
Year2005
Month2
Day1
Volume Number17
Issue Number2
PublisherM I T PRESS
Pages331 - 334
ISSN0899-7667
eISSN1530-888X
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science; Computer Science, Artificial Intelligence; COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE; NEUROSCIENCES

Last updated on 2020-24-09 at 00:54