Yaliang Li, Bolin Ding, Wei Lin, Jingren Zhou, Zhen Wang, Hongbo Deng, Daoyuan Chen, Jun Huang, Minghui Qiu, Bofang Li
None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 no recorded run), measured 2026-11-21; 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/2001.04246.json · badge: /api/ran/2001.04246.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 |
|---|---|---|
| alibaba/EasyTransfer | community Papers with Code archive |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| AdaBERTStudent | Not yet run unverified (harvested, no recorded run) |
alibaba/EasyTransfer/easytransfer/model_zoo/modeling_adabert.py code served (permissive licence) · get_code("7cacce8e0987c7f5") How it ranno invocation recorded. |
| get_gumbel | Not yet run unverified (harvested, no recorded run) |
alibaba/EasyTransfer/easytransfer/model_zoo/modeling_adabert.py code served (permissive licence) · get_code("9abcdafb7e7d2c35") How it ranno invocation recorded. |
| get_logits | Not yet run unverified (harvested, no recorded run) |
alibaba/EasyTransfer/easytransfer/model_zoo/modeling_adabert.py code served (permissive licence) · get_code("38d356f844721fce") How it ranno invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 3 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.
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Large pre-trained language models such as BERT have shown their effectiveness in various natural language processing tasks. However, the huge parameter size makes them difficult to be deployed in real-time applications that require quick inference with limited resources. Existing methods compress BERT into small models while such compression is task-independent, i.e., the same compressed BERT for all different downstream tasks. Motivated by the necessity and benefits of task-oriented BERT compression, we propose a novel compression method, AdaBERT, that leverages differentiable Neural Architecture Search to automatically compress BERT into task-adaptive small models for specific tasks. We incorporate a task-oriented knowledge distillation loss to provide search hints and an efficiency-aware loss as search constraints, which enables a good trade-off between efficiency and effectiveness for task-adaptive BERT compression. We evaluate AdaBERT on several NLP tasks, and the results demonstrate that those task-adaptive compressed models are 12.7x to 29.3x faster than BERT in inference time and 11.5x to 17.0x smaller in terms of parameter size, while comparable performance is maintained.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.04246")
get_code_for_paper("2001.04246")
have("2001.04246")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.04246.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.04246)
Connect an agent — have() is free.