Open Access
2013 Regularized Ranking with Convex Losses and 1 -Penalty
Heng Chen, Jitao Wu
Abstr. Appl. Anal. 2013(SI32): 1-8 (2013). DOI: 10.1155/2013/927827


In the ranking problem, one has to compare two different observations and decide the ordering between them. It has received increasing attention both in the statistical and machine learning literature. This paper considers 1 -regularized ranking rules with convex loss. Under some mild conditions, a learning rate is established.


Download Citation

Heng Chen. Jitao Wu. "Regularized Ranking with Convex Losses and 1 -Penalty." Abstr. Appl. Anal. 2013 (SI32) 1 - 8, 2013.


Published: 2013
First available in Project Euclid: 26 February 2014

zbMATH: 07095500
MathSciNet: MR3139446
Digital Object Identifier: 10.1155/2013/927827

Rights: Copyright © 2013 Hindawi

Vol.2013 • No. SI32 • 2013
Back to Top