arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.18002cs.CLcs.AI
收藏

在有限教师监督下解码需要理解何时信任教师

Decoding with Limited Teacher Supervision Requires Understanding When to Trust the Teacher

Pohang University of Science and Technology (POSTECH)(浦项科技大学(POSTECH))

Hyunjong Ok, Jegwang Ryu, Jaeho Lee

AI总结:

本文研究在LLM监督次数受限的解码场景下,提出一种根据小模型置信度自适应信任或忽略LLM预测的聚合解码算法,实验证明其优于传统解码策略。

摘要:

小规模大语言模型(LLMs)如何高效利用LLM的监督来提升其生成质量?这一问题在没有LLM监督次数限制的场景中已得到充分研究,催生了许多无需进一步训练即可利用监督的解码算法。然而,在“有限监督”场景下,即假设LLM最多只能生成少量token时,何种策略有效仍不清楚。为此,我们提出了一种算法,在初始token上有效聚合小规模LLM与LLM的预测,使得生成的token能够更准确地为后续仅由小规模LLM进行的token生成提供条件。关键的是,我们发现必须根据小规模LLM的置信度自适应地过度信任或忽略LLM的预测。通过在广泛的模型和数据集上的实验,我们证明了我们的方法相比传统解码策略提供了一致的改进。代码:https://github.com/HJ-Ok/DecLimSup

英文摘要:

How can small-scale large language models (LLMs) efficiently utilize the supervision of LLMs to improve their generative quality? This question has been well studied in scenarios where there is no restriction on the number of LLM supervisions one can use, giving birth to many decoding algorithms that utilize supervision without further training. However, it is still unclear what is an effective strategy under the $\textit{limited supervision}$ scenario, where we assume that no more than a few tokens can be generated by LLMs. To this end, we develop an algorithm to effectively aggregate the small-scale LLM and LLM predictions on initial tokens so that the generated tokens can more accurately condition the subsequent token generation by small-scale LLM only. Critically, we find that it is essential to adaptively overtrust or disregard the LLM prediction based on the confidence of the small-scale LLM. Through our experiments on a wide range of models and datasets, we demonstrate that our method provides a consistent improvement over conventional decoding strategies. $\small$ $\textbf{Code:}$ https://github.com/HJ-Ok/DecLimSup

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑