1 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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure 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/2410.02247.json · badge: /api/ran/2410.02247.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 |
|---|---|---|
| chen123CtrlS/LightweightAtt | canonical (classifier label) classifier basis: census |
1 ran · 3 no recorded run |
| chen123ctrls/efficientft | canonical (classifier label) classifier basis: census |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_module | Ran ran; our contract draft was wrong, not the code |
chen123CtrlS/LightweightAtt/MyTrainer.py pointer only (licence: MIT); the stored copy get_code serves, from rainstonee/CDKA, is pointer only (licence: NONE) · get_code("ef1ba16faaacbb49") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from rainstonee/CDKA, and GitHub detected no licence in that repository 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. |
| attempt_train | Not yet run unverified (harvested, no recorded run) |
chen123CtrlS/LightweightAtt/utils.py code served (permissive licence) · get_code("55d7f12009e34c17") How it ranno invocation recorded. |
| create_my_optimizer | Not yet run unverified (harvested, no recorded run) |
chen123CtrlS/LightweightAtt/MyTrainer.py code served (permissive licence) · get_code("622f3250d2a0de92") How it ranno invocation recorded. |
| create_my_optimizer | Not yet run unverified (harvested, no recorded run) |
chen123ctrls/efficientft/MyTrainer.py code served (permissive licence) · get_code("430d8d7a31f75a43") How it ranno invocation recorded. |
| find_valid_checkpoint | Not yet run unverified (harvested, no recorded run) |
chen123CtrlS/LightweightAtt/utils.py code served (permissive licence) · get_code("d7a721ecf28d85f4") 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, 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 4 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_module | 4 other papers 3 dated earlier, 1 later |
2312.00700 (2023-12) WeGeFT: Weight-Generative Fine-Tuning for Multi-Faceted Efficient Adaptation of Large Models |
2402.12354 (2024-02) LoRA+: Efficient Low Rank Adaptation of Large Models 2407.05000 (2024-07) LoRA-GA: Low-Rank Adaptation with Gradient Approximation and 1 more not named here |
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.
Large Language Models (LLMs), built on Transformer architectures, exhibit remarkable generalization across a wide range of tasks. However, fine-tuning these models for specific tasks remains resource-intensive due to their extensive parameterization. In this paper, we explore two remarkable phenomena related to the attention mechanism during the fine-tuning of LLMs (where $\mathbf{W}_q$, $\mathbf{W}_k$, and $\mathbf{W}_v$ denote the weights of the query, key, and value layers, respectively). The first phenomenon, termed "Unequal Importance of Attention Matrices", highlights the impact of fine-tuning different weight matrices. It shows that optimizing the $\mathbf{W}_v$ matrix yields significantly better performance than optimizing the $\mathbf{W}_k$ matrix. Fine-tuning only the $\mathbf{W}_q$ and $\mathbf{W}_v$ matrices is computationally efficient while delivering results comparable to, or even better than fine-tuning all three matrices ($\mathbf{W}_q$, $\mathbf{W}_k$, and $\mathbf{W}_v$). The second phenomenon,"Attention Matrices with Customized Learning Rate Lead to Better Convergence", emphasizes the importance of assigning distinct learning rates to these matrices. Specifically, a higher learning rate for the $\mathbf{W}_v$ matrix compared to $\mathbf{W}_q$ and $\mathbf{W}_k$ accelerates convergence and improves performance. Building on these insights, we propose a new strategy that improves fine-tuning efficiency in terms of both storage and time. Experimental results on benchmark datasets validate the effectiveness of this approach, supporting our theoretical findings. Our analysis lays the theoretical groundwork for configuring and improving algorithms in LLMs fine-tuning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.02247")
get_code_for_paper("2410.02247")
have("2410.02247")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2410.02247.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2410.02247)
Connect an agent — have() is free.