Operationalising the Superficial Alignment Hypothesis via Task Complexity
Abstract
The superficial alignment hypothesis (SAH) posits that large language models learn most of their knowledge during pre-training, and that post-training merely surfaces this knowledge. The SAH, however, lacks a precise definition, which has led to (i) different and seemingly orthogonal arguments supporting it, and (ii) important critiques to it. We propose a new metric called task complexity: the length of the shortest program that achieves a target performance on a task. In this framework, the SAH simply claims that pre-trained models drastically reduce the complexity of achieving high performance on many tasks. Our definition unifies prior arguments supporting the SAH, interpreting them as different strategies to find such short programs. Experimentally, we estimate the task complexity of mathematical reasoning, machine translation, and instruction following; we then show that these complexities can be remarkably low when conditioned on a pre-trained model. Further, we find that pre-training enables access to strong performances on our tasks, but it can require programs of gigabytes of length to access them. Post-training, on the other hand, collapses the complexity of reaching this same performance by several orders of magnitude. Overall, our results highlight that task adaptation often requires surprisingly little information---often just a few kilobytes
Lay Summary
Large language models learn in two stages: a huge initial pre-training phase on lots of text, followed by post-training that fine-tunes their behaviour. A common claim, the Superficial Alignment Hypothesis, holds that models acquire most of their knowledge during pre-training and that post-training merely surfaces it. This paper makes that claim mathematically precise by measuring task complexity — the length of the shortest program needed to reach a target level of performance on a task. Across math reasoning, translation, and instruction following, we find that a pre-trained model can already reach strong performance with a relatively short program, which grounds the intuition that post-training does not add much new information.