Approximation Analysis of Gradient Descent Algorithm for Bipartite Ranking
Joint Authors
Chen, Hong
He, Fangchao
Pan, Zhibin
Source
Journal of Applied Mathematics
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-13, 13 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-07-14
Country of Publication
Egypt
No. of Pages
13
Main Subjects
Abstract EN
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 the step size.
The result fills the theoretical gap in learning rates for ranking problem with general convex losses.
American Psychological Association (APA)
Chen, Hong& He, Fangchao& Pan, Zhibin. 2012. Approximation Analysis of Gradient Descent Algorithm for Bipartite Ranking. Journal of Applied Mathematics،Vol. 2012, no. 2012, pp.1-13.
https://search.emarefa.net/detail/BIM-993024
Modern Language Association (MLA)
Chen, Hong…[et al.]. Approximation Analysis of Gradient Descent Algorithm for Bipartite Ranking. Journal of Applied Mathematics No. 2012 (2012), pp.1-13.
https://search.emarefa.net/detail/BIM-993024
American Medical Association (AMA)
Chen, Hong& He, Fangchao& Pan, Zhibin. Approximation Analysis of Gradient Descent Algorithm for Bipartite Ranking. Journal of Applied Mathematics. 2012. Vol. 2012, no. 2012, pp.1-13.
https://search.emarefa.net/detail/BIM-993024
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-993024