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 117

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 do reward models systematically fail to represent diverse human preferences? Why do abstract preferences outperform episodic memories in personalization? How can agents discover and adapt to user preferences during conversation? When do simpler collaborative filtering approaches outperform complex LLM recommenders? Do persona-based approaches introduce systematic biases in user simulation? Can confidence signals reliably detect flawed reasoning in language models? How does personalization simultaneously affect user trust and privacy concerns? How can we maintain privacy when agents prioritize task completion? How do neural networks learn compositional structure from training? How should recommendation systems balance individual preference and diversity? How should AI agents balance proactive engagement with conversational respect? How do network effects and self-selection distort aggregated rating accuracy? How do reward signal properties affect model reasoning and safety? How should retrieval strategies adapt to multi-step reasoning demands? How do sequence length and task type interact with sparsity tolerance? Should models ask for clarification when facing ambiguous or under-specified information? Which reinforcement learning modifications most improve dialogue quality in language models? How does model capacity affect learning performance on diverse downstream tasks? Does preference optimization undermine conversational grounding in language models? How do training data quality and composition affect downstream model performance? What explains the gap between benchmark scores and true reasoning capability? Can AI agents improve their skills through accumulated experience and reuse? Why do multi-agent systems reach premature consensus without genuine deliberation?

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
19 direct connections · 154 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