Sep 2026· Proceedings of the 20th ACM Conference on Recommender Systems· pp. 685-690· 0 citations· 13 references
TL;DR
Experiments conducted on movie, book and electronics benchmark datasets demonstrate that GradSup outperforms iterative fine-tuning to provide scalable and personalised recommendation that is consistently sustained above the frozen LLM backbone.
Abstract
Large language models (LLMs) have demonstrated strong capabilities in recommendation tasks such as item, sequence, conversational recommendation, and explanation generation. However, LLM weights are typically shared across all users. Adapting these models to individual users remains a fundamental challenge that requires millions of trainable parameters, even when using finetuning methods such as Low-Rank Adaptation (LoRA). Building such personalised adapters would also require large volumes of storage and high computational overhead. To address this challenge of personalised and scalable recommendation, we propose the Gradient Superposition (GradSup) method. Built on the TinyLoRA architecture, GradSup is a closed-form method that computes per-user adapters in a single pass, achieving 15 × speedup over iterative fine-tuning at matched parameter budget and 400 × compression over full LoRA. Experiments conducted on movie, book and electronics benchmark datasets demonstrate that GradSup outperforms iterative fine-tuning to provide scalable and personalised recommendation that is consistently sustained above the frozen LLM backbone. Code is available at: https://github.com/kanishkaRandunu/GradSup
The Fusion of Layer-wise Exits for Sequential Recommendation (FLEXRec), a discriminative framework that enhances compact LLMs while retaining scalable full-corpus ranking and achieves state-of-the-art accuracy among competing methods while remaining highly efficient.
Xurong Liang, Tong Chen, Q. Nguyen et al.· 0 citations
PALRec is proposed, a parameter-preserving augmentation framework that equips an LLM with recommendation capabilities while keeping its original parameters fixed and consistently outperforms fully fine-tuned counterparts in recommendation accuracy while preserving the LLM’s pre-trained knowledge.
Hyunsoo Na, Minseok Gang, Sang-goo Lee et al.· ACM Transactions on Informat...· 0 citations
Weightless Fine-Tuning is proposed, a training-free decoding-time method that approximates the distributional effect of SFT without weight updates and achieves the best average performance across datasets, matches or exceeds SFT on individual tasks, and outperforms other lightweight baselines on average.
Bo-Han Zhang, An-Qi Ni, Yi-Xin Wang et al.· 0 citations
A novel Dual-End Adapter for Sequential Recommendation (DEASRec) is presented, which employs lightweight adapters as flexible plugins without modifying backbone architectures to achieve stable performance improvements with low computational cost.
Juntao Hu, Wei Zhou, Huayi Shen et al.· Proceedings of the 32nd ACM...· 0 citations
This work proposes eXtreme Gradient Boosting LoRA (XGBLoRA), a novel framework grounded in gradient boosting theory that provides theoretical analysis establishing convergence guarantees and expressiveness bounds, which formally justify why weaker (lower-rank) adapters, when properly combined, can match or exceed the p...
Yifei Zhang, Hao Zhu, Haoran Shi et al.· Proceedings of the 32nd ACM...· 0 citations
This work proposes RosePO, a framework to refine LLM-based recommendation through pairwise preference optimization with personalized smoothing, and incorporates a personalized smoothing factor predicted by a user oracle into the optimization objective.
Jia-Yi Liao, Xiang-Nan He, Ruo-Bing Xie et al.· ACM Transactions on Informat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.