Learning rates for regularized least squares ranking algorithm
2017 ◽
Vol 15
(06)
◽
pp. 815-836
◽
Keyword(s):
The ranking problem aims at learning real-valued functions to order instances, which has attracted great interest in statistical learning theory. In this paper, we consider the regularized least squares ranking algorithm within the framework of reproducing kernel Hilbert space. In particular, we focus on analysis of the generalization error for this ranking algorithm, and improve the existing learning rates by virtue of an error decomposition technique from regression and Hoeffding’s decomposition for U-statistics.
2019 ◽
Vol 18
(01)
◽
pp. 49-78
◽
2016 ◽
Vol 14
(03)
◽
pp. 449-477
◽
2018 ◽
Vol 16
(04)
◽
pp. 1850025
◽
2009 ◽
Vol 07
(06)
◽
pp. 839-850
◽
2016 ◽
Vol 14
(06)
◽
pp. 763-794
◽
2019 ◽
Vol 17
(06)
◽
pp. 931-946
◽