{"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/4","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":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"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/3","next":"/method/pruning/papers/ran/5","papers":[{"paper":"/paper/disparse-disentangled-sparsification-for-1","slug":"disparse-disentangled-sparsification-for-1","title":"DiSparse: Disentangled Sparsification for Multitask Model Compression","date":"2022-06-09","arxiv_id":"2206.04662","n_code_links":1,"syntology":{"ran":2,"of":6,"n_ran_checked":0,"n_instrument":2,"unverified":4,"pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["shi-labs/disparse-multitask-model-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/depthshrinker-a-new-compression-paradigm","slug":"depthshrinker-a-new-compression-paradigm","title":"DepthShrinker: A New Compression Paradigm Towards Boosting Real-Hardware Efficiency of Compact Neural Networks","date":"2022-06-02","arxiv_id":"2206.00843","n_code_links":2,"syntology":{"ran":13,"of":15,"n_ran_checked":9,"n_instrument":4,"unverified":2,"pointer_only":15,"phrase":"13 ran (of which 3 constructed an object rather than computing a result; 9 with no instrument failure: 5 honoured, 1 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["facebookresearch/depthshrinker","rice-eic/depthshrinker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":3,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/lottery-tickets-on-a-data-diet-finding","slug":"lottery-tickets-on-a-data-diet-finding","title":"Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks","date":"2022-06-02","arxiv_id":"2206.01278","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 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","official":{"repos":["mansheej/lth_diet"],"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/sparse-bert-sparse-models-are-robust","slug":"sparse-bert-sparse-models-are-robust","title":"Sparse*BERT: Sparse Models Generalize To New tasks and Domains","date":"2022-05-25","arxiv_id":"2205.12452","n_code_links":0,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":null}},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":1,"n_instrument":3,"unverified":1,"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","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"]}}},{"paper":"/paper/recovering-private-text-in-federated-learning","slug":"recovering-private-text-in-federated-learning","title":"Recovering Private Text in Federated Learning of Language Models","date":"2022-05-17","arxiv_id":"2205.08514","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":1,"n_instrument":4,"unverified":3,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","official":{"repos":["princeton-sysml/film"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/self-focusing-virtual-screening-with-active","slug":"self-focusing-virtual-screening-with-active","title":"Self-focusing virtual screening with active design space pruning","date":"2022-05-03","arxiv_id":"2205.01753","n_code_links":2,"syntology":{"ran":12,"of":12,"n_ran_checked":7,"n_instrument":5,"unverified":0,"pointer_only":0,"phrase":"12 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; 5 where Syntology's instrument failed) · 0 unverified","official":{"repos":["coleygroup/dsp","coleygroup/molpal"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/attentive-fine-grained-structured-sparsity","slug":"attentive-fine-grained-structured-sparsity","title":"Attentive Fine-Grained Structured Sparsity for Image Restoration","date":"2022-04-26","arxiv_id":"2204.12266","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 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["junghunoh/sls_cvpr2022"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-cluster-based-k-nearest-neighbor","slug":"efficient-cluster-based-k-nearest-neighbor","title":"Efficient Cluster-Based k-Nearest-Neighbor Machine Translation","date":"2022-04-13","arxiv_id":"2204.06175","n_code_links":2,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":{"repos":["tjunlp-lab/pckmt"],"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/masking-adversarial-damage-finding","slug":"masking-adversarial-damage-finding","title":"Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Network","date":"2022-04-06","arxiv_id":"2204.02738","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ByungKwanLee/Masking-Adversarial-Damage"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/structured-pruning-learns-compact-and-1","slug":"structured-pruning-learns-compact-and-1","title":"Structured Pruning Learns Compact and Accurate Models","date":"2022-04-01","arxiv_id":"2204.00408","n_code_links":2,"syntology":{"ran":9,"of":12,"n_ran_checked":7,"n_instrument":2,"unverified":3,"pointer_only":10,"phrase":"9 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["princeton-nlp/cofipruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/pada-pruning-assisted-domain-adaptation-for","slug":"pada-pruning-assisted-domain-adaptation-for","title":"PADA: Pruning Assisted Domain Adaptation for Self-Supervised Speech Representations","date":"2022-03-31","arxiv_id":"2203.16965","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":["speech-lab-iitm/pada"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/lighthubert-lightweight-and-configurable","slug":"lighthubert-lightweight-and-configurable","title":"LightHuBERT: Lightweight and Configurable Speech Representation Learning with Once-for-All Hidden-Unit BERT","date":"2022-03-29","arxiv_id":"2203.15610","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":4,"n_instrument":1,"unverified":3,"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) · 3 unverified","official":{"repos":["mechanicalsea/lighthubert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/chex-channel-exploration-for-cnn-model","slug":"chex-channel-exploration-for-cnn-model","title":"CHEX: CHannel EXploration for CNN Model Compression","date":"2022-03-29","arxiv_id":"2203.15794","n_code_links":1,"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":null}},{"paper":"/paper/a-fast-post-training-pruning-framework-for","slug":"a-fast-post-training-pruning-framework-for","title":"A Fast Post-Training Pruning Framework for Transformers","date":"2022-03-29","arxiv_id":"2204.09656","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 2 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) · 0 unverified","official":{"repos":["WoosukKwon/retraining-free-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":["listed","official"]}}},{"paper":"/paper/unified-visual-transformer-compression-1","slug":"unified-visual-transformer-compression-1","title":"Unified Visual Transformer Compression","date":"2022-03-15","arxiv_id":"2203.08243","n_code_links":1,"syntology":{"ran":9,"of":16,"n_ran_checked":6,"n_instrument":3,"unverified":7,"pointer_only":3,"phrase":"9 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","official":{"repos":["VITA-Group/UVC"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/cp-vit-cascade-vision-transformer-pruning-via","slug":"cp-vit-cascade-vision-transformer-pruning-via","title":"CP-ViT: Cascade Vision Transformer Pruning via Progressive Sparsity Prediction","date":"2022-03-09","arxiv_id":"2203.04570","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/data-efficient-structured-pruning-via","slug":"data-efficient-structured-pruning-via","title":"Data-Efficient Structured Pruning via Submodular Optimization","date":"2022-03-09","arxiv_id":"2203.04940","n_code_links":1,"syntology":{"ran":11,"of":11,"n_ran_checked":11,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":{"repos":["marwash25/subpruning"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/rare-gems-finding-lottery-tickets-at","slug":"rare-gems-finding-lottery-tickets-at","title":"Rare Gems: Finding Lottery Tickets at Initialization","date":"2022-02-24","arxiv_id":"2202.12002","n_code_links":1,"syntology":{"ran":9,"of":15,"n_ran_checked":8,"n_instrument":1,"unverified":6,"pointer_only":0,"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) · 6 unverified","official":{"repos":["ksreenivasan/pruning_is_enough"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/are-all-linear-regions-created-equal","slug":"are-all-linear-regions-created-equal","title":"Are All Linear Regions Created Equal?","date":"2022-02-23","arxiv_id":"2202.11749","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["magamba/linear-regions"],"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/prune-and-tune-ensembles-low-cost-ensemble","slug":"prune-and-tune-ensembles-low-cost-ensemble","title":"Prune and Tune Ensembles: Low-Cost Ensemble Learning With Sparse Independent Subnetworks","date":"2022-02-23","arxiv_id":"2202.11782","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/prospect-pruning-finding-trainable-weights-at-1","slug":"prospect-pruning-finding-trainable-weights-at-1","title":"Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradients","date":"2022-02-16","arxiv_id":"2202.08132","n_code_links":1,"syntology":{"ran":5,"of":12,"n_ran_checked":3,"n_instrument":2,"unverified":7,"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) · 7 unverified","official":{"repos":["mil-ad/prospr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/robust-binary-models-by-pruning-randomly","slug":"robust-binary-models-by-pruning-randomly","title":"Robust Binary Models by Pruning Randomly-initialized Networks","date":"2022-02-03","arxiv_id":"2202.01341","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["IVRL/RobustBinarySubNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/signing-the-supermask-keep-hide-invert-1","slug":"signing-the-supermask-keep-hide-invert-1","title":"Signing the Supermask: Keep, Hide, Invert","date":"2022-01-31","arxiv_id":"2201.13361","n_code_links":1,"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":["kosnil/signed_supermasks"],"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/garnet-reduced-rank-topology-learning-for","slug":"garnet-reduced-rank-topology-learning-for","title":"GARNET: Reduced-Rank Topology Learning for Robust and Scalable Graph Neural Networks","date":"2022-01-30","arxiv_id":"2201.12741","n_code_links":1,"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":["cornell-zhang/garnet"],"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/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","n_code_links":1,"syntology":{"ran":11,"of":12,"n_ran_checked":11,"n_instrument":0,"unverified":1,"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","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"]}}},{"paper":"/paper/quantifying-uncertainty-in-deep-learning","slug":"quantifying-uncertainty-in-deep-learning","title":"Quantifying Uncertainty in Deep Learning Approaches to Radio Galaxy Classification","date":"2022-01-04","arxiv_id":"2201.01203","n_code_links":1,"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":["devinamhn/radiogalaxies-bbb"],"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/spvit-enabling-faster-vision-transformers-via","slug":"spvit-enabling-faster-vision-transformers-via","title":"SPViT: Enabling Faster Vision Transformers via Soft Token Pruning","date":"2021-12-27","arxiv_id":"2112.13890","n_code_links":1,"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":["peiyanflying/spvit"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/training-structured-neural-networks-through-1","slug":"training-structured-neural-networks-through-1","title":"Training Structured Neural Networks Through Manifold Identification and Variance Reduction","date":"2021-12-05","arxiv_id":"2112.02612","n_code_links":2,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"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) · 1 unverified","official":{"repos":["zihsyuan1214/rmda"],"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/pruning-self-attentions-into-convolutional","slug":"pruning-self-attentions-into-convolutional","title":"Pruning Self-attentions into Convolutional Layers in Single Path","date":"2021-11-23","arxiv_id":"2111.11802","n_code_links":3,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["zhuang-group/spvit","zip-group/spvit","ziplab/spvit"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-existence-of-universal-lottery-tickets-1","slug":"on-the-existence-of-universal-lottery-tickets-1","title":"On the Existence of Universal Lottery Tickets","date":"2021-11-22","arxiv_id":"2111.11146","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["relationalml/universallt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/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","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":["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"]}}},{"paper":"/paper/on-the-effectiveness-of-sparsification-for","slug":"on-the-effectiveness-of-sparsification-for","title":"DICE: Leveraging Sparsification for Out-of-Distribution Detection","date":"2021-11-18","arxiv_id":"2111.09805","n_code_links":1,"syntology":{"ran":17,"of":19,"n_ran_checked":10,"n_instrument":7,"unverified":2,"pointer_only":2,"phrase":"17 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; 7 where Syntology's instrument failed) · 2 unverified","official":{"repos":["deeplearning-wisc/dice"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/can-information-flows-suggest-targets-for","slug":"can-information-flows-suggest-targets-for","title":"Can Information Flows Suggest Targets for Interventions in Neural Circuits?","date":"2021-11-09","arxiv_id":"2111.05299","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":["praveenv253/ann-info-flow"],"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/adversarial-neuron-pruning-purifies","slug":"adversarial-neuron-pruning-purifies","title":"Adversarial Neuron Pruning Purifies Backdoored Deep Models","date":"2021-10-27","arxiv_id":"2110.14430","n_code_links":2,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["csdongxian/anp_backdoor"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/chip-channel-independence-based-pruning-for","slug":"chip-channel-independence-based-pruning-for","title":"CHIP: CHannel Independence-based Pruning for Compact Neural Networks","date":"2021-10-26","arxiv_id":"2110.13981","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":5,"phrase":"4 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["eclipsess/chip_neurips2021"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/halp-hardware-aware-latency-pruning-1","slug":"halp-hardware-aware-latency-pruning-1","title":"HALP: Hardware-Aware Latency Pruning","date":"2021-10-20","arxiv_id":"2110.10811","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/graph-less-neural-networks-teaching-old-mlps-1","slug":"graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","arxiv_id":"2110.08727","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["snap-research/graphless-neural-networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-bayesian-network-structure-learning","slug":"efficient-bayesian-network-structure-learning","title":"Efficient Bayesian network structure learning via local Markov boundary search","date":"2021-10-12","arxiv_id":"2110.06082","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":1,"n_instrument":2,"unverified":2,"pointer_only":0,"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) · 2 unverified","official":{"repos":["minggao97/tam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/nvit-vision-transformer-compression-and-1","slug":"nvit-vision-transformer-compression-and-1","title":"Global Vision Transformer Pruning with Hessian-Aware Saliency","date":"2021-10-10","arxiv_id":"2110.04869","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":null}},{"paper":"/paper/end-to-end-supermask-pruning-learning-to","slug":"end-to-end-supermask-pruning-learning-to","title":"End-to-End Supermask Pruning: Learning to Prune Image Captioning Models","date":"2021-10-07","arxiv_id":"2110.03298","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["jiahuei/sparse-image-captioning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/powerpropagation-a-sparsity-inducing-weight","slug":"powerpropagation-a-sparsity-inducing-weight","title":"Powerpropagation: A sparsity inducing weight reparameterisation","date":"2021-10-01","arxiv_id":"2110.00296","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 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":["deepmind/deepmind-research"],"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-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","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"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","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"]}}},{"paper":"/paper/distilling-linguistic-context-for-language","slug":"distilling-linguistic-context-for-language","title":"Distilling Linguistic Context for Language Model Compression","date":"2021-09-17","arxiv_id":"2109.08359","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":7,"n_instrument":1,"unverified":3,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["geondopark/ckd"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/evo-vit-slow-fast-token-evolution-for-dynamic","slug":"evo-vit-slow-fast-token-evolution-for-dynamic","title":"Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer","date":"2021-08-03","arxiv_id":"2108.01390","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":7,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["YifanXu74/Evo-ViT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/quantumnas-noise-adaptive-search-for-robust","slug":"quantumnas-noise-adaptive-search-for-robust","title":"QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits","date":"2021-07-22","arxiv_id":"2107.10845","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":["mit-han-lab/pytorch-quantum","mit-han-lab/torchquantum"],"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/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","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 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":["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"]}}},{"paper":"/paper/deep-learning-on-a-data-diet-finding","slug":"deep-learning-on-a-data-diet-finding","title":"Deep Learning on a Data Diet: Finding Important Examples Early in Training","date":"2021-07-15","arxiv_id":"2107.07075","n_code_links":1,"syntology":{"ran":19,"of":24,"n_ran_checked":19,"n_instrument":0,"unverified":5,"pointer_only":3,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["mansheej/data_diet"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":19,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/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","n_code_links":2,"syntology":{"ran":7,"of":14,"n_ran_checked":4,"n_instrument":3,"unverified":7,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":8,"n_instrument":0,"unverified":4,"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","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"]}}},{"paper":"/paper/learned-token-pruning-for-transformers","slug":"learned-token-pruning-for-transformers","title":"Learned Token Pruning for Transformers","date":"2021-07-02","arxiv_id":"2107.00910","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":9,"n_instrument":1,"unverified":2,"pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["kssteven418/ltp"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/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","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 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":["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"]}}},{"paper":"/paper/simon-says-evaluating-and-mitigating-bias-in","slug":"simon-says-evaluating-and-mitigating-bias-in","title":"Simon Says: Evaluating and Mitigating Bias in Pruned Neural Networks with Knowledge Distillation","date":"2021-06-15","arxiv_id":"2106.07849","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":2,"n_instrument":2,"unverified":3,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["codestar12/pruning-distilation-bias"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/chasing-sparsity-in-vision-transformers-an","slug":"chasing-sparsity-in-vision-transformers-an","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","date":"2021-06-08","arxiv_id":"2106.04533","n_code_links":1,"syntology":{"ran":2,"of":7,"n_ran_checked":1,"n_instrument":1,"unverified":5,"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) · 5 unverified","official":{"repos":["VITA-Group/SViTE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/efficient-lottery-ticket-finding-less-data-is","slug":"efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","arxiv_id":"2106.03225","n_code_links":1,"syntology":{"ran":7,"of":14,"n_ran_checked":3,"n_instrument":4,"unverified":7,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","official":{"repos":["VITA-Group/PrAC-LTH"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamicvit-efficient-vision-transformers-with","slug":"dynamicvit-efficient-vision-transformers-with","title":"DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification","date":"2021-06-03","arxiv_id":"2106.02034","n_code_links":2,"syntology":{"ran":7,"of":9,"n_ran_checked":4,"n_instrument":3,"unverified":2,"pointer_only":1,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["raoyongming/DynamicViT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":"/paper/lgesql-line-graph-enhanced-text-to-sql-model","slug":"lgesql-line-graph-enhanced-text-to-sql-model","title":"LGESQL: Line Graph Enhanced Text-to-SQL Model with Mixed Local and Non-Local Relations","date":"2021-06-02","arxiv_id":"2106.01093","n_code_links":1,"syntology":{"ran":10,"of":11,"n_ran_checked":10,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 3 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["rhythmcao/text2sql-lgesql"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/dot-an-efficient-double-transformer-for-nlp","slug":"dot-an-efficient-double-transformer-for-nlp","title":"DoT: An efficient Double Transformer for NLP tasks with tables","date":"2021-06-01","arxiv_id":"2106.00479","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":1,"n_instrument":4,"unverified":4,"pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 4 unverified","official":{"repos":["google-research/tapas"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/gans-can-play-lottery-tickets-too-1","slug":"gans-can-play-lottery-tickets-too-1","title":"GANs Can Play Lottery Tickets Too","date":"2021-05-31","arxiv_id":"2106.00134","n_code_links":1,"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":["VITA-Group/GAN-LTH"],"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/mlpruning-a-multilevel-structured-pruning","slug":"mlpruning-a-multilevel-structured-pruning","title":"LEAP: Learnable Pruning for Transformer-based Models","date":"2021-05-30","arxiv_id":"2105.14636","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yaozhewei/mlpruning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-of-deep-spiking-neural-networks","slug":"pruning-of-deep-spiking-neural-networks","title":"Pruning of Deep Spiking Neural Networks through Gradient Rewiring","date":"2021-05-11","arxiv_id":"2105.04916","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":["Yanqi-Chen/Gradient-Rewiring"],"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/accelerating-large-scale-real-time-gnn","slug":"accelerating-large-scale-real-time-gnn","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","date":"2021-05-10","arxiv_id":"2105.04528","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":{"repos":["tedzhouhk/GCNP"],"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"]}}},{"paper":"/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","n_code_links":1,"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: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","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"]}}},{"paper":"/paper/physics-informed-spline-learning-for","slug":"physics-informed-spline-learning-for","title":"Physics-informed Spline Learning for Nonlinear Dynamics Discovery","date":"2021-05-05","arxiv_id":"2105.02368","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":["isds-neu/PiSL"],"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/initialization-and-regularization-of-1","slug":"initialization-and-regularization-of-1","title":"Initialization and Regularization of Factorized Neural Layers","date":"2021-05-03","arxiv_id":"2105.01029","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 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["microsoft/fnl_paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/stealthy-backdoors-as-compression-artifacts","slug":"stealthy-backdoors-as-compression-artifacts","title":"Stealthy Backdoors as Compression Artifacts","date":"2021-04-30","arxiv_id":"2104.15129","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["yulongtzzz/Stealthy-Backdoors-as-Compression-Artifacts"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/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","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":["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"]}}},{"paper":"/paper/visual-transformer-pruning","slug":"visual-transformer-pruning","title":"Vision Transformer Pruning","date":"2021-04-17","arxiv_id":"2104.08500","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"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) · 1 unverified","official":null}},{"paper":"/paper/content-aware-gan-compression","slug":"content-aware-gan-compression","title":"Content-Aware GAN Compression","date":"2021-04-06","arxiv_id":"2104.02244","n_code_links":1,"syntology":{"ran":9,"of":16,"n_ran_checked":6,"n_instrument":3,"unverified":7,"pointer_only":0,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","official":{"repos":["lychenyoko/content-aware-gan-compression"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/der-dynamically-expandable-representation-for","slug":"der-dynamically-expandable-representation-for","title":"DER: Dynamically Expandable Representation for Class Incremental Learning","date":"2021-03-31","arxiv_id":"2103.16788","n_code_links":2,"syntology":{"ran":6,"of":11,"n_ran_checked":2,"n_instrument":4,"unverified":5,"pointer_only":0,"phrase":"6 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; 4 where Syntology's instrument failed) · 5 unverified","official":{"repos":["Rhyssiyan/DER-ClassIL.pytorch"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-response-interpretation-through-the","slug":"neural-response-interpretation-through-the","title":"Neural Response Interpretation through the Lens of Critical Pathways","date":"2021-03-31","arxiv_id":"2103.16886","n_code_links":2,"syntology":{"ran":1,"of":8,"n_ran_checked":0,"n_instrument":1,"unverified":7,"pointer_only":7,"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) · 7 unverified","official":{"repos":["CAMP-eXplain-AI/PathwayGrad","CAMP-eXplain-AI/RoarTorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/the-elastic-lottery-ticket-hypothesis","slug":"the-elastic-lottery-ticket-hypothesis","title":"The Elastic Lottery Ticket Hypothesis","date":"2021-03-30","arxiv_id":"2103.16547","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["VITA-Group/ElasticLTH"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/panoptic-polarnet-proposal-free-lidar-point","slug":"panoptic-polarnet-proposal-free-lidar-point","title":"Panoptic-PolarNet: Proposal-free LiDAR Point Cloud Panoptic Segmentation","date":"2021-03-27","arxiv_id":"2103.14962","n_code_links":2,"syntology":{"ran":11,"of":11,"n_ran_checked":9,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["edwardzhou130/Panoptic-PolarNet"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/dynamic-slimmable-network","slug":"dynamic-slimmable-network","title":"Dynamic Slimmable Network","date":"2021-03-24","arxiv_id":"2103.13258","n_code_links":1,"syntology":{"ran":7,"of":17,"n_ran_checked":5,"n_instrument":2,"unverified":10,"pointer_only":17,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","official":{"repos":["changlin31/DS-Net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"paper":"/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","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":["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"]}}},{"paper":"/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","n_code_links":7,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/pointdsc-robust-point-cloud-registration","slug":"pointdsc-robust-point-cloud-registration","title":"PointDSC: Robust Point Cloud Registration using Deep Spatial Consistency","date":"2021-03-09","arxiv_id":"2103.05465","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"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) · 1 unverified","official":{"repos":["XuyangBai/PointDSC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-the-index-contents-for-memory","slug":"pruning-the-index-contents-for-memory","title":"Pruning the Index Contents for Memory Efficient Open-Domain QA","date":"2021-02-21","arxiv_id":"2102.10697","n_code_links":2,"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, 2 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["KNOT-FIT-BUT/R2-D2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/chipnet-budget-aware-pruning-with-heaviside-1","slug":"chipnet-budget-aware-pruning-with-heaviside-1","title":"ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations","date":"2021-02-14","arxiv_id":"2102.07156","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"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) · 0 unverified","official":{"repos":["transmuteAI/ChipNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/dense-for-the-price-of-sparse-improved","slug":"dense-for-the-price-of-sparse-improved","title":"Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset","date":"2021-02-12","arxiv_id":"2102.07655","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":["IlanPrice/DCTpS"],"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/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","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"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","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"]}}},{"paper":"/paper/learnable-embedding-sizes-for-recommender-1","slug":"learnable-embedding-sizes-for-recommender-1","title":"Learnable Embedding Sizes for Recommender Systems","date":"2021-01-19","arxiv_id":"2101.07577","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, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ssui-liu/learnable-embed-sizes-for-RecSys"],"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/consensus-guided-correspondence-denoising","slug":"consensus-guided-correspondence-denoising","title":"Progressive Correspondence Pruning by Consensus Learning","date":"2021-01-03","arxiv_id":"2101.00591","n_code_links":2,"syntology":{"ran":6,"of":11,"n_ran_checked":3,"n_instrument":3,"unverified":5,"pointer_only":5,"phrase":"6 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; 3 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/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","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"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","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"]}}},{"paper":"/paper/parameter-efficient-transfer-learning-with-1","slug":"parameter-efficient-transfer-learning-with-1","title":"Parameter-Efficient Transfer Learning with Diff Pruning","date":"2020-12-14","arxiv_id":"2012.07463","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["dguo98/DiffPruning"],"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","unlocated"]}}},{"paper":"/paper/a-score-and-search-approach-to-learning","slug":"a-score-and-search-approach-to-learning","title":"A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations","date":"2020-11-03","arxiv_id":"2011.01444","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["CharupriyaSharma/eBNSLNoisyOR"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-tunable-robust-pruning-framework-through","slug":"a-tunable-robust-pruning-framework-through","title":"A Tunable Robust Pruning Framework Through Dynamic Network Rewiring of DNNs","date":"2020-11-03","arxiv_id":"2011.03083","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"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","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"]}}},{"paper":"/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","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, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","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"]}}},{"paper":"/paper/text-based-rl-agents-with-commonsense","slug":"text-based-rl-agents-with-commonsense","title":"Text-based RL Agents with Commonsense Knowledge: New Challenges, Environments and Baselines","date":"2020-10-08","arxiv_id":"2010.03790","n_code_links":2,"syntology":{"ran":11,"of":13,"n_ran_checked":11,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":{"repos":["IBM/commonsense-rl"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":0,"n_instrument":2,"unverified":3,"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","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"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":3,"n_instrument":1,"unverified":3,"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","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"]}}},{"paper":"/paper/gan-slimming-all-in-one-gan-compression-by-a","slug":"gan-slimming-all-in-one-gan-compression-by-a","title":"GAN Slimming: All-in-One GAN Compression by A Unified Optimization Framework","date":"2020-08-25","arxiv_id":"2008.11062","n_code_links":2,"syntology":{"ran":10,"of":13,"n_ran_checked":6,"n_instrument":4,"unverified":3,"pointer_only":4,"phrase":"10 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; 4 where Syntology's instrument failed) · 3 unverified","official":{"repos":["TAMU-VITA/GAN-Slimming"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/neural-architecture-search-with-gbdt","slug":"neural-architecture-search-with-gbdt","title":"Accuracy Prediction with Non-neural Model for Neural Architecture Search","date":"2020-07-09","arxiv_id":"2007.04785","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":1,"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":{"repos":["renqianluo/GBDT-NAS"],"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"]}}},{"paper":"/paper/riccinets-curvature-guided-pruning-of-high","slug":"riccinets-curvature-guided-pruning-of-high","title":"RicciNets: Curvature-guided Pruning of High-performance Neural Networks Using Ricci Flow","date":"2020-07-08","arxiv_id":"2007.04216","n_code_links":0,"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: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/discretization-aware-architecture-search","slug":"discretization-aware-architecture-search","title":"Discretization-Aware Architecture Search","date":"2020-07-07","arxiv_id":"2007.03154","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":2,"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) · 3 unverified","official":{"repos":["sunsmarterjie/DAAS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/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","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"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","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"]}}},{"paper":"/paper/fracbits-mixed-precision-quantization-via","slug":"fracbits-mixed-precision-quantization-via","title":"FracBits: Mixed Precision Quantization via Fractional Bit-Widths","date":"2020-07-04","arxiv_id":"2007.02017","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":null}},{"paper":"/paper/generative-sparse-detection-networks-for-3d","slug":"generative-sparse-detection-networks-for-3d","title":"Generative Sparse Detection Networks for 3D Single-shot Object Detection","date":"2020-06-22","arxiv_id":"2006.12356","n_code_links":4,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jgwak/GSDN"],"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/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","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":3,"n_instrument":1,"unverified":4,"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","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"]}}}],"record_sha256":"eb2611eebbceb7ccc0d6527d000747b244fbc337b73e517db66a26f53295698c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}