about
Fine-Tuning Small Language Models with Low-Rank Adapters to Mimic User Behaviors (arxiv.org)
3 points by PaulHoule 362 days ago | hide | past | pdf | discuss on HN

In plain words: A frozen big model turns a user's item history into text, then small models get lightweight add-on training—one set per group of similar users—to act as stand-ins. They matched real behavior better than prompting or retraining big models, at lower cost.

Abstract · Personas within Parameters: Fine-Tuning Small Language Models with Low-Rank Adapters to Mimic User Behaviors

A long-standing challenge in developing accurate recommendation models is simulating user behavior, mainly due to the complex and stochastic nature of user interactions. Towards this, one promising line of work has been the use of Large Language Models (LLMs) for simulating user behavior. However, aligning these general-purpose large pre-trained models with user preferences necessitates: (i) effectively and continously parsing large-scale tabular user-item interaction data, (ii) overcoming pre-training-induced inductive biases to accurately learn user specific knowledge, and (iii) achieving the former two at scale for millions of users. While most previous works have focused on complex methods to prompt an LLM or fine-tune it on tabular interaction datasets, our approach shifts the focus to extracting robust textual user representations using a frozen LLM and simulating cost-effective, resource-efficient user agents powered by fine-tuned Small Language Models (SLMs). Further, we showcase a method for training multiple low-rank adapters for groups of users or \textit{persona}, striking an optimal balance between scalability and performance of user behavior agents. Our experiments provide compelling empirical evidence of the efficacy of our methods, demonstrating that user agents developed using our approach have the potential to bridge the gap between offline metrics and real-world performance of recommender systems.

Himanshu Thakur, Eshani Agrawal, Smruthi Mukund
arXiv:2509.09689 · cs.IR, cs.AI, cs.CL, cs.LG · submitted Aug 18, 2025
abstract · pdf · html

add comment on HN