Test-Time Compute Scaling in Large Language Models: How Search, Verification, and Reasoning Chains Trade Latency for Accuracy
Large language model performance has historically been dictated by pre-training compute scaling laws. As formalised by Kaplan et al. and Chinchilla scaling, increasing model parameters, dataset size, and pre-training FLOPs yielded predictable reductions in cross-entropy loss. During inference, however, computation remained strictly linear and deterministic: one forward pass per generated token. The emergence of inference-time reasoning architectures has introduced a third scaling axis: test-tim
1 min