Tighter Low-rank Approximation via Sampling the Leveraged Element

DOI10.1137/1.9781611973730.62zbMath1371.68320arXiv1410.3886OpenAlexW2951791000MaRDI QIDQ5362997

Prateek Jain, Sujay Sanghavi, Srinadh Bhojanapalli

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.3886

Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (9)

Noisy tensor completion via the sum-of-squares hierarchy ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Unnamed Item ⋮ Literature survey on low rank approximation of matrices ⋮ Cross: efficient low-rank tensor completion ⋮ Multilayer tensor factorization with applications to recommender systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization

This page was built for publication: Tighter Low-rank Approximation via Sampling the Leveraged Element