Personalized Alignment Revisited: The Necessity and Sufficiency of User Diversity
Not on the map. Why?
Abstract (arXiv)
Personalized alignment aims to adapt large language models to heterogeneous user preferences, yet the precise theoretical conditions for its statistical efficiency have not been formally established. This paper characterizes the conditions under which personalized alignment achieves O(1) online regret and log(1/epsilon) offline sample complexity. We show that these optimal rates depend on a specific user-diversity condition: the population of user-specific heads must span the latent reward directions that can alter the optimal response. We prove that this condition is both necessary and sufficient. When it holds, simple greedy algorithms achieve benchmark efficiency; when it fails, every learner in a natural admissible class incurs at least logarithmic regret. Our results identify user diversity as the fundamental driver of personalized identifiability.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 43 of its 48 references that are in the map. First posted on arXiv 9 May 2026.
Builds on
43 of 48 references.
References · 43
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2017Deep reinforcement learning from human preferencescited by 3,846
- 2020Learning to summarize from human feedbackcited by 2,562
- 2019Fine-Tuning Language Models from Human Preferencescited by 2,124
- 2023A General Theoretical Paradigm to Understand Learning from Human Preferencescited by 906
- 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 527
- 2023Iterative Preference Learning from Human Feedback: Bridging Theory and Practice for RLHF under KL-Constraintcited by 346
- 2023Personalized Soups: Personalized Large Language Model Alignment via Post-hoc Parameter Mergingcited by 271
- 2024RLHF Workflow: From Reward Modeling to Online RLHFcited by 265
- 2023Nash Learning from Human Feedbackcited by 220
- 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
31 more
- 2022Fine-tuning language models to find agreement among humans with diverse preferencescited by 189
- 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
- 2024A Roadmap to Pluralistic Alignmentcited by 175
- 2024Rewards-in-Context: Multi-objective Alignment of Foundation Models with Dynamic Preference Adjustmentcited by 171
- 2024Secrets of RLHF in Large Language Models Part II: Reward Modelingcited by 170
- 2020Provable Meta-Learning of Linear Representationscited by 161
- 2024Personalizing Reinforcement Learning from Human Feedback with Variational Preference Learningcited by 147
- 2024The PRISM Alignment Dataset: What Participatory, Representative and Individualised Human Feedback Reveals About the Subjective and Multicultural Alignment of Large Language Modelscited by 136
- 2023Beyond One-Preference-Fits-All Alignment: Multi-Objective Direct Preference Optimizationcited by 121
- 2024Social Choice Should Guide AI Alignment in Dealing with Diverse Human Feedbackcited by 95
- 2017Mostly Exploration-Free Algorithms for Contextual Banditscited by 85
- 2023Group Preference Optimization: Few-Shot Alignment of Large Language Modelscited by 61
- 2024PAD: Personalized Alignment of LLMs at Decoding-Timecited by 58
- 2024PersonalLLM: Tailoring LLMs to Individual Preferencescited by 56
- 2024PAL: Pluralistic Alignment Framework for Learning from Heterogeneous Preferencescited by 53
- 2024Online Iterative Reinforcement Learning from Human Feedback with General Preference Modelcited by 52
- 2019Adaptive Exploration in Linear Contextual Banditcited by 43
- 2025LoRe: Personalizing LLMs via Low-Rank Reward Modelingcited by 34
- 2021Leveraging Good Representations in Linear Contextual Banditscited by 29
- 2025Language Model Personalization via Reward Factorizationcited by 27
- 2021Representation Learning Beyond Linear Prediction Functionscited by 21
- 2020Greedy Algorithm almost Dominates in Smoothed Contextual Banditscited by 20
- 2025ModernVBERT: Towards Smaller Visual Document Retrieverscited by 19
- 2024Margin Matching Preference Optimization: Enhanced Model Alignment with Granular Feedbackcited by 15
- 2024Reward Learning From Preference With Tiescited by 13
- 2025Greedy Sampling Is Provably Efficient for RLHFcited by 10
- 2024Towards Understanding the Influence of Reward Margin on Preference Model Performancecited by 9
- 2024Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Banditcited by 8
- 2025Capturing Individual Human Preferences with Reward Featurescited by 8
- 2025The Reward Model Selection Crisis in Personalized Alignmentcited by 3
- 2022On the Complexity of Representation Learning in Contextual Linear Banditscited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025From 1,000,000 Users to Every User: Scaling Up Personalized Preference for User-level Alignment
- 2025A Survey on Personalized Alignment -- The Missing Piece for Large Language Models in Real-World Applications
- 2025Persona-judge: Personalized Alignment of Large Language Models via Token-level Self-judgment
- 2026Rethinking Personalized Generation: Test-Time Alignment via Factorized Ranking Models
- 2025A Survey on Personalized and Pluralistic Preference Alignment in Large Language Models
- 2026One Adapts to Any: Meta Reward Modeling for Personalized LLM Alignment
- 2026Preference Data Selection for Mitigating the Alignment Tax in Large Language Models
- 2025Drift: Decoding-time Personalized Alignments with Implicit User Preferences