Approximation Algorithms for l 0 -Low Rank Approximation

We study the l(0)-Low Rank Approximation Problem, where the goal is, given an m x n matrix A, to output a rank-k matrix A' for which parallel to A' - A parallel to(0) is minimized. Here, for a matrix B, parallel to B parallel to(0) denotes the number of its non-zero entries. This NP-hard variant of low rank approximation is natural for pr...更多