{"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/37","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":37,"pages_in_order":39,"rows_per_page":100,"rows":[3601,3700],"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/36","next":"/method/pruning/papers/38","papers":[{"paper":null,"slug":"partition-pruning-parallelization-aware","title":"Partition Pruning: Parallelization-Aware Pruning for Deep Neural Networks","date":"2019-01-21","arxiv_id":"1901.11391","n_code_links":0,"syntology":null},{"paper":null,"slug":"practical-algorithms-for-multi-stage-voting","title":"Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking","date":"2019-01-16","arxiv_id":"1901.09791","n_code_links":0,"syntology":null},{"paper":null,"slug":"impact-of-data-pruning-on-machine-learning","title":"Impact of Data Pruning on Machine Learning Algorithm Performance","date":"2019-01-11","arxiv_id":"1901.10539","n_code_links":0,"syntology":null},{"paper":"/paper/a-bayesian-decision-tree-algorithm","slug":"a-bayesian-decision-tree-algorithm","title":"A Bayesian Decision Tree Algorithm","date":"2019-01-10","arxiv_id":"1901.03214","n_code_links":1,"syntology":null},{"paper":null,"slug":"how-compact-assessing-compactness-of","title":"How Compact?: Assessing Compactness of Representations through Layer-Wise Pruning","date":"2019-01-09","arxiv_id":"1901.02757","n_code_links":0,"syntology":null},{"paper":null,"slug":"spatial-winograd-pruning-enabling-sparse","title":"Spatial-Winograd Pruning Enabling Sparse Winograd Convolution","date":"2019-01-08","arxiv_id":"1901.02132","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-tree-search-for-portfolio-management","title":"A* Tree Search for Portfolio Management","date":"2019-01-07","arxiv_id":"1901.01855","n_code_links":0,"syntology":null},{"paper":"/paper/gasl-guided-attention-for-sparsity-learning","slug":"gasl-guided-attention-for-sparsity-learning","title":"GASL: Guided Attention for Sparsity Learning in Deep Neural Networks","date":"2019-01-07","arxiv_id":"1901.01939","n_code_links":2,"syntology":null},{"paper":null,"slug":"bandwidth-reduction-using-importance-weighted","title":"Bandwidth Reduction using Importance Weighted Pruning on Ring AllReduce","date":"2019-01-06","arxiv_id":"1901.01544","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-improved-multi-objective-genetic-algorithm","title":"An Improved multi-objective genetic algorithm based on orthogonal design and adaptive clustering pruning strategy","date":"2019-01-03","arxiv_id":"1901.00577","n_code_links":0,"syntology":null},{"paper":"/paper/admm-nn-an-algorithm-hardware-co-design","slug":"admm-nn-an-algorithm-hardware-co-design","title":"ADMM-NN: An Algorithm-Hardware Co-Design Framework of DNNs Using Alternating Direction Method of Multipliers","date":"2018-12-31","arxiv_id":"1812.11677","n_code_links":1,"syntology":null},{"paper":"/paper/studying-the-plasticity-in-deep-convolutional","slug":"studying-the-plasticity-in-deep-convolutional","title":"Studying the Plasticity in Deep Convolutional Neural Networks using Random Pruning","date":"2018-12-26","arxiv_id":"1812.10240","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-runtime-feature-map-pruning","slug":"dynamic-runtime-feature-map-pruning","title":"Dynamic Runtime Feature Map Pruning","date":"2018-12-24","arxiv_id":"1812.09922","n_code_links":1,"syntology":null},{"paper":null,"slug":"artificial-neural-networks-condensation-a","title":"Artificial neural networks condensation: A strategy to facilitate adaption of machine learning in medical settings by reducing computational burden","date":"2018-12-23","arxiv_id":"1812.09659","n_code_links":0,"syntology":null},{"paper":null,"slug":"entropy-constrained-training-of-deep-neural","title":"Entropy-Constrained Training of Deep Neural Networks","date":"2018-12-18","arxiv_id":"1812.07520","n_code_links":0,"syntology":null},{"paper":null,"slug":"lora-learning-to-optimize-for-resource","title":"LORM: Learning to Optimize for Resource Management in Wireless Networks with Few Training Samples","date":"2018-12-18","arxiv_id":"1812.07998","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-layer-decomposition-recomposition-framework","title":"A Layer Decomposition-Recomposition Framework for Neuron Pruning towards Accurate Lightweight Networks","date":"2018-12-17","arxiv_id":"1812.06611","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-low-effort-approach-to-structured-cnn","title":"A Low Effort Approach to Structured CNN Design Using PCA","date":"2018-12-15","arxiv_id":"1812.06224","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-mainsubsidiary-network-framework-for","title":"A Main/Subsidiary Network Framework for Simplifying Binary Neural Network","date":"2018-12-11","arxiv_id":"1812.04210","n_code_links":0,"syntology":null},{"paper":"/paper/deep-networks-with-probabilistic-gates","slug":"deep-networks-with-probabilistic-gates","title":"Channel selection using Gumbel Softmax","date":"2018-12-11","arxiv_id":"1812.04180","n_code_links":1,"syntology":null},{"paper":"/paper/exploiting-kernel-sparsity-and-entropy-for","slug":"exploiting-kernel-sparsity-and-entropy-for","title":"Exploiting Kernel Sparsity and Entropy for Interpretable CNN Compression","date":"2018-12-11","arxiv_id":"1812.04368","n_code_links":1,"syntology":null},{"paper":"/paper/trained-rank-pruning-for-efficient-deep","slug":"trained-rank-pruning-for-efficient-deep","title":"Trained Rank Pruning for Efficient Deep Neural Networks","date":"2018-12-06","arxiv_id":"1812.02402","n_code_links":1,"syntology":null},{"paper":null,"slug":"droppruning-for-model-compression","title":"Stochastic Model Pruning via Weight Dropping Away and Back","date":"2018-12-05","arxiv_id":"1812.02035","n_code_links":0,"syntology":null},{"paper":"/paper/knowledge-distillation-from-few-samples","slug":"knowledge-distillation-from-few-samples","title":"Few Sample Knowledge Distillation for Efficient Network Compression","date":"2018-12-05","arxiv_id":"1812.01839","n_code_links":1,"syntology":null},{"paper":null,"slug":"auto-tuning-tensorflow-threading-model-for","title":"Auto-tuning TensorFlow Threading Model for CPU Backend","date":"2018-12-04","arxiv_id":"1812.01665","n_code_links":0,"syntology":null},{"paper":null,"slug":"channel-wise-pruning-of-neural-networks-with","title":"Channel-wise pruning of neural networks with tapering resource constraint","date":"2018-12-04","arxiv_id":"1812.07060","n_code_links":0,"syntology":null},{"paper":"/paper/overcoming-catastrophic-forgetting-by-soft","slug":"overcoming-catastrophic-forgetting-by-soft","title":"Overcoming Catastrophic Forgetting by Soft Parameter Pruning","date":"2018-12-04","arxiv_id":"1812.01640","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-hierarchical-machine-a-flexible-divide","title":"Deep Hierarchical Machine: a Flexible Divide-and-Conquer Architecture","date":"2018-12-03","arxiv_id":"1812.00647","n_code_links":0,"syntology":null},{"paper":null,"slug":"network-compression-via-recursive-bayesian","title":"Accelerate CNN via Recursive Bayesian Pruning","date":"2018-12-02","arxiv_id":"1812.00353","n_code_links":0,"syntology":null},{"paper":null,"slug":"alternating-optimization-of-decision-trees","title":"Alternating optimization of decision trees, with application to learning sparse oblique trees","date":"2018-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/connectionist-temporal-classification-with","slug":"connectionist-temporal-classification-with","title":"Connectionist Temporal Classification with Maximum Entropy Regularization","date":"2018-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-nonmyopic-batch-active-search","title":"Efficient nonmyopic batch active search","date":"2018-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"frequency-domain-dynamic-pruning-for","title":"Frequency-Domain Dynamic Pruning for Convolutional Neural Networks","date":"2018-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pac-bayes-tree-weighted-subtrees-with","title":"PAC-Bayes Tree: weighted subtrees with guarantees","date":"2018-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"tetris-tile-matching-the-tremendous-irregular","title":"TETRIS: TilE-matching the TRemendous Irregular Sparsity","date":"2018-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/an-implementation-of-the-poisson-multi","slug":"an-implementation-of-the-poisson-multi","title":"An Implementation of the Poisson Multi-Bernoulli Mixture Trajectory Filter via Dual Decomposition","date":"2018-11-29","arxiv_id":"1811.12281","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-semantic-segmentation-for-visual","title":"Efficient Semantic Segmentation for Visual Bird's-eye View Interpretation","date":"2018-11-29","arxiv_id":"1811.12008","n_code_links":0,"syntology":null},{"paper":null,"slug":"game-tree-search-in-a-robust-multistage","title":"Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms","date":"2018-11-29","arxiv_id":"1811.12146","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-implicit-filter-level-sparsity-in","title":"On Implicit Filter Level Sparsity in Convolutional Neural Networks","date":"2018-11-29","arxiv_id":"1811.12495","n_code_links":0,"syntology":null},{"paper":"/paper/dense-xunit-networks","slug":"dense-xunit-networks","title":"Dense xUnit Networks","date":"2018-11-27","arxiv_id":"1811.11051","n_code_links":1,"syntology":null},{"paper":"/paper/automatic-induction-of-neural-network","slug":"automatic-induction-of-neural-network","title":"Automatic Induction of Neural Network Decision Tree Algorithms","date":"2018-11-26","arxiv_id":"1811.10735","n_code_links":1,"syntology":null},{"paper":null,"slug":"scene-categorization-from-contours-medial","title":"Scene Categorization from Contours: Medial Axis Based Salience Measures","date":"2018-11-26","arxiv_id":"1811.10524","n_code_links":0,"syntology":null},{"paper":"/paper/learning-grouped-convolution-for-efficient","slug":"learning-grouped-convolution-for-efficient","title":"Efficient Structured Pruning and Architecture Searching for Group Convolution","date":"2018-11-23","arxiv_id":"1811.09341","n_code_links":1,"syntology":null},{"paper":null,"slug":"structured-pruning-of-neural-networks-with","title":"Structured Pruning of Neural Networks with Budget-Aware Regularization","date":"2018-11-23","arxiv_id":"1811.09332","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-adaptive-pruning-for-efficient","title":"Graph-Adaptive Pruning for Efficient Inference of Convolutional Neural Networks","date":"2018-11-21","arxiv_id":"1811.08589","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-layer-pruning-framework-for-compressing","title":"Multi-layer Pruning Framework for Compressing Single Shot MultiBox Detector","date":"2018-11-20","arxiv_id":"1811.08342","n_code_links":0,"syntology":null},{"paper":null,"slug":"stability-based-filter-pruning-for","title":"Stability Based Filter Pruning for Accelerating Deep CNNs","date":"2018-11-20","arxiv_id":"1811.08321","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-pruning-for-efficient-convnets-via","title":"Structured Pruning for Efficient ConvNets via Incremental Regularization","date":"2018-11-20","arxiv_id":"1811.08390","n_code_links":0,"syntology":null},{"paper":null,"slug":"three-dimensional-convolutional-neural","title":"Three Dimensional Convolutional Neural Network Pruning with Regularization-Based Method","date":"2018-11-19","arxiv_id":"1811.07555","n_code_links":0,"syntology":null},{"paper":"/paper/repr-improved-training-of-convolutional","slug":"repr-improved-training-of-convolutional","title":"RePr: Improved Training of Convolutional Filters","date":"2018-11-18","arxiv_id":"1811.07275","n_code_links":1,"syntology":null},{"paper":null,"slug":"vectorization-of-hypotheses-and-speech-for","title":"Vectorization of hypotheses and speech for faster beam search in encoder decoder-based speech recognition","date":"2018-11-12","arxiv_id":"1811.04568","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-skip-ineffectual-recurrent","title":"Learning to Skip Ineffectual Recurrent Computations in LSTMs","date":"2018-11-09","arxiv_id":"1811.10396","n_code_links":0,"syntology":null},{"paper":"/paper/stratified-constructive-disjunction-and","slug":"stratified-constructive-disjunction-and","title":"ITE: A Lightweight Implementation of Stratified Reasoning for Constructive Logical Operators","date":"2018-11-09","arxiv_id":"1811.03906","n_code_links":1,"syntology":null},{"paper":null,"slug":"abc-efficient-selection-of-machine-learning","title":"ABC: Efficient Selection of Machine Learning Configuration on Large Dataset","date":"2018-11-08","arxiv_id":"1811.03250","n_code_links":0,"syntology":null},{"paper":null,"slug":"synaptic-strength-for-convolutional-neural","title":"Synaptic Strength For Convolutional Neural Network","date":"2018-11-06","arxiv_id":"1811.02454","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-framework-of-dnn-weight-pruning-and","title":"A Unified Framework of DNN Weight Pruning and Weight Clustering/Quantization Using ADMM","date":"2018-11-05","arxiv_id":"1811.01907","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-adaptive-pruning-algorithm-for-spoofing","title":"An Adaptive Pruning Algorithm for Spoofing Localisation Based on Tropical Geometry","date":"2018-11-01","arxiv_id":"1811.01017","n_code_links":0,"syntology":null},{"paper":null,"slug":"balanced-sparsity-for-efficient-dnn-inference","title":"Balanced Sparsity for Efficient DNN Inference on GPU","date":"2018-11-01","arxiv_id":"1811.00206","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-pruning-thinner-sparse-networks-for","title":"Hybrid Pruning: Thinner Sparse Networks for Fast Inference on Edge Devices","date":"2018-11-01","arxiv_id":"1811.00482","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-filter-via-geometric-median-for-deep","slug":"pruning-filter-via-geometric-median-for-deep","title":"Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration","date":"2018-11-01","arxiv_id":"1811.00250","n_code_links":3,"syntology":null},{"paper":null,"slug":"demystifying-neural-network-filter-pruning","title":"Demystifying Neural Network Filter Pruning","date":"2018-10-29","arxiv_id":"1811.02639","n_code_links":0,"syntology":null},{"paper":"/paper/discrimination-aware-channel-pruning-for-deep","slug":"discrimination-aware-channel-pruning-for-deep","title":"Discrimination-aware Channel Pruning for Deep Neural Networks","date":"2018-10-28","arxiv_id":"1810.11809","n_code_links":1,"syntology":null},{"paper":null,"slug":"distilling-with-performance-enhanced-students","title":"Distilling with Performance Enhanced Students","date":"2018-10-24","arxiv_id":"1810.10460","n_code_links":0,"syntology":null},{"paper":null,"slug":"convolutional-neural-network-pruning-to","title":"Convolutional Neural Network Pruning to Accelerate Membrane Segmentation in Electron Microscopy","date":"2018-10-23","arxiv_id":"1810.09735","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-dnns-with-improved-adversarial","title":"Sparse DNNs with Improved Adversarial Robustness","date":"2018-10-23","arxiv_id":"1810.09619","n_code_links":0,"syntology":null},{"paper":null,"slug":"compression-of-deep-neural-networks-by","title":"Compression of Deep Neural Networks by combining pruning and low rank decomposition","date":"2018-10-20","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-parameter-reallocation-improves","title":"Dynamic parameter reallocation improves trainability of deep convolutional networks","date":"2018-10-20","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-at-a-glance-a-structured-class-blind","title":"Pruning at a Glance: A Structured Class-Blind Pruning Technique for Model Compression","date":"2018-10-20","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/targeted-dropout","slug":"targeted-dropout","title":"Targeted Dropout","date":"2018-10-20","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"on-learning-wire-length-efficient-neural","title":"On Learning Wire-Length Efficient Neural Networks","date":"2018-10-19","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/autonomous-deep-learning-continual-learning","slug":"autonomous-deep-learning-continual-learning","title":"Autonomous Deep Learning: Continual Learning Approach for Dynamic Environments","date":"2018-10-17","arxiv_id":"1810.07348","n_code_links":1,"syntology":null},{"paper":null,"slug":"progressive-weight-pruning-of-deep-neural","title":"Progressive Weight Pruning of Deep Neural Networks using ADMM","date":"2018-10-17","arxiv_id":"1810.07378","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-deep-neural-networks-using-partial","slug":"pruning-deep-neural-networks-using-partial","title":"Pruning Deep Neural Networks using Partial Least Squares","date":"2018-10-17","arxiv_id":"1810.07610","n_code_links":1,"syntology":null},{"paper":null,"slug":"unsupervised-ensemble-learning-via-ising","title":"Unsupervised Ensemble Learning via Ising Model Approximation with Application to Phenotyping Prediction","date":"2018-10-15","arxiv_id":"1810.06376","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-channel-pruning-feature-boosting-and","slug":"dynamic-channel-pruning-feature-boosting-and","title":"Dynamic Channel Pruning: Feature Boosting and Suppression","date":"2018-10-12","arxiv_id":"1810.05331","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":3,"n_instrument":2,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["deep-fry/mayo"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"interpretable-convolutional-filter-pruning","title":"Functionality-Oriented Convolutional Filter Pruning","date":"2018-10-12","arxiv_id":"1810.07322","n_code_links":0,"syntology":null},{"paper":"/paper/rethinking-the-value-of-network-pruning","slug":"rethinking-the-value-of-network-pruning","title":"Rethinking the Value of Network Pruning","date":"2018-10-11","arxiv_id":"1810.05270","n_code_links":2,"syntology":null},{"paper":"/paper/pruning-neural-networks-is-it-time-to-nip-it","slug":"pruning-neural-networks-is-it-time-to-nip-it","title":"A Closer Look at Structured Pruning for Neural Network Compression","date":"2018-10-10","arxiv_id":"1810.04622","n_code_links":2,"syntology":null},{"paper":null,"slug":"pruning-neural-networks-is-it-time-to-nip-it-1","title":"Pruning neural networks: is it time to nip it in the bud?","date":"2018-10-10","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"rate-distortion-for-model-compression-from","title":"Rate Distortion For Model Compression: From Theory To Practice","date":"2018-10-09","arxiv_id":"1810.06401","n_code_links":0,"syntology":null},{"paper":"/paper/snip-single-shot-network-pruning-based-on","slug":"snip-single-shot-network-pruning-based-on","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","date":"2018-10-04","arxiv_id":"1810.02340","n_code_links":8,"syntology":{"ran":5,"of":12,"n_ran_checked":1,"n_instrument":4,"unverified":7,"pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","official":{"repos":["namhoonlee/snip-public"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"learning-sparse-optimal-rule-fit-by-safe","title":"Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screening","date":"2018-10-03","arxiv_id":"1810.01683","n_code_links":0,"syntology":null},{"paper":null,"slug":"target-aware-network-adaptation-for-efficient","title":"Target Aware Network Adaptation for Efficient Representation Learning","date":"2018-10-02","arxiv_id":"1810.01104","n_code_links":0,"syntology":null},{"paper":null,"slug":"disambiguated-skip-gram-model","title":"Disambiguated skip-gram model","date":"2018-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/layer-compensated-pruning-for-resource","slug":"layer-compensated-pruning-for-resource","title":"Layer-compensated Pruning for Resource-constrained Convolutional Neural Networks","date":"2018-10-01","arxiv_id":"1810.00518","n_code_links":1,"syntology":null},{"paper":"/paper/minimal-random-code-learning-getting-bits","slug":"minimal-random-code-learning-getting-bits","title":"Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameters","date":"2018-09-30","arxiv_id":"1810.00440","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["cambridge-mlg/miracle"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"adaptive-pruning-of-neural-language-models","title":"Adaptive Pruning of Neural Language Models for Mobile Devices","date":"2018-09-27","arxiv_id":"1809.10282","n_code_links":0,"syntology":null},{"paper":null,"slug":"mlprune-multi-layer-pruning-for-automated","title":"MLPrune: Multi-Layer Pruning for Automated Neural Network Compression","date":"2018-09-27","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/graph-convolution-over-pruned-dependency","slug":"graph-convolution-over-pruned-dependency","title":"Graph Convolution over Pruned Dependency Trees Improves Relation Extraction","date":"2018-09-26","arxiv_id":"1809.10185","n_code_links":1,"syntology":null},{"paper":"/paper/discovering-reliable-dependencies-from-data","slug":"discovering-reliable-dependencies-from-data","title":"Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms","date":"2018-09-14","arxiv_id":"1809.05467","n_code_links":1,"syntology":null},{"paper":null,"slug":"defensive-dropout-for-hardening-deep-neural","title":"Defensive Dropout for Hardening Deep Neural Networks under Adversarial Attacks","date":"2018-09-13","arxiv_id":"1809.05165","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-alignment-problem-in-multi-head","title":"On The Alignment Problem In Multi-Head Attention-Based Neural Machine Translation","date":"2018-09-11","arxiv_id":"1809.03985","n_code_links":0,"syntology":null},{"paper":"/paper/solving-imperfect-information-games-via","slug":"solving-imperfect-information-games-via","title":"Solving Imperfect-Information Games via Discounted Regret Minimization","date":"2018-09-11","arxiv_id":"1809.04040","n_code_links":5,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":null}},{"paper":null,"slug":"2pfpce-two-phase-filter-pruning-based-on","title":"2PFPCE: Two-Phase Filter Pruning Based on Conditional Entropy","date":"2018-09-06","arxiv_id":"1809.02220","n_code_links":0,"syntology":null},{"paper":null,"slug":"egocentric-activity-prediction-via-event","title":"Egocentric Activity Prediction via Event Modulated Attention","date":"2018-09-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-low-precision-deep-neural-networks","title":"Learning Sparse Low-Precision Neural Networks With Learnable Regularization","date":"2018-09-01","arxiv_id":"1809.00095","n_code_links":0,"syntology":null},{"paper":"/paper/elastic-bands-across-the-path-a-new-framework","slug":"elastic-bands-across-the-path-a-new-framework","title":"Elastic bands across the path: A new framework and methods to lower bound DTW","date":"2018-08-29","arxiv_id":"1808.09617","n_code_links":1,"syntology":null},{"paper":null,"slug":"spectral-pruning-compressing-deep-neural","title":"Spectral Pruning: Compressing Deep Neural Networks via Spectral Analysis and its Generalization Error","date":"2018-08-26","arxiv_id":"1808.08558","n_code_links":0,"syntology":null},{"paper":"/paper/progressive-deep-neural-networks-acceleration","slug":"progressive-deep-neural-networks-acceleration","title":"Asymptotic Soft Filter Pruning for Deep Convolutional Neural Networks","date":"2018-08-22","arxiv_id":"1808.07471","n_code_links":2,"syntology":null},{"paper":"/paper/soft-filter-pruning-for-accelerating-deep","slug":"soft-filter-pruning-for-accelerating-deep","title":"Soft Filter Pruning for Accelerating Deep Convolutional Neural Networks","date":"2018-08-21","arxiv_id":"1808.06866","n_code_links":6,"syntology":null}],"record_sha256":"684d7a5a29f1a1bc64e93c75103cb6778e2de0bf5a0025f486489519dde954c4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}