Yunwen Lei, Mingrui Liu, Zhenxun Zhuang, Chunyang Liao
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/2205.05040.json · badge: /api/ran/2205.05040.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 |
|---|---|---|
| mingruiliu-ml-lab/communication-efficient-local-gradient-clipping | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| batchify | Ran ran; our contract draft was wrong, not the code |
mingruiliu-ml-lab/communication-efficient-local-gradient-clipping/nlp/main_lstm.py pointer only (licence: GPL-3.0) · get_code("9efb556e868426ed") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, mingruiliu-ml-lab/communication-efficient-local-gradient-clipping, is not in the permissive set Syntology serves inline. 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. |
| get_batch | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
mingruiliu-ml-lab/communication-efficient-local-gradient-clipping/nlp/main_lstm.py pointer only (licence: GPL-3.0) · get_code("2a0640f3091a0588") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, mingruiliu-ml-lab/communication-efficient-local-gradient-clipping, is not in the permissive set Syntology serves inline. 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. |
| repackage_hidden | Ran ran, honoured the contract we drafted |
mingruiliu-ml-lab/communication-efficient-local-gradient-clipping/nlp/main_lstm.py pointer only (licence: GPL-3.0) · get_code("4372bb4533fd1936") How it ranThe body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, mingruiliu-ml-lab/communication-efficient-local-gradient-clipping, is not in the permissive set Syntology serves inline. 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. |
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, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 later) and 2 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 |
|---|---|---|---|
| repackage_hidden | 15 other papers 13 dated earlier, 2 later |
1609.04309 (2016-09) Efficient softmax approximation for GPUs |
1704.05119 (2017-04) Exploring Sparsity in Recurrent Neural Networks 1803.08240 (2018-03) An Analysis of Neural Language Modeling at Multiple Scales and 12 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.
In distributed training of deep neural networks, people usually run Stochastic Gradient Descent (SGD) or its variants on each machine and communicate with other machines periodically. However, SGD might converge slowly in training some deep neural networks (e.g., RNN, LSTM) because of the exploding gradient issue. Gradient clipping is usually employed to address this issue in the single machine setting, but exploring this technique in the distributed setting is still in its infancy: it remains mysterious whether the gradient clipping scheme can take advantage of multiple machines to enjoy parallel speedup. The main technical difficulty lies in dealing with nonconvex loss function, non-Lipschitz continuous gradient, and skipping communication rounds simultaneously. In this paper, we explore a relaxed-smoothness assumption of the loss landscape which LSTM was shown to satisfy in previous works, and design a communication-efficient gradient clipping algorithm. This algorithm can be run on multiple machines, where each machine employs a gradient clipping scheme and communicate with other machines after multiple steps of gradient-based updates. Our algorithm is proved to have O 1 N 4 iteration complexity and O( 1 3 ) communication complexity for finding an -stationary point in the homogeneous data setting, where N is the number of machines. This indicates that our algorithm enjoys linear speedup and reduced communication rounds. Our proof relies on novel analysis techniques of estimating truncated random variables, which we believe are of independent interest. Our experiments on several benchmark datasets and various scenarios demonstrate that our algorithm indeed exhibits fast convergence speed in practice and thus validates our theory.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.05040")
get_code_for_paper("2205.05040")
have("2205.05040")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.05040.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.05040)
Connect an agent — have() is free.