0


BoltzRank:学习最大化预期排名增益

BoltzRank: Learning to Maximize Expected Ranking Gain
课程网址: http://videolectures.net/icml09_volkovs_blmerg/  
主讲教师: Maksims Volkovs
开课单位: 多伦多大学
开课时间: 2009-08-26
课程语种: 英语
中文简介:
根据查询与查询的相关性对一组检索到的文档进行排序是信息检索中的常见问题。学习排名函数的方法很难优化,因为排名表现通常由不平滑的指标来判断。在本文中,我们提出了一种新的列表方法来学习排名。我们的方法在分配给给定查询的文档的排名上创建条件概率分布,这允许对某些性能度量的期望值进行梯度上升优化。秩概率采用玻尔兹曼分布的形式,基于能量函数,该能量函数取决于由个体和成对电势组成的评分函数。包括成对电位是一种新颖的贡献,允许模型在文档的相对分数中编码规律;现有模型仅在单个文档的基础上在测试时分配分数,文档之间没有成对约束。 LETOR3.0数据集的实验结果表明,我们的方法执行现有的排名学习方法。
课程简介: Ranking a set of retrieved documents according to their relevance to a query is a popular problem in information retrieval. Methods that learn ranking functions are difficult to optimize, as ranking performance is typically judged by metrics that are not smooth. In this paper we propose a new listwise approach to learning to rank. Our method creates a conditional probability distribution over rankings assigned to documents for a given query, which allows for gradient ascent optimization of the expected value of some performance measure. The rank probabilities take the form of a Boltzmann distribution, based on an energy function that depends on a scoring function composed of individual and pairwise potentials. Including pairwise potentials is a novel contribution, allowing the model to encode regularities in the relative scores of documents; existing models assign scores at test time based only on individual documents, with no pairwise constraints between documents. Experimental results on the LETOR3.0 data sets show that our method out-performs existing learning approaches to ranking.
关 键 词: 信息检索; 排名函数; 概率分布
课程来源: 视频讲座网
最后编审: 2019-04-24:lxf
阅读次数: 140