Computational Bottlenecks of Training Small-scale Large Language Models
Saleh Ashkboos, Iman Mirzadeh, Keivan Alizadeh, Mohammad Hossein Sekhavat, Moin Nabi, Mehrdad Farajtabar, Fartash Faghri
TL;DR
This paper investigates the training bottlenecks of Small-scale Language Models (up to 2B parameters) on cloud hardware, using a cost-aware framework that blends tokens-per-second with loss-per-token to derive Loss/Dollar. Through a broad grid search across GPU types, batch sizes, communication schemes, and attention mechanisms, the authors quantify practical trade-offs for cost-efficient training. Key findings show that FlashAttention substantially improves cost-efficiency for SLMs, that expensive GPUs are not always worthwhile, and that Distributed Data Parallel remains effective for smaller models while Fully Sharded Data Parallel excels for larger models with bigger batch sizes. The work provides actionable, hardware-aware guidance to researchers and organizations with limited resources, aiming to democratize access to training capable SLMs.
Abstract
While large language models (LLMs) dominate the AI landscape, Small-scale large Language Models (SLMs) are gaining attention due to cost and efficiency demands from consumers. However, there is limited research on the training behavior and computational requirements of SLMs. In this study, we explore the computational bottlenecks of training SLMs (up to 2B parameters) by examining the effects of various hyperparameters and configurations, including GPU type, batch size, model size, communication protocol, attention type, and the number of GPUs. We assess these factors on popular cloud services using metrics such as loss per dollar and tokens per second. Our findings aim to support the broader adoption and optimization of language model training for low-resource AI research institutes.
