Approximation analysis of gradient descent algorithm for bipartite ranking (Q1760585)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation analysis of gradient descent algorithm for bipartite ranking |
scientific article; zbMATH DE number 6106136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation analysis of gradient descent algorithm for bipartite ranking |
scientific article; zbMATH DE number 6106136 |
Statements
Approximation analysis of gradient descent algorithm for bipartite ranking (English)
0 references
15 November 2012
0 references
Summary: 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.
0 references
gradient descent algorithm
0 references
bipartite ranking
0 references
learning rates
0 references
0 references
0.8444404006004333
0 references
0.7946377396583557
0 references
0.7931137681007385
0 references
0.7785956263542175
0 references
