Regularized Ranking with Convex Losses and ℓ1-Penalty

الملخص EN

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.