A PTAS for ℓp-Low Rank Approximation
From MaRDI portal
Publication:5236230
DOI10.1137/1.9781611975482.47zbMath1431.68145arXiv1807.06101OpenAlexW2907115276MaRDI QIDQ5236230
Vijay V. S. P. Bhattiprolu, Pavel Kolev, Karl Bringmann, Euiwoong Lee, David P. Woodruff, Frank Ban
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06101
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Approximation algorithms (68W25) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (6)
Parameterized complexity of categorical clustering with size constraints ⋮ One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering ⋮ Parameterized low-rank binary matrix approximation ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Low-Rank Binary Matrix Approximation in Column-Sum Norm. ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching
This page was built for publication: A PTAS for ℓp-Low Rank Approximation
