SAPIENT: Mastering Multi-turn Conversational Recommendation with Strategic Planning and Monte Carlo Tree Search

Hanwen Du, Bo Peng, Xia Ning
10/12/2024
cs.CL

Official code: ninglab/SAPIENT (1 star, last commit 2025-01-22).

Abstract

Conversational Recommender Systems (CRS) proactively engage users in interactive dialogues to elicit user preferences and provide personalized recommendations. Existing methods train Reinforcement Learning (RL)-based agent with greedy action selection or sampling strategy, and may suffer from suboptimal conversational planning. To address this, we present a novel Monte Carlo Tree Search (MCTS)-based CRS framework SAPIENT. SAPIENT consists of a conversational agent (S-agent) and a conversational planner (S-planner). S-planner builds a conversational search tree with MCTS based on the initial actions proposed by S-agent to find conversation plans. The best conversation plans from S-planner are used to guide the training of S-agent, creating a self-training loop where S-agent can iteratively improve its capability for conversational planning. Furthermore, we propose an efficient variant SAPIENT for trade-off between training efficiency and performance. Extensive experiments on four benchmark datasets validate the effectiveness of our approach, showing that SAPIENT outperforms the state-of-the-art baselines. Our code and data are accessible through https://github.com/ninglab/SAPIENT.

View on arXivView PDF

Code Implementations(1)

ninglab/SAPIENTOfficial100%
10PythonNov 7, 20241 years ago

Cite this paper

@article{du2024sapient,
  title  = {SAPIENT: Mastering Multi-turn Conversational Recommendation with Strategic Planning and Monte Carlo Tree Search},
  author = {Hanwen Du and Bo Peng and Xia Ning},
  year   = {2024},
  eprint = {2410.09580},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.09580v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.09580.svg)](https://codeofpaper.com/paper/2410.09580)

Discussion