LLM在时序关系分类中表现不如小模型,原因在于其自回归机制只关注序列末尾。
Will LLMs Replace the Encoder-Only Models in Temporal Relation Classification?
- 对比7个开源闭源LLM与RoBERTa,测试上下文学习和轻量微调效果
- 使用上下文学习的LLM性能显著低于小型RoBERTa模型
- 发现LLM因自回归特性只关注序列末尾,导致时序判断偏差
时序关系检测主要依赖RoBERTa等编码器模型。尽管大语言模型(LLM)在时序问答任务中表现优异,但现有研究仅测试了闭源LLM,影响结果可解释性。本文评估7个开源与闭源LLM在时序关系分类任务中的表现,采用上下文学习和轻量微调方法。结果表明,使用上下文学习的LLM显著落后于小型RoBERTa模型。进一步通过可解释性分析发现,该差距源于LLM的自回归特性,使其仅关注序列末尾内容。此外,我们还对比了两类模型的词嵌入,以理解其预训练差异。代码与微调模型可在GitHub获取。
原文摘要 · Abstract (English)
The automatic detection of temporal relations among events has been mainly investigated with encoder-only models such as RoBERTa. Large Language Models (LLM) have recently shown promising performance in temporal reasoning tasks such as temporal question answering. Nevertheless, recent studies have tested the LLMs' performance in detecting temporal relations of closed-source models only, limiting the interpretability of those results. In this work, we investigate LLMs' performance and decision process in the Temporal Relation Classification task. First, we assess the performance of seven open and closed-sourced LLMs experimenting with in-context learning and lightweight fine-tuning approaches. Results show that LLMs with in-context learning significantly underperform smaller encoder-only models based on RoBERTa. Then, we delve into the possible reasons for this gap by applying explainable methods. The outcome suggests a limitation of LLMs in this task due to their autoregressive nature, which causes them to focus only on the last part of the sequence. Additionally, we evaluate the word embeddings of these two models to better understand their pre-training differences. The code and the fine-tuned models can be found respectively on GitHub.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。