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

近似个性化PageRank及以后的加速稀疏算法

Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond

David Martínez-Rubio, Elias Wirth, Sebastian Pokutta

摘要:

最近的研究表明,ISTA(一种未加速的最优化方法)为$\ell_1$正则化个性化PageRank问题提供了稀疏更新,从而降低了迭代复杂度,并提供了与近似个性化PageRank算法(APPR)相同的保证[FRS+19]。在这项工作中,我们为这个问题设计了一个加速优化算法,该算法还执行稀疏更新,为[FY 22]的COLT 2022开放问题提供了肯定的答案。加速减少了对条件数的依赖,而我们更新中对稀疏性的依赖与ISTA方法不同。此外,我们设计了另一种算法,通过使用共轭方向,以实现精确解,同时利用稀疏性。这两种算法导致更快的收敛某些参数制度。我们的研究结果适用于超出PageRank和工作的任何二次目标,其Hessian是一个正定的$M$ -矩阵。

英文摘要:

It has recently been shown that ISTA, an unaccelerated optimization method, presents sparse updates for the $\ell_1$-regularized personalized PageRank problem, leading to cheap iteration complexity and providing the same guarantees as the approximate personalized PageRank algorithm (APPR) [FRS+19]. In this work, we design an accelerated optimization algorithm for this problem that also performs sparse updates, providing an affirmative answer to the COLT 2022 open question of [FY22]. Acceleration provides a reduced dependence on the condition number, while the dependence on the sparsity in our updates differs from the ISTA approach. Further, we design another algorithm by using conjugate directions to achieve an exact solution while exploiting sparsity. Both algorithms lead to faster convergence for certain parameter regimes. Our findings apply beyond PageRank and work for any quadratic objective whose Hessian is a positive-definite $M$-matrix.

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

↑