firehose> #llmops

When compute is the limiting factor in training a foundation model, the Chinchilla scaling law gives the compute-optimal split between model size and dataset size for a fixed compute budget. Its headline heuristic: the number of training tokens should be roughly 20× the number of parameters — so a 3B-parameter model wants on the order of 60B training tokens. It reframes "bigger model" as "the wrong question": for a given budget, an over-large model starved of data is a worse use of compute than a smaller model trained on proportionally more tokens. The law also frames the field's ceiling — parameter count estimates the compute needed for training and inference, but the cost of marginal quality keeps rising (going from a 3% to a 2% error rate can take an order of magnitude more data/compute/energy), and scaling runs into two hard limits: running out of high-quality internet text, and data-center electricity.

Claims


Linked from