关于更有效的SPSD矩阵逼近和CUR矩阵分解
Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition
摘要:
对称半正定(SPSD)矩阵近似方法已被广泛用于大规模特征值计算和核学习方法的加速。标准的草图为基础的方法,我们称之为原型模型,产生相对准确的近似,但在大型方阵效率低下。Nyström方法效率很高,但精度很低。在本文中,我们提出了一种新的模型,我们称之为{ \it快速SPSD矩阵近似模型}。快速模型几乎与Nyström方法一样有效,与原型模型一样准确。我们表明,快速模型可以潜在地解决特征值问题和核学习问题的线性时间相对于矩阵大小$n$实现$1+ε$相对误差,而原型模型和Nyström方法的成本至少二次的时间,以达到可比的误差界。原型模型,Nyström方法,我们的快速模型之间的实证比较证明了快速模型的优越性。我们还贡献了新的理解Nyström方法。Nyström方法是我们的快速模型的一个特殊实例,是原型模型的近似。我们的技术可以直接应用,使CUR矩阵分解更有效地计算,而不会影响精度。
英文摘要:
Symmetric positive semi-definite (SPSD) matrix approximation methods have been extensively used to speed up large-scale eigenvalue computation and kernel learning methods. The standard sketch based method, which we call the prototype model, produces relatively accurate approximations, but is inefficient on large square matrices. The Nyström method is highly efficient, but can only achieve low accuracy. In this paper we propose a novel model that we call the {\it fast SPSD matrix approximation model}. The fast model is nearly as efficient as the Nyström method and as accurate as the prototype model. We show that the fast model can potentially solve eigenvalue problems and kernel learning problems in linear time with respect to the matrix size $n$ to achieve $1+ε$ relative-error, whereas both the prototype model and the Nyström method cost at least quadratic time to attain comparable error bound. Empirical comparisons among the prototype model, the Nyström method, and our fast model demonstrate the superiority of the fast model. We also contribute new understandings of the Nyström method. The Nyström method is a special instance of our fast model and is approximation to the prototype model. Our technique can be straightforwardly applied to make the CUR matrix decomposition more efficiently computed without much affecting the accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。