6 of 9 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; 2 failures of our instrument; 3 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/2302.02607.json · badge: /api/ran/2302.02607.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 |
|---|---|---|
| wilderlavington/target-based-surrogates-for-stochastic-optimization | canonical (classifier label) classifier basis not recorded on the link |
6 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| DenseNet121 | Ran ran; our contract draft was wrong, not the code |
wilderlavington/target-based-surrogates-for-stochastic-optimization/models.py code served (permissive licence) · get_code("7a9e058c035f14cc") 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 DenseNet. 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.
|
| generate_synthetic_mfac | Ran ran on a synthesized input |
wilderlavington/target-based-surrogates-for-stochastic-optimization/loaders/load_data.py code served (permissive licence) · get_code("b85a87d6b88915fb") 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 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.
|
| get_random_string | Ran ran; our contract draft was wrong, not the code |
wilderlavington/target-based-surrogates-for-stochastic-optimization/helpers.py code served (permissive licence) · get_code("47a59a0b45c916c8") 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 str. 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.
|
| procces_data | Ran ran on a synthesized input |
wilderlavington/target-based-surrogates-for-stochastic-optimization/loaders/load_exp.py code served (permissive licence) · get_code("d57aeb52bf633524") 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 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.
|
| update_exp_lr | Ran ran on a synthesized input |
wilderlavington/target-based-surrogates-for-stochastic-optimization/helpers.py code served (permissive licence) · get_code("898702a165683885") 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 SGD. 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.
|
| update_stoch_lr | Ran ran on a synthesized input |
wilderlavington/target-based-surrogates-for-stochastic-optimization/helpers.py code served (permissive licence) · get_code("d2d477c926d60da4") 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 SGD. 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.
|
| load_dataset | Not yet run unverified (harvested, no recorded run) |
wilderlavington/target-based-surrogates-for-stochastic-optimization/loaders/load_exp.py code served (permissive licence) · get_code("3c66a4847b9442d7") How it ranno invocation recorded. |
| load_libsvm | Not yet run unverified (harvested, no recorded run) |
wilderlavington/target-based-surrogates-for-stochastic-optimization/loaders/load_data.py code served (permissive licence) · get_code("9f3ea82bfc5c3beb") How it ranno invocation recorded. |
| load_mnist | Not yet run unverified (harvested, no recorded run) |
wilderlavington/target-based-surrogates-for-stochastic-optimization/loaders/load_data.py code served (permissive licence) · get_code("2cb1e15f8d60f5a0") How it ranno invocation recorded. |
Of 9 samples lifted from this paper's linked repositories, 9 carry a function identity and 0 do not. Of the 9 distinct functions with an identity, 2 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 2 later) and 7 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 |
|---|---|---|---|
| get_random_string | 2 other papers 1 dated earlier, 1 later |
1910.13461 (2019-10) BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension |
2304.10532 (2023-04) Nerfbusters: Removing Ghostly Artifacts from Casually Captured NeRFs |
| DenseNet121 | 1 other paper 1 later |
2307.06306 (2023-07) Locally Adaptive Federated Learning |
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 consider minimizing functions for which it is expensive to compute the (possibly stochastic) gradient. Such functions are prevalent in reinforcement learning, imitation learning and adversarial training. Our target optimization framework uses the (expensive) gradient computation to construct surrogate functions in a \emph{target space} (e.g. the logits output by a linear model for classification) that can be minimized efficiently. This allows for multiple parameter updates to the model, amortizing the cost of gradient computation. In the full-batch setting, we prove that our surrogate is a global upper-bound on the loss, and can be (locally) minimized using a black-box optimization algorithm. We prove that the resulting majorization-minimization algorithm ensures convergence to a stationary point of the loss. Next, we instantiate our framework in the stochastic setting and propose the $SSO$ algorithm, which can be viewed as projected stochastic gradient descent in the target space. This connection enables us to prove theoretical guarantees for $SSO$ when minimizing convex functions. Our framework allows the use of standard stochastic optimization algorithms to construct surrogates which can be minimized by any deterministic optimization method. To evaluate our framework, we consider a suite of supervised learning and imitation learning problems. Our experiments indicate the benefits of target optimization and the effectiveness of $SSO$.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.02607")
get_code_for_paper("2302.02607")
have("2302.02607")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.02607.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.02607)
Connect an agent — have() is free.