Skip to Main content Skip to Navigation
Conference papers

Efficient Parallel Algorithms for Linear RankSVM on GPU

Abstract : Linear RankSVM is one of the widely used methods for learning to rank. Although using Order-Statistic Tree (OST) and Trust Region Newton Methods (TRON) are effective to train linear RankSVM on CPU, it becomes less effective when dealing with large-scale training data sets. Furthermore, linear RankSVM training with L2-loss contains quite amount of matrix manipulations in comparison with that with L1-loss, so it has great potential for achieving parallelism on GPU. In this paper, we design efficient parallel algorithms on GPU for the linear RankSVM training with L2-loss based on different queries. The experimental results show that, compared with the state-of-the-art algorithms for the linear RankSVM training with L2-loss on CPU, our proposed parallel algorithm not only can significantly enhance the training speed but also maintain the high prediction accuracy.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 25, 2016 - 2:29:51 PM
Last modification on : Thursday, April 30, 2020 - 1:22:02 PM
Long-term archiving on: : Monday, March 27, 2017 - 8:48:34 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Jing Jin, Xiaola Lin. Efficient Parallel Algorithms for Linear RankSVM on GPU. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. pp.181-194, ⟨10.1007/978-3-662-44917-2_16⟩. ⟨hal-01403083⟩



Record views


Files downloads