2 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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure 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/1910.09191.json · badge: /api/ran/1910.09191.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 |
|---|---|---|
| copy not recorded | community not in the paper's declared repositories |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| constfn | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from daochenzha/rapid pointer only · get_code("8758308dc6c0727f") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| safemean | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from Benjamin-eecs/Theoretical-GMRL pointer only · get_code("a7b323241cd70612") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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 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 |
|---|---|---|---|
| constfn | 8 other papers 5 dated earlier, 1 the same month, 2 later |
1707.06347 (2017-07) Proximal Policy Optimization Algorithms |
1806.07857 (2018-06) RUDDER: Return Decomposition for Delayed Rewards 1812.02341 (2018-12) Quantifying Generalization in Reinforcement Learning and 5 more not named here |
| safemean | 6 other papers 3 dated earlier, 3 later · 1 only as an assembly brick |
1707.06347 (2017-07) Proximal Policy Optimization Algorithms |
1804.06459 (2018-04) On Learning Intrinsic Rewards for Policy Gradient Methods 1905.02363 (2019-05) Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning and 3 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.
Deep Reinforcement Learning (Deep RL) has been receiving increasingly more attention thanks to its encouraging performance on a variety of control tasks. Yet, conventional regularization techniques in training neural networks (e.g., $L_2$ regularization, dropout) have been largely ignored in RL methods, possibly because agents are typically trained and evaluated in the same environment, and because the deep RL community focuses more on high-level algorithm designs. In this work, we present the first comprehensive study of regularization techniques with multiple policy optimization algorithms on continuous control tasks. Interestingly, we find conventional regularization techniques on the policy networks can often bring large improvement, especially on harder tasks. Our findings are shown to be robust against training hyperparameter variations. We also compare these techniques with the more widely used entropy regularization. In addition, we study regularizing different components and find that only regularizing the policy network is typically the best. We further analyze why regularization may help generalization in RL from four perspectives - sample complexity, reward distribution, weight norm, and noise robustness. We hope our study provides guidance for future practices in regularizing policy optimization algorithms. Our code is available at https://github.com/xuanlinli17/iclr2021_rlreg .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.09191")
get_code_for_paper("1910.09191")
have("1910.09191")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.09191.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.09191)
Connect an agent — have() is free.