Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

Can LLMs Be Constrained to the Past? Improving Knowledge Cutoff through Recall-Based Prompting

About

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.

Michiro Asai, Ailiang Lin, Yu Kishimoto, Takao Obi, Satoshi Kosugi, Kotaro Funakoshi, Manabu Okumura• 2026

Related benchmarks

TaskDatasetResultRank
Knowledge cutoff successFactual
Unlearn Success Rate82.5
21
Knowledge cutoff successCounterfactual
Hard Unlearn Success Rate71.2
21
Knowledge cutoff successSemantic
Unlearn Success Rate71.1
21
Knowledge CutoffMulti-cutoff Historical Event Benchmark (MHEB)
MHEB Accuracy (Cutoff 0)91
7
Showing 4 of 4 rows

Other info

Follow for update