Abstract: In the present paper, we give an investigation on the quantitative convergence analysis of the kernel regularized vector ranking with least square loss. We present with Gȃteaux derivative the qualitative relation between the solution and the hiding distribution and quantitatively show the robustness for the solution. Finally, we provide a learning rate in terms of the approximation ability and capacity of the involved vector-valued RKHS.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
Liu Huanxiang, Sheng Baohuai, Ye Peixin, "The Learning Rate of Vector-Valued Ranking with Least Square Loss," WSEAS Transactions on Mathematics, vol. 14, pp. 364-375, 2015, DOI:
Liu Huanxiang, Sheng Baohuai, Ye Peixin. The Learning Rate of Vector-Valued Ranking with Least Square Loss.
WSEAS Transactions on Mathematics. 2015;14:364-375.