{"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/23","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":23,"pages_in_order":39,"rows_per_page":100,"rows":[2201,2300],"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/22","next":"/method/pruning/papers/24","papers":[{"paper":null,"slug":"searching-for-cometinho-the-little-metric","title":"Searching for COMETINHO: The Little Metric That Could","date":"2022-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"forestprune-compact-depth-controlled-tree","title":"ForestPrune: Compact Depth-Controlled Tree Ensembles","date":"2022-05-31","arxiv_id":"2206.00128","n_code_links":0,"syntology":null},{"paper":"/paper/vinnpruner-visual-interactive-pruning-for","slug":"vinnpruner-visual-interactive-pruning-for","title":"ViNNPruner: Visual Interactive Pruning for Deep Learning","date":"2022-05-31","arxiv_id":"2205.15731","n_code_links":1,"syntology":null},{"paper":null,"slug":"edge-yolo-real-time-intelligent-object","title":"Edge YOLO: Real-Time Intelligent Object Detection System Based on Edge-Cloud Cooperation in Autonomous Vehicles","date":"2022-05-30","arxiv_id":"2205.14942","n_code_links":0,"syntology":null},{"paper":"/paper/gator-customizable-channel-pruning-of-neural","slug":"gator-customizable-channel-pruning-of-neural","title":"Gator: Customizable Channel Pruning of Neural Networks with Gating","date":"2022-05-30","arxiv_id":"2205.15404","n_code_links":1,"syntology":null},{"paper":null,"slug":"prune-and-distill-similar-reformatting-of","title":"Prune and distill: similar reformatting of image information along rat visual cortex and deep neural networks","date":"2022-05-27","arxiv_id":"2205.13816","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-communication-learning-trade-off-for","title":"Towards Communication-Learning Trade-off for Federated Learning at the Network Edge","date":"2022-05-27","arxiv_id":"2205.14271","n_code_links":0,"syntology":null},{"paper":null,"slug":"fcn-pose-a-pruned-and-quantized-cnn-for-robot","title":"FCN-Pose: A Pruned and Quantized CNN for Robot Pose Estimation for Constrained Devices","date":"2022-05-26","arxiv_id":"2205.13272","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-has-a-disparate-impact-on-model","title":"Pruning has a disparate impact on model accuracy","date":"2022-05-26","arxiv_id":"2205.13574","n_code_links":0,"syntology":null},{"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":null,"slug":"train-flat-then-compress-sharpness-aware","title":"Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models","date":"2022-05-25","arxiv_id":"2205.12694","n_code_links":0,"syntology":null},{"paper":"/paper/compression-aware-training-of-neural-networks","slug":"compression-aware-training-of-neural-networks","title":"Compression-aware Training of Neural Networks using Frank-Wolfe","date":"2022-05-24","arxiv_id":"2205.11921","n_code_links":1,"syntology":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":null,"slug":"unet-a-unet-like-redesigning-skip-connections","title":"UNet#: A UNet-like Redesigning Skip Connections for Medical Image Segmentation","date":"2022-05-24","arxiv_id":"2205.11759","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-subgraph-explorer-reducing-noisy","title":"Neural Subgraph Explorer: Reducing Noisy Information via Target-Oriented Syntax Graph Pruning","date":"2022-05-23","arxiv_id":"2205.10970","n_code_links":0,"syntology":null},{"paper":null,"slug":"opq-compressing-deep-neural-networks-with-one","title":"OPQ: Compressing Deep Neural Networks with One-shot Pruning-Quantization","date":"2022-05-23","arxiv_id":"2205.11141","n_code_links":0,"syntology":null},{"paper":"/paper/the-importance-of-being-parameters-an-intra","slug":"the-importance-of-being-parameters-an-intra","title":"The Importance of Being Parameters: An Intra-Distillation Method for Serious Gains","date":"2022-05-23","arxiv_id":"2205.11416","n_code_links":1,"syntology":null},{"paper":"/paper/indistill-transferring-knowledge-from-pruned","slug":"indistill-transferring-knowledge-from-pruned","title":"InDistill: Information flow-preserving knowledge distillation for model compression","date":"2022-05-20","arxiv_id":"2205.10003","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-rule-search-framework-for-the-early","title":"A Rule Search Framework for the Early Identification of Chronic Emergency Homeless Shelter Clients","date":"2022-05-19","arxiv_id":"2205.09883","n_code_links":0,"syntology":null},{"paper":"/paper/certified-error-control-of-candidate-set","slug":"certified-error-control-of-candidate-set","title":"Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Ranking","date":"2022-05-19","arxiv_id":"2205.09638","n_code_links":1,"syntology":null},{"paper":"/paper/dataset-pruning-reducing-training-data-by","slug":"dataset-pruning-reducing-training-data-by","title":"Dataset Pruning: Reducing Training Data by Examining Generalization Influence","date":"2022-05-19","arxiv_id":"2205.09329","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperparameter-optimization-with-neural","title":"Hyperparameter Optimization with Neural Network Pruning","date":"2022-05-18","arxiv_id":"2205.08695","n_code_links":0,"syntology":null},{"paper":"/paper/deep-neural-networks-with-dependent-weights","slug":"deep-neural-networks-with-dependent-weights","title":"Deep neural networks with dependent weights: Gaussian Process mixture limit, heavy tails, sparsity and compressibility","date":"2022-05-17","arxiv_id":"2205.08187","n_code_links":1,"syntology":null},{"paper":null,"slug":"dimensionality-reduced-training-by-pruning","title":"Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey","date":"2022-05-17","arxiv_id":"2205.08099","n_code_links":0,"syntology":null},{"paper":null,"slug":"m6-rec-generative-pretrained-language-models","title":"M6-Rec: Generative Pretrained Language Models are Open-Ended Recommender Systems","date":"2022-05-17","arxiv_id":"2205.08084","n_code_links":0,"syntology":null},{"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":null,"slug":"analyzing-lottery-ticket-hypothesis-from-pac","title":"Analyzing Lottery Ticket Hypothesis from PAC-Bayesian Theory Perspective","date":"2022-05-15","arxiv_id":"2205.07320","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-network-based-ofdm-receiver-for","title":"Neural Network-based OFDM Receiver for Resource Constrained IoT Devices","date":"2022-05-12","arxiv_id":"2205.06159","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-random-channel-pruning-for-neural","slug":"revisiting-random-channel-pruning-for-neural","title":"Revisiting Random Channel Pruning for Neural Network Compression","date":"2022-05-11","arxiv_id":"2205.05676","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-learning-of-parsimonious-deep-neural","title":"Robust Learning of Parsimonious Deep Neural Networks","date":"2022-05-10","arxiv_id":"2205.04650","n_code_links":0,"syntology":null},{"paper":null,"slug":"serving-and-optimizing-machine-learning","title":"Serving and Optimizing Machine Learning Workflows on Heterogeneous Infrastructures","date":"2022-05-10","arxiv_id":"2205.04713","n_code_links":0,"syntology":null},{"paper":null,"slug":"attribution-based-task-specific-pruning-for","title":"Task-specific Compression for Multi-task Language Models using Attribution-based Pruning","date":"2022-05-09","arxiv_id":"2205.04157","n_code_links":0,"syntology":null},{"paper":null,"slug":"informed-steiner-trees-sampling-and-pruning","title":"Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions","date":"2022-05-09","arxiv_id":"2205.04548","n_code_links":0,"syntology":null},{"paper":null,"slug":"automatic-block-wise-pruning-with-auxiliary","title":"Automatic Block-wise Pruning with Auxiliary Gating Structures for Deep Convolutional Neural Networks","date":"2022-05-07","arxiv_id":"2205.03602","n_code_links":0,"syntology":null},{"paper":null,"slug":"symphony-learning-realistic-and-diverse","title":"Symphony: Learning Realistic and Diverse Agents for Autonomous Driving Simulation","date":"2022-05-06","arxiv_id":"2205.03195","n_code_links":0,"syntology":null},{"paper":null,"slug":"convolutional-and-residual-networks-provably","title":"Convolutional and Residual Networks Provably Contain Lottery Tickets","date":"2022-05-04","arxiv_id":"2205.02343","n_code_links":0,"syntology":null},{"paper":null,"slug":"domino-saliency-metrics-improving-existing","title":"Domino Saliency Metrics: Improving Existing Channel Saliency Metrics with Structural Information","date":"2022-05-04","arxiv_id":"2205.02131","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-supervised-cascaded-clustering-for","title":"Semi-Supervised Cascaded Clustering for Classification of Noisy Label Data","date":"2022-05-04","arxiv_id":"2205.02209","n_code_links":0,"syntology":null},{"paper":null,"slug":"compact-neural-networks-via-stacking-designed","title":"Compact Neural Networks via Stacking Designed Basic Units","date":"2022-05-03","arxiv_id":"2205.01508","n_code_links":0,"syntology":null},{"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":null,"slug":"ensemble-pruning-via-an-integer-programming","title":"Ensemble pruning via an integer programming approach with diversity constraints","date":"2022-05-02","arxiv_id":"2205.01088","n_code_links":0,"syntology":null},{"paper":null,"slug":"zebra-memory-bandwidth-reduction-for-cnn","title":"Zebra: Memory Bandwidth Reduction for CNN Accelerators With Zero Block Regularization of Activation Maps","date":"2022-05-02","arxiv_id":"2205.00779","n_code_links":0,"syntology":null},{"paper":null,"slug":"channel-pruned-yolov5-based-deep-learning","title":"Channel Pruned YOLOv5-based Deep Learning Approach for Rapid and Accurate Outdoor Obstacles Detection","date":"2022-04-27","arxiv_id":"2204.13699","n_code_links":0,"syntology":null},{"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":null,"slug":"federated-progressive-sparsification-purge","title":"Federated Progressive Sparsification (Purge, Merge, Tune)+","date":"2022-04-26","arxiv_id":"2204.12430","n_code_links":0,"syntology":null},{"paper":null,"slug":"enable-deep-learning-on-mobile-devices","title":"Enable Deep Learning on Mobile Devices: Methods, Systems, and Applications","date":"2022-04-25","arxiv_id":"2204.11786","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedduap-federated-learning-with-dynamic","title":"FedDUAP: Federated Learning with Dynamic Update and Adaptive Pruning Using Shared Data on the Server","date":"2022-04-25","arxiv_id":"2204.11536","n_code_links":0,"syntology":null},{"paper":null,"slug":"fine-tuning-pruned-networks-with-linear-over","title":"Boosting Pruned Networks with Linear Over-parameterization","date":"2022-04-25","arxiv_id":"2204.11444","n_code_links":0,"syntology":null},{"paper":"/paper/learning-to-win-lottery-tickets-in-bert-1","slug":"learning-to-win-lottery-tickets-in-bert-1","title":"Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Training","date":"2022-04-24","arxiv_id":"2204.11218","n_code_links":1,"syntology":null},{"paper":null,"slug":"exploring-negatives-in-contrastive-learning","title":"Exploring Negatives in Contrastive Learning for Unpaired Image-to-Image Translation","date":"2022-04-23","arxiv_id":"2204.11018","n_code_links":0,"syntology":null},{"paper":"/paper/depth-pruning-with-auxiliary-networks-for","slug":"depth-pruning-with-auxiliary-networks-for","title":"Depth Pruning with Auxiliary Networks for TinyML","date":"2022-04-22","arxiv_id":"2204.10546","n_code_links":1,"syntology":null},{"paper":null,"slug":"searching-intrinsic-dimensions-of-vision","title":"Searching Intrinsic Dimensions of Vision Transformers","date":"2022-04-16","arxiv_id":"2204.07722","n_code_links":0,"syntology":null},{"paper":null,"slug":"end-to-end-sensitivity-based-filter-pruning","title":"End-to-End Sensitivity-Based Filter Pruning","date":"2022-04-15","arxiv_id":"2204.07412","n_code_links":0,"syntology":null},{"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":null,"slug":"receding-neuron-importances-for-structured","title":"Receding Neuron Importances for Structured Pruning","date":"2022-04-13","arxiv_id":"2204.06404","n_code_links":0,"syntology":null},{"paper":"/paper/compact-model-training-by-low-rank-projection","slug":"compact-model-training-by-low-rank-projection","title":"Compact Model Training by Low-Rank Projection with Energy Transfer","date":"2022-04-12","arxiv_id":"2204.05566","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-network-pruning-by-cooperative","title":"Neural Network Pruning by Cooperative Coevolution","date":"2022-04-12","arxiv_id":"2204.05639","n_code_links":0,"syntology":null},{"paper":"/paper/regularization-based-pruning-of-irrelevant","slug":"regularization-based-pruning-of-irrelevant","title":"Regularization-based Pruning of Irrelevant Weights in Deep Neural Architectures","date":"2022-04-11","arxiv_id":"2204.04977","n_code_links":1,"syntology":null},{"paper":null,"slug":"channel-pruning-in-quantization-aware","title":"Channel Pruning In Quantization-aware Training: An Adaptive Projection-gradient Descent-shrinkage-splitting Method","date":"2022-04-09","arxiv_id":"2204.04375","n_code_links":0,"syntology":null},{"paper":null,"slug":"single-shot-embedding-dimension-search-in","title":"Single-shot Embedding Dimension Search in Recommender System","date":"2022-04-07","arxiv_id":"2204.03281","n_code_links":0,"syntology":null},{"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":null,"slug":"probing-structured-pruning-on-multilingual","title":"Probing Structured Pruning on Multilingual Pre-trained Models: Settings, Algorithms, and Efficiency","date":"2022-04-06","arxiv_id":"2204.02601","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-sparsity-meets-dynamic-convolution","title":"SD-Conv: Towards the Parameter-Efficiency of Dynamic Convolution","date":"2022-04-05","arxiv_id":"2204.02227","n_code_links":0,"syntology":null},{"paper":null,"slug":"aligned-weight-regularizers-for-pruning-1","title":"Aligned Weight Regularizers for Pruning Pretrained Neural Networks","date":"2022-04-04","arxiv_id":"2204.01385","n_code_links":0,"syntology":null},{"paper":null,"slug":"rem-routing-entropy-minimization-for-capsule","title":"REM: Routing Entropy Minimization for Capsule Networks","date":"2022-04-04","arxiv_id":"2204.01298","n_code_links":0,"syntology":null},{"paper":"/paper/paoding-supervised-robustness-preserving-data","slug":"paoding-supervised-robustness-preserving-data","title":"Supervised Robustness-preserving Data-free Neural Network Pruning","date":"2022-04-02","arxiv_id":"2204.00783","n_code_links":1,"syntology":null},{"paper":"/paper/i-razor-a-neural-input-razor-for-feature","slug":"i-razor-a-neural-input-razor-for-feature","title":"i-Razor: A Differentiable Neural Input Razor for Feature Selection and Dimension Search in DNN-Based Recommender Systems","date":"2022-04-01","arxiv_id":"2204.00281","n_code_links":1,"syntology":null},{"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":null,"slug":"textpruner-a-model-pruning-toolkit-for-pre","title":"TextPruner: A Model Pruning Toolkit for Pre-Trained Language Models","date":"2022-03-30","arxiv_id":"2203.15996","n_code_links":0,"syntology":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/a-passive-similarity-based-cnn-filter-pruning","slug":"a-passive-similarity-based-cnn-filter-pruning","title":"A Passive Similarity based CNN Filter Pruning for Efficient Acoustic Scene Classification","date":"2022-03-29","arxiv_id":"2203.15751","n_code_links":1,"syntology":null},{"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/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":null,"slug":"a-fast-and-efficient-conditional-learning-for","title":"A Fast and Efficient Conditional Learning for Tunable Trade-Off between Accuracy and Robustness","date":"2022-03-28","arxiv_id":"2204.00426","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-transformer-efficiency-for-1","title":"Enhancing Transformer Efficiency for Multivariate Time Series Classification","date":"2022-03-28","arxiv_id":"2203.14472","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-in-time-pit-a-lightweight-network","slug":"pruning-in-time-pit-a-lightweight-network","title":"Pruning In Time (PIT): A Lightweight Network Architecture Optimizer for Temporal Convolutional Networks","date":"2022-03-28","arxiv_id":"2203.14768","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-neural-tangent-kernel-analysis-of","title":"On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networks","date":"2022-03-27","arxiv_id":"2203.14328","n_code_links":0,"syntology":null},{"paper":null,"slug":"autots-automatic-time-series-forecasting","title":"AutoTS: Automatic Time Series Forecasting Model Design Based on Two-Stage Pruning","date":"2022-03-26","arxiv_id":"2203.14169","n_code_links":0,"syntology":null},{"paper":null,"slug":"lightweight-graph-convolutional-networks-with","title":"Lightweight Graph Convolutional Networks with Topologically Consistent Magnitude Pruning","date":"2022-03-25","arxiv_id":"2203.13616","n_code_links":0,"syntology":null},{"paper":"/paper/searching-for-network-width-with-bilaterally","slug":"searching-for-network-width-with-bilaterally","title":"Searching for Network Width with Bilaterally Coupled Network","date":"2022-03-25","arxiv_id":"2203.13714","n_code_links":1,"syntology":null},{"paper":null,"slug":"vision-transformer-compression-with","title":"Vision Transformer Compression with Structured Pruning and Low Rank Approximation","date":"2022-03-25","arxiv_id":"2203.13444","n_code_links":0,"syntology":null},{"paper":null,"slug":"ssgcnet-a-sparse-spectra-graph-convolutional","title":"SSGCNet: A Sparse Spectra Graph Convolutional Network for Epileptic EEG Signal Classification","date":"2022-03-24","arxiv_id":"2203.12910","n_code_links":0,"syntology":null},{"paper":"/paper/towards-efficient-and-elastic-visual-question","slug":"towards-efficient-and-elastic-visual-question","title":"Bilaterally Slimmable Transformer for Elastic and Efficient Visual Question Answering","date":"2022-03-24","arxiv_id":"2203.12814","n_code_links":1,"syntology":null},{"paper":null,"slug":"exploring-linear-feature-disentanglement-for","title":"Exploring Linear Feature Disentanglement For Neural Networks","date":"2022-03-22","arxiv_id":"2203.11700","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-fine-grained-n-m-sparsity-for","title":"Minimum Variance Unbiased N:M Sparsity for the Neural Gradients","date":"2022-03-21","arxiv_id":"2203.10991","n_code_links":0,"syntology":null},{"paper":null,"slug":"delta-keyword-transformer-bringing","title":"Delta Keyword Transformer: Bringing Transformers to the Edge through Dynamically Pruned Multi-Head Self-Attention","date":"2022-03-20","arxiv_id":"2204.03479","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-representative-subset-selection-for","title":"Representative Subset Selection for Efficient Fine-Tuning in Self-Supervised Speech Recognition","date":"2022-03-18","arxiv_id":"2203.09829","n_code_links":0,"syntology":null},{"paper":null,"slug":"developing-a-successful-bomberman-agent","title":"Developing a Successful Bomberman Agent","date":"2022-03-17","arxiv_id":"2203.09608","n_code_links":0,"syntology":null},{"paper":null,"slug":"complexity-reduction-of-learned-in-loop","title":"Complexity Reduction of Learned In-Loop Filtering in Video Coding","date":"2022-03-16","arxiv_id":"2203.08650","n_code_links":0,"syntology":null},{"paper":null,"slug":"ppcd-gan-progressive-pruning-and-class-aware","title":"PPCD-GAN: Progressive Pruning and Class-Aware Distillation for Large-Scale Conditional GANs Compression","date":"2022-03-16","arxiv_id":"2203.08456","n_code_links":0,"syntology":null},{"paper":null,"slug":"interspace-pruning-using-adaptive-filter","title":"Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNs","date":"2022-03-15","arxiv_id":"2203.07808","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-optimize-resource-assignment-for","title":"Learning to Optimize Resource Assignment for Task Offloading in Mobile Edge Computing","date":"2022-03-15","arxiv_id":"2203.09954","n_code_links":0,"syntology":null},{"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/the-optimal-bert-surgeon-scalable-and","slug":"the-optimal-bert-surgeon-scalable-and","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","date":"2022-03-14","arxiv_id":"2203.07259","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-proposal-to-study-is-high-quality-data-all","title":"A Proposal to Study \"Is High Quality Data All We Need?\"","date":"2022-03-12","arxiv_id":"2203.06404","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-on-device-ai-and-blockchain-for-6g","title":"Towards On-Device AI and Blockchain for 6G enabled Agricultural Supply-chain Management","date":"2022-03-12","arxiv_id":"2203.06465","n_code_links":0,"syntology":null},{"paper":"/paper/cross-layer-approximation-for-printed-machine","slug":"cross-layer-approximation-for-printed-machine","title":"Cross-Layer Approximation For Printed Machine Learning Circuits","date":"2022-03-11","arxiv_id":"2203.05915","n_code_links":1,"syntology":null},{"paper":null,"slug":"ensemble-plasticity-and-network-adaptability","title":"Ensemble plasticity and network adaptability in SNNs","date":"2022-03-11","arxiv_id":"2203.07039","n_code_links":0,"syntology":null},{"paper":null,"slug":"improve-convolutional-neural-network-pruning","title":"Improve Convolutional Neural Network Pruning by Maximizing Filter Variety","date":"2022-03-11","arxiv_id":"2203.05807","n_code_links":0,"syntology":null}],"record_sha256":"db70e0c5910a55a4c3ec6515d035ab3fcb8b7e0a349df3847e7a9ef6c316fb3a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}