Approximation analysis of gradient descent algorithm for bipartite ranking (Q1760585): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2012/189753 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087890465 / rank | |||
Normal rank | |||
Revision as of 19:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation analysis of gradient descent algorithm for bipartite ranking |
scientific article |
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
