{"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/22","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":22,"pages_in_order":39,"rows_per_page":100,"rows":[2101,2200],"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/21","next":"/method/pruning/papers/23","papers":[{"paper":"/paper/ribac-towards-robust-and-imperceptible","slug":"ribac-towards-robust-and-imperceptible","title":"RIBAC: Towards Robust and Imperceptible Backdoor Attack against Compact DNN","date":"2022-08-22","arxiv_id":"2208.10608","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":0,"n_instrument":1,"unverified":3,"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) · 3 unverified","official":{"repos":["huyvnphan/eccv2022-ribac"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"combining-compressions-for-multiplicative","title":"Combining Compressions for Multiplicative Size Scaling on Natural Language Tasks","date":"2022-08-20","arxiv_id":"2208.09684","n_code_links":0,"syntology":null},{"paper":"/paper/towards-efficient-capsule-networks","slug":"towards-efficient-capsule-networks","title":"Towards Efficient Capsule Networks","date":"2022-08-19","arxiv_id":"2208.09203","n_code_links":1,"syntology":null},{"paper":null,"slug":"enhancing-targeted-attack-transferability-via","title":"Enhancing Targeted Attack Transferability via Diversified Weight Pruning","date":"2022-08-18","arxiv_id":"2208.08677","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-learning-with-new-value-function-for","title":"Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem","date":"2022-08-18","arxiv_id":"2208.08620","n_code_links":0,"syntology":null},{"paper":null,"slug":"field-wise-embedding-size-search-via","title":"Field-wise Embedding Size Search via Structural Hard Auxiliary Mask Pruning for Click-Through Rate Prediction","date":"2022-08-17","arxiv_id":"2208.08004","n_code_links":0,"syntology":null},{"paper":null,"slug":"remote-photoplethysmography-from-low","title":"Remote Photoplethysmography from Low Resolution videos: An end-to-end solution using Efficient ConvNets","date":"2022-08-14","arxiv_id":"2208.06817","n_code_links":0,"syntology":null},{"paper":null,"slug":"entropy-induced-pruning-framework-for","title":"Entropy Induced Pruning Framework for Convolutional Neural Networks","date":"2022-08-13","arxiv_id":"2208.06660","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-algorithm-hardware-co-optimized-framework","title":"An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformers","date":"2022-08-12","arxiv_id":"2208.06118","n_code_links":0,"syntology":null},{"paper":null,"slug":"weightmom-learning-sparse-networks-using","title":"WeightMom: Learning Sparse Networks using Iterative Momentum-based pruning","date":"2022-08-11","arxiv_id":"2208.05970","n_code_links":0,"syntology":null},{"paper":null,"slug":"customized-watermarking-for-deep-neural","title":"Customized Watermarking for Deep Neural Networks via Label Distribution Perturbation","date":"2022-08-10","arxiv_id":"2208.05477","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrating-connection-search-in-graph","title":"Integrating connection search in graph queries","date":"2022-08-09","arxiv_id":"2208.04802","n_code_links":0,"syntology":null},{"paper":"/paper/optembed-learning-optimal-embedding-table-for","slug":"optembed-learning-optimal-embedding-table-for","title":"OptEmbed: Learning Optimal Embedding Table for Click-through Rate Prediction","date":"2022-08-09","arxiv_id":"2208.04482","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["fuyuanlyu/optembed"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"sbpf-sensitiveness-based-pruning-framework","title":"SBPF: Sensitiveness Based Pruning Framework For Convolutional Neural Network On Image Classification","date":"2022-08-09","arxiv_id":"2208.04588","n_code_links":0,"syntology":null},{"paper":null,"slug":"n2nskip-learning-highly-sparse-networks-using","title":"N2NSkip: Learning Highly Sparse Networks using Neuron-to-Neuron Skip Connections","date":"2022-08-07","arxiv_id":"2208.03662","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-model-oriented-approach-for-lifting","title":"A Model-Oriented Approach for Lifting Symmetries in Answer Set Programming","date":"2022-08-05","arxiv_id":"2208.03095","n_code_links":0,"syntology":null},{"paper":"/paper/data-free-backdoor-removal-based-on-channel","slug":"data-free-backdoor-removal-based-on-channel","title":"Data-free Backdoor Removal based on Channel Lipschitzness","date":"2022-08-05","arxiv_id":"2208.03111","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["rkteddy/channel-lipschitzness-based-pruning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"ace-adaptive-constraint-aware-early-stopping","title":"ACE: Adaptive Constraint-aware Early Stopping in Hyperparameter Optimization","date":"2022-08-04","arxiv_id":"2208.02922","n_code_links":0,"syntology":null},{"paper":"/paper/keyword-spotting-system-and-evaluation-of","slug":"keyword-spotting-system-and-evaluation-of","title":"Keyword Spotting System and Evaluation of Pruning and Quantization Methods on Low-power Edge Microcontrollers","date":"2022-08-04","arxiv_id":"2208.02765","n_code_links":1,"syntology":null},{"paper":null,"slug":"enpheeph-a-fault-injection-framework-for","title":"enpheeph: A Fault Injection Framework for Spiking and Compressed Deep Neural Networks","date":"2022-07-31","arxiv_id":"2208.00328","n_code_links":0,"syntology":null},{"paper":"/paper/a-one-shot-reparameterization-method-for","slug":"a-one-shot-reparameterization-method-for","title":"A One-Shot Reparameterization Method for Reducing the Loss of Tile Pruning on DNNs","date":"2022-07-29","arxiv_id":"2207.14545","n_code_links":1,"syntology":null},{"paper":"/paper/cram-a-compression-aware-minimizer","slug":"cram-a-compression-aware-minimizer","title":"CrAM: A Compression-Aware Minimizer","date":"2022-07-28","arxiv_id":"2207.14200","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":["ist-daslab/cram"],"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":"fault-detection-and-classification-of","title":"Fault Detection and Classification of Aerospace Sensors using a VGG16-based Deep Neural Network","date":"2022-07-27","arxiv_id":"2207.13267","n_code_links":0,"syntology":null},{"paper":"/paper/debiasing-deep-chest-x-ray-classifiers-using","slug":"debiasing-deep-chest-x-ray-classifiers-using","title":"Debiasing Deep Chest X-Ray Classifiers using Intra- and Post-processing Methods","date":"2022-07-26","arxiv_id":"2208.00781","n_code_links":1,"syntology":null},{"paper":"/paper/reconciling-security-and-communication","slug":"reconciling-security-and-communication","title":"Reconciling Security and Communication Efficiency in Federated Learning","date":"2022-07-26","arxiv_id":"2207.12779","n_code_links":1,"syntology":null},{"paper":"/paper/trainability-preserving-neural-structured","slug":"trainability-preserving-neural-structured","title":"Trainability Preserving Neural Pruning","date":"2022-07-25","arxiv_id":"2207.12534","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-taxonomy-of-recurrent-learning-rules","title":"A Taxonomy of Recurrent Learning Rules","date":"2022-07-23","arxiv_id":"2207.11439","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-complexity-cnns-for-acoustic-scene","title":"Low-complexity CNNs for Acoustic Scene Classification","date":"2022-07-23","arxiv_id":"2207.11529","n_code_links":0,"syntology":null},{"paper":"/paper/fairgrape-fairness-aware-gradient-pruning","slug":"fairgrape-fairness-aware-gradient-pruning","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","date":"2022-07-22","arxiv_id":"2207.10888","n_code_links":1,"syntology":{"ran":3,"of":7,"n_ran_checked":3,"n_instrument":0,"unverified":4,"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) · 4 unverified","official":{"repos":["bernardo1998/fairgrape"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/revisiting-parameter-reuse-to-overcome","slug":"revisiting-parameter-reuse-to-overcome","title":"AdaptCL: Adaptive Continual Learning for Tackling Heterogeneity in Sequential Datasets","date":"2022-07-22","arxiv_id":"2207.11005","n_code_links":1,"syntology":null},{"paper":null,"slug":"model-compression-for-resource-constrained","title":"Model Compression for Resource-Constrained Mobile Robots","date":"2022-07-20","arxiv_id":"2207.10082","n_code_links":0,"syntology":null},{"paper":null,"slug":"analyzing-bagging-methods-for-language-models","title":"Analyzing Bagging Methods for Language Models","date":"2022-07-19","arxiv_id":"2207.09099","n_code_links":0,"syntology":null},{"paper":null,"slug":"comprehensive-graph-gradual-pruning-for","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","date":"2022-07-18","arxiv_id":"2207.08629","n_code_links":0,"syntology":null},{"paper":"/paper/the-multiple-subnetwork-hypothesis-enabling","slug":"the-multiple-subnetwork-hypothesis-enabling","title":"The Multiple Subnetwork Hypothesis: Enabling Multidomain Learning by Isolating Task-Specific Subnetworks in Feedforward Neural Networks","date":"2022-07-18","arxiv_id":"2207.08821","n_code_links":1,"syntology":null},{"paper":null,"slug":"s4-a-high-sparsity-high-performance-ai","title":"S4: a High-sparsity, High-performance AI Accelerator","date":"2022-07-16","arxiv_id":"2207.08006","n_code_links":0,"syntology":null},{"paper":"/paper/dropnet-reducing-neural-network-complexity-1","slug":"dropnet-reducing-neural-network-complexity-1","title":"DropNet: Reducing Neural Network Complexity via Iterative Pruning","date":"2022-07-14","arxiv_id":"2207.06646","n_code_links":1,"syntology":null},{"paper":null,"slug":"e2-aen-end-to-end-incremental-learning-with","title":"E2-AEN: End-to-End Incremental Learning with Adaptively Expandable Network","date":"2022-07-14","arxiv_id":"2207.06754","n_code_links":0,"syntology":null},{"paper":null,"slug":"eve-environmental-adaptive-neural-network","title":"EVE: Environmental Adaptive Neural Network Models for Low-power Energy Harvesting System","date":"2022-07-14","arxiv_id":"2207.09258","n_code_links":0,"syntology":null},{"paper":"/paper/pr-darts-pruning-based-differentiable","slug":"pr-darts-pruning-based-differentiable","title":"DASS: Differentiable Architecture Search for Sparse neural networks","date":"2022-07-14","arxiv_id":"2207.06968","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-robustness-and-anomaly-detection-of","title":"On the Robustness and Anomaly Detection of Sparse Neural Networks","date":"2022-07-09","arxiv_id":"2207.04227","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-support-vector-model-of-pruning-trees","title":"A Support Vector Model of Pruning Trees Evaluation Based on OTSU Algorithm","date":"2022-07-08","arxiv_id":"2207.03638","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-early-exit-networks","title":"Pruning Early Exit Networks","date":"2022-07-08","arxiv_id":"2207.03644","n_code_links":0,"syntology":null},{"paper":null,"slug":"singe-sparsity-via-integrated-gradients","title":"SInGE: Sparsity via Integrated Gradients Estimation of Neuron Relevance","date":"2022-07-08","arxiv_id":"2207.04089","n_code_links":0,"syntology":null},{"paper":"/paper/supertickets-drawing-task-agnostic-lottery","slug":"supertickets-drawing-task-agnostic-lottery","title":"SuperTickets: Drawing Task-Agnostic Lottery Tickets from Supernets via Jointly Architecture Searching and Parameter Pruning","date":"2022-07-08","arxiv_id":"2207.03677","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":["rice-eic/supertickets"],"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/false-negative-reduction-in-semantic","slug":"false-negative-reduction-in-semantic","title":"False Negative Reduction in Semantic Segmentation under Domain Shift using Depth Estimation","date":"2022-07-07","arxiv_id":"2207.03513","n_code_links":1,"syntology":null},{"paper":null,"slug":"he-pex-efficient-machine-learning-under","title":"Efficient Pruning for Machine Learning Under Homomorphic Encryption","date":"2022-07-07","arxiv_id":"2207.03384","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-approach-for-classifying-1","title":"Deep Learning approach for Classifying Trusses and Runners of Strawberries","date":"2022-07-06","arxiv_id":"2207.02721","n_code_links":0,"syntology":null},{"paper":"/paper/gender-biases-and-where-to-find-them","slug":"gender-biases-and-where-to-find-them","title":"Gender Biases and Where to Find Them: Exploring Gender Bias in Pre-Trained Transformer-based Language Models Using Movement Pruning","date":"2022-07-06","arxiv_id":"2207.02463","n_code_links":1,"syntology":null},{"paper":"/paper/network-pruning-via-feature-shift","slug":"network-pruning-via-feature-shift","title":"Network Pruning via Feature Shift Minimization","date":"2022-07-06","arxiv_id":"2207.02632","n_code_links":1,"syntology":null},{"paper":null,"slug":"rank-based-filter-pruning-for-real-time-uav","title":"Rank-Based Filter Pruning for Real-Time UAV Tracking","date":"2022-07-05","arxiv_id":"2207.01768","n_code_links":0,"syntology":null},{"paper":null,"slug":"analysis-of-robocode-robot-adaptive","title":"Analysis of Robocode Robot Adaptive Confrontation Based on Zero-Sum Game","date":"2022-07-04","arxiv_id":"2207.01211","n_code_links":0,"syntology":null},{"paper":"/paper/cprune-compiler-informed-model-pruning-for","slug":"cprune-compiler-informed-model-pruning-for","title":"CPrune: Compiler-Informed Model Pruning for Efficient Target-Aware DNN Execution","date":"2022-07-04","arxiv_id":"2207.01260","n_code_links":1,"syntology":null},{"paper":"/paper/lottery-ticket-hypothesis-for-spiking-neural","slug":"lottery-ticket-hypothesis-for-spiking-neural","title":"Exploring Lottery Ticket Hypothesis in Spiking Neural Networks","date":"2022-07-04","arxiv_id":"2207.01382","n_code_links":1,"syntology":null},{"paper":"/paper/probing-via-prompting","slug":"probing-via-prompting","title":"Probing via Prompting","date":"2022-07-04","arxiv_id":"2207.01736","n_code_links":1,"syntology":null},{"paper":null,"slug":"quantum-neural-network-compression","title":"Quantum Neural Network Compression","date":"2022-07-04","arxiv_id":"2207.01578","n_code_links":0,"syntology":null},{"paper":"/paper/prue-distilling-knowledge-from-sparse-teacher","slug":"prue-distilling-knowledge-from-sparse-teacher","title":"PrUE: Distilling Knowledge from Sparse Teacher Networks","date":"2022-07-03","arxiv_id":"2207.00586","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-structured-sparse-neural-network-and-its","title":"A Structured Sparse Neural Network and Its Matrix Calculations Algorithm","date":"2022-07-02","arxiv_id":"2207.00903","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-adversarial-training-with-data","title":"Efficient Adversarial Training With Data Pruning","date":"2022-07-01","arxiv_id":"2207.00694","n_code_links":0,"syntology":null},{"paper":"/paper/studying-the-impact-of-magnitude-pruning-on","slug":"studying-the-impact-of-magnitude-pruning-on","title":"Studying the impact of magnitude pruning on contrastive learning methods","date":"2022-07-01","arxiv_id":"2207.00200","n_code_links":1,"syntology":null},{"paper":null,"slug":"sparse-periodic-systolic-dataflow-for","title":"Sparse Periodic Systolic Dataflow for Lowering Latency and Power Dissipation of Convolutional Neural Network Accelerators","date":"2022-06-30","arxiv_id":"2207.00068","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-topological-bert-transforming-attention","title":"The Topological BERT: Transforming Attention into Topology for Natural Language Processing","date":"2022-06-30","arxiv_id":"2206.15195","n_code_links":0,"syntology":null},{"paper":"/paper/beyond-neural-scaling-laws-beating-power-law","slug":"beyond-neural-scaling-laws-beating-power-law","title":"Beyond neural scaling laws: beating power law scaling via data pruning","date":"2022-06-29","arxiv_id":"2206.14486","n_code_links":3,"syntology":null},{"paper":null,"slug":"cut-inner-layers-a-structured-pruning","title":"Cut Inner Layers: A Structured Pruning Strategy for Efficient U-Net GANs","date":"2022-06-29","arxiv_id":"2206.14658","n_code_links":0,"syntology":null},{"paper":"/paper/the-lighter-the-better-rethinking","slug":"the-lighter-the-better-rethinking","title":"The Lighter The Better: Rethinking Transformers in Medical Image Segmentation Through Adaptive Pruning","date":"2022-06-29","arxiv_id":"2206.14413","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-neural-networks-pruning-via-the","title":"Deep Neural Networks pruning via the Structured Perspective Regularization","date":"2022-06-28","arxiv_id":"2206.14056","n_code_links":0,"syntology":null},{"paper":null,"slug":"no-imputation-without-representation","title":"No imputation without representation","date":"2022-06-28","arxiv_id":"2206.14254","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-supervised-contrastive-outlier-removal","title":"Semi-supervised Contrastive Outlier removal for Pseudo Expectation Maximization (SCOPE)","date":"2022-06-28","arxiv_id":"2206.14261","n_code_links":0,"syntology":null},{"paper":"/paper/fast-sequence-to-graph-alignment-using-the","slug":"fast-sequence-to-graph-alignment-using-the","title":"Fast sequence to graph alignment using the graph wavefront algorithm","date":"2022-06-27","arxiv_id":"2206.13574","n_code_links":1,"syntology":null},{"paper":"/paper/training-your-sparse-neural-network-better","slug":"training-your-sparse-neural-network-better","title":"Training Your Sparse Neural Network Better with Any Mask","date":"2022-06-26","arxiv_id":"2206.12755","n_code_links":1,"syntology":null},{"paper":"/paper/platon-pruning-large-transformer-models-with","slug":"platon-pruning-large-transformer-models-with","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","date":"2022-06-25","arxiv_id":"2206.12562","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["qingruzhang/platon"],"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","unlocated"]}}},{"paper":null,"slug":"pruned-rnn-t-for-fast-memory-efficient-asr","title":"Pruned RNN-T for fast, memory-efficient ASR training","date":"2022-06-23","arxiv_id":"2206.13236","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-automatic-and-efficient-bert-pruning-for","title":"An Automatic and Efficient BERT Pruning for Edge AI Systems","date":"2022-06-21","arxiv_id":"2206.10461","n_code_links":0,"syntology":null},{"paper":null,"slug":"memory-efficient-learned-image-compression","title":"Memory-Efficient Learned Image Compression with Pruned Hyperprior Module","date":"2022-06-21","arxiv_id":"2206.10083","n_code_links":0,"syntology":null},{"paper":"/paper/winning-the-lottery-ahead-of-time-efficient","slug":"winning-the-lottery-ahead-of-time-efficient","title":"Winning the Lottery Ahead of Time: Efficient Early Network Pruning","date":"2022-06-21","arxiv_id":"2206.10451","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":["johnrachwan123/Early-Cropression-via-Gradient-Flow-Preservation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"augmented-imagefication-a-data-driven-fault","title":"Augmented Imagefication: A Data-driven Fault Detection Method for Aircraft Air Data Sensors","date":"2022-06-18","arxiv_id":"2206.09055","n_code_links":0,"syntology":null},{"paper":"/paper/sparse-double-descent-where-network-pruning","slug":"sparse-double-descent-where-network-pruning","title":"Sparse Double Descent: Where Network Pruning Aggravates Overfitting","date":"2022-06-17","arxiv_id":"2206.08684","n_code_links":1,"syntology":null},{"paper":null,"slug":"asymptotic-soft-cluster-pruning-for-deep","title":"Asymptotic Soft Cluster Pruning for Deep Neural Networks","date":"2022-06-16","arxiv_id":"2206.08186","n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-robustness-lottery-a","title":"\"Understanding Robustness Lottery\": A Geometric Visual Comparative Analysis of Neural Network Pruning Approaches","date":"2022-06-16","arxiv_id":"2206.07918","n_code_links":0,"syntology":null},{"paper":"/paper/can-pruning-improve-certified-robustness-of","slug":"can-pruning-improve-certified-robustness-of","title":"Can pruning improve certified robustness of neural networks?","date":"2022-06-15","arxiv_id":"2206.07311","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-neural-network-pruning-for-nuclei","title":"Deep Neural Network Pruning for Nuclei Instance Segmentation in Hematoxylin & Eosin-Stained Histological Images","date":"2022-06-15","arxiv_id":"2206.07422","n_code_links":0,"syntology":null},{"paper":"/paper/hardening-dnns-against-transfer-attacks","slug":"hardening-dnns-against-transfer-attacks","title":"Hardening DNNs against Transfer Attacks during Network Compression using Greedy Adversarial Pruning","date":"2022-06-15","arxiv_id":"2206.07406","n_code_links":1,"syntology":null},{"paper":"/paper/linearity-grafting-relaxed-neuron-pruning","slug":"linearity-grafting-relaxed-neuron-pruning","title":"Linearity Grafting: Relaxed Neuron Pruning Helps Certifiable Robustness","date":"2022-06-15","arxiv_id":"2206.07839","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["vita-group/linearity-grafting"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/residual-sparsity-connection-learning-for","slug":"residual-sparsity-connection-learning-for","title":"Structured Sparsity Learning for Efficient Video Super-Resolution","date":"2022-06-15","arxiv_id":"2206.07687","n_code_links":1,"syntology":null},{"paper":"/paper/voxgraf-fast-3d-aware-image-synthesis-with","slug":"voxgraf-fast-3d-aware-image-synthesis-with","title":"VoxGRAF: Fast 3D-Aware Image Synthesis with Sparse Voxel Grids","date":"2022-06-15","arxiv_id":"2206.07695","n_code_links":1,"syntology":{"ran":17,"of":18,"n_ran_checked":15,"n_instrument":2,"unverified":1,"pointer_only":6,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["autonomousvision/voxgraf"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"atrial-fibrillation-detection-using-weight","title":"Atrial Fibrillation Detection Using Weight-Pruned, Log-Quantised Convolutional Neural Networks","date":"2022-06-14","arxiv_id":"2206.07649","n_code_links":0,"syntology":null},{"paper":"/paper/zeroth-order-topological-insights-into","slug":"zeroth-order-topological-insights-into","title":"Zeroth-Order Topological Insights into Iterative Magnitude Pruning","date":"2022-06-14","arxiv_id":"2206.06563","n_code_links":1,"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/energy-consumption-analysis-of-pruned","slug":"energy-consumption-analysis-of-pruned","title":"Energy Consumption Analysis of pruned Semantic Segmentation Networks on an Embedded GPU","date":"2022-06-13","arxiv_id":"2206.06255","n_code_links":1,"syntology":null},{"paper":"/paper/leveraging-structured-pruning-of","slug":"leveraging-structured-pruning-of","title":"Leveraging Structured Pruning of Convolutional Neural Networks","date":"2022-06-13","arxiv_id":"2206.06247","n_code_links":1,"syntology":null},{"paper":null,"slug":"pac-net-a-model-pruning-approach-to-inductive","title":"PAC-Net: A Model Pruning Approach to Inductive Transfer Learning","date":"2022-06-12","arxiv_id":"2206.05703","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-theoretical-understanding-of-neural-network","title":"A Theoretical Understanding of Neural Network Compression from Sparse Linear Approximation","date":"2022-06-11","arxiv_id":"2206.05604","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-general-framework-for-proving-the","title":"A General Framework For Proving The Equivariant Strong Lottery Ticket Hypothesis","date":"2022-06-09","arxiv_id":"2206.04270","n_code_links":0,"syntology":null},{"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":null,"slug":"hidenseek-federated-lottery-ticket-via-server","title":"HideNseek: Federated Lottery Ticket via Server-side Pruning and Sign Supermask","date":"2022-06-09","arxiv_id":"2206.04385","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-target-sequential-rules","title":"Towards Target Sequential Rules","date":"2022-06-09","arxiv_id":"2206.04728","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-network-compression-via-effective","title":"Neural Network Compression via Effective Filter Analysis and Hierarchical Pruning","date":"2022-06-07","arxiv_id":"2206.03596","n_code_links":0,"syntology":null},{"paper":null,"slug":"recall-distortion-in-neural-network-pruning","title":"Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithm","date":"2022-06-07","arxiv_id":"2206.02976","n_code_links":0,"syntology":null},{"paper":null,"slug":"promissing-pruning-missing-values-in-neural-1","title":"PROMISSING: Pruning Missing Values in Neural Networks","date":"2022-06-03","arxiv_id":"2206.01640","n_code_links":0,"syntology":null},{"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/pruning-as-search-efficient-neural","slug":"pruning-as-search-efficient-neural","title":"Pruning-as-Search: Efficient Neural Architecture Search via Channel Pruning and Structural Reparameterization","date":"2022-06-02","arxiv_id":"2206.01198","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":null}}],"record_sha256":"217205e8499837360178604ea6e5a69395138287a7c9d79c4d76981dd2f3ab42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}