{"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/24","list_of":"/method/pruning","method":"Pruning","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":24,"pages_in_order":39,"rows_per_page":100,"rows":[2301,2400],"of":3874,"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","prev":"/method/pruning/papers/23","next":"/method/pruning/papers/25","papers":[{"paper":"/paper/supporting-schema-references-in-keyword","slug":"supporting-schema-references-in-keyword","title":"Supporting Schema References in Keyword Queries over Relational Databases","date":"2022-03-11","arxiv_id":"2203.05921","n_code_links":1,"syntology":null},{"paper":"/paper/model-architecture-co-design-for-high","slug":"model-architecture-co-design-for-high","title":"Model-Architecture Co-Design for High Performance Temporal GNN Inference on FPGA","date":"2022-03-10","arxiv_id":"2203.05095","n_code_links":1,"syntology":null},{"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":null,"slug":"language-adaptive-cross-lingual-speech","title":"Language Adaptive Cross-lingual Speech Representation Learning with Sparse Sharing Sub-networks","date":"2022-03-09","arxiv_id":"2203.04583","n_code_links":0,"syntology":null},{"paper":null,"slug":"prince-a-pruned-amp-integrated-deep-cnn","title":"PRINCE: A Pruned AMP Integrated Deep CNN Method for Efficient Channel Estimation of Millimeter-wave and Terahertz Ultra-Massive MIMO Systems","date":"2022-03-09","arxiv_id":"2203.04635","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-graph-convolutional-networks-to","title":"Pruning Graph Convolutional Networks to select meaningful graph frequencies for fMRI decoding","date":"2022-03-09","arxiv_id":"2203.04455","n_code_links":0,"syntology":null},{"paper":"/paper/the-combinatorial-brain-surgeon-pruning","slug":"the-combinatorial-brain-surgeon-pruning","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","date":"2022-03-09","arxiv_id":"2203.04466","n_code_links":1,"syntology":null},{"paper":"/paper/dual-lottery-ticket-hypothesis-1","slug":"dual-lottery-ticket-hypothesis-1","title":"Dual Lottery Ticket Hypothesis","date":"2022-03-08","arxiv_id":"2203.04248","n_code_links":1,"syntology":null},{"paper":null,"slug":"uenas-a-unified-evolution-based-nas-framework","title":"Multi-trial Neural Architecture Search with Lottery Tickets","date":"2022-03-08","arxiv_id":"2203.04300","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-convnets-on-tiny-devices-via-nested","title":"Dynamic ConvNets on Tiny Devices via Nested Sparsity","date":"2022-03-07","arxiv_id":"2203.03324","n_code_links":0,"syntology":null},{"paper":"/paper/s-rocket-selective-random-convolution-kernels","slug":"s-rocket-selective-random-convolution-kernels","title":"S-Rocket: Selective Random Convolution Kernels for Time Series Classification","date":"2022-03-07","arxiv_id":"2203.03445","n_code_links":1,"syntology":null},{"paper":null,"slug":"don-t-be-so-dense-sparse-to-sparse-gan","title":"Don't Be So Dense: Sparse-to-Sparse GAN Training Without Sacrificing Performance","date":"2022-03-05","arxiv_id":"2203.02770","n_code_links":0,"syntology":null},{"paper":"/paper/ensemble-knowledge-guided-sub-network-search","slug":"ensemble-knowledge-guided-sub-network-search","title":"Ensemble Knowledge Guided Sub-network Search and Fine-tuning for Filter Pruning","date":"2022-03-05","arxiv_id":"2203.02651","n_code_links":1,"syntology":null},{"paper":null,"slug":"fairprune-achieving-fairness-through-pruning","title":"FairPrune: Achieving Fairness Through Pruning for Dermatological Disease Diagnosis","date":"2022-03-04","arxiv_id":"2203.02110","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-pruning-is-all-you-need-for","title":"Structured Pruning is All You Need for Pruning CNNs at Initialization","date":"2022-03-04","arxiv_id":"2203.02549","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-tailed-vision-transformer-for-efficient","title":"Multi-Tailed Vision Transformer for Efficient Inference","date":"2022-03-03","arxiv_id":"2203.01587","n_code_links":0,"syntology":null},{"paper":"/paper/fast-r2d2-a-pretrained-recursive-neural","slug":"fast-r2d2-a-pretrained-recursive-neural","title":"Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representation","date":"2022-03-01","arxiv_id":"2203.00281","n_code_links":2,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["alipay/StructuredLM_RTDT"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"paper":null,"slug":"dynamic-n-m-fine-grained-structured-sparse","title":"Dynamic N:M Fine-grained Structured Sparse Attention Mechanism","date":"2022-02-28","arxiv_id":"2203.00091","n_code_links":0,"syntology":null},{"paper":"/paper/on-chip-qnn-towards-efficient-on-chip","slug":"on-chip-qnn-towards-efficient-on-chip","title":"QOC: Quantum On-Chip Training with Parameter Shift and Gradient Pruning","date":"2022-02-26","arxiv_id":"2202.13239","n_code_links":1,"syntology":null},{"paper":null,"slug":"symmetric-convolutional-filters-a-novel-way","title":"Symmetric Convolutional Filters: A Novel Way to Constrain Parameters in CNN","date":"2022-02-26","arxiv_id":"2202.13099","n_code_links":0,"syntology":null},{"paper":null,"slug":"taspm-targeted-sequential-pattern-mining","title":"TaSPM: Targeted Sequential Pattern Mining","date":"2022-02-26","arxiv_id":"2202.13202","n_code_links":0,"syntology":null},{"paper":"/paper/extracting-effective-subnetworks-with-gumebel","slug":"extracting-effective-subnetworks-with-gumebel","title":"Extracting Effective Subnetworks with Gumbel-Softmax","date":"2022-02-25","arxiv_id":"2202.12986","n_code_links":1,"syntology":null},{"paper":null,"slug":"optimal-channel-selection-with-discrete-qcqp","title":"Optimal channel selection with discrete QCQP","date":"2022-02-24","arxiv_id":"2202.12417","n_code_links":0,"syntology":null},{"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":null,"slug":"standard-deviation-based-quantization-for","title":"Standard Deviation-Based Quantization for Deep Neural Networks","date":"2022-02-24","arxiv_id":"2202.12422","n_code_links":0,"syntology":null},{"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":null,"slug":"reconstruction-task-finds-universal-winning","title":"Reconstruction Task Finds Universal Winning Tickets","date":"2022-02-23","arxiv_id":"2202.11484","n_code_links":0,"syntology":null},{"paper":"/paper/distilled-neural-networks-for-efficient","slug":"distilled-neural-networks-for-efficient","title":"Distilled Neural Networks for Efficient Learning to Rank","date":"2022-02-22","arxiv_id":"2202.10728","n_code_links":1,"syntology":null},{"paper":"/paper/hrel-filter-pruning-based-on-high-relevance","slug":"hrel-filter-pruning-based-on-high-relevance","title":"HRel: Filter Pruning based on High Relevance between Activation Maps and Class Labels","date":"2022-02-22","arxiv_id":"2202.10716","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-novel-architecture-slimming-method-for","title":"A Novel Architecture Slimming Method for Network Pruning and Knowledge Distillation","date":"2022-02-21","arxiv_id":"2202.10461","n_code_links":0,"syntology":null},{"paper":null,"slug":"amenable-sparse-network-investigator","title":"Amenable Sparse Network Investigator","date":"2022-02-18","arxiv_id":"2202.09284","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-study-of-designing-compact-audio-visual","title":"A Study of Designing Compact Audio-Visual Wake Word Spotting System Based on Iterative Fine-Tuning in Neural Network Pruning","date":"2022-02-17","arxiv_id":"2202.08509","n_code_links":0,"syntology":null},{"paper":"/paper/practical-network-acceleration-with-tiny-sets","slug":"practical-network-acceleration-with-tiny-sets","title":"Practical Network Acceleration with Tiny Sets","date":"2022-02-16","arxiv_id":"2202.07861","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":{"repos":["doctorkey/practise"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"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":null,"slug":"convolutional-network-fabric-pruning-with","title":"Convolutional Network Fabric Pruning With Label Noise","date":"2022-02-15","arxiv_id":"2202.07268","n_code_links":0,"syntology":null},{"paper":"/paper/prior-gradient-mask-guided-pruning-aware-fine","slug":"prior-gradient-mask-guided-pruning-aware-fine","title":"Prior Gradient Mask Guided Pruning-Aware Fine-Tuning","date":"2022-02-15","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/pruning-networks-with-cross-layer-ranking-k","slug":"pruning-networks-with-cross-layer-ranking-k","title":"Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filters","date":"2022-02-15","arxiv_id":"2202.07190","n_code_links":1,"syntology":null},{"paper":null,"slug":"finding-dynamics-preserving-adversarial","title":"Finding Dynamics Preserving Adversarial Winning Tickets","date":"2022-02-14","arxiv_id":"2202.06488","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-based-neural-network-and-its","title":"Model-Based Neural Network and Its Application to Line Spectral Estimation","date":"2022-02-14","arxiv_id":"2202.06485","n_code_links":0,"syntology":null},{"paper":null,"slug":"tattooed-a-robust-deep-neural-network","title":"TATTOOED: A Robust Deep Neural Network Watermarking Scheme based on Spread-Spectrum Channel Coding","date":"2022-02-12","arxiv_id":"2202.06091","n_code_links":0,"syntology":null},{"paper":"/paper/choices-risks-and-reward-reports-charting","slug":"choices-risks-and-reward-reports-charting","title":"Choices, Risks, and Reward Reports: Charting Public Policy for Reinforcement Learning Systems","date":"2022-02-11","arxiv_id":"2202.05716","n_code_links":1,"syntology":null},{"paper":null,"slug":"deadwooding-robust-global-pruning-for-deep","title":"Deadwooding: Robust Global Pruning for Deep Neural Networks","date":"2022-02-10","arxiv_id":"2202.05226","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-in-the-wild-scalable","title":"Reinforcement Learning in the Wild: Scalable RL Dispatching Algorithm Deployed in Ridehailing Marketplace","date":"2022-02-10","arxiv_id":"2202.05118","n_code_links":0,"syntology":null},{"paper":"/paper/coarsening-the-granularity-towards","slug":"coarsening-the-granularity-towards","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","date":"2022-02-09","arxiv_id":"2202.04736","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"0 ran · 3 unverified","official":{"repos":["vita-group/structure-lth"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":"/paper/evoprunedeeptl-an-evolutionary-pruning-model","slug":"evoprunedeeptl-an-evolutionary-pruning-model","title":"EvoPruneDeepTL: An Evolutionary Pruning Model for Transfer Learning based Deep Neural Networks","date":"2022-02-08","arxiv_id":"2202.03844","n_code_links":1,"syntology":null},{"paper":null,"slug":"impact-of-parameter-sparsity-on-stochastic","title":"Impact of Parameter Sparsity on Stochastic Gradient MCMC Methods for Bayesian Deep Learning","date":"2022-02-08","arxiv_id":"2202.03770","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-the-sample-complexity-of-deep","title":"Improving the Sample-Complexity of Deep Classification Networks with Invariant Integration","date":"2022-02-08","arxiv_id":"2202.03967","n_code_links":0,"syntology":null},{"paper":"/paper/membership-inference-attacks-and-defenses-in-1","slug":"membership-inference-attacks-and-defenses-in-1","title":"Membership Inference Attacks and Defenses in Neural Network Pruning","date":"2022-02-07","arxiv_id":"2202.03335","n_code_links":1,"syntology":null},{"paper":"/paper/beas-blockchain-enabled-asynchronous-secure","slug":"beas-blockchain-enabled-asynchronous-secure","title":"BEAS: Blockchain Enabled Asynchronous & Secure Federated Machine Learning","date":"2022-02-06","arxiv_id":"2202.02817","n_code_links":1,"syntology":null},{"paper":"/paper/the-unreasonable-effectiveness-of-random-1","slug":"the-unreasonable-effectiveness-of-random-1","title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","date":"2022-02-05","arxiv_id":"2202.02643","n_code_links":1,"syntology":null},{"paper":null,"slug":"prunix-non-ideality-aware-convolutional","title":"PRUNIX: Non-Ideality Aware Convolutional Neural Network Pruning for Memristive Accelerators","date":"2022-02-03","arxiv_id":"2202.01758","n_code_links":0,"syntology":null},{"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":null,"slug":"cyclical-pruning-for-sparse-neural-networks","title":"Cyclical Pruning for Sparse Neural Networks","date":"2022-02-02","arxiv_id":"2202.01290","n_code_links":0,"syntology":null},{"paper":"/paper/accelerating-dnn-training-with-structured","slug":"accelerating-dnn-training-with-structured","title":"Accelerating DNN Training with Structured Data Gradient Pruning","date":"2022-02-01","arxiv_id":"2202.00774","n_code_links":1,"syntology":null},{"paper":null,"slug":"combined-pruning-for-nested-cross-validation","title":"Combined Pruning for Nested Cross-Validation to Accelerate Automated Hyperparameter Optimization for Embedded Feature Selection in High-Dimensional Data with Very Small Sample Sizes","date":"2022-02-01","arxiv_id":"2202.00598","n_code_links":0,"syntology":null},{"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/spdy-accurate-pruning-with-speedup-guarantees","slug":"spdy-accurate-pruning-with-speedup-guarantees","title":"SPDY: Accurate Pruning with Speedup Guarantees","date":"2022-01-31","arxiv_id":"2201.13096","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":3,"phrase":"0 ran · 3 unverified","official":{"repos":["ist-daslab/spdy"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"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":null,"slug":"win-the-lottery-ticket-via-fourier-analysis","title":"Win the Lottery Ticket via Fourier Analysis: Frequencies Guided Network Pruning","date":"2022-01-30","arxiv_id":"2201.12712","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-secure-and-efficient-federated-learning-1","title":"A Secure and Efficient Federated Learning Framework for NLP","date":"2022-01-28","arxiv_id":"2201.11934","n_code_links":0,"syntology":null},{"paper":"/paper/dicp-doppler-iterative-closest-point","slug":"dicp-doppler-iterative-closest-point","title":"DICP: Doppler Iterative Closest Point Algorithm","date":"2022-01-28","arxiv_id":"2201.11944","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-convergence-of-heterogeneous-federated","title":"On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning","date":"2022-01-27","arxiv_id":"2201.11803","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-energy-statistics-of-feature-maps-in","title":"On The Energy Statistics of Feature Maps in Pruning of Neural Networks with Skip-Connections","date":"2022-01-26","arxiv_id":"2201.11209","n_code_links":0,"syntology":null},{"paper":null,"slug":"backdoor-defense-with-machine-unlearning","title":"Backdoor Defense with Machine Unlearning","date":"2022-01-24","arxiv_id":"2201.09538","n_code_links":0,"syntology":null},{"paper":null,"slug":"debiasing-pipeline-improves-deep-learning","title":"Debiasing pipeline improves deep learning model generalization for X-ray based lung nodule detection","date":"2022-01-24","arxiv_id":"2201.09563","n_code_links":0,"syntology":null},{"paper":null,"slug":"iterative-activation-based-structured-pruning","title":"Iterative Activation-based Structured Pruning","date":"2022-01-22","arxiv_id":"2201.09881","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-activation-based-structured-pruning-1","slug":"adaptive-activation-based-structured-pruning-1","title":"Adaptive Activation-based Structured Pruning","date":"2022-01-21","arxiv_id":"2201.10520","n_code_links":1,"syntology":null},{"paper":null,"slug":"can-model-compression-improve-nlp-fairness","title":"Can Model Compression Improve NLP Fairness","date":"2022-01-21","arxiv_id":"2201.08542","n_code_links":0,"syntology":null},{"paper":"/paper/point-nerf-point-based-neural-radiance-fields","slug":"point-nerf-point-based-neural-radiance-fields","title":"Point-NeRF: Point-based Neural Radiance Fields","date":"2022-01-21","arxiv_id":"2201.08845","n_code_links":1,"syntology":null},{"paper":"/paper/tiny-always-on-and-fragile-bias-propagation","slug":"tiny-always-on-and-fragile-bias-propagation","title":"Tiny, always-on and fragile: Bias propagation through design choices in on-device machine learning workflows","date":"2022-01-19","arxiv_id":"2201.07677","n_code_links":1,"syntology":null},{"paper":null,"slug":"critical-periods-and-autism-spectrum","title":"Critical periods and Autism Spectrum Disorders, a role for sleep","date":"2022-01-18","arxiv_id":"2201.07320","n_code_links":0,"syntology":null},{"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":null,"slug":"why-does-darts-miss-the-target-and-how-do-we","title":"Why Does DARTS Miss the Target, and How Do We Aim to Fix It?","date":"2022-01-17","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"autoattention-automatic-attention-head","title":"AutoAttention: Automatic Attention Head Selection Through Differentiable Pruning","date":"2022-01-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"jointlk-joint-reasoning-with-language-models-1","title":"JointLK: Joint Reasoning with Language Models and Knowledge Graphs for Commonsense Question Answering","date":"2022-01-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"magic-pyramid-accelerating-inference-with-1","title":"Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruning","date":"2022-01-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"massive-scale-decoding-for-text-generation-1","title":"Massive-scale Decoding for Text Generation using Lattices","date":"2022-01-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"weighting-and-pruning-based-ensemble-deep","title":"Weighting and Pruning based Ensemble Deep Random Vector Functional Link Network for Tabular Data Classification","date":"2022-01-15","arxiv_id":"2201.05809","n_code_links":0,"syntology":null},{"paper":null,"slug":"automatic-sparse-connectivity-learning-for","title":"Automatic Sparse Connectivity Learning for Neural Networks","date":"2022-01-13","arxiv_id":"2201.05020","n_code_links":0,"syntology":null},{"paper":null,"slug":"examining-and-mitigating-the-impact-of","title":"Examining and Mitigating the Impact of Crossbar Non-idealities for Accurate Implementation of Sparse Deep Neural Networks","date":"2022-01-13","arxiv_id":"2201.05229","n_code_links":0,"syntology":null},{"paper":null,"slug":"recursive-least-squares-for-training-and","title":"Recursive Least Squares for Training and Pruning Convolutional Neural Networks","date":"2022-01-13","arxiv_id":"2201.04813","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-lightweight-neural-animation","title":"Towards Lightweight Neural Animation : Exploration of Neural Network Pruning in Mixture of Experts-based Animation Models","date":"2022-01-11","arxiv_id":"2201.04042","n_code_links":0,"syntology":null},{"paper":null,"slug":"recomed-a-knowledge-aware-recommender-system","title":"RecoMed: A Knowledge-Aware Recommender System for Hypertension Medications","date":"2022-01-09","arxiv_id":"2201.05461","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-network-optimization-for-reinforcement","title":"Neural Network Optimization for Reinforcement Learning Tasks Using Sparse Computations","date":"2022-01-07","arxiv_id":"2201.02571","n_code_links":0,"syntology":null},{"paper":null,"slug":"balancing-generalization-and-specialization","title":"Diversity-boosted Generalization-Specialization Balancing for Zero-shot Learning","date":"2022-01-06","arxiv_id":"2201.01961","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-deep-neural-networks-generates-a","slug":"pruning-deep-neural-networks-generates-a","title":"Pruning deep neural networks generates a sparse, bio-inspired nonlinear controller for insect flight","date":"2022-01-05","arxiv_id":"2201.01852","n_code_links":1,"syntology":null},{"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":null,"slug":"contrastive-dual-gating-learning-sparse","title":"Contrastive Dual Gating: Learning Sparse Features With Contrastive Learning","date":"2022-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"dreaming-to-prune-image-deraining-networks","title":"Dreaming To Prune Image Deraining Networks","date":"2022-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"croesus-multi-stage-processing-and","title":"Croesus: Multi-Stage Processing and Transactions for Video-Analytics in Edge-Cloud Systems","date":"2021-12-31","arxiv_id":"2201.00063","n_code_links":0,"syntology":null},{"paper":"/paper/multi-dimensional-model-compression-of-vision","slug":"multi-dimensional-model-compression-of-vision","title":"Multi-Dimensional Model Compression of Vision Transformer","date":"2021-12-31","arxiv_id":"2201.00043","n_code_links":1,"syntology":null},{"paper":null,"slug":"single-shot-pruning-for-offline-reinforcement","title":"Single-Shot Pruning for Offline Reinforcement Learning","date":"2021-12-31","arxiv_id":"2112.15579","n_code_links":0,"syntology":null},{"paper":null,"slug":"automatic-mixed-precision-quantization-search","title":"Automatic Mixed-Precision Quantization Search of BERT","date":"2021-12-30","arxiv_id":"2112.14938","n_code_links":0,"syntology":null},{"paper":null,"slug":"few-shot-backdoor-defense-using-shapley","title":"Few-shot Backdoor Defense Using Shapley Estimation","date":"2021-12-30","arxiv_id":"2112.14889","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-higher-order-programs-without-meta","title":"Learning Higher-Order Programs without Meta-Interpretive Learning","date":"2021-12-29","arxiv_id":"2112.14603","n_code_links":0,"syntology":null},{"paper":null,"slug":"speedup-deep-learning-models-on-gpu-by-taking","title":"Speedup deep learning models on GPU by taking advantage of efficient unstructured pruning and bit-width reduction","date":"2021-12-28","arxiv_id":"2112.15445","n_code_links":0,"syntology":null},{"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/distilling-the-knowledge-of-romanian-berts","slug":"distilling-the-knowledge-of-romanian-berts","title":"Distilling the Knowledge of Romanian BERTs Using Multiple Teachers","date":"2021-12-23","arxiv_id":"2112.12650","n_code_links":1,"syntology":null}],"record_sha256":"c91e88534e3266f3e4968873fb1c466d19ab4da8cae37944b5e8c1132fe2fa42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}