about
Cramming: Training a Language Model on a Single GPU in One Day (arxiv.org)
3 points by jonbaer on Jan 3, 2023 | hide | past | pdf | discuss on HN

In plain words: A text model can be trained from scratch on one ordinary graphics card in a single day by reworking every step of the training pipeline. It nearly matches BERT on language tasks, and its performance follows the scaling patterns seen in huge training runs.

Abstract

Recent trends in language modeling have focused on increasing performance through scaling, and have resulted in an environment where training language models is out of reach for most researchers and practitioners. While most in the community are asking how to push the limits of extreme computation, we ask the opposite question: How far can we get with a single GPU in just one day? We investigate the downstream performance achievable with a transformer-based language model trained completely from scratch with masked language modeling for a single day on a single consumer GPU. Aside from re-analyzing nearly all components of the pretraining pipeline for this scenario and providing a modified pipeline with performance close to BERT, we investigate why scaling down is hard, and which modifications actually improve performance in this scenario. We provide evidence that even in this constrained setting, performance closely follows scaling laws observed in large-compute settings. Through the lens of scaling laws, we categorize a range of recent improvements to training and architecture and discuss their merit and practical applicability (or lack thereof) for the limited compute setting.

Jonas Geiping, Tom Goldstein
arXiv:2212.14034 · cs.CL, cs.LG · submitted Dec 28, 2022
abstract · pdf · html · 22 pages, we provide code at https://github.com/JonasGeiping/cramming

add comment on HN
Also discussed: Nov 2024 (3 points, 0 comments) · Apr 2024 (2 points, 0 comments) · Jan 2023 (2 points, 1 comment) · Jan 2023 (2 points, 0 comments) · Dec 2022 (6 points, 0 comments)