Context Uncertainty in Contextual Bandits with Applications to Recommender Systems

6Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

Recurrent neural networks have proven effective in modeling sequential user feedbacks for recommender systems. However, they usually focus solely on item relevance and fail to effectively explore diverse items for users, therefore harming the system performance in the long run. To address this problem, we propose a new type of recurrent neural networks, dubbed recurrent exploration networks (REN), to jointly perform representation learning and effective exploration in the latent space. REN tries to balance relevance and exploration while taking into account the uncertainty in the representations. Our theoretical analysis shows that REN can preserve the rate-optimal sublinear regret even when there exists uncertainty in the learned representations. Our empirical study demonstrates that REN can achieve satisfactory long-term rewards on both synthetic and real-world recommendation datasets, outperforming state-of-the-art models.

Cite

CITATION STYLE

APA

Wang, H., Ma, Y., Ding, H., & Wang, Y. (2022). Context Uncertainty in Contextual Bandits with Applications to Recommender Systems. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 8539–8547). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i8.20831

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free