菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-06-04
📄 Abstract - Can LLMs Be Constrained to the Past? Improving Knowledge Cutoff through Recall-Based Prompting

Prompted knowledge cutoff instructs a large language model (LLM) to act as if information beyond a specified cutoff date were unavailable. However, prior work mainly relies on direct-answer generation, which struggles when post-cutoff knowledge is not explicitly queried but is only causally related to the question. To address this limitation, we propose two recall-based prompting strategies: Self-Recall (SR), which asks the model to restate its cutoff constraint, and Question-Recall (QR), which requires the model to recall question-relevant information valid under the cutoff. Across three existing benchmarks, our methods outperform both direct-answer prompting and conventional step-by-step reasoning baselines, with particularly strong improvements on counterfactual questions. To investigate robustness across different cutoff settings, we further construct the Multi-cutoff Historical Event Benchmark (MHEB), which evaluates the same question under multiple cutoff years. Results show that knowledge cutoff performance varies with cutoff distance, while combining SR and QR consistently yields the best performance.

顶级标签: llm model evaluation
详细标签: knowledge cutoff prompting recall benchmark counterfactual 或 搜索:

能否让大语言模型只关注过去?通过基于回忆的提示策略改善知识截止效果 / Can LLMs Be Constrained to the Past? Improving Knowledge Cutoff through Recall-Based Prompting


1️⃣ 一句话总结

本文提出两种基于回忆的提示策略(自我回忆和问题回忆),让大语言模型在回答问题时能更有效地忽略指定截止日期之后的信息,尤其在处理反事实问题或与截止后知识间接相关的问题上表现更优,并通过新构建的多截止历史事件基准验证了该方法的稳定性和有效性。

源自 arXiv: 2606.05804