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: | CAO, Wei, LI, Jian, TAO, Yufei, LI, Zhize |
---|---|
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 |
Similar Items
-
Avoiding starvation of arms in restless multi-armed bandit
by: LI, Dexun, et al.
Published: (2023) -
Avoiding starvation of arms in restless multi-armed bandit
by: LI, Dexun, et al.
Published: (2023) -
Dynamic Clustering of Contextual Multi-Armed Bandits
by: NGUYEN, Trong T., et al.
Published: (2014) -
Efficient resource allocation with fairness constraints in restless multi-armed bandits
by: LI, Dexun, et al.
Published: (2022) -
A Graph Method for Keyword-based Selection of the top-K Databases
by: Vu, Q.H., et al.
Published: (2013)