Sarah Müller, Alexander Von Rohr, Sebastian Trimpe
4 of 8 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; 0 honoured the contract we drafted, 0 violated it and 4 have no contract verdict; 0 failures of our instrument; 4 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/2106.11899.json · badge: /api/ran/2106.11899.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 |
|---|---|---|
| sarmueller/gibo | canonical (classifier label) classifier basis: census |
4 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| call_counter | Ran ran on a synthesized input |
sarmueller/gibo/src/loop.py code served (permissive licence) · get_code("5a80e2f4f753b250") 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 function. The image it ran in was not recorded. If your copy returns the same type 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.
|
| manipulate_reward | Ran ran on a synthesized input |
sarmueller/gibo/src/environment_api.py code served (permissive licence) · get_code("4413d8e3286e6243") 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 function. The image it ran in was not recorded. If your copy returns the same type 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.
|
| optimize_acqf_vanilla_bo | Ran ran on a synthesized input |
sarmueller/gibo/src/acquisition_function.py code served (permissive licence) · get_code("bf9e0cbb23842154") 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 (1, 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.
|
| sort_rewards_global_optimization | Ran ran on a synthesized input |
sarmueller/gibo/src/evaluate.py code served (permissive licence) · get_code("9493a6a3cdcb4b44") 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 dict. The image it ran in was not recorded. If your copy returns the same type 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.
|
| insert | Not yet run unverified (harvested, no recorded run) |
sarmueller/gibo/src/config.py code served (permissive licence) · get_code("9ba1bb4104c6cbdc") How it ranno invocation recorded. |
| one_step_cholesky | Not yet run unverified (harvested, no recorded run) |
sarmueller/gibo/src/cholesky.py code served (permissive licence) · get_code("df94ac83c17a7fb3") How it ranno invocation recorded. |
| optimize_acqf_custom_bo | Not yet run unverified (harvested, no recorded run) |
sarmueller/gibo/src/acquisition_function.py code served (permissive licence) · get_code("20307dfa91e06968") How it ranno invocation recorded. |
| postprocessing_interpolate_x | Not yet run unverified (harvested, no recorded run) |
sarmueller/gibo/src/evaluate.py code served (permissive licence) · get_code("93332fe605a1eec4") How it ranno invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 8 distinct functions with an identity, 8 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 8 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 |
|---|---|---|---|
| call_counter | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| insert | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| manipulate_reward | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| one_step_cholesky | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| optimize_acqf_custom_bo | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| optimize_acqf_vanilla_bo | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| postprocessing_interpolate_x | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
|
| sort_rewards_global_optimization | 1 other paper 1 later |
2210.11662 (2022-10) Local Bayesian optimization via maximizing probability of descent |
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.
Reinforcement learning (RL) aims to find an optimal policy by interaction with an environment. Consequently, learning complex behavior requires a vast number of samples, which can be prohibitive in practice. Nevertheless, instead of systematically reasoning and actively choosing informative samples, policy gradients for local search are often obtained from random perturbations. These random samples yield high variance estimates and hence are sub-optimal in terms of sample complexity. Actively selecting informative samples is at the core of Bayesian optimization, which constructs a probabilistic surrogate of the objective from past samples to reason about informative subsequent ones. In this paper, we propose to join both worlds. We develop an algorithm utilizing a probabilistic model of the objective function and its gradient. Based on the model, the algorithm decides where to query a noisy zeroth-order oracle to improve the gradient estimates. The resulting algorithm is a novel type of policy search method, which we compare to existing black-box algorithms. The comparison reveals improved sample complexity and reduced variance in extensive empirical evaluations on synthetic objectives. Further, we highlight the benefits of active sampling on popular RL benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.11899")
get_code_for_paper("2106.11899")
have("2106.11899")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.11899.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.11899)
Connect an agent — have() is free.