arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.4282math.OC
收藏

用无约束最优化方法学习有监督的PageRank

Learning Supervised PageRank with Gradient-Free Optimization Methods

Lev Bogolubsky, Pavel Dvurechensky, Alexander Gasnikov, Gleb Gusev, Yurii Nesterov, Andrey Raigorodskii, Aleksey Tikhonov, Maxim Zhukovskii

摘要:

在本文中,我们考虑的问题,学习监督PageRank模型,它可以考虑一些经典的方法,如经典的PageRank算法没有考虑的属性。由于该最优化问题的隐维数很大,我们采用随机无梯度方法求解,证明了一个收敛定理,并估计了在给定精度下求解该问题所需的算术运算次数。我们找到的最佳设置的梯度免费的最优化方法的算术运算的数量方面需要达到给定的精度的目标。在本文中,我们将我们的算法应用到网页排名问题。我们考虑了用户行为的参数图模型,并通过我们的算法来评估网页与查询的相关性。实验表明,我们的最优化方法在排序质量上优于未调优的无梯度方法。

英文摘要:

In this paper, we consider a problem of learning supervised PageRank models, which can account for some properties not considered by classical approaches such as the classical PageRank algorithm. Due to huge hidden dimension of the optimization problem we use random gradient-free methods to solve it. We prove a convergence theorem and estimate the number of arithmetic operations needed to solve it with a given accuracy. We find the best settings of the gradient-free optimization method in terms of the number of arithmetic operations needed to achieve given accuracy of the objective. In the paper, we apply our algorithm to the web page ranking problem. We consider a parametric graph model of users' behavior and evaluate web pages' relevance to queries by our algorithm. The experiments show that our optimization method outperforms the untuned gradient-free method in the ranking quality.

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

↑