随机草图算法与Tracy-Widom定律
On randomized sketching algorithms and the Tracy-Widom law
摘要:
有越来越多的工作探索随机投影到数值线性代数的算法集成。主要动机是减少处理大型数据集的总体计算成本。可以使用适当选择的随机投影来将原始数据集嵌入低维空间中,使得原始数据集的关键属性被保留。这些算法通常被称为草图算法,因为投影数据集可以用作完整数据集的压缩表示。我们表明,随机矩阵理论,特别是Tracy-Widom法,是有用的描述操作特性的素描算法在高大的数据制度时,$n \gg d$。渐近大样本的结果是特别感兴趣的,因为这是制度,草图是最有用的数据压缩。特别是,我们开发的渐近近似的成功率在生成随机子空间嵌入和迭代素描算法的收敛概率。我们测试了一些草图算法在真正的大型高维数据集,并发现渐近表达式给出了准确的预测的经验性能。
英文摘要:
There is an increasing body of work exploring the integration of random projection into algorithms for numerical linear algebra. The primary motivation is to reduce the overall computational cost of processing large datasets. A suitably chosen random projection can be used to embed the original dataset in a lower-dimensional space such that key properties of the original dataset are retained. These algorithms are often referred to as sketching algorithms, as the projected dataset can be used as a compressed representation of the full dataset. We show that random matrix theory, in particular the Tracy-Widom law, is useful for describing the operating characteristics of sketching algorithms in the tall-data regime when $n \gg d$. Asymptotic large sample results are of particular interest as this is the regime where sketching is most useful for data compression. In particular, we develop asymptotic approximations for the success rate in generating random subspace embeddings and the convergence probability of iterative sketching algorithms. We test a number of sketching algorithms on real large high-dimensional datasets and find that the asymptotic expressions give accurate predictions of the empirical performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。