Papers › Average Case Column Subset Selection for Entrywise \ell_1-Norm Loss
Average Case Column Subset Selection for Entrywise \ell_1-Norm Loss
Zhao Song, David Woodruff, Peilin Zhong
We study the column subset selection problem with respect to the entrywise ℓ₁-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^(Ω(1)) number of columns to obtain a (1+ϵ)-approximation to an n ×n matrix. Nevertheless, we show that under certain minimal and realistic distributional settings, it is possible to obtain a (1+ϵ)-approximation with a nearly linear running time and poly$(k/\epsilon)+O(k\log n)$ columns. Namely, we show that if the input matrix A has the form A = B + E, where B is an arbitrary rank-k matrix, and E is a matrix with i.i.d. entries drawn from any distribution μ for which the (1+γ)-th moment exists, for an arbitrarily small constant γ> 0, then it is possible to obtain a (1+ϵ)-approximate column subset selection to the entrywise ℓ₁-norm in nearly linear time. Conversely we show that if the first moment does not exist, then it is not possible to obtain a (1+ϵ)-approximate subset selection algorithm even if one chooses any nᵒ⁽¹⁾ columns. This is the first algorithm of any kind for achieving a (1+ϵ)-approximation for entrywise ℓ₁-norm loss low rank approximation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections