近似矩阵乘法及其在线性嵌入中的应用
Approximate Matrix Multiplication with Application to Linear Embeddings
摘要:
本文研究两个实矩阵乘积的近似计算问题。特别地,我们分析了Sarlos [1]提出的基于降维的近似算法,引入了核秩的概念,即核范数与谱范数的比值。所提出的界有改进的依赖性相对于近似误差(与以前的方法相比),而子空间-上,我们的项目的输入矩阵-的尺寸成比例的最大核秩,它是独立的输入尺寸。此外,我们提供了一个应用程序的线性低维嵌入这一结果。也就是说,我们表明,任何欧几里德点集有界核秩是服从投影到独立于输入维数的维数,同时实现添加剂的误差保证。
英文摘要:
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as the ratio of the nuclear norm over the spectral norm. The presented bound has improved dependence with respect to the approximation error (as compared to previous approaches), whereas the subspace -- on which we project the input matrices -- has dimensions proportional to the maximum of their nuclear rank and it is independent of the input dimensions. In addition, we provide an application of this result to linear low-dimensional embeddings. Namely, we show that any Euclidean point-set with bounded nuclear rank is amenable to projection onto number of dimensions that is independent of the input dimensionality, while achieving additive error guarantees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。