{"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":"/method/pruning/papers/ran/5","list_of":"/method/pruning","method":"Pruning","archive":{"snapshot":"2025-07-28"},"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 isolate this method inside it.","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":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,478],"of":478,"counts":{"archive_papers_tagged":3874,"with_a_code_link":1508,"where_syntology_ran_a_sample":478,"not_listed_spam_title":0,"listed":3874,"listed_where_code_ran":478,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":395,"every_run_a_failure_of_syntologys_instrument":83,"listed_with_a_run_with_no_instrument_failure":395,"listed_every_run_a_failure_of_syntologys_instrument":83,"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":"/method/pruning/papers/ran/1","prev":"/method/pruning/papers/ran/4","next":null,"papers":[{"paper":"/paper/progressive-skeletonization-trimming-more-fat","slug":"progressive-skeletonization-trimming-more-fat","title":"Progressive Skeletonization: Trimming more fat from a network at initialization","date":"2020-06-16","arxiv_id":"2006.09081","n_code_links":1,"syntology":{"ran":5,"of":14,"n_ran_checked":5,"n_instrument":0,"unverified":9,"pointer_only":1,"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) · 9 unverified","official":{"repos":["naver/force"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":9,"ran_from_kinds":["official"]}}},{"paper":"/paper/directional-pruning-of-deep-neural-networks","slug":"directional-pruning-of-deep-neural-networks","title":"Directional Pruning of Deep Neural Networks","date":"2020-06-16","arxiv_id":"2006.09358","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["donlan2710/gRDA-Optimizer"],"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"]}}},{"paper":"/paper/gnnguard-defending-graph-neural-networks","slug":"gnnguard-defending-graph-neural-networks","title":"GNNGuard: Defending Graph Neural Networks against Adversarial Attacks","date":"2020-06-15","arxiv_id":"2006.08149","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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","official":{"repos":["mims-harvard/GNNGuard"],"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"]}}},{"paper":"/paper/generalized-optimal-sparse-decision-trees","slug":"generalized-optimal-sparse-decision-trees","title":"Generalized and Scalable Optimal Sparse Decision Trees","date":"2020-06-15","arxiv_id":"2006.08690","n_code_links":2,"syntology":{"ran":8,"of":9,"n_ran_checked":8,"n_instrument":0,"unverified":1,"pointer_only":4,"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) · 1 unverified","official":{"repos":["Jimmy-Lin/GeneralizedOptimalSparseDecisionTrees"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/pruning-neural-networks-without-any-data-by","slug":"pruning-neural-networks-without-any-data-by","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","date":"2020-06-09","arxiv_id":"2006.05467","n_code_links":6,"syntology":{"ran":12,"of":17,"n_ran_checked":11,"n_instrument":1,"unverified":5,"pointer_only":16,"phrase":"12 ran (of which 5 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["ganguli-lab/Synaptic-Flow"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/solving-hard-ai-planning-instances-using","slug":"solving-hard-ai-planning-instances-using","title":"Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning","date":"2020-06-04","arxiv_id":"2006.02689","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/pruning-via-iterative-ranking-of-sensitivity","slug":"pruning-via-iterative-ranking-of-sensitivity","title":"Pruning via Iterative Ranking of Sensitivity Statistics","date":"2020-06-01","arxiv_id":"2006.00896","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["StijnVerdenius/SNIP-it"],"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"]}}},{"paper":"/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","n_code_links":4,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"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","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"]}}},{"paper":"/paper/bayesian-bits-unifying-quantization-and","slug":"bayesian-bits-unifying-quantization-and","title":"Bayesian Bits: Unifying Quantization and Pruning","date":"2020-05-14","arxiv_id":"2005.07093","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"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","official":null}},{"paper":"/paper/trp-trained-rank-pruning-for-efficient-deep","slug":"trp-trained-rank-pruning-for-efficient-deep","title":"TRP: Trained Rank Pruning for Efficient Deep Neural Networks","date":"2020-04-30","arxiv_id":"2004.14566","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":"/paper/how-do-decisions-emerge-across-layers-in","slug":"how-do-decisions-emerge-across-layers-in","title":"How do Decisions Emerge across Layers in Neural Models? Interpretation with Differentiable Masking","date":"2020-04-30","arxiv_id":"2004.14992","n_code_links":2,"syntology":{"ran":6,"of":10,"n_ran_checked":6,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["nicola-decao/diffmask"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/relational-graph-attention-network-for-aspect","slug":"relational-graph-attention-network-for-aspect","title":"Relational Graph Attention Network for Aspect-based Sentiment Analysis","date":"2020-04-26","arxiv_id":"2004.12362","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["shenwzh3/RGAT-ABSA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/convolution-weight-distribution-assumption","slug":"convolution-weight-distribution-assumption","title":"Convolution-Weight-Distribution Assumption: Rethinking the Criteria of Channel Pruning","date":"2020-04-24","arxiv_id":"2004.11627","n_code_links":0,"syntology":{"ran":3,"of":7,"n_ran_checked":1,"n_instrument":2,"unverified":4,"pointer_only":2,"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) · 4 unverified","official":null}},{"paper":"/paper/sipa-a-simple-framework-for-efficient","slug":"sipa-a-simple-framework-for-efficient","title":"SIPA: A Simple Framework for Efficient Networks","date":"2020-04-24","arxiv_id":"2004.14476","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["Lee-Gihun/MicroNet_OSI-AI"],"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"]}}},{"paper":"/paper/poor-man-s-bert-smaller-and-faster","slug":"poor-man-s-bert-smaller-and-faster","title":"On the Effect of Dropping Layers of Pre-trained Transformer Models","date":"2020-04-08","arxiv_id":"2004.03844","n_code_links":4,"syntology":{"ran":7,"of":8,"n_ran_checked":4,"n_instrument":3,"unverified":1,"pointer_only":1,"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) · 1 unverified","official":{"repos":["hsajjad/transformers"],"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":["listed","official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/paper/dsa-more-efficient-budgeted-pruning-via","slug":"dsa-more-efficient-budgeted-pruning-via","title":"DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation","date":"2020-04-05","arxiv_id":"2004.02164","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"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","official":null}},{"paper":"/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","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":0,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":null}},{"paper":"/paper/born-again-tree-ensembles","slug":"born-again-tree-ensembles","title":"Born-Again Tree Ensembles","date":"2020-03-24","arxiv_id":"2003.11132","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":{"repos":["vidalt/BA-Trees"],"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"]}}},{"paper":"/paper/group-sparsity-the-hinge-between-filter","slug":"group-sparsity-the-hinge-between-filter","title":"Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compression","date":"2020-03-19","arxiv_id":"2003.08935","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":6,"n_instrument":0,"unverified":0,"pointer_only":2,"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) · 0 unverified","official":{"repos":["ofsoundof/group_sparsity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/tf-coder-program-synthesis-for-tensor","slug":"tf-coder-program-synthesis-for-tensor","title":"TF-Coder: Program Synthesis for Tensor Manipulations","date":"2020-03-19","arxiv_id":"2003.09040","n_code_links":2,"syntology":{"ran":8,"of":14,"n_ran_checked":8,"n_instrument":0,"unverified":6,"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) · 6 unverified","official":{"repos":["google-research/tensorflow-coder"],"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":["listed","official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":11,"of":12,"n_ran_checked":11,"n_instrument":0,"unverified":1,"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","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"]}}},{"paper":"/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","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":2,"n_instrument":4,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":2,"n_instrument":2,"unverified":3,"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","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"]}}},{"paper":"/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","n_code_links":4,"syntology":{"ran":4,"of":19,"n_ran_checked":4,"n_instrument":0,"unverified":15,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":3,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"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","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"]}}},{"paper":"/paper/lookahead-a-far-sighted-alternative-of-1","slug":"lookahead-a-far-sighted-alternative-of-1","title":"Lookahead: a Far-Sighted Alternative of Magnitude-based Pruning","date":"2020-02-12","arxiv_id":"2002.04809","n_code_links":1,"syntology":{"ran":8,"of":10,"n_ran_checked":6,"n_instrument":2,"unverified":2,"pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 6 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["alinlab/lookahead_pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","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"]}}},{"paper":"/paper/channel-pruning-via-automatic-structure","slug":"channel-pruning-via-automatic-structure","title":"Channel Pruning via Automatic Structure Search","date":"2020-01-23","arxiv_id":"2001.08565","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["lmbxmu/ABCPruner"],"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"]}}},{"paper":"/paper/teaser-fast-and-certifiable-point-cloud","slug":"teaser-fast-and-certifiable-point-cloud","title":"TEASER: Fast and Certifiable Point Cloud Registration","date":"2020-01-21","arxiv_id":"2001.07715","n_code_links":7,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["MIT-SPARK/TEASER-plusplus"],"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":["listed","official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"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","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"]}}},{"paper":"/paper/overcoming-long-term-catastrophic-forgetting","slug":"overcoming-long-term-catastrophic-forgetting","title":"Overcoming Long-term Catastrophic Forgetting through Adversarial Neural Pruning and Synaptic Consolidation","date":"2019-12-19","arxiv_id":"1912.09091","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":1,"n_instrument":1,"unverified":3,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["GeoX-Lab/ANPyC"],"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"]}}},{"paper":"/paper/unet-redesigning-skip-connections-to-exploit","slug":"unet-redesigning-skip-connections-to-exploit","title":"UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation","date":"2019-12-11","arxiv_id":"1912.05074","n_code_links":13,"syntology":{"ran":4,"of":9,"n_ran_checked":3,"n_instrument":1,"unverified":5,"pointer_only":3,"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) · 5 unverified","official":{"repos":["MrGiovanni/UNetPlusPlus"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/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","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":0,"n_instrument":4,"unverified":3,"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","official":null}},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/paper/confident-learning-estimating-uncertainty-in","slug":"confident-learning-estimating-uncertainty-in","title":"Confident Learning: Estimating Uncertainty in Dataset Labels","date":"2019-10-31","arxiv_id":"1911.00068","n_code_links":4,"syntology":{"ran":21,"of":29,"n_ran_checked":17,"n_instrument":4,"unverified":8,"pointer_only":3,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","official":{"repos":["cleanlab/cleanlab"],"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":["listed","official"]}}},{"paper":"/paper/lutnet-learning-fpga-configurations-for","slug":"lutnet-learning-fpga-configurations-for","title":"LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference","date":"2019-10-24","arxiv_id":"1910.12625","n_code_links":2,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"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) · 2 unverified","official":{"repos":["awai54st/LUTNet"],"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"]}}},{"paper":"/paper/structured-pruning-of-large-language-models","slug":"structured-pruning-of-large-language-models","title":"Structured Pruning of Large Language Models","date":"2019-10-10","arxiv_id":"1910.04732","n_code_links":2,"syntology":{"ran":8,"of":12,"n_ran_checked":6,"n_instrument":2,"unverified":4,"pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["asappresearch/flop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/global-sparse-momentum-sgd-for-pruning-very","slug":"global-sparse-momentum-sgd-for-pruning-very","title":"Global Sparse Momentum SGD for Pruning Very Deep Neural Networks","date":"2019-09-27","arxiv_id":"1909.12778","n_code_links":4,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["DingXiaoH/GSM-SGD"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/model-pruning-enables-efficient-federated","slug":"model-pruning-enables-efficient-federated","title":"Model Pruning Enables Efficient Federated Learning on Edge Devices","date":"2019-09-26","arxiv_id":"1909.12326","n_code_links":2,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"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) · 3 unverified","official":{"repos":["jiangyuang/PruneFL"],"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"]}}},{"paper":"/paper/gate-decorator-global-filter-pruning-method","slug":"gate-decorator-global-filter-pruning-method","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","date":"2019-09-18","arxiv_id":"1909.08174","n_code_links":2,"syntology":{"ran":17,"of":18,"n_ran_checked":17,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["youzhonghui/gate-decorator-pruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/once-for-all-train-one-network-and-specialize","slug":"once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","arxiv_id":"1908.09791","n_code_links":10,"syntology":{"ran":24,"of":34,"n_ran_checked":22,"n_instrument":2,"unverified":10,"pointer_only":8,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 1 honoured, 1 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","official":{"repos":["mit-han-lab/once-for-all"],"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"]}}},{"paper":"/paper/protecting-neural-networks-with-hierarchical","slug":"protecting-neural-networks-with-hierarchical","title":"Protecting Neural Networks with Hierarchical Random Switching: Towards Better Robustness-Accuracy Trade-off for Stochastic Defenses","date":"2019-08-20","arxiv_id":"1908.07116","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["KieranXWang/HRS"],"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"]}}},{"paper":"/paper/optuna-a-next-generation-hyperparameter","slug":"optuna-a-next-generation-hyperparameter","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","date":"2019-07-25","arxiv_id":"1907.10902","n_code_links":11,"syntology":{"ran":14,"of":20,"n_ran_checked":14,"n_instrument":0,"unverified":6,"pointer_only":0,"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) · 6 unverified","official":{"repos":["pfnet/optuna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":10,"of":13,"n_ran_checked":10,"n_instrument":0,"unverified":3,"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","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"]}}},{"paper":"/paper/adversarial-examples-for-non-parametric","slug":"adversarial-examples-for-non-parametric","title":"Robustness for Non-Parametric Classification: A Generic Attack and Defense","date":"2019-06-07","arxiv_id":"1906.03310","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":4,"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) · 3 unverified","official":{"repos":["yangarbiter/adversarial-nonparametrics"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/uncertainty-guided-continual-learning-with","slug":"uncertainty-guided-continual-learning-with","title":"Uncertainty-guided Continual Learning with Bayesian Neural Networks","date":"2019-06-06","arxiv_id":"1906.02425","n_code_links":2,"syntology":{"ran":3,"of":11,"n_ran_checked":2,"n_instrument":1,"unverified":8,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["SaynaEbrahimi/UCB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/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","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","official":null}},{"paper":"/paper/sparse-transfer-learning-via-winning-lottery","slug":"sparse-transfer-learning-via-winning-lottery","title":"Sparse Transfer Learning via Winning Lottery Tickets","date":"2019-05-19","arxiv_id":"1905.07785","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["rahulsmehta/sparsity-experiments"],"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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"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","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"]}}},{"paper":"/paper/legr-filter-pruning-via-learned-global","slug":"legr-filter-pruning-via-learned-global","title":"Towards Efficient Model Compression via Learned Global Ranking","date":"2019-04-28","arxiv_id":"1904.12368","n_code_links":1,"syntology":{"ran":10,"of":13,"n_ran_checked":7,"n_instrument":3,"unverified":3,"pointer_only":1,"phrase":"10 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; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["cmu-enyac/LeGR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/evolving-and-understanding-sparse-deep-neural","slug":"evolving-and-understanding-sparse-deep-neural","title":"A Brain-inspired Algorithm for Training Highly Sparse Neural Networks","date":"2019-03-17","arxiv_id":"1903.07138","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"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","official":{"repos":["joostPieterse/CosineSET","zahraatashgahi/ctre"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":7,"n_instrument":0,"unverified":4,"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","official":null}},{"paper":"/paper/prunetrain-gradual-structured-pruning-from","slug":"prunetrain-gradual-structured-pruning-from","title":"PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfiguration","date":"2019-01-26","arxiv_id":"1901.09290","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"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","official":null}},{"paper":"/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","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":3,"n_instrument":2,"unverified":2,"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","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"]}}},{"paper":"/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","n_code_links":8,"syntology":{"ran":5,"of":12,"n_ran_checked":1,"n_instrument":4,"unverified":7,"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","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"]}}},{"paper":"/paper/minimal-random-code-learning-getting-bits","slug":"minimal-random-code-learning-getting-bits","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","date":"2018-09-30","arxiv_id":"1810.00440","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["cambridge-mlg/miracle"],"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"]}}},{"paper":"/paper/solving-imperfect-information-games-via","slug":"solving-imperfect-information-games-via","title":"Solving Imperfect-Information Games via Discounted Regret Minimization","date":"2018-09-11","arxiv_id":"1809.04040","n_code_links":5,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":null}},{"paper":"/paper/a-game-based-approximate-verification-of-deep","slug":"a-game-based-approximate-verification-of-deep","title":"A Game-Based Approximate Verification of Deep Neural Networks with Provable Guarantees","date":"2018-07-10","arxiv_id":"1807.03571","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["TrustAI/DeepGame"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/channel-gating-neural-networks","slug":"channel-gating-neural-networks","title":"Channel Gating Neural Networks","date":"2018-05-29","arxiv_id":"1805.12549","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":0,"n_instrument":2,"unverified":2,"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","official":null}},{"paper":"/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","n_code_links":4,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","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"]}}},{"paper":"/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","n_code_links":24,"syntology":{"ran":12,"of":25,"n_ran_checked":10,"n_instrument":2,"unverified":13,"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","official":null}},{"paper":"/paper/compressing-neural-networks-using-the-1","slug":"compressing-neural-networks-using-the-1","title":"Compressing Neural Networks using the Variational Information Bottleneck","date":"2018-02-28","arxiv_id":"1802.10399","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"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","official":null}},{"paper":"/paper/efficient-neural-audio-synthesis","slug":"efficient-neural-audio-synthesis","title":"Efficient Neural Audio Synthesis","date":"2018-02-23","arxiv_id":"1802.08435","n_code_links":16,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":1,"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","official":null}},{"paper":"/paper/faster-gaze-prediction-with-dense-networks","slug":"faster-gaze-prediction-with-dense-networks","title":"Faster gaze prediction with dense networks and Fisher pruning","date":"2018-01-17","arxiv_id":"1801.05787","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","official":null}},{"paper":"/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","n_code_links":4,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/paper/to-prune-or-not-to-prune-exploring-the","slug":"to-prune-or-not-to-prune-exploring-the","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","date":"2017-10-05","arxiv_id":"1710.01878","n_code_links":4,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/end-to-end-neural-coreference-resolution","slug":"end-to-end-neural-coreference-resolution","title":"End-to-end Neural Coreference Resolution","date":"2017-07-21","arxiv_id":"1707.07045","n_code_links":4,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"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","official":{"repos":["kentonl/e2e-coref"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/learning-to-prune-deep-neural-networks-via","slug":"learning-to-prune-deep-neural-networks-via","title":"Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeon","date":"2017-05-22","arxiv_id":"1705.07565","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["csyhhu/L-OBS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/learning-with-confident-examples-rank-pruning","slug":"learning-with-confident-examples-rank-pruning","title":"Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labels","date":"2017-05-04","arxiv_id":"1705.01936","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"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) · 1 unverified","official":{"repos":["cgnorthcutt/rankpruning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/exploring-sparsity-in-recurrent-neural","slug":"exploring-sparsity-in-recurrent-neural","title":"Exploring Sparsity in Recurrent Neural Networks","date":"2017-04-17","arxiv_id":"1704.05119","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/pruning-convolutional-neural-networks-for","slug":"pruning-convolutional-neural-networks-for","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","date":"2016-11-19","arxiv_id":"1611.06440","n_code_links":8,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":null}},{"paper":"/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","n_code_links":21,"syntology":{"ran":23,"of":36,"n_ran_checked":9,"n_instrument":14,"unverified":13,"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","official":null}}],"record_sha256":"c5aeaa71ee8e306277189a009e83bb125429766ab493fd2720e32013786c97d2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}