.png){kind=icon}
返回
THE MULTI-ARMED BANDIT PROBLEM: AN EFFICIENT NONPARAMETRIC SOLUTION
.png){kind=icon}
OA
AI
DOI：10.1214/19-AOS1809.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Lai and Robbins (Adv. in Appl. Math. 6 (1985) 4-22) and Lai (Ann. Statist. 15 (1987) 1091-1114) provided efficient parametric solutions to the multi-armed bandit problem, showing that arm allocation via upper confidence bounds (UCB) achieves minimum regret. These bounds are constructed from the Kullback-Leibler information of the reward distributions, estimated from specified parametric families. In recent years, there has been renewed interest in the multi-armed bandit problem due to new applications in machine learning algorithms and data analytics. Nonparametric arm allocation procedures like epsilon-greedy, Boltzmann exploration and BESA were studied, and modified versions of the UCB procedure were also analyzed under nonparametric settings. However, unlike UCB these nonparametric procedures are not efficient under general parametric settings. In this paper, we propose efficient nonparametric procedures.
Keyword:
Efficiency
KL-UCB
subsampling
Thompson sampling
UCB
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
分享收藏Correction: Clinical Applicability and Cutoff Values for an Unstructured Neuropsychological Assessment Protocol for Older Adults with Low Formal Education.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏DFT Investigation on the Electronic, Magnetic, Mechanical Properties and Strain Effects of the Quaternary Compound Cu2FeSnS4Crystals
OAAI
CrystalsIF0
OAAI分享收藏KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATIONANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏
查看更多内容