arXiv:2509.23166cs.CL2025-09被引 3

让大模型在对话中实时自我修正,提升长对话表现。

Test-Time Policy Adaptation for Enhanced Multi-Turn Interactions with LLMs

  • 用用户反馈当奖励信号,动态调整模型参数以匹配偏好。
  • 单步更新即可逼近最优策略,比传统方法快且省资源。
  • 适合需要持续优化的交互式应用,如智能客服、助手。

大型语言模型通常采用多轮交互完成复杂任务,但其在长时间对话中性能易下降,因训练数据为静态单轮数据,难以适应实时用户反馈。为此,我们提出测试时策略自适应框架(T2PAM),利用正在进行的交互中的用户反馈作为奖励信号,估计与用户偏好对齐的潜在最优策略,并仅更新少量参数以引导模型向该策略靠拢,实现高效对话内自纠正。进一步提出轻量级算法ROSA,通过单步更新将模型参数导向理论最优策略,避免昂贵的迭代梯度优化,显著降低计算开销。理论分析证明,随着交互轮次增加,ROSA的策略收敛于用户偏好。大量实验证明,ROSA在挑战性基准上显著提升了任务有效性与效率。

原文摘要 · Abstract (English)

Large Language Models (LLMs) employ multi-turn interaction as a fundamental paradigm for completing complex tasks. However, their performance often degrades in extended interactions, as they are typically trained on static, single-turn data, which hinders their ability to adapt to real-time user feedback. To address this limitation, we first propose a new paradigm: Test-Time Policy Adaptation for Multi-Turn Interactions (T2PAM), which utilizes user feedback from the ongoing interaction as a reward signal to estimate a latent optimal policy aligned with user preferences, then updates a small subset of parameters to steer the model toward this policy, ultimately enabling efficient in-conversation self-correction. We then introduce Optimum-Referenced One-Step Adaptation (ROSA), a lightweight algorithm that operationalizes T2PAM. ROSA guides the model parameters toward a theoretical optimal policy in a single, efficient update step, avoiding costly iterative gradient-based optimization and minimizing computational overhead. We provide a rigorous theoretical analysis guaranteeing that the policy of ROSA converges to the preference of user as the number of interactions increases. Extensive experiments on challenging benchmark demonstrate that ROSA achieves significant improvements in both task effectiveness and efficiency.

大模型对话系统自适应强化学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。