Skip to content
Last Dictionary

IsoFLOP analysis

nounAlso: IsoFLOP profile, IsoFLOP curve, IsoFLOPs, iso-FLOP

In plain wordsA way of finding the best model size for a given amount of computing: train several models of different sizes at exactly the same computing cost and see which one ends up best.

  1. A method for estimating compute-optimal model size in which, for each of several fixed compute budgetscompute budget, n.: The total amount of computing a team can spend on training (or running) a model, set in advance like a money budget and used to decide how big the model should be and how much data it sees., models of different parameter counts are trained on token counts chosen so that every run uses the same number of FLOP (C ≈ 6ND). Plotting final loss against model size for one budget gives an IsoFLOP profile, typically U-shaped; its minimum, often located by fitting a parabola in log N, marks the optimal size. Repeating this across budgets and fitting power laws to the minima yields N_opt(C) and D_opt(C) for extrapolation to the full run. It was the second of three methods in the Chinchilla scaling lawsChinchilla scaling laws, n.: A 2022 DeepMind finding that, for a fixed amount of computing, language models had been made too big and trained on too little text; the best balance is roughly 20 word-pieces of text for every adjustable number inside the model. paper and has been used to size production models, notably Meta's Llama 3 405B. Each run needs a learning rate schedulelearning rate schedule, n.: A plan for changing how big a model's learning steps are during training — usually starting cautiously, then taking big steps, then smaller and smaller ones as it settles in. matched to its own length, which makes sweeps expensive; warmup-stable-decay scheduleswarmup-stable-decay schedule, n.: A plan for how fast a model learns during training: speed up briefly, hold steady for most of the run, then slow down sharply at the end — which lets labs stop or extend training without starting over. reduce the cost.

Origin

Named by Jordan Hoffmann and colleagues at DeepMind in the 2022 Chinchilla paper ('Approach 2: IsoFLOP profiles'), from iso- ('equal') and FLOP; comparing models at matched compute was older practice.

Related

See also
  • Chinchilla scaling lawsChinchilla scaling laws, n.: A 2022 DeepMind finding that, for a fixed amount of computing, language models had been made too big and trained on too little text; the best balance is roughly 20 word-pieces of text for every adjustable number inside the model.
  • compute-optimal trainingcompute-optimal training, n.: Choosing a model's size and the amount of data it trains on so that a fixed amount of computing produces the best possible model — neither too big and undertrained nor too small and overfed.
  • scaling lawsscaling laws, n.: Measured patterns showing that an AI model's error shrinks smoothly and predictably as the model is made bigger and given more data and computing power, so labs can forecast a giant model's performance from small, cheap experiments.
  • compute budgetcompute budget, n.: The total amount of computing a team can spend on training (or running) a model, set in advance like a money budget and used to decide how big the model should be and how much data it sees.
  • FLOPFLOP, n.: A single arithmetic step, such as multiplying or adding two numbers. Counting them measures how much computing went into an AI model, and laws use such counts to decide which models face extra rules.

Sources

  1. Hoffmann, J. et al. (2022). Training Compute-Optimal Large Language Models. arXiv:2203.15556. arxiv.org/abs/2203.15556v1
  2. Grattafiori, A. et al. (2024). The Llama 3 Herd of Models. arXiv:2407.21783.

Mentioned in

scaling lawsscaling laws, n.: Measured patterns showing that an AI model's error shrinks smoothly and predictably as the model is made bigger and given more data and computing power, so labs can forecast a giant model's performance from small, cheap experiments., Chinchilla scaling lawsChinchilla scaling laws, n.: A 2022 DeepMind finding that, for a fixed amount of computing, language models had been made too big and trained on too little text; the best balance is roughly 20 word-pieces of text for every adjustable number inside the model., compute-optimal trainingcompute-optimal training, n.: Choosing a model's size and the amount of data it trains on so that a fixed amount of computing produces the best possible model — neither too big and undertrained nor too small and overfed., warmup-stable-decay schedulewarmup-stable-decay schedule, n.: A plan for how fast a model learns during training: speed up briefly, hold steady for most of the run, then slow down sharply at the end — which lets labs stop or extend training without starting over.