Papers › Generative Parameter-Efficient Fine-Tuning

Generative Parameter-Efficient Fine-Tuning

1 Dec 2023arXiv:2312.00700archive 2025-07-28

Chinmay Savadikar, Xi Song, Tianfu Wu

We present Generative Parameter-Efficient Fine-Tuning (GIFT) for adapting pretrained Transformer backbones on downstream tasks. GIFT learns to generate the fine-tuned weights for a layer directly from its pretrained weights. The GIFT network is parameterized in a minimally-simple way by two linear layers (without bias terms), and is shared by different pretrained layers selected for fine-tuning (e.g., the Query layers), which result in significantly fewer trainable parameters compared to the layer-specific methods like Low-Rank Adapter (LoRA). We also show this formulation bridges parameter-efficient fine-tuning and representation fine-tuning. We perform comprehensive experiments on natural language tasks (commonsense and arithmetic reasoning, instruction tuning, and sequence classification) and computer vision tasks (fine-grained classification). We obtain the best performance and parameter efficiency among baselines on commonsense and arithmetic reasoning, and instruction following using the Llama family of models and on visual recognition benchmarks using Vision Transformers. Notably, compared to LoRA, we obtain 5.7% absolute increase in average accuracy with 14 times reduction of parameters on Commonsense170k using Llama-3 (8B), and 5.4% absolute increase in the win rate with 4 times reduction of parameters using Llama-2 (7B) during instruction tuning. Our GIFT also obtains a slightly higher win rate on instruction tuning than GPT 3.5 (Turbo 1106).

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2312.00700")

Code

Syntology Ran 5 of 16 code samples harvested from 1 repository linked to this paper; 11 have no recorded run. Of those that ran: 5 ran with no contract checked.

By repository: official repository: 16 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

savadikarc/gift officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 5 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

5ran
11unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from savadikarc/gift. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

extract_num savadikarc/gift/language_modeling/math_code_instruct/eval_gsm8k.py official repository ran fingerprinted MIT (permissive) · 9221df7ba44d3b36 · report
find_hidden_state_size savadikarc/gift/language_modeling/math_code_instruct/run_exp.py official repository ran MIT (permissive) · 4ce9d0bdc3c04522 · report
format_example savadikarc/gift/language_modeling/math_code_instruct/eval_mmlu.py official repository ran MIT (permissive) · dec15cc75848a98e · report
format_subject savadikarc/gift/language_modeling/math_code_instruct/eval_mmlu.py official repository ran fingerprinted MIT (permissive) · 793a8b6496415457 · report
gen_prompt savadikarc/gift/language_modeling/math_code_instruct/eval_mmlu.py official repository ran MIT (permissive) · 04fd5045fce0c33a · report
SeqToSeqEncode savadikarc/gift/language_modeling/math_code_instruct/utils.py official repository unverified MIT (permissive) · 45db30ac52f3cd6d · report
cache_to_disk savadikarc/gift/language_modeling/math_code_instruct/data.py official repository unverified MIT (permissive) · 1d0db22ae067b53c · report
causalLMEncode savadikarc/gift/language_modeling/math_code_instruct/utils.py official repository unverified MIT (permissive) · 38de4191703bb96a · report
create_loraplus_optimizer savadikarc/gift/language_modeling/math_code_instruct/lora_plus.py official repository unverified MIT (permissive) · 0921ef036f2219f1 · report
find_all_linear_modules savadikarc/gift/language_modeling/math_code_instruct/run_exp.py official repository unverified MIT (permissive) · 65f3cc97d3e5034f · report
get_forward_hook savadikarc/gift/language_modeling/math_code_instruct/logTrainer.py official repository unverified MIT (permissive) · fd33ad9ae547c836 · report
get_module savadikarc/gift/language_modeling/math_code_instruct/lora_plus.py official repository unverified MIT (permissive) · ef1ba16faaacbb49 · report
load_flan_v2 savadikarc/gift/language_modeling/math_code_instruct/data.py official repository unverified MIT (permissive) · 1b37d30c5eaded49 · report
load_meta_math savadikarc/gift/language_modeling/math_code_instruct/data.py official repository unverified MIT (permissive) · 963559e86ce91fd8 · report
post_process savadikarc/gift/language_modeling/math_code_instruct/eval_humaneval.py official repository unverified MIT (permissive) · 48720117c27620bc · report
reinit_lora savadikarc/gift/language_modeling/math_code_instruct/run_exp.py official repository unverified MIT (permissive) · e70a2129bcf0f57c · report

Tasks

Arithmetic ReasoningFine-Grained Image ClassificationInstruction FollowingSemantic Segmentationparameter-efficient fine-tuning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAdapterAttentionAttention DropoutBPECosine AnnealingDense ConnectionsDiscriminative Fine-TuningDropoutGPTLLaMALabel SmoothingLayer NormalizationLinear LayerLinear Warmup With Cosine AnnealingMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformerVision TransformerWeight Decay

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections