arXiv:1606.02448

Multiple-Play Bandits in the Position-Based Model

Paul Lagrée, Claire Vernade, Olivier Cappé

제출 2016-06-08

원문 초록

Sequentially learning to place items in multi-position displays or lists is a task that can be cast into the multiple-play semi-bandit setting. However, a major concern in this context is when the system cannot decide whether the user feedback for each item is actually exploitable. Indeed, much of the content may have been simply ignored by the user. The present work proposes to exploit available information regarding the display position bias under the so-called Position-based click model (PBM). We first discuss how this model differs from the Cascade model and its variants considered in several recent works on multiple-play bandits. We then provide a novel regret lower bound for this model as well as computationally efficient algorithms that display good empirical and theoretical performance.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2507.10539공통 태그 model공식 코드 · Papers with Code

Graph World Model

토론

이 논문과 연결된 포럼 글이 아직 없습니다.