← All parts of this equation

Equation 11 · Part 7 · OpenAI Model Systems from First Principles: Weights, Post-Training, and Inference Compute

≈

L(N)≈L∞+(NcN)αNL(N) \approx L_\infty + \left(\frac{N_c}{N}\right)^{\alpha_N}
≈

What this part means

Approximately equal to; the equality is not exact.

Its job in the formula

Approximately equal to; the equality is not exact.

The passage around this formula

with N parameters and D training tokens, the factor of six counting the forward and backward passes. Empirically, test loss falls as a power law in each of parameters, data, and compute over many orders of magnitude, a relationship first characterised systematically by Kaplan and colleagues [ 5 ] . The important structural feature is the functional form: a term of the shape L(N)≈L∞+(NcN)αNL(N) \approx L_\infty + \left(\frac{N_c}{N}\right)^{\alpha_N}. has an irreducible floor L∞L_\infty and diminishing returns above it. Doubling N buys a fixed decrement in loss, not a fixed multiple of capability.

Read this part in the article →

Learn the underlying idea

A variable is a named place for a value. Its letter is a local label: x can mean position in one formula and a data point in another.

Open the illustrated variables: a letter stands for a value guide →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.