Efficient and Responsible Adaptation of Large Language Models for Robust Top-k Recommendations

Conventional recommendation systems (RSs) often optimize for aggregate accuracy, inadvertently underserving users with sparse interaction histories. Although large language models (LLMs) exhibit strong zero- and few-shot ranking capabilities, their use in RS pipelines faces a two-fold challenge: (i) scalability and generalizability : since many evaluations rely on small, randomly sampled user subsets that limit generalization to real-world populations; and (ii) responsible adaptation under resource constraints : since LLMs impose non-trivial cost and latency that preclude indiscriminate use. To address these challenges, we propose a hybrid task allocation framework that proactively allocates ranking tasks between traditional RSs and LLMs to enhance robustness and efficiency. Our strategy works by first identifying weak and inactive users who receive suboptimal ranking performance from RSs. Next, we use an in-context learning approach for such users, wherein each user’s interaction history is contextualized as a distinct ranking task. We evaluate our hybrid framework that integrates eight diverse recommendation algorithms, three popular datasets, and three LLMs (both open- and closed-source), demonstrating that it significantly reduces weak users by approximately 12% while maintaining cost-effectiveness through targeted LLM utilization.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Recommender Systems
Published
2025-11-03
DOI
https://doi.org/10.1145/3774778
Citations
1
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Responsible Adaptation of Large Language Models for Robust Top-k Recommendations

Vinayak Gupta, Chirag Shah, Kirandeep Kaur, Manya Chadha
1 citations
ACM Transactions on Recommender Systems
Recommender Systems and Techniques
3.25
article

Efficient and Responsible Adaptation of Large Language Models for Robust Top-k Recommendations

Vinayak Gupta, Chirag Shah, Kirandeep Kaur, Manya Chadha
article en
1 citations

Abstract

Conventional recommendation systems (RSs) often optimize for aggregate accuracy, inadvertently underserving users with sparse interaction histories. Although large language models (LLMs) exhibit strong zero- and few-shot ranking capabilities, their use in RS pipelines faces a two-fold challenge: (i) scalability and generalizability : since many evaluations rely on small, randomly sampled user subsets that limit generalization to real-world populations; and (ii) responsible adaptation under resource constraints : since LLMs impose non-trivial cost and latency that preclude indiscriminate use. To address these challenges, we propose a hybrid task allocation framework that proactively allocates ranking tasks between traditional RSs and LLMs to enhance robustness and efficiency. Our strategy works by first identifying weak and inactive users who receive suboptimal ranking performance from RSs. Next, we use an in-context learning approach for such users, wherein each user’s interaction history is contextualized as a distinct ranking task. We evaluate our hybrid framework that integrates eight diverse recommendation algorithms, three popular datasets, and three LLMs (both open- and closed-source), demonstrating that it significantly reduces weak users by approximately 12% while maintaining cost-effectiveness through targeted LLM utilization.

ACM Transactions on Recommender SystemsVol. 4(3)
University of Washington (US)
Openalex Percentile: Top 6%
Recommender Systems and Techniques
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.