Papers › Large Batch Training of Convolutional Networks

Large Batch Training of Convolutional Networks

13 Aug 2017arXiv:1708.03888archive 2025-07-28

Yang You, Igor Gitman, Boris Ginsburg

A common way to speed up training of large convolutional networks is to add computational units. Training is then performed using data-parallel synchronous Stochastic Gradient Descent (SGD) with mini-batch divided between computational units. With an increase in the number of nodes, the batch size grows. But training with large batch size often results in the lower model accuracy. We argue that the current recipe for large batch training (linear learning rate scaling with warm-up) is not general enough and training may diverge. To overcome this optimization difficulties we propose a new training algorithm based on Layer-wise Adaptive Rate Scaling (LARS). Using LARS, we scaled Alexnet up to a batch size of 8K, and Resnet-50 to a batch size of 32K without loss in accuracy.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 5 code samples harvested from 5 repositories linked to this paper: 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 5 samples from 5 repositories, 4 ran (4 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 5 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

NUS-HPC-AI-Lab/LARS-ImageNet-PyTorch mentioned on GitHubpytorchSyntology: 1 sample, 0 ran · 1 unverified report
facebookresearch/ClassyVision mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to mixup: Beyond Empirical Risk Minimization (arXiv:1710.09412; that paper's own run record: 36 ran (of which 5 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 22 where Syntology's instrument failed) · 11 unverified), EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks (arXiv:1905.11946; that paper's own run record: 198 ran (of which 73 constructed an object rather than computing a result; 157 with no instrument failure: 26 honoured, 2 violated, 129 with no contract checked; 41 where Syntology's instrument failed) · 104 unverified) and An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale (arXiv:2010.11929; that paper's own run record: 307 ran (of which 165 constructed an object rather than computing a result; 286 with no instrument failure: 8 honoured, 2 violated, 276 with no contract checked; 21 where Syntology's instrument failed) · 112 unverified); nothing checks that they implement this paper's method. report
facebookresearch/vissl mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles (arXiv:1603.09246; that paper's own run record: 10 ran (of which 6 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified), Unsupervised Representation Learning by Predicting Image Rotations (arXiv:1803.07728; that paper's own run record: 16 ran (of which 7 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified), BEiT: BERT Pre-Training of Image Transformers (arXiv:2106.08254; that paper's own run record: 6 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified) and 1 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
frgfm/Holocron mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
jxbz/fromage mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
kakaobrain/torchlars mentioned on GitHubpytorchSyntology: not harvested report
krafton-ai/mini-batch-cl mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
lulor/ood-class-separation mentioned on GitHubpytorchSyntology: not harvested report
noahgolmant/pytorch-lars mentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
optimization-ai/sogclr mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Simple Framework for Contrastive Learning of Visual Representations (arXiv:2002.05709; that paper's own run record: 115 ran (of which 33 constructed an object rather than computing a result; 89 with no instrument failure: 1 honoured, 1 violated, 87 with no contract checked; 26 where Syntology's instrument failed) · 22 unverified); nothing checks that they implement this paper's method. report
sylviesss/pytorch-simclr mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Simple Framework for Contrastive Learning of Visual Representations (arXiv:2002.05709; that paper's own run record: 115 ran (of which 33 constructed an object rather than computing a result; 89 with no instrument failure: 1 honoured, 1 violated, 87 with no contract checked; 26 where Syntology's instrument failed) · 22 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/FleetX paddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to MoESys: A Distributed and Efficient Mixture-of-Experts Training and Inference System... (arXiv:2205.10034; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

5 samples harvested: 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

4ran
1unverified

Licence: 1 of the 5 samples is pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 5 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

NUS-HPC-AI-Lab/LARS-ImageNet-PyTorch community (archive-listed) 1 sample, 0 ran · 1 unverified
Lars lars.py unverified MIT (permissive) · af8abbe0acb62ad6 · report
frgfm/Holocron community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
LARS holocron/optim/lars.py ran · metamorphic tier: deterministic Apache-2.0 (permissive) · 4c2823d62e6b5ca1 · report fixture: returned LARS · level recorded 2026-09-22
jxbz/fromage community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
Lars generate-cifar/lars.py ran licence not identified · pointer only · f189d069869671ac · report fixture: returned Lars · level recorded 2026-09-22
krafton-ai/mini-batch-cl community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
LARS sogclr/optimizer.py ran Apache-2.0 (permissive) · 350b8435032a7c95 · report fixture: returned LARS · level recorded 2026-09-22
noahgolmant/pytorch-lars community (archive-listed) 1 sample, 1 ran (0 instrument-failed) · 0 unverified
LARS lars.py ran MIT (permissive) · 2b456b26b38fabeb · report fixture: returned LARS · level recorded 2026-09-22

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. Siblings are assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another.

5 assemblies on this paper: 5 harvested, 0 generated, listed in 1 groups (siblings lifted in one batch form one group).

5 sibling assemblies for Layer-wise Adaptive Rate Scaling (LARS) (harvested), lifted in the same batch on 2026-09-09: alternative readings kept side by side; none replaces or supersedes another.

harvested Assembly for Layer-wise Adaptive Rate Scaling (LARS) (graph method: Layer-wise Adaptive Rate Scaling (LARS)). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 5 siblings

  1. LARS entry · level 1 · ran · 4c2823d62e6b5ca1

harvested Assembly for Layer-wise Adaptive Rate Scaling (LARS) (graph method: Layer-wise Adaptive Rate Scaling (LARS)). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 5 siblings

  1. LARS entry · level 1 · ran · 350b8435032a7c95

harvested Assembly for Layer-wise Adaptive Rate Scaling (LARS) (graph method: Layer-wise Adaptive Rate Scaling (LARS)). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 5 siblings

  1. LARS entry · level 1 · ran · 2b456b26b38fabeb

harvested Assembly for Layer-wise Adaptive Rate Scaling (LARS) (graph method: Layer-wise Adaptive Rate Scaling (LARS)). 1 brick; individually on a fixture: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result. The assembly has not been run end-to-end.

one of 5 siblings

  1. Lars entry · level 1 · ran · f189d069869671ac

harvested Assembly for Layer-wise Adaptive Rate Scaling (LARS) (graph method: Layer-wise Adaptive Rate Scaling (LARS)). 1 brick; individually on a fixture: 0 ran · 1 unverified. The assembly has not been run end-to-end.

one of 5 siblings

  1. Lars entry · level 0 · unverified · af8abbe0acb62ad6

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="1708.03888") returns these assemblies with each brick's role and wiring (how to connect).

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: LARS

LARSSPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections