BriefGPT.xyz
Feb, 2018
粗排名自适应采样
Adaptive Sampling for Coarse Ranking
HTML
PDF
Sumeet Katariya, Lalit Jain, Nandana Sengupta, James Evans, Robert Nowak
TL;DR
研究了活动粗聚类排序的问题,提出了一种计算有效的PAC算法LUCBRank,探讨了其样本复杂性的上限和下限,并在实验中发现LUCBRank比现有的基线方法表现更好。
Abstract
We consider the problem of
active coarse ranking
, where the goal is to sort items according to their means into clusters of pre-specified sizes, by adaptively sampling from their
reward distributions
. This settin
→