Burst-induced Multi-Armed Bandit for learning recommendation
In this paper, we introduce a non-stationary and context-free Multi-Armed Bandit (MAB) problem and a novel algorithm (which we refer to as BMAB) to solve it. The problem is context-free in the sense that no side information about users or items is needed. We work in a continuous-time setting where e...
Saved in:
Main Authors: | ALVES, Rodrigo, LEDENT, Antoine, KLOFT, Marius |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2021
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/7209 https://ink.library.smu.edu.sg/context/sis_research/article/8212/viewcontent/3460231.3474250.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Orthogonal inductive matrix completion
由: LEDENT, Antoine, et al.
出版: (2021) -
Recommendations with minimum exposure guarantees: A post-processing framework
由: LOPES, Ramon, et al.
出版: (2024) -
Multi-view hypergraph contrastive policy learning for conversational recommendation
由: ZHAO, Sen, et al.
出版: (2023) -
Uncertainty-adjusted recommendation via matrix factorization with weighted losses
由: ALVES, Rodrigo, et al.
出版: (2023) -
Context Modeling for Ranking and Tagging Bursty Features in Text Streams
由: ZHAO, Xin, et al.
出版: (2010)