##
###
Weighted low rank approximations with provable guarantees

Ilya Razenshteyn, Zhao Song, David P. Woodruff

2016
*
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016
*

Inspired by practical applications, we consider *a* *weighted* version of low *rank* approximation: *for* *a* non-negative *weight* *matrix* W we seek to minimize i,j (Wi,j ·(Ai,j −Bi,j)) 2 . ...
The classical problem is *a* special case of this problem when all *weights* are *1*. ...
Landsberg, Ankur Moitra, Daniel Perrucci, Eric Price, James Renegar, Tselil Schramm, Elias Tsigaridas, Ryan Williams, and David Zuckerman *for* useful discussions. ...

doi:10.1145/2897518.2897639
dblp:conf/stoc/RazenshteynSW16
fatcat:pt66crfa45ertiljzqyteejma4