arXiv:2009.13181
Position-Based Multiple-Play Bandits with Thompson Sampling
원문 초록
Multiple-play bandits aim at displaying relevant items at relevant positions on a web page. We introduce a new bandit-based algorithm, PB-MHB, for online recommender systems which uses the Thompson sampling framework. This algorithm handles a display setting governed by the position-based model. Our sampling method does not require as input the probability of a user to look at a given position in the web page which is, in practice, very difficult to obtain. Experiments on simulated and real datasets show that our method, with fewer prior information, deliver better recommendations than state-of-the-art algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Journalism-Guided Agentic In-Context Learning for News Stance Detection
A Reproducibility Study of Product-side Fairness in Bundle Recommendation
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
Boosting Parameter Efficiency in LLM-Based Recommendation through Sophisticated Pruning
Kamae: Bridging Spark and Keras for Seamless ML Preprocessing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.