This paper introduces and investigates a gradient flow of the log likelihood function restricted on the isospectral submanifold and proves that the flow globally converges to diagonal matrices for almost all positive definite initial matrices. This result shows that the log likelihood function does not have any spurious stable fixed point and ensures the global convergence of ICA algorithms based on the log likelihood function. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Hori, G. (2006). Global analysis of log likelihood criterion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3889 LNCS, pp. 815–822). https://doi.org/10.1007/11679363_101
Mendeley helps you to discover research relevant for your work.