Tuo Zhao, Chen Liang, Haoming Jiang, Jianfeng Gao, Weizhu Chen, Xiaodong Liu, Simiao Zuo, Pengcheng He
3 of 3 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 failures of our instrument; 0 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/2104.04886.json · badge: /api/ran/2104.04886.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 |
|---|---|---|
| microsoft/MT-DNN | canonical (classifier label) classifier basis: census |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| bertgelu | Ran ran; our contract draft was wrong, not the code |
microsoft/MT-DNN/mtdnn/common/activation_functions.py code served (permissive licence) · get_code("342da45925662575") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| linear | Ran ran, honoured the contract we drafted |
microsoft/MT-DNN/mtdnn/common/activation_functions.py pointer only (licence: MIT); the stored copy get_code serves, from MrHuff/Sumo-Net, is pointer only (licence: NONE) · get_code("691b566282a42d88") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from MrHuff/Sumo-Net, and GitHub detected no licence in that repository 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. |
| swish | Ran ran; our contract draft was wrong, not the code |
microsoft/MT-DNN/mtdnn/common/activation_functions.py code served (permissive licence) · get_code("d1453c3ac3a28807") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (2, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
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, 3 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 3 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 |
|---|---|---|---|
| linear | 6 other papers 3 dated earlier, 3 later · 1 only as an assembly brick |
1803.06585 (2018-03) Learning Long Term Dependencies via Fourier Recurrent Units |
1901.11504 (2019-01) Multi-Task Deep Neural Networks for Natural Language Understanding 2001.01565 (2020-01) Stance Detection Benchmark: How Robust Is Your Stance Detection? and 3 more not named here |
| swish | 2 other papers 1 dated earlier, 1 later |
2001.01565 (2020-01) Stance Detection Benchmark: How Robust Is Your Stance Detection? |
2105.12002 (2021-05) Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization |
| bertgelu | 1 other paper 1 later |
2105.12002 (2021-05) Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization |
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.
Adversarial regularization has been shown to improve the generalization performance of deep learning models in various natural language processing tasks. Existing works usually formulate the method as a zero-sum game, which is solved by alternating gradient descent/ascent algorithms. Such a formulation treats the adversarial and the defending players equally, which is undesirable because only the defending player contributes to the generalization performance. To address this issue, we propose Stackelberg Adversarial Regularization (SALT), which formulates adversarial regularization as a Stackelberg game. This formulation induces a competition between a leader and a follower, where the follower generates perturbations, and the leader trains the model subject to the perturbations. Different from conventional approaches, in SALT, the leader is in an advantageous position. When the leader moves, it recognizes the strategy of the follower and takes the anticipated follower's outcomes into consideration. Such a leader's advantage enables us to improve the model fitting to the unperturbed data. The leader's strategic information is captured by the Stackelberg gradient, which is obtained using an unrolling algorithm. Our experimental results on a set of machine translation and natural language understanding tasks show that SALT outperforms existing adversarial regularization baselines across all tasks. Our code is publicly available.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.04886")
get_code_for_paper("2104.04886")
have("2104.04886")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.04886.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.04886)
Connect an agent — have() is free.