Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods

In this paper, we consider a non-convex loss-minimization problem of learning Supervised PageRank models, which can account for features of nodes and edges. We propose gradient-based and random gradient-free methods to solve this problem. Our algorithms are based on the concept of an inexact oracle and unlike the state-of-the-art gradient-based method we manage to provide theoretically the convergence rate guarantees for both of them. Finally, we compare the performance of the proposed optimization methods with the state of the art applied to a ranking task.

Authors

• Lev Bogolubsky Yandex, Moscow State University
• Pavel Dvurechenskii
• Alexander Gasnikov Research Center of the Artificial Intelligence Institute, Innopolis University, Innopolis, Russia MIPT ISP RAS
• Gleb Gusev
• Yurii Nesterov
• Andrei Raigorodskii Moscow Institute of Physics and Technology
• Aleksey Tikhonov
• Maksim Zhukovskii

Keywords

No keywords are indexed for this paper.