基于块Krylov迭代的低秩近似频繁方向改进算法
An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration
摘要:
频繁方向作为一种确定性的矩阵绘制技术,已被提出用于解决低秩近似问题。该方法具有较高的精度和实用性,但对于大规模数据需要大量的计算量。最近的一些随机版本的频繁方向的工作大大提高了计算效率,但不幸的是牺牲了一些精度。为了解决这个问题,本文的目的是找到一个更准确的投影子空间,以进一步提高现有的频繁方向技术的效率和有效性。利用块Krylov迭代和随机投影技术,提出了一种快速、精确的频繁方向算法r-BKIFD。严格的理论分析表明,该算法具有与原频繁方向算法相当的误差界,并且当迭代次数选择适当时,逼近误差可以任意小.在合成数据和真实数据上的大量实验结果进一步证明了r-BKIFD在计算效率和精度方面优于几种流行的频繁方向算法。
英文摘要:
Frequent Directions, as a deterministic matrix sketching technique, has been proposed for tackling low-rank approximation problems. This method has a high degree of accuracy and practicality, but experiences a lot of computational cost for large-scale data. Several recent works on the randomized version of Frequent Directions greatly improve the computational efficiency, but unfortunately sacrifice some precision. To remedy such issue, this paper aims to find a more accurate projection subspace to further improve the efficiency and effectiveness of the existing Frequent Directions techniques. Specifically, by utilizing the power of Block Krylov Iteration and random projection technique, this paper presents a fast and accurate Frequent Directions algorithm named as r-BKIFD. The rigorous theoretical analysis shows that the proposed r-BKIFD has a comparable error bound with original Frequent Directions, and the approximation error can be arbitrarily small when the number of iterations is chosen appropriately. Extensive experimental results on both synthetic and real data further demonstrate the superiority of r-BKIFD over several popular Frequent Directions algorithms, both in terms of computational efficiency and accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。