Scaling Laws for Neural Language Models

By Jared Kaplan, Jared Kaplan, Sam McCandlish, T. Henighan, Tom B. Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeff Wu and 1 more. arXiv.org, 2020

8,567 citations recorded by the source corpus.

We study empirical scaling laws for language model performance on the cross-entropy loss. The loss scales as a power-law with model size, dataset size, and the amount of compute used for training, with some trends spanning more than seven orders of magnitude. Other architectural details such as network width or depth have minimal effects within a wide range. Simple equations govern the dependence of overfitting on model/dataset size and the dependence of training speed on model size. These relationships allow us to determine the optimal allocation of a fixed compute budget. Larger models are significantly more sample-efficient, such that optimally compute-efficient training involves training very large models on a relatively modest amount of data and stopping significantly before convergence.

Subfields: Artificial Intelligence, Large Language Models, Scaling & Learning Theory

View Paper: https://arxiv.org/abs/2001.08361

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Jianfeng Gao
  3. Luke S. Zettlemoyer
  4. Percy Liang
  5. Quoc V. Le
  6. Yoshua Bengio
  7. Yejin Choi
  8. Graham Neubig

In Large Language Models

  1. Luke S. Zettlemoyer
  2. Yejin Choi
  3. Hinrich Schütze
  4. Jianfeng Gao
  5. Hannaneh Hajishirzi
  6. Noah A. Smith
  7. Mohit Bansal
  8. Furu Wei

In Scaling & Learning Theory

  1. Tengyu Ma
  2. Greg Yang
  3. Behnam Neyshabur
  4. Lechao Xiao
  5. Sam Schoenholz
  6. Hanie Sedghi
  7. Luke S. Zettlemoyer
  8. Jaehoon Lee

Citations in the corpus