AI Engineer World's Fair 2026
The Messy Reality of Scale: Synthetic Data and Pre-Training
Loading slides…
Read the talk
The Messy Reality of Scale: Synthetic Data and Pre-Training
Scaling a coding model means expanding what its data can teach while checking that thousands of GPUs still compute what the training recipe intends.
From a talk by Marah Abdin and Robert McHardy
Before you start: Familiarity with language-model pre-training, gradients, and the basic idea of distributed training will help with the numerical failure examples.
What has to change when a training recipe scales?
What has to change when a model needs more training than its original data and implementation can support? Poolside’s successive Laguna releases make that question concrete. With Laguna M.1 and Laguna XS.2, the company expanded from enterprise releases to publicly downloadable weights. The generation suffixes reflect changes to the recipe, not just differences in model size. Marah Abdin, who leads synthetic data, begins with the data changes; Robert McHardy follows with the distributed training failures that helped motivate the next generation. Their technical report documents the released models.
The data work proceeds along three complementary paths:
- AutoMixer: Run cheaper sweeps over clusters of datasets before committing to expensive training experiments.
- High-recall web sampling: Reconsider which web material enters the corpus, broadening the supply of useful organic data.
- Synthetic generation: Produce additional training material through several kinds of transformation and generation pipelines.
These changes address different parts of the same problem: finding useful material, deciding how much of it to train on, and making more of its teaching signal available.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Expose what organic data leaves implicit
Synthetic data complements organic data by making its implicit teaching signals explicit. A document can contain useful reasoning without presenting the rationale, planning, or structure in a form that is easy to learn. Generation can expose those features, present them in another form, and fill gaps in the original material. Abdin treats this as a way to regularize both the presentation of tokens and what those tokens teach, rather than as a replacement for organic data.
Synthetic data accounted for 13% of XS.2’s pre-training mix, before post-training. Abdin reports that the continually growing synthetic corpus had reached six trillion tokens by the time of the talk. The mix fraction and the corpus size describe different things: the former is a share of training data, while the latter is the pool of generated material available to draw from.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
More training makes repetition a bottleneck
The initial data strategy emphasized quality over quantity. At a smaller training budget, that was a reasonable starting point. As models and training budgets grew, however, the same high-quality material appeared too often. Repeated exposure began saturating the model earlier than the team wanted. The shortage was not simply a shortage of tokens; it was a shortage of useful, distinct material within those tokens.
Rephrasing provides a relatively inexpensive response, also explored in work such as BeyondWeb. The ablation shown in the recording compares repeated seed documents, in orange, with a mixture that replaces some repeated tokens with multimode rewrites, in green. Abdin emphasizes the consistent qualitative benefit of reducing repetition, while warning against reading too much into the particular ablation numbers. The comparison concerns replacing some repeated exposure, not discarding the original seeds.
Poolside used a generic multimode rephrasing pipeline, then added two specialized paths: one transforms raw code into code plus text, and another targets STEM documents. Cheap rephrasing remains heavily dependent on the seed: the generator has to get much of the substance from its input. Specializing the transformation gives the team more control over how that substance becomes training material, particularly for STEM content.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Make the task fit the generator
A modular pipeline makes these transformations easier to vary. Abdin describes seeds as primary inputs, metadata as secondary inputs, a generator function, and supplementary functions such as filters and validators. The companion report organizes the framework into six component types: inputs, metadata, generator, filtering, validation, and pre- or post-processing. The generator itself can be a prompted LLM or an agent with tools; the surrounding components determine what it receives and which outputs survive.
This framework spans very different cost profiles. Seed-heavy transformations such as rephrasing can use smaller models and scale cheaply. More elaborate workflows spend additional orchestration on outputs valuable enough to justify it, such as educational material. That extra structure also offers a way around the limits of a teacher model: when the full task is too difficult, reduce the difficulty of each generation step. Abdin’s rule of thumb is that an overchallenged model falls back on its biases and loses both correctness and diversity. Decomposition helps preserve those properties while building a more ambitious result.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
From rewriting to iterative generation
The first reusable shape is form rewriting: retain source material while changing how it is expressed. The next is multistage construction, where successive steps build and aggregate a larger output. Abdin illustrates the difference with a novel. Generating chapters one at a time is already a decomposition, but the workflow can first establish the material those chapters will depend on:
- Generate the setting.
- Establish character names and styles.
- Develop the plot and its twists.
- Use that groundwork to generate chapters sequentially.
Each chapter then has more structure to work from than a request to continue an otherwise unplanned story.
Two further shapes change either the representation or the interaction:
- Cross-domain porting: Translate code between languages, or turn math problems into code. Poolside used the latter to move existing mathematical material into a coding form.
- Multi-turn roleplay: Let generation evolve through interaction. Examples include two agents holding a conversation, or a judge and an evolver alternating for
Kiterations in a task-evolution pipeline.
The iterative pattern lets later generations respond to earlier outputs instead of following only a fixed sequence of transformations.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Hive configures who generates what next
Hive turns this modular view into configurable generation infrastructure. A queue contains agents with specified prompts, parameters, models, inputs, and outputs. Configuration also controls when an agent enters or exits the queue, how many agents enter, and how frequently they appear. That separates an agent’s individual generation task from the scheduling of the overall workflow.
Orchestrators sit between agents. They can change the instructions passed to the next agent, select which agent runs next, or skip an agent altogether. This hierarchy constrains generation while leaving room for the workflow to respond creatively to intermediate results. A supervisor operates above the orchestrators with a global view, checking the decisions made at that level. The result is a configurable control structure for both staged and iterative generation.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Check the training system’s invariants
Better data only helps if the training implementation is correct. McHardy treats data quality, architecture, distributed training, and implementation correctness as one system: a serious defect in any of them can prevent a good model from emerging. At billions to hundreds of billions of parameters across thousands of GPUs, assumptions need explicit checks.
One such check is replica-weight hashing. In distributed data parallel training, corresponding model replicas should hold identical weights at synchronized check points. Poolside periodically hashes those weights and compares the results. Matching hashes let training continue; a mismatch crashes the run because an invariant has been violated.
The comparison step can be expressed as a small Python guard. Its input is the set of hashes already collected from corresponding replicas at the same check point:
python
from collections.abc import Mapping
def check_replica_hashes(hashes: Mapping[int, str]) -> None:
if not hashes:
raise ValueError("No replica hashes were collected")
reference_rank = min(hashes)
reference_hash = hashes[reference_rank]
mismatched_ranks = [
rank for rank, digest in hashes.items()
if digest != reference_hash
]
if mismatched_ranks:
raise RuntimeError(
f"Replica weights differ from rank {reference_rank}: "
f"{sorted(mismatched_ranks)}"
)
This guard checks agreement among the supplied hashes. It does not establish that every operation producing those weights was correct.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
The same run, with one broken GPU
The first failure example shows two runs with the same model configuration, training data, and training implementation. Their curves nevertheless look very different: the purple run has bumps and spikes in its loss, accompanied by much larger gradient norms. Those symptoms might initially look like a problem with the training recipe.
The difference was a broken GPU. It silently corrupted data in one run, producing the abnormal training behavior. In this instance, the corruption also broke agreement among replicas, so the weight-hash check could detect it. The invariant converted a hardware fault that might otherwise masquerade as an optimization problem into a reason to stop training.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
A local precision choice stops the whole model learning
The next failure appeared later in Laguna M.1 training. McHardy reports that the initial run stopped converging at around 50,000 steps. Its loss flattened while activations immediately before the LM head, or unembedding, kept growing. Because the unembedding used tensor parallelism, it required an accumulation operation across the partitioned computation.
That accumulation used BF16 by default. As activation magnitudes grew, the available numerical precision became insufficient for an accurate accumulation. The resulting error occurred at a particularly consequential location: its effects propagated backward from the output head through the model trunk. A locally inadequate numerical operation could therefore impair learning throughout the model.
The team resumed from the affected checkpoint after moving that accumulation to FP32. Convergence returned, and gradient norms began decreasing instead of following their earlier increasing trend. The intervention was specific: increase precision for the problematic accumulation, not move the entire training run to FP32. It also illustrates why an implementation that behaves well early in training may fail after activation scales change.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Carry the revised recipe into Laguna S
XS.2 incorporated the lessons from M.1 across the whole training system: greater data diversity, less repetition, numerical fixes, more observability and checks, and improvements to training and architecture. The open-weight XS.2 model focuses on agentic coding. McHardy describes XS.2 as a 33-billion-parameter model, making it a useful test bed but not the final test of whether the revised recipe would hold at greater scale.
Laguna S supplied that larger test and was still a nonpublic preview in the recording. McHardy reports 118 billion total parameters, eight billion active parameters, and training on 30 trillion tokens using 4,000 GPUs. This run tested whether the data and architecture improvements transferred, and whether numerical problems would return under a larger workload.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Matching weights can hide incorrect computation
Another failure appeared after the team added FP8 training based on DeepGEMM kernels. McHardy explicitly distinguishes this from a failure inherently caused by scale: it was a race condition. Illegal memory accesses and NaN gradients provided visible symptoms, and debugging eventually traced them to the kernels.
There was also a quieter symptom: McHardy reports that about 0.5% of the gradient was silently corrupted, effectively replaced with random values, in the observed case. At the time of the talk, the team had made a fix available in a public pull request, but it had not yet been merged into DeepGEMM.
This exposed a blind spot in replica hashing. Normal data parallel training does not redundantly execute the same forward and backward computation with both identical weights and identical data: replicas process different data. Agreement among their weights therefore cannot establish that those computations were themselves correct.
| Check | What must match | What it establishes |
|---|---|---|
| Replica-weight comparison | Weights at corresponding check points | Replicas agree on model state |
| Redundant computation check | Weights and input data | Repeated forward/backward results can be compared |
The second check requires deliberately creating the redundancy that normal training lacks. McHardy describes work on such a checker, at least for a dry run; it was a planned extension, not an already demonstrated safeguard.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Read the results through the coding objective
The final comparisons concern base-model evaluations, with post-training still underway. They are signals about the pre-training recipe, not a guarantee of the finished model’s behavior. McHardy cautions that the results will not necessarily transfer one-to-one after post-training.
On coding evaluations including MultiPL-E, LiveCodeBench, and BigCodeBench, McHardy reports Laguna S ahead of XS.2 and the much larger M.1, as well as GLM-4.5-Air, Nemotron 3 Super, and DeepSeek V4 Flash Max in the displayed comparison. He identifies GLM-4.5-Air as an older comparator and the latter two as recent models, with DeepSeek also larger.
The results were not uniformly leading. McHardy describes Laguna S as competitive but not best on BIG-Bench Hard, and close to competitors on EvalPlus. On SWE-bench Agentless Multilingual, which Poolside used as a proxy for agentic performance during pre-training, he reports Laguna S ahead of every other model tested in the comparison. That distinction matters for a team optimizing specifically for agentic coding.
MMLU-Pro exposes the other side of that specialization. McHardy reports that Nemotron and DeepSeek performed substantially better than Laguna S on MMLU-Pro. He attributes the gap mainly to data and treats broader knowledge coverage as a lower priority than coding, rather than claiming the model is strongest across all tasks.
The larger result is that the combined recipe held at the tested scale: changes to data, numerics, architecture, and checking all carried into the next model. Poolside intended to continue scaling from there. The recording closes with a commitment to release Laguna S as freely downloadable open weights relatively soon, without a firm date.
Suggest correction
This note stays in this page until you copy or download it. Nothing is submitted; reloading clears the draft.
Resources
From the talk
Poolside's account of model architecture, pre-training data, synthetic generation, Hive, AutoMixer, and post-training.
Downloadable model weights and instructions for running Poolside's XS.2 coding model.
Research on synthetic pre-training data, including source selection, rephrasing, and generator choices.
DeepSeek's GPU kernel library, including FP8 matrix multiplication implementations.
Updates since the talk
Current model specifications, weight links, usage examples, and evaluation methodology for Laguna S 2.1 and XS 2.1.
Full transcript
Loading transcript…