Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics

no code implementations • NeurIPS 2020 • Aranyak Mehta, Uri Nadav, Alexandros Psomas, Aviad Rubinstein

We consider the fundamental problem of selecting $k$ out of $n$ random variables in a way that the expected highest or second-highest value is maximized.

Retrieval Vocal Bursts Intensity Prediction