2018
Adaptive Sampling for Coarse Ranking
AISTATS 2018poster
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 setting is useful in many social science applications involving human raters and the approxim…