arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.01494math.NAcs.NA
收藏

不动点多线性PageRank计算的外推方法

Extrapolation Methods for fixed-point Multilinear PageRank computations

Stefano Cipolla, Michela Redivo-Zaglia, Francesco Tudisco

摘要:

非负张量在许多涉及大型复杂数据流的应用中非常自然地出现。由于对内存和每步操作次数的要求相对较小,(移位)高阶幂方法是计算这类张量的正Z特征向量的最常用技术之一。然而,与矩阵的情况下,该方法可能无法收敛,甚至不可约张量。而且,当它收敛时,它的收敛速度可能非常慢。这两个缺点往往使计算的特征向量要求或不可行的大型问题。在这项工作中,我们考虑了一类特殊的非负张量相关联的高阶马尔可夫链的多线性PageRank修改。基于简化的拓扑$ε$ -算法的重新启动形式,我们介绍了一种基于外推的加速幂方法类型的算法,即移位不动点方法和内-外方法。加速方法显示出显著更好的性能,具有更快的收敛速度和减少的总计算时间。在合成数据集和真实数据集上进行的大量数值实验证明了所引入的外推技术的优点。

英文摘要:

Nonnegative tensors arise very naturally in many applications that involve large and complex data flows. Due to the relatively small requirement in terms of memory storage and number of operations per step, the (shifted) higher-order power method is one of the most commonly used technique for the computation of positive Z-eigenvectors of this type of tensors. However, unlike the matrix case, the method may fail to converge even for irreducible tensors. Moreover, when it converges, its convergence rate can be very slow. These two drawbacks often make the computation of the eigenvectors demanding or unfeasible for large problems. In this work we consider a particular class of nonnegative tensors associated to the multilinear PageRank modification of higher-order Markov chains. Based on the simplified topological $ε$-algorithm in its restarted form, we introduce an extrapolation-based acceleration of power method type algorithms, namely the shifted fixed-point method and the inner-outer method. The accelerated methods show remarkably better performance, with faster convergence rates and reduced overall computational time. Extensive numerical experiments on synthetic and real-world datasets demonstrate the advantages of the introduced extrapolation techniques.

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

↑