LLMsLoading progress…

An experiment report

Assemble a tiny causal language-model experiment with a clear data split, baseline, training loop and evaluation.

The report

Finish by writing down what you did so someone else (or future you) can check it: the architecture, the token budget, how the data was split, the baseline, the results, the failure cases and how to reproduce the run. Export the model and tokenizer state with the instructions.

A worked count: a 400-token text split 320/80 gives 312 training and 72 validation windows at T = 8. Building windows before the split would give 392 windows, some of which cross the boundary.

steps200batch16window T8
token budget = 200 × 16 × 8 = 25,600 tokens = 6.4 passes over a 4,000-token training text
missing from the report: Baseline, Failure cases

A report also exports the model, the tokenizer/vocabulary and the instructions (including the seed) to repeat the experiment. If generation is still poor, say so and show the failing samples.

Choose which sections your report has and see what is missing.

Predict first. What should the report say if generation is still poor?

Chapter context

The capstone joins the earlier pieces into one inspectable experiment. The goal is to understand the model and its evidence, not to claim that a toy trained on a few paragraphs competes with a production assistant.

Chapter reference: math, worked example & code

This section belongs to the whole chapter, so it is the same on every lesson in it and may cover a different lesson's topic. The code for the experiment you just ran is inside the experiment itself.

Math and notation

For a token sequence of length n and context length T, stride-one windows containing T inputs and their shifted targets require T+1 original tokens. The number of complete windows is max(0,n-T). Keep this counting convention distinct from nonoverlapping batching.

Worked example

A 400-token text is split into 320 training tokens and 80 validation tokens before windowing. With T=8, the training part contains 320−8=312 complete shifted windows, while validation contains 72. Constructing windows before the split would risk overlap across the boundary.

Reference code

The following example uses the Python standard library and does not call a remote service.

text='abcd'*100
train,validation=text[:320],text[320:]
context=8
windows=[train[i:i+context+1] for i in range(len(train)-context)]
assert len(text) == 400
assert len(windows) == 312
assert all(len(w)==9 for w in windows)
assert len(validation)-context == 72

Python examples are provided for study and local execution; this page does not execute Python.

Common mistakes

Toy output quality is not a benchmark claim. Splitting overlapping windows after construction leaks shared text. Save the tokenizer and architecture configuration, not only raw weights.