Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization

Ameya Velingker, Maximilian Vötsch, David Woodruff, Samson Zhou
Proceedings of the 40th International Conference on Machine Learning, PMLR 202:34952-34977, 2023.

Abstract

We introduce efficient (1+ε)-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix A∈{0,1}n×d, a rank parameter k>0, as well as an accuracy parameter ε>0, and the goal is to approximate A as a product of low-rank factors U∈{0,1}n×k and V∈{0,1}k×d. Equivalently, we want to find U and V that minimize the Frobenius loss ‖. Before this work, the state-of-the-art for this problem was the approximation algorithm of Kumar et. al. [ICML 2019], which achieves a C-approximation for some constant C\ge 576. We give the first (1+\varepsilon)-approximation algorithm using running time singly exponential in k, where k is typically a small integer. Our techniques generalize to other common variants of the BMF problem, admitting bicriteria (1+\varepsilon)-approximation algorithms for L_p loss functions and the setting where matrix operations are performed in \mathbb{F}_2. Our approach can be implemented in standard big data models, such as the streaming or distributed models.

Cite this Paper

BibTeX
@InProceedings{pmlr-v202-velingker23a, title = {Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization}, author = {Velingker, Ameya and V\"{o}tsch, Maximilian and Woodruff, David and Zhou, Samson}, booktitle = {Proceedings of the 40th International Conference on Machine Learning}, pages = {34952--34977}, year = {2023}, editor = {Krause, Andreas and Brunskill, Emma and Cho, Kyunghyun and Engelhardt, Barbara and Sabato, Sivan and Scarlett, Jonathan}, volume = {202}, series = {Proceedings of Machine Learning Research}, month = {23--29 Jul}, publisher = {PMLR}, pdf = {https://proceedings.mlr.press/v202/velingker23a/velingker23a.pdf}, url = {https://proceedings.mlr.press/v202/velingker23a.html}, abstract = {We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter $\varepsilon>0$, and the goal is to approximate $\mathbf{A}$ as a product of low-rank factors $\mathbf{U}\in\{0,1\}^{n\times k}$ and $\mathbf{V}\in\{0,1\}^{k\times d}$. Equivalently, we want to find $\mathbf{U}$ and $\mathbf{V}$ that minimize the Frobenius loss $\|\mathbf{U}\mathbf{V} - \mathbf{A}\|_F^2$. Before this work, the state-of-the-art for this problem was the approximation algorithm of Kumar et. al. [ICML 2019], which achieves a $C$-approximation for some constant $C\ge 576$. We give the first $(1+\varepsilon)$-approximation algorithm using running time singly exponential in $k$, where $k$ is typically a small integer. Our techniques generalize to other common variants of the BMF problem, admitting bicriteria $(1+\varepsilon)$-approximation algorithms for $L_p$ loss functions and the setting where matrix operations are performed in $\mathbb{F}_2$. Our approach can be implemented in standard big data models, such as the streaming or distributed models.} }
Endnote
%0 Conference Paper %T Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization %A Ameya Velingker %A Maximilian Vötsch %A David Woodruff %A Samson Zhou %B Proceedings of the 40th International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2023 %E Andreas Krause %E Emma Brunskill %E Kyunghyun Cho %E Barbara Engelhardt %E Sivan Sabato %E Jonathan Scarlett %F pmlr-v202-velingker23a %I PMLR %P 34952--34977 %U https://proceedings.mlr.press/v202/velingker23a.html %V 202 %X We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter $\varepsilon>0$, and the goal is to approximate $\mathbf{A}$ as a product of low-rank factors $\mathbf{U}\in\{0,1\}^{n\times k}$ and $\mathbf{V}\in\{0,1\}^{k\times d}$. Equivalently, we want to find $\mathbf{U}$ and $\mathbf{V}$ that minimize the Frobenius loss $\|\mathbf{U}\mathbf{V} - \mathbf{A}\|_F^2$. Before this work, the state-of-the-art for this problem was the approximation algorithm of Kumar et. al. [ICML 2019], which achieves a $C$-approximation for some constant $C\ge 576$. We give the first $(1+\varepsilon)$-approximation algorithm using running time singly exponential in $k$, where $k$ is typically a small integer. Our techniques generalize to other common variants of the BMF problem, admitting bicriteria $(1+\varepsilon)$-approximation algorithms for $L_p$ loss functions and the setting where matrix operations are performed in $\mathbb{F}_2$. Our approach can be implemented in standard big data models, such as the streaming or distributed models.
APA
Velingker, A., Vötsch, M., Woodruff, D. & Zhou, S.. (2023). Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization. Proceedings of the 40th International Conference on Machine Learning, in Proceedings of Machine Learning Research 202:34952-34977 Available from https://proceedings.mlr.press/v202/velingker23a.html.

Related Material