Generating Usage-related Questions for Preference Elicitation in Conversational Recommender Systems

• URL: http://arxiv.org/abs/2111.13463v2
• Date: Tue, 08 Apr 2025 13:25:51 GMT
• Title: Generating Usage-related Questions for Preference Elicitation in Conversational Recommender Systems
• Authors: Ivica Kostric, Krisztian Balog, Filip Radlinski,
• Abstract summary: We propose a novel approach to preference elicitation by asking implicit questions based on item usage.<n>We develop a high-quality labeled training dataset using crowdsourcing.<n>We show that our approaches are effective in generating elicitation questions, even with limited training data.
• Score: 19.950705852361565
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A key distinguishing feature of conversational recommender systems over traditional recommender systems is their ability to elicit user preferences using natural language. Currently, the predominant approach to preference elicitation is to ask questions directly about items or item attributes. Users searching for recommendations may not have deep knowledge of the available options in a given domain. As such, they might not be aware of key attributes or desirable values for them. However, in many settings, talking about the planned use of items does not present any difficulties, even for those that are new to a domain. In this paper, we propose a novel approach to preference elicitation by asking implicit questions based on item usage. As one of the main contributions of this work, we develop a multi-stage data annotation protocol using crowdsourcing, to create a high-quality labeled training dataset. Another main contribution is the development of four models for the question generation task: two template-based baseline models and two neural text-to-text models. The template-based models use heuristically extracted common patterns found in the training data, while the neural models use the training data to learn to generate questions automatically. Using common metrics from machine translation for automatic evaluation, we show that our approaches are effective in generating elicitation questions, even with limited training data. We further employ human evaluation for comparing the generated questions using both pointwise and pairwise evaluation designs. We find that the human evaluation results are consistent with the automatic ones, allowing us to draw conclusions about the quality of the generated questions with certainty. Finally, we provide a detailed analysis of cases where the models show their limitations.

Related papers

• Establishing Knowledge Preference in Language Models [80.70632813935644]
  Language models are known to encode a great amount of factual knowledge through pretraining. Such knowledge might be insufficient to cater to user requests. When answering questions about ongoing events, the model should use recent news articles to update its response. When some facts are edited in the model, the updated facts should override all prior knowledge learned by the model.
  arXiv  Detail & Related papers  (2024-07-17T23:16:11Z)
• Personalized Topic Selection Model for Topic-Grounded Dialogue [24.74527189182273]
  Current models tend to predict user-uninteresting and contextually irrelevant topics. We propose a textbfPersonalized topic stextbfElection model for textbfTopic-grounded textbfDialogue, named textbfPETD. Our proposed method can generate engaging and diverse responses, outperforming state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-06-04T06:09:49Z)
• Long-Span Question-Answering: Automatic Question Generation and QA-System Ranking via Side-by-Side Evaluation [65.16137964758612]
  We explore the use of long-context capabilities in large language models to create synthetic reading comprehension data from entire books. Our objective is to test the capabilities of LLMs to analyze, understand, and reason over problems that require a detailed comprehension of long spans of text.
  arXiv  Detail & Related papers  (2024-05-31T20:15:10Z)
• Learning Phonotactics from Linguistic Informants [54.086544221761486]
  Our model iteratively selects or synthesizes a data-point according to one of a range of information-theoretic policies. We find that the information-theoretic policies that our model uses to select items to query the informant achieve sample efficiency comparable to, or greater than, fully supervised approaches.
  arXiv  Detail & Related papers  (2024-05-08T00:18:56Z)
• Parameter-Efficient Conversational Recommender System as a Language Processing Task [52.47087212618396]
  Conversational recommender systems (CRS) aim to recommend relevant items to users by eliciting user preference through natural language conversation. Prior work often utilizes external knowledge graphs for items' semantic information, a language model for dialogue generation, and a recommendation module for ranking relevant items. In this paper, we represent items in natural language and formulate CRS as a natural language processing task.
  arXiv  Detail & Related papers  (2024-01-25T14:07:34Z)
• Sample Efficient Preference Alignment in LLMs via Active Exploration [63.84454768573154]
  We take advantage of the fact that one can often choose contexts at which to obtain human feedback to most efficiently identify a good policy. We propose an active exploration algorithm to efficiently select the data and provide theoretical proof that it has a worst-case regret bound. Our method outperforms the baselines with limited samples of human preferences on several language models and four real-world datasets.
  arXiv  Detail & Related papers  (2023-12-01T00:54:02Z)
• Talk the Walk: Synthetic Data Generation for Conversational Music Recommendation [62.019437228000776]
  We present TalkWalk, which generates realistic high-quality conversational data by leveraging encoded expertise in widely available item collections. We generate over one million diverse conversations in a human-collected dataset.
  arXiv  Detail & Related papers  (2023-01-27T01:54:16Z)
• Incorporating Relevance Feedback for Information-Seeking Retrieval using Few-Shot Document Re-Ranking [56.80065604034095]
  We introduce a kNN approach that re-ranks documents based on their similarity with the query and the documents the user considers relevant. To evaluate our different integration strategies, we transform four existing information retrieval datasets into the relevance feedback scenario.
  arXiv  Detail & Related papers  (2022-10-19T16:19:37Z)
• 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)
• Automatic Short Math Answer Grading via In-context Meta-learning [2.0263791972068628]
  We study the problem of automatic short answer grading for students' responses to math questions. We use MathBERT, a variant of the popular language model BERT adapted to mathematical content, as our base model. Second, we use an in-context learning approach that provides scoring examples as input to the language model.
  arXiv  Detail & Related papers  (2022-05-30T16:26:02Z)
• What should I Ask: A Knowledge-driven Approach for Follow-up Questions Generation in Conversational Surveys [63.51903260461746]
  We propose a novel task for knowledge-driven follow-up question generation in conversational surveys. We constructed a new human-annotated dataset of human-written follow-up questions with dialogue history and labeled knowledge. We then propose a two-staged knowledge-driven model for the task, which generates informative and coherent follow-up questions.
  arXiv  Detail & Related papers  (2022-05-23T00:57:33Z)
• Graph-based Extractive Explainer for Recommendations [38.278148661173525]
  We develop a graph attentive neural network model that seamlessly integrates user, item, attributes, and sentences for extraction-based explanation. To balance individual sentence relevance, overall attribute coverage, and content redundancy, we solve an integer linear programming problem to make the final selection of sentences.
  arXiv  Detail & Related papers  (2022-02-20T04:56:10Z)
• Conversational Search with Mixed-Initiative -- Asking Good Clarification Questions backed-up by Passage Retrieval [9.078765961879467]
  We deal with a scenario of conversational search with mixed-initiative: namely user-asks system-answers, as well as system-asks (clarification questions) and user-answers. We focus on the task of selecting the next clarification question, given conversation context. Our method leverages passage retrieval that is used both for an initial selection of relevant candidate clarification questions, as well as for fine-tuning two deep-learning models for re-ranking these candidates.
  arXiv  Detail & Related papers  (2021-12-14T11:27:16Z)
• Controllable Open-ended Question Generation with A New Question Type Ontology [6.017006996402699]
  We investigate the less-explored task of generating open-ended questions that are typically answered by multiple sentences. We first define a new question type ontology which differentiates the nuanced nature of questions better than widely used question words. We then propose a novel question type-aware question generation framework, augmented by a semantic graph representation.
  arXiv  Detail & Related papers  (2021-07-01T00:02:03Z)
• A Template-guided Hybrid Pointer Network for Knowledge-basedTask-oriented Dialogue Systems [15.654119998970499]
  We propose a template-guided hybrid pointer network for the knowledge-based task-oriented dialogue system. We design a memory pointer network model with a gating mechanism to fully exploit the semantic correlation between the retrieved answers and the ground-truth response.
  arXiv  Detail & Related papers  (2021-06-10T15:49:26Z)
• 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)
• A Survey on Neural Recommendation: From Collaborative Filtering to Content and Context Enriched Recommendation [70.69134448863483]
  Research in recommendation has shifted to inventing new recommender models based on neural networks. In recent years, we have witnessed significant progress in developing neural recommender models.
  arXiv  Detail & Related papers  (2021-04-27T08:03:52Z)
• Interactive Question Clarification in Dialogue via Reinforcement Learning [36.746578601398866]
  We propose a reinforcement model to clarify ambiguous questions by suggesting refinements of the original query. The model is trained using reinforcement learning with a deep policy network. We evaluate our model based on real-world user clicks and demonstrate significant improvements.
  arXiv  Detail & Related papers  (2020-12-17T06:38:04Z)
• 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)

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.