{"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/network-pruning/papers/ran/1","list_of":"/task/network-pruning","task":"Network Pruning","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":1,"rows_per_page":100,"rows":[1,83],"of":83,"counts":{"archive_papers_tagged":534,"with_a_code_link":239,"where_syntology_ran_a_sample":83,"not_listed_spam_title":0,"listed":534,"listed_where_code_ran":83,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":65,"every_run_a_failure_of_syntologys_instrument":18,"listed_with_a_run_with_no_instrument_failure":65,"listed_every_run_a_failure_of_syntologys_instrument":18,"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/network-pruning/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/replaceme-network-simplification-via-layer","slug":"replaceme-network-simplification-via-layer","title":"ReplaceMe: Network Simplification via Layer Pruning and Linear Transformations","date":"2025-05-05","arxiv_id":"2505.02819","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/replaceme-network-simplification-via-layer#ran","syntology_url":"https://syntology.ai/paper/2505.02819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.02819"}},"official":{"repos":["mts-ai/replaceme"],"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/is-c4-dataset-optimal-for-pruning-an","slug":"is-c4-dataset-optimal-for-pruning-an","title":"Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning","date":"2024-10-09","arxiv_id":"2410.07461","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/is-c4-dataset-optimal-for-pruning-an#ran","syntology_url":"https://syntology.ai/paper/2410.07461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07461"}},"official":{"repos":["abx393/llm-pruning-calibration-data"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"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/oats-outlier-aware-pruning-through-sparse-and","slug":"oats-outlier-aware-pruning-through-sparse-and","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","date":"2024-09-20","arxiv_id":"2409.13652","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/oats-outlier-aware-pruning-through-sparse-and#ran","syntology_url":"https://syntology.ai/paper/2409.13652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.13652"}},"official":{"repos":["stephenqz/oats"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/auto-train-once-controller-network-guided","slug":"auto-train-once-controller-network-guided","title":"Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratch","date":"2024-03-21","arxiv_id":"2403.14729","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":1,"n_ran_checked":7,"n_instrument":5,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":14,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/auto-train-once-controller-network-guided#ran","syntology_url":"https://syntology.ai/paper/2403.14729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.14729"}},"official":{"repos":["xidongwu/autotrainonce"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/not-all-tickets-are-equal-and-we-know-it","slug":"not-all-tickets-are-equal-and-we-know-it","title":"Pruning neural network models for gene regulatory dynamics using data and domain knowledge","date":"2024-03-05","arxiv_id":"2403.04805","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/not-all-tickets-are-equal-and-we-know-it#ran","syntology_url":"https://syntology.ai/paper/2403.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04805"}},"official":{"repos":["quackenbushlab/dash"],"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":["found_in_text","official"]}}},{"url":"/paper/fluctuation-based-adaptive-structured-pruning","slug":"fluctuation-based-adaptive-structured-pruning","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","date":"2023-12-19","arxiv_id":"2312.11983","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/fluctuation-based-adaptive-structured-pruning#ran","syntology_url":"https://syntology.ai/paper/2312.11983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.11983"}},"official":{"repos":["casia-iva-lab/flap"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"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/lightgaussian-unbounded-3d-gaussian","slug":"lightgaussian-unbounded-3d-gaussian","title":"LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPS","date":"2023-11-28","arxiv_id":"2311.17245","repositories_listed":1,"syntology":{"n":22,"n_ran":17,"n_constructed":1,"n_ran_checked":3,"n_instrument":14,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":22,"phrase":"17 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; 14 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/lightgaussian-unbounded-3d-gaussian#ran","syntology_url":"https://syntology.ai/paper/2311.17245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17245"}},"official":{"repos":["VITA-Group/LightGaussian"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/do-localization-methods-actually-localize","slug":"do-localization-methods-actually-localize","title":"Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks","date":"2023-11-15","arxiv_id":"2311.09060","repositories_listed":2,"syntology":{"n":15,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/do-localization-methods-actually-localize#ran","syntology_url":"https://syntology.ai/paper/2311.09060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.09060"}},"official":{"repos":["terarachang/memdata","terarachang/mempi"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-size-how-gradients-shape-pruning","slug":"beyond-size-how-gradients-shape-pruning","title":"Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models","date":"2023-11-08","arxiv_id":"2311.04902","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/beyond-size-how-gradients-shape-pruning#ran","syntology_url":"https://syntology.ai/paper/2311.04902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04902"}},"official":{"repos":["rocktimjyotidas/gblm-pruner","vila-lab/gblm-pruner"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-sparse-no-training-training-free-fine","slug":"dynamic-sparse-no-training-training-free-fine","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","date":"2023-10-13","arxiv_id":"2310.08915","repositories_listed":1,"syntology":{"n":15,"n_ran":8,"n_constructed":2,"n_ran_checked":6,"n_instrument":2,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":15,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/dynamic-sparse-no-training-training-free-fine#ran","syntology_url":"https://syntology.ai/paper/2310.08915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.08915"}},"official":{"repos":["zyxxmu/dsnot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/outlier-weighed-layerwise-sparsity-owl-a","slug":"outlier-weighed-layerwise-sparsity-owl-a","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","date":"2023-10-08","arxiv_id":"2310.05175","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/outlier-weighed-layerwise-sparsity-owl-a#ran","syntology_url":"https://syntology.ai/paper/2310.05175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05175"}},"official":{"repos":["luuyin/owl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-network-pruning-with-sparse-entropic","slug":"robust-network-pruning-with-sparse-entropic","title":"SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning","date":"2023-10-07","arxiv_id":"2310.04918","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-network-pruning-with-sparse-entropic#ran","syntology_url":"https://syntology.ai/paper/2310.04918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04918"}},"official":{"repos":["youlei202/entropic-wasserstein-pruning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pruning-vs-quantization-which-is-better","slug":"pruning-vs-quantization-which-is-better","title":"Pruning vs Quantization: Which is Better?","date":"2023-07-06","arxiv_id":"2307.02973","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pruning-vs-quantization-which-is-better#ran","syntology_url":"https://syntology.ai/paper/2307.02973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.02973"}},"official":{"repos":["Qualcomm-AI-research/pruning-vs-quantization"],"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/filter-pruning-for-efficient-cnns-via","slug":"filter-pruning-for-efficient-cnns-via","title":"Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler","date":"2023-07-01","arxiv_id":"2307.00198","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 4 unverified","sample_list":"/paper/filter-pruning-for-efficient-cnns-via#ran","syntology_url":"https://syntology.ai/paper/2307.00198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00198"}},"official":{"repos":["osilly/kdfs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-and-effective-pruning-approach-for","slug":"a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","arxiv_id":"2306.11695","repositories_listed":7,"syntology":{"n":22,"n_ran":9,"n_constructed":5,"n_ran_checked":6,"n_instrument":3,"n_unverified":13,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/a-simple-and-effective-pruning-approach-for#ran","syntology_url":"https://syntology.ai/paper/2306.11695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11695"}},"official":{"repos":["locuslab/wanda"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/lottery-tickets-in-evolutionary-optimization","slug":"lottery-tickets-in-evolutionary-optimization","title":"Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability","date":"2023-05-31","arxiv_id":"2306.00045","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/lottery-tickets-in-evolutionary-optimization#ran","syntology_url":"https://syntology.ai/paper/2306.00045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00045"}},"official":{"repos":["roberttlange/es-lottery"],"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/a-three-regime-model-of-network-pruning","slug":"a-three-regime-model-of-network-pruning","title":"A Three-regime Model of Network Pruning","date":"2023-05-28","arxiv_id":"2305.18383","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-three-regime-model-of-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2305.18383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18383"}},"official":{"repos":["yefanzhou/threeregimepruning"],"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/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/pruning-deep-neural-networks-from-a-sparsity-1","slug":"pruning-deep-neural-networks-from-a-sparsity-1","title":"Pruning Deep Neural Networks from a Sparsity Perspective","date":"2023-02-11","arxiv_id":"2302.05601","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/pruning-deep-neural-networks-from-a-sparsity-1#ran","syntology_url":"https://syntology.ai/paper/2302.05601","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.05601"}},"official":{"repos":["diaoenmao/pruning-deep-neural-networks-from-a-sparsity-perspective"],"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/depgraph-towards-any-structural-pruning","slug":"depgraph-towards-any-structural-pruning","title":"DepGraph: Towards Any Structural Pruning","date":"2023-01-30","arxiv_id":"2301.12900","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/depgraph-towards-any-structural-pruning#ran","syntology_url":"https://syntology.ai/paper/2301.12900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12900"}},"official":{"repos":["VainF/Torch-Pruning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-latency-aware-cnn-depth-compression","slug":"efficient-latency-aware-cnn-depth-compression","title":"Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming","date":"2023-01-28","arxiv_id":"2301.12187","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-latency-aware-cnn-depth-compression#ran","syntology_url":"https://syntology.ai/paper/2301.12187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12187"}},"official":{"repos":["snu-mllab/efficient-cnn-depth-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-fair-loss-function-for-network-pruning","slug":"a-fair-loss-function-for-network-pruning","title":"A Fair Loss Function for Network Pruning","date":"2022-11-18","arxiv_id":"2211.10285","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-fair-loss-function-for-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2211.10285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10285"}},"official":{"repos":["robbiemeyer/pw_loss_pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/finding-skill-neurons-in-pre-trained","slug":"finding-skill-neurons-in-pre-trained","title":"Finding Skill Neurons in Pre-trained Transformer-based Language Models","date":"2022-11-14","arxiv_id":"2211.07349","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":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) · 1 unverified","sample_list":"/paper/finding-skill-neurons-in-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2211.07349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07349"}},"official":{"repos":["thu-keg/skill-neuron"],"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/winning-the-lottery-ahead-of-time-efficient","slug":"winning-the-lottery-ahead-of-time-efficient","title":"Winning the Lottery Ahead of Time: Efficient Early Network Pruning","date":"2022-06-21","arxiv_id":"2206.10451","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":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) · 0 unverified","sample_list":"/paper/winning-the-lottery-ahead-of-time-efficient#ran","syntology_url":"https://syntology.ai/paper/2206.10451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10451"}},"official":{"repos":["johnrachwan123/Early-Cropression-via-Gradient-Flow-Preservation"],"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/quarantine-sparsity-can-uncover-the-trojan","slug":"quarantine-sparsity-can-uncover-the-trojan","title":"Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free","date":"2022-05-24","arxiv_id":"2205.11819","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/quarantine-sparsity-can-uncover-the-trojan#ran","syntology_url":"https://syntology.ai/paper/2205.11819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11819"}},"official":{"repos":["vita-group/backdoor-lth"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pruning-aware-sparse-regularization-for","slug":"pruning-aware-sparse-regularization-for","title":"Pruning-aware Sparse Regularization for Network Pruning","date":"2022-01-18","arxiv_id":"2201.06776","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":10,"n_pointer_only":12,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pruning-aware-sparse-regularization-for#ran","syntology_url":"https://syntology.ai/paper/2201.06776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06776"}},"official":{"repos":["casia-iva-lab/masksparsity"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-neural-network-pruning-that","slug":"automatic-neural-network-pruning-that","title":"Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracy","date":"2021-11-18","arxiv_id":"2111.09635","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/automatic-neural-network-pruning-that#ran","syntology_url":"https://syntology.ai/paper/2111.09635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.09635"}},"official":{"repos":["nota-github/autobot_aaai23"],"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/learning-compact-representations-of-neural","slug":"learning-compact-representations-of-neural","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","date":"2021-10-01","arxiv_id":"2110.00684","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-compact-representations-of-neural#ran","syntology_url":"https://syntology.ai/paper/2110.00684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.00684"}},"official":{"repos":["jayroxis/dam-pytorch"],"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","unlocated"]}}},{"url":"/paper/continual-learning-for-task-oriented-dialogue","slug":"continual-learning-for-task-oriented-dialogue","title":"Continual Learning for Task-oriented Dialogue System with Iterative Network Pruning, Expanding and Masking","date":"2021-07-17","arxiv_id":"2107.08173","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":4,"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/continual-learning-for-task-oriented-dialogue#ran","syntology_url":"https://syntology.ai/paper/2107.08173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08173"}},"official":{"repos":["siat-nlp/TPEM"],"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/efficient-matrix-free-approximations-of","slug":"efficient-matrix-free-approximations-of","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","date":"2021-07-07","arxiv_id":"2107.03356","repositories_listed":2,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":7,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/efficient-matrix-free-approximations-of#ran","syntology_url":"https://syntology.ai/paper/2107.03356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.03356"}},"official":{"repos":["IST-DASLab/M-FAC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/connectivity-matters-neural-network-pruning","slug":"connectivity-matters-neural-network-pruning","title":"Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity","date":"2021-07-05","arxiv_id":"2107.02306","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/connectivity-matters-neural-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2107.02306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02306"}},"official":{"repos":["avysogorets/effective-sparsity"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/ac-dc-alternating-compressed-decompressed","slug":"ac-dc-alternating-compressed-decompressed","title":"AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks","date":"2021-06-23","arxiv_id":"2106.12379","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":2,"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 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/ac-dc-alternating-compressed-decompressed#ran","syntology_url":"https://syntology.ai/paper/2106.12379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12379"}},"official":{"repos":["IST-DASLab/ACDC"],"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":["listed","official"]}}},{"url":"/paper/sparse-training-via-boosting-pruning","slug":"sparse-training-via-boosting-pruning","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","date":"2021-06-19","arxiv_id":"2106.10404","repositories_listed":2,"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":1,"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/sparse-training-via-boosting-pruning#ran","syntology_url":"https://syntology.ai/paper/2106.10404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10404"}},"official":{"repos":["Shiweiliuiiiiiii/GraNet"],"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/self-damaging-contrastive-learning","slug":"self-damaging-contrastive-learning","title":"Self-Damaging Contrastive Learning","date":"2021-06-06","arxiv_id":"2106.02990","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-damaging-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2106.02990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02990"}},"official":{"repos":["VITA-Group/SDCLR"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/network-pruning-that-matters-a-case-study-on-1","slug":"network-pruning-that-matters-a-case-study-on-1","title":"Network Pruning That Matters: A Case Study on Retraining Variants","date":"2021-05-07","arxiv_id":"2105.03193","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"8 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; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/network-pruning-that-matters-a-case-study-on-1#ran","syntology_url":"https://syntology.ai/paper/2105.03193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03193"}},"official":{"repos":["lehduong/NPTM"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-network-pruning-under-the-pre","slug":"rethinking-network-pruning-under-the-pre","title":"Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigm","date":"2021-04-18","arxiv_id":"2104.08682","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":1,"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/rethinking-network-pruning-under-the-pre#ran","syntology_url":"https://syntology.ai/paper/2104.08682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08682"}},"official":{"repos":["derronxu/sparsebert"],"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/emerging-paradigms-of-neural-network-pruning","slug":"emerging-paradigms-of-neural-network-pruning","title":"Recent Advances on Neural Network Pruning at Initialization","date":"2021-03-11","arxiv_id":"2103.06460","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/emerging-paradigms-of-neural-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2103.06460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.06460"}},"official":{"repos":["mingsun-tse/awesome-pruning-at-initialization","mingsun-tse/smile-pruning"],"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/manifold-regularized-dynamic-network-pruning","slug":"manifold-regularized-dynamic-network-pruning","title":"Manifold Regularized Dynamic Network Pruning","date":"2021-03-10","arxiv_id":"2103.05861","repositories_listed":7,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"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 2 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; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/manifold-regularized-dynamic-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2103.05861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05861"}},"official":null}},{"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/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/neuron-merging-compensating-for-pruned","slug":"neuron-merging-compensating-for-pruned","title":"Neuron Merging: Compensating for Pruned Neurons","date":"2020-10-25","arxiv_id":"2010.13160","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neuron-merging-compensating-for-pruned#ran","syntology_url":"https://syntology.ai/paper/2010.13160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13160"}},"official":{"repos":["friendshipkim/neuron-merging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scop-scientific-control-for-reliable-neural","slug":"scop-scientific-control-for-reliable-neural","title":"SCOP: Scientific Control for Reliable Neural Network Pruning","date":"2020-10-21","arxiv_id":"2010.10732","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/scop-scientific-control-for-reliable-neural#ran","syntology_url":"https://syntology.ai/paper/2010.10732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10732"}},"official":{"repos":["huawei-noah/Pruning"],"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/a-gradient-flow-framework-for-analyzing","slug":"a-gradient-flow-framework-for-analyzing","title":"A Gradient Flow Framework For Analyzing Network Pruning","date":"2020-09-24","arxiv_id":"2009.11839","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-gradient-flow-framework-for-analyzing#ran","syntology_url":"https://syntology.ai/paper/2009.11839","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11839"}},"official":{"repos":["EkdeepSLubana/flowandprune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sanity-checking-pruning-methods-random","slug":"sanity-checking-pruning-methods-random","title":"Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot","date":"2020-09-22","arxiv_id":"2009.11094","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 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) · 3 unverified","sample_list":"/paper/sanity-checking-pruning-methods-random#ran","syntology_url":"https://syntology.ai/paper/2009.11094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.11094"}},"official":{"repos":["JingtongSu/sanity-checking-pruning"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/eagleeye-fast-sub-net-evaluation-for","slug":"eagleeye-fast-sub-net-evaluation-for","title":"EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruning","date":"2020-07-06","arxiv_id":"2007.02491","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/eagleeye-fast-sub-net-evaluation-for#ran","syntology_url":"https://syntology.ai/paper/2007.02491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02491"}},"official":{"repos":["anonymous47823493/EagleEye"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"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/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/movement-pruning-adaptive-sparsity-by-fine","slug":"movement-pruning-adaptive-sparsity-by-fine","title":"Movement Pruning: Adaptive Sparsity by Fine-Tuning","date":"2020-05-15","arxiv_id":"2005.07683","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/movement-pruning-adaptive-sparsity-by-fine#ran","syntology_url":"https://syntology.ai/paper/2005.07683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.07683"}},"official":{"repos":["huggingface/transformers"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/network-adjustment-channel-search-guided-by","slug":"network-adjustment-channel-search-guided-by","title":"Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio","date":"2020-04-06","arxiv_id":"2004.02767","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/network-adjustment-channel-search-guided-by#ran","syntology_url":"https://syntology.ai/paper/2004.02767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02767"}},"official":{"repos":["danczs/NetworkAdjustment"],"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/dhp-differentiable-meta-pruning-via","slug":"dhp-differentiable-meta-pruning-via","title":"DHP: Differentiable Meta Pruning via HyperNetworks","date":"2020-03-30","arxiv_id":"2003.13683","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/dhp-differentiable-meta-pruning-via#ran","syntology_url":"https://syntology.ai/paper/2003.13683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13683"}},"official":{"repos":["ofsoundof/dhp"],"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/data-parallelism-in-training-sparse-neural","slug":"data-parallelism-in-training-sparse-neural","title":"Understanding the Effects of Data Parallelism and Sparsity on Neural Network Training","date":"2020-03-25","arxiv_id":"2003.11316","repositories_listed":0,"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/data-parallelism-in-training-sparse-neural#ran","syntology_url":"https://syntology.ai/paper/2003.11316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11316"}},"official":null}},{"url":"/paper/similarity-of-neural-networks-with-gradients","slug":"similarity-of-neural-networks-with-gradients","title":"Similarity of Neural Networks with Gradients","date":"2020-03-25","arxiv_id":"2003.11498","repositories_listed":4,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/similarity-of-neural-networks-with-gradients#ran","syntology_url":"https://syntology.ai/paper/2003.11498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.11498"}},"official":{"repos":["amzn/xfer"],"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/what-is-the-state-of-neural-network-pruning","slug":"what-is-the-state-of-neural-network-pruning","title":"What is the State of Neural Network Pruning?","date":"2020-03-06","arxiv_id":"2003.03033","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/what-is-the-state-of-neural-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2003.03033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03033"}},"official":{"repos":["jjgo/shrinkbench"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/comparing-rewinding-and-fine-tuning-in-neural","slug":"comparing-rewinding-and-fine-tuning-in-neural","title":"Comparing Rewinding and Fine-tuning in Neural Network Pruning","date":"2020-03-05","arxiv_id":"2003.02389","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comparing-rewinding-and-fine-tuning-in-neural#ran","syntology_url":"https://syntology.ai/paper/2003.02389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02389"}},"official":{"repos":["lottery-ticket/rewinding-iclr20-public"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/good-subnetworks-provably-exist-pruning-via","slug":"good-subnetworks-provably-exist-pruning-via","title":"Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection","date":"2020-03-03","arxiv_id":"2003.01794","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/good-subnetworks-provably-exist-pruning-via#ran","syntology_url":"https://syntology.ai/paper/2003.01794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01794"}},"official":{"repos":["lushleaf/Network-Pruning-Greedy-Forward-Selection"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-pruning-adversarially-robust-neural","slug":"on-pruning-adversarially-robust-neural","title":"HYDRA: Pruning Adversarially Robust Neural Networks","date":"2020-02-24","arxiv_id":"2002.10509","repositories_listed":4,"syntology":{"n":19,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":17,"phrase":"4 ran (of which 4 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) · 15 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/on-pruning-adversarially-robust-neural#ran","syntology_url":"https://syntology.ai/paper/2002.10509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10509"}},"official":{"repos":["inspire-group/compactness-robustness"],"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/knapsack-pruning-with-inner-distillation","slug":"knapsack-pruning-with-inner-distillation","title":"Knapsack Pruning with Inner Distillation","date":"2020-02-19","arxiv_id":"2002.08258","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/knapsack-pruning-with-inner-distillation#ran","syntology_url":"https://syntology.ai/paper/2002.08258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08258"}},"official":{"repos":["yoniaflalo/knapsack_pruning"],"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/picking-winning-tickets-before-training-by-1","slug":"picking-winning-tickets-before-training-by-1","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","date":"2020-02-18","arxiv_id":"2002.07376","repositories_listed":3,"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/picking-winning-tickets-before-training-by-1#ran","syntology_url":"https://syntology.ai/paper/2002.07376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07376"}},"official":{"repos":["alecwangcq/GraSP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/soft-threshold-weight-reparameterization-for","slug":"soft-threshold-weight-reparameterization-for","title":"Soft Threshold Weight Reparameterization for Learnable Sparsity","date":"2020-02-08","arxiv_id":"2002.03231","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":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) · 2 unverified","sample_list":"/paper/soft-threshold-weight-reparameterization-for#ran","syntology_url":"https://syntology.ai/paper/2002.03231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03231"}},"official":{"repos":["RAIVNLab/STR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/filter-sketch-for-network-pruning","slug":"filter-sketch-for-network-pruning","title":"Filter Sketch for Network Pruning","date":"2020-01-23","arxiv_id":"2001.08514","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/filter-sketch-for-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2001.08514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08514"}},"official":{"repos":["lmbxmu/FilterSketch"],"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/sparse-weight-activation-training-1","slug":"sparse-weight-activation-training-1","title":"Sparse Weight Activation Training","date":"2020-01-07","arxiv_id":"2001.01969","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"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) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/sparse-weight-activation-training-1#ran","syntology_url":"https://syntology.ai/paper/2001.01969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01969"}},"official":{"repos":["AamirRaihan/SWAT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/dreaming-to-distill-data-free-knowledge","slug":"dreaming-to-distill-data-free-knowledge","title":"Dreaming to Distill: Data-free Knowledge Transfer via DeepInversion","date":"2019-12-18","arxiv_id":"1912.08795","repositories_listed":2,"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":2,"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/dreaming-to-distill-data-free-knowledge#ran","syntology_url":"https://syntology.ai/paper/1912.08795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08795"}},"official":{"repos":["NVlabs/DeepInversion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/winning-the-lottery-with-continuous-1","slug":"winning-the-lottery-with-continuous-1","title":"Winning the Lottery with Continuous Sparsification","date":"2019-12-10","arxiv_id":"1912.04427","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/winning-the-lottery-with-continuous-1#ran","syntology_url":"https://syntology.ai/paper/1912.04427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.04427"}},"official":{"repos":["lolemacs/continuous-sparsification"],"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/the-search-for-sparse-robust-neural-networks","slug":"the-search-for-sparse-robust-neural-networks","title":"The Search for Sparse, Robust Neural Networks","date":"2019-12-05","arxiv_id":"1912.02386","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-search-for-sparse-robust-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1912.02386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.02386"}},"official":{"repos":["justincosentino/robust-sparse-networks"],"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/neural-network-pruning-with-residual","slug":"neural-network-pruning-with-residual","title":"Neural Network Pruning with Residual-Connections and Limited-Data","date":"2019-11-19","arxiv_id":"1911.08114","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-network-pruning-with-residual#ran","syntology_url":"https://syntology.ai/paper/1911.08114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08114"}},"official":null}},{"url":"/paper/190910364","slug":"190910364","title":"Class-dependent Compression of Deep Neural Networks","date":"2019-09-23","arxiv_id":"1909.10364","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190910364#ran","syntology_url":"https://syntology.ai/paper/1909.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10364"}},"official":{"repos":["rahimentezari/Sensys-ml2020"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-signal-propagation-perspective-for-pruning","slug":"a-signal-propagation-perspective-for-pruning","title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","date":"2019-06-14","arxiv_id":"1906.06307","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/a-signal-propagation-perspective-for-pruning#ran","syntology_url":"https://syntology.ai/paper/1906.06307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06307"}},"official":{"repos":["namhoonlee/spp-public"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/190600586","slug":"190600586","title":"Discovering Neural Wirings","date":"2019-06-03","arxiv_id":"1906.00586","repositories_listed":4,"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/190600586#ran","syntology_url":"https://syntology.ai/paper/1906.00586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00586"}},"official":{"repos":["allenai/dnw"],"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":["listed","official"]}}},{"url":"/paper/learning-sparse-networks-using-targeted","slug":"learning-sparse-networks-using-targeted","title":"Learning Sparse Networks Using Targeted Dropout","date":"2019-05-31","arxiv_id":"1905.13678","repositories_listed":2,"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/learning-sparse-networks-using-targeted#ran","syntology_url":"https://syntology.ai/paper/1905.13678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13678"}},"official":null}},{"url":"/paper/eigendamage-structured-pruning-in-the","slug":"eigendamage-structured-pruning-in-the","title":"EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasis","date":"2019-05-15","arxiv_id":"1905.05934","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"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 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) · 2 unverified","sample_list":"/paper/eigendamage-structured-pruning-in-the#ran","syntology_url":"https://syntology.ai/paper/1905.05934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05934"}},"official":{"repos":["alecwangcq/EigenDamage-Pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fastdepth-fast-monocular-depth-estimation-on","slug":"fastdepth-fast-monocular-depth-estimation-on","title":"FastDepth: Fast Monocular Depth Estimation on Embedded Systems","date":"2019-03-08","arxiv_id":"1903.03273","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/fastdepth-fast-monocular-depth-estimation-on#ran","syntology_url":"https://syntology.ai/paper/1903.03273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03273"}},"official":null}},{"url":"/paper/dynamic-channel-pruning-feature-boosting-and","slug":"dynamic-channel-pruning-feature-boosting-and","title":"Dynamic Channel Pruning: Feature Boosting and Suppression","date":"2018-10-12","arxiv_id":"1810.05331","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dynamic-channel-pruning-feature-boosting-and#ran","syntology_url":"https://syntology.ai/paper/1810.05331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05331"}},"official":{"repos":["deep-fry/mayo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/snip-single-shot-network-pruning-based-on","slug":"snip-single-shot-network-pruning-based-on","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","date":"2018-10-04","arxiv_id":"1810.02340","repositories_listed":8,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"5 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; 4 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/snip-single-shot-network-pruning-based-on#ran","syntology_url":"https://syntology.ai/paper/1810.02340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.02340"}},"official":{"repos":["namhoonlee/snip-public"],"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/channel-gating-neural-networks","slug":"channel-gating-neural-networks","title":"Channel Gating Neural Networks","date":"2018-05-29","arxiv_id":"1805.12549","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/channel-gating-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1805.12549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.12549"}},"official":null}},{"url":"/paper/a-systematic-dnn-weight-pruning-framework","slug":"a-systematic-dnn-weight-pruning-framework","title":"A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multipliers","date":"2018-04-10","arxiv_id":"1804.03294","repositories_listed":4,"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/a-systematic-dnn-weight-pruning-framework#ran","syntology_url":"https://syntology.ai/paper/1804.03294","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.03294"}},"official":{"repos":["KaiqiZhang/admm-pruning"],"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/the-lottery-ticket-hypothesis-finding-sparse","slug":"the-lottery-ticket-hypothesis-finding-sparse","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","date":"2018-03-09","arxiv_id":"1803.03635","repositories_listed":24,"syntology":{"n":25,"n_ran":12,"n_constructed":2,"n_ran_checked":10,"n_instrument":2,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":6,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/the-lottery-ticket-hypothesis-finding-sparse#ran","syntology_url":"https://syntology.ai/paper/1803.03635","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03635"}},"official":null}},{"url":"/paper/packnet-adding-multiple-tasks-to-a-single","slug":"packnet-adding-multiple-tasks-to-a-single","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","date":"2017-11-15","arxiv_id":"1711.05769","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/packnet-adding-multiple-tasks-to-a-single#ran","syntology_url":"https://syntology.ai/paper/1711.05769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05769"}},"official":{"repos":["arunmallya/packnet"],"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/pruning-filters-for-efficient-convnets","slug":"pruning-filters-for-efficient-convnets","title":"Pruning Filters for Efficient ConvNets","date":"2016-08-31","arxiv_id":"1608.08710","repositories_listed":21,"syntology":{"n":36,"n_ran":23,"n_constructed":4,"n_ran_checked":9,"n_instrument":14,"n_unverified":13,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":22,"phrase":"23 ran (of which 4 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 14 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/pruning-filters-for-efficient-convnets#ran","syntology_url":"https://syntology.ai/paper/1608.08710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1608.08710"}},"official":null}},{"url":"/paper/squeezenet-alexnet-level-accuracy-with-50x","slug":"squeezenet-alexnet-level-accuracy-with-50x","title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model size","date":"2016-02-24","arxiv_id":"1602.07360","repositories_listed":59,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/squeezenet-alexnet-level-accuracy-with-50x#ran","syntology_url":"https://syntology.ai/paper/1602.07360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07360"}},"official":{"repos":["DT42/squeezenet_demo","DeepScale/SqueezeNet","Element-Research/dpnn","ejlb/squeezenet-chainer","haria/SqueezeNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/deep-compression-compressing-deep-neural","slug":"deep-compression-compressing-deep-neural","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","date":"2015-10-01","arxiv_id":"1510.00149","repositories_listed":15,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-compression-compressing-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1510.00149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.00149"}},"official":null}}],"record_sha256":"f39f59e3a2f94b2598037b9519dcc6b7dbb1fe667d07180c17052b94281ba471","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}