Shaping capabilities with token-level data filtering
Neil Rathi, Alec Radford
TL;DR
This work investigates shaping model capabilities by filtering pretraining data at the token level, focusing on a medical forget domain as a proxy for undesired capabilities. It demonstrates that token-level filtering outperforms document-level filtering in both effectiveness and efficiency, and that its benefits scale with model size, producing large compute savings for forget-related capabilities. The authors introduce a weakly supervised pipeline using sparse autoencoders to label forget tokens and train cheap token-level classifiers, showing that even imperfect labels can yield strong filtering when scaled. Additionally, token-level filtering preserves alignment and enables refined control such as refusal training, contrasting with unlearning and other posthoc safeguards. The results advocate for token-level data filtering as a scalable, robust, and safer approach to shaping capabilities during pretraining, while highlighting avenues for improved evaluation and broader safeguards against misuse.
Abstract
Current approaches to reducing undesired capabilities in language models are largely post hoc, and can thus be easily bypassed by adversaries. A natural alternative is to shape capabilities during pretraining itself. On the proxy task of removing medical capabilities, we show that the simple intervention of filtering pretraining data is highly effective, robust, and inexpensive at scale. Inspired by work on data attribution, we show that filtering tokens is more effective than filtering documents, achieving the same hit to undesired capabilities at a lower cost to benign ones. Training models spanning two orders of magnitude, we then demonstrate that filtering gets more effective with scale: for our largest models, token filtering leads to a 7000x compute slowdown on the forget domain. We also show that models trained with token filtering can still be aligned on the forget domain. Along the way, we introduce a methodology for labeling tokens with sparse autoencoders and distilling cheap, high-quality classifiers. We also demonstrate that filtering can be robust to noisy labels with sufficient pretraining compute.
