Publication
ICML 2017
Conference paper

Algorithms for ℓp low-rank approximation

Abstract

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entry-wise ℓp-approximation error, for any P ≥ 1; the case p = 2 is the classical SVD problem. We obtain the first provably good approximation algorithms for this version of low-rank approximation that work for every value of p ≥ 1, including p = σ. Our algorithms are simple, easy to implement, work well in practice, and illustrate interesting tradeoffs between the approximation quality, the running time, and the rank of the approximating matrix.

Date

06 Aug 2017

Publication

ICML 2017

Authors

Share