用模型合并技术压缩大模型推荐系统的推理过程,提升效率。
Towards Efficient Reasoning in LLM-Based Recommender Systems via Model Merging

- 按注意力头细粒度合并快慢模型,精准注入简洁行为
- 推理长度减少24.3%,推荐准确率仍优于现有方法
- 无需训练,适合追求高效推理的推荐系统部署
基于大语言模型的推荐系统正越来越多采用慢思考模型,通过分步推理提升预测精度,但其推理过程常过于冗长,增加推理开销却未带来显著精度提升。现有训练式压缩方法适应成本高,推理时方法脆弱且难扩展。为此,我们提出首个面向推荐系统推理压缩的模型合并框架,无需训练。不同于传统统一系数的合并方式,本方法在注意力头层面进行细粒度合并,根据每个头对关键推理证据的贡献及参数敏感度分配不同合并系数,实现对快思考模型简洁行为的有选择性注入,有效降低推理冗余。在三个基准数据集上的实验表明,该方法可将推理长度减少最多24.3%,同时在推荐准确率上优于现有合并基线。代码已开源:https://github.com/linhledieu/REAM。
原文摘要 · Abstract (English)
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 https://github.com/linhledieu/REAM.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。