Abstract: We formulate em algorithm in the framework of Bregman divergence, which is a general problem setting of information geometry. That is, we address the minimization problem of the Bregman ...
Abstract: The convergence of expectation-maximization (EM)-based algorithms typically requires continuity of the likelihood function with respect to all the unknown parameters (optimization variables) ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results