Regularized Ranking with Convex Losses and ℓ1-Penalty
Joint Authors
Source
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-8, 8 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-12-05
Country of Publication
Egypt
No. of Pages
8
Main Subjects
Abstract 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.
American Psychological Association (APA)
Chen, Heng& Wu, Jitao. 2013. Regularized Ranking with Convex Losses and ℓ1-Penalty. Abstract and Applied Analysis،Vol. 2013, no. 2013, pp.1-8.
https://search.emarefa.net/detail/BIM-508814
Modern Language Association (MLA)
Chen, Heng& Wu, Jitao. Regularized Ranking with Convex Losses and ℓ1-Penalty. Abstract and Applied Analysis No. 2013 (2013), pp.1-8.
https://search.emarefa.net/detail/BIM-508814
American Medical Association (AMA)
Chen, Heng& Wu, Jitao. Regularized Ranking with Convex Losses and ℓ1-Penalty. Abstract and Applied Analysis. 2013. Vol. 2013, no. 2013, pp.1-8.
https://search.emarefa.net/detail/BIM-508814
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-508814
