Regularized ranking with convex losses and \(\ell^1\)-penalty (Q2319268)
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: Regularized ranking with convex losses and \(\ell^1\)-penalty |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regularized ranking with convex losses and \(\ell^1\)-penalty |
scientific article |
Statements
Regularized ranking with convex losses and \(\ell^1\)-penalty (English)
0 references
16 August 2019
0 references
Summary: 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 \(\ell^1\)-regularized ranking rules with convex loss. Under some mild conditions, a learning rate is established.
0 references
0 references
