Binary Component Decomposition Part I: The Positive-Semidefinite Case
SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE(2021)
摘要
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either {+/- 1} or {0, 1}. This 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. A companion paper addresses the related problem of decomposing a low-rank rectangular matrix into a binary factor and an unconstrained factor.
更多查看译文
关键词
matrix factorization, cut polytope, elliptope, semidefinite programming
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络