Papers › Super Tickets in Pre-Trained Language Models: From Model Compression to Improving...

Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization

25 May 2021ACL 2021 5arXiv:2105.12002archive 2025-07-28

Chen Liang, Simiao Zuo, Minshuo Chen, Haoming Jiang, Xiaodong Liu, Pengcheng He, Tuo Zhao, Weizhu Chen

The Lottery Ticket Hypothesis suggests that an over-parametrized network consists of ``lottery tickets'', and training a certain collection of them (i.e., a subnetwork) can match the performance of the full model. In this paper, we study such a collection of tickets, which is referred to as ``winning tickets'', in extremely over-parametrized models, e.g., pre-trained language models. We observe that at certain compression ratios, the generalization performance of the winning tickets can not only match but also exceed that of the full model. In particular, we observe a phase transition phenomenon: As the compression ratio increases, generalization performance of the winning tickets first improves then deteriorates after a certain threshold. We refer to the tickets on the threshold as ``super tickets''. We further show that the phase transition is task and model dependent -- as the model size becomes larger and the training data set becomes smaller, the transition becomes more pronounced. Our experiments on the GLUE benchmark show that the super tickets improve single task fine-tuning by $0.9$ points on BERT-base and $1.0$ points on BERT-large, in terms of task-average score. We also demonstrate that adaptively sharing the super tickets across tasks benefits multi-task learning.

PaperPDFConference PDFCodeCode 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="2105.12002")

Code

Syntology Ran 5 of 15 code samples harvested from 1 repository linked to this paper; 10 have no recorded run. Of those that ran: 4 ran · honoured contract; 1 ran · our draft was wrong.

By repository: official repository: 15 samples from 1 repository, 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.

cliang1453/super-structured-lottery-tickets officialmentioned in papermentioned on GitHubpytorchMIT 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

15 samples harvested; 5 ran; 4 honoured the contract we drafted; 10 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 · our draft was wrong
10unverified

Licence: 13 of the 15 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 cliang1453/super-structured-lottery-tickets. “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.

gelu cliang1453/super-structured-lottery-tickets/module/modeling_bert.py official repository ran · honoured contract fingerprinted MIT recorded; this copy not marked cleared · pointer only · 211753ba29188d4e · report
gelu_new cliang1453/super-structured-lottery-tickets/module/modeling_bert.py official repository ran · honoured contract fingerprinted MIT recorded; this copy not marked cleared · pointer only · 77601724cad03f95 · report
linear cliang1453/super-structured-lottery-tickets/module/common.py official repository ran · honoured contract fingerprinted MIT (permissive) · 691b566282a42d88 · report
load_tf_weights_in_bert cliang1453/super-structured-lottery-tickets/module/modeling_bert.py official repository ran · our draft was wrong MIT recorded; this copy not marked cleared · pointer only · 0c145728a35789fa · report
warmup_linear_xdl cliang1453/super-structured-lottery-tickets/module/bert_optim.py official repository ran · honoured contract fingerprinted MIT (permissive) · dea985d5f4e928e8 · report
bertgelu cliang1453/super-structured-lottery-tickets/module/common.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 1294e1fa682e2b8c · report
build_data_single cliang1453/super-structured-lottery-tickets/extractor.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · a034fa2c801b129f · report
determine_masking_sequence cliang1453/super-structured-lottery-tickets/masking.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 3764f415f19251f4 · report
encode_pieces cliang1453/super-structured-lottery-tickets/data_utils/xlnet_utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 0de7059b7a331eb0 · report
load_data cliang1453/super-structured-lottery-tickets/extractor.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 273950f7bcb961ae · report
preprocess_text cliang1453/super-structured-lottery-tickets/data_utils/xlnet_utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · b19697c998adb1ea · report
printable_text cliang1453/super-structured-lottery-tickets/data_utils/xlnet_utils.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 0e5615f8994003cf · report
swish cliang1453/super-structured-lottery-tickets/module/common.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 47cf8803722c3336 · report
what_to_mask cliang1453/super-structured-lottery-tickets/masking.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · fca2c0b9e35c90c3 · report
what_to_threshold cliang1453/super-structured-lottery-tickets/masking.py official repository unverified MIT recorded; this copy not marked cleared · pointer only · 1218c6ee351ccc7f · report

Tasks

Model CompressionMulti-Task Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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