Daniel Brown, Russell Coleman, Ravi Srinivasan, Scott Niekum
5 of 10 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; 4 failures of our instrument; 5 no recorded run), measured 2026-11-21; 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/2002.09089.json · badge: /api/ran/2002.09089.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 |
|---|---|---|
| dsbrown1331/bayesianrex | canonical (classifier label) classifier basis: classifier_2025 |
4 ran · 4 no recorded run |
| dsbrown1331/brex_gridworld_cpp | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| calc_linearized_pairwise_ranking_loss | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
dsbrown1331/brex_gridworld_cpp/python/bayesianREX_basic.py code served (permissive licence) · get_code("28c2d8ba6dfc0f57") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is 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.
|
| compute_l2 | Ran ran, honoured the contract we drafted |
dsbrown1331/bayesianrex/code/LinearFeatureMCMC_auxiliary.py code served (permissive licence) · get_code("596357f074d947e6") 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 float32, ndim 0, dtype family float, shape () 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.
|
| create_mcmc_likelihood_data | Ran ran; our contract draft was wrong, not the code |
dsbrown1331/bayesianrex/code/LinearFeatureMCMC_auxiliary.py code served (permissive licence) · get_code("d02b4c9f8709dee9") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple. 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.
|
| create_training_data | Ran ran; our contract draft was wrong, not the code |
dsbrown1331/bayesianrex/code/LearnAtariRewardLinear.py code served (permissive licence) · get_code("2c0910a0bc8022d0") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned tuple. 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.
|
| reconstruction_loss | Ran ran; our contract draft was wrong, not the code |
dsbrown1331/bayesianrex/code/LearnAtariRewardLinear.py code served (permissive licence) · get_code("cfe0f494b5c6542d") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 0, dtype family float, shape () 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.
|
| calc_linearized_pairwise_ranking_loss | Not yet run unverified (harvested, no recorded run) |
dsbrown1331/bayesianrex/code/LinearFeatureMCMC_auxiliary.py code served (permissive licence) · get_code("58181c5e66390b8d") How it ranno invocation recorded. |
| get_weight_vector | Not yet run unverified (harvested, no recorded run) |
dsbrown1331/bayesianrex/code/LinearFeatureMCMC_auxiliary.py code served (permissive licence) · get_code("b0e91e00b56dcd92") How it ranno invocation recorded. |
| mcmc_map_search | Not yet run unverified (harvested, no recorded run) |
dsbrown1331/brex_gridworld_cpp/python/bayesianREX_basic.py code served (permissive licence) · get_code("9f5cef830fea3e84") How it ranno invocation recorded. |
| mcmc_map_search | Not yet run unverified (harvested, no recorded run) |
dsbrown1331/bayesianrex/code/LinearFeatureMCMC_auxiliary.py code served (permissive licence) · get_code("f3987c649d049ce3") How it ranno invocation recorded. |
| write_weights_likelihood | Not yet run unverified (harvested, no recorded run) |
dsbrown1331/bayesianrex/code/LinearFeatureMCMC_auxiliary.py code served (permissive licence) · get_code("e18e2b6a06d313ad") How it ranno invocation recorded. |
Of 10 samples lifted from this paper's linked repositories, 10 carry a function identity and 0 do not. Of the 10 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 10 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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Bayesian reward learning from demonstrations enables rigorous safety and uncertainty analysis when performing imitation learning. However, Bayesian reward learning methods are typically computationally intractable for complex control problems. We propose Bayesian Reward Extrapolation (Bayesian REX), a highly efficient Bayesian reward learning algorithm that scales to high-dimensional imitation learning problems by pre-training a low-dimensional feature encoding via self-supervised tasks and then leveraging preferences over demonstrations to perform fast Bayesian inference. Bayesian REX can learn to play Atari games from demonstrations, without access to the game score and can generate 100,000 samples from the posterior over reward functions in only 5 minutes on a personal laptop. Bayesian REX also results in imitation learning performance that is competitive with or better than stateof-the-art methods that only learn point estimates of the reward function. Finally, Bayesian REX enables efficient high-confidence policy evaluation without having access to samples of the reward function. These high-confidence performance bounds can be used to rank the performance and risk of a variety of evaluation policies and provide a way to detect reward hacking behaviors.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.09089")
get_code_for_paper("2002.09089")
have("2002.09089")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.09089.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.09089)
Connect an agent — have() is free.