{"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/27","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":27,"pages_in_order":39,"rows_per_page":100,"rows":[2601,2700],"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/26","next":"/method/pruning/papers/28","papers":[{"paper":null,"slug":"a-fast-pc-algorithm-with-reversed-order","title":"A Fast PC Algorithm with Reversed-order Pruning and A Parallelization Strategy","date":"2021-09-10","arxiv_id":"2109.04626","n_code_links":0,"syntology":null},{"paper":"/paper/block-pruning-for-faster-transformers","slug":"block-pruning-for-faster-transformers","title":"Block Pruning For Faster Transformers","date":"2021-09-10","arxiv_id":"2109.04838","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-collective-intelligence-learning","slug":"dynamic-collective-intelligence-learning","title":"Dynamic Collective Intelligence Learning: Finding Efficient Sparse Model via Refined Gradients for Pruned Weights","date":"2021-09-10","arxiv_id":"2109.04660","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-compression-of-neural-networks-using","title":"On the Compression of Neural Networks Using $\\ell_0$-Norm Regularization and Weight Pruning","date":"2021-09-10","arxiv_id":"2109.05075","n_code_links":0,"syntology":null},{"paper":"/paper/adabmdca-adaptive-boltzmann-machine-learning","slug":"adabmdca-adaptive-boltzmann-machine-learning","title":"adabmDCA: Adaptive Boltzmann machine learning for biological sequences","date":"2021-09-09","arxiv_id":"2109.04105","n_code_links":2,"syntology":null},{"paper":"/paper/word-level-coreference-resolution","slug":"word-level-coreference-resolution","title":"Word-Level Coreference Resolution","date":"2021-09-09","arxiv_id":"2109.04127","n_code_links":1,"syntology":null},{"paper":null,"slug":"juvenile-state-hypothesis-what-we-can-learn","title":"Juvenile state hypothesis: What we can learn from lottery ticket hypothesis researches?","date":"2021-09-08","arxiv_id":"2109.03862","n_code_links":0,"syntology":null},{"paper":null,"slug":"gdp-stabilized-neural-network-pruning-via","title":"GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarization","date":"2021-09-06","arxiv_id":"2109.02220","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-topological-framework-for-the-design-of","title":"Using Topological Framework for the Design of Activation Function and Model Pruning in Deep Neural Networks","date":"2021-09-03","arxiv_id":"2109.01572","n_code_links":0,"syntology":null},{"paper":null,"slug":"architecture-aware-latency-constrained-sparse","title":"Architecture Aware Latency Constrained Sparse Neural Networks","date":"2021-09-01","arxiv_id":"2109.00170","n_code_links":0,"syntology":null},{"paper":"/paper/does-local-pruning-offer-task-specific-models","slug":"does-local-pruning-offer-task-specific-models","title":"Does local pruning offer task-specific models to learn effectively ?","date":"2021-09-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"aip-adversarial-iterative-pruning-based-on","title":"AIP: Adversarial Iterative Pruning Based on Knowledge Transfer for Convolutional Neural Networks","date":"2021-08-31","arxiv_id":"2108.13591","n_code_links":0,"syntology":null},{"paper":null,"slug":"multistage-pruning-of-cnn-based-ecg","title":"Multistage Pruning of CNN Based ECG Classifiers for Edge Devices","date":"2021-08-31","arxiv_id":"2109.00516","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-with-compensation-efficient-channel","slug":"pruning-with-compensation-efficient-channel","title":"Pruning with Compensation: Efficient Channel Pruning for Deep Convolutional Neural Networks","date":"2021-08-31","arxiv_id":"2108.13728","n_code_links":1,"syntology":null},{"paper":"/paper/compact-representations-of-convolutional","slug":"compact-representations-of-convolutional","title":"Compact representations of convolutional neural networks via weight pruning and quantization","date":"2021-08-28","arxiv_id":"2108.12704","n_code_links":1,"syntology":null},{"paper":null,"slug":"layer-wise-model-pruning-based-on-mutual","title":"Layer-wise Model Pruning based on Mutual Information","date":"2021-08-28","arxiv_id":"2108.12594","n_code_links":0,"syntology":null},{"paper":"/paper/threshold-pruning-tool-for-densely-connected","slug":"threshold-pruning-tool-for-densely-connected","title":"New Pruning Method Based on DenseNet Network for Image Classification","date":"2021-08-28","arxiv_id":"2108.12604","n_code_links":0,"syntology":null},{"paper":null,"slug":"somtimes-self-organizing-maps-for-time-series","title":"SOMTimeS: Self Organizing Maps for Time Series Clustering and its Application to Serious Illness Conversations","date":"2021-08-26","arxiv_id":"2108.11523","n_code_links":0,"syntology":null},{"paper":null,"slug":"grim-a-general-real-time-deep-learning","title":"GRIM: A General, Real-Time Deep Learning Inference Framework for Mobile Devices based on Fine-Grained Structured Weight Sparsity","date":"2021-08-25","arxiv_id":"2108.11033","n_code_links":0,"syntology":null},{"paper":null,"slug":"layer-adaptive-node-selection-in-bayesian","title":"Layer Adaptive Node Selection in Bayesian Neural Networks: Statistical Guarantees and Implementation Details","date":"2021-08-25","arxiv_id":"2108.11000","n_code_links":0,"syntology":null},{"paper":"/paper/somnnet-an-spo2-based-deep-learning-network","slug":"somnnet-an-spo2-based-deep-learning-network","title":"SomnNET: An SpO2 Based Deep Learning Network for Sleep Apnea Detection in Smartwatches","date":"2021-08-25","arxiv_id":"2108.11468","n_code_links":1,"syntology":null},{"paper":null,"slug":"small-object-detection-based-on-modified-fssd","title":"Small Object Detection Based on Modified FSSD and Model Compression","date":"2021-08-24","arxiv_id":"2108.10503","n_code_links":0,"syntology":null},{"paper":"/paper/query-embedding-pruning-for-dense-retrieval","slug":"query-embedding-pruning-for-dense-retrieval","title":"Query Embedding Pruning for Dense Retrieval","date":"2021-08-23","arxiv_id":"2108.10341","n_code_links":1,"syntology":null},{"paper":null,"slug":"generalizing-rnn-transducer-to-out-domain","title":"Generalizing RNN-Transducer to Out-Domain Audio via Sparse Self-Attention Layers","date":"2021-08-22","arxiv_id":"2108.10752","n_code_links":0,"syntology":null},{"paper":"/paper/an-information-theory-inspired-strategy-for","slug":"an-information-theory-inspired-strategy-for","title":"An Information Theory-inspired Strategy for Automatic Network Pruning","date":"2021-08-19","arxiv_id":"2108.08532","n_code_links":1,"syntology":null},{"paper":"/paper/pruning-in-the-face-of-adversaries","slug":"pruning-in-the-face-of-adversaries","title":"Pruning in the Face of Adversaries","date":"2021-08-19","arxiv_id":"2108.08560","n_code_links":1,"syntology":null},{"paper":null,"slug":"achieving-on-mobile-real-time-super","title":"Achieving on-Mobile Real-Time Super-Resolution with Neural Architecture and Pruning Search","date":"2021-08-18","arxiv_id":"2108.08910","n_code_links":0,"syntology":null},{"paper":null,"slug":"contributions-of-transformer-attention-heads","title":"Contributions of Transformer Attention Heads in Multi- and Cross-lingual Tasks","date":"2021-08-18","arxiv_id":"2108.08375","n_code_links":0,"syntology":null},{"paper":null,"slug":"scaling-laws-for-deep-learning","title":"Scaling Laws for Deep Learning","date":"2021-08-17","arxiv_id":"2108.07686","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-structured-dynamic-sparse-pre","title":"Towards Structured Dynamic Sparse Pre-Training of BERT","date":"2021-08-13","arxiv_id":"2108.06277","n_code_links":0,"syntology":null},{"paper":null,"slug":"binary-complex-neural-network-acceleration-on","title":"Binary Complex Neural Network Acceleration on FPGA","date":"2021-08-10","arxiv_id":"2108.04811","n_code_links":0,"syntology":null},{"paper":"/paper/differentiable-subset-pruning-of-transformer","slug":"differentiable-subset-pruning-of-transformer","title":"Differentiable Subset Pruning of Transformer Heads","date":"2021-08-10","arxiv_id":"2108.04657","n_code_links":2,"syntology":null},{"paper":null,"slug":"on-the-effect-of-pruning-on-adversarial","title":"On the Effect of Pruning on Adversarial Robustness","date":"2021-08-10","arxiv_id":"2108.04890","n_code_links":0,"syntology":null},{"paper":"/paper/training-of-deep-residual-networks-with","slug":"training-of-deep-residual-networks-with","title":"Training of deep residual networks with stochastic MG/OPT","date":"2021-08-09","arxiv_id":"2108.04052","n_code_links":1,"syntology":null},{"paper":null,"slug":"basis-scaling-and-double-pruning-for","title":"Basis Scaling and Double Pruning for Efficient Inference in Network-Based Transfer Learning","date":"2021-08-06","arxiv_id":"2108.02893","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentially-private-n-gram-extraction","title":"Differentially Private n-gram Extraction","date":"2021-08-05","arxiv_id":"2108.02831","n_code_links":0,"syntology":null},{"paper":null,"slug":"growing-an-architecture-for-a-neural-network","title":"Growing an architecture for a neural network","date":"2021-08-04","arxiv_id":"2108.02231","n_code_links":0,"syntology":null},{"paper":null,"slug":"spartus-a-9-4-top-s-fpga-based-lstm","title":"Spartus: A 9.4 TOp/s FPGA-based LSTM Accelerator Exploiting Spatio-Temporal Sparsity","date":"2021-08-04","arxiv_id":"2108.02297","n_code_links":0,"syntology":null},{"paper":"/paper/amortized-neural-networks-for-low-latency","slug":"amortized-neural-networks-for-low-latency","title":"Amortized Neural Networks for Low-Latency Speech Recognition","date":"2021-08-03","arxiv_id":"2108.01553","n_code_links":0,"syntology":null},{"paper":"/paper/evo-vit-slow-fast-token-evolution-for-dynamic","slug":"evo-vit-slow-fast-token-evolution-for-dynamic","title":"Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer","date":"2021-08-03","arxiv_id":"2108.01390","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":7,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 3 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["YifanXu74/Evo-ViT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/where-do-models-go-wrong-parameter-space","slug":"where-do-models-go-wrong-parameter-space","title":"Where do Models go Wrong? Parameter-Space Saliency Maps for Explainability","date":"2021-08-03","arxiv_id":"2108.01335","n_code_links":1,"syntology":null},{"paper":"/paper/group-fisher-pruning-for-practical-network","slug":"group-fisher-pruning-for-practical-network","title":"Group Fisher Pruning for Practical Network Compression","date":"2021-08-02","arxiv_id":"2108.00708","n_code_links":2,"syntology":null},{"paper":"/paper/dependency-driven-relation-extraction-with","slug":"dependency-driven-relation-extraction-with","title":"Dependency-driven Relation Extraction with Attentive Graph Convolutional Networks","date":"2021-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"provably-efficient-lottery-ticket-discovery","title":"How much pre-training is enough to discover a good subnetwork?","date":"2021-07-31","arxiv_id":"2108.00259","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-optimizers-with-sparse-group-lasso-1","slug":"adaptive-optimizers-with-sparse-group-lasso-1","title":"Adaptive Optimizers with Sparse Group Lasso for Neural Networks in CTR Prediction","date":"2021-07-30","arxiv_id":"2107.14432","n_code_links":2,"syntology":null},{"paper":null,"slug":"cops-controlled-pruning-before-training","title":"COPS: Controlled Pruning Before Training Starts","date":"2021-07-27","arxiv_id":"2107.12673","n_code_links":0,"syntology":null},{"paper":"/paper/experiments-on-properties-of-hidden","slug":"experiments-on-properties-of-hidden","title":"Experiments on Properties of Hidden Structures of Sparse Neural Networks","date":"2021-07-27","arxiv_id":"2107.12917","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-word-recognition-in-speech","title":"Improving Word Recognition in Speech Transcriptions by Decision-level Fusion of Stemming and Two-way Phoneme Pruning","date":"2021-07-26","arxiv_id":"2107.12428","n_code_links":0,"syntology":null},{"paper":"/paper/learning-span-level-interactions-for-aspect","slug":"learning-span-level-interactions-for-aspect","title":"Learning Span-Level Interactions for Aspect Sentiment Triplet Extraction","date":"2021-07-26","arxiv_id":"2107.12214","n_code_links":2,"syntology":null},{"paper":null,"slug":"pruning-ternary-quantization","title":"Pruning Ternary Quantization","date":"2021-07-23","arxiv_id":"2107.10998","n_code_links":0,"syntology":null},{"paper":"/paper/quantumnas-noise-adaptive-search-for-robust","slug":"quantumnas-noise-adaptive-search-for-robust","title":"QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits","date":"2021-07-22","arxiv_id":"2107.10845","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["mit-han-lab/pytorch-quantum","mit-han-lab/torchquantum"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/more-parameters-no-thanks","slug":"more-parameters-no-thanks","title":"More Parameters? No Thanks!","date":"2021-07-20","arxiv_id":"2107.09622","n_code_links":1,"syntology":null},{"paper":null,"slug":"what-do-you-get-when-you-cross-beam-search","title":"What Do You Get When You Cross Beam Search with Nucleus Sampling?","date":"2021-07-20","arxiv_id":"2107.09729","n_code_links":0,"syntology":null},{"paper":"/paper/continual-learning-for-task-oriented-dialogue","slug":"continual-learning-for-task-oriented-dialogue","title":"Continual Learning for Task-oriented Dialogue System with Iterative Network Pruning, Expanding and Masking","date":"2021-07-17","arxiv_id":"2107.08173","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["siat-nlp/TPEM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"boosting-the-convergence-of-reinforcement","title":"Boosting the Convergence of Reinforcement Learning-based Auto-pruning Using Historical Data","date":"2021-07-16","arxiv_id":"2107.08815","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-low-latency-energy-efficient-deep","title":"Towards Low-Latency Energy-Efficient Deep SNNs via Attention-Guided Compression","date":"2021-07-16","arxiv_id":"2107.12445","n_code_links":0,"syntology":null},{"paper":"/paper/deep-learning-on-a-data-diet-finding","slug":"deep-learning-on-a-data-diet-finding","title":"Deep Learning on a Data Diet: Finding Important Examples Early in Training","date":"2021-07-15","arxiv_id":"2107.07075","n_code_links":1,"syntology":{"ran":19,"of":24,"n_ran_checked":19,"n_instrument":0,"unverified":5,"pointer_only":3,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["mansheej/data_diet"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":19,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/only-train-once-a-one-shot-neural-network","slug":"only-train-once-a-one-shot-neural-network","title":"Only Train Once: A One-Shot Neural Network Training And Pruning Framework","date":"2021-07-15","arxiv_id":"2107.07467","n_code_links":1,"syntology":null},{"paper":null,"slug":"memory-aware-fusing-and-tiling-of-neural","title":"MAFAT: Memory-Aware Fusing and Tiling of Neural Networks for Accelerated Edge Inference","date":"2021-07-14","arxiv_id":"2107.06960","n_code_links":0,"syntology":null},{"paper":"/paper/training-compact-cnns-for-image","slug":"training-compact-cnns-for-image","title":"Training Compact CNNs for Image Classification using Dynamic-coded Filter Fusion","date":"2021-07-14","arxiv_id":"2107.06916","n_code_links":1,"syntology":null},{"paper":null,"slug":"hemp-high-order-entropy-minimization-for","title":"HEMP: High-order Entropy Minimization for neural network comPression","date":"2021-07-12","arxiv_id":"2107.05298","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-directional-pruning-via","title":"Structured Directional Pruning via Perturbation Orthogonal Projection","date":"2021-07-12","arxiv_id":"2107.05328","n_code_links":0,"syntology":null},{"paper":null,"slug":"blending-pruning-criteria-for-convolutional","title":"Blending Pruning Criteria for Convolutional Neural Networks","date":"2021-07-11","arxiv_id":"2107.05033","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-model-pruning-of-convolutional","title":"Structured Model Pruning of Convolutional Networks on Tensor Processing Units","date":"2021-07-09","arxiv_id":"2107.04191","n_code_links":0,"syntology":null},{"paper":"/paper/a-triangle-inequality-for-cosine-similarity","slug":"a-triangle-inequality-for-cosine-similarity","title":"A Triangle Inequality for Cosine Similarity","date":"2021-07-08","arxiv_id":"2107.04071","n_code_links":1,"syntology":null},{"paper":null,"slug":"core-set-sampling-for-efficient-neural","title":"Core-set Sampling for Efficient Neural Architecture Search","date":"2021-07-08","arxiv_id":"2107.06869","n_code_links":0,"syntology":null},{"paper":null,"slug":"weight-reparametrization-for-budget-aware","title":"Weight Reparametrization for Budget-Aware Network Pruning","date":"2021-07-08","arxiv_id":"2107.03909","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-architecture-pruning-for","title":"Differentiable Architecture Pruning for Transfer Learning","date":"2021-07-07","arxiv_id":"2107.03375","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-matrix-free-approximations-of","slug":"efficient-matrix-free-approximations-of","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","date":"2021-07-07","arxiv_id":"2107.03356","n_code_links":2,"syntology":{"ran":7,"of":14,"n_ran_checked":4,"n_instrument":3,"unverified":7,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","official":{"repos":["IST-DASLab/M-FAC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"immunization-of-pruning-attack-in-dnn","title":"Immunization of Pruning Attack in DNN Watermarking Using Constant Weight Code","date":"2021-07-07","arxiv_id":"2107.02961","n_code_links":0,"syntology":null},{"paper":null,"slug":"poslan-disentangling-chat-with-positional-and","title":"POSLAN: Disentangling Chat with Positional and Language encoded Post Embeddings","date":"2021-07-07","arxiv_id":"2107.03529","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalizing-nucleus-recognition-model-in","title":"Generalizing Nucleus Recognition Model in Multi-source Images via Pruning","date":"2021-07-06","arxiv_id":"2107.02500","n_code_links":0,"syntology":null},{"paper":"/paper/connectivity-matters-neural-network-pruning","slug":"connectivity-matters-neural-network-pruning","title":"Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity","date":"2021-07-05","arxiv_id":"2107.02306","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":8,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["avysogorets/effective-sparsity"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/one-cycle-pruning-pruning-convnets-under-a","slug":"one-cycle-pruning-pruning-convnets-under-a","title":"One-Cycle Pruning: Pruning ConvNets Under a Tight Training Budget","date":"2021-07-05","arxiv_id":"2107.02086","n_code_links":1,"syntology":null},{"paper":null,"slug":"why-is-pruning-at-initialization-immune-to","title":"Why is Pruning at Initialization Immune to Reinitializing and Shuffling?","date":"2021-07-05","arxiv_id":"2107.01808","n_code_links":0,"syntology":null},{"paper":"/paper/multi-layer-hebbian-networks-with-modern-deep","slug":"multi-layer-hebbian-networks-with-modern-deep","title":"Hebbian learning with gradients: Hebbian convolutional neural networks with modern deep learning frameworks","date":"2021-07-04","arxiv_id":"2107.01729","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-generalized-lottery-ticket-hypothesis","title":"A Generalized Lottery Ticket Hypothesis","date":"2021-07-03","arxiv_id":"2107.06825","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-lottery-ticket-hypothesis-framework-for-low","title":"A Lottery Ticket Hypothesis Framework for Low-Complexity Device-Robust Neural Acoustic Scene Classification","date":"2021-07-03","arxiv_id":"2107.01461","n_code_links":0,"syntology":null},{"paper":"/paper/learned-token-pruning-for-transformers","slug":"learned-token-pruning-for-transformers","title":"Learned Token Pruning for Transformers","date":"2021-07-02","arxiv_id":"2107.00910","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":9,"n_instrument":1,"unverified":2,"pointer_only":12,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["kssteven418/ltp"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-primal-heuristics-for-mixed-integer","slug":"learning-primal-heuristics-for-mixed-integer","title":"Learning Primal Heuristics for Mixed Integer Programs","date":"2021-07-02","arxiv_id":"2107.00866","n_code_links":1,"syntology":null},{"paper":"/paper/dep-l-0-improving-l-0-based-network","slug":"dep-l-0-improving-l-0-based-network","title":"Dep-$L_0$: Improving $L_0$-based Network Sparsification via Dependency Modeling","date":"2021-06-30","arxiv_id":"2107.00070","n_code_links":1,"syntology":null},{"paper":null,"slug":"achieving-real-time-object-detection-on","title":"Achieving Real-Time Object Detection on MobileDevices with Neural Pruning Search","date":"2021-06-28","arxiv_id":"2106.14943","n_code_links":0,"syntology":null},{"paper":"/paper/false-negative-reduction-in-video-instance","slug":"false-negative-reduction-in-video-instance","title":"False Negative Reduction in Video Instance Segmentation using Uncertainty Estimates","date":"2021-06-28","arxiv_id":"2106.14474","n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptcl-efficient-collaborative-learning-with","title":"AdaptCL: Efficient Collaborative Learning with Dynamic and Adaptive Pruning","date":"2021-06-27","arxiv_id":"2106.14126","n_code_links":0,"syntology":null},{"paper":null,"slug":"pqk-model-compression-via-pruning","title":"PQK: Model Compression via Pruning, Quantization, and Knowledge Distillation","date":"2021-06-25","arxiv_id":"2106.14681","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-automated-knowledge-mining-and-document","title":"An Automated Knowledge Mining and Document Classification System with Multi-model Transfer Learning","date":"2021-06-24","arxiv_id":"2106.12744","n_code_links":0,"syntology":null},{"paper":null,"slug":"atp-net-an-attention-based-ternary-projection","title":"ATP-Net: An Attention-based Ternary Projection Network For Compressed Sensing","date":"2021-06-24","arxiv_id":"2106.12728","n_code_links":0,"syntology":null},{"paper":"/paper/sparse-flows-pruning-continuous-depth-models","slug":"sparse-flows-pruning-continuous-depth-models","title":"Sparse Flows: Pruning Continuous-depth Models","date":"2021-06-24","arxiv_id":"2106.12718","n_code_links":1,"syntology":null},{"paper":"/paper/extreme-multi-label-learning-for-semantic","slug":"extreme-multi-label-learning-for-semantic","title":"Extreme Multi-label Learning for Semantic Matching in Product Search","date":"2021-06-23","arxiv_id":"2106.12657","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-inference-via-universal-lsh-kernel","title":"Efficient Inference via Universal LSH Kernel","date":"2021-06-21","arxiv_id":"2106.11426","n_code_links":0,"syntology":null},{"paper":"/paper/iterative-network-pruning-with-uncertainty","slug":"iterative-network-pruning-with-uncertainty","title":"Iterative Network Pruning with Uncertainty Regularization for Lifelong Sentiment Classification","date":"2021-06-21","arxiv_id":"2106.11197","n_code_links":1,"syntology":null},{"paper":null,"slug":"cogradient-descent-for-dependable-learning","title":"Cogradient Descent for Dependable Learning","date":"2021-06-20","arxiv_id":"2106.10617","n_code_links":0,"syntology":null},{"paper":null,"slug":"few-shot-object-detection-via-classification","title":"Few-Shot Object Detection via Classification Refinement and Distractor Retreatment","date":"2021-06-19","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/network-pruning-via-performance-maximization","slug":"network-pruning-via-performance-maximization","title":"Network Pruning via Performance Maximization","date":"2021-06-19","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/sparse-training-via-boosting-pruning","slug":"sparse-training-via-boosting-pruning","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","date":"2021-06-19","arxiv_id":"2106.10404","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["Shiweiliuiiiiiii/GraNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/effective-model-sparsification-by-scheduled","slug":"effective-model-sparsification-by-scheduled","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","date":"2021-06-18","arxiv_id":"2106.09857","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":["boone891214/gap"],"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":"layer-pruning-on-demand-with-intermediate-ctc","title":"Layer Pruning on Demand with Intermediate CTC","date":"2021-06-17","arxiv_id":"2106.09216","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-randomly-initialized-neural-networks","slug":"pruning-randomly-initialized-neural-networks","title":"Pruning Randomly Initialized Neural Networks with Iterative Randomization","date":"2021-06-17","arxiv_id":"2106.09269","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":["dchiji-ntt/iterand"],"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/a-winning-hand-compressing-deep-networks-can","slug":"a-winning-hand-compressing-deep-networks-can","title":"A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustness","date":"2021-06-16","arxiv_id":"2106.09129","n_code_links":2,"syntology":null},{"paper":null,"slug":"algorithm-to-compilation-codesign-an","title":"Algorithm to Compilation Co-design: An Integrated View of Neural Network Sparsity","date":"2021-06-16","arxiv_id":"2106.08846","n_code_links":0,"syntology":null}],"record_sha256":"37e8b24d3f15a45033f0276c925da76d310b5ec3896815e6d6498348f5d02158","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}