Understanding Reasoning from Pretraining to Post-Training

· Source: Computation and Language · Field: Technology & Digital — Artificial Intelligence & Machine Learning · Depth: Expert, quick

Summary

A study investigates the interplay between pretraining and reinforcement learning (RL) in large language models (LLMs) for complex reasoning tasks. Using chess as a controlled testbed, models from 5M to 1B parameters were pretrained on human games, fine-tuned on synthetic traces, and then RL-trained on puzzles. Key findings indicate that post-RL performance at a given RL compute level is well-predicted by pretraining loss, and the slope of RL reward curves improves linearly with pretraining tokens. Furthermore, RL refines the supervised fine-tuning (SFT) policy by amplifying correct moves on easy puzzles and surfacing previously absent correct moves on hard ones. These patterns were also observed in a 1B language model trained on math-domain text, providing a quantitative account of the pretraining-to-RL interface.

Key takeaway

For AI Scientists and Machine Learning Engineers optimizing LLMs for reasoning, you should prioritize robust pretraining, as its quality and length directly predict post-RL performance and efficiency. Consider that RL doesn't just sharpen existing policies; it can uncover novel solutions for complex problems. Therefore, strategically invest in pretraining data and compute to maximize the returns from subsequent reinforcement learning efforts.

Key insights

Pretraining choices significantly determine the effectiveness and outcomes of subsequent reinforcement learning in LLMs for reasoning.

Principles

Method

The study employs controlled testbeds like chess and math-domain text to systematically analyze the full LLM pretraining-to-post-training pipeline, including supervised fine-tuning and RL.

In practice

Topics

Best for: Research Scientist, AI Scientist, Machine Learning Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Computation and Language.