PersonalizedRouter: Personalized LLM Routing via Graph-based User Preference Modeling
Not on the map. Why?
Abstract (arXiv)
The growing number of Large Language Models (LLMs) with diverse capabilities and response styles provides users with a wider range of choices, which presents challenges in selecting appropriate LLMs, as user preferences vary in terms of performance, cost, and response style. Current LLM selection methods typically optimize for a single fixed objective, such as performance, cost, or a trade-off between them, and fail to learn individual user preferences from interaction data. To address these limitations, we propose PersonalizedRouter, a graph-based framework that models diverse user profiles and performs personalized LLM selection by leveraging interaction data that includes task context, queries, candidate LLMs, and user decisions. To capture contextual information between user queries and optimal LLMs, PersonalizedRouter converts the interaction data into a heterogeneous graph, where the relationships between different types of nodes are represented by edges. To evaluate adaptability across users, we design two strategies: the multi-cost-efficiency simulation strategy and the LLM-as-a-Judge strategy. In addition, we construct PersonaRoute-Bench, a large-scale benchmark with 1,000 simulated users and 10 LLMs. Experimental results show that PersonalizedRouter significantly outperforms existing LLM selection methods and surpasses the strongest methods by a large margin of 15.38% and 9.83% under two simulation strategies. On the PersonaRoute-Bench with 1,000 users, it further surpasses the best methods by 16.19% and 59.69% while maintaining higher efficiency. Moreover, PersonalizedRouter demonstrates strong few-shot generalization, achieving 64.81% and 85.80% of the fully trained model's performance when adapting to new users and new LLMs.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 38 of its 51 references that are in the map. First posted on arXiv 21 Nov 2025.
Builds on
38 of 51 references.
References · 38
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
- 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 791
- 2019Heterogeneous Graph Attention Networkcited by 732
26 more
- 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
- 2020Heterogeneous Graph Transformercited by 581
- 2019Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Modelcited by 431
- 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2018Modeling polypharmacy side effects with graph convolutional networkscited by 237
- 2023Better Zero-Shot Reasoning with Role-Play Promptingcited by 220
- 2024GraphRouter: A Graph-based Router for LLM Selectionscited by 154
- 2022Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networkscited by 94
- 2024RouterDC: Query-Based Router by Dual Contrastive Learning for Assembling Large Language Modelscited by 84
- 2022Graph Neural Networks for Link Prediction with Subgraph Sketchingcited by 81
- 2022Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Predictioncited by 78
- 2025Router-R1: Teaching LLMs Multi-Round Routing and Aggregation via Reinforcement Learningcited by 64
- 2025Multi-Agent Evolve: LLM Self-Improve through Co-evolutioncited by 58
- 2023Relational Deep Learning: Graph Representation Learning on Relational Databasescited by 55
- 2024Cost-Effective Online Multi-LLM Selection with Versatile Reward Modelscited by 36
- 2024ResearchTown: Simulator of Human Research Communitycited by 35
- 2024How Far Are We From AGI: Are LLMs All We Need?cited by 31
- 2019Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networkscited by 23
- 2023On Optimal Caching and Model Multiplexing for Large Model Inferencecited by 20
- 2023Relational Multi-Task Learning: Modeling Relations between Data and Taskscited by 15
- 2025Graph World Modelcited by 14
- 2024Graph of Records: Boosting Retrieval Augmented Generation for Long-context Summarization with Graphscited by 12
- 2024Cultural Value Differences of LLMs: Prompt, Language, and Model Sizecited by 10
- 2025FusionFactory: Fusing LLM Capabilities with Multi-LLM Log Datacited by 10
- 2023Link Prediction without Graph Neural Networkscited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Arch-Router: Aligning LLM Routing with Human Preferences
- 2026Learning to Route LLMs from Implicit Cost-Performance Preferences via Meta-Learning
- 2025Dynamic LLM Routing and Selection based on User Preferences: Balancing Performance, Cost, and Ethics
- 2026RouteJudge: An Open Platform for Reproducible and Preference-Aware LLM Routing
- 2026Towards Natural Personalization: Evaluating Long-Horizon Preference Following in Personalized User-LLM Interactions
- 2025LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing
- 2026Many Preferences, Few Policies: Towards Scalable Language Model Personalization
- 2026Personalized Benchmarking: Evaluating LLMs by Individual Preferences