Sign inGet started
Paper · arXiv

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

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, augmented with a rank-one residual for finer personalization. To further reduce per-user parame...

AuthorsXinyu Li, Ruoming Jin, Jianfeng Zhu et al.
Primary categorycs.AI
Published4 September 2026
Last updated at source4 September 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/7f33d729-99b8-486e-88da-005a690fbd57" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.