Fast $(1+\epsilon )$-Approximation Algorithms for Binary Matrix Factorization

Ameya Velingker, Maximilian Vötsch, David P. Woodruff +1

We introduce efficient $(1+\epsilon )$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}…