BriefGPT.xyz
Jun, 2023
流式赌博问题的紧凑内存遗憾下界
Tight Memory-Regret Lower Bounds for Streaming Bandits
HTML
PDF
Shaoang Li, Lan Zhang, Junhao Wang, Xiang-Yang Li
TL;DR
这篇论文研究了流式赌博机问题,建立了时间上界、臂数、游戏轮数的算法紧确的最劣后悔下限,并证明了与分析算法复杂度上限的样本复杂性分析问题的关系。
Abstract
In this paper, we investigate the
streaming bandits
problem, wherein the learner aims to minimize
regret
by dealing with online arriving arms and sublinear
→