Novel-WD: Exploring acquisition of Novel World Knowledge in LLMs Using Prefix-Tuning
Maxime Méloux, Christophe Cerisara
TL;DR
This work addresses how to update pre-trained LLMs with novel world knowledge by evaluating prefix-tuning as a compact knowledge store. It introduces Novel-WD, a Wikidata-derived dataset, and a dynamic benchmark to measure perplexity, knowledge acquisition, generalization, and MCQ performance for recently added facts. The study finds that a single, small prefix can encode individual facts and that both prefix length and, more strongly, prefix depth significantly influence learning and generalization, with larger base models offering additional accuracy gains. These results support using full-depth prefixes of moderate length as a practical approach for integrating up-to-date factual knowledge, while highlighting limitations and avenues for scaling via retrieval-augmented or routing-based methods. The released dataset and methodology provide a concrete foundation for systematic evaluation of fact learning in LLMs.
Abstract
Teaching new information to pre-trained large language models (PLM) is a crucial but challenging task. Model adaptation techniques, such as fine-tuning and parameter-efficient training have been shown to store new facts at a slow rate; continual learning is an option but is costly and prone to catastrophic forgetting. This work studies and quantifies how PLM may learn and remember new world knowledge facts that do not occur in their pre-training corpus, which only contains world knowledge up to a certain date. To that purpose, we first propose Novel-WD, a new dataset consisting of sentences containing novel facts extracted from recent Wikidata updates, along with two evaluation tasks in the form of causal language modeling and multiple choice questions (MCQ). We make this dataset freely available to the community, and release a procedure to later build new versions of similar datasets with up-to-date information. We also explore the use of prefix-tuning for novel information learning, and analyze how much information can be stored within a given prefix. We show that a single fact can reliably be encoded within a single prefix, and that the prefix capacity increases with its length and with the base model size.
