{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/model-compression","name":"Model Compression","slug":"model-compression","description_markdown":"**Model Compression** is an actively pursued area of research over the last few years with the goal of deploying state-of-the-art deep networks in low-power and resource limited devices without significant drop in accuracy. Parameter pruning, low-rank factorization and weight quantization are some of the proposed methods to compress the size of deep networks.\n\n\n<span class=\"description-source\">Source: [KD-MRI: A knowledge distillation framework for image reconstruction and image restoration in MRI workflow ](https://arxiv.org/abs/2004.05319)</span>","categories":[{"name":"Methodology","url":"/area/methodology"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1356,"papers_with_code":440,"benchmarks":2,"benchmark_tables_in_archive":2,"benchmark_tables_shown":2,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/model-compression-on-imagenet","slug":"model-compression-on-imagenet","dataset":"ImageNet","dataset_url":"/dataset/imagenet","rows_in_archive":12,"metrics":["Top-1"],"first_row_in_archive_order":{"model":"ADLIK-MO-ResNet50+W4A4","paper_title":"Learned Step Size Quantization","paper_url":"/paper/learned-step-size-quantization","paper_date":"2019-02-21","arxiv_id":"1902.08153","code_links":[{"title":"zhutmost/lsq-net","url":"https://github.com/zhutmost/lsq-net"},{"title":"hustzxd/LSQuantization","url":"https://github.com/hustzxd/LSQuantization"},{"title":"ZouJiu1/LSQplus","url":"https://github.com/ZouJiu1/LSQplus"},{"title":"Adlik/model_optimizer","url":"https://github.com/Adlik/model_optimizer"},{"title":"DeadAt0m/LSQFakeQuantize-PyTorch","url":"https://github.com/DeadAt0m/LSQFakeQuantize-PyTorch"},{"title":"DeadAt0m/LSQ-PyTorch","url":"https://github.com/DeadAt0m/LSQ-PyTorch"},{"title":"Shunli-Wang/Tiny-YOLO-LSQ","url":"https://github.com/Shunli-Wang/Tiny-YOLO-LSQ"},{"title":"Kelvinyu1117/LSQ-implementation","url":"https://github.com/Kelvinyu1117/LSQ-implementation"},{"title":"jiyoonkm/columnquant","url":"https://github.com/jiyoonkm/columnquant"}],"syntology":{"n":23,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":9,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/learned-step-size-quantization#ran","syntology_url":"https://syntology.ai/paper/1902.08153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08153"}},"official":null}}},{"leaderboard":"/sota/model-compression-on-qnli","slug":"model-compression-on-qnli","dataset":"QNLI","dataset_url":"/dataset/qnli","rows_in_archive":2,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"MobileBERT + 2bit-1dim model compression using DKM","paper_title":"R2 Loss: Range Restriction Loss for Model Compression and Quantization","paper_url":"/paper/r-2-range-regularization-for-model","paper_date":"2023-03-14","arxiv_id":"2303.08253","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/imagenet","name":"ImageNet","full_name":"","num_papers_in_archive":15430},{"url":"/dataset/glue","name":"GLUE","full_name":"General Language Understanding Evaluation benchmark","num_papers_in_archive":3197},{"url":"/dataset/qnli","name":"QNLI","full_name":"Question-answering NLI","num_papers_in_archive":1234}],"subtasks":[{"url":"/task/neural-network-compression","name":"Neural Network Compression"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":14,"rows_per_page":100,"shown":100,"of":1356,"of_with_code":440,"tagged_in_all":1356,"counts":{"archive_papers_tagged":1356,"with_a_code_link":440,"where_syntology_ran_a_sample":119,"not_listed_spam_title":0,"listed":1356,"listed_where_code_ran":119,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":97,"every_run_a_failure_of_syntologys_instrument":22,"listed_with_a_run_with_no_instrument_failure":97,"listed_every_run_a_failure_of_syntologys_instrument":22,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/squeezenet-alexnet-level-accuracy-with-50x","slug":"squeezenet-alexnet-level-accuracy-with-50x","title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model size","date":"2016-02-24","arxiv_id":"1602.07360","repositories_listed":59,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/squeezenet-alexnet-level-accuracy-with-50x#ran","syntology_url":"https://syntology.ai/paper/1602.07360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07360"}},"official":{"repos":["DT42/squeezenet_demo","DeepScale/SqueezeNet","Element-Research/dpnn","ejlb/squeezenet-chainer","haria/SqueezeNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/well-read-students-learn-better-the-impact-of","slug":"well-read-students-learn-better-the-impact-of","title":"Well-Read Students Learn Better: On the Importance of Pre-training Compact Models","date":"2019-08-23","arxiv_id":"1908.08962","repositories_listed":40,"syntology":{"n":32,"n_ran":21,"n_constructed":0,"n_ran_checked":15,"n_instrument":6,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":4,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 6 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/well-read-students-learn-better-the-impact-of#ran","syntology_url":"https://syntology.ai/paper/1908.08962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08962"}},"official":{"repos":["google-research/bert"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/gptq-accurate-post-training-quantization-for","slug":"gptq-accurate-post-training-quantization-for","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","date":"2022-10-31","arxiv_id":"2210.17323","repositories_listed":17,"syntology":{"n":15,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/gptq-accurate-post-training-quantization-for#ran","syntology_url":"https://syntology.ai/paper/2210.17323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.17323"}},"official":{"repos":["ist-daslab/gptq"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/amc-automl-for-model-compression-and","slug":"amc-automl-for-model-compression-and","title":"AMC: AutoML for Model Compression and Acceleration on Mobile Devices","date":"2018-02-10","arxiv_id":"1802.03494","repositories_listed":12,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/amc-automl-for-model-compression-and#ran","syntology_url":"https://syntology.ai/paper/1802.03494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03494"}},"official":{"repos":["mit-han-lab/amc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/learned-step-size-quantization","slug":"learned-step-size-quantization","title":"Learned Step Size Quantization","date":"2019-02-21","arxiv_id":"1902.08153","repositories_listed":9,"syntology":{"n":23,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":9,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 4 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/learned-step-size-quantization#ran","syntology_url":"https://syntology.ai/paper/1902.08153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08153"}},"official":null}},{"url":"/paper/the-state-of-sparsity-in-deep-neural-networks","slug":"the-state-of-sparsity-in-deep-neural-networks","title":"The State of Sparsity in Deep Neural Networks","date":"2019-02-25","arxiv_id":"1902.09574","repositories_listed":6,"syntology":null},{"url":"/paper/patient-knowledge-distillation-for-bert-model","slug":"patient-knowledge-distillation-for-bert-model","title":"Patient Knowledge Distillation for BERT Model Compression","date":"2019-08-25","arxiv_id":"1908.09355","repositories_listed":5,"syntology":{"n":27,"n_ran":19,"n_constructed":0,"n_ran_checked":13,"n_instrument":6,"n_unverified":8,"n_honours":3,"n_violates":1,"n_no_contract":9,"n_pointer_only":27,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/patient-knowledge-distillation-for-bert-model#ran","syntology_url":"https://syntology.ai/paper/1908.09355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09355"}},"official":{"repos":["intersun/PKD-for-BERT-Model-Compression"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/model-compression-via-distillation-and","slug":"model-compression-via-distillation-and","title":"Model compression via distillation and quantization","date":"2018-02-15","arxiv_id":"1802.05668","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-compression-via-distillation-and#ran","syntology_url":"https://syntology.ai/paper/1802.05668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05668"}},"official":{"repos":["antspy/quantized_distillation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ternary-weight-networks","slug":"ternary-weight-networks","title":"Ternary Weight Networks","date":"2016-05-16","arxiv_id":"1605.04711","repositories_listed":5,"syntology":null},{"url":"/paper/sharpness-aware-quantization-for-deep-neural","slug":"sharpness-aware-quantization-for-deep-neural","title":"Sharpness-aware Quantization for Deep Neural Networks","date":"2021-11-24","arxiv_id":"2111.12273","repositories_listed":4,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/sharpness-aware-quantization-for-deep-neural#ran","syntology_url":"https://syntology.ai/paper/2111.12273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12273"}},"official":{"repos":["zhuang-group/saq","zip-group/saq","ziplab/saq"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/lightspeech-lightweight-and-fast-text-to","slug":"lightspeech-lightweight-and-fast-text-to","title":"LightSpeech: Lightweight and Fast Text to Speech with Neural Architecture Search","date":"2021-02-08","arxiv_id":"2102.04040","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lightspeech-lightweight-and-fast-text-to#ran","syntology_url":"https://syntology.ai/paper/2102.04040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04040"}},"official":{"repos":["microsoft/NeuralSpeech"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/training-with-quantization-noise-for-extreme","slug":"training-with-quantization-noise-for-extreme","title":"Training with Quantization Noise for Extreme Model Compression","date":"2020-04-15","arxiv_id":"2004.07320","repositories_listed":4,"syntology":null},{"url":"/paper/contrastive-representation-distillation-1","slug":"contrastive-representation-distillation-1","title":"Contrastive Representation Distillation","date":"2019-10-23","arxiv_id":"1910.10699","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/contrastive-representation-distillation-1#ran","syntology_url":"https://syntology.ai/paper/1910.10699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10699"}},"official":{"repos":["HobbitLong/RepDistiller"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/global-sparse-momentum-sgd-for-pruning-very","slug":"global-sparse-momentum-sgd-for-pruning-very","title":"Global Sparse Momentum SGD for Pruning Very Deep Neural Networks","date":"2019-09-27","arxiv_id":"1909.12778","repositories_listed":4,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/global-sparse-momentum-sgd-for-pruning-very#ran","syntology_url":"https://syntology.ai/paper/1909.12778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12778"}},"official":{"repos":["DingXiaoH/GSM-SGD"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/to-prune-or-not-to-prune-exploring-the","slug":"to-prune-or-not-to-prune-exploring-the","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","date":"2017-10-05","arxiv_id":"1710.01878","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/to-prune-or-not-to-prune-exploring-the#ran","syntology_url":"https://syntology.ai/paper/1710.01878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.01878"}},"official":null}},{"url":"/paper/deepspeed-moe-advancing-mixture-of-experts","slug":"deepspeed-moe-advancing-mixture-of-experts","title":"DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scale","date":"2022-01-14","arxiv_id":"2201.05596","repositories_listed":3,"syntology":null},{"url":"/paper/zeroq-a-novel-zero-shot-quantization","slug":"zeroq-a-novel-zero-shot-quantization","title":"ZeroQ: A Novel Zero Shot Quantization Framework","date":"2020-01-01","arxiv_id":"2001.00281","repositories_listed":3,"syntology":{"n":19,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/zeroq-a-novel-zero-shot-quantization#ran","syntology_url":"https://syntology.ai/paper/2001.00281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00281"}},"official":{"repos":["amirgholami/ZeroQ"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/data-free-adversarial-distillation","slug":"data-free-adversarial-distillation","title":"Data-Free Adversarial Distillation","date":"2019-12-23","arxiv_id":"1912.11006","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/data-free-adversarial-distillation#ran","syntology_url":"https://syntology.ai/paper/1912.11006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.11006"}},"official":{"repos":["VainF/Data-Free-Adversarial-Distillation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/microexpnet-an-extremely-small-and-fast-model","slug":"microexpnet-an-extremely-small-and-fast-model","title":"MicroExpNet: An Extremely Small and Fast Model For Expression Recognition From Face Images","date":"2017-11-19","arxiv_id":"1711.07011","repositories_listed":3,"syntology":null},{"url":"/paper/actor-mimic-deep-multitask-and-transfer","slug":"actor-mimic-deep-multitask-and-transfer","title":"Actor-Mimic: Deep Multitask and Transfer Reinforcement Learning","date":"2015-11-19","arxiv_id":"1511.06342","repositories_listed":3,"syntology":null},{"url":"/paper/localize-and-stitch-efficient-model-merging","slug":"localize-and-stitch-efficient-model-merging","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","date":"2024-08-24","arxiv_id":"2408.13656","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/localize-and-stitch-efficient-model-merging#ran","syntology_url":"https://syntology.ai/paper/2408.13656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.13656"}},"official":{"repos":["uiuctml/localize-and-stitch","yifei-he/localize-and-stitch"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-fine-tuning-of-compressed-neural","slug":"adversarial-fine-tuning-of-compressed-neural","title":"Adversarial Fine-tuning of Compressed Neural Networks for Joint Improvement of Robustness and Efficiency","date":"2024-03-14","arxiv_id":"2403.09441","repositories_listed":2,"syntology":null},{"url":"/paper/llm-inference-unveiled-survey-and-roofline","slug":"llm-inference-unveiled-survey-and-roofline","title":"LLM Inference Unveiled: Survey and Roofline Model Insights","date":"2024-02-26","arxiv_id":"2402.16363","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":0,"n_honours":7,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 7 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llm-inference-unveiled-survey-and-roofline#ran","syntology_url":"https://syntology.ai/paper/2402.16363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16363"}},"official":{"repos":["hahnyuan/llm-viewer"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/safety-and-performance-why-not-both-bi-1","slug":"safety-and-performance-why-not-both-bi-1","title":"Safety and Performance, Why Not Both? Bi-Objective Optimized Model Compression against Heterogeneous Attacks Toward AI Software Deployment","date":"2024-01-02","arxiv_id":"2401.00996","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/safety-and-performance-why-not-both-bi-1#ran","syntology_url":"https://syntology.ai/paper/2401.00996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00996"}},"official":{"repos":["jiepku/safecompress"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-membership-inference-attack-in","slug":"addressing-membership-inference-attack-in","title":"Privacy and Accuracy Implications of Model Complexity and Integration in Heterogeneous Federated Learning","date":"2023-11-29","arxiv_id":"2311.17750","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/addressing-membership-inference-attack-in#ran","syntology_url":"https://syntology.ai/paper/2311.17750","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17750"}},"official":{"repos":["ellisalicante/ma-fl-mia","negedng/ma-fl-mia"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lxmert-model-compression-for-visual-question","slug":"lxmert-model-compression-for-visual-question","title":"LXMERT Model Compression for Visual Question Answering","date":"2023-10-23","arxiv_id":"2310.15325","repositories_listed":2,"syntology":null},{"url":"/paper/reprogramming-under-constraints-revisiting","slug":"reprogramming-under-constraints-revisiting","title":"Uncovering the Hidden Cost of Model Compression","date":"2023-08-29","arxiv_id":"2308.14969","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reprogramming-under-constraints-revisiting#ran","syntology_url":"https://syntology.ai/paper/2308.14969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14969"}},"official":{"repos":["landskape-ai/reprogram_lt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/omniquant-omnidirectionally-calibrated","slug":"omniquant-omnidirectionally-calibrated","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","date":"2023-08-25","arxiv_id":"2308.13137","repositories_listed":2,"syntology":{"n":16,"n_ran":10,"n_constructed":1,"n_ran_checked":5,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/omniquant-omnidirectionally-calibrated#ran","syntology_url":"https://syntology.ai/paper/2308.13137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.13137"}},"official":{"repos":["opengvlab/omniquant"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/variation-aware-vision-transformer","slug":"variation-aware-vision-transformer","title":"Quantization Variation: A New Perspective on Training Transformers with Low-Bit Precision","date":"2023-07-01","arxiv_id":"2307.00331","repositories_listed":2,"syntology":null},{"url":"/paper/performance-aware-approximation-of-global","slug":"performance-aware-approximation-of-global","title":"Performance-aware Approximation of Global Channel Pruning for Multitask CNNs","date":"2023-03-21","arxiv_id":"2303.11923","repositories_listed":2,"syntology":null},{"url":"/paper/upop-unified-and-progressive-pruning-for","slug":"upop-unified-and-progressive-pruning-for","title":"UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformers","date":"2023-01-31","arxiv_id":"2301.13741","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/upop-unified-and-progressive-pruning-for#ran","syntology_url":"https://syntology.ai/paper/2301.13741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13741"}},"official":{"repos":["sdc17/upop"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fedukd-federated-unet-model-with-knowledge","slug":"fedukd-federated-unet-model-with-knowledge","title":"FedUKD: Federated UNet Model with Knowledge Distillation for Land Use Classification from Satellite and Street Views","date":"2022-12-05","arxiv_id":"2212.02196","repositories_listed":2,"syntology":null},{"url":"/paper/basic-binary-convolution-unit-for-binarized","slug":"basic-binary-convolution-unit-for-binarized","title":"Basic Binary Convolution Unit for Binarized Image Restoration Network","date":"2022-10-02","arxiv_id":"2210.00405","repositories_listed":2,"syntology":null},{"url":"/paper/on-device-domain-generalization","slug":"on-device-domain-generalization","title":"On-Device Domain Generalization","date":"2022-09-15","arxiv_id":"2209.07521","repositories_listed":2,"syntology":null},{"url":"/paper/safety-and-performance-why-not-both-bi","slug":"safety-and-performance-why-not-both-bi","title":"Safety and Performance, Why not Both? Bi-Objective Optimized Model Compression toward AI Software Deployment","date":"2022-08-11","arxiv_id":"2208.05969","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/safety-and-performance-why-not-both-bi#ran","syntology_url":"https://syntology.ai/paper/2208.05969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.05969"}},"official":{"repos":["jiepku/mia-safecompress"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/towards-lightweight-super-resolution-with","slug":"towards-lightweight-super-resolution-with","title":"Towards Lightweight Super-Resolution with Dual Regression Learning","date":"2022-07-16","arxiv_id":"2207.07929","repositories_listed":2,"syntology":null},{"url":"/paper/communication-efficient-diffusion-strategy","slug":"communication-efficient-diffusion-strategy","title":"Communication-Efficient Diffusion Strategy for Performance Improvement of Federated Learning with Non-IID Data","date":"2022-07-15","arxiv_id":"2207.07493","repositories_listed":2,"syntology":null},{"url":"/paper/structured-pruning-learns-compact-and-1","slug":"structured-pruning-learns-compact-and-1","title":"Structured Pruning Learns Compact and Accurate Models","date":"2022-04-01","arxiv_id":"2204.00408","repositories_listed":2,"syntology":{"n":12,"n_ran":9,"n_constructed":7,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":10,"phrase":"9 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structured-pruning-learns-compact-and-1#ran","syntology_url":"https://syntology.ai/paper/2204.00408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00408"}},"official":{"repos":["princeton-nlp/cofipruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/dq-bart-efficient-sequence-to-sequence-model","slug":"dq-bart-efficient-sequence-to-sequence-model","title":"DQ-BART: Efficient Sequence-to-Sequence Model via Joint Distillation and Quantization","date":"2022-03-21","arxiv_id":"2203.11239","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dq-bart-efficient-sequence-to-sequence-model#ran","syntology_url":"https://syntology.ai/paper/2203.11239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11239"}},"official":{"repos":["amazon-research/dq-bart"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed"]}}},{"url":"/paper/memory-efficient-backpropagation-through","slug":"memory-efficient-backpropagation-through","title":"Memory-Efficient Backpropagation through Large Linear Layers","date":"2022-01-31","arxiv_id":"2201.13195","repositories_listed":2,"syntology":null},{"url":"/paper/from-dense-to-sparse-contrastive-pruning-for","slug":"from-dense-to-sparse-contrastive-pruning-for","title":"From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compression","date":"2021-12-14","arxiv_id":"2112.07198","repositories_listed":2,"syntology":null},{"url":"/paper/the-niutrans-system-for-wngt-2020-efficiency-1","slug":"the-niutrans-system-for-wngt-2020-efficiency-1","title":"The NiuTrans System for WNGT 2020 Efficiency Task","date":"2021-09-16","arxiv_id":"2109.08008","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-niutrans-system-for-wngt-2020-efficiency-1#ran","syntology_url":"https://syntology.ai/paper/2109.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08008"}},"official":{"repos":["NiuTrans/NiuTrans.NMT","niutrans/niutensor"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pool-of-experts-realtime-querying-specialized","slug":"pool-of-experts-realtime-querying-specialized","title":"Pool of Experts: Realtime Querying Specialized Knowledge in Massive Neural Networks","date":"2021-07-03","arxiv_id":"2107.01354","repositories_listed":2,"syntology":null},{"url":"/paper/a-winning-hand-compressing-deep-networks-can","slug":"a-winning-hand-compressing-deep-networks-can","title":"A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustness","date":"2021-06-16","arxiv_id":"2106.09129","repositories_listed":2,"syntology":null},{"url":"/paper/polynomial-networks-in-deep-classifiers","slug":"polynomial-networks-in-deep-classifiers","title":"Augmenting Deep Classifiers with Polynomial Neural Networks","date":"2021-04-16","arxiv_id":"2104.07916","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/polynomial-networks-in-deep-classifiers#ran","syntology_url":"https://syntology.ai/paper/2104.07916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07916"}},"official":{"repos":["grigorisg9gr/polynomials-for-augmenting-nns"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/preserved-central-model-for-faster","slug":"preserved-central-model-for-faster","title":"Preserved central model for faster bidirectional compression in distributed settings","date":"2021-02-24","arxiv_id":"2102.12528","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/preserved-central-model-for-faster#ran","syntology_url":"https://syntology.ai/paper/2102.12528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12528"}},"official":{"repos":["philipco/mcm-bidirectional-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-convolutional-neural-networks-on-fpgas","slug":"fast-convolutional-neural-networks-on-fpgas","title":"Fast convolutional neural networks on FPGAs with hls4ml","date":"2021-01-13","arxiv_id":"2101.05108","repositories_listed":2,"syntology":null},{"url":"/paper/progressive-network-grafting-for-few-shot","slug":"progressive-network-grafting-for-few-shot","title":"Progressive Network Grafting for Few-Shot Knowledge Distillation","date":"2020-12-09","arxiv_id":"2012.04915","repositories_listed":2,"syntology":null},{"url":"/paper/de-rrd-a-knowledge-distillation-framework-for","slug":"de-rrd-a-knowledge-distillation-framework-for","title":"DE-RRD: A Knowledge Distillation Framework for Recommender System","date":"2020-12-08","arxiv_id":"2012.04357","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/de-rrd-a-knowledge-distillation-framework-for#ran","syntology_url":"https://syntology.ai/paper/2012.04357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04357"}},"official":{"repos":["SeongKu-Kang/DE-RRD_CIKM20"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/head-network-distillation-splitting-distilled","slug":"head-network-distillation-splitting-distilled","title":"Head Network Distillation: Splitting Distilled Deep Neural Networks for Resource-Constrained Edge Computing Systems","date":"2020-11-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-distillation-meets-self-supervision","slug":"knowledge-distillation-meets-self-supervision","title":"Knowledge Distillation Meets Self-Supervision","date":"2020-06-12","arxiv_id":"2006.07114","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-distillation-meets-self-supervision#ran","syntology_url":"https://syntology.ai/paper/2006.07114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07114"}},"official":{"repos":["xuguodong03/SSKD"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/knowledge-distillation-and-student-teacher","slug":"knowledge-distillation-and-student-teacher","title":"Knowledge Distillation and Student-Teacher Learning for Visual Intelligence: A Review and New Outlooks","date":"2020-04-13","arxiv_id":"2004.05937","repositories_listed":2,"syntology":null},{"url":"/paper/variable-bitrate-neural-compression-via","slug":"variable-bitrate-neural-compression-via","title":"Variational Bayesian Quantization","date":"2020-02-18","arxiv_id":"2002.08158","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/variable-bitrate-neural-compression-via#ran","syntology_url":"https://syntology.ai/paper/2002.08158","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08158"}},"official":{"repos":["mandt-lab/bayesian-ac","mandt-lab/vbq"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bert-of-theseus-compressing-bert-by","slug":"bert-of-theseus-compressing-bert-by","title":"BERT-of-Theseus: Compressing BERT by Progressive Module Replacing","date":"2020-02-07","arxiv_id":"2002.02925","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/bert-of-theseus-compressing-bert-by#ran","syntology_url":"https://syntology.ai/paper/2002.02925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02925"}},"official":{"repos":["JetRunner/BERT-of-Theseus"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed"]}}},{"url":"/paper/tx-ray-quantifying-and-explaining-model","slug":"tx-ray-quantifying-and-explaining-model","title":"TX-Ray: Quantifying and Explaining Model-Knowledge Transfer in (Un-)Supervised NLP","date":"2019-12-02","arxiv_id":"1912.00982","repositories_listed":2,"syntology":null},{"url":"/paper/selective-brain-damage-measuring-the","slug":"selective-brain-damage-measuring-the","title":"What Do Compressed Deep Neural Networks Forget?","date":"2019-11-13","arxiv_id":"1911.05248","repositories_listed":2,"syntology":null},{"url":"/paper/compacting-picking-and-growing-for","slug":"compacting-picking-and-growing-for","title":"Compacting, Picking and Growing for Unforgetting Continual Learning","date":"2019-10-15","arxiv_id":"1910.06562","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compacting-picking-and-growing-for#ran","syntology_url":"https://syntology.ai/paper/1910.06562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06562"}},"official":{"repos":["ivclab/CPG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/model-fusion-via-optimal-transport","slug":"model-fusion-via-optimal-transport","title":"Model Fusion via Optimal Transport","date":"2019-10-12","arxiv_id":"1910.05653","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-fusion-via-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/1910.05653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05653"}},"official":{"repos":["sidak/otfusion"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-pruning-of-large-language-models","slug":"structured-pruning-of-large-language-models","title":"Structured Pruning of Large Language Models","date":"2019-10-10","arxiv_id":"1910.04732","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/structured-pruning-of-large-language-models#ran","syntology_url":"https://syntology.ai/paper/1910.04732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04732"}},"official":{"repos":["asappresearch/flop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/towards-unifying-neural-architecture-space","slug":"towards-unifying-neural-architecture-space","title":"How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?","date":"2019-10-02","arxiv_id":"1910.00780","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-unifying-neural-architecture-space#ran","syntology_url":"https://syntology.ai/paper/1910.00780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00780"}},"official":null}},{"url":"/paper/distilled-split-deep-neural-networks-for-edge","slug":"distilled-split-deep-neural-networks-for-edge","title":"Distilled Split Deep Neural Networks for Edge-Assisted Real-Time Systems","date":"2019-10-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/light-multi-segment-activation-for-model","slug":"light-multi-segment-activation-for-model","title":"Light Multi-segment Activation for Model Compression","date":"2019-07-16","arxiv_id":"1907.06870","repositories_listed":2,"syntology":null},{"url":"/paper/progressive-dnn-compression-a-key-to-achieve","slug":"progressive-dnn-compression-a-key-to-achieve","title":"Progressive DNN Compression: A Key to Achieve Ultra-High Weight Pruning and Quantization Rates using ADMM","date":"2019-03-23","arxiv_id":"1903.09769","repositories_listed":2,"syntology":null},{"url":"/paper/adversarially-trained-model-compression-when","slug":"adversarially-trained-model-compression-when","title":"Model Compression with Adversarial Robustness: A Unified Optimization Framework","date":"2019-02-10","arxiv_id":"1902.03538","repositories_listed":2,"syntology":null},{"url":"/paper/gasl-guided-attention-for-sparsity-learning","slug":"gasl-guided-attention-for-sparsity-learning","title":"GASL: Guided Attention for Sparsity Learning in Deep Neural Networks","date":"2019-01-07","arxiv_id":"1901.01939","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-channel-pruning-feature-boosting-and","slug":"dynamic-channel-pruning-feature-boosting-and","title":"Dynamic Channel Pruning: Feature Boosting and Suppression","date":"2018-10-12","arxiv_id":"1810.05331","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dynamic-channel-pruning-feature-boosting-and#ran","syntology_url":"https://syntology.ai/paper/1810.05331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05331"}},"official":{"repos":["deep-fry/mayo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/verifiable-reinforcement-learning-via-policy","slug":"verifiable-reinforcement-learning-via-policy","title":"Verifiable Reinforcement Learning via Policy Extraction","date":"2018-05-22","arxiv_id":"1805.08328","repositories_listed":2,"syntology":null},{"url":"/paper/paraphrasing-complex-network-network","slug":"paraphrasing-complex-network-network","title":"Paraphrasing Complex Network: Network Compression via Factor Transfer","date":"2018-02-14","arxiv_id":"1802.04977","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/paraphrasing-complex-network-network#ran","syntology_url":"https://syntology.ai/paper/1802.04977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04977"}},"official":{"repos":["Jangho-Kim/Factor-Transfer-pytorch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/weightless-lossy-weight-encoding-for-deep","slug":"weightless-lossy-weight-encoding-for-deep","title":"Weightless: Lossy Weight Encoding For Deep Neural Network Compression","date":"2017-11-13","arxiv_id":"1711.04686","repositories_listed":2,"syntology":null},{"url":"/paper/data-free-knowledge-distillation-for-deep","slug":"data-free-knowledge-distillation-for-deep","title":"Data-Free Knowledge Distillation for Deep Neural Networks","date":"2017-10-19","arxiv_id":"1710.07535","repositories_listed":2,"syntology":null},{"url":"/paper/attribution-guided-pruning-for-compression","slug":"attribution-guided-pruning-for-compression","title":"Attribution-guided Pruning for Compression, Circuit Discovery, and Targeted Correction in LLMs","date":"2025-06-16","arxiv_id":"2506.13727","repositories_listed":1,"syntology":null},{"url":"/paper/simple-is-what-you-need-for-efficient-and","slug":"simple-is-what-you-need-for-efficient-and","title":"Simple is what you need for efficient and accurate medical image segmentation","date":"2025-06-16","arxiv_id":"2506.13415","repositories_listed":1,"syntology":null},{"url":"/paper/fima-q-post-training-quantization-for-vision-1","slug":"fima-q-post-training-quantization-for-vision-1","title":"FIMA-Q: Post-Training Quantization for Vision Transformers by Fisher Information Matrix Approximation","date":"2025-06-13","arxiv_id":"2506.11543","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/fima-q-post-training-quantization-for-vision-1#ran","syntology_url":"https://syntology.ai/paper/2506.11543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.11543"}},"official":{"repos":["shihewang/fima-q"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/advances-in-small-footprint-keyword-spotting","slug":"advances-in-small-footprint-keyword-spotting","title":"Advances in Small-Footprint Keyword Spotting: A Comprehensive Review of Efficient Models and Algorithms","date":"2025-06-12","arxiv_id":"2506.11169","repositories_listed":1,"syntology":null},{"url":"/paper/structured-pruning-and-quantization-for","slug":"structured-pruning-and-quantization-for","title":"Structured Pruning and Quantization for Learned Image Compression","date":"2025-06-02","arxiv_id":"2506.01229","repositories_listed":1,"syntology":null},{"url":"/paper/flat-llm-fine-grained-low-rank-activation","slug":"flat-llm-fine-grained-low-rank-activation","title":"FLAT-LLM: Fine-grained Low-rank Activation Space Transformation for Large Language Model Compression","date":"2025-05-29","arxiv_id":"2505.23966","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-speech-translation-through-model","slug":"efficient-speech-translation-through-model","title":"Efficient Speech Translation through Model Compression and Knowledge Distillation","date":"2025-05-26","arxiv_id":"2505.20237","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-grafting-of-large-language-models","slug":"knowledge-grafting-of-large-language-models","title":"Knowledge Grafting of Large Language Models","date":"2025-05-24","arxiv_id":"2505.18502","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11204","slug":"2505-11204","title":"RanDeS: Randomized Delta Superposition for Multi-Model Compression","date":"2025-05-16","arxiv_id":"2505.11204","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-quantity-quality-control-across","slug":"consistent-quantity-quality-control-across","title":"Consistent Quantity-Quality Control across Scenes for Deployment-Aware Gaussian Splatting","date":"2025-05-15","arxiv_id":"2505.10473","repositories_listed":1,"syntology":null},{"url":"/paper/towards-faster-and-more-compact-foundation","slug":"towards-faster-and-more-compact-foundation","title":"Towards Faster and More Compact Foundation Models for Molecular Property Prediction","date":"2025-04-28","arxiv_id":"2504.19538","repositories_listed":1,"syntology":null},{"url":"/paper/impart-importance-aware-delta-sparsification","slug":"impart-importance-aware-delta-sparsification","title":"ImPart: Importance-Aware Delta-Sparsification for Improved Model Compression and Merging in LLMs","date":"2025-04-17","arxiv_id":"2504.13237","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/impart-importance-aware-delta-sparsification#ran","syntology_url":"https://syntology.ai/paper/2504.13237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.13237"}},"official":{"repos":["yanyang19/ImPart"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-reasoning-models-a-survey","slug":"efficient-reasoning-models-a-survey","title":"Efficient Reasoning Models: A Survey","date":"2025-04-15","arxiv_id":"2504.10903","repositories_listed":1,"syntology":null},{"url":"/paper/thanos-a-block-wise-pruning-algorithm-for","slug":"thanos-a-block-wise-pruning-algorithm-for","title":"Thanos: A Block-wise Pruning Algorithm for Efficient Large Language Model Compression","date":"2025-04-06","arxiv_id":"2504.05346","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-large-language-models-with-mask-fine","slug":"boosting-large-language-models-with-mask-fine","title":"Boosting Large Language Models with Mask Fine-Tuning","date":"2025-03-27","arxiv_id":"2503.22764","repositories_listed":1,"syntology":null},{"url":"/paper/svd-llm-v2-optimizing-singular-value","slug":"svd-llm-v2-optimizing-singular-value","title":"SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compression","date":"2025-03-16","arxiv_id":"2503.12340","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/svd-llm-v2-optimizing-singular-value#ran","syntology_url":"https://syntology.ai/paper/2503.12340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.12340"}},"official":{"repos":["aiot-mlsys-lab/svd-llm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/casp-compression-of-large-multimodal-models","slug":"casp-compression-of-large-multimodal-models","title":"CASP: Compression of Large Multimodal Models Based on Attention Sparsity","date":"2025-03-07","arxiv_id":"2503.05936","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-cross-tokenizer-knowledge","slug":"enhancing-cross-tokenizer-knowledge","title":"Enhancing Cross-Tokenizer Knowledge Distillation with Contextual Dynamical Mapping","date":"2025-02-16","arxiv_id":"2502.11104","repositories_listed":1,"syntology":null},{"url":"/paper/forget-the-data-and-fine-tuning-just-fold-the","slug":"forget-the-data-and-fine-tuning-just-fold-the","title":"Forget the Data and Fine-Tuning! Just Fold the Network to Compress","date":"2025-02-14","arxiv_id":"2502.10216","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/forget-the-data-and-fine-tuning-just-fold-the#ran","syntology_url":"https://syntology.ai/paper/2502.10216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10216"}},"official":{"repos":["nanguoyu/model-folding-universal"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/darwinlm-evolutionary-structured-pruning-of","slug":"darwinlm-evolutionary-structured-pruning-of","title":"DarwinLM: Evolutionary Structured Pruning of Large Language Models","date":"2025-02-11","arxiv_id":"2502.07780","repositories_listed":1,"syntology":null},{"url":"/paper/systematic-outliers-in-large-language-models","slug":"systematic-outliers-in-large-language-models","title":"Systematic Outliers in Large Language Models","date":"2025-02-10","arxiv_id":"2502.06415","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/systematic-outliers-in-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2502.06415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.06415"}},"official":{"repos":["an-yongqi/systematic-outliers"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/activation-informed-merging-of-large-language","slug":"activation-informed-merging-of-large-language","title":"Activation-Informed Merging of Large Language Models","date":"2025-02-04","arxiv_id":"2502.02421","repositories_listed":1,"syntology":null},{"url":"/paper/sana-1-5-efficient-scaling-of-training-time","slug":"sana-1-5-efficient-scaling-of-training-time","title":"SANA 1.5: Efficient Scaling of Training-Time and Inference-Time Compute in Linear Diffusion Transformer","date":"2025-01-30","arxiv_id":"2501.18427","repositories_listed":1,"syntology":null},{"url":"/paper/perforated-backpropagation-a-neuroscience","slug":"perforated-backpropagation-a-neuroscience","title":"Perforated Backpropagation: A Neuroscience Inspired Extension to Artificial Neural Networks","date":"2025-01-29","arxiv_id":"2501.18018","repositories_listed":1,"syntology":null},{"url":"/paper/multipruner-balanced-structure-removal-in","slug":"multipruner-balanced-structure-removal-in","title":"MultiPruner: Balanced Structure Removal in Foundation Models","date":"2025-01-17","arxiv_id":"2501.09949","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-dynamic-neural-networks-from","slug":"a-survey-on-dynamic-neural-networks-from","title":"A Survey on Dynamic Neural Networks: from Computer Vision to Multi-modal Sensor Fusion","date":"2025-01-13","arxiv_id":"2501.07451","repositories_listed":1,"syntology":null},{"url":"/paper/merging-feed-forward-sublayers-for-compressed","slug":"merging-feed-forward-sublayers-for-compressed","title":"Merging Feed-Forward Sublayers for Compressed Transformers","date":"2025-01-10","arxiv_id":"2501.06126","repositories_listed":1,"syntology":null},{"url":"/paper/tensorization-of-neural-networks-for-improved","slug":"tensorization-of-neural-networks-for-improved","title":"Tensorization of neural networks for improved privacy and interpretability","date":"2025-01-10","arxiv_id":"2501.06300","repositories_listed":1,"syntology":null},{"url":"/paper/neural-architecture-codesign-for-fast-physics","slug":"neural-architecture-codesign-for-fast-physics","title":"Neural Architecture Codesign for Fast Physics Applications","date":"2025-01-09","arxiv_id":"2501.05515","repositories_listed":1,"syntology":null},{"url":"/paper/lightgnn-simple-graph-neural-network-for","slug":"lightgnn-simple-graph-neural-network-for","title":"LightGNN: Simple Graph Neural Network for Recommendation","date":"2025-01-06","arxiv_id":"2501.03228","repositories_listed":1,"syntology":null}],"syntology_records":42,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":4,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/model-compression-on-imagenet","since_archive":"/sota/model-compression-on-imagenet#since-judged","papers_judged":3,"placed":0},{"leaderboard":"/sota/model-compression-on-qnli","since_archive":"/sota/model-compression-on-qnli#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":119,"papers_where_code_ran_first_page":"/task/model-compression/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":14,"url":"/task/model-compression/papers/2","json":"/task/model-compression/papers/2.json","rows":100},{"order":"archive","page":3,"of":14,"url":"/task/model-compression/papers/3","json":"/task/model-compression/papers/3.json","rows":100},{"order":"archive","page":4,"of":14,"url":"/task/model-compression/papers/4","json":"/task/model-compression/papers/4.json","rows":100},{"order":"archive","page":5,"of":14,"url":"/task/model-compression/papers/5","json":"/task/model-compression/papers/5.json","rows":100},{"order":"archive","page":6,"of":14,"url":"/task/model-compression/papers/6","json":"/task/model-compression/papers/6.json","rows":100},{"order":"archive","page":7,"of":14,"url":"/task/model-compression/papers/7","json":"/task/model-compression/papers/7.json","rows":100},{"order":"archive","page":8,"of":14,"url":"/task/model-compression/papers/8","json":"/task/model-compression/papers/8.json","rows":100},{"order":"archive","page":9,"of":14,"url":"/task/model-compression/papers/9","json":"/task/model-compression/papers/9.json","rows":100},{"order":"archive","page":10,"of":14,"url":"/task/model-compression/papers/10","json":"/task/model-compression/papers/10.json","rows":100},{"order":"archive","page":11,"of":14,"url":"/task/model-compression/papers/11","json":"/task/model-compression/papers/11.json","rows":100},{"order":"archive","page":12,"of":14,"url":"/task/model-compression/papers/12","json":"/task/model-compression/papers/12.json","rows":100},{"order":"archive","page":13,"of":14,"url":"/task/model-compression/papers/13","json":"/task/model-compression/papers/13.json","rows":100},{"order":"archive","page":14,"of":14,"url":"/task/model-compression/papers/14","json":"/task/model-compression/papers/14.json","rows":56},{"order":"ran","page":1,"of":2,"url":"/task/model-compression/papers/ran/1","json":"/task/model-compression/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/model-compression/papers/ran/2","json":"/task/model-compression/papers/ran/2.json","rows":19}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"c264c58cc022c725c004705b5f6bd543c2555d3c1fb37cca92cecf71c01c1b77","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}