|
|
|
|
Approximation analysis of gradient descent algorithm for bipartite ranking
|
|
|
|
|
|
|
|
نویسنده
|
chen h. ,he f. ,pan z.
|
|
منبع
|
journal of applied mathematics - 2012 - دوره : 2012 - شماره : 0
|
|
چکیده
|
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. copyright © 2012 hong chen et al.
|
|
|
|
|
آدرس
|
college of science,huazhong agricultural university, China, school of science,hubei university of technology,wuhan 430068,china,faculty of mathematics and computer science,hubei university, China, college of science,huazhong agricultural university, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|