图 书 馆
列表学习对排名算法的泛化分析Generalization Analysis of Listwise Learning-to-Rank Algorithms |
|
| 课程网址: | https://videolectures.net/videos/icml09_li_galltra |
| 主讲教师: | Hang Li |
| 开课单位: | 会议 |
| 开课时间: | 2009-08-26 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-to-rank algorithms have been proposed in recent years. Among them, the listwise approach has shown higher empirical ranking performance when compared to the other approaches. However, there is no theoretical study on the listwise approach as far as we know. In this paper, we propose a theoretical framework for ranking, which can naturally describe various listwise learning- to-rank algorithms. With this framework, we prove a theorem which gives a generalization bound of a listwise ranking algorithm, on the basis of Rademacher Average of the class of compound functions. The compound functions take listwise loss functions as outer functions and ranking models as inner functions. We then compute the Rademacher Averages for existing listwise algorithms of ListMLE, ListNet, and RankCosine. We also discuss the tightness of the bounds in different situations with regard to the list length and transformation function. |
| 关 键 词: | 列表学习; 排名算法; 泛化分析 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2025-04-25：liyq |
| 最后编审: | 2025-04-25：liyq |
| 阅读次数: | 7 |