Papers › Scaling Sparse Fine-Tuning to Large Language Models

Scaling Sparse Fine-Tuning to Large Language Models

29 Jan 2024arXiv:2401.16405archive 2025-07-28

Alan Ansell, Ivan Vulić, Hannah Sterz, Anna Korhonen, Edoardo M. Ponti

Large Language Models (LLMs) are difficult to fully fine-tune (e.g., with instructions or human feedback) due to their sheer number of parameters. A family of parameter-efficient sparse fine-tuning methods have proven promising in terms of performance but their memory requirements increase proportionally to the size of the LLMs. In this work, we scale sparse fine-tuning to state-of-the-art LLMs like LLaMA 2 7B and 13B. We propose SpIEL, a novel sparse fine-tuning method which, for a desired density level, maintains an array of parameter indices and the deltas of these parameters relative to their pretrained values. It iterates over: (a) updating the active deltas, (b) pruning indices (based on the change of magnitude of their deltas) and (c) regrowth of indices. For regrowth, we explore two criteria based on either the accumulated gradients of a few candidate parameters or their approximate momenta estimated using the efficient SM3 optimizer. We experiment with instruction-tuning of LLMs on standard dataset mixtures, finding that SpIEL is often superior to popular parameter-efficient fine-tuning methods like LoRA (low-rank adaptation) in terms of performance and comparable in terms of run time. We additionally show that SpIEL is compatible with both quantization and efficient optimizers, to facilitate scaling to ever-larger model sizes. We release the code for SpIEL at https://github.com/AlanAnsell/peft and for the instruction-tuning experiments at https://github.com/ducdauge/sft-llm.

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="2401.16405")

Code

Syntology Ran 7 of 15 code samples harvested from 2 repositories linked to this paper; 8 have no recorded run. Of those that ran: 2 ran · honoured contract; 4 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 14 samples from 2 repositories, 6 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

alanansell/peft officialmentioned in papermentioned on GitHubpytorch report
ducdauge/sft-llm 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

15 samples harvested; 7 ran; 2 honoured the contract we drafted; 8 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.

2ran · honoured contract
4ran · our draft was wrong
1ran
8unverified

Licence: 1 of the 15 samples is 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 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “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.

encode_with_messages_format ducdauge/sft-llm/finetune/finetune.py official repository ran · our draft was wrong MIT (permissive) · 1cb0eeb16cf04ee3 · report
encode_with_prompt_completion_format ducdauge/sft-llm/finetune/finetune.py official repository ran · our draft was wrong MIT (permissive) · 88b8bf1223d522a4 · report
estimate_pass_at_k ducdauge/sft-llm/eval/codex_humaneval/evaluation.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · e080db2eaa81fdb3 · report
generate_completions ducdauge/sft-llm/eval/utils.py official repository ran MIT (permissive) · 62004a6900e0e332 · report
get_closest_label alanansell/peft/examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py official repository ran · our draft was wrong Apache-2.0 (permissive) · e2284f55bbde4f81 · report
levenshtein_distance alanansell/peft/examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py official repository ran · honoured contract fingerprinted Apache-2.0 (permissive) · 01f1ac304787218d · report
check_correctness ducdauge/sft-llm/eval/codex_humaneval/execution.py official repository unverified MIT (permissive) · 12d4fef547070f7c · report
create_prompt_with_llama2_chat_format ducdauge/sft-llm/eval/templates.py official repository unverified MIT (permissive) · e51c9713fadad16f · report
create_prompt_with_tulu_chat_format ducdauge/sft-llm/eval/templates.py official repository unverified MIT (permissive) · 697d92a5d51eff3e · report
dispatch_openai_chat_requesets ducdauge/sft-llm/eval/dispatch_openai_requests.py official repository unverified MIT (permissive) · dcad9ac62979ca49 · report
dispatch_openai_prompt_requesets ducdauge/sft-llm/eval/dispatch_openai_requests.py official repository unverified MIT (permissive) · 71e4259026911444 · report
get_next_word_predictions ducdauge/sft-llm/eval/utils.py official repository unverified MIT (permissive) · d134c88af0236263 · report
read_problems ducdauge/sft-llm/eval/codex_humaneval/data.py official repository unverified MIT (permissive) · 776a712a353130e7 · report
score_completions ducdauge/sft-llm/eval/utils.py official repository unverified MIT (permissive) · e86d5bc4e595d32c · report
b2mb identical code first harvested elsewhere ran · honoured contract fingerprinted licence of this copy not recorded · 32380a050ca033d4 · report

Tasks

Quantizationparameter-efficient fine-tuning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

PruningSFTSM3

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