Kazuhito Koishida, Tianyi Chen, Tianyu Ding, Colby Banbury, Ilya Zharkov, Xiaoyi Qu, David Aponte, Daniel Robinson
1 of 5 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 4 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/2502.16638.json · badge: /api/ran/2502.16638.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 |
|---|---|---|
| microsoft/GETA | community Papers with Code archive |
1 ran · 4 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| BaseOptimizer | Ran ran on a synthesized input · constructed an object; no result was computed |
microsoft/GETA/only_train_once/optimizer/geta.py code served (permissive licence) · get_code("fe60ffa8a38b735c") 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 an instance of its own class, BaseOptimizer: the run constructed the object and did not call it, so no result was computed. 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.
|
| BaseHybridSparseOptimizer | Not yet run unverified (harvested, no recorded run) |
microsoft/GETA/only_train_once/optimizer/geta.py code served (permissive licence) · get_code("6a32f11a39342a9c") How it ranno invocation recorded. |
| GETA | Not yet run unverified (harvested, no recorded run) |
microsoft/GETA/only_train_once/optimizer/geta.py code served (permissive licence) · get_code("6c2adeebfa94e68e") How it ranno invocation recorded. |
| SparseOptimizerMetrics | Not yet run unverified (harvested, no recorded run) |
microsoft/GETA/only_train_once/optimizer/geta.py code served (permissive licence) · get_code("d00b5cb6364f2e2d") How it ranno invocation recorded. |
| calculate_importance_score | Not yet run unverified (harvested, no recorded run) |
microsoft/GETA/only_train_once/optimizer/geta.py code served (permissive licence) · get_code("b3111868968fda3e") How it ranno invocation 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.
Structured pruning and quantization are fundamental techniques used to reduce the size of deep neural networks (DNNs), and typically are applied independently. Applying these techniques jointly via co-optimization has the potential to produce smaller, high-quality models. However, existing joint schemes are not widely used because of (1) engineering difficulties (complicated multi-stage processes), (2) black-box optimization (extensive hyperparameter tuning to control the overall compression), and (3) insufficient architecture generalization. To address these limitations, we present the framework GETA, which automatically and efficiently performs joint structured pruning and quantizationaware training on any DNN. GETA introduces three key innovations: (i) a quantization-aware dependency graph (QADG) that constructs a pruning search space for generic quantization-aware DNN, (ii) a partially projected stochastic gradient method that guarantees layerwise bit constraints are satisfied, and (iii) a new joint learning strategy that incorporates interpretable relationships between pruning and quantization. We present numerical experiments on both convolutional neural networks and transformer architectures that show that our approach achieves competitive (often superior) performance compared to existing joint pruning and quantization methods. Source code is available at https://github.com/microsoft/GETA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2502.16638")
get_code_for_paper("2502.16638")
have("2502.16638")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2502.16638.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2502.16638)
Connect an agent — have() is free.