用主动学习筛选关键数据,让大模型高效教小模型做推荐。
Active Large Language Model-based Knowledge Distillation for Session-based Recommendation
- 从大模型预测中主动挑选有效样本,降低计算开销。
- 在真实数据集上显著优于现有最优推荐方法。
- 适合资源受限下需高效知识蒸馏的推荐系统研究者。
大语言模型(LLM)为会话推荐(SBR)提供了高精度方案,但计算成本高昂。知识蒸馏(KD)可通过将知识转移给小型学生模型缓解此问题,但基于LLM的KD在SBR中面临挑战:1)对所有实例进行LLM预测代价过高;2)部分实例预测无效,如对困难样本错误预测,或对简单样本与现有推荐器输出相似。本文提出一种主动式LLM知识蒸馏方法,旨在实现可持续AI。通过主动学习策略,仅选取少量具有高价值的实例进行蒸馏,以降低计算成本。我们从理论出发,构建基于预测有效性(如有效、相似、错误)和拟合难度(如易/难)的收益函数,最大化最小蒸馏收益,从而避免无效样本的抽取。实验证明,该方法在真实数据集上显著优于当前最优的SBR方法。
原文摘要 · Abstract (English)
Large language models (LLMs) provide a promising way for accurate session-based recommendation (SBR), but they demand substantial computational time and memory. Knowledge distillation (KD)-based methods can alleviate these issues by transferring the knowledge to a small student, which trains a student based on the predictions of a cumbersome teacher. However, these methods encounter difficulties for \textit{LLM-based KD in SBR}. 1) It is expensive to make LLMs predict for all instances in KD. 2) LLMs may make ineffective predictions for some instances in KD, e.g., incorrect predictions for hard instances or similar predictions as existing recommenders for easy instances. In this paper, we propose an active LLM-based KD method in SBR, contributing to sustainable AI. To efficiently distill knowledge from LLMs with limited cost, we propose to extract a small proportion of instances predicted by LLMs. Meanwhile, for a more effective distillation, we propose an active learning strategy to extract instances that are as effective as possible for KD from a theoretical view. Specifically, we first formulate gains based on potential effects (e.g., effective, similar, and incorrect predictions by LLMs) and difficulties (e.g., easy or hard to fit) of instances for KD. Then, we propose to maximize the minimal gains of distillation to find the optimal selection policy for active learning, which can largely avoid extracting ineffective instances in KD. Experiments on real-world datasets show that our method significantly outperforms state-of-the-art methods for SBR.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。