U Berkeley, Anca Dragan, Pieter Abbeel, Kimin Lee, Laura Smith
5 of 5 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 2 have no contract verdict; 3 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/2111.03026.json · badge: /api/ran/2111.03026.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 |
|---|---|---|
| rll-research/B-Pref | canonical (classifier label) classifier basis not recorded on the link |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| KCenterGreedy | Ran ran; our contract draft was wrong, not the code |
rll-research/B-Pref/reward_model.py code served (permissive licence) · get_code("f707d589e5cb7e51") 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 list, ndim 1, dtype family int; no output shape is stated. 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 and ndim 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_smallest_dist | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
rll-research/B-Pref/reward_model.py pointer only (licence: MIT); the stored copy get_code serves, from pokaxpoka/b_pref, is pointer only (licence: NONE) · get_code("9d7e96fcfe3ff0f4") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from pokaxpoka/b_pref, and GitHub detected no licence in that repository when it was checked. 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. |
| compute_state_entropy | Ran ran on a synthesized input |
rll-research/B-Pref/agent/sac.py code served (permissive licence) · get_code("115ab9ed9d356045") 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 (2, 1) 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.
|
| gen_net | Ran ran; our contract draft was wrong, not the code |
rll-research/B-Pref/reward_model.py pointer only (licence: MIT); the stored copy get_code serves, from moonoutcloudback/clarify_pbrl, is pointer only (licence: NONE) · get_code("a17d99b8eda680ff") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from moonoutcloudback/clarify_pbrl, and GitHub detected no licence in that repository when it was checked. 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. |
| linear_schedule | Ran ran on a synthesized input |
rll-research/B-Pref/train_PPO.py code served (permissive licence) · get_code("ad4e19d5ac571c31") 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.
|
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 5 are also present in other papers whose code we hold (5 with at least one paper dated earlier, 0 the same month, 4 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 |
|---|---|---|---|
| gen_net | 8 other papers 1 dated earlier, 7 later · 3 only as an assembly brick |
2106.05091 (2021-06) PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training |
2205.12401 (2022-05) Reward Uncertainty for Exploration in Preference-based Reinforcement Learning 2305.17400 (2023-05) Query-Policy Misalignment in Preference-Based Reinforcement Learning and 5 more not named here |
| KCenterGreedy | 3 other papers 1 dated earlier, 2 later · 1 only as an assembly brick |
2106.05091 (2021-06) PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training |
2205.12401 (2022-05) Reward Uncertainty for Exploration in Preference-based Reinforcement Learning 2402.17257 (2024-02) RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences |
| compute_smallest_dist | 3 other papers 1 dated earlier, 2 later · 1 only as an assembly brick |
2106.05091 (2021-06) PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training |
2205.12401 (2022-05) Reward Uncertainty for Exploration in Preference-based Reinforcement Learning 2402.17257 (2024-02) RIME: Robust Preference-based Reinforcement Learning with Noisy Preferences |
| compute_state_entropy | 3 other papers 1 dated earlier, 2 later |
2106.05091 (2021-06) PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training |
2305.17400 (2023-05) Query-Policy Misalignment in Preference-Based Reinforcement Learning 2506.12822 (2025-06) Enhancing Rating-Based Reinforcement Learning to Effectively Leverage Feedback from Large Vision-Language Models |
| linear_schedule | 1 other paper 1 dated earlier |
2106.05091 (2021-06) PEBBLE: Feedback-Efficient Interactive Reinforcement Learning via Relabeling Experience and Unsupervised Pre-training |
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) requires access to a reward function that incentivizes the right behavior, but these are notoriously hard to specify for complex tasks. Preference-based RL provides an alternative: learning policies using a teacher's preferences without pre-defined rewards, thus overcoming concerns associated with reward engineering. However, it is difficult to quantify the progress in preferencebased RL due to the lack of a commonly adopted benchmark. In this paper, we introduce B-Pref: a benchmark specially designed for preference-based RL. A key challenge with such a benchmark is providing the ability to evaluate candidate algorithms quickly, which makes relying on real human input for evaluation prohibitive. At the same time, simulating human input as giving perfect preferences for the ground truth reward function is unrealistic. B-Pref alleviates this by simulating teachers with a wide array of irrationalities, and proposes metrics not solely for performance but also for robustness to these potential irrationalities. We showcase the utility of B-Pref by using it to analyze algorithmic design choices, such as selecting informative queries, for state-of-the-art preferencebased RL algorithms. We hope that B-Pref can serve as a common starting point to study preference-based RL more systematically. Source code is available at https://github.com/rll-research/B-Pref.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2111.03026")
get_code_for_paper("2111.03026")
have("2111.03026")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2111.03026.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2111.03026)
Connect an agent — have() is free.