{"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/19","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":19,"pages_in_order":39,"rows_per_page":100,"rows":[1801,1900],"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/18","next":"/method/pruning/papers/20","papers":[{"paper":"/paper/does-deep-learning-on-a-data-diet-reproduce","slug":"does-deep-learning-on-a-data-diet-reproduce","title":"Does `Deep Learning on a Data Diet' reproduce? Overall yes, but GraNd at Initialization does not","date":"2023-03-26","arxiv_id":"2303.14753","n_code_links":1,"syntology":null},{"paper":"/paper/exploring-the-performance-of-pruning-methods","slug":"exploring-the-performance-of-pruning-methods","title":"Exploring the Performance of Pruning Methods in Neural Networks: An Empirical Study of the Lottery Ticket Hypothesis","date":"2023-03-26","arxiv_id":"2303.15479","n_code_links":1,"syntology":null},{"paper":"/paper/task-oriented-memory-efficient-pruning","slug":"task-oriented-memory-efficient-pruning","title":"Task-oriented Memory-efficient Pruning-Adapter","date":"2023-03-26","arxiv_id":"2303.14704","n_code_links":1,"syntology":null},{"paper":null,"slug":"prompt-guided-transformers-for-end-to-end","title":"Prompt-Guided Transformers for End-to-End Open-Vocabulary Object Detection","date":"2023-03-25","arxiv_id":"2303.14386","n_code_links":0,"syntology":null},{"paper":"/paper/line-out-of-distribution-detection-by","slug":"line-out-of-distribution-detection-by","title":"LINe: Out-of-Distribution Detection by Leveraging Important Neurons","date":"2023-03-24","arxiv_id":"2303.13995","n_code_links":1,"syntology":{"ran":17,"of":20,"n_ran_checked":10,"n_instrument":7,"unverified":3,"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) · 3 unverified","official":{"repos":["yonghyun-ahn/line-out-of-distribution-detection-by-leveraging-important-neurons"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/adaptive-multi-scale-online-likelihood","slug":"adaptive-multi-scale-online-likelihood","title":"Adaptive Multi-scale Online Likelihood Network for AI-assisted Interactive Segmentation","date":"2023-03-23","arxiv_id":"2303.13696","n_code_links":1,"syntology":null},{"paper":null,"slug":"cp-3-channel-pruning-plug-in-for-point-based","title":"CP$^3$: Channel Pruning Plug-in for Point-based Networks","date":"2023-03-23","arxiv_id":"2303.13097","n_code_links":0,"syntology":null},{"paper":"/paper/grapeqa-graph-augmentation-and-pruning-to","slug":"grapeqa-graph-augmentation-and-pruning-to","title":"GrapeQA: GRaph Augmentation and Pruning to Enhance Question-Answering","date":"2023-03-22","arxiv_id":"2303.12320","n_code_links":0,"syntology":null},{"paper":"/paper/performance-aware-approximation-of-global","slug":"performance-aware-approximation-of-global","title":"Performance-aware Approximation of Global Channel Pruning for Multitask CNNs","date":"2023-03-21","arxiv_id":"2303.11923","n_code_links":2,"syntology":null},{"paper":null,"slug":"protective-self-adaptive-pruning-to-better","title":"Protective Self-Adaptive Pruning to Better Compress DNNs","date":"2023-03-21","arxiv_id":"2303.11881","n_code_links":0,"syntology":null},{"paper":null,"slug":"greedy-pruning-with-group-lasso-provably","title":"Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing","date":"2023-03-20","arxiv_id":"2303.11453","n_code_links":0,"syntology":null},{"paper":null,"slug":"induced-feature-selection-by-structured","title":"Induced Feature Selection by Structured Pruning","date":"2023-03-20","arxiv_id":"2303.10999","n_code_links":0,"syntology":null},{"paper":"/paper/deep-graph-based-spatial-consistency-for","slug":"deep-graph-based-spatial-consistency-for","title":"Deep Graph-based Spatial Consistency for Robust Non-rigid Point Cloud Registration","date":"2023-03-17","arxiv_id":"2303.09950","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-structure-pruning-for-compressing","slug":"dynamic-structure-pruning-for-compressing","title":"Dynamic Structure Pruning for Compressing CNNs","date":"2023-03-17","arxiv_id":"2303.09736","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["irishev/dsp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"paper":"/paper/iterative-soft-shrinkage-learning-for","slug":"iterative-soft-shrinkage-learning-for","title":"Iterative Soft Shrinkage Learning for Efficient Image Super-Resolution","date":"2023-03-16","arxiv_id":"2303.09650","n_code_links":2,"syntology":null},{"paper":"/paper/automatic-attention-pruning-improving-and","slug":"automatic-attention-pruning-improving-and","title":"Automatic Attention Pruning: Improving and Automating Model Pruning using Attentions","date":"2023-03-14","arxiv_id":"2303.08595","n_code_links":1,"syntology":null},{"paper":"/paper/model-to-circuit-cross-approximation-for","slug":"model-to-circuit-cross-approximation-for","title":"Model-to-Circuit Cross-Approximation For Printed Machine Learning Classifiers","date":"2023-03-14","arxiv_id":"2303.08255","n_code_links":1,"syntology":null},{"paper":"/paper/sr-init-an-interpretable-layer-pruning-method","slug":"sr-init-an-interpretable-layer-pruning-method","title":"SR-init: An interpretable layer pruning method","date":"2023-03-14","arxiv_id":"2303.07677","n_code_links":1,"syntology":null},{"paper":null,"slug":"bag-of-tricks-with-quantized-convolutional","title":"Bag of Tricks with Quantized Convolutional Neural Networks for image classification","date":"2023-03-13","arxiv_id":"2303.07080","n_code_links":0,"syntology":null},{"paper":"/paper/otov2-automatic-generic-user-friendly","slug":"otov2-automatic-generic-user-friendly","title":"OTOV2: Automatic, Generic, User-Friendly","date":"2023-03-13","arxiv_id":"2303.06862","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":{"repos":["tianyic/only_train_once"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":"/paper/provable-convergence-of-tensor-decomposition","slug":"provable-convergence-of-tensor-decomposition","title":"On Model Compression for Neural Networks: Framework, Algorithm, and Convergence Guarantee","date":"2023-03-13","arxiv_id":"2303.06815","n_code_links":1,"syntology":null},{"paper":null,"slug":"symbolic-regression-for-pdes-using-pruned","title":"Symbolic Regression for PDEs using Pruned Differentiable Programs","date":"2023-03-13","arxiv_id":"2303.07009","n_code_links":0,"syntology":null},{"paper":"/paper/fedlp-layer-wise-pruning-mechanism-for","slug":"fedlp-layer-wise-pruning-mechanism-for","title":"FedLP: Layer-wise Pruning Mechanism for Communication-Computation Efficient Federated Learning","date":"2023-03-11","arxiv_id":"2303.06360","n_code_links":1,"syntology":null},{"paper":"/paper/token-sparsification-for-faster-medical-image","slug":"token-sparsification-for-faster-medical-image","title":"Token Sparsification for Faster Medical Image Segmentation","date":"2023-03-11","arxiv_id":"2303.06522","n_code_links":1,"syntology":null},{"paper":null,"slug":"complement-sparsification-low-overhead-model","title":"Complement Sparsification: Low-Overhead Model Pruning for Federated Learning","date":"2023-03-10","arxiv_id":"2303.06237","n_code_links":0,"syntology":null},{"paper":"/paper/supervised-feature-selection-with-neuron","slug":"supervised-feature-selection-with-neuron","title":"Supervised Feature Selection with Neuron Evolution in Sparse Neural Networks","date":"2023-03-10","arxiv_id":"2303.07200","n_code_links":1,"syntology":null},{"paper":null,"slug":"differential-privacy-meets-neural-network","title":"Differential Privacy Meets Neural Network Pruning","date":"2023-03-08","arxiv_id":"2303.04612","n_code_links":0,"syntology":null},{"paper":"/paper/infobatch-lossless-training-speed-up-by","slug":"infobatch-lossless-training-speed-up-by","title":"InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning","date":"2023-03-08","arxiv_id":"2303.04947","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":2,"phrase":"0 ran · 2 unverified","official":{"repos":["nus-hpc-ai-lab/infobatch"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":"/paper/x-pruner-explainable-pruning-for-vision","slug":"x-pruner-explainable-pruning-for-vision","title":"X-Pruner: eXplainable Pruning for Vision Transformers","date":"2023-03-08","arxiv_id":"2303.04935","n_code_links":1,"syntology":null},{"paper":null,"slug":"filter-pruning-based-on-information-capacity","title":"Filter Pruning based on Information Capacity and Independence","date":"2023-03-07","arxiv_id":"2303.03645","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-free-structured-pruning-with","title":"Gradient-Free Structured Pruning with Unlabeled Data","date":"2023-03-07","arxiv_id":"2303.04185","n_code_links":0,"syntology":null},{"paper":"/paper/one-4-all-neural-potential-fields-for","slug":"one-4-all-neural-potential-fields-for","title":"One-4-All: Neural Potential Fields for Embodied Navigation","date":"2023-03-07","arxiv_id":"2303.04011","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":null}},{"paper":null,"slug":"scaling-strategies-for-on-device-low","title":"Scaling strategies for on-device low-complexity source separation with Conv-Tasnet","date":"2023-03-06","arxiv_id":"2303.03005","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-enhanced-semi-supervised-federated","title":"Knowledge-Enhanced Semi-Supervised Federated Learning for Aggregating Heterogeneous Lightweight Clients in IoT","date":"2023-03-05","arxiv_id":"2303.02668","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-object-detection-on-embedded-devices","title":"Scalable Object Detection on Embedded Devices Using Weight Pruning and Singular Value Decomposition","date":"2023-03-05","arxiv_id":"2303.02735","n_code_links":0,"syntology":null},{"paper":"/paper/a-fast-training-free-compression-framework","slug":"a-fast-training-free-compression-framework","title":"Training-Free Acceleration of ViTs with Delayed Spatial Merging","date":"2023-03-04","arxiv_id":"2303.02331","n_code_links":1,"syntology":null},{"paper":null,"slug":"visual-saliency-guided-channel-pruning-for","title":"Visual Saliency-Guided Channel Pruning for Deep Visual Detectors in Autonomous Driving","date":"2023-03-04","arxiv_id":"2303.02512","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-association-aware-pomdp-planning-with","title":"Data Association Aware POMDP Planning with Hypothesis Pruning Performance Guarantees","date":"2023-03-03","arxiv_id":"2303.02139","n_code_links":0,"syntology":null},{"paper":null,"slug":"r-toss-a-framework-for-real-time-object","title":"R-TOSS: A Framework for Real-Time Object Detection using Semi-Structured Pruning","date":"2023-03-03","arxiv_id":"2303.02191","n_code_links":0,"syntology":null},{"paper":"/paper/trojtext-test-time-invisible-textual-trojan","slug":"trojtext-test-time-invisible-textual-trojan","title":"TrojText: Test-time Invisible Textual Trojan Insertion","date":"2023-03-03","arxiv_id":"2303.02242","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"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) · 1 unverified","official":{"repos":["ucf-ml-research/trojtext"],"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":null,"slug":"average-of-pruning-improving-performance-and","title":"Average of Pruning: Improving Performance and Stability of Out-of-Distribution Detection","date":"2023-03-02","arxiv_id":"2303.01201","n_code_links":0,"syntology":null},{"paper":null,"slug":"parameter-sharing-with-network-pruning-for","title":"Parameter Sharing with Network Pruning for Scalable Multi-Agent Deep Reinforcement Learning","date":"2023-03-02","arxiv_id":"2303.00912","n_code_links":0,"syntology":null},{"paper":null,"slug":"ternary-quantization-a-survey","title":"Ternary Quantization: A Survey","date":"2023-03-02","arxiv_id":"2303.01505","n_code_links":0,"syntology":null},{"paper":null,"slug":"distilled-reverse-attention-network-for-open","title":"Distilled Reverse Attention Network for Open-world Compositional Zero-Shot Learning","date":"2023-03-01","arxiv_id":"2303.00404","n_code_links":0,"syntology":null},{"paper":"/paper/structured-pruning-for-deep-convolutional","slug":"structured-pruning-for-deep-convolutional","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","date":"2023-03-01","arxiv_id":"2303.00566","n_code_links":1,"syntology":null},{"paper":"/paper/acceltran-a-sparsity-aware-accelerator-for","slug":"acceltran-a-sparsity-aware-accelerator-for","title":"AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformers","date":"2023-02-28","arxiv_id":"2302.14705","n_code_links":1,"syntology":{"ran":6,"of":9,"n_ran_checked":6,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["jha-lab/acceltran"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"fast-as-chita-neural-network-pruning-with","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","date":"2023-02-28","arxiv_id":"2302.14623","n_code_links":0,"syntology":null},{"paper":null,"slug":"wisk-a-workload-aware-learned-index-for","title":"WISK: A Workload-aware Learned Index for Spatial Keyword Queries","date":"2023-02-28","arxiv_id":"2302.14287","n_code_links":0,"syntology":null},{"paper":"/paper/structured-pruning-of-self-supervised-pre","slug":"structured-pruning-of-self-supervised-pre","title":"Structured Pruning of Self-Supervised Pre-trained Models for Speech Recognition and Understanding","date":"2023-02-27","arxiv_id":"2302.14132","n_code_links":1,"syntology":null},{"paper":"/paper/localizing-moments-in-long-video-via","slug":"localizing-moments-in-long-video-via","title":"Localizing Moments in Long Video Via Multimodal Guidance","date":"2023-02-26","arxiv_id":"2302.13372","n_code_links":1,"syntology":null},{"paper":"/paper/a-unified-framework-for-soft-threshold","slug":"a-unified-framework-for-soft-threshold","title":"A Unified Framework for Soft Threshold Pruning","date":"2023-02-25","arxiv_id":"2302.13019","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 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yanqi-chen/lats"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/automatic-prompt-augmentation-and-selection","slug":"automatic-prompt-augmentation-and-selection","title":"Automatic Prompt Augmentation and Selection with Chain-of-Thought from Labeled Data","date":"2023-02-24","arxiv_id":"2302.12822","n_code_links":2,"syntology":null},{"paper":"/paper/towards-computationally-efficient","slug":"towards-computationally-efficient","title":"Towards Computationally Efficient Responsibility Attribution in Decentralized Partially Observable MDPs","date":"2023-02-24","arxiv_id":"2302.12676","n_code_links":1,"syntology":null},{"paper":null,"slug":"less-is-more-data-pruning-for-faster","title":"Less is More: Data Pruning for Faster Adversarial Training","date":"2023-02-23","arxiv_id":"2302.12366","n_code_links":0,"syntology":null},{"paper":"/paper/mining-compact-high-utility-sequential","slug":"mining-compact-high-utility-sequential","title":"Mining compact high utility sequential patterns","date":"2023-02-22","arxiv_id":"2302.11426","n_code_links":1,"syntology":null},{"paper":"/paper/classy-ensemble-a-novel-ensemble-algorithm","slug":"classy-ensemble-a-novel-ensemble-algorithm","title":"Classy Ensemble: A Novel Ensemble Algorithm for Classification","date":"2023-02-21","arxiv_id":"2302.10580","n_code_links":1,"syntology":null},{"paper":"/paper/lightweight-yet-efficient-revitalizing-ball","slug":"lightweight-yet-efficient-revitalizing-ball","title":"Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search","date":"2023-02-21","arxiv_id":"2302.10626","n_code_links":1,"syntology":null},{"paper":null,"slug":"structured-bayesian-compression-for-deep-1","title":"Structured Bayesian Compression for Deep Neural Networks Based on The Turbo-VBI Approach","date":"2023-02-21","arxiv_id":"2302.10483","n_code_links":0,"syntology":null},{"paper":null,"slug":"multiobjective-evolutionary-pruning-of-deep","title":"Multiobjective Evolutionary Pruning of Deep Neural Networks with Transfer Learning for improving their Performance and Robustness","date":"2023-02-20","arxiv_id":"2302.10253","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-baseline-for-greenai-finding-the","title":"Learning a Consensus Sub-Network with Polarization Regularization and One Pass Training","date":"2023-02-17","arxiv_id":"2302.10798","n_code_links":0,"syntology":null},{"paper":null,"slug":"less-is-more-the-influence-of-pruning-on-the","title":"Less is More: The Influence of Pruning on the Explainability of CNNs","date":"2023-02-17","arxiv_id":"2302.08878","n_code_links":0,"syntology":null},{"paper":"/paper/lever-learning-to-verify-language-to-code","slug":"lever-learning-to-verify-language-to-code","title":"LEVER: Learning to Verify Language-to-Code Generation with Execution","date":"2023-02-16","arxiv_id":"2302.08468","n_code_links":1,"syntology":{"ran":18,"of":22,"n_ran_checked":18,"n_instrument":0,"unverified":4,"pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 1 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["niansong1996/lever"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/st-mfnet-mini-knowledge-distillation-driven","slug":"st-mfnet-mini-knowledge-distillation-driven","title":"ST-MFNet Mini: Knowledge Distillation-Driven Frame Interpolation","date":"2023-02-16","arxiv_id":"2302.08455","n_code_links":1,"syntology":null},{"paper":"/paper/whc-weighted-hybrid-criterion-for-filter","slug":"whc-weighted-hybrid-criterion-for-filter","title":"WHC: Weighted Hybrid Criterion for Filter Pruning on Convolutional Neural Networks","date":"2023-02-16","arxiv_id":"2302.08185","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-optimal-compression-joint-pruning-and","title":"Towards Optimal Compression: Joint Pruning and Quantization","date":"2023-02-15","arxiv_id":"2302.07612","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-pruning-and-neural-scaling-laws","title":"Data pruning and neural scaling laws: fundamental limitations of score-based algorithms","date":"2023-02-14","arxiv_id":"2302.06960","n_code_links":0,"syntology":null},{"paper":"/paper/reveal-the-unknown-out-of-knowledge-base","slug":"reveal-the-unknown-out-of-knowledge-base","title":"Reveal the Unknown: Out-of-Knowledge-Base Mention Discovery with Entity Linking","date":"2023-02-14","arxiv_id":"2302.07189","n_code_links":3,"syntology":null},{"paper":null,"slug":"explicit3d-graph-network-with-spatial","title":"Explicit3D: Graph Network with Spatial Inference for Single Image 3D Object Detection","date":"2023-02-13","arxiv_id":"2302.06494","n_code_links":0,"syntology":null},{"paper":null,"slug":"workload-balanced-pruning-for-sparse-spiking","title":"Workload-Balanced Pruning for Sparse Spiking Neural Networks","date":"2023-02-13","arxiv_id":"2302.06746","n_code_links":0,"syntology":null},{"paper":"/paper/autoselection-of-the-ensemble-of","slug":"autoselection-of-the-ensemble-of","title":"Autoselection of the Ensemble of Convolutional Neural Networks with Second-Order Cone Programming","date":"2023-02-12","arxiv_id":"2302.05950","n_code_links":1,"syntology":null},{"paper":null,"slug":"quantum-neuron-selection-finding-high","title":"Quantum Neuron Selection: Finding High Performing Subnetworks With Quantum Algorithms","date":"2023-02-12","arxiv_id":"2302.05984","n_code_links":0,"syntology":null},{"paper":"/paper/metaphor-detection-with-effective-context","slug":"metaphor-detection-with-effective-context","title":"Metaphor Detection with Effective Context Denoising","date":"2023-02-11","arxiv_id":"2302.05611","n_code_links":1,"syntology":null},{"paper":"/paper/pruning-deep-neural-networks-from-a-sparsity-1","slug":"pruning-deep-neural-networks-from-a-sparsity-1","title":"Pruning Deep Neural Networks from a Sparsity Perspective","date":"2023-02-11","arxiv_id":"2302.05601","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":["diaoenmao/pruning-deep-neural-networks-from-a-sparsity-perspective"],"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":null,"slug":"exploiting-sparsity-in-pruned-neural-networks","title":"Exploiting Sparsity in Pruned Neural Networks to Optimize Large Model Training","date":"2023-02-10","arxiv_id":"2302.05045","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-constant-per-iteration-likelihood-ratio","title":"A Constant-per-Iteration Likelihood Ratio Test for Online Changepoint Detection for Exponential Family Models","date":"2023-02-09","arxiv_id":"2302.04743","n_code_links":0,"syntology":null},{"paper":"/paper/channelformer-attention-based-neural-solution","slug":"channelformer-attention-based-neural-solution","title":"Channelformer: Attention based Neural Solution for Wireless Channel Estimation and Effective Online Training","date":"2023-02-08","arxiv_id":"2302.04368","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-linear-model-trees-by-pilot","title":"Fast Linear Model Trees by PILOT","date":"2023-02-08","arxiv_id":"2302.03931","n_code_links":0,"syntology":null},{"paper":"/paper/the-hardware-impact-of-quantization-and","slug":"the-hardware-impact-of-quantization-and","title":"The Hardware Impact of Quantization and Pruning for Weights in Spiking Neural Networks","date":"2023-02-08","arxiv_id":"2302.04174","n_code_links":1,"syntology":null},{"paper":"/paper/what-matters-in-the-structured-pruning-of","slug":"what-matters-in-the-structured-pruning-of","title":"What Matters In The Structured Pruning of Generative Language Models?","date":"2023-02-07","arxiv_id":"2302.03773","n_code_links":1,"syntology":{"ran":2,"of":8,"n_ran_checked":2,"n_instrument":0,"unverified":6,"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) · 6 unverified","official":{"repos":["huggingface/nn_pruning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-log-linear-non-parametric-online","title":"A Log-Linear Non-Parametric Online Changepoint Detection Algorithm based on Functional Pruning","date":"2023-02-06","arxiv_id":"2302.02718","n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-edge-model-sparse-learning-is-provably","title":"Joint Edge-Model Sparse Learning is Provably Efficient for Graph Neural Networks","date":"2023-02-06","arxiv_id":"2302.02922","n_code_links":0,"syntology":null},{"paper":null,"slug":"ten-lessons-we-have-learned-in-the-new","title":"Ten Lessons We Have Learned in the New \"Sparseland\": A Short Handbook for Sparse Neural Network Researchers","date":"2023-02-06","arxiv_id":"2302.02596","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-distillation-in-vision-transformers","title":"Knowledge Distillation in Vision Transformers: A Critical Review","date":"2023-02-04","arxiv_id":"2302.02108","n_code_links":0,"syntology":null},{"paper":"/paper/over-parameterised-shallow-neural-networks","slug":"over-parameterised-shallow-neural-networks","title":"Over-parameterised Shallow Neural Networks with Asymmetrical Node Scaling: Global Convergence Guarantees and Feature Learning","date":"2023-02-02","arxiv_id":"2302.01002","n_code_links":1,"syntology":null},{"paper":"/paper/adaptive-search-and-training-for-robust-and","slug":"adaptive-search-and-training-for-robust-and","title":"Adaptive Search-and-Training for Robust and Efficient Network Pruning","date":"2023-02-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"tap-accelerating-large-scale-dnn-training","title":"TAP: Accelerating Large-Scale DNN Training Through Tensor Automatic Parallelisation","date":"2023-02-01","arxiv_id":"2302.00247","n_code_links":0,"syntology":null},{"paper":"/paper/upop-unified-and-progressive-pruning-for","slug":"upop-unified-and-progressive-pruning-for","title":"UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformers","date":"2023-01-31","arxiv_id":"2301.13741","n_code_links":2,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":{"repos":["sdc17/upop"],"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/depgraph-towards-any-structural-pruning","slug":"depgraph-towards-any-structural-pruning","title":"DepGraph: Towards Any Structural Pruning","date":"2023-01-30","arxiv_id":"2301.12900","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["VainF/Torch-Pruning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"anticipate-ensemble-and-prune-improving","title":"Anticipate, Ensemble and Prune: Improving Convolutional Neural Networks via Aggregated Early Exits","date":"2023-01-28","arxiv_id":"2301.12168","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-latency-aware-cnn-depth-compression","slug":"efficient-latency-aware-cnn-depth-compression","title":"Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming","date":"2023-01-28","arxiv_id":"2301.12187","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["snu-mllab/efficient-cnn-depth-compression"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/understanding-int4-quantization-for","slug":"understanding-int4-quantization-for","title":"Understanding INT4 Quantization for Transformer Models: Latency Speedup, Composability, and Failure Cases","date":"2023-01-27","arxiv_id":"2301.12017","n_code_links":1,"syntology":null},{"paper":null,"slug":"voting-from-nearest-tasks-meta-vote-pruning","title":"Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Tasks","date":"2023-01-27","arxiv_id":"2301.11560","n_code_links":0,"syntology":null},{"paper":"/paper/break-it-down-evidence-for-structural","slug":"break-it-down-evidence-for-structural","title":"Break It Down: Evidence for Structural Compositionality in Neural Networks","date":"2023-01-26","arxiv_id":"2301.10884","n_code_links":1,"syntology":null},{"paper":"/paper/rewarded-meta-pruning-meta-learning-with","slug":"rewarded-meta-pruning-meta-learning-with","title":"Rewarded meta-pruning: Meta Learning with Rewards for Channel Pruning","date":"2023-01-26","arxiv_id":"2301.11063","n_code_links":1,"syntology":null},{"paper":null,"slug":"increasing-fairness-in-compromise-on-accuracy","title":"Increasing Fairness via Combination with Learning Guarantees","date":"2023-01-25","arxiv_id":"2301.10813","n_code_links":0,"syntology":null},{"paper":"/paper/when-layers-play-the-lottery-all-tickets-win","slug":"when-layers-play-the-lottery-all-tickets-win","title":"When Layers Play the Lottery, all Tickets Win at Initialization","date":"2023-01-25","arxiv_id":"2301.10835","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-robust-hypothesis-test-for-tree-ensemble","title":"A Robust Hypothesis Test for Tree Ensemble Pruning","date":"2023-01-24","arxiv_id":"2301.10115","n_code_links":0,"syntology":null},{"paper":"/paper/unifying-synergies-between-self-supervised","slug":"unifying-synergies-between-self-supervised","title":"Unifying Synergies between Self-supervised Learning and Dynamic Computation","date":"2023-01-22","arxiv_id":"2301.09164","n_code_links":1,"syntology":null},{"paper":"/paper/accelerating-and-compressing-deep-neural","slug":"accelerating-and-compressing-deep-neural","title":"Accelerating and Compressing Deep Neural Networks for Massive MIMO CSI Feedback","date":"2023-01-20","arxiv_id":"2304.01914","n_code_links":1,"syntology":null},{"paper":null,"slug":"getting-away-with-more-network-pruning-from","title":"Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regions","date":"2023-01-19","arxiv_id":"2301.07966","n_code_links":0,"syntology":null}],"record_sha256":"a9e6ba3cefc298356b9ac82f65a65c0db32b4282ef4b25adfb6ea4fbddbcad59","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}