On top-k selection in multi-armed bandits and hidden bipartite graphs
This paper discusses how to efficiently choose from $n$ unknown distributions the $k$ ones whose means are the greatest by a certain metric, up to a small relative error. We study the topic under two standard settings---multi-armed bandits and hidden bipartite graphs---which differ in the nature of...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2015
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/8671 https://ink.library.smu.edu.sg/context/sis_research/article/9674/viewcontent/NIPS15_full_MAB.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |