Skip to content
Open access

LLM-Driven News Recommendation via Lightweight Task-Adaptive Modules

Jul 2026 · Applied Sciences · Vol 16, pp. 6818 · 1 citation · 29 references

TL;DR

This work proposes lightweight task-adaptive modules (TAMs), which keeps LLM parameters fixed and transforms offline embeddings into task-specialized representations without full-model backpropagation, drastically cutting training costs.

Abstract

Large language models produce semantically rich embeddings, yet direct employment of generic LLM embeddings fails to satisfy news recommendation demands due to inherent semantic mismatches with task targets. Existing fine-tuning methods including LoRA can narrow such gaps but bring prohibitive computational overhead, restricting real-world deployment. This work proposes lightweight task-adaptive modules (TAMs). It keeps LLM parameters fixed and transforms offline embeddings into task-specialized representations without full-model backpropagation, drastically cutting training costs. Evaluated on MIND benchmarks across ten mainstream recommendation architectures, TAMs achieves comparable accuracy to LoRA, with computational cost reduced to 1/10 of LoRA’s level. TAMs outperform GloVe-based models by 1.3–12.4% in AUC and scale effectively to MINDlarge. Ablation experiments confirm that the nonlinear projection is pivotal to performance improvement, and statistical validation across three random seeds confirms result robustness. This paradigm provides an efficient low-cost solution for LLM-based news recommendation under resource constraints.

Read PDF

Similar papers

#large language models Review Open access Sep 2026

PALRec: Large Language Model-Based Sequential Recommendation with Parameter-Preserving Augmentation

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. · 0 citations
Preprint Aug 2026

Empowering Compact LLMs with Fusion of Layer-wise Exits for Recommendation

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
Jul 2026

REPREC: Representation Driven Parameter-Efficient Recommendation System

REPREC is a lightweight framework that conditions a frozen LLM using compact user-level representations and consistently improves recommendation performance across different sequential encoders, LLM backbones, and user activity levels.

Harshini Kavuru, Dwipam Katariya, Giri Iyengar et al. · 0 citations
Preprint Aug 2026

Training-Free LLM-Based Recommendation with Post-LLM Item Refinement Using Collaborative Signals

Large language models (LLMs) have shown promise for training-free recommendation, but LLM-generated user interests are often too broad for fine-grained item retrieval. Existing methods incorporate collaborative filtering (CF) signals in a pre-LLM manner through candidate reranking or prompt augmentation, yielding limit...

Kyungho Kim, Sunwoo Kim, Geon Lee et al. · 0 citations
Book Open access Aug 2026

When Gradient Boosting Meets Adapter: Exploring Weak Learners for Parameter-Efficient Fine-tuning of LLMs

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. · 0 citations
Preprint Aug 2026

Preserving Item Semantics for Free: Rethinking Token Initialization in LLM-Based Generative Recommendation

This work proposes a simple, parameter-free intervention that initializes SID token embeddings directly from their corresponding centroids in the semantic embedding space, and shows that preserving SID geometry, beyond shared-prefix structure, provides a simple and effective semantic prior for LLM-based GR.

Donald Loveland, Liam Collins, B. Kumar et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.