---
格式版本: 2
标题: "Towards Efficient Reasoning in LLM-Based Recommender Systems via Model Merging"
原文链接: "https://arxiv.org/abs/2608.10447"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 04:01:35 UTC (2,573 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T10:48:51+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T10:46:47+08:00"
入库时间: "2026-08-12T02:48:51.125Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=Scale-up&searchtype=all"
匹配关键词:
  - "Scale-up"
  - "AI"
相关厂家:
  []
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 8
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "该资料为arXiv论文，内容关于LLM推荐系统的推理压缩，与超节点/AI Rack/机柜级AI基础设施完全无关，仅搜索词命中'Scale-up'，正文无任何相关技术或商业信息。"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T10:48:59+08:00"
AI主题相关性: 0
AI来源权威性: 5
AI新颖性: 2
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 1
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.10447"
---

## Computer Science > Information Retrieval

## Title:Towards Efficient Reasoning in LLM-Based Recommender Systems via Model Merging

Authors:[Linh Dieu Le](https://arxiv.org/search/cs?searchtype=author&query=Le,+L+D), [Tong Chen](https://arxiv.org/search/cs?searchtype=author&query=Chen,+T), [Shazia Sadiq](https://arxiv.org/search/cs?searchtype=author&query=Sadiq,+S), [Hongzhi Yin](https://arxiv.org/search/cs?searchtype=author&query=Yin,+H), [Ming Jin](https://arxiv.org/search/cs?searchtype=author&query=Jin,+M), [Junliang Yu](https://arxiv.org/search/cs?searchtype=author&query=Yu,+J)

[View PDF](https://arxiv.org/pdf/2608.10447) [HTML (experimental)](https://arxiv.org/html/2608.10447v1)

> Abstract:Large language model-based recommender systems are increasingly adopting slow-thinking models that generate step-by-step reasoning before making predictions, often achieving higher accuracy than fast-thinking models that predict directly. However, their reasoning traces are often unnecessarily verbose, increasing inference costs without commensurate accuracy gains. Existing training-based approaches to reasoning compression often incur substantial adaptation costs, while inference-time methods are brittle and difficult to scale. These limitations motivate model merging as a promising training-free direction for transferring specialised behaviours between models in a shared parameter space. In particular, merging a slow-thinking model with a fast-thinking counterpart provides a natural mechanism for balancing recommendation accuracy and reasoning conciseness. To this end, we propose, to our knowledge, the first model merging framework for reasoning compression in recommender systems. Unlike conventional merging methods that apply uniform merge coefficients across model components, our method performs fine-grained merging at the level of individual attention heads, capturing heterogeneous patterns in recommendation reasoning. Each attention head is assigned a distinct merge coefficient according to its contribution to critical reasoning evidence and its sensitivity to parameter change, enabling selective injection of the concise behaviour of the fast-thinking model into the slow-thinking model and reducing reasoning verbosity without compromising recommendation quality. Experiments on three benchmark datasets show that our method reduces reasoning length by up to 24.3% while outperforming competitive model merging baselines in maintaining recommendation accuracy. The code is available at [this https URL](https://github.com/linhledieu/REAM).

| Subjects: | Information Retrieval (cs.IR); Artificial Intelligence (cs.AI) |
| --- | --- |
| Cite as: | [arXiv:2608.10447](https://arxiv.org/abs/2608.10447) \[cs.IR\] |
|  | (or [arXiv:2608.10447v1](https://arxiv.org/abs/2608.10447v1) \[cs.IR\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.10447](https://doi.org/10.48550/arXiv.2608.10447) |

## Submission history

From: Linh Dieu Le \[[view email](https://arxiv.org/show-email/826025f3/2608.10447)\]  
**\[v1\]** Tue, 11 Aug 2026 04:01:35 UTC (2,573 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.10447) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
