Two-Stage Neural Contextual Bandits for Personalised News Recommendation

• URL: http://arxiv.org/abs/2206.14648v1
• Date: Sun, 26 Jun 2022 12:07:56 GMT
• Title: Two-Stage Neural Contextual Bandits for Personalised News Recommendation
• Authors: Mengyan Zhang, Thanh Nguyen-Tang, Fangzhao Wu, Zhenyu He, Xing Xie, Cheng Soon Ong
• Abstract summary: Existing personalised news recommendation methods focus on exploiting user interests and ignores exploration in recommendation. We build on contextual bandits recommendation strategies which naturally address the exploitation-exploration trade-off. We use deep learning representations for users and news, and generalise the neural upper confidence bound (UCB) policies to generalised additive UCB and bilinear UCB.
• Score: 50.3750507789989
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of personalised news recommendation where each user consumes news in a sequential fashion. Existing personalised news recommendation methods focus on exploiting user interests and ignores exploration in recommendation, which leads to biased feedback loops and hurt recommendation quality in the long term. We build on contextual bandits recommendation strategies which naturally address the exploitation-exploration trade-off. The main challenges are the computational efficiency for exploring the large-scale item space and utilising the deep representations with uncertainty. We propose a two-stage hierarchical topic-news deep contextual bandits framework to efficiently learn user preferences when there are many news items. We use deep learning representations for users and news, and generalise the neural upper confidence bound (UCB) policies to generalised additive UCB and bilinear UCB. Empirical results on a large-scale news recommendation dataset show that our proposed policies are efficient and outperform the baseline bandit policies.

Related papers

• Neural Contextual Bandits for Personalized Recommendation [49.85090929163639]
  This tutorial investigates the contextual bandits as a powerful framework for personalized recommendations. We focus on the exploration perspective of contextual bandits to alleviate the Matthew Effect'' in recommender systems. In addition to the conventional linear contextual bandits, we will also dedicated to neural contextual bandits.
  arXiv  Detail & Related papers  (2023-12-21T17:03:26Z)
• DOR: A Novel Dual-Observation-Based Approach for News Recommendation Systems [2.7648976108201815]
  We propose a novel method to address the problem of news recommendation. Our approach is based on the idea of dual observation. By considering both the content of the news and the user's perspective, our approach is able to provide more personalised and accurate recommendations.
  arXiv  Detail & Related papers  (2023-02-02T22:16:53Z)
• IGNiteR: News Recommendation in Microblogging Applications (Extended Version) [3.2108350580418166]
  We propose a deep-learning based approach that is diffusion and influence-aware, called Influence-Graph News Recommender (IGNiteR) To represent the news, a multi-level attention-based encoder is used to reveal the different interests of users. We perform extensive experiments on two real-world datasets, showing that IGNiteR outperforms the state-of-the-art deep-learning based news recommendation methods.
  arXiv  Detail & Related papers  (2022-10-04T22:33:58Z)
• Neural News Recommendation with Event Extraction [0.0]
  A key challenge of online news recommendation is to help users find articles they are interested in. Traditional news recommendation methods usually use single news information, which is insufficient to encode news and user representation. We propose an Event Extraction-based News Recommendation framework to overcome these shortcomings.
  arXiv  Detail & Related papers  (2021-11-09T11:56:38Z)
• PipAttack: Poisoning Federated Recommender Systems forManipulating Item Promotion [58.870444954499014]
  A common practice is to subsume recommender systems under the decentralized federated learning paradigm. We present a systematic approach to backdooring federated recommender systems for targeted item promotion.
  arXiv  Detail & Related papers  (2021-10-21T06:48:35Z)
• Aspect-driven User Preference and News Representation Learning for News Recommendation [9.187076140490902]
  News recommender systems usually learn topic-level representations of users and news for recommendation. We propose a novel Aspect-driven News Recommender System (ANRS) built on aspect-level user preference and news representation learning.
  arXiv  Detail & Related papers  (2021-10-12T07:38:54Z)
• Fairness-Aware Explainable Recommendation over Knowledge Graphs [73.81994676695346]
  We analyze different groups of users according to their level of activity, and find that bias exists in recommendation performance between different groups. We show that inactive users may be more susceptible to receiving unsatisfactory recommendations, due to insufficient training data for the inactive users. We propose a fairness constrained approach via re-ranking to mitigate this problem in the context of explainable recommendation over knowledge graphs.
  arXiv  Detail & Related papers  (2020-06-03T05:04:38Z)
• Reward Constrained Interactive Recommendation with Natural Language Feedback [158.8095688415973]
  We propose a novel constraint-augmented reinforcement learning (RL) framework to efficiently incorporate user preferences over time. Specifically, we leverage a discriminator to detect recommendations violating user historical preference. Our proposed framework is general and is further extended to the task of constrained text generation.
  arXiv  Detail & Related papers  (2020-05-04T16:23:34Z)
• A Survey on Knowledge Graph-Based Recommender Systems [65.50486149662564]
  We conduct a systematical survey of knowledge graph-based recommender systems. We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation. We introduce datasets used in these works.
  arXiv  Detail & Related papers  (2020-02-28T02:26:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.