BLM-Rank: A Bayesian Linear Method for Learning to Rank and Its GPU Implementation

Huifeng GUO  Dianhui CHU  Yunming YE  Xutao LI  Xixian FAN  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E99-D   No.4   pp.896-905
Publication Date: 2016/04/01
Publicized: 2016/01/14
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2015DAP0001
Type of Manuscript: Special Section PAPER (Special Section on Data Engineering and Information Management)
Category: 
Keyword: 
ranking,  Bayesian Personalized Ranking,  stochastic gradient method,  GPU,  

Full Text: PDF(806.3KB)>>
Buy this Article




Summary: 
Ranking as an important task in information systems has many applications, such as document/webpage retrieval, collaborative filtering and advertising. The last decade has witnessed a growing interest in the study of learning to rank as a means to leverage training information in a system. In this paper, we propose a new learning to rank method, i.e. BLM-Rank, which uses a linear function to score samples and models the pairwise preference of samples relying on their scores under a Bayesian framework. A stochastic gradient approach is adopted to maximize the posterior probability in BLM-Rank. For industrial practice, we have also implemented the proposed algorithm on Graphic Processing Unit (GPU). Experimental results on LETOR have demonstrated that the proposed BLM-Rank method outperforms the state-of-the-art methods, including RankSVM-Struct, RankBoost, AdaRank-NDCG, AdaRank-MAP and ListNet. Moreover, the results have shown that the GPU implementation of the BLM-Rank method is ten-to-eleven times faster than its CPU counterpart in the training phase, and one-to-four times faster in the testing phase.