Yanan Cao, Jie Zhou, Yuanxin Liu, Fandong Meng, Zheng Lin, Jiangnan Li, Peng Fu, Weiping Wang
1 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2210.05211.json · badge: /api/ran/2210.05211.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| llyx97/sparse-and-robust-PLM | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| mish | Ran ran; our contract draft was wrong, not the code |
llyx97/sparse-and-robust-PLM/hg_transformers/modeling_bert.py pointer only (licence: NONE) · get_code("060527bb34794b59") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, llyx97/sparse-and-robust-PLM when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| load_tf_weights_in_bert | Not yet run unverified (harvested, no recorded run) |
llyx97/sparse-and-robust-PLM/hg_transformers/modeling_bert.py pointer only (licence: NONE) · get_code("0766f48ad6e01b56") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, llyx97/sparse-and-robust-PLM when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 2 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| mish | 19 other papers 9 dated earlier, 1 the same month, 8 later, 1 same year, order not determinable |
2006.04884 (2020-06) On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines |
2007.12223 (2020-07) The Lottery Ticket Hypothesis for Pre-trained BERT Networks 2012.07463 (2020-12) Parameter-Efficient Transfer Learning with Diff Pruning and 16 more not named here |
| load_tf_weights_in_bert | 16 other papers 8 dated earlier, 7 later, 1 same year, order not determinable |
2006.04884 (2020-06) On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselines |
2007.12223 (2020-07) The Lottery Ticket Hypothesis for Pre-trained BERT Networks 2012.07463 (2020-12) Parameter-Efficient Transfer Learning with Diff Pruning and 13 more not named here |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Despite the remarkable success of pre-trained language models (PLMs), they still face two challenges: First, large-scale PLMs are inefficient in terms of memory footprint and computation. Second, on the downstream tasks, PLMs tend to rely on the dataset bias and struggle to generalize to out-of-distribution (OOD) data. In response to the efficiency problem, recent studies show that dense PLMs can be replaced with sparse subnetworks without hurting the performance. Such subnetworks can be found in three scenarios: 1) the fine-tuned PLMs, 2) the raw PLMs and then fine-tuned in isolation, and even inside 3) PLMs without any parameter fine-tuning. However, these results are only obtained in the indistribution (ID) setting. In this paper, we extend the study on PLMs subnetworks to the OOD setting, investigating whether sparsity and robustness to dataset bias can be achieved simultaneously. To this end, we conduct extensive experiments with the pre-trained BERT model on three natural language understanding (NLU) tasks. Our results demonstrate that sparse and robust subnetworks (SRNets) can consistently be found in BERT, across the aforementioned three scenarios, using different training and compression methods. Furthermore, we explore the upper bound of SRNets using the OOD information and show that there exist sparse and almost unbiased BERT subnetworks. Finally, we present 1) an analytical study that provides insights on how to promote the efficiency of SRNets searching process and 2) a solution to improve subnetworks' performance at high sparsity. The code is available at https://github.com/llyx97/sparse-and-robust-PLM.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2210.05211")
get_code_for_paper("2210.05211")
have("2210.05211")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2210.05211.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2210.05211)
Connect an agent — have() is free.