arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.10659math.NAcs.NA
收藏

用于迹估计的Hutch++算法的改进变体

Improved variants of the Hutch++ algorithm for trace estimation

David Persson, Alice Cortinovis, Daniel Kressner

摘要:

本文讨论了用矩阵向量积隐式地给出的估计方阵迹的Hutch++算法的两个改进变型。Hutch++在第一阶段将随机低秩近似与第二阶段的随机迹估计相结合。反过来,Hutch++只需要$O\left(\varepsilon^{-1}\right)$矩阵-矢量积来近似相对误差$\varepsilon$内的高概率轨迹。这与单独使用随机迹估计时所需的$O\left(\varepsilon^{-2}\right)$矩阵向量乘积相比是有利的。在Hutch++中,矩阵向量乘积的数量是先验固定的,并以规定的方式分布在两个相位之间。在这项工作中,我们推导出一个自适应的Hutch++的变体,它输出一个估计的轨迹,是在一些规定的误差容限与可控的故障概率,同时分裂的矩阵向量产品在两个阶段之间的一个接近最佳的方式。对于对称半正定矩阵的特殊情况,我们提出了Hutch++的另一种变体,称为Nyström++,它利用了所谓的Nyström近似,只需要一次遍历矩阵,而Hutch++需要两次遍历。我们将Hutch++的分析推广到Nyström++。数值实验证明了这两种新算法的有效性。

英文摘要:

This paper is concerned with two improved variants of the Hutch++ algorithm for estimating the trace of a square matrix, implicitly given through matrix-vector products. Hutch++ combines randomized low-rank approximation in a first phase with stochastic trace estimation in a second phase. In turn, Hutch++ only requires $O\left(\varepsilon^{-1}\right)$ matrix-vector products to approximate the trace within a relative error $\varepsilon$ with high probability. This compares favorably with the $O\left(\varepsilon^{-2}\right)$ matrix-vector products needed when using stochastic trace estimation alone. In Hutch++, the number of matrix-vector products is fixed a priori and distributed in a prescribed fashion among the two phases. In this work, we derive an adaptive variant of Hutch++, which outputs an estimate of the trace that is within some prescribed error tolerance with a controllable failure probability, while splitting the matrix-vector products in a near-optimal way among the two phases. For the special case of symmetric positive semi-definite matrix, we present another variant of Hutch++, called Nyström++, which utilizes the so called Nyström approximation and requires only one pass over the matrix, as compared to two passes with Hutch++. We extend the analysis of Hutch++ to Nyström++. Numerical experiments demonstrate the effectiveness of our two new algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑