{"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/30","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":30,"pages_in_order":39,"rows_per_page":100,"rows":[2901,3000],"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/29","next":"/method/pruning/papers/31","papers":[{"paper":null,"slug":"long-live-the-lottery-the-existence-of","title":"Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"model-compression-via-hyper-structure-network","title":"Model Compression via Hyper-Structure Network","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"more-side-information-better-pruning-shared","title":"More Side Information, Better Pruning: Shared-Label Classification as a Case Study","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-prize-lottery-ticket-hypothesis-finding","title":"Multi-Prize Lottery Ticket Hypothesis: Finding Generalizable and Efficient Binary Subnetworks in a Randomly Weighted Neural Network","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-sparse-critical-paths-of-neural-response","title":"On Sparse Critical Paths of Neural Response","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-decision-boundaries-of-neural-networks","title":"On the Decision Boundaries of Neural Networks. A Tropical Geometry Perspective","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"phew-paths-with-higher-edge-weights-give","title":"PHEW: Paths with Higher Edge-Weights give ''winning tickets'' without training data","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"rapid-neural-pruning-for-novel-datasets-with","title":"Rapid Neural Pruning for Novel Datasets with Set-based Task-Adaptive Meta-Pruning","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"rethinking-the-pruning-criteria-for","title":"Rethinking the Pruning Criteria for Convolutional Neural Network","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-watermarking-for-deep-neural-networks","title":"Robust Watermarking for Deep Neural Networks via Bi-Level Optimization","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"succinct-network-channel-and-spatial-pruning","title":"Succinct Network Channel and Spatial Pruning via Discrete Variable QCQP","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"uncovering-the-impact-of-learning-rate-for","title":"Uncovering the impact of learning rate for global magnitude pruning","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"waste-not-want-not-all-alive-pruning-for","title":"Waste not, Want not: All-Alive Pruning for Extremely Sparse Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"when-are-neural-pruning-approximation-bounds","title":"When Are Neural Pruning Approximation Bounds Useful?","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"why-lottery-ticket-wins-a-theoretical","title":"Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Sparse Neural Networks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-analysis-for-semantic-segmentation","title":"Spectral Analysis for Semantic Segmentation with Applications on Feature Truncation and Weak Annotation","date":"2020-12-28","arxiv_id":"2012.14123","n_code_links":0,"syntology":null},{"paper":null,"slug":"achieving-real-time-lidar-3d-object-detection","title":"Achieving Real-Time LiDAR 3D Object Detection on a Mobile Device","date":"2020-12-26","arxiv_id":"2012.13801","n_code_links":0,"syntology":null},{"paper":null,"slug":"attentionlite-towards-efficient-self","title":"AttentionLite: Towards Efficient Self-Attention Models for Vision","date":"2020-12-21","arxiv_id":"2101.05216","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-on-chip-learning-for-optical-neural","slug":"efficient-on-chip-learning-for-optical-neural","title":"Efficient On-Chip Learning for Optical Neural Networks Through Power-Aware Sparse Zeroth-Order Optimization","date":"2020-12-21","arxiv_id":"2012.11148","n_code_links":1,"syntology":null},{"paper":null,"slug":"searching-for-controllable-image-restoration","title":"Searching for Controllable Image Restoration Networks","date":"2020-12-21","arxiv_id":"2012.11225","n_code_links":0,"syntology":null},{"paper":null,"slug":"disco-dynamic-and-invariant-sensitive-channel","title":"DISCO: Dynamic and Invariant Sensitive Channel Obfuscation for deep neural networks","date":"2020-12-20","arxiv_id":"2012.11025","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-supervised-hyperspectral-image","title":"Semi-supervised Hyperspectral Image Classification with Graph Clustering Convolutional Networks","date":"2020-12-20","arxiv_id":"2012.10932","n_code_links":0,"syntology":null},{"paper":"/paper/a-surrogate-lagrangian-relaxation-based-model","slug":"a-surrogate-lagrangian-relaxation-based-model","title":"Enabling Retrain-free Deep Neural Network Pruning using Surrogate Lagrangian Relaxation","date":"2020-12-18","arxiv_id":"2012.10079","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-cnn-lstm-based-image-captioning","slug":"efficient-cnn-lstm-based-image-captioning","title":"Efficient CNN-LSTM based Image Captioning using Neural Network Compression","date":"2020-12-17","arxiv_id":"2012.09708","n_code_links":1,"syntology":null},{"paper":null,"slug":"spatten-efficient-sparse-attention","title":"SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruning","date":"2020-12-17","arxiv_id":"2012.09852","n_code_links":0,"syntology":null},{"paper":null,"slug":"ving-learning-open-world-navigation-with","title":"ViNG: Learning Open-World Navigation with Visual Goals","date":"2020-12-17","arxiv_id":"2012.09812","n_code_links":0,"syntology":null},{"paper":"/paper/neural-pruning-via-growing-regularization-1","slug":"neural-pruning-via-growing-regularization-1","title":"Neural Pruning via Growing Regularization","date":"2020-12-16","arxiv_id":"2012.09243","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":3,"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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["mingsun-tse/regularization-pruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"provable-benefits-of-overparameterization-in","title":"Provable Benefits of Overparameterization in Model Compression: From Double Descent to Pruning Neural Networks","date":"2020-12-16","arxiv_id":"2012.08749","n_code_links":0,"syntology":null},{"paper":"/paper/parameter-efficient-transfer-learning-with-1","slug":"parameter-efficient-transfer-learning-with-1","title":"Parameter-Efficient Transfer Learning with Diff Pruning","date":"2020-12-14","arxiv_id":"2012.07463","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["dguo98/DiffPruning"],"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","unlocated"]}}},{"paper":"/paper/learn-prune-share-for-lifelong-learning","slug":"learn-prune-share-for-lifelong-learning","title":"Learn-Prune-Share for Lifelong Learning","date":"2020-12-13","arxiv_id":"2012.06956","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-incorporation-of-multiple-latency","slug":"efficient-incorporation-of-multiple-latency","title":"Efficient Incorporation of Multiple Latency Targets in the Once-For-All Network","date":"2020-12-12","arxiv_id":"2012.06748","n_code_links":1,"syntology":null},{"paper":"/paper/robustness-and-transferability-of-universal","slug":"robustness-and-transferability-of-universal","title":"Robustness and Transferability of Universal Attacks on Compressed Models","date":"2020-12-10","arxiv_id":"2012.06024","n_code_links":1,"syntology":null},{"paper":"/paper/the-lottery-ticket-hypothesis-for-object","slug":"the-lottery-ticket-hypothesis-for-object","title":"The Lottery Ticket Hypothesis for Object Recognition","date":"2020-12-08","arxiv_id":"2012.04643","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-role-of-regularization-in-shaping-weight","title":"The Role of Regularization in Shaping Weight and Node Pruning Dependency and Dynamics","date":"2020-12-07","arxiv_id":"2012.03827","n_code_links":0,"syntology":null},{"paper":null,"slug":"cosine-pruned-medial-axis-a-new-method-for","title":"Cosine-Pruned Medial Axis: A new method for isometric equivariant and noise-free medial axis extraction","date":"2020-12-05","arxiv_id":"2012.02910","n_code_links":0,"syntology":null},{"paper":null,"slug":"do-we-really-need-that-many-parameters-in","title":"Do We Really Need That Many Parameters In Transformer For Extractive Summarization? Discourse Can Help !","date":"2020-12-03","arxiv_id":"2012.02144","n_code_links":0,"syntology":null},{"paper":"/paper/neural-prototype-trees-for-interpretable-fine","slug":"neural-prototype-trees-for-interpretable-fine","title":"Neural Prototype Trees for Interpretable Fine-grained Image Recognition","date":"2020-12-03","arxiv_id":"2012.02046","n_code_links":1,"syntology":null},{"paper":"/paper/reliable-model-compression-via-label","slug":"reliable-model-compression-via-label","title":"Going Beyond Classification Accuracy Metrics in Model Compression","date":"2020-12-03","arxiv_id":"2012.01604","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-once-for-all-budgeted-pruning-framework","title":"An Once-for-All Budgeted Pruning Framework for ConvNets Considering Input Resolution","date":"2020-12-02","arxiv_id":"2012.00996","n_code_links":0,"syntology":null},{"paper":null,"slug":"6-7ms-on-mobile-with-over-78-imagenet","title":"NPAS: A Compiler-aware Framework of Unified Network Pruning and Architecture Search for Beyond Real-Time Mobile Acceleration","date":"2020-12-01","arxiv_id":"2012.00596","n_code_links":0,"syntology":null},{"paper":null,"slug":"generating-quantified-referring-expressions-1","title":"Generating Quantified Referring Expressions through Attention-Driven Incremental Perception","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-prune-dependency-trees-with","title":"Learning to Prune Dependency Trees with Rethinking for Neural Relation Extraction","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/neuron-level-structured-pruning-using","slug":"neuron-level-structured-pruning-using","title":"Neuron-level Structured Pruning using Polarization Regularizer","date":"2020-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/optimal-lottery-tickets-via-subset-sum","slug":"optimal-lottery-tickets-via-subset-sum","title":"Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient","date":"2020-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"self-supervised-generative-adversarial-1","title":"Self-Supervised Generative Adversarial Compression","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"storage-efficient-and-dynamic-flexible","title":"Storage Efficient and Dynamic Flexible Runtime Channel Pruning via Deep Reinforcement Learning","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"deconstructing-the-structure-of-sparse-neural","title":"Deconstructing the Structure of Sparse Neural Networks","date":"2020-11-30","arxiv_id":"2012.00172","n_code_links":0,"syntology":null},{"paper":"/paper/kd-lib-a-pytorch-library-for-knowledge","slug":"kd-lib-a-pytorch-library-for-knowledge","title":"KD-Lib: A PyTorch library for Knowledge Distillation, Pruning and Quantization","date":"2020-11-30","arxiv_id":"2011.14691","n_code_links":1,"syntology":null},{"paper":null,"slug":"learnable-motion-coherence-for-correspondence","title":"Learnable Motion Coherence for Correspondence Pruning","date":"2020-11-30","arxiv_id":"2011.14563","n_code_links":0,"syntology":null},{"paper":"/paper/robust-error-bounds-for-quantised-and-pruned","slug":"robust-error-bounds-for-quantised-and-pruned","title":"Robust error bounds for quantised and pruned neural networks","date":"2020-11-30","arxiv_id":"2012.00138","n_code_links":1,"syntology":null},{"paper":"/paper/timeshap-explaining-recurrent-models-through","slug":"timeshap-explaining-recurrent-models-through","title":"TimeSHAP: Explaining Recurrent Models through Sequence Perturbations","date":"2020-11-30","arxiv_id":"2012.00073","n_code_links":1,"syntology":null},{"paper":null,"slug":"layer-pruning-via-fusible-residual","title":"Layer Pruning via Fusible Residual Convolutional Block for Deep Neural Networks","date":"2020-11-29","arxiv_id":"2011.14356","n_code_links":0,"syntology":null},{"paper":null,"slug":"freezenet-full-performance-by-reduced-storage","title":"FreezeNet: Full Performance by Reduced Storage Costs","date":"2020-11-28","arxiv_id":"2011.14087","n_code_links":0,"syntology":null},{"paper":null,"slug":"metagater-fast-learning-of-conditional","title":"MetaGater: Fast Learning of Conditional Channel Gated Networks via Federated Meta-Learning","date":"2020-11-25","arxiv_id":"2011.12511","n_code_links":0,"syntology":null},{"paper":"/paper/quantifying-explainers-of-graph-neural","slug":"quantifying-explainers-of-graph-neural","title":"Quantifying Explainers of Graph Neural Networks in Computational Pathology","date":"2020-11-25","arxiv_id":"2011.12646","n_code_links":3,"syntology":null},{"paper":"/paper/random-sampling-high-dimensional-model","slug":"random-sampling-high-dimensional-model","title":"Random Sampling High Dimensional Model Representation Gaussian Process Regression (RS-HDMR-GPR) for representing multidimensional functions with machine-learned lower-dimensional terms allowing insight with a general method","date":"2020-11-24","arxiv_id":"2012.02704","n_code_links":1,"syntology":null},{"paper":null,"slug":"synthesis-and-pruning-as-a-dynamic","title":"Synthesis and Pruning as a Dynamic Compression Strategy for Efficient Deep Neural Networks","date":"2020-11-23","arxiv_id":"2011.11358","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-end-to-end-deep-learning","title":"ClickTrain: Efficient and Accurate End-to-End Deep Learning Training via Fine-Grained Architecture-Preserving Pruning","date":"2020-11-20","arxiv_id":"2011.10170","n_code_links":0,"syntology":null},{"paper":"/paper/clipper-a-graph-theoretic-framework-for","slug":"clipper-a-graph-theoretic-framework-for","title":"CLIPPER: A Graph-Theoretic Framework for Robust Data Association","date":"2020-11-20","arxiv_id":"2011.10202","n_code_links":2,"syntology":null},{"paper":"/paper/continuous-pruning-of-deep-convolutional","slug":"continuous-pruning-of-deep-convolutional","title":"Rethinking Weight Decay For Efficient Neural Network Pruning","date":"2020-11-20","arxiv_id":"2011.10520","n_code_links":1,"syntology":null},{"paper":"/paper/data-informed-global-sparseness-in-attention","slug":"data-informed-global-sparseness-in-attention","title":"Data-Informed Global Sparseness in Attention Mechanisms for Deep Neural Networks","date":"2020-11-20","arxiv_id":"2012.02030","n_code_links":2,"syntology":null},{"paper":null,"slug":"dynamic-hard-pruning-of-neural-networks-at","title":"Dynamic Hard Pruning of Neural Networks at the Edge of the Internet","date":"2020-11-17","arxiv_id":"2011.08545","n_code_links":0,"syntology":null},{"paper":"/paper/learning-efficient-gans-via-differentiable","slug":"learning-efficient-gans-via-differentiable","title":"Learning Efficient GANs for Image Translation via Differentiable Masks and co-Attention Distillation","date":"2020-11-17","arxiv_id":"2011.08382","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-functional-programs-with-function","title":"Learning functional programs with function invention and reuse","date":"2020-11-17","arxiv_id":"2011.08881","n_code_links":0,"syntology":null},{"paper":null,"slug":"filter-pre-pruning-for-improved-fine-tuning-1","title":"Filter Pre-Pruning for Improved Fine-tuning of Quantized Deep Neural Networks","date":"2020-11-13","arxiv_id":"2011.06751","n_code_links":0,"syntology":null},{"paper":"/paper/lean-graph-based-pruning-for-convolutional","slug":"lean-graph-based-pruning-for-convolutional","title":"LEAN: graph-based pruning for convolutional neural networks by extracting longest chains","date":"2020-11-13","arxiv_id":"2011.06923","n_code_links":1,"syntology":null},{"paper":null,"slug":"regression-trees-for-cumulative-incidence","title":"Regression Trees for Cumulative Incidence Functions","date":"2020-11-13","arxiv_id":"2011.06706","n_code_links":0,"syntology":null},{"paper":null,"slug":"automated-model-compression-by-jointly","title":"Automated Model Compression by Jointly Applied Pruning and Quantization","date":"2020-11-12","arxiv_id":"2011.06231","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-deep-learning-models-on-gpu-can-be","title":"When deep learning models on GPU can be accelerated by taking advantage of unstructured sparsity","date":"2020-11-12","arxiv_id":"2011.06295","n_code_links":0,"syntology":null},{"paper":"/paper/dirichlet-pruning-for-neural-network","slug":"dirichlet-pruning-for-neural-network","title":"Dirichlet Pruning for Neural Network Compression","date":"2020-11-10","arxiv_id":"2011.05985","n_code_links":1,"syntology":null},{"paper":null,"slug":"stage-wise-channel-pruning-for-model","title":"Effective Model Compression via Stage-wise Pruning","date":"2020-11-10","arxiv_id":"2011.04908","n_code_links":0,"syntology":null},{"paper":null,"slug":"channel-pruning-guided-by-spatial-and-channel","title":"Channel Pruning Guided by Spatial and Channel Attention for DNNs in Intelligent Edge Computing","date":"2020-11-08","arxiv_id":"2011.03891","n_code_links":0,"syntology":null},{"paper":null,"slug":"know-what-you-don-t-need-single-shot-meta","title":"Know What You Don't Need: Single-Shot Meta-Pruning for Attention Heads","date":"2020-11-07","arxiv_id":"2011.03770","n_code_links":0,"syntology":null},{"paper":null,"slug":"channel-pruning-via-multi-criteria-based-on","title":"Channel Pruning via Multi-Criteria based on Weight Dependency","date":"2020-11-06","arxiv_id":"2011.03240","n_code_links":0,"syntology":null},{"paper":null,"slug":"ghfp-gradually-hard-filter-pruning","title":"GHFP: Gradually Hard Filter Pruning","date":"2020-11-06","arxiv_id":"2011.03170","n_code_links":0,"syntology":null},{"paper":"/paper/low-complexity-models-for-acoustic-scene","slug":"low-complexity-models-for-acoustic-scene","title":"Low-Complexity Models for Acoustic Scene Classification Based on Receptive Field Regularization and Frequency Damping","date":"2020-11-05","arxiv_id":"2011.02955","n_code_links":1,"syntology":null},{"paper":null,"slug":"channel-planting-for-deep-neural-networks","title":"Channel Planting for Deep Neural Networks using Knowledge Distillation","date":"2020-11-04","arxiv_id":"2011.02390","n_code_links":0,"syntology":null},{"paper":"/paper/dais-automatic-channel-pruning-via","slug":"dais-automatic-channel-pruning-via","title":"DAIS: Automatic Channel Pruning via Differentiable Annealing Indicator Search","date":"2020-11-04","arxiv_id":"2011.02166","n_code_links":1,"syntology":null},{"paper":null,"slug":"filter-pruning-using-hierarchical-group","title":"Filter Pruning using Hierarchical Group Sparse Regularization for Deep Convolutional Neural Networks","date":"2020-11-04","arxiv_id":"2011.02389","n_code_links":0,"syntology":null},{"paper":"/paper/a-score-and-search-approach-to-learning","slug":"a-score-and-search-approach-to-learning","title":"A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations","date":"2020-11-03","arxiv_id":"2011.01444","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: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["CharupriyaSharma/eBNSLNoisyOR"],"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/a-tunable-robust-pruning-framework-through","slug":"a-tunable-robust-pruning-framework-through","title":"A Tunable Robust Pruning Framework Through Dynamic Network Rewiring of DNNs","date":"2020-11-03","arxiv_id":"2011.03083","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":null}},{"paper":null,"slug":"context-analysis-for-pre-trained-masked","title":"Context Analysis for Pre-trained Masked Language Models","date":"2020-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-weak-link-between-importance-and","title":"On the weak link between importance and prunability of attention heads","date":"2020-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"methods-for-pruning-deep-neural-networks","title":"Methods for Pruning Deep Neural Networks","date":"2020-10-31","arxiv_id":"2011.00241","n_code_links":0,"syntology":null},{"paper":null,"slug":"fusion-catalyzed-pruning-for-optimizing-deep","title":"Fusion-Catalyzed Pruning for Optimizing Deep Learning on Intelligent Edge Devices","date":"2020-10-30","arxiv_id":"2010.16165","n_code_links":0,"syntology":null},{"paper":"/paper/greedy-optimization-provably-wins-the-lottery","slug":"greedy-optimization-provably-wins-the-lottery","title":"Greedy Optimization Provably Wins the Lottery: Logarithmic Number of Winning Tickets is Enough","date":"2020-10-29","arxiv_id":"2010.15969","n_code_links":1,"syntology":null},{"paper":"/paper/supervised-sequential-pattern-mining-of-event","slug":"supervised-sequential-pattern-mining-of-event","title":"Supervised sequential pattern mining of event sequences in sport to identify important patterns of play: an application to rugby union","date":"2020-10-29","arxiv_id":"2010.15377","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-study-on-efficiency-in-continual-learning","title":"A Study on Efficiency in Continual Learning Inspired by Human Learning","date":"2020-10-28","arxiv_id":"2010.15187","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-agnostic-filter-gating-for-efficient","title":"Data Agnostic Filter Gating for Efficient Deep Networks","date":"2020-10-28","arxiv_id":"2010.15041","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-channel-pruning-search","title":"Differentiable Channel Sparsity Search via Weight Sharing within Filters","date":"2020-10-28","arxiv_id":"2010.14714","n_code_links":0,"syntology":null},{"paper":null,"slug":"mitigating-backdoor-attacks-in-federated","title":"Mitigating Backdoor Attacks in Federated Learning","date":"2020-10-28","arxiv_id":"2011.01767","n_code_links":0,"syntology":null},{"paper":"/paper/a-computationally-efficient-approach-to-black","slug":"a-computationally-efficient-approach-to-black","title":"A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance","date":"2020-10-27","arxiv_id":"2010.13997","n_code_links":1,"syntology":null},{"paper":"/paper/physics-based-deep-learning-for-fiber-optic","slug":"physics-based-deep-learning-for-fiber-optic","title":"Physics-Based Deep Learning for Fiber-Optic Communication Systems","date":"2020-10-27","arxiv_id":"2010.14258","n_code_links":1,"syntology":null},{"paper":"/paper/fastformers-highly-efficient-transformer","slug":"fastformers-highly-efficient-transformer","title":"FastFormers: Highly Efficient Transformer Models for Natural Language Understanding","date":"2020-10-26","arxiv_id":"2010.13382","n_code_links":2,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["microsoft/fastformers"],"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/neuron-merging-compensating-for-pruned","slug":"neuron-merging-compensating-for-pruned","title":"Neuron Merging: Compensating for Pruned Neurons","date":"2020-10-25","arxiv_id":"2010.13160","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 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["friendshipkim/neuron-merging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"mars-multi-macro-architecture-sram-cim-based","title":"MARS: Multi-macro Architecture SRAM CIM-Based Accelerator with Co-designed Compressed Neural Networks","date":"2020-10-24","arxiv_id":"2010.12861","n_code_links":0,"syntology":null},{"paper":null,"slug":"autopruning-for-deep-neural-network-with","title":"AutoPruning for Deep Neural Network with Dynamic Channel Masking","date":"2020-10-22","arxiv_id":"2010.12021","n_code_links":0,"syntology":null},{"paper":"/paper/exploring-search-space-trees-using-an-adapted","slug":"exploring-search-space-trees-using-an-adapted","title":"Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems","date":"2020-10-22","arxiv_id":"2010.11523","n_code_links":2,"syntology":null},{"paper":"/paper/mtgat-multimodal-temporal-graph-attention","slug":"mtgat-multimodal-temporal-graph-attention","title":"MTAG: Modal-Temporal Attention Graph for Unaligned Human Multimodal Language Sequences","date":"2020-10-22","arxiv_id":"2010.11985","n_code_links":1,"syntology":null},{"paper":"/paper/tensor-reordering-for-cnn-compression","slug":"tensor-reordering-for-cnn-compression","title":"Tensor Reordering for CNN Compression","date":"2020-10-22","arxiv_id":"2010.12110","n_code_links":1,"syntology":null}],"record_sha256":"98a06f9fdd54ec6f8a9366cc188174eded15f3a15835e6008fc8967d2aca1604","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}