Fast distributed bandits for online recommendation systems

K Mahadik, Q Wu, S Li, A Sabne - Proceedings of the 34th ACM …, 2020 - dl.acm.org
Contextual bandit algorithms are commonly used in recommender systems, where content
popularity can change rapidly. These algorithms continuously learn latent mappings
between users and items, based on contexts associated with them both. Recent
recommendation algorithms that learn clustering or social structures between users have
exhibited higher recommendation accuracy. However, as the number of users and items in
the environment increases, the time required to generate recommendations deteriorates …

Fast Distributed Bandits for Online Recommendation Systems

A Sabne, K Mahadik, Q Wu, S Li - 2019 - research.google
Contextual bandit algorithms are commonly used in recommender systems, where content
popularity can change rapidly. These algorithms continuously learn good mappings
between users and items, based on contexts associated with both the users and items.
Recent recommendation algorithms that learn clustering or social structures between users
have exhibited higher recommendation accuracy. However, as the number of users and
items in the environment increases, the time required to generate recommendations …
以上显示的是最相近的搜索结果。 查看全部搜索结果