Papers › Scale Efficiently: Insights from Pre-training and Fine-tuning Transformers

Scale Efficiently: Insights from Pre-training and Fine-tuning Transformers

22 Sep 2021arXiv:2109.10686archive 2025-07-28

Yi Tay, Mostafa Dehghani, Jinfeng Rao, William Fedus, Samira Abnar, Hyung Won Chung, Sharan Narang, Dani Yogatama, Ashish Vaswani, Donald Metzler

There remain many open questions pertaining to the scaling behaviour of Transformer architectures. These scaling decisions and findings can be critical, as training runs often come with an associated computational cost which have both financial and/or environmental impact. The goal of this paper is to present scaling insights from pretraining and finetuning Transformers. While Kaplan et al. presents a comprehensive study of the scaling behaviour of Transformer language models, the scope is only on the upstream (pretraining) loss. Therefore, it is still unclear if these set of findings transfer to downstream task within the context of the pretrain-finetune paradigm. The key findings of this paper are as follows: (1) we show that aside from only the model size, model shape matters for downstream fine-tuning, (2) scaling protocols operate differently at different compute regions, (3) widely adopted T5-base and T5-large sizes are Pareto-inefficient. To this end, we present improved scaling protocols whereby our redesigned models achieve similar downstream fine-tuning quality while having 50\% fewer parameters and training 40\% faster compared to the widely adopted T5-base model. We publicly release over 100 pretrained checkpoints of different T5 configurations to facilitate future research and analysis.

PaperPDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2109.10686")

Code

Syntology Ran 5 of 12 code samples harvested from 2 repositories linked to this paper; 7 have no recorded run. Of those that ran: 4 ran · honoured contract; 1 ran with no contract checked.

By repository: community (archive-listed): 12 samples from 2 repositories, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

aaronmueller/emergent-syntax mentioned on GitHubMIT report
gsarti/it5 mentioned on GitHubpytorchApache-2.0 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.

Code Syntology ran Syntology

12 samples harvested; 5 ran; 4 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

4ran · honoured contract
1ran
7unverified

Licence: 0 of the 12 samples are 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

compute_input_and_target_lengths aaronmueller/emergent-syntax/run_t5_mlm_flax.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · eb29f6682a2426ad · report
exact_match aaronmueller/emergent-syntax/models/metrics.py community (archive-listed) ran · honoured contract MIT (permissive) · 66552297bbb6cd38 · report
first_word aaronmueller/emergent-syntax/models/metrics.py community (archive-listed) ran · honoured contract MIT (permissive) · 30008b8c34f29539 · report
generate_batch_splits aaronmueller/emergent-syntax/run_t5_mlm_flax.py community (archive-listed) ran MIT (permissive) · 26eb4e2856b3d7a1 · report
second_word aaronmueller/emergent-syntax/models/metrics.py community (archive-listed) ran · honoured contract MIT (permissive) · bd0d4ea62311e45d · report
evaluate_predictions aaronmueller/emergent-syntax/models/pred_eval.py community (archive-listed) unverified MIT (permissive) · 0c5a6c34f4b57d8b · report
get_bsz gsarti/it5/finetuning/vars.py community (archive-listed) unverified Apache-2.0 (permissive) · a747070e3ebf347f · report
get_bsz gsarti/it5/inference/vars.py community (archive-listed) unverified Apache-2.0 (permissive) · d79ddc3312ab8f78 · report
get_dirs aaronmueller/emergent-syntax/analysis/plot_scaling.py community (archive-listed) unverified MIT (permissive) · 219961813fa6d977 · report
get_lr gsarti/it5/finetuning/vars.py community (archive-listed) unverified Apache-2.0 (permissive) · c4f59346ce8a05d9 · report
get_params gsarti/it5/inference/vars.py community (archive-listed) unverified Apache-2.0 (permissive) · f74861ceb9e003dd · report
get_time gsarti/it5/finetuning/vars.py community (archive-listed) unverified Apache-2.0 (permissive) · 07d60309bc634d37 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdafactorAdamAttentionAttention DropoutBPEDense ConnectionsDropoutGated Linear UnitInverse Square Root ScheduleLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSentencePieceSoftmaxT5Transformer

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