None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 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/2107.11587.json · badge: /api/ran/2107.11587.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 |
|---|---|---|
| ramp-kits/rl_simulator | canonical (classifier label) classifier basis: census |
0 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| mbrl_hyperopt_command | Not yet run unverified (harvested, no recorded run) |
ramp-kits/rl_simulator/mbrl-tools/mbrltools/model_based_rl_hyperopt.py pointer only (licence: BSD-3-Clause) · get_code("e6746c13a6675e9d") How it ranThe body of this sample is withheld: BSD-3-Clause, as GitHub detects it on this paper's repository, ramp-kits/rl_simulator, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. No invocation recorded. |
| reward_func | Not yet run unverified (harvested, no recorded run) |
ramp-kits/rl_simulator/benchmark/acrobot/reward_function.py pointer only (licence: BSD-3-Clause) · get_code("d5e9182e08dfe611") How it ranThe body of this sample is withheld: BSD-3-Clause, as GitHub detects it on this paper's repository, ramp-kits/rl_simulator, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with 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. 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, 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 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.
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.
We contribute to micro-data model-based reinforcement learning (MBRL) by rigorously comparing popular generative models using a fixed (random shooting) control agent. We find that on an environment that requires multimodal posterior predictives, mixture density nets outperform all other models by a large margin. When multimodality is not required, our surprising finding is that we do not need probabilistic posterior predictives: deterministic models are on par, in fact they consistently (although non-significantly) outperform their probabilistic counterparts. We also found that heteroscedasticity at training time, perhaps acting as a regularizer, improves predictions at longer horizons. At the methodological side, we design metrics and an experimental protocol which can be used to evaluate the various models, predicting their asymptotic performance when using them on the control problem. Using this framework, we improve the state-of-the-art sample complexity of MBRL on Acrobot by two to four folds, using an aggressive training schedule which is outside of the hyperparameter interval usually considered
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2107.11587")
get_code_for_paper("2107.11587")
have("2107.11587")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2107.11587.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2107.11587)
Connect an agent — have() is free.