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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7209 https://ink.library.smu.edu.sg/context/sis_research/article/8212/viewcontent/3460231.3474250.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Orthogonal inductive matrix completion
by: LEDENT, Antoine, et al.
Published: (2021) -
Recommendations with minimum exposure guarantees: A post-processing framework
by: LOPES, Ramon, et al.
Published: (2024) -
Multi-view hypergraph contrastive policy learning for conversational recommendation
by: ZHAO, Sen, et al.
Published: (2023) -
Uncertainty-adjusted recommendation via matrix factorization with weighted losses
by: ALVES, Rodrigo, et al.
Published: (2023) -
Online multi-task collaborative filtering for on-the-fly recommender systems
by: WANG, Jialei, et al.
Published: (2013)