贝叶斯BTL模型的贝叶斯风险下界及其在比较图中的应用
Lower Bounds on the Bayes Risk of the Bayesian BTL Model with Applications to Comparison Graphs
摘要:
我们考虑的问题,聚集成对比较,以获得一个共识的排名顺序的对象的集合。我们使用流行的Bradley-Terry-Luce(BTL)模型,该模型允许我们概率地描述对象之间的成对比较。特别是,我们采用贝叶斯BTL模型,它允许有意义的先验假设,并应付的情况下,对象的数量是大的,一些对象之间的比较的数量是小的,甚至为零。对于传统的贝叶斯BTL模型,我们推导出基于范数的失真函数估计量的贝叶斯风险的信息论下界。我们比较信息理论的下界与贝叶斯的Cramér-Rao下界,我们推导的情况下,贝叶斯风险的均方误差。我们说明了效用的界限,通过模拟比较他们的期望最大化为基础的推理算法提出的贝叶斯BTL模型的错误性能。我们绘制的BTL模型和玩家间的游戏表示为比较图中的边缘的成对比较之间的相似之处,并分析各种图形结构的下界的影响。我们还扩展了信息论和贝叶斯Cramér-Rao下界更一般的贝叶斯BTL模型,考虑到主场优势。
英文摘要:
We consider the problem of aggregating pairwise comparisons to obtain a consensus ranking order over a collection of objects. We use the popular Bradley-Terry-Luce (BTL) model which allows us to probabilistically describe pairwise comparisons between objects. In particular, we employ the Bayesian BTL model which allows for meaningful prior assumptions and to cope with situations where the number of objects is large and the number of comparisons between some objects is small or even zero. For the conventional Bayesian BTL model, we derive information-theoretic lower bounds on the Bayes risk of estimators for norm-based distortion functions. We compare the information-theoretic lower bound with the Bayesian Cramér-Rao lower bound we derive for the case when the Bayes risk is the mean squared error. We illustrate the utility of the bounds through simulations by comparing them with the error performance of an expectation-maximization based inference algorithm proposed for the Bayesian BTL model. We draw parallels between pairwise comparisons in the BTL model and inter-player games represented as edges in a comparison graph and analyze the effect of various graph structures on the lower bounds. We also extend the information-theoretic and Bayesian Cramér-Rao lower bounds to the more general Bayesian BTL model which takes into account home-field advantage.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。