{"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/papers/ran/1","list_of":"/task/model-compression","task":"Model Compression","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":2,"rows_per_page":100,"rows":[1,100],"of":119,"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"},"first_page":"/task/model-compression/papers/ran/1","prev":null,"next":"/task/model-compression/papers/ran/2","papers":[{"url":"/paper/radio-rate-distortion-optimization-for-large","slug":"radio-rate-distortion-optimization-for-large","title":"Radio: Rate-Distortion Optimization for Large Language Model Compression","date":"2025-05-05","arxiv_id":"2505.03031","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/radio-rate-distortion-optimization-for-large#ran","syntology_url":"https://syntology.ai/paper/2505.03031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03031"}},"official":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/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/efficient-ai-in-practice-training-and","slug":"efficient-ai-in-practice-training-and","title":"Efficient AI in Practice: Training and Deployment of Efficient LLMs for Industry Applications","date":"2025-02-20","arxiv_id":"2502.14305","repositories_listed":0,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-ai-in-practice-training-and#ran","syntology_url":"https://syntology.ai/paper/2502.14305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14305"}},"official":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/taq-dit-time-aware-quantization-for-diffusion","slug":"taq-dit-time-aware-quantization-for-diffusion","title":"TaQ-DiT: Time-aware Quantization for Diffusion Transformers","date":"2024-11-21","arxiv_id":"2411.14172","repositories_listed":0,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"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) · 2 unverified","sample_list":"/paper/taq-dit-time-aware-quantization-for-diffusion#ran","syntology_url":"https://syntology.ai/paper/2411.14172","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.14172"}},"official":null}},{"url":"/paper/zipnn-lossless-compression-for-ai-models","slug":"zipnn-lossless-compression-for-ai-models","title":"ZipNN: Lossless Compression for AI Models","date":"2024-11-07","arxiv_id":"2411.05239","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"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) · 1 unverified","sample_list":"/paper/zipnn-lossless-compression-for-ai-models#ran","syntology_url":"https://syntology.ai/paper/2411.05239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.05239"}},"official":{"repos":["zipnn/zipnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/llmcbench-benchmarking-large-language-model","slug":"llmcbench-benchmarking-large-language-model","title":"LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment","date":"2024-10-28","arxiv_id":"2410.21352","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/llmcbench-benchmarking-large-language-model#ran","syntology_url":"https://syntology.ai/paper/2410.21352","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21352"}},"official":{"repos":["aboveparadise/llmcbench"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/evopress-towards-optimal-dynamic-model","slug":"evopress-towards-optimal-dynamic-model","title":"EvoPress: Towards Optimal Dynamic Model Compression via Evolutionary Search","date":"2024-10-18","arxiv_id":"2410.14649","repositories_listed":1,"syntology":{"n":17,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/evopress-towards-optimal-dynamic-model#ran","syntology_url":"https://syntology.ai/paper/2410.14649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14649"}},"official":{"repos":["ist-daslab/evopress"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/qianets-quantum-integrated-adaptive-networks","slug":"qianets-quantum-integrated-adaptive-networks","title":"QIANets: Quantum-Integrated Adaptive Networks for Reduced Latency and Improved Inference Times in CNN Models","date":"2024-10-14","arxiv_id":"2410.10318","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/qianets-quantum-integrated-adaptive-networks#ran","syntology_url":"https://syntology.ai/paper/2410.10318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10318"}},"official":{"repos":["edwardmagongo/quantum-inspired-model-compression"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/slim-one-shot-quantized-sparse-plus-low-rank","slug":"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","arxiv_id":"2410.09615","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/slim-one-shot-quantized-sparse-plus-low-rank#ran","syntology_url":"https://syntology.ai/paper/2410.09615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09615"}},"official":{"repos":["mohammad-mozaffari/slim"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/qt-dog-quantization-aware-training-for-domain","slug":"qt-dog-quantization-aware-training-for-domain","title":"QT-DoG: Quantization-aware Training for Domain Generalization","date":"2024-10-08","arxiv_id":"2410.06020","repositories_listed":1,"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/qt-dog-quantization-aware-training-for-domain#ran","syntology_url":"https://syntology.ai/paper/2410.06020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06020"}},"official":{"repos":["saqibjaved1/QT-DoG"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/maskllm-learnable-semi-structured-sparsity","slug":"maskllm-learnable-semi-structured-sparsity","title":"MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models","date":"2024-09-26","arxiv_id":"2409.17481","repositories_listed":1,"syntology":{"n":16,"n_ran":5,"n_constructed":1,"n_ran_checked":5,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":16,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/maskllm-learnable-semi-structured-sparsity#ran","syntology_url":"https://syntology.ai/paper/2409.17481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17481"}},"official":{"repos":["nvlabs/maskllm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/search-for-efficient-large-language-models","slug":"search-for-efficient-large-language-models","title":"Search for Efficient Large Language Models","date":"2024-09-25","arxiv_id":"2409.17372","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/search-for-efficient-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2409.17372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17372"}},"official":{"repos":["shawnricecake/search-llm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 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":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/composable-interventions-for-language-models","slug":"composable-interventions-for-language-models","title":"Composable Interventions for Language Models","date":"2024-07-09","arxiv_id":"2407.06483","repositories_listed":1,"syntology":{"n":17,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":17,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/composable-interventions-for-language-models#ran","syntology_url":"https://syntology.ai/paper/2407.06483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06483"}},"official":{"repos":["hartvigsen-group/composable-interventions"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-perplexity-multi-dimensional-safety","slug":"beyond-perplexity-multi-dimensional-safety","title":"Beyond Perplexity: Multi-dimensional Safety Evaluation of LLM Compression","date":"2024-07-06","arxiv_id":"2407.04965","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/beyond-perplexity-multi-dimensional-safety#ran","syntology_url":"https://syntology.ai/paper/2407.04965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.04965"}},"official":{"repos":["zhichaoxu-shufe/beyond-perplexity-compression-safety-eval"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/q-dit-accurate-post-training-quantization-for","slug":"q-dit-accurate-post-training-quantization-for","title":"Q-DiT: Accurate Post-Training Quantization for Diffusion Transformers","date":"2024-06-25","arxiv_id":"2406.17343","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":11,"n_instrument":6,"n_unverified":2,"n_honours":4,"n_violates":0,"n_no_contract":7,"n_pointer_only":19,"phrase":"17 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; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/q-dit-accurate-post-training-quantization-for#ran","syntology_url":"https://syntology.ai/paper/2406.17343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17343"}},"official":{"repos":["juanerx/q-dit"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/pruning-via-merging-compressing-llms-via","slug":"pruning-via-merging-compressing-llms-via","title":"Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Merging","date":"2024-06-24","arxiv_id":"2406.16330","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pruning-via-merging-compressing-llms-via#ran","syntology_url":"https://syntology.ai/paper/2406.16330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16330"}},"official":{"repos":["sempraety/pruning-via-merging"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/moa-mixture-of-sparse-attention-for-automatic","slug":"moa-mixture-of-sparse-attention-for-automatic","title":"MoA: Mixture of Sparse Attention for Automatic Large Language Model Compression","date":"2024-06-21","arxiv_id":"2406.14909","repositories_listed":1,"syntology":{"n":22,"n_ran":19,"n_constructed":0,"n_ran_checked":19,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/moa-mixture-of-sparse-attention-for-automatic#ran","syntology_url":"https://syntology.ai/paper/2406.14909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14909"}},"official":{"repos":["thu-nics/moa"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":19,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/examining-post-training-quantization-for","slug":"examining-post-training-quantization-for","title":"Examining Post-Training Quantization for Mixture-of-Experts: A Benchmark","date":"2024-06-12","arxiv_id":"2406.08155","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/examining-post-training-quantization-for#ran","syntology_url":"https://syntology.ai/paper/2406.08155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08155"}},"official":{"repos":["unites-lab/moe-quantization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-in-context-learning-performance","slug":"enhancing-in-context-learning-performance","title":"Enhancing In-Context Learning Performance with just SVD-Based Weight Pruning: A Theoretical Perspective","date":"2024-06-06","arxiv_id":"2406.03768","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/enhancing-in-context-learning-performance#ran","syntology_url":"https://syntology.ai/paper/2406.03768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03768"}},"official":{"repos":["chen123ctrls/enhancingicl_svdpruning"],"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/transferable-and-principled-efficiency-for","slug":"transferable-and-principled-efficiency-for","title":"Transferable and Principled Efficiency for Open-Vocabulary Segmentation","date":"2024-04-11","arxiv_id":"2404.07448","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/transferable-and-principled-efficiency-for#ran","syntology_url":"https://syntology.ai/paper/2404.07448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.07448"}},"official":{"repos":["xujxyang/opentrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pyra-parallel-yielding-re-activation-for","slug":"pyra-parallel-yielding-re-activation-for","title":"PYRA: Parallel Yielding Re-Activation for Training-Inference Efficient Task Adaptation","date":"2024-03-14","arxiv_id":"2403.09192","repositories_listed":1,"syntology":{"n":16,"n_ran":16,"n_constructed":0,"n_ran_checked":13,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 2 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pyra-parallel-yielding-re-activation-for#ran","syntology_url":"https://syntology.ai/paper/2403.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09192"}},"official":{"repos":["thu-mig/pyra"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/svd-llm-truncation-aware-singular-value","slug":"svd-llm-truncation-aware-singular-value","title":"SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression","date":"2024-03-12","arxiv_id":"2403.07378","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/svd-llm-truncation-aware-singular-value#ran","syntology_url":"https://syntology.ai/paper/2403.07378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07378"}},"official":{"repos":["aiot-mlsys-lab/svd-llm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lossless-compression-of-deep-neural-networks-1","slug":"lossless-compression-of-deep-neural-networks-1","title":"\"Lossless\" Compression of Deep Neural Networks: A High-dimensional Neural Tangent Kernel Approach","date":"2024-03-01","arxiv_id":"2403.00258","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/lossless-compression-of-deep-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2403.00258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00258"}},"official":{"repos":["model-compression/lossless_compression"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/promptmm-multi-modal-knowledge-distillation","slug":"promptmm-multi-modal-knowledge-distillation","title":"PromptMM: Multi-Modal Knowledge Distillation for Recommendation with Prompt-Tuning","date":"2024-02-27","arxiv_id":"2402.17188","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":11,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/promptmm-multi-modal-knowledge-distillation#ran","syntology_url":"https://syntology.ai/paper/2402.17188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.17188"}},"official":{"repos":["hkuds/promptmm"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 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":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/promptkd-distilling-student-friendly","slug":"promptkd-distilling-student-friendly","title":"PromptKD: Distilling Student-Friendly Knowledge for Generative Language Models via Prompt Tuning","date":"2024-02-20","arxiv_id":"2402.12842","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/promptkd-distilling-student-friendly#ran","syntology_url":"https://syntology.ai/paper/2402.12842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12842"}},"official":{"repos":["gmkim-ai/promptkd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/quest-low-bit-diffusion-model-quantization","slug":"quest-low-bit-diffusion-model-quantization","title":"QuEST: Low-bit Diffusion Model Quantization via Efficient Selective Finetuning","date":"2024-02-06","arxiv_id":"2402.03666","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":3,"n_instrument":8,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quest-low-bit-diffusion-model-quantization#ran","syntology_url":"https://syntology.ai/paper/2402.03666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03666"}},"official":{"repos":["hatchetProject/QuEST"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/faster-and-lighter-llms-a-survey-on-current","slug":"faster-and-lighter-llms-a-survey-on-current","title":"Faster and Lighter LLMs: A Survey on Current Challenges and Way Forward","date":"2024-02-02","arxiv_id":"2402.01799","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/faster-and-lighter-llms-a-survey-on-current#ran","syntology_url":"https://syntology.ai/paper/2402.01799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01799"}},"official":{"repos":["nyunai/faster-llm-survey"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/tqcompressor-improving-tensor-decomposition","slug":"tqcompressor-improving-tensor-decomposition","title":"TQCompressor: improving tensor decomposition methods in neural networks via permutations","date":"2024-01-29","arxiv_id":"2401.16367","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tqcompressor-improving-tensor-decomposition#ran","syntology_url":"https://syntology.ai/paper/2401.16367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16367"}},"official":{"repos":["terra-quantum-public/tqcompressedgpt2"],"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/retraining-free-model-quantization-via-one","slug":"retraining-free-model-quantization-via-one","title":"Retraining-free Model Quantization via One-Shot Weight-Coupling Learning","date":"2024-01-03","arxiv_id":"2401.01543","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/retraining-free-model-quantization-via-one#ran","syntology_url":"https://syntology.ai/paper/2401.01543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01543"}},"official":{"repos":["1hunters/retraining-free-quantization"],"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":["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/language-model-knowledge-distillation-for","slug":"language-model-knowledge-distillation-for","title":"Language Model Knowledge Distillation for Efficient Question Answering in Spanish","date":"2023-12-07","arxiv_id":"2312.04193","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/language-model-knowledge-distillation-for#ran","syntology_url":"https://syntology.ai/paper/2312.04193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04193"}},"official":{"repos":["adrianbzg/tinyroberta-distillation-qa-es"],"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/towards-higher-ranks-via-adversarial-weight-1","slug":"towards-higher-ranks-via-adversarial-weight-1","title":"Towards Higher Ranks via Adversarial Weight Pruning","date":"2023-11-29","arxiv_id":"2311.17493","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-higher-ranks-via-adversarial-weight-1#ran","syntology_url":"https://syntology.ai/paper/2311.17493","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17493"}},"official":{"repos":["huawei-noah/Efficient-Computing"],"state":"official (archive's flag): 3 ran","n_ran":3,"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/compact-3d-gaussian-representation-for","slug":"compact-3d-gaussian-representation-for","title":"Compact 3D Gaussian Representation for Radiance Field","date":"2023-11-22","arxiv_id":"2311.13681","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/compact-3d-gaussian-representation-for#ran","syntology_url":"https://syntology.ai/paper/2311.13681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13681"}},"official":{"repos":["maincold2/Compact-3DGS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lq-lora-low-rank-plus-quantized-matrix","slug":"lq-lora-low-rank-plus-quantized-matrix","title":"LQ-LoRA: Low-rank Plus Quantized Matrix Decomposition for Efficient Language Model Finetuning","date":"2023-11-20","arxiv_id":"2311.12023","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/lq-lora-low-rank-plus-quantized-matrix#ran","syntology_url":"https://syntology.ai/paper/2311.12023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.12023"}},"official":{"repos":["hanguo97/lq-lora"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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":8,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 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":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-preserving-pruning-for-pre-trained","slug":"knowledge-preserving-pruning-for-pre-trained","title":"Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models","date":"2023-08-07","arxiv_id":"2308.03449","repositories_listed":1,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":16,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/knowledge-preserving-pruning-for-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2308.03449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03449"}},"official":{"repos":["snudm-starlab/k-prune"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/cpet-effective-parameter-efficient-tuning-for","slug":"cpet-effective-parameter-efficient-tuning-for","title":"CA-LoRA: Adapting Existing LoRA for Compressed LLMs to Enable Efficient Multi-Tasking on Personal Devices","date":"2023-07-15","arxiv_id":"2307.07705","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cpet-effective-parameter-efficient-tuning-for#ran","syntology_url":"https://syntology.ai/paper/2307.07705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07705"}},"official":{"repos":["thunlp/ca-lora"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-brief-review-of-hypernetworks-in-deep","slug":"a-brief-review-of-hypernetworks-in-deep","title":"A Brief Review of Hypernetworks in Deep Learning","date":"2023-06-12","arxiv_id":"2306.06955","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-brief-review-of-hypernetworks-in-deep#ran","syntology_url":"https://syntology.ai/paper/2306.06955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06955"}},"official":{"repos":["jmdvinodjmd/HyperITE"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-quantization-aware-training-with","slug":"efficient-quantization-aware-training-with","title":"Efficient and Robust Quantization-aware Training via Adaptive Coreset Selection","date":"2023-06-12","arxiv_id":"2306.07215","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/efficient-quantization-aware-training-with#ran","syntology_url":"https://syntology.ai/paper/2306.07215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07215"}},"official":{"repos":["huangowen/qat-acs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/pruning-meets-low-rank-parameter-efficient","slug":"pruning-meets-low-rank-parameter-efficient","title":"LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning","date":"2023-05-28","arxiv_id":"2305.18403","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"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, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pruning-meets-low-rank-parameter-efficient#ran","syntology_url":"https://syntology.ai/paper/2305.18403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18403"}},"official":{"repos":["aim-uofa/loraprune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/comcat-towards-efficient-compression-and","slug":"comcat-towards-efficient-compression-and","title":"COMCAT: Towards Efficient Compression and Customization of Attention-Based Vision Models","date":"2023-05-26","arxiv_id":"2305.17235","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/comcat-towards-efficient-compression-and#ran","syntology_url":"https://syntology.ai/paper/2305.17235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17235"}},"official":{"repos":["jinqixiao/ComCAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-multilingual-language-model","slug":"an-efficient-multilingual-language-model","title":"An Efficient Multilingual Language Model Compression through Vocabulary Trimming","date":"2023-05-24","arxiv_id":"2305.15020","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/an-efficient-multilingual-language-model#ran","syntology_url":"https://syntology.ai/paper/2305.15020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15020"}},"official":{"repos":["asahi417/lm-vocab-trimmer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ad-kd-attribution-driven-knowledge","slug":"ad-kd-attribution-driven-knowledge","title":"AD-KD: Attribution-Driven Knowledge Distillation for Language Model Compression","date":"2023-05-17","arxiv_id":"2305.10010","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ad-kd-attribution-driven-knowledge#ran","syntology_url":"https://syntology.ai/paper/2305.10010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10010"}},"official":{"repos":["brucewsy/ad-kd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/class-attention-transfer-based-knowledge","slug":"class-attention-transfer-based-knowledge","title":"Class Attention Transfer Based Knowledge Distillation","date":"2023-04-25","arxiv_id":"2304.12777","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/class-attention-transfer-based-knowledge#ran","syntology_url":"https://syntology.ai/paper/2304.12777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.12777"}},"official":{"repos":["gzyaftermath/cat-kd"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-tiny-time-series-transformer-low-latency","slug":"the-tiny-time-series-transformer-low-latency","title":"The Tiny Time-series Transformer: Low-latency High-throughput Classification of Astronomical Transients using Deep Model Compression","date":"2023-03-15","arxiv_id":"2303.08951","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-tiny-time-series-transformer-low-latency#ran","syntology_url":"https://syntology.ai/paper/2303.08951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.08951"}},"official":{"repos":["tallamjr/astronet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/psaq-vit-v2-towards-accurate-and-general-data","slug":"psaq-vit-v2-towards-accurate-and-general-data","title":"PSAQ-ViT V2: Towards Accurate and General Data-Free Quantization for Vision Transformers","date":"2022-09-13","arxiv_id":"2209.05687","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/psaq-vit-v2-towards-accurate-and-general-data#ran","syntology_url":"https://syntology.ai/paper/2209.05687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.05687"}},"official":{"repos":["zkkli/psaq-vit"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/towards-sparsification-of-graph-neural","slug":"towards-sparsification-of-graph-neural","title":"Towards Sparsification of Graph Neural Networks","date":"2022-09-11","arxiv_id":"2209.04766","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-sparsification-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2209.04766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04766"}},"official":{"repos":["harveyp123/iccd_sptrn_slr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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/disparse-disentangled-sparsification-for-1","slug":"disparse-disentangled-sparsification-for-1","title":"DiSparse: Disentangled Sparsification for Multitask Model Compression","date":"2022-06-09","arxiv_id":"2206.04662","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 4 unverified","sample_list":"/paper/disparse-disentangled-sparsification-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.04662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04662"}},"official":{"repos":["shi-labs/disparse-multitask-model-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/masking-adversarial-damage-finding","slug":"masking-adversarial-damage-finding","title":"Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Network","date":"2022-04-06","arxiv_id":"2204.02738","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/masking-adversarial-damage-finding#ran","syntology_url":"https://syntology.ai/paper/2204.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02738"}},"official":{"repos":["ByungKwanLee/Masking-Adversarial-Damage"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/chex-channel-exploration-for-cnn-model","slug":"chex-channel-exploration-for-cnn-model","title":"CHEX: CHannel EXploration for CNN Model Compression","date":"2022-03-29","arxiv_id":"2203.15794","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/chex-channel-exploration-for-cnn-model#ran","syntology_url":"https://syntology.ai/paper/2203.15794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15794"}},"official":null}},{"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/finding-the-task-optimal-low-bit-sub","slug":"finding-the-task-optimal-low-bit-sub","title":"Finding the Task-Optimal Low-Bit Sub-Distribution in Deep Neural Networks","date":"2021-12-30","arxiv_id":"2112.15139","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/finding-the-task-optimal-low-bit-sub#ran","syntology_url":"https://syntology.ai/paper/2112.15139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.15139"}},"official":{"repos":["RunpeiDong/DGMS"],"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":["official"]}}},{"url":"/paper/spvit-enabling-faster-vision-transformers-via","slug":"spvit-enabling-faster-vision-transformers-via","title":"SPViT: Enabling Faster Vision Transformers via Soft Token Pruning","date":"2021-12-27","arxiv_id":"2112.13890","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/spvit-enabling-faster-vision-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2112.13890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.13890"}},"official":{"repos":["peiyanflying/spvit"],"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","unlocated"]}}},{"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/generalized-depthwise-separable-convolutions","slug":"generalized-depthwise-separable-convolutions","title":"Generalized Depthwise-Separable Convolutions for Adversarially Robust and Efficient Neural Networks","date":"2021-10-28","arxiv_id":"2110.14871","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":4,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"7 ran (of which 4 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/generalized-depthwise-separable-convolutions#ran","syntology_url":"https://syntology.ai/paper/2110.14871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14871"}},"official":{"repos":["hsndbk4/gdws"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/hrkd-hierarchical-relational-knowledge","slug":"hrkd-hierarchical-relational-knowledge","title":"HRKD: Hierarchical Relational Knowledge Distillation for Cross-domain Language Model Compression","date":"2021-10-16","arxiv_id":"2110.08551","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/hrkd-hierarchical-relational-knowledge#ran","syntology_url":"https://syntology.ai/paper/2110.08551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08551"}},"official":{"repos":["cheneydon/hrkd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distilling-linguistic-context-for-language","slug":"distilling-linguistic-context-for-language","title":"Distilling Linguistic Context for Language Model Compression","date":"2021-09-17","arxiv_id":"2109.08359","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/distilling-linguistic-context-for-language#ran","syntology_url":"https://syntology.ai/paper/2109.08359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08359"}},"official":{"repos":["geondopark/ckd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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/recurrent-parameter-generators","slug":"recurrent-parameter-generators","title":"Compact and Optimal Deep Learning with Recurrent Parameter Generators","date":"2021-07-15","arxiv_id":"2107.07110","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/recurrent-parameter-generators#ran","syntology_url":"https://syntology.ai/paper/2107.07110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07110"}},"official":{"repos":["samaonline/Recurrent-Parameter-Generators"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/super-tickets-in-pre-trained-language-models","slug":"super-tickets-in-pre-trained-language-models","title":"Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization","date":"2021-05-25","arxiv_id":"2105.12002","repositories_listed":1,"syntology":{"n":15,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":10,"n_pointer_only":14,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 4 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/super-tickets-in-pre-trained-language-models#ran","syntology_url":"https://syntology.ai/paper/2105.12002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12002"}},"official":{"repos":["cliang1453/super-structured-lottery-tickets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/initialization-and-regularization-of-1","slug":"initialization-and-regularization-of-1","title":"Initialization and Regularization of Factorized Neural Layers","date":"2021-05-03","arxiv_id":"2105.01029","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/initialization-and-regularization-of-1#ran","syntology_url":"https://syntology.ai/paper/2105.01029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01029"}},"official":{"repos":["microsoft/fnl_paper"],"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/stealthy-backdoors-as-compression-artifacts","slug":"stealthy-backdoors-as-compression-artifacts","title":"Stealthy Backdoors as Compression Artifacts","date":"2021-04-30","arxiv_id":"2104.15129","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/stealthy-backdoors-as-compression-artifacts#ran","syntology_url":"https://syntology.ai/paper/2104.15129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.15129"}},"official":{"repos":["yulongtzzz/Stealthy-Backdoors-as-Compression-Artifacts"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-distillation-as-semiparametric-1","slug":"knowledge-distillation-as-semiparametric-1","title":"Knowledge Distillation as Semiparametric Inference","date":"2021-04-20","arxiv_id":"2104.09732","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/knowledge-distillation-as-semiparametric-1#ran","syntology_url":"https://syntology.ai/paper/2104.09732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09732"}},"official":{"repos":["microsoft/semiparametric-distillation"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/dynamic-slimmable-network","slug":"dynamic-slimmable-network","title":"Dynamic Slimmable Network","date":"2021-03-24","arxiv_id":"2103.13258","repositories_listed":1,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":17,"phrase":"7 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; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/dynamic-slimmable-network#ran","syntology_url":"https://syntology.ai/paper/2103.13258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13258"}},"official":{"repos":["changlin31/DS-Net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"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/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/show-attend-and-distill-knowledge","slug":"show-attend-and-distill-knowledge","title":"Show, Attend and Distill:Knowledge Distillation via Attention-based Feature Matching","date":"2021-02-05","arxiv_id":"2102.02973","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/show-attend-and-distill-knowledge#ran","syntology_url":"https://syntology.ai/paper/2102.02973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.02973"}},"official":{"repos":["clovaai/attention-feature-distillation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gnn-rl-compression-topology-aware-network","slug":"gnn-rl-compression-topology-aware-network","title":"Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learning","date":"2021-02-05","arxiv_id":"2102.03214","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gnn-rl-compression-topology-aware-network#ran","syntology_url":"https://syntology.ai/paper/2102.03214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03214"}},"official":{"repos":["yusx-swapp/gnn-rl-model-compression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/binarybert-pushing-the-limit-of-bert","slug":"binarybert-pushing-the-limit-of-bert","title":"BinaryBERT: Pushing the Limit of BERT Quantization","date":"2020-12-31","arxiv_id":"2012.15701","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/binarybert-pushing-the-limit-of-bert#ran","syntology_url":"https://syntology.ai/paper/2012.15701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15701"}},"official":{"repos":["huawei-noah/Pretrained-Language-Model"],"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","unlocated"]}}},{"url":"/paper/earlybert-efficient-bert-training-via-early-1","slug":"earlybert-efficient-bert-training-via-early-1","title":"EarlyBERT: Efficient BERT Training via Early-bird Lottery Tickets","date":"2020-12-31","arxiv_id":"2101.00063","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/earlybert-efficient-bert-training-via-early-1#ran","syntology_url":"https://syntology.ai/paper/2101.00063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.00063"}},"official":{"repos":["VITA-Group/EarlyBERT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/neural-pruning-via-growing-regularization-1","slug":"neural-pruning-via-growing-regularization-1","title":"Neural Pruning via Growing Regularization","date":"2020-12-16","arxiv_id":"2012.09243","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 1 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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/neural-pruning-via-growing-regularization-1#ran","syntology_url":"https://syntology.ai/paper/2012.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09243"}},"official":{"repos":["mingsun-tse/regularization-pruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/torchdistill-a-modular-configuration-driven","slug":"torchdistill-a-modular-configuration-driven","title":"torchdistill: A Modular, Configuration-Driven Framework for Knowledge Distillation","date":"2020-11-25","arxiv_id":"2011.12913","repositories_listed":1,"syntology":{"n":26,"n_ran":10,"n_constructed":0,"n_ran_checked":0,"n_instrument":10,"n_unverified":16,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 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; 10 where Syntology's instrument failed) · 16 unverified","sample_list":"/paper/torchdistill-a-modular-configuration-driven#ran","syntology_url":"https://syntology.ai/paper/2011.12913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.12913"}},"official":{"repos":["yoshitomo-matsubara/torchdistill"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":16,"ran_from_kinds":["official"]}}},{"url":"/paper/hawqv3-dyadic-neural-network-quantization","slug":"hawqv3-dyadic-neural-network-quantization","title":"HAWQV3: Dyadic Neural Network Quantization","date":"2020-11-20","arxiv_id":"2011.10680","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/hawqv3-dyadic-neural-network-quantization#ran","syntology_url":"https://syntology.ai/paper/2011.10680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.10680"}},"official":{"repos":["zhen-dong/hawq"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/a-tunable-robust-pruning-framework-through","slug":"a-tunable-robust-pruning-framework-through","title":"A Tunable Robust Pruning Framework Through Dynamic Network Rewiring of DNNs","date":"2020-11-03","arxiv_id":"2011.03083","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-tunable-robust-pruning-framework-through#ran","syntology_url":"https://syntology.ai/paper/2011.03083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03083"}},"official":null}},{"url":"/paper/passport-aware-normalization-for-deep-model","slug":"passport-aware-normalization-for-deep-model","title":"Passport-aware Normalization for Deep Model Protection","date":"2020-10-29","arxiv_id":"2010.15824","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/passport-aware-normalization-for-deep-model#ran","syntology_url":"https://syntology.ai/paper/2010.15824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.15824"}},"official":{"repos":["ZJZAC/Passport-aware-Normalization"],"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/compress-self-supervised-learning-by","slug":"compress-self-supervised-learning-by","title":"CompRess: Self-Supervised Learning by Compressing Representations","date":"2020-10-28","arxiv_id":"2010.14713","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/compress-self-supervised-learning-by#ran","syntology_url":"https://syntology.ai/paper/2010.14713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14713"}},"official":{"repos":["UMBCvision/CompReSS"],"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/end-to-end-variational-bayesian-training-of","slug":"end-to-end-variational-bayesian-training-of","title":"Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination","date":"2020-10-17","arxiv_id":"2010.08689","repositories_listed":1,"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/end-to-end-variational-bayesian-training-of#ran","syntology_url":"https://syntology.ai/paper/2010.08689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08689"}},"official":{"repos":["colehawkins/bayesian-tensor-rank-determination"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-kernel-transfer-in-knowledge","slug":"efficient-kernel-transfer-in-knowledge","title":"Improved Knowledge Distillation via Full Kernel Matrix Transfer","date":"2020-09-30","arxiv_id":"2009.14416","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-kernel-transfer-in-knowledge#ran","syntology_url":"https://syntology.ai/paper/2009.14416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14416"}},"official":{"repos":["idstcv/kda"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-distillation-on-intermediate","slug":"contrastive-distillation-on-intermediate","title":"Contrastive Distillation on Intermediate Representations for Language Model Compression","date":"2020-09-29","arxiv_id":"2009.14167","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"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, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-distillation-on-intermediate#ran","syntology_url":"https://syntology.ai/paper/2009.14167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.14167"}},"official":{"repos":["intersun/CoDIR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/paying-more-attention-to-snapshots-of","slug":"paying-more-attention-to-snapshots-of","title":"Paying more attention to snapshots of Iterative Pruning: Improving Model Compression via Ensemble Distillation","date":"2020-06-20","arxiv_id":"2006.11487","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"4 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/paying-more-attention-to-snapshots-of#ran","syntology_url":"https://syntology.ai/paper/2006.11487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11487"}},"official":{"repos":["lehduong/kesi"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-post-training-neural-quantization","slug":"improving-post-training-neural-quantization","title":"Improving Post Training Neural Quantization: Layer-wise Calibration and Integer Programming","date":"2020-06-14","arxiv_id":"2006.10518","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"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, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/improving-post-training-neural-quantization#ran","syntology_url":"https://syntology.ai/paper/2006.10518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10518"}},"official":{"repos":["itayhubara/CalibTIP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"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/micronet-for-efficient-language-modeling","slug":"micronet-for-efficient-language-modeling","title":"MicroNet for Efficient Language Modeling","date":"2020-05-16","arxiv_id":"2005.07877","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/micronet-for-efficient-language-modeling#ran","syntology_url":"https://syntology.ai/paper/2005.07877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07877"}},"official":{"repos":["mit-han-lab/neurips-micronet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/discrimination-aware-network-pruning-for-deep","slug":"discrimination-aware-network-pruning-for-deep","title":"Discrimination-aware Network Pruning for Deep Model Compression","date":"2020-01-04","arxiv_id":"2001.01050","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 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/discrimination-aware-network-pruning-for-deep#ran","syntology_url":"https://syntology.ai/paper/2001.01050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01050"}},"official":{"repos":["SCUT-AILab/DCP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/comprehensive-snn-compression-using-admm","slug":"comprehensive-snn-compression-using-admm","title":"Comprehensive SNN Compression Using ADMM Optimization and Activity Regularization","date":"2019-11-03","arxiv_id":"1911.00822","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comprehensive-snn-compression-using-admm#ran","syntology_url":"https://syntology.ai/paper/1911.00822","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00822"}},"official":{"repos":["yjwu17/ADMM-Compression-for-SNNs"],"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":["official"]}}}],"record_sha256":"f73ff940a02c0581eae21f6c2ddab9bcb6d6ec8dec3f9e1ac7d92e27de1d59f3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}