arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.07351cs.DSmath.OC
收藏

计算近似PSD分解

Computing approximate PSD factorizations

Amitabh Basu, Michael Dinitz, Xin Li

摘要:

给出了一个计算非负矩阵PSD近似分解的算法。该算法的运行时间与输入矩阵的维数成多项式关系,与PSD秩和逼近误差成指数关系。当因子的行和列被限制在一般多面体中时,主要成分是精确因子分解算法。这严格地推广了非负矩阵分解,可以通过让这个多面体是非负正交来捕获。

英文摘要:

We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron. This strictly generalizes nonnegative matrix factorizations which can be captured by letting this polyhedron to be the nonnegative orthant.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑