SYNTHESIS NOTE
Topics›Assistants Personalization›this note

Can user preferences be learned from just ten questions?

Explores whether adaptive question selection can efficiently infer user-specific reward coefficients without historical data or fine-tuning. This matters for scaling personalization without per-user model updates.

Synthesis note · 2026-02-23 · sourced from Assistants Personalization

Standard RLHF trains a single reward model on aggregated human preferences, assuming a universal preference structure. PReF (Personalization via Reward Factorization) makes a different assumption: user preferences lie in a low-dimensional space and can be represented as weighted sums of a small set of base reward functions.

The three-stage architecture:

  1. Base reward learning — train a set of base reward functions from paired preference data annotated with user identity. Each base function captures one dimension of preference variation (e.g., conciseness vs detail, formality vs casualness).

  2. User coefficient inference — present the new user with a sequence of question-response pairs and ask which response they prefer. The questions are selected adaptively using active learning: each question is chosen to maximally reduce uncertainty about the user's coefficients. Results from logistic bandit theory enable efficient uncertainty computation.

  3. Inference-time alignment — once user-specific coefficients are known, use inference-time methods to generate reward-aligned responses without modifying model weights. This enables scalable per-user adaptation.

The practical significance: 10-20 questions suffice. This is dramatically more efficient than approaches requiring historical interaction data or per-user fine-tuning. The active learning component is critical — random question selection would require far more queries because most questions are uninformative for distinguishing between users.

The low-dimensional preference assumption is both the strength and the limitation. If real preferences don't decompose into a small number of base dimensions, the factorization misses important variation. However, the survey evidence from How do personalization granularity levels trade precision against scalability? suggests that persona-level personalization (group-based, moderate dimensionality) is often sufficient and that user-level precision trades against data requirements.

The inference-time alignment component connects to Can decoding-time tuning preserve knowledge better than weight fine-tuning?. Both avoid weight modification per user, but PReF applies a user-specific reward function while proxy tuning applies a task-specific distributional shift. The combination suggests a design space: different axes of adaptation (user preferences, task requirements, domain knowledge) can each be applied at inference time through different mechanisms.

Inquiring lines that read this note 113

This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.

How can reward models capture diverse human preferences without excluding minority populations? Does abstract user knowledge outperform concrete interaction history in personalization? How should conversational recommenders balance preference elicitation with direct recommendation? How do recommenders balance exploiting fresh signals against maintaining preference stability? Can preference-based training achieve better behavior optimization than supervised fine-tuning alone? Do structural constraints outperform deep architectures in recommendation systems? What makes personas effective for predicting individual preferences and behavior? Does model confidence reliably signal actual accuracy in practice? What prevents conversational agents from taking initiative in dialogue? What drives appropriate trust calibration in personalized AI systems? Should AI communication design follow human conversation norms or develop distinct machine-specific principles? Why do people disclose to AI systems despite their artificial nature? How do neural networks achieve compositional generalization at scale? What determines appropriate intervention timing and manner for AI agents? How should items be represented and indexed in recommenders? How can persona-attention mechanisms improve both recommendation quality and explainability? How do social dynamics distort aggregated online ratings? How do spurious versus genuine rewards shape model reasoning and behavior? How should retrieval systems handle complex multi-step reasoning? What role does sparsity play in model behavior and scaling decisions? Can prompt-based context override biases that were embedded during pretraining? Does alignment training create genuine alignment or just output compliance? How do pretraining biases affect reward signal effectiveness in RLVR? What training data selection strategies maximize generalization across difficulty levels? How does evaluation scope and dimensionality affect what we measure? How does persona conditioning amplify demographic stereotyping and bias in models? How do agent-learned skills transfer and improve across different tasks? How much do training data properties shape model reasoning?

Related concepts in this collection 6

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
18 direct connections · 145 in 2-hop network ·medium cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

reward factorization represents user-specific preferences as linear combinations of base reward functions — 10 active-learning queries suffice for personalization