A Caltech Library Service

Binary component decomposition. Part II: The asymmetric case

Kueng, Richard and Tropp, Joel A. (2019) Binary component decomposition. Part II: The asymmetric case. . (Unpublished)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from {±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.

Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription Paper
Tropp, Joel A.0000-0003-1024-1791
Additional Information:Date: 31 July 2019. This research was partially funded by ONR awards N00014-11-1002, N00014-17-12146, and N00014-18-12363. Additional support was provided by the Gordon & Betty Moore Foundation.
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-11-1002
Office of Naval Research (ONR)N00014-17-12146
Office of Naval Research (ONR)N00014-18-12363
Gordon and Betty Moore FoundationUNSPECIFIED
Subject Keywords:Matrix decomposition, matrix factorization, principal component analysis, semidefinite programming
Classification Code:2010 Mathematics Subject Classification. Primary: 52A20, 15B48. Secondary: 15A21, 52B12, 90C27
Record Number:CaltechAUTHORS:20201218-154444454
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:107224
Deposited By: George Porter
Deposited On:18 Dec 2020 23:57
Last Modified:18 Dec 2020 23:57

Repository Staff Only: item control page