Fourteenth ACM Conference on Recommender Systems 2020
DOI: 10.1145/3383313.3412209
|View full text |Cite
|
Sign up to set email alerts
|

Contextual Meta-Bandit for Recommender Systems Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 19 publications
0
0
0
Order By: Relevance
“…Similarly, we need to consider the impact on the user experience if fairness affects relevance and satisfaction [26]. In a real scenario, the best approach would be to use contextual MABs based on deep learning [34] and/or meta-bandits [35], but for that we need to understand first the trade-offs involved. Future work includes using additional (larger) data sets with even more dynamic scenarios including adding new users and new items, as well as other distributions that may improve the balance between the knowledge of the real world and revenue.…”
Section: Discussionmentioning
confidence: 99%
“…Similarly, we need to consider the impact on the user experience if fairness affects relevance and satisfaction [26]. In a real scenario, the best approach would be to use contextual MABs based on deep learning [34] and/or meta-bandits [35], but for that we need to understand first the trade-offs involved. Future work includes using additional (larger) data sets with even more dynamic scenarios including adding new users and new items, as well as other distributions that may improve the balance between the knowledge of the real world and revenue.…”
Section: Discussionmentioning
confidence: 99%