Abstract
The low-rank matrix approximation problem with respect to the entry-wise ℓ∞-norm is the following: given a matrix M and a factorization rank r, find a matrix X whose rank is at most r and that minimizes maxi,j|Mij−Xij|. In this paper, we prove that the decision variant of this problem for r=1 is NP-complete using a reduction from the problem ‘not all equal 3SAT’. We also analyze several cases when the problem can be solved in polynomial time, and propose a simple practical heuristic algorithm which we apply on the problem of the recovery of a quantized low-rank matrix, that is, to the problem of recovering a low-rank matrix whose entries have been rounded up to some accuracy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
