Andreas Krause, Niao He, Jiawei Huang
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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 4 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/2402.05724.json · badge: /api/ran/2402.05724.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 |
|---|---|---|
| jiaweihhuang/heuristic_mebp | canonical (classifier label) classifier basis: classifier_2025 |
5 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Evaluate_Maximal_Model_Diff_given_RefPolicy | Ran ran; our contract draft was wrong, not the code |
jiaweihhuang/heuristic_mebp/Algorithm.py pointer only (licence: NONE) · get_code("ad4ec8e1b2613d90") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jiaweihhuang/heuristic_mebp 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. |
| ModelElimination | Ran ran; our contract draft was wrong, not the code |
jiaweihhuang/heuristic_mebp/Algorithm.py pointer only (licence: NONE) · get_code("9408531f106b5b0c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jiaweihhuang/heuristic_mebp 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_maximal_distance | Ran ran; our contract draft was wrong, not the code |
jiaweihhuang/heuristic_mebp/Algorithm.py pointer only (licence: NONE) · get_code("905332a873e0add0") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jiaweihhuang/heuristic_mebp 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. |
| policy_diff | Ran ran, honoured the contract we drafted |
jiaweihhuang/heuristic_mebp/Preparation.py pointer only (licence: NONE) · get_code("2c7a97930ee03c81") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jiaweihhuang/heuristic_mebp 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. |
| solve_NE_BR_mixture | Ran ran; our contract draft was wrong, not the code |
jiaweihhuang/heuristic_mebp/Preparation.py pointer only (licence: NONE) · get_code("a1b0e4a81082601c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jiaweihhuang/heuristic_mebp 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. |
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, 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 5 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 study the sample complexity of reinforcement learning (RL) in Mean-Field Games (MFGs) with model-based function approximation that requires strategic exploration to find a Nash Equilibrium policy. We introduce the Partial Model-Based Eluder Dimension (P-MBED), a more effective notion to characterize the model class complexity. Notably, P-MBED measures the complexity of the single-agent model class converted from the given mean-field model class, and potentially, can be exponentially lower than the MBED proposed by Huang et al. (2024). We contribute a model elimination algorithm featuring a novel exploration strategy and establish sample complexity results polynomial w.r.t. P-MBED. Crucially, our results reveal that, under the basic realizability and Lipschitz continuity assumptions, learning Nash Equilibrium in MFGs is no more statistically challenging than solving a logarithmic number of single-agent RL problems. We further extend our results to Multi-Type MFGs, generalizing from conventional MFGs and involving multiple types of agents. This extension implies statistical tractability of a broader class of Markov Games through the efficacy of mean-field approximation. Finally, inspired by our theoretical algorithm, we present a heuristic approach with improved computational efficiency and empirically demonstrate its effectiveness.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.05724")
get_code_for_paper("2402.05724")
have("2402.05724")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.05724.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.05724)
Connect an agent — have() is free.