Low rank approximation with entrywise l 1 -norm error

DOI10.1145/3055399.3055431zbMath1370.68330arXiv1611.00898OpenAlexW2547958265MaRDI QIDQ4978015

Peilin Zhong, David P. Woodruff, Zhao Song

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

sketchingnumerical linear algebrarobust algorithmslow rank approximationentry-wise \(\ell_1\) norm

Mathematics Subject Classification ID

Related Items (8)

Unnamed Item ⋮ Unnamed Item ⋮ Non-Negative Sparse Regression and Column Subset Selection with L1 Error ⋮ Tensor Rank is Hard to Approximate ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ Low-rank matrix approximation in the infinity norm ⋮ On the Complexity of Robust PCA and ℓ₁-Norm Low-Rank Matrix Approximation ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

This page was built for publication: Low rank approximation with entrywise l ₁ -norm error