Papers › Sirius: Contextual Sparsity with Correction for Efficient LLMs

Sirius: Contextual Sparsity with Correction for Efficient LLMs

5 Sep 2024arXiv:2409.03856archive 2025-07-28

Yang Zhou, Zhuoming Chen, Zhaozhuo Xu, Victoria Lin, Beidi Chen

With the blossom of large language models (LLMs), inference efficiency becomes increasingly important. Various approximation methods are proposed to reduce the cost at inference time. Contextual Sparsity (CS) is appealing for its training-free nature and its ability to reach a higher compression ratio seemingly without quality degradation. However, after a comprehensive evaluation of contextual sparsity methods on various complex generation tasks, we find that although CS succeeds in prompt-understanding tasks, CS significantly degrades the model performance for reasoning, deduction, and knowledge-based tasks. Despite the gap in end-to-end accuracy, we observed that sparse models often share general problem-solving logic and require only a few token corrections to recover the original model performance. This paper introduces Sirius, an efficient correction mechanism, which significantly recovers CS models quality on reasoning tasks while maintaining its efficiency gain. Sirius is evaluated on 6 models with 8 difficult generation tasks in reasoning, math, and coding and shows consistent effectiveness and efficiency. Also, we carefully develop a system implementation for Sirius and show that Sirius achieves roughly 20% reduction in latency for 8B model on-chip and 35% reduction for 70B model offloading. We open-source our implementation of Sirius at https://github.com/Infini-AI-Lab/Sirius.git.

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

Code

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

By repository: official repository: 12 samples from 1 repository, 11 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.

infini-ai-lab/sirius officialmentioned in paperpytorch 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

13 samples harvested; 11 ran; 0 honoured the contract we drafted; 2 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.

11ran
2unverified

Licence: 13 of the 13 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 infini-ai-lab/sirius. 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.

get_llama_griffin infini-ai-lab/sirius/CommonSenseReasoning/llama12addingtree.py official repository ran no licence file found · pointer only · 9bd57dd90bb577a0 · report
get_llama_griffin infini-ai-lab/sirius/Miscellaneous/llama12.py official repository ran no licence file found · pointer only · 2ea33d25e6ef2a74 · report
get_llama_griffin infini-ai-lab/sirius/Miscellaneous/llama12_static_cache_sdpa_with_check.py official repository ran no licence file found · pointer only · 435798bb10ad09c2 · report
get_llama_griffin infini-ai-lab/sirius/Miscellaneous/llama12_static_cache_sdpa_with_check3.py official repository ran no licence file found · pointer only · bea2ee8bceba3552 · report
get_llama_griffin2 infini-ai-lab/sirius/CodeGeneration/llama12addingtree.py official repository ran no licence file found · pointer only · 62afb89d83ad7405 · report
get_llama_griffin2 infini-ai-lab/sirius/Miscellaneous/llama12_static_cache_sdpa_with_check.py official repository ran no licence file found · pointer only · 5850334f169d6173 · report
get_llama_griffin2 infini-ai-lab/sirius/Miscellaneous/llama12_static_cache_sdpa_with_check3.py official repository ran no licence file found · pointer only · b7ee462be5b748f3 · report
get_llama_griffin2_no_tree infini-ai-lab/sirius/CodeGeneration/llama12.py official repository ran no licence file found · pointer only · 500ce51af1cf6e3e · report
get_llama_griffin_no_tree infini-ai-lab/sirius/CodeGeneration/llama12.py official repository ran no licence file found · pointer only · dae08339d7a535f0 · report
select_neurons infini-ai-lab/sirius/CodeGeneration/llama12.py official repository ran no licence file found · pointer only · 84f1aef48d28008a · report
select_neurons infini-ai-lab/sirius/Miscellaneous/llama12_static_cache_sdpa_with_check3.py official repository ran no licence file found · pointer only · b59ae5345024758d · report
get_llama_griffin infini-ai-lab/sirius/CodeGeneration/llama12addingtree.py official repository unverified no licence file found · pointer only · 65a78352d1c947e2 · report
make_table identical code first harvested elsewhere unverified licence of this copy not recorded · 9d95c14130837ee4 · report

Tasks

Math

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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