3 of 4 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 3 have no contract verdict; 0 failures of our instrument; 1 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.05359.json · badge: /api/ran/2002.05359.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 |
|---|---|---|
| SamuelHorvath/Variance_Reduced_Optimizers_Pytorch | community (classifier label) classifier basis not recorded on the link |
3 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| fcn | Ran ran on a synthesized input |
SamuelHorvath/Variance_Reduced_Optimizers_Pytorch/vr_optimizers/utils/models/fcn_mnist.py code served (permissive licence) · get_code("56627193cdc83561") 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 FCN. 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_grad_norm | Ran ran on a synthesized input |
SamuelHorvath/Variance_Reduced_Optimizers_Pytorch/vr_optimizers/optims/utils.py code served (permissive licence) · get_code("4291fa670f696748") 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 float, 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.
|
| initialise_arg_parser | Ran ran on a synthesized input |
SamuelHorvath/Variance_Reduced_Optimizers_Pytorch/vr_optimizers/opts.py code served (permissive licence) · get_code("eb67c89e0a810e92") 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 ArgumentParser. 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.
|
| parse_args | Not yet run unverified (harvested, no recorded run) |
SamuelHorvath/Variance_Reduced_Optimizers_Pytorch/vr_optimizers/opts.py code served (permissive licence) · get_code("43d00a5e2db28cc0") How it ranno invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 later) and 1 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 |
|---|---|---|---|
| fcn | 1 other paper 1 later |
2303.00883 (2023-03) Variance-reduced Clipping for Non-convex Optimization |
|
| get_grad_norm | 1 other paper 1 later |
2303.00883 (2023-03) Variance-reduced Clipping for Non-convex Optimization |
|
| initialise_arg_parser | 1 other paper 1 later |
2303.00883 (2023-03) Variance-reduced Clipping for Non-convex Optimization |
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.
Adaptivity is an important yet under-studied property in modern optimization theory. The gap between the state-of-the-art theory and the current practice is striking in that algorithms with desirable theoretical guarantees typically involve drastically different settings of hyperparameters, such as step-size schemes and batch sizes, in different regimes. Despite the appealing theoretical results, such divisive strategies provide little, if any, insight to practitioners to select algorithms that work broadly without tweaking the hyperparameters. In this work, blending the "geometrization" technique introduced by Lei & Jordan 2016 and the \texttt{SARAH} algorithm of Nguyen et al., 2017, we propose the Geometrized \texttt{SARAH} algorithm for non-convex finite-sum and stochastic optimization. Our algorithm is proved to achieve adaptivity to both the magnitude of the target accuracy and the Polyak-Łojasiewicz (PL) constant if present. In addition, it achieves the best-available convergence rate for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.05359")
get_code_for_paper("2002.05359")
have("2002.05359")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.05359.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.05359)
Connect an agent — have() is free.