矩阵的简约完备化
Matrix Completion by the Principle of Parsimony
摘要:
首先将Dempster的协方差选择方法推广到一般非奇异矩阵,然后推广到满秩矩形矩阵。Dempster观察到他的完成解决了一个最大熵问题。我们证明了我们的广义完备化也是一个合适的类熵变分问题的解。
英文摘要:
Dempster's covariance selection method is extended first to general nonsingular matrices and then to full rank rectangular matrices. Dempster observed that his completion solved a maximum entropy problem. We show that our generalized completions are also solutions of a suitable entropy-like variational problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。