TL;DR
This paper introduces a decision tree-based approach for conversational recommender systems, offering an interpretable, data-efficient alternative to deep reinforcement learning that effectively manages multi-turn interactions and improves recommendation quality.
Contribution
The paper demonstrates that decision trees can effectively handle key CRS challenges, providing a simpler, interpretable, and competitive alternative to complex deep learning methods.
Findings
Significant performance improvements over state-of-the-art CRS methods.
Effective question selection and item ranking using decision tree embeddings.
Robust handling of negative feedback and early stopping for recommendations.
Abstract
Conversational recommender systems (CRS) dynamically obtain the user preferences via multi-turn questions and answers. The existing CRS solutions are widely dominated by deep reinforcement learning algorithms. However, deep reinforcement learning methods are often criticised for lacking interpretability and requiring a large amount of training data to perform. In this paper, we explore a simpler alternative and propose a decision tree based solution to CRS. The underlying challenge in CRS is that the same item can be described differently by different users. We show that decision trees are sufficient to characterize the interactions between users and items, and solve the key challenges in multi-turn CRS: namely which questions to ask, how to rank the candidate items, when to recommend, and how to handle negative feedback on the recommendations. Firstly, the training of decision trees…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsEarly Stopping
