## Neural Computation

February 1, 2005, Vol. 17, No. 2, Pages 331-334
(doi: 10.1162/0899766053011483)
© 2005 Massachusetts Institute of Technology
A Further Result on the ICA One-Bit-Matching Conjecture
Article PDF (45.89 KB)
Abstract

The 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.