SPA: A Simple but Tough-to-Beat Baseline for Knowledge Injection

Kexian Tang, Jiani Wang, Shaowen Wang, Kaifeng Lyu
3/23/2026
cs.LGcs.AIcs.CL

Official code: Tangkexian/SPA (10 stars, last commit 2026-03-24).

Abstract

While large language models (LLMs) are pretrained on massive amounts of data, their knowledge coverage remains incomplete in specialized, data-scarce domains, motivating extensive efforts to study synthetic data generation for knowledge injection. We propose SPA (Scaling Prompt-engineered Augmentation), a simple but tough-to-beat baseline that uses a small set of carefully designed prompts to generate large-scale synthetic data for knowledge injection. Through systematic comparisons, we find that SPA outperforms several strong baselines. Furthermore, we identify two key limitations of prior approaches: (1) while RL-based methods may improve the token efficiency of LLM-based data augmentation at small scale, they suffer from diversity collapse as data scales, leading to diminishing returns; and (2) while multi-stage prompting may outperform simple augmentation methods, their advantages can disappear after careful prompt tuning. Our results suggest that, for knowledge injection, careful prompt design combined with straightforward large-scale augmentation can be surprisingly effective, and we hope SPA can serve as a strong baseline for future studies in this area. Our code is available at https://github.com/Tangkexian/SPA.

View on arXivView PDF

Code Implementations(1)

Tangkexian/SPAOfficial100%

Code Implementation of SPA: A Simple but Tough-to-Beat Baseline for Knowledge Injection

100Shell, PythonMar 15, 20267 months ago

Similar Papers

Cite this paper

@article{tang2026spa,
  title  = {SPA: A Simple but Tough-to-Beat Baseline for Knowledge Injection},
  author = {Kexian Tang and Jiani Wang and Shaowen Wang and Kaifeng Lyu},
  year   = {2026},
  eprint = {2603.22213},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.22213v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.22213.svg)](https://codeofpaper.com/paper/2603.22213)

Discussion