# Average Case Column Subset Selection for Entrywise $\ell_1$-Norm Loss

Zhong Peilin

Abstract:

We study the column subset selection problem with respect to the entrywise $\ell_1$-norm loss. It is known that in the worst case, to obtain a good rank-$k$ approximation to a matrix, one needs an arbitrarily large $n^{\Omega(1)}$ number of columns to obtain a $(1+\epsilon)$-approximation to the best entrywise $\ell_1$-norm low rank app...More

Code:

Data: