arXiv:2509.24696cs.LGcs.AI2025-09中稿 · ICML被引 5

无需微调,实时根据用户反馈个性化大模型输出。

T-POP: Test-Time Personalization with Online Preference Feedback

  • 利用在线偏好反馈动态学习用户喜好,不修改模型参数。
  • 测试时快速适应,少量交互即可显著提升个性化效果。
  • 适合需要即时个性化且无历史数据的新用户场景。

将大语言模型(LLM)个性化以匹配个体用户偏好是超越通用回答的关键步骤。然而,现有方法对新用户不友好:要么需耗时且资源密集的微调,要么依赖大量已有用户数据,导致严重的冷启动问题。为此,我们提出T-POP(Test-Time Personalization with Online Preference Feedback),一种通过生成过程中收集的在线成对偏好反馈实现实时个性化的全新范式。T-POP在不更新模型参数的前提下,结合测试时对齐与双人博弈(dueling bandits)算法,通过在线学习奖励函数来引导冻结模型的解码过程。借助双人博弈机制,T-POP智能地在探索用户偏好与利用已有知识之间取得平衡,高效生成个性化文本。大量实验表明,T-POP实现了快速、数据高效的个性化,在各项基准上显著优于现有方法,并随用户交互次数增加持续改进。

原文摘要 · Abstract (English)

Personalizing large language models (LLMs) to individual user preferences is a critical step beyond generating generically helpful responses. However, current personalization methods are ill-suited for new users, as they typically require either slow, resource-intensive fine-tuning or a substantial amount of pre-existing user data, creating a significant cold-start problem. To address this challenge, we introduce a new paradigm for real-time personalization by learning from online pairwise preference feedback collected during text generation. We propose T-POP (Test-Time Personalization with Online Preference Feedback}), a novel algorithm that synergistically combines test-time alignment with dueling bandits. Without updating the LLM parameters, T-POP steers the decoding process of a frozen LLM by learning a reward function online that captures user preferences. By leveraging dueling bandits, T-POP intelligently queries the user to efficiently balance between exploring their preferences and exploiting the learned knowledge to generate personalized text. Extensive experiments demonstrate that T-POP achieves rapid and data-efficient personalization, significantly outperforming existing baselines and showing consistent improvement with more user interactions.

个性化在线学习偏好反馈大模型

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