1 paper
Kamyar Azizzadenesheli, Trung Dang, Aranyak Mehta +2
We study a fundamental problem in optimization under uncertainty. There are n boxes; each box i contains a hidden reward xi. Rewards are drawn i.i.d. from an unknown distrib…