Broaden your SCOPE! Efficient Multi-turn Conversation Planning for LLMs with Semantic Space
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) are used in chatbots or AI assistants to hold conversations with a human user. In such applications, the quality (e.g., user engagement, safety) of a conversation is important and can only be exactly known at the end of the conversation. To maximize its expected quality, conversation planning reasons about the stochastic transitions within a conversation to select the optimal LLM response at each turn. Existing simulation-based conversation planning algorithms typically select the optimal response by simulating future conversations with a large number of LLM queries at every turn. However, this process is extremely time-consuming and hence impractical for real-time conversations. This paper presents a novel approach called Semantic space COnversation Planning with improved Efficiency (SCOPE) that exploits the dense semantic representation of conversations to perform conversation planning efficiently. In particular, SCOPE models the stochastic transitions in conversation semantics and their associated rewards to plan entirely within the semantic space. This allows us to select the optimal LLM response at every conversation turn without needing additional LLM queries for simulation. As a result, SCOPE can perform conversation planning 70 times faster than conventional simulation-based planning algorithms when applied to a wide variety of conversation starters and two reward functions seen in the real world, yet achieving a higher reward within a practical planning budget. Our code can be found at: https://github.com/chenzhiliang94/convo-plan-SCOPE.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 34 of its 52 references that are in the map. First posted on arXiv 14 Mar 2025.
Builds on
34 of 52 references.
References · 34
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2023Tree of Thoughts: Deliberate Problem Solving with Large Language Modelscited by 3,211
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
- 2018Experience Replay for Continual Learningcited by 1,095
- 2023Large Language Models as Optimizerscited by 864
- 2023Reasoning with Language Model is Planning with World Modelcited by 861
- 2017DailyDialog: A Manually Labelled Multi-turn Dialogue Datasetcited by 652
22 more
- 2023Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Modelscited by 574
- 2023LMSYS-Chat-1M: A Large-Scale Real-World LLM Conversation Datasetcited by 461
- 2016Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Modelscited by 301
- 2023Large Language Models as Commonsense Knowledge for Large-Scale Task Planningcited by 231
- 2023Text2Reward: Reward Shaping with Language Models for Reinforcement Learningcited by 160
- 2024Tree Search for Language Model Agentscited by 151
- 2019Overcoming Limitations of Mixture Density Networks: A Sampling and Fitting Framework for Multimodal Future Predictioncited by 96
- 2024Gecko: Versatile Text Embeddings Distilled from Large Language Modelscited by 83
- 2024A Complete Survey on LLM-based AI Chatbotscited by 71
- 2023Prompt-Based Monte-Carlo Tree Search for Goal-Oriented Dialogue Policy Planningcited by 61
- 2022Reinforcement Learning with Sparse Rewards using Guidance from Offline Demonstrationcited by 54
- 2020Discount Factor as a Regularizer in Reinforcement Learningcited by 45
- 2024Prompt Optimization with EASE? Efficient Ordering-aware Automated Selection of Exemplarscited by 37
- 2023Use Your INSTINCT: INSTruction optimization for LLMs usIng Neural bandits Coupled with Transformerscited by 30
- 2023Improving the Reliability of Large Language Models by Leveraging Uncertainty-Aware In-Context Learningcited by 29
- 2024Prototypical Reward Network for Data-Efficient RLHFcited by 22
- 2024Dipper: Diversity in Prompts for Producing Large Language Model Ensembles in Reasoning taskscited by 22
- 2018Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithmscited by 13
- 2025DUET: Optimizing Training Data Mixtures via Feedback from Unseen Evaluation Taskscited by 6
- 2025Group-robust Sample Reweighting for Subpopulation Shifts via Influence Functionscited by 6
- 2024DETAIL: Task DEmonsTration Attribution for Interpretable In-context Learningcited by 5
- 2021On the Evolution of the MCTS Upper Confidence Bounds for Trees by Means of Evolutionary Algorithms in the Game of Carcassonnecited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.