# Approximation Algorithms for \ell_0-Low Rank Approximation

Karl BringmannPavel KolevDavid Woodruff

We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries... (read more)

PDF Abstract