2021/02/02 by Danny Hernandez, Jared Kaplan, Hernandez, Danny +5 · 1 voice · 50 citations
Computer Science · Mathematics · #Artificial intelligence #Computer science #Domain Adaptation and Few-Shot Learning #Entropy (arrow of time) #FOS: Computer and information sciences #Generality #Generative Adversarial Networks and Image Synthesis #Machine Learning (cs.LG) #Mathematics #Physics #Power law #Scaling #Scaling law #Scratch #Statistics #Topic Modeling #Transfer of learning #cs.LG
paper · pdf · doi:10.48550/arxiv.2102.01293
published in arXiv (Cornell University) (Cornell University) · 19 pages, 15 figures
arxiv created 2021/02/02 · openalex publication_date 2021/02/02 · arxiv published 2021/02/02 · arxiv updated 2021/02/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study empirical scaling laws for transfer learning between distributions in an unsupervised, fine-tuning setting. When we train increasingly large neural networks from-scratch on a fixed-size dataset, they eventually become data-limited and stop improving in performance (cross-entropy loss). When we do the same for models pre-trained on a large language dataset, the slope in performance gains is merely reduced rather than going to zero. We calculate the effective data "transferred" from pre-training by determining how much data a transformer of the same size would have required to achieve the same loss when training from scratch. In other words, we focus on units of data while holding everything else fixed. We find that the effective data transferred is described well in the low data regime by a power-law of parameter count and fine-tuning dataset size. We believe the exponents in these power-laws correspond to measures of the generality of a model and proximity of distributions (in a directed rather than symmetric sense). We find that pre-training effectively multiplies the fine-tuning dataset size. Transfer, like overall performance, scales predictably in terms of parameters, data, and compute.