An improved analysis and unified perspective on deterministic and randomized low rank matrix approximations
arxiv(2019)
摘要
We introduce a Generalized LU-Factorization (\textbf{GLU}) for low-rank matrix approximation. We relate this to past approaches and extensively analyze its approximation properties. The established deterministic guarantees are combined with sketching ensembles satisfying Johnson-Lindenstrauss properties to present complete bounds. Particularly good performance is shown for the sub-sampled randomized Hadamard transform (SRHT) ensemble. Moreover, the factorization is shown to unify and generalize many past algorithms. It also helps to explain the effect of sketching on the growth factor during Gaussian Elimination.
更多查看译文
关键词
matrix,improved analysis,low-rank
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络