SOURCE-LINKED INTELLIGENCE

Aplaud: Adaptive Personalized Low-Rank Decomposition for User-Specific LLM

arXiv · AI, language, vision and robotics · article · Sep 4, 2026 · UTC

In this paper, we study the problem of personalized survey response prediction using fine-tuned large language models (LLMs). This task poses unique challenges: limited per-user training data, scalability of model storage, and the need to exploit shared structure across survey questions. To address these issues, we propose Aplaud (Adaptive Personalized Low-rank and User-specific Nested Decomposition), a lightweight and scalable framework for LLM personalization. Aplaud extends the LoRA paradigm by separating adaptation into a frozen, shared low-rank basis and a compact user-specific correction

Read original source ↗ Open in workspace

recordType

paper

region

Global