Approximation Analysis of Gradient Descent Algorithm for Bipartite Ranking
We introduce a gradient descent algorithm for bipartite ranking with general convex losses. The implementation of this algorithm is simple, and its generalization performance is investigated. Explicit learning rates are presented in terms of the suitable choices of the regularization parameter and t...
Main Authors: | Hong Chen, Fangchao He, Zhibin Pan |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/189753 |
Similar Items
-
Bipartite RankBoost+: An Improvement to Bipartite RankBoost
by: Zhang, Ganqin
Published: (2021) -
Inertial Gradient-Descent algorithms for convex minimization
by: Apidopoulos, Vasileios
Published: (2019) -
An Efficient Algorithm for the Vertex Ranking Problem on Proper Bipartite Permutation Graphs
by: Ching-Yuan Cheng, et al.
Published: (2003) -
Approximated least-squares solutions of a generalized Sylvester-transpose matrix equation via gradient-descent iterative algorithm
by: Adisorn Kittisopaporn, et al.
Published: (2021-05-01) -
Statistical Consistency of Ranking:Bipartite and Multipartite Cases
by: Uematsu, Kazuki
Published: (2012)