English

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

Machine Learning 2025-09-30 v1 Artificial Intelligence

Abstract

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.

Keywords

Cite

@article{arxiv.2509.24696,
  title  = {T-POP: Test-Time Personalization with Online Preference Feedback},
  author = {Zikun Qu and Min Zhang and Mingze Kong and Xiang Li and Zhiwei Shang and Zhiyong Wang and Yikun Ban and Shuang Qiu and Yao Shu and Zhongxiang Dai},
  journal= {arXiv preprint arXiv:2509.24696},
  year   = {2025}
}

Comments

Preprint

R2 v1 2026-07-01T06:04:23.819Z