Weighted low rank approximations with provable guarantees

DOI10.1145/2897518.2897639zbMath1378.65093OpenAlexW2408897693MaRDI QIDQ5361834

Ilya Razenshteyn, Zhao Song, David P. Woodruff

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2897518.2897639

zbMATH Keywords

optimizationlinear algebrasemi-algebraic setssketches

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Unnamed Item ⋮ Unnamed Item ⋮ Parameterized low-rank binary matrix approximation ⋮ Parameterized Low-Rank Binary Matrix Approximation ⋮ An adaptation for iterative structured matrix completion

This page was built for publication: Weighted low rank approximations with provable guarantees