about
Measuring the Effects of Data Parallelism on Neural Network Training [pdf] (arxiv.org)
1 point by stablemap on Nov 9, 2018 | hide | past | pdf | discuss on HN

In plain words: They trained networks at several batch sizes—how many examples are used before each update—to count the steps needed to reach a target error. Results varied hugely by task, but bigger batches never hurt final accuracy; past disagreements came from tuning and compute budgets.

Abstract · Measuring the Effects of Data Parallelism on Neural Network Training

Recent hardware developments have dramatically increased the scale of data parallelism available for neural network training. Among the simplest ways to harness next-generation hardware is to increase the batch size in standard mini-batch neural network training algorithms. In this work, we aim to experimentally characterize the effects of increasing the batch size on training time, as measured by the number of steps necessary to reach a goal out-of-sample error. We study how this relationship varies with the training algorithm, model, and data set, and find extremely large variation between workloads. Along the way, we show that disagreements in the literature on how batch size affects model quality can largely be explained by differences in metaparameter tuning and compute budgets at different batch sizes. We find no evidence that larger batch sizes degrade out-of-sample performance. Finally, we discuss the implications of our results on efforts to train neural networks much faster in the future. Our experimental data is publicly available as a database of 71,638,836 loss measurements taken over the course of training for 168,160 individual models across 35 workloads.

Christopher J. Shallue, Jaehoon Lee, Joseph Antognini, Jascha Sohl-Dickstein, Roy Frostig, George E. Dahl
arXiv:1811.03600 · cs.LG, stat.ML · submitted Nov 8, 2018 · updated Jul 19, 2019
abstract · pdf · html

add comment on HN