GBOSE:广义Bandit归一化半参数估计
GBOSE: Generalized Bandit Orthogonalized Semiparametric Estimation
摘要:
在顺序决策场景中,即,移动健康推荐系统收益管理上下文多臂Bandit算法因其性能而引起关注。但现有的大多数算法都是建立在严格参数化奖励模型的假设上的,大多数是线性的。在这项工作中,我们提出了一个新的算法与半参数奖励模型与现有的半参数算法之间的最先进的复杂性上界遗憾。我们的工作扩展了另一个具有代表性的算法的范围的国家的最先进的复杂性与类似的奖励模型,提出了一个算法建立在相同的动作过滤程序,但提供明确的动作选择分布的情况下,涉及两个以上的武器在一个特定的时间步长,同时需要更少的计算。我们推导出所述的复杂性上界的遗憾和目前的模拟结果,肯定我们的方法的优越性,所有流行的半参数强盗算法的情况下,涉及两个武器。
英文摘要:
In sequential decision-making scenarios i.e., mobile health recommendation systems revenue management contextual multi-armed bandit algorithms have garnered attention for their performance. But most of the existing algorithms are built on the assumption of a strictly parametric reward model mostly linear in nature. In this work we propose a new algorithm with a semi-parametric reward model with state-of-the-art complexity of upper bound on regret amongst existing semi-parametric algorithms. Our work expands the scope of another representative algorithm of state-of-the-art complexity with a similar reward model by proposing an algorithm built upon the same action filtering procedures but provides explicit action selection distribution for scenarios involving more than two arms at a particular time step while requiring fewer computations. We derive the said complexity of the upper bound on regret and present simulation results that affirm our methods superiority out of all prevalent semi-parametric bandit algorithms for cases involving over two arms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。