Simon Lacoste-Julien, Namyeong Kwon, Hwidong Na, Gabriel Huang
1 of 1 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 0 have no contract verdict; 1 failure 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/2103.09027.json · badge: /api/ran/2103.09027.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 |
|---|---|---|
| NamyeongK/USA_UFGSM | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| mean_confidence_interval | Ran ran; our contract draft was wrong, not the code |
NamyeongK/USA_UFGSM/miniimagenet_train.py pointer only (licence: NONE) · get_code("ecf7ff30fb58c026") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, NamyeongK/USA_UFGSM 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 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 1 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 |
|---|---|---|---|
| mean_confidence_interval | 2 other papers 1 dated earlier, 1 later |
ijcai2020_0377 (2020 (year only)) Consistent MetaReg: Alleviating Intra-task Discrepancy for Better Meta-knowledge |
2105.08913 (2021-05) Multiple Meta-model Quantifying for Medical Visual Question Answering |
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.
Model-agnostic meta-learning (MAML) is a popular method for few-shot learning but assumes that we have access to the meta-training set. In practice, training on the meta-training set may not always be an option due to data privacy concerns, intellectual property issues, or merely lack of computing resources. In this paper, we consider the novel problem of repurposing pretrained MAML checkpoints to solve new few-shot classification tasks. Because of the potential distribution mismatch, the original MAML steps may no longer be optimal. Therefore we propose an alternative meta-testing procedure and combine MAML gradient steps with adversarial training and uncertainty-based stepsize adaptation. Our method outperforms "vanilla" MAML on same-domain and cross-domains benchmarks using both SGD and Adam optimizers and shows improved robustness to the choice of base stepsize.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2103.09027")
get_code_for_paper("2103.09027")
have("2103.09027")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2103.09027.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2103.09027)
Connect an agent — have() is free.