Home › Code › check_sparsity

check_sparsity

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

check_sparsity appears in the code Syntology harvested for 16 papers, as 14 distinct code bodies found in 18 places (a place is one code body under one paper). Of the 16 papers, 16 with a sample that ran: 16 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument. 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named check_sparsity do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 14 distinct code bodies named check_sparsity: 13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 9 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

9ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran; the contract check could not run
4ran
1unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 4 of the 18 places are pointer only (Syntology does not serve that copy's text); at 1 of them this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

16 papers shown of 16, newest first; 18 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive; 2 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression 12 Oct 2024 mohammad-mozaffari/slim/slim/utils.py 42183294cfd88747 ran · honoured contract MIT (permissive)
Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning 9 Oct 2024 abx393/llm-pruning-calibration-data/lib/prune.py 91a952a7c3e11f8b ran Apache-2.0 (permissive)
LPViT: Low-Power Semi-structured Pruning for Vision Transformers 2 Jul 2024 Akimoto-Cris/LPViT/pruning_utils.py de2af715a05df3be ran · honoured contract no licence file found · pointer only
Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models 5 Jun 2024 pprp/pruner-zero/lib/prune.py ac28c555c0ec0815 ran · honoured contract MIT (permissive)
Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models 5 Jun 2024 pprp/pruner-zero/lib/prune_opt.py 4cf1dd5e7d4e2ca9 unverified MIT (permissive)
Fast and Effective Weight Update for Pruned Large Language Models 1 Jan 2024 fmfi-compbio/admm-pruning/lib/prune.py 75c1b08e37a25564 ran · honoured contract MIT (permissive) here; the stored copy is pointer only
Fast and Effective Weight Update for Pruned Large Language Models 1 Jan 2024 fmfi-compbio/admm-pruning/lib/prune_opt.py 4cf1dd5e7d4e2ca9 unverified MIT (permissive)
Fluctuation-based Adaptive Structured Pruning for Large Language Models 19 Dec 2023 casia-iva-lab/flap/lib/prune.py d7befe8027d275aa ran · honoured contract Apache-2.0 (permissive)
Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models 8 Nov 2023 rocktimjyotidas/gblm-pruner/lib/prune.py 6d3d2eb274571aa8 ran MIT (permissive)
Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning 28 Oct 2023 guangyaodou/conmu/utils.py 93a8d2e1e32689ed ran MIT (permissive)
Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs 13 Oct 2023 zyxxmu/dsnot/lib/prune.py 75c1b08e37a25564 ran · honoured contract no licence file found · pointer only
Uncovering the Hidden Cost of Model Compression 29 Aug 2023 landskape-ai/reprogram_lt/experiments/cnn/ilm_vp.py 8ed61d2bcf647b5d ran · honoured contract no licence file found · pointer only
A Simple and Effective Pruning Approach for Large Language Models 20 Jun 2023 locuslab/wanda/lib/prune.py 3b7b64b9aea9a039 ran · honoured contract MIT (permissive)
Data-Efficient Double-Win Lottery Tickets from Robust Pre-training 9 Jun 2022 vita-group/double-win-lth/utils_pruning.py 092c59fab4392ba6 ran · honoured contract MIT (permissive)
Efficient Lottery Ticket Finding: Less Data is More 6 Jun 2021 VITA-Group/PrAC-LTH/utils/pruner.py 092c59fab4392ba6 ran · honoured contract MIT (permissive)
Neural Models for Documents with Metadata 25 May 2017 dallascard/neural_topic_models/theano_code/run_ngtm.py 3dc75aaf31d3c1f1 ran · honoured contract Apache-2.0 (permissive)
AAAI id aaai_28960 CASIA-IVA-Lab/FLAP/lib/prune.py d7befe8027d275aa ran · honoured contract Apache-2.0 (permissive)
ACL Anthology id 2025.findings-acl.394 TheShineyue/HSR/alignment-attribution-hsr/lib/prune.py e5c2acc858940a2b ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. 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 cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

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