Name
Title | ||
|---|---|---|
One-Bit-Matching ICA theorem, convex-concave programming, and combinatorial optimization |
Abstract | ||
|---|---|---|
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to-one same-sign-correspondence between the kurtosis signs of all source probability density functions (pdf's) and the kurtosis signs of all model pdf's (Xu, Cheung, Amari, 1998a), which is widely believed and implicitly supported by many empirical studies. However, this proof is made only in a weak sense that the conjecture is true when the global optimal solution of an ICA criterion is reached. Thus, it can not support the successes of many existing iterative algorithms that usually converge at one of local optimal solutions. In this paper, a new mathematical proof is obtained in a strong sense that the conjecture is also true when anyone of local optimal solutions is reached, in help of investigating convex-concave programming on a polyhedral-set. Theorems have also been proved not only on partial separation of sources when there is a partial matching between the kurtosis signs, but also on an interesting duality of maximization and minimization on source separation. Moreover, corollaries are obtained from the theorems to state that seeking a one-to-one same-sign-correspondence can be replaced by a use of the duality, i.e., super-gaussian sources can be separated via maximization and sub-gaussian sources can be separated via minimization. Also, a corollary is obtained to confirm the symmetric orthogonalization implementation of the kurtosis extreme approach for separating multiple sources in parallel, which works empirically but in a lack of mathematical proof. Furthermore, a linkage has been set up to combinatorial optimization from a Stiefel manifold perspective, with algorithms that guarantee convergence and satisfaction of constraints. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11427391_2 | ISNN (1) |
Keywords | Field | DocType |
local optimal solution,one-bit-matching conjecture,one-to-one same-sign-correspondence,convex-concave programming,one-bit-matching ica theorem,mathematical proof,combinatorial optimization,interesting duality,model pdf,kurtosis extreme approach,new mathematical proof,kurtosis sign,global optimal solution,global optimization,iterative algorithm,empirical study,probability density function,stiefel manifold | Applied mathematics,Duality (optimization),Artificial intelligence,Conjecture,Combinatorics,Pattern recognition,Automated theorem proving,Combinatorial optimization,Mathematical proof,Independent component analysis,Convex optimization,Maximization,Mathematics | Conference |
Volume | ISSN | ISBN |
3496 | 0302-9743 | 3-540-25912-0 |
Citations | PageRank | References |
3 | 0.41 | 14 |
Authors | ||
1 | ||