Saved in:
Bibliographic Details
Main Authors: Chen, Jiangwang, Zhang, Bowen, Song, Zixin, Kang, Jiazheng, Yang, Xiao, Zhu, Da, Jiang, Guanjun
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.23668
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911709074030592
author Chen, Jiangwang
Zhang, Bowen
Song, Zixin
Kang, Jiazheng
Yang, Xiao
Zhu, Da
Jiang, Guanjun
author_facet Chen, Jiangwang
Zhang, Bowen
Song, Zixin
Kang, Jiazheng
Yang, Xiao
Zhu, Da
Jiang, Guanjun
contents Although large language model (LLM) conversational systems process millions of multi-turn dialogues daily, they remain fundamentally reactive: they respond only after the user types a query. A key step toward proactive interaction is next-query prediction, which anticipates the user's subsequent query based solely on the preceding dialogue. Progress on this task is hindered by the lack of dedicated benchmarks and a fundamental efficiency--quality trade-off: naively concatenating full dialogue history incurs linearly growing token consumption, while truncating to the latest turn discards crucial cross-turn context. Our key insight is that accurate prediction does not require re-reading raw history; it suffices to track the user's evolving intent trajectory across topics, unresolved needs, and interest shifts. We propose OnePred, which maintains a recursively updated memory as its sole cross-turn context, bounding the per-turn cost independently of conversation length. We train the model via a two-stage reinforcement learning pipeline that first teaches what to predict, then what to compress, shaping the memory into a prediction-oriented intent chain. To establish a rigorous testbed, we introduce NQP-Bench, spanning three diverse subsets. Experiments demonstrate that OnePred reduces per-turn token consumption by up to 22$\times$ compared to full-history inputs while consistently exceeding all baselines in prediction quality, with larger gains on longer conversations. Our code is publicly available at https://github.com/ZBWpro/OnePred.
format Preprint
id arxiv_https___arxiv_org_abs_2605_23668
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle OnePred: Next-Query Prediction via Recursive Intent Memory in Multi-Turn Conversations
Chen, Jiangwang
Zhang, Bowen
Song, Zixin
Kang, Jiazheng
Yang, Xiao
Zhu, Da
Jiang, Guanjun
Computation and Language
Artificial Intelligence
Although large language model (LLM) conversational systems process millions of multi-turn dialogues daily, they remain fundamentally reactive: they respond only after the user types a query. A key step toward proactive interaction is next-query prediction, which anticipates the user's subsequent query based solely on the preceding dialogue. Progress on this task is hindered by the lack of dedicated benchmarks and a fundamental efficiency--quality trade-off: naively concatenating full dialogue history incurs linearly growing token consumption, while truncating to the latest turn discards crucial cross-turn context. Our key insight is that accurate prediction does not require re-reading raw history; it suffices to track the user's evolving intent trajectory across topics, unresolved needs, and interest shifts. We propose OnePred, which maintains a recursively updated memory as its sole cross-turn context, bounding the per-turn cost independently of conversation length. We train the model via a two-stage reinforcement learning pipeline that first teaches what to predict, then what to compress, shaping the memory into a prediction-oriented intent chain. To establish a rigorous testbed, we introduce NQP-Bench, spanning three diverse subsets. Experiments demonstrate that OnePred reduces per-turn token consumption by up to 22$\times$ compared to full-history inputs while consistently exceeding all baselines in prediction quality, with larger gains on longer conversations. Our code is publicly available at https://github.com/ZBWpro/OnePred.
title OnePred: Next-Query Prediction via Recursive Intent Memory in Multi-Turn Conversations
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2605.23668