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

求解稀疏线性方程组的有效数值方法及其在PageRank中的应用

Efficient Numerical Methods to Solve Sparse Linear Equations with Application to PageRank

Anton Anikin, Alexander Gasnikov, Alexander Gornov, Dmitry Kamzolov, Yury Maximov, Yurii Nesterov

摘要:

本文提出了三种方法来解决具有行和列稀疏性的转移阵的PageRank问题。我们的方法将PageRank问题归结为单纯形上的凸优化问题。第一种算法是基于L1范数下的梯度下降而不是欧氏梯度下降。第二个算法扩展了Frank-Wolfe算法,支持稀疏梯度更新。第三种算法代表具有随机投影的镜像下降算法。我们证明了这些方法的收敛速度稀疏问题以及数值实验支持其有效性。

英文摘要:

In this paper, we propose three methods to solve the PageRank problem for the transition matrices with both row and column sparsity. Our methods reduce the PageRank problem to the convex optimization problem over the simplex. The first algorithm is based on the gradient descent in L1 norm instead of the Euclidean one. The second algorithm extends the Frank-Wolfe to support sparse gradient updates. The third algorithm stands for the mirror descent algorithm with a randomized projection. We proof converges rates for these methods for sparse problems as well as numerical experiments support their effectiveness.

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

↑