Comparison-based Conversational Recommender System with Relative Bandit Feedback

• URL: http://arxiv.org/abs/2208.09837v1
• Date: Sun, 21 Aug 2022 08:05:46 GMT
• Title: Comparison-based Conversational Recommender System with Relative Bandit Feedback
• Authors: Zhihui Xie, Tong Yu, Canzhe Zhao, Shuai Li
• Abstract summary: We propose a novel comparison-based conversational recommender system. We propose a new bandit algorithm, which we call RelativeConUCB. The experiments on both synthetic and real-world datasets validate the advantage of our proposed method.
• Score: 15.680698037463488
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the recent advances of conversational recommendations, the recommender system is able to actively and dynamically elicit user preference via conversational interactions. To achieve this, the system periodically queries users' preference on attributes and collects their feedback. However, most existing conversational recommender systems only enable the user to provide absolute feedback to the attributes. In practice, the absolute feedback is usually limited, as the users tend to provide biased feedback when expressing the preference. Instead, the user is often more inclined to express comparative preferences, since user preferences are inherently relative. To enable users to provide comparative preferences during conversational interactions, we propose a novel comparison-based conversational recommender system. The relative feedback, though more practical, is not easy to be incorporated since its feedback scale is always mismatched with users' absolute preferences. With effectively collecting and understanding the relative feedback from an interactive manner, we further propose a new bandit algorithm, which we call RelativeConUCB. The experiments on both synthetic and real-world datasets validate the advantage of our proposed method, compared to the existing bandit algorithms in the conversational recommender systems.

Related papers

• Beyond Positive History: Re-ranking with List-level Hybrid Feedback [49.52149227298746]
  We propose Re-ranking with List-level Hybrid Feedback (dubbed RELIFE) It captures user's preferences and behavior patterns with three modules. Experiments show that RELIFE significantly outperforms SOTA re-ranking baselines.
  arXiv  Detail & Related papers  (2024-10-28T06:39:01Z)
• Conversational Dueling Bandits in Generalized Linear Models [45.99797764214125]
  We introduce relative feedback-based conversations into conversational recommendation systems. We propose a novel conversational dueling bandit algorithm called ConDuel. We also demonstrate the potential to extend our algorithm to multinomial logit bandits with theoretical and experimental guarantees.
  arXiv  Detail & Related papers  (2024-07-26T03:43:10Z)
• Rethinking the Evaluation of Dialogue Systems: Effects of User Feedback on Crowdworkers and LLMs [57.16442740983528]
  In ad-hoc retrieval, evaluation relies heavily on user actions, including implicit feedback. The role of user feedback in annotators' assessment of turns in a conversational perception has been little studied. We focus on how the evaluation of task-oriented dialogue systems ( TDSs) is affected by considering user feedback, explicit or implicit, as provided through the follow-up utterance of a turn being evaluated.
  arXiv  Detail & Related papers  (2024-04-19T16:45:50Z)
• Hierarchical Conversational Preference Elicitation with Bandit Feedback [36.507341041113825]
  We formulate a new conversational bandit problem that allows the recommender system to choose either a key-term or an item to recommend at each round. We conduct a survey and analyze a real-world dataset to find that, unlike assumptions made in prior works, key-term rewards are mainly affected by rewards of representative items. We propose two bandit algorithms, Hier-UCB and Hier-LinUCB, that leverage this observed relationship and the hierarchical structure between key-terms and items.
  arXiv  Detail & Related papers  (2022-09-06T05:35:24Z)
• Discovering Personalized Semantics for Soft Attributes in Recommender Systems using Concept Activation Vectors [34.56323846959459]
  Interactive recommender systems allow users to express intent, preferences, constraints, and contexts in a richer fashion. One challenge is inferring a user's semantic intent from the open-ended terms or attributes often used to describe a desired item. We develop a framework to learn a representation that captures the semantics of such attributes and connects them to user preferences and behaviors in recommender systems.
  arXiv  Detail & Related papers  (2022-02-06T18:45:15Z)
• Learning to Ask Appropriate Questions in Conversational Recommendation [49.31942688227828]
  We propose the Knowledge-Based Question Generation System (KBQG), a novel framework for conversational recommendation. KBQG models a user's preference in a finer granularity by identifying the most relevant relations from a structured knowledge graph. Finially, accurate recommendations can be generated in fewer conversational turns.
  arXiv  Detail & Related papers  (2021-05-11T03:58:10Z)
• Measuring Recommender System Effects with Simulated Users [19.09065424910035]
  Popularity bias and filter bubbles are two of the most well-studied recommender system biases. We offer a simulation framework for measuring the impact of a recommender system under different types of user behavior.
  arXiv  Detail & Related papers  (2021-01-12T14:51:11Z)
• Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users [111.28351584726092]
  We consider the conversational recommendation for cold-start users, where a system can both ask the attributes from and recommend items to a user interactively. Our Conversational Thompson Sampling (ConTS) model holistically solves all questions in conversational recommendation by choosing the arm with the maximal reward to play.
  arXiv  Detail & Related papers  (2020-05-23T08:56:37Z)
• 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 Bayesian Approach to Conversational Recommendation Systems [60.12942570608859]
  We present a conversational recommendation system based on a Bayesian approach. A case study based on the application of this approach to emphstagend.com, an online platform for booking entertainers, is discussed.
  arXiv  Detail & Related papers  (2020-02-12T15:59:31Z)

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.