{"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/25","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":25,"pages_in_order":39,"rows_per_page":100,"rows":[2401,2500],"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/24","next":"/method/pruning/papers/26","papers":[{"paper":null,"slug":"an-efficient-pruning-process-with-locality","title":"An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching","date":"2021-12-22","arxiv_id":"2112.11736","n_code_links":0,"syntology":null},{"paper":null,"slug":"load-balanced-gather-scatter-patterns-for","title":"Load-balanced Gather-scatter Patterns for Sparse Deep Neural Networks","date":"2021-12-20","arxiv_id":"2112.10898","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-causal-inference-for-data-free-structured","title":"On Causal Inference for Data-free Structured Pruning","date":"2021-12-19","arxiv_id":"2112.10229","n_code_links":0,"syntology":null},{"paper":"/paper/cgspan-closed-graph-based-substructure","slug":"cgspan-closed-graph-based-substructure","title":"cgSpan: Closed Graph-Based Substructure Pattern Mining","date":"2021-12-17","arxiv_id":"2112.09573","n_code_links":1,"syntology":null},{"paper":null,"slug":"interpretable-data-based-explanations-for","title":"Interpretable Data-Based Explanations for Fairness Debugging","date":"2021-12-17","arxiv_id":"2112.09745","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-win-lottery-tickets-in-bert","title":"Learning to Win Lottery Tickets in BERT Transfer via Task-agnostic Mask Training","date":"2021-12-17","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/a-static-analyzer-for-detecting-tensor-shape","slug":"a-static-analyzer-for-detecting-tensor-shape","title":"A Static Analyzer for Detecting Tensor Shape Errors in Deep Neural Network Training Code","date":"2021-12-16","arxiv_id":"2112.09037","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-experimental-study-of-the-impact-of-pre","title":"An Experimental Study of the Impact of Pre-training on the Pruning of a Convolutional Neural Network","date":"2021-12-15","arxiv_id":"2112.08227","n_code_links":0,"syntology":null},{"paper":null,"slug":"predicting-the-utility-of-search-spaces-for","title":"Predicting the utility of search spaces for black-box optimization:a simple, budget-aware approach","date":"2021-12-15","arxiv_id":"2112.08250","n_code_links":0,"syntology":null},{"paper":"/paper/from-dense-to-sparse-contrastive-pruning-for","slug":"from-dense-to-sparse-contrastive-pruning-for","title":"From Dense to Sparse: Contrastive Pruning for Better Pre-trained Language Model Compression","date":"2021-12-14","arxiv_id":"2112.07198","n_code_links":2,"syntology":null},{"paper":null,"slug":"joint-3d-object-detection-and-tracking-using","title":"Joint 3D Object Detection and Tracking Using Spatio-Temporal Representation of Camera Image and LiDAR Point Clouds","date":"2021-12-14","arxiv_id":"2112.07116","n_code_links":0,"syntology":null},{"paper":"/paper/massive-scale-decoding-for-text-generation","slug":"massive-scale-decoding-for-text-generation","title":"Massive-scale Decoding for Text Generation using Lattices","date":"2021-12-14","arxiv_id":"2112.07660","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-coherent-integrated-photonic-neural","title":"Pruning Coherent Integrated Photonic Neural Networks Using the Lottery Ticket Hypothesis","date":"2021-12-14","arxiv_id":"2112.07485","n_code_links":0,"syntology":null},{"paper":null,"slug":"snf-filter-pruning-via-searching-the-proper","title":"SNF: Filter Pruning via Searching the Proper Number of Filters","date":"2021-12-14","arxiv_id":"2112.07282","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-study-on-token-pruning-for-colbert","title":"A Study on Token Pruning for ColBERT","date":"2021-12-13","arxiv_id":"2112.06540","n_code_links":0,"syntology":null},{"paper":null,"slug":"achieving-low-complexity-neural-decoders-via","title":"Achieving Low Complexity Neural Decoders via Iterative Pruning","date":"2021-12-11","arxiv_id":"2112.06044","n_code_links":0,"syntology":null},{"paper":null,"slug":"champ-coherent-hardware-aware-magnitude","title":"CHAMP: Coherent Hardware-Aware Magnitude Pruning of Integrated Photonic Neural Networks","date":"2021-12-11","arxiv_id":"2112.06098","n_code_links":0,"syntology":null},{"paper":"/paper/network-compression-via-central-filter","slug":"network-compression-via-central-filter","title":"Network Compression via Central Filter","date":"2021-12-10","arxiv_id":"2112.05493","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-pretrained-encoders-with-a-multitask","title":"Pruning Pretrained Encoders with a Multitask Objective","date":"2021-12-10","arxiv_id":"2112.05705","n_code_links":0,"syntology":null},{"paper":"/paper/boosting-deep-ensemble-performance-with","slug":"boosting-deep-ensemble-performance-with","title":"Boosting Deep Ensemble Performance with Hierarchical Pruning","date":"2021-12-07","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"enhanced-exploration-in-neural-feature","title":"Enhanced Exploration in Neural Feature Selection for Deep Click-Through Rate Prediction Models via Ensemble of Gating Layers","date":"2021-12-07","arxiv_id":"2112.03487","n_code_links":0,"syntology":null},{"paper":"/paper/i-spasp-structured-neural-pruning-via-sparse","slug":"i-spasp-structured-neural-pruning-via-sparse","title":"i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery","date":"2021-12-07","arxiv_id":"2112.04905","n_code_links":1,"syntology":null},{"paper":"/paper/shrimp-sparser-random-feature-models-via","slug":"shrimp-sparser-random-feature-models-via","title":"SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning","date":"2021-12-07","arxiv_id":"2112.04002","n_code_links":1,"syntology":null},{"paper":"/paper/interpretable-image-classification-with","slug":"interpretable-image-classification-with","title":"Interpretable Image Classification with Differentiable Prototypes Assignment","date":"2021-12-06","arxiv_id":"2112.02902","n_code_links":1,"syntology":null},{"paper":"/paper/jointlk-joint-reasoning-with-language-models","slug":"jointlk-joint-reasoning-with-language-models","title":"JointLK: Joint Reasoning with Language Models and Knowledge Graphs for Commonsense Question Answering","date":"2021-12-06","arxiv_id":"2112.02732","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":["yueqing-sun/jointlk"],"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":"inf-cp-a-reliable-channel-pruning-based-on","title":"Inf-CP: A Reliable Channel Pruning based on Channel Influence","date":"2021-12-05","arxiv_id":"2112.02521","n_code_links":0,"syntology":null},{"paper":"/paper/training-structured-neural-networks-through-1","slug":"training-structured-neural-networks-through-1","title":"Training Structured Neural Networks Through Manifold Identification and Variance Reduction","date":"2021-12-05","arxiv_id":"2112.02612","n_code_links":2,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["zihsyuan1214/rmda"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/logic-shrinkage-learned-fpga-netlist-sparsity","slug":"logic-shrinkage-learned-fpga-netlist-sparsity","title":"Logic Shrinkage: Learned FPGA Netlist Sparsity for Efficient Neural Network Inference","date":"2021-12-04","arxiv_id":"2112.02346","n_code_links":1,"syntology":null},{"paper":null,"slug":"challenges-and-opportunities-in-approximate","title":"Challenges and Opportunities in Approximate Bayesian Deep Learning for Intelligent IoT Systems","date":"2021-12-03","arxiv_id":"2112.01675","n_code_links":0,"syntology":null},{"paper":null,"slug":"batch-normalization-tells-you-which-filter-is","title":"Batch Normalization Tells You Which Filter is Important","date":"2021-12-02","arxiv_id":"2112.01155","n_code_links":0,"syntology":null},{"paper":null,"slug":"enginekgi-closed-loop-knowledge-graph","title":"Perform Like an Engine: A Closed-Loop Neural-Symbolic Learning Framework for Knowledge Graph Inference","date":"2021-12-02","arxiv_id":"2112.01040","n_code_links":0,"syntology":null},{"paper":null,"slug":"putting-3d-spatially-sparse-networks-on-a","title":"Putting 3D Spatially Sparse Networks on a Diet","date":"2021-12-02","arxiv_id":"2112.01316","n_code_links":0,"syntology":null},{"paper":"/paper/aligned-structured-sparsity-learning-for","slug":"aligned-structured-sparsity-learning-for","title":"Aligned Structured Sparsity Learning for Efficient Image Super-Resolution","date":"2021-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"differentiable-synthesis-of-program","title":"Differentiable Synthesis of Program Architectures","date":"2021-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/dominosearch-find-layer-wise-fine-grained-n-m","slug":"dominosearch-find-layer-wise-fine-grained-n-m","title":"DominoSearch: Find layer-wise fine-grained N:M sparse schemes from dense neural networks","date":"2021-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"effective-and-efficient-structure-learning","title":"Effective and efficient structure learning with pruning and model averaging strategies","date":"2021-12-01","arxiv_id":"2112.00398","n_code_links":0,"syntology":null},{"paper":null,"slug":"red-looking-for-redundancies-for-data","title":"RED : Looking for Redundancies for Data-FreeStructured Compression of Deep Neural Networks","date":"2021-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"validating-the-lottery-ticket-hypothesis-with","title":"Validating the Lottery Ticket Hypothesis with Inertial Manifold Theory","date":"2021-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"a-highly-effective-low-rank-compression-of","title":"A Highly Effective Low-Rank Compression of Deep Neural Networks with Modified Beam-Search and Modified Stable Rank","date":"2021-11-30","arxiv_id":"2111.15179","n_code_links":0,"syntology":null},{"paper":"/paper/a-unified-pruning-framework-for-vision","slug":"a-unified-pruning-framework-for-vision","title":"A Unified Pruning Framework for Vision Transformers","date":"2021-11-30","arxiv_id":"2111.15127","n_code_links":1,"syntology":null},{"paper":null,"slug":"anomaly-rule-detection-in-sequence-data","title":"Anomaly Rule Detection in Sequence Data","date":"2021-11-29","arxiv_id":"2111.15026","n_code_links":0,"syntology":null},{"paper":"/paper/conceptually-diverse-base-model-selection-for","slug":"conceptually-diverse-base-model-selection-for","title":"Conceptually Diverse Base Model Selection for Meta-Learners in Concept Drifting Data Streams","date":"2021-11-29","arxiv_id":"2111.14520","n_code_links":1,"syntology":null},{"paper":"/paper/feature-gate-coupling-for-dynamic-network","slug":"feature-gate-coupling-for-dynamic-network","title":"Self-supervised Feature-Gate Coupling for Dynamic Network Pruning","date":"2021-11-29","arxiv_id":"2111.14302","n_code_links":1,"syntology":null},{"paper":null,"slug":"self-training-of-halfspaces-with","title":"Self-Training of Halfspaces with Generalization Guarantees under Massart Mislabeling Noise Model","date":"2021-11-29","arxiv_id":"2111.14427","n_code_links":0,"syntology":null},{"paper":null,"slug":"us-rule-discovering-utility-driven-sequential","title":"US-Rule: Discovering Utility-driven Sequential Rules","date":"2021-11-29","arxiv_id":"2111.15020","n_code_links":0,"syntology":null},{"paper":null,"slug":"enabling-super-fast-deep-learning-on-tiny","title":"Enabling Fast Deep Learning on Tiny Energy-Harvesting IoT Devices","date":"2021-11-28","arxiv_id":"2111.14051","n_code_links":0,"syntology":null},{"paper":"/paper/how-well-do-sparse-imagenet-models-transfer","slug":"how-well-do-sparse-imagenet-models-transfer","title":"How Well Do Sparse Imagenet Models Transfer?","date":"2021-11-26","arxiv_id":"2111.13445","n_code_links":1,"syntology":null},{"paper":null,"slug":"accelerating-deep-learning-with-dynamic-data","title":"Accelerating Deep Learning with Dynamic Data Pruning","date":"2021-11-24","arxiv_id":"2111.12621","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-self-attentions-into-convolutional","slug":"pruning-self-attentions-into-convolutional","title":"Pruning Self-attentions into Convolutional Layers in Single Path","date":"2021-11-23","arxiv_id":"2111.11802","n_code_links":3,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["zhuang-group/spvit","zip-group/spvit","ziplab/spvit"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/weight-pruning-and-uncertainty-in-radio","slug":"weight-pruning-and-uncertainty-in-radio","title":"Weight Pruning and Uncertainty in Radio Galaxy Classification","date":"2021-11-23","arxiv_id":"2111.11654","n_code_links":1,"syntology":null},{"paper":null,"slug":"automatic-mapping-of-the-best-suited-dnn","title":"Automatic Mapping of the Best-Suited DNN Pruning Schemes for Real-Time Mobile Acceleration","date":"2021-11-22","arxiv_id":"2111.11581","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-existence-of-universal-lottery-tickets-1","slug":"on-the-existence-of-universal-lottery-tickets-1","title":"On the Existence of Universal Lottery Tickets","date":"2021-11-22","arxiv_id":"2111.11146","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["relationalml/universallt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/plant-n-seek-can-you-find-the-winning-ticket-1","slug":"plant-n-seek-can-you-find-the-winning-ticket-1","title":"Plant 'n' Seek: Can You Find the Winning Ticket?","date":"2021-11-22","arxiv_id":"2111.11153","n_code_links":1,"syntology":null},{"paper":"/paper/automatic-neural-network-pruning-that","slug":"automatic-neural-network-pruning-that","title":"Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracy","date":"2021-11-18","arxiv_id":"2111.09635","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["nota-github/autobot_aaai23"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-effectiveness-of-sparsification-for","slug":"on-the-effectiveness-of-sparsification-for","title":"DICE: Leveraging Sparsification for Out-of-Distribution Detection","date":"2021-11-18","arxiv_id":"2111.09805","n_code_links":1,"syntology":{"ran":17,"of":19,"n_ran_checked":10,"n_instrument":7,"unverified":2,"pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","official":{"repos":["deeplearning-wisc/dice"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"universal-efficient-variable-rate-neural","title":"Universal Efficient Variable-rate Neural Image Compression","date":"2021-11-18","arxiv_id":"2111.11305","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaprune-pruning-transformer-with-sparse","title":"AdaPrune: Pruning Transformer with Sparse Regularization","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"aligned-weight-regularizers-for-pruning","title":"Aligned Weight Regularizers for Pruning Pretrained Neural Networks","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"neuron-based-pruning-of-deep-neural-networks","title":"Neuron-based Pruning of Deep Neural Networks with Better Generalization using Kronecker Factored Curvature Approximation","date":"2021-11-16","arxiv_id":"2111.08577","n_code_links":0,"syntology":null},{"paper":null,"slug":"program-transfer-for-answering-complex","title":"Program Transfer for Answering Complex Questions over Knowledge Bases","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"self-competitive-learning-for-solving-math","title":"Self-Competitive Learning for Solving Math Word Problem","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"self-distilled-pruning-of-neural-networks-1","title":"Self-Distilled Pruning of Neural Networks","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-progressive-distillation-resolving-1","title":"Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigm","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-pruning-learns-compact-and","title":"Structured Pruning Learns Compact and Accurate Models","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/alphagarden-learning-to-autonomously-tend-a","slug":"alphagarden-learning-to-autonomously-tend-a","title":"AlphaGarden: Learning to Autonomously Tend a Polyculture Garden","date":"2021-11-11","arxiv_id":"2111.06014","n_code_links":1,"syntology":null},{"paper":null,"slug":"lsp-acceleration-and-regularization-of-graph-1","title":"LSP : Acceleration and Regularization of Graph Neural Networks via Locality Sensitive Pruning of Graphs","date":"2021-11-10","arxiv_id":"2111.05694","n_code_links":0,"syntology":null},{"paper":"/paper/prune-once-for-all-sparse-pre-trained","slug":"prune-once-for-all-sparse-pre-trained","title":"Prune Once for All: Sparse Pre-Trained Language Models","date":"2021-11-10","arxiv_id":"2111.05754","n_code_links":2,"syntology":null},{"paper":"/paper/can-information-flows-suggest-targets-for","slug":"can-information-flows-suggest-targets-for","title":"Can Information Flows Suggest Targets for Interventions in Neural Circuits?","date":"2021-11-09","arxiv_id":"2111.05299","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["praveenv253/ann-info-flow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/fast-and-scalable-spike-and-slab-variable","slug":"fast-and-scalable-spike-and-slab-variable","title":"Fast and Scalable Spike and Slab Variable Selection in High-Dimensional Gaussian Processes","date":"2021-11-08","arxiv_id":"2111.04558","n_code_links":1,"syntology":null},{"paper":null,"slug":"solving-marginal-map-exactly-by-probabilistic","title":"Solving Marginal MAP Exactly by Probabilistic Circuit Transformations","date":"2021-11-08","arxiv_id":"2111.04833","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-approach-to-coreset-learning","title":"A Unified Approach to Coreset Learning","date":"2021-11-04","arxiv_id":"2111.03044","n_code_links":0,"syntology":null},{"paper":"/paper/neural-network-is-heterogeneous-phase-matters","slug":"neural-network-is-heterogeneous-phase-matters","title":"Neural network is heterogeneous: Phase matters more","date":"2021-11-03","arxiv_id":"2111.02014","n_code_links":1,"syntology":null},{"paper":null,"slug":"weight-block-or-unit-exploring-sparsity","title":"Weight, Block or Unit? Exploring Sparsity Tradeoffs for Speech Enhancement on Tiny Neural Accelerators","date":"2021-11-03","arxiv_id":"2111.02351","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-rank-sparse-tensor-compression-for-neural","title":"Low-Rank+Sparse Tensor Compression for Neural Networks","date":"2021-11-02","arxiv_id":"2111.01697","n_code_links":0,"syntology":null},{"paper":"/paper/back-to-basics-efficient-network-compression-1","slug":"back-to-basics-efficient-network-compression-1","title":"How I Learned to Stop Worrying and Love Retraining","date":"2021-11-01","arxiv_id":"2111.00843","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-dialogue-complementary-policy","title":"Efficient Dialogue Complementary Policy Learning via Deep Q-network Policy and Episodic Memory Policy","date":"2021-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/efficient-machine-translation-with-model","slug":"efficient-machine-translation-with-model","title":"Efficient Machine Translation with Model Pruning and Quantization","date":"2021-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-pruned-structure-and-weights","title":"Learning Pruned Structure and Weights Simultaneously from Scratch: an Attention based Approach","date":"2021-11-01","arxiv_id":"2111.02399","n_code_links":0,"syntology":null},{"paper":"/paper/less-is-more-domain-adaptation-with-lottery","slug":"less-is-more-domain-adaptation-with-lottery","title":"Less Is More: Domain Adaptation with Lottery Ticket for Reading Comprehension","date":"2021-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-neural-machine-translation-for-speed","title":"Pruning Neural Machine Translation for Speed Using Group Lasso","date":"2021-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"classification-of-fetal-compromise-during","title":"Classification of fetal compromise during labour: signal processing and feature engineering of the cardiotocograph","date":"2021-10-31","arxiv_id":"2111.00517","n_code_links":0,"syntology":null},{"paper":null,"slug":"magic-pyramid-accelerating-inference-with","title":"Magic Pyramid: Accelerating Inference with Early Exiting and Token Pruning","date":"2021-10-30","arxiv_id":"2111.00230","n_code_links":0,"syntology":null},{"paper":null,"slug":"targetum-targeted-high-utility-itemset","title":"TargetUM: Targeted High-Utility Itemset Querying","date":"2021-10-30","arxiv_id":"2111.00309","n_code_links":0,"syntology":null},{"paper":"/paper/bittrain-sparse-bitmap-compression-for-memory","slug":"bittrain-sparse-bitmap-compression-for-memory","title":"BitTrain: Sparse Bitmap Compression for Memory-Efficient Training on the Edge","date":"2021-10-29","arxiv_id":"2110.15362","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-operator-theoretic-perspective-on-pruning","title":"An Operator Theoretic View on Pruning Deep Neural Networks","date":"2021-10-28","arxiv_id":"2110.14856","n_code_links":0,"syntology":null},{"paper":null,"slug":"nxmtransformer-semi-structured-sparsification","title":"NxMTransformer: Semi-Structured Sparsification for Natural Language Understanding via ADMM","date":"2021-10-28","arxiv_id":"2110.15766","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-attention-heads-of-transformer-models","title":"Pruning Attention Heads of Transformer Models Using A* Search: A Novel Approach to Compress Big NLP Architectures","date":"2021-10-28","arxiv_id":"2110.15225","n_code_links":0,"syntology":null},{"paper":null,"slug":"rgp-neural-network-pruning-through-its","title":"RGP: Neural Network Pruning through Its Regular Graph Structure","date":"2021-10-28","arxiv_id":"2110.15192","n_code_links":0,"syntology":null},{"paper":"/paper/adversarial-neuron-pruning-purifies","slug":"adversarial-neuron-pruning-purifies","title":"Adversarial Neuron Pruning Purifies Backdoored Deep Models","date":"2021-10-27","arxiv_id":"2110.14430","n_code_links":2,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["csdongxian/anp_backdoor"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"fedprune-towards-inclusive-federated-learning","title":"FedPrune: Towards Inclusive Federated Learning","date":"2021-10-27","arxiv_id":"2110.14205","n_code_links":0,"syntology":null},{"paper":"/paper/chip-channel-independence-based-pruning-for","slug":"chip-channel-independence-based-pruning-for","title":"CHIP: CHannel Independence-based Pruning for Compact Neural Networks","date":"2021-10-26","arxiv_id":"2110.13981","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["eclipsess/chip_neurips2021"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"network-compression-and-faster-inference","title":"Reconstructing Pruned Filters using Cheap Spatial Transformations","date":"2021-10-25","arxiv_id":"2110.12844","n_code_links":0,"syntology":null},{"paper":"/paper/exploring-gradient-flow-based-saliency-for","slug":"exploring-gradient-flow-based-saliency-for","title":"Exploring Gradient Flow Based Saliency for DNN Model Compression","date":"2021-10-24","arxiv_id":"2110.12477","n_code_links":1,"syntology":null},{"paper":null,"slug":"spatio-temporal-graph-complementary","title":"Spatio-Temporal Graph Complementary Scattering Networks","date":"2021-10-23","arxiv_id":"2110.12150","n_code_links":0,"syntology":null},{"paper":"/paper/federated-unlearning-via-class-discriminative","slug":"federated-unlearning-via-class-discriminative","title":"Federated Unlearning via Class-Discriminative Pruning","date":"2021-10-22","arxiv_id":"2110.11794","n_code_links":1,"syntology":null},{"paper":null,"slug":"probabilistic-fine-tuning-of-pruning-masks","title":"Probabilistic fine-tuning of pruning masks and PAC-Bayes self-bounded learning","date":"2021-10-22","arxiv_id":"2110.11804","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-to-prune-a-policy-towards-early","title":"When to Prune? A Policy towards Early Structural Pruning","date":"2021-10-22","arxiv_id":"2110.12007","n_code_links":0,"syntology":null},{"paper":null,"slug":"catro-channel-pruning-via-class-aware-trace","title":"CATRO: Channel Pruning via Class-Aware Trace Ratio Optimization","date":"2021-10-21","arxiv_id":"2110.10921","n_code_links":0,"syntology":null},{"paper":null,"slug":"class-discriminative-cnn-compression","title":"Class-Discriminative CNN Compression","date":"2021-10-21","arxiv_id":"2110.10864","n_code_links":0,"syntology":null},{"paper":null,"slug":"evolving-transferable-pruning-functions","title":"Evolving Transferable Neural Pruning Functions","date":"2021-10-21","arxiv_id":"2110.10876","n_code_links":0,"syntology":null}],"record_sha256":"3237406695a73c239275327d8301dacae55e71c7c1aa9c8836512b7347446af2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}