Skip to content

Less Is Personal: Learning Minimal Sufficient User Profiles for Personalized Language Models

Sep 2026 · 0 citations · 15 references
Computer Science

TL;DR

This work introduces ENOUGH, a method that iteratively appends behavioral records or emits STOP to construct profiles with adaptive lengths, which consistently outperforms strong heuristic and retrieval-augmented baselines in both effectiveness and efficiency.

Abstract

Retrieval-augmented personalization enables large language models to produce more accurate and preference-aligned outputs using relevant records retrieved from user histories. Personalized language models typically prepend a fixed number of retrieved user records, even when additional history is redundant, harmful, or unrelated to a user's distinctive behavior. We study minimal sufficient personalization: constructing the least costly ordered profile for each input while preserving the utility achievable from a retrieved candidate pool. We introduce ENOUGH, a method that iteratively appends behavioral records or emits STOP to construct profiles with adaptive lengths. Offline, bounded counterfactual search evaluates profile prefixes by jointly considering downstream gains, user specificity, and token costs. The resulting long-horizon targets are distilled into a multi-head value controller with explicit ranking and stopping supervision. At inference, the controller selects and orders records through lightweight decisions, and the frozen generator is invoked once after stopping. Extensive experiments on six personalized tasks demonstrate that ENOUGH consistently outperforms strong heuristic and retrieval-augmented baselines in both effectiveness and efficiency, achieving minimal sufficient profiles that preserve personalization utility while reducing unnecessary context costs.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

VIBE-Bench: Evaluating Personalized Large Language Models When Profiles Don't Mean Preferences

VIBE-Bench is introduced, a benchmark with two psychology-grounded tasks, 3,504 personas and 12,239 dialogues, including a manually verified gold test set, and requires cross-concept preference reasoning beyond surface semantic overlap, establishing PRCM as a distinct failure regime in PLLMs and position VIBE-Bench as...

Yi-Wen Jiang, Yang Deng, Stephanie Fong et al. · 0 citations
Preprint Sep 2026

When LLM-Inferred User Context Adds Value in Production Streaming Recommendation

Contextual information in recommender systems is shifting from static, predefined variables toward latent representations inferred from behavior. Large language models support this shift by rendering an unstructured interaction history as a natural-language summary, which yields a thematic user context that can be enco...

M. Sabouri, Neeraj Sharma, Sardar Hamidian et al. · 0 citations
Preprint Aug 2026

QUMem: Personalized Memory for Query-Conditioned User-State Inference in LLM Agents

A structured memory framework for query-conditioned user-state inference for long-term personalization that achieves state-of-the-art performance on both PersonaMem and KnowU-Bench, demonstrating the effectiveness of query-conditioned user-state inference for long-term personalization.

Heng Wang, Yifei Li, Lingling Zhang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Using Context Is Not Enough: Test-Time Training for Personalized Reward Modeling

Preference-Aligned Test-Time Training (P-TTT) is proposed, which explicitly encodes preference relations conveyed by contextual pairs into user-specific fast weights for personalized reward prediction and outperforms state-of-the-art methods by a large margin.

Bo-Hao Wang, Xiao-Yan Zhao, Yang Zhang et al. · 0 citations
Open access 2026

Hodge-Guided Active Preference Elicitation for Efficient Pairwise Ranking

Pairwise comparison is a standard method for eliciting user preferences in recommender systems and group decision-making. The number of required comparisons grows quadratically with the number of alternatives, creating a substantial burden for users and platforms. This paper asks whether Hodge decomposition, which spli...

Eskander Bejaoui, M. O. Aoueileyine, R. Bouallègue · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.