{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/get-wikitext2","entry":"get_wikitext2","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":78,"n_papers_ran":11,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":57,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":82,"n_places_pointer_only":25,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":55},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.07955","paper":"/paper/arxiv-2604-07955","title":"Rethinking Residual Errors in Compensation-based LLM Quantization","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"list0830/ResComp","path":"fake_quant/data_utils.py","file_url":"https://github.com/list0830/ResComp/blob/HEAD/fake_quant/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"347f7e0a0b0e4f2f","mcp_get_code":{"code_sha256":"347f7e0a0b0e4f2f"}},{"arxiv_id":"2601.06787","paper":"/paper/arxiv-2601-06787","title":"Garbage Attention in Large Language Models: <BOS> Sink Heads and Sink-aware Pruning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"CASIA-LMC-Lab/FLAP","path":"lib/prune.py","file_url":"https://github.com/CASIA-LMC-Lab/FLAP/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2d79e7ef9f571f3d","mcp_get_code":{"code_sha256":"2d79e7ef9f571f3d"}},{"arxiv_id":"2511.04063","paper":"/paper/arxiv-2511-04063","title":"DartQuant: Efficient Rotational Distribution Calibration for LLM Quantization","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"CAS-CLab/DartQuant","path":"NPU_DartQuant/fake_quant/data_utils.py","file_url":"https://github.com/CAS-CLab/DartQuant/blob/HEAD/NPU_DartQuant/fake_quant/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8715ffbc2b65ebe5","mcp_get_code":{"code_sha256":"8715ffbc2b65ebe5"}},{"arxiv_id":"2510.16292","paper":"/paper/arxiv-2510-16292","title":"QSVD: Efficient Low-rank Approximation for Unified Query-Key-Value Weight Compression in Low-Precision Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"SAI-Lab-NYU/QSVD","path":"fake_quant/data_utils.py","file_url":"https://github.com/SAI-Lab-NYU/QSVD/blob/HEAD/fake_quant/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8715ffbc2b65ebe5","mcp_get_code":{"code_sha256":"8715ffbc2b65ebe5"}},{"arxiv_id":"2510.03267","paper":"/paper/arxiv-2510-03267","title":"PT$^2$-LLM: Post-Training Ternarization for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XIANGLONGYAN/PT2-LLM","path":"pt2_llm/data.py","file_url":"https://github.com/XIANGLONGYAN/PT2-LLM/blob/HEAD/pt2_llm/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bc9148e3beb23d8f","mcp_get_code":{"code_sha256":"bc9148e3beb23d8f"}},{"arxiv_id":"2507.23279","paper":null,"title":"arXiv:2507.23279","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"ZunhaiSu/Super-Experts-Profilling","path":"data_utils.py","file_url":"https://github.com/ZunhaiSu/Super-Experts-Profilling/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"24b559c86b2c736b","mcp_get_code":{"code_sha256":"24b559c86b2c736b"}},{"arxiv_id":"2507.18553","paper":null,"title":"arXiv:2507.18553","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"IST-DASLab/GPTQ-Babai","path":"quantization/data_utils.py","file_url":"https://github.com/IST-DASLab/GPTQ-Babai/blob/HEAD/quantization/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5a96c1f99eeb15d1","mcp_get_code":{"code_sha256":"5a96c1f99eeb15d1"}},{"arxiv_id":"2507.01299","paper":null,"title":"arXiv:2507.01299","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"alibaba/EfficientAI","path":"masquant/datautils.py","file_url":"https://github.com/alibaba/EfficientAI/blob/HEAD/masquant/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1beda835d86a2700","mcp_get_code":{"code_sha256":"1beda835d86a2700"}},{"arxiv_id":"2506.09351","paper":null,"title":"arXiv:2506.09351","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"yuchenblah/DIVE","path":"lib/evaldata.py","file_url":"https://github.com/yuchenblah/DIVE/blob/HEAD/lib/evaldata.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"bbb56ec8bf98c7cf","mcp_get_code":{"code_sha256":"bbb56ec8bf98c7cf"}},{"arxiv_id":"2506.09351","paper":null,"title":"arXiv:2506.09351","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"yuchenblah/DIVE","path":"prune/lib/calidata_random.py","file_url":"https://github.com/yuchenblah/DIVE/blob/HEAD/prune/lib/calidata_random.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4eadbf13ea0cc98b","mcp_get_code":{"code_sha256":"4eadbf13ea0cc98b"}},{"arxiv_id":"2506.09351","paper":null,"title":"arXiv:2506.09351","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"yuchenblah/DIVE","path":"prune/lib/calidata_select_8.py","file_url":"https://github.com/yuchenblah/DIVE/blob/HEAD/prune/lib/calidata_select_8.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f3b69fb5e58d1980","mcp_get_code":{"code_sha256":"f3b69fb5e58d1980"}},{"arxiv_id":"2506.06866","paper":"/paper/safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LOG-postech/safe-torch","path":"language/lib/prune.py","file_url":"https://github.com/LOG-postech/safe-torch/blob/HEAD/language/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"041beaad3085295f","mcp_get_code":{"code_sha256":"041beaad3085295f"}},{"arxiv_id":"2506.03781","paper":null,"title":"arXiv:2506.03781","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"OpenGVLab/OmniQuant","path":"datautils.py","file_url":"https://github.com/OpenGVLab/OmniQuant/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"406294899f965c2f","mcp_get_code":{"code_sha256":"406294899f965c2f"}},{"arxiv_id":"2505.23807","paper":"/paper/dlp-dynamic-layerwise-pruning-in-large","title":"DLP: Dynamic Layerwise Pruning in Large Language Models","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ironartisan/dlp","path":"lib/prune.py","file_url":"https://github.com/ironartisan/dlp/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"dd6b0a913778761d","mcp_get_code":{"code_sha256":"dd6b0a913778761d"}},{"arxiv_id":"2505.02214","paper":"/paper/an-empirical-study-of-qwen3-quantization","title":"An Empirical Study of Qwen3 Quantization","date":"2025-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"efficient-ml/qwen3-quantization","path":"BiLLM/datautils.py","file_url":"https://github.com/efficient-ml/qwen3-quantization/blob/HEAD/BiLLM/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2502.14910","paper":null,"title":"arXiv:2502.14910","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"luffy06/EvoP","path":"src/utils/data_utils.py","file_url":"https://github.com/luffy06/EvoP/blob/HEAD/src/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e74891f2269718","mcp_get_code":{"code_sha256":"a9e74891f2269718"}},{"arxiv_id":"2501.13987","paper":"/paper/ostquant-refining-large-language-model","title":"OstQuant: Refining Large Language Model Quantization with Orthogonal and Scaling Transformations for Better Distribution Fitting","date":"2025-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brotherhappy/ostquant","path":"utils/data_utils.py","file_url":"https://github.com/brotherhappy/ostquant/blob/HEAD/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"443e801197c1a259","mcp_get_code":{"code_sha256":"443e801197c1a259"}},{"arxiv_id":"2412.01129","paper":"/paper/rilq-rank-insensitive-lora-based-quantization","title":"RILQ: Rank-Insensitive LoRA-based Quantization Error Compensation for Boosting 2-bit Large Language Model Accuracy","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiha-lab/rilq","path":"rilq_utils/data.py","file_url":"https://github.com/aiha-lab/rilq/blob/HEAD/rilq_utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0cfa46cd7236cebe","mcp_get_code":{"code_sha256":"0cfa46cd7236cebe"}},{"arxiv_id":"2411.17525","paper":"/paper/pushing-the-limits-of-large-language-model","title":"Pushing the Limits of Large Language Model Quantization via the Linearity Theorem","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goodevening13/aquakv","path":"aquakv/datautils.py","file_url":"https://github.com/goodevening13/aquakv/blob/HEAD/aquakv/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e7d4ca6a631d3399","mcp_get_code":{"code_sha256":"e7d4ca6a631d3399"}},{"arxiv_id":"2411.10606","paper":"/paper/amoeballm-constructing-any-shape-large","title":"AmoebaLLM: Constructing Any-Shape Large Language Models for Efficient and Instant Deployment","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GATECH-EIC/AmoebaLLM","path":"width_shrink/data.py","file_url":"https://github.com/GATECH-EIC/AmoebaLLM/blob/HEAD/width_shrink/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2410.23918","paper":"/paper/bitstack-fine-grained-size-control-for","title":"BitStack: Any-Size Compression of Large Language Models in Variable Memory Environments","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinghaow99/BitStack","path":"bitstack/utils/data_utils.py","file_url":"https://github.com/xinghaow99/BitStack/blob/HEAD/bitstack/utils/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ded9ae110292b62d","mcp_get_code":{"code_sha256":"ded9ae110292b62d"}},{"arxiv_id":"2410.17509","paper":"/paper/wagle-strategic-weight-attribution-for","title":"WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Models","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OPTML-Group/WAGLE","path":"src/dataset/dataset.py","file_url":"https://github.com/OPTML-Group/WAGLE/blob/HEAD/src/dataset/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2410.13229","paper":"/paper/quamba-a-post-training-quantization-recipe","title":"Quamba: A Post-Training Quantization Recipe for Selective State Space Models","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enyac-group/quamba","path":"quamba/data_loaders.py","file_url":"https://github.com/enyac-group/quamba/blob/HEAD/quamba/data_loaders.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"f9f3ddd2d74b2929","mcp_get_code":{"code_sha256":"f9f3ddd2d74b2929"}},{"arxiv_id":"2410.09615","paper":"/paper/slim-one-shot-quantized-sparse-plus-low-rank","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohammad-mozaffari/slim","path":"slim/data.py","file_url":"https://github.com/mohammad-mozaffari/slim/blob/HEAD/slim/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"83ea71aadeabb49a","mcp_get_code":{"code_sha256":"83ea71aadeabb49a"}},{"arxiv_id":"2410.09426","paper":"/paper/flatquant-flatness-matters-for-llm","title":"FlatQuant: Flatness Matters for LLM Quantization","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruikangliu/FlatQuant","path":"flatquant/data_utils.py","file_url":"https://github.com/ruikangliu/FlatQuant/blob/HEAD/flatquant/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4dd3c92f12273ec9","mcp_get_code":{"code_sha256":"4dd3c92f12273ec9"}},{"arxiv_id":"2410.09344","paper":"/paper/dare-the-extreme-revisiting-delta-parameter","title":"DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vengdeng/darex","path":"utils/getwx.py","file_url":"https://github.com/vengdeng/darex/blob/HEAD/utils/getwx.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ecc04d6edadf3e8b","mcp_get_code":{"code_sha256":"ecc04d6edadf3e8b"}},{"arxiv_id":"2410.07461","paper":"/paper/is-c4-dataset-optimal-for-pruning-an","title":"Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abx393/llm-pruning-calibration-data","path":"lib/data.py","file_url":"https://github.com/abx393/llm-pruning-calibration-data/blob/HEAD/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8be36298f96f0805","mcp_get_code":{"code_sha256":"8be36298f96f0805"}},{"arxiv_id":"2410.06270","paper":"/paper/mc-moe-mixture-compressor-for-mixture-of","title":"MC-MoE: Mixture Compressor for Mixture-of-Experts LLMs Gains More","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aaronhuang-778/MC-MoE","path":"datautils.py","file_url":"https://github.com/Aaronhuang-778/MC-MoE/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2409.18850","paper":"/paper/two-sparse-matrices-are-better-than-one","title":"Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usamec/double_sparse","path":"datautils.py","file_url":"https://github.com/usamec/double_sparse/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2409.17481","paper":"/paper/maskllm-learnable-semi-structured-sparsity","title":"MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/MaskLLM","path":"eval_llama_ppl.py","file_url":"https://github.com/NVlabs/MaskLLM/blob/HEAD/eval_llama_ppl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2408.05646","paper":"/paper/eigen-attention-attention-in-low-rank-space","title":"Eigen Attention: Attention in Low-Rank Space for KV Cache Compression","date":"2024-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utkarshsaxena1/eigenattn","path":"datautils.py","file_url":"https://github.com/utkarshsaxena1/eigenattn/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"46e078681a1cd741","mcp_get_code":{"code_sha256":"46e078681a1cd741"}},{"arxiv_id":"2407.11062","paper":"/paper/efficientqat-efficient-quantization-aware","title":"EfficientQAT: Efficient Quantization-Aware Training for Large Language Models","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/efficientqat","path":"datautils_block.py","file_url":"https://github.com/opengvlab/efficientqat/blob/HEAD/datautils_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d02281de8bfe304","mcp_get_code":{"code_sha256":"6d02281de8bfe304"}},{"arxiv_id":"2407.10032","paper":"/paper/leanquant-accurate-large-language-model","title":"LeanQuant: Accurate Large Language Model Quantization with Loss-Error-Aware Grid","date":"2024-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeanModels/LeanQuant","path":"datautils.py","file_url":"https://github.com/LeanModels/LeanQuant/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3bbe14523c98ed57","mcp_get_code":{"code_sha256":"3bbe14523c98ed57"}},{"arxiv_id":"2407.06483","paper":"/paper/composable-interventions-for-language-models","title":"Composable Interventions for Language Models","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hartvigsen-group/composable-interventions","path":"sparsellm/lib/data.py","file_url":"https://github.com/hartvigsen-group/composable-interventions/blob/HEAD/sparsellm/lib/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2407.06483","paper":"/paper/composable-interventions-for-language-models","title":"Composable Interventions for Language Models","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hartvigsen-group/composable-interventions","path":"sparsellm/lib/datautils.py","file_url":"https://github.com/hartvigsen-group/composable-interventions/blob/HEAD/sparsellm/lib/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ce2dbbe16d039626","mcp_get_code":{"code_sha256":"ce2dbbe16d039626"}},{"arxiv_id":"2406.15524","paper":"/paper/rethinking-pruning-large-language-models","title":"Rethinking Pruning Large Language Models: Benefits and Pitfalls of Reconstruction Error Minimization","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"log-postech/rethinking-llm-pruning","path":"lib/data.py","file_url":"https://github.com/log-postech/rethinking-llm-pruning/blob/HEAD/lib/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2406.12928","paper":"/paper/evaluating-the-generalization-ability-of-1","title":"Evaluating the Generalization Ability of Quantized LLMs: Benchmark, Analysis, and Toolbox","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingmaoai/mi-optimize","path":"mi_optimize/datasets/data_loader.py","file_url":"https://github.com/tsingmaoai/mi-optimize/blob/HEAD/mi_optimize/datasets/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"05cb56deff8da528","mcp_get_code":{"code_sha256":"05cb56deff8da528"}},{"arxiv_id":"2406.08155","paper":"/paper/examining-post-training-quantization-for","title":"Examining Post-Training Quantization for Mixture-of-Experts: A Benchmark","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unites-lab/moe-quantization","path":"dump_mixtral_routing_distribution.py","file_url":"https://github.com/unites-lab/moe-quantization/blob/HEAD/dump_mixtral_routing_distribution.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"219f020120bf3e16","mcp_get_code":{"code_sha256":"219f020120bf3e16"}},{"arxiv_id":"2406.05981","paper":"/paper/shiftaddllm-accelerating-pretrained-llms-via","title":"ShiftAddLLM: Accelerating Pretrained LLMs via Post-Training Multiplication-Less Reparameterization","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gatech-eic/shiftaddllm","path":"datautils.py","file_url":"https://github.com/gatech-eic/shiftaddllm/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"50f2b672b1461e67","mcp_get_code":{"code_sha256":"50f2b672b1461e67"}},{"arxiv_id":"2406.02924","paper":"/paper/pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/pruner-zero","path":"lib/data.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"07cb1fc598db64e8","mcp_get_code":{"code_sha256":"07cb1fc598db64e8"}},{"arxiv_id":"2406.02924","paper":"/paper/pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/pruner-zero","path":"lib/gradient_computation.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lib/gradient_computation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a97b0120e186c09","mcp_get_code":{"code_sha256":"3a97b0120e186c09"}},{"arxiv_id":"2406.01721","paper":"/paper/rotation-and-permutation-for-advanced-outlier","title":"DuQuant: Distributing Outliers via Dual Transformation Makes Stronger Quantized LLMs","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hsu1023/DuQuant","path":"datautils.py","file_url":"https://github.com/Hsu1023/DuQuant/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"406294899f965c2f","mcp_get_code":{"code_sha256":"406294899f965c2f"}},{"arxiv_id":"2406.00800","paper":"/paper/magr-weight-magnitude-reduction-for-enhancing","title":"MagR: Weight Magnitude Reduction for Enhancing Post-Training Quantization","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AozhongZhang/MagR","path":"datautils.py","file_url":"https://github.com/AozhongZhang/MagR/blob/HEAD/datautils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f69762e4b3ffac1","mcp_get_code":{"code_sha256":"8f69762e4b3ffac1"}},{"arxiv_id":"2405.15756","paper":"/paper/sparse-expansion-and-neuronal-disentanglement","title":"Sparse Expansion and Neuronal Disentanglement","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shavit-lab/sparse-expansion","path":"utils/datautils.py","file_url":"https://github.com/shavit-lab/sparse-expansion/blob/HEAD/utils/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"380c081883a25dfd","mcp_get_code":{"code_sha256":"380c081883a25dfd"}},{"arxiv_id":"2405.14917","paper":"/paper/slim-llm-salience-driven-mixed-precision","title":"SliM-LLM: Salience-Driven Mixed-Precision Quantization for Large Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aaronhuang-778/SliM-LLM","path":"slim-llm-plus/datautils.py","file_url":"https://github.com/Aaronhuang-778/SliM-LLM/blob/HEAD/slim-llm-plus/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"85420819f7a0df4a","mcp_get_code":{"code_sha256":"85420819f7a0df4a"}},{"arxiv_id":"2404.18239","paper":"/paper/soul-unlocking-the-power-of-second-order","title":"SOUL: Unlocking the Power of Second-Order Optimization for LLM Unlearning","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/soul","path":"src/dataset/dataset.py","file_url":"https://github.com/optml-group/soul/blob/HEAD/src/dataset/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2404.14047","paper":"/paper/how-good-are-low-bit-quantized-llama3-models","title":"An empirical study of LLaMA3 quantization: from LLMs to MLLMs","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"macaronlin/llama3-quantization","path":"datautils.py","file_url":"https://github.com/macaronlin/llama3-quantization/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"406294899f965c2f","mcp_get_code":{"code_sha256":"406294899f965c2f"}},{"arxiv_id":"2403.12544","paper":"/paper/affinequant-affine-transformation","title":"AffineQuant: Affine Transformation Quantization for Large Language Models","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/affinequant","path":"datautils.py","file_url":"https://github.com/bytedance/affinequant/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"406294899f965c2f","mcp_get_code":{"code_sha256":"406294899f965c2f"}},{"arxiv_id":"2403.06082","paper":"/paper/framequant-flexible-low-bit-quantization-for","title":"FrameQuant: Flexible Low-Bit Quantization for Transformers","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsingh-group/framequant","path":"datautils.py","file_url":"https://github.com/vsingh-group/framequant/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ab19b8a72ceae217","mcp_get_code":{"code_sha256":"ab19b8a72ceae217"}},{"arxiv_id":"2402.17946","paper":"/paper/gradient-free-adaptive-global-pruning-for-pre","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BaiTheBest/SparseLLM","path":"datautils.py","file_url":"https://github.com/BaiTheBest/SparseLLM/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2402.16880","paper":"/paper/besa-pruning-large-language-models-with","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linkanonymous/besa","path":"utils/data.py","file_url":"https://github.com/linkanonymous/besa/blob/HEAD/utils/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a8a15ad5400c13dc","mcp_get_code":{"code_sha256":"a8a15ad5400c13dc"}},{"arxiv_id":"2402.11295","paper":"/paper/onebit-towards-extremely-low-bit-large","title":"OneBit: Towards Extremely Low-bit Large Language Models","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuyuzhuang11/OneBit","path":"evaluation/lm_eval/datautils.py","file_url":"https://github.com/xuyuzhuang11/OneBit/blob/HEAD/evaluation/lm_eval/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27d7c058388f491d","mcp_get_code":{"code_sha256":"27d7c058388f491d"}},{"arxiv_id":"2402.09773","paper":"/paper/nuteprune-efficient-progressive-pruning-with","title":"NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucius-lsr/nuteprune","path":"eval_ppl.py","file_url":"https://github.com/lucius-lsr/nuteprune/blob/HEAD/eval_ppl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c31f45d1c5adf4cc","mcp_get_code":{"code_sha256":"c31f45d1c5adf4cc"}},{"arxiv_id":"2402.09398","paper":"/paper/get-more-with-less-synthesizing-recurrence","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hdong920/less","path":"src/data_processing.py","file_url":"https://github.com/hdong920/less/blob/HEAD/src/data_processing.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b616f4c20a2e4bb","mcp_get_code":{"code_sha256":"5b616f4c20a2e4bb"}},{"arxiv_id":"2402.04291","paper":"/paper/billm-pushing-the-limit-of-post-training","title":"BiLLM: Pushing the Limit of Post-Training Quantization for LLMs","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaronhuang-778/billm","path":"datautils.py","file_url":"https://github.com/aaronhuang-778/billm/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2401.02938","paper":"/paper/fast-and-optimal-weight-update-for-pruned","title":"Fast and Effective Weight Update for Pruned Large Language Models","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmfi-compbio/admm-pruning","path":"lib/data.py","file_url":"https://github.com/fmfi-compbio/admm-pruning/blob/HEAD/lib/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2312.17244","paper":"/paper/the-llm-surgeon","title":"The LLM Surgeon","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qualcomm-ai-research/llm-surgeon","path":"datautils.py","file_url":"https://github.com/qualcomm-ai-research/llm-surgeon/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"code_sha256_prefix":"8f59498c44ab3856","mcp_get_code":{"code_sha256":"8f59498c44ab3856"}},{"arxiv_id":"2312.11983","paper":"/paper/fluctuation-based-adaptive-structured-pruning","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"casia-iva-lab/flap","path":"lib/data.py","file_url":"https://github.com/casia-iva-lab/flap/blob/HEAD/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2d79e7ef9f571f3d","mcp_get_code":{"code_sha256":"2d79e7ef9f571f3d"}},{"arxiv_id":"2311.04902","paper":"/paper/beyond-size-how-gradients-shape-pruning","title":"Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rocktimjyotidas/gblm-pruner","path":"gradient_computation.py","file_url":"https://github.com/rocktimjyotidas/gblm-pruner/blob/HEAD/gradient_computation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb81c679c455e959","mcp_get_code":{"code_sha256":"cb81c679c455e959"}},{"arxiv_id":"2310.19102","paper":"/paper/atom-low-bit-quantization-for-efficient-and","title":"Atom: Low-bit Quantization for Efficient and Accurate LLM Serving","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"efeslab/atom","path":"model/datautils.py","file_url":"https://github.com/efeslab/atom/blob/HEAD/model/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f9f3ddd2d74b2929","mcp_get_code":{"code_sha256":"f9f3ddd2d74b2929"}},{"arxiv_id":"2310.09499","paper":"/paper/one-shot-sensitivity-aware-mixed-sparsity","title":"One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talkking/MixGPT","path":"datautils.py","file_url":"https://github.com/talkking/MixGPT/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cb4c3b607eb16747","mcp_get_code":{"code_sha256":"cb4c3b607eb16747"}},{"arxiv_id":"2310.09259","paper":"/paper/towards-end-to-end-4-bit-inference-on","title":"QUIK: Towards End-to-End 4-Bit Inference on Generative Large Language Models","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/quik","path":"experiments/datautils.py","file_url":"https://github.com/ist-daslab/quik/blob/HEAD/experiments/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"79092c10d8a25941","mcp_get_code":{"code_sha256":"79092c10d8a25941"}},{"arxiv_id":"2310.08915","paper":"/paper/dynamic-sparse-no-training-training-free-fine","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyxxmu/dsnot","path":"lib/prune.py","file_url":"https://github.com/zyxxmu/dsnot/blob/HEAD/lib/prune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2310.08041","paper":"/paper/qllm-accurate-and-efficient-low-bitwidth","title":"QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modeltc/qllm","path":"datautils.py","file_url":"https://github.com/modeltc/qllm/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"78a5251d494aa3a6","mcp_get_code":{"code_sha256":"78a5251d494aa3a6"}},{"arxiv_id":"2310.01382","paper":"/paper/compressing-llms-the-truth-is-rarely-pure-and","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/llm-kick","path":"GPTQ_experiment/lib/data.py","file_url":"https://github.com/VITA-Group/llm-kick/blob/HEAD/GPTQ_experiment/lib/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2310.00034","paper":"/paper/pb-llm-partially-binarized-large-language","title":"PB-LLM: Partially Binarized Large Language Models","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/binaryllm","path":"gptq_pb/datautils.py","file_url":"https://github.com/hahnyuan/binaryllm/blob/HEAD/gptq_pb/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2308.13137","paper":"/paper/omniquant-omnidirectionally-calibrated","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/omniquant","path":"datautils.py","file_url":"https://github.com/opengvlab/omniquant/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"406294899f965c2f","mcp_get_code":{"code_sha256":"406294899f965c2f"}},{"arxiv_id":"2307.15290","paper":"/paper/chathome-development-and-evaluation-of-a","title":"ChatHome: Development and Evaluation of a Domain-Specific Language Model for Home Renovation","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lianjiatech/belle","path":"models/gptq/datautils.py","file_url":"https://github.com/lianjiatech/belle/blob/HEAD/models/gptq/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"58476252d7ce923b","mcp_get_code":{"code_sha256":"58476252d7ce923b"}},{"arxiv_id":"2307.09288","paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/squeezellm","path":"squeezellm/datautils.py","file_url":"https://github.com/squeezeailab/squeezellm/blob/HEAD/squeezellm/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"efc347eff314b865","mcp_get_code":{"code_sha256":"efc347eff314b865"}},{"arxiv_id":"2306.11695","paper":"/paper/a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crystaleye42/eval-safety","path":"lib/prune.py","file_url":"https://github.com/crystaleye42/eval-safety/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1afe3719e760f32e","mcp_get_code":{"code_sha256":"1afe3719e760f32e"}},{"arxiv_id":"2304.01089","paper":"/paper/rptq-reorder-based-post-training-quantization","title":"RPTQ: Reorder-based Post-training Quantization for Large Language Models","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/rptq4llm","path":"datautils.py","file_url":"https://github.com/hahnyuan/rptq4llm/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8b5943596ef2fc63","mcp_get_code":{"code_sha256":"8b5943596ef2fc63"}},{"arxiv_id":"openreview_d3RFDLBw01","paper":null,"title":"arXiv:openreview_d3RFDLBw01","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AI2C-Lab/STLA","path":"data_utils.py","file_url":"https://github.com/AI2C-Lab/STLA/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ed50f961b7ece8a5","mcp_get_code":{"code_sha256":"ed50f961b7ece8a5"}},{"arxiv_id":"openreview_Im05D8gFFn","paper":null,"title":"arXiv:openreview_Im05D8gFFn","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mazumder-lab/RobOP","path":"RobOP-ALPS/datautils.py","file_url":"https://github.com/mazumder-lab/RobOP/blob/HEAD/RobOP-ALPS/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a77e3efb0eb0a48","mcp_get_code":{"code_sha256":"0a77e3efb0eb0a48"}},{"arxiv_id":"openreview_4iupzej9nT","paper":null,"title":"arXiv:openreview_4iupzej9nT","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hikvision-research/STEP","path":"step/lib/data.py","file_url":"https://github.com/hikvision-research/STEP/blob/HEAD/step/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3bfd595806d439a3","mcp_get_code":{"code_sha256":"3bfd595806d439a3"}},{"arxiv_id":"aaai_28960","paper":null,"title":"arXiv:aaai_28960","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CASIA-IVA-Lab/FLAP","path":"lib/data.py","file_url":"https://github.com/CASIA-IVA-Lab/FLAP/blob/HEAD/lib/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2d79e7ef9f571f3d","mcp_get_code":{"code_sha256":"2d79e7ef9f571f3d"}},{"arxiv_id":"2025.naacl-long.237","paper":null,"title":"arXiv:2025.naacl-long.237","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nbasyl/LLM-FP4","path":"datautils.py","file_url":"https://github.com/nbasyl/LLM-FP4/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"688bbc6963a19c01","mcp_get_code":{"code_sha256":"688bbc6963a19c01"}},{"arxiv_id":"2025.findings-emnlp.1054","paper":null,"title":"arXiv:2025.findings-emnlp.1054","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IST-DASLab/sparsegpt","path":"datautils.py","file_url":"https://github.com/IST-DASLab/sparsegpt/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"011909315dfdbc2e","mcp_get_code":{"code_sha256":"011909315dfdbc2e"}},{"arxiv_id":"2025.acl-long.590","paper":null,"title":"arXiv:2025.acl-long.590","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ChnQ/SPIN","path":"src/eval_ppl.py","file_url":"https://github.com/ChnQ/SPIN/blob/HEAD/src/eval_ppl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"75b2f62d7ea8f10e","mcp_get_code":{"code_sha256":"75b2f62d7ea8f10e"}},{"arxiv_id":"2025.acl-long.498","paper":null,"title":"arXiv:2025.acl-long.498","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"OpenGVLab/EfficientQAT","path":"datautils_block.py","file_url":"https://github.com/OpenGVLab/EfficientQAT/blob/HEAD/datautils_block.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d02281de8bfe304","mcp_get_code":{"code_sha256":"6d02281de8bfe304"}},{"arxiv_id":"2024.findings-naacl.145","paper":null,"title":"arXiv:2024.findings-naacl.145","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LianjiaTech/BELLE","path":"models/gptq/datautils.py","file_url":"https://github.com/LianjiaTech/BELLE/blob/HEAD/models/gptq/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"58476252d7ce923b","mcp_get_code":{"code_sha256":"58476252d7ce923b"}},{"arxiv_id":"2024.findings-emnlp.579","paper":null,"title":"arXiv:2024.findings-emnlp.579","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RazvanDu/DynamicSlicing","path":"src/slicegpt/data.lib.py","file_url":"https://github.com/RazvanDu/DynamicSlicing/blob/HEAD/src/slicegpt/data.lib.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dee8be97b2cf4692","mcp_get_code":{"code_sha256":"dee8be97b2cf4692"}},{"arxiv_id":"2023.emnlp-main.892","paper":null,"title":"arXiv:2023.emnlp-main.892","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamsungLabs/Z-Fold","path":"datautils.py","file_url":"https://github.com/SamsungLabs/Z-Fold/blob/HEAD/datautils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f011af2b47206903","mcp_get_code":{"code_sha256":"f011af2b47206903"}}]}