Binary component decomposition Part II: The asymmetric case
Binary component decomposition Part II: The asymmetric case
复制标题
二元分量分解第二部分：不对称情况
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
J. Tropp
中科院分区：
文献类型：
--
作者：
R. Kueng;J. Tropp
本文研究了低秩矩阵分解为一个二元因子和一个无约束因子的问题。该研究回答了关于这些分解的存在性和唯一性的基本问题。它还导致了易于处理的因式分解算法，成功的温和的确定性条件下。这项工作建立在一个同伴的文件，解决了相关的问题，分解成对称的二元因子的低秩半正定矩阵。
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from ${pm 1}$ or from ${0,1}$, and an unconstrained factor. The research answers fundamental questions about the existence and uniqueness of these decompositions. It also leads to tractable factorization algorithms that succeed under a mild deterministic condition. This work builds on a companion paper that addresses the related problem of decomposing a low-rank positive-semidefinite matrix into symmetric binary factors.