{"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/38","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":38,"pages_in_order":39,"rows_per_page":100,"rows":[3701,3800],"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/37","next":"/method/pruning/papers/39","papers":[{"paper":"/paper/slimnets-an-exploration-of-deep-model","slug":"slimnets-an-exploration-of-deep-model","title":"SlimNets: An Exploration of Deep Model Compression and Acceleration","date":"2018-08-01","arxiv_id":"1808.00496","n_code_links":1,"syntology":null},{"paper":null,"slug":"spectral-mixture-kernels-with-time-and-phase","title":"Compressible Spectral Mixture Kernels with Sparse Dependency Structures for Gaussian Processes","date":"2018-08-01","arxiv_id":"1808.00560","n_code_links":0,"syntology":null},{"paper":"/paper/unsupervised-morphology-learning-with","slug":"unsupervised-morphology-learning-with","title":"Unsupervised Morphology Learning with Statistical Paradigms","date":"2018-08-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/adam-admm-a-unified-systematic-framework-of","slug":"adam-admm-a-unified-systematic-framework-of","title":"StructADMM: A Systematic, High-Efficiency Framework of Structured Weight Pruning for DNNs","date":"2018-07-29","arxiv_id":"1807.11091","n_code_links":1,"syntology":null},{"paper":null,"slug":"crossbar-aware-neural-network-pruning","title":"Crossbar-aware neural network pruning","date":"2018-07-25","arxiv_id":"1807.10816","n_code_links":0,"syntology":null},{"paper":null,"slug":"modified-regularized-dual-averaging-method","title":"Make $\\ell_1$ Regularization Effective in Training Sparse CNN","date":"2018-07-11","arxiv_id":"1807.04222","n_code_links":0,"syntology":null},{"paper":"/paper/a-game-based-approximate-verification-of-deep","slug":"a-game-based-approximate-verification-of-deep","title":"A Game-Based Approximate Verification of Deep Neural Networks with Provable Guarantees","date":"2018-07-10","arxiv_id":"1807.03571","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["TrustAI/DeepGame"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"jointly-learning-relevant-subgraph-patterns","title":"Jointly learning relevant subgraph patterns and nonlinear models of their indicators","date":"2018-07-09","arxiv_id":"1807.02963","n_code_links":0,"syntology":null},{"paper":null,"slug":"evenly-cascaded-convolutional-networks","title":"Evenly Cascaded Convolutional Networks","date":"2018-07-02","arxiv_id":"1807.00456","n_code_links":0,"syntology":null},{"paper":"/paper/compressing-neural-networks-using-the","slug":"compressing-neural-networks-using-the","title":"Compressing Neural Networks using the Variational Information Bottelneck","date":"2018-07-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"cruise-cold-start-new-skill-development-via","title":"CRUISE: Cold-Start New Skill Development via Iterative Utterance Generation","date":"2018-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/syntax-for-semantic-role-labeling-to-be-or","slug":"syntax-for-semantic-role-labeling-to-be-or","title":"Syntax for Semantic Role Labeling, To Be, Or Not To Be","date":"2018-07-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"generalized-chart-constraints-for-efficient","title":"Generalized chart constraints for efficient PCFG and TAG parsing","date":"2018-06-27","arxiv_id":"1806.10654","n_code_links":0,"syntology":null},{"paper":null,"slug":"joint-neural-entity-disambiguation-with","title":"Joint Neural Entity Disambiguation with Output Space Search","date":"2018-06-19","arxiv_id":"1806.07495","n_code_links":0,"syntology":null},{"paper":"/paper/fast-convex-pruning-of-deep-neural-networks","slug":"fast-convex-pruning-of-deep-neural-networks","title":"Fast Convex Pruning of Deep Neural Networks","date":"2018-06-17","arxiv_id":"1806.06457","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":null}},{"paper":null,"slug":"detecting-dead-weights-and-units-in-neural","title":"Detecting Dead Weights and Units in Neural Networks","date":"2018-06-15","arxiv_id":"1806.06068","n_code_links":0,"syntology":null},{"paper":null,"slug":"scsp-spectral-clustering-filter-pruning-with","title":"SCSP: Spectral Clustering Filter Pruning with Soft Self-adaption Manners","date":"2018-06-14","arxiv_id":"1806.05320","n_code_links":0,"syntology":null},{"paper":"/paper/ensemble-pruning-based-on-objection","slug":"ensemble-pruning-based-on-objection","title":"Ensemble Pruning based on Objection Maximization with a General Distributed Framework","date":"2018-06-13","arxiv_id":"1806.04899","n_code_links":1,"syntology":null},{"paper":null,"slug":"smallify-learning-network-size-while-training","title":"Smallify: Learning Network Size while Training","date":"2018-06-10","arxiv_id":"1806.03723","n_code_links":0,"syntology":null},{"paper":"/paper/alearning-compressiona-algorithms-for-neural","slug":"alearning-compressiona-algorithms-for-neural","title":"“Learning-Compression” Algorithms for Neural Net Pruning","date":"2018-06-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"clip-q-deep-network-compression-learning-by","title":"CLIP-Q: Deep Network Compression Learning by In-Parallel Pruning-Quantization","date":"2018-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-facial-action-units-from-web-images","title":"Learning Facial Action Units From Web Images With Scalable Weakly Supervised Clustering","date":"2018-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"structurally-sparsified-backward-propagation","title":"Structurally Sparsified Backward Propagation for Faster Long Short-Term Memory Training","date":"2018-06-01","arxiv_id":"1806.00512","n_code_links":0,"syntology":null},{"paper":"/paper/fine-pruning-defending-against-backdooring","slug":"fine-pruning-defending-against-backdooring","title":"Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networks","date":"2018-05-30","arxiv_id":"1805.12185","n_code_links":3,"syntology":null},{"paper":null,"slug":"grow-and-prune-compact-fast-and-accurate","title":"Grow and Prune Compact, Fast, and Accurate LSTMs","date":"2018-05-30","arxiv_id":"1805.11797","n_code_links":0,"syntology":null},{"paper":null,"slug":"light-interception-modelling-using","title":"Light interception modelling using unstructured LiDAR data in avocado orchards","date":"2018-05-30","arxiv_id":"1806.01118","n_code_links":0,"syntology":null},{"paper":null,"slug":"mpdcompress-matrix-permutation-decomposition","title":"MPDCompress - Matrix Permutation Decomposition Algorithm for Deep Neural Network Compression","date":"2018-05-30","arxiv_id":"1805.12085","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-channel-pruning-method-for-deep","title":"A novel channel pruning method for deep neural network compression","date":"2018-05-29","arxiv_id":"1805.11394","n_code_links":0,"syntology":null},{"paper":"/paper/channel-gating-neural-networks","slug":"channel-gating-neural-networks","title":"Channel Gating Neural Networks","date":"2018-05-29","arxiv_id":"1805.12549","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":0,"n_instrument":2,"unverified":2,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":null,"slug":"compact-and-computationally-efficient","title":"Compact and Computationally Efficient Representation of Deep Neural Networks","date":"2018-05-27","arxiv_id":"1805.10692","n_code_links":0,"syntology":null},{"paper":null,"slug":"autopruner-an-end-to-end-trainable-filter","title":"AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inference","date":"2018-05-23","arxiv_id":"1805.08941","n_code_links":0,"syntology":null},{"paper":null,"slug":"practical-algorithms-for-stv-and-ranked-pairs","title":"Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking","date":"2018-05-17","arxiv_id":"1805.06992","n_code_links":0,"syntology":null},{"paper":"/paper/scaling-associative-classification-for-very","slug":"scaling-associative-classification-for-very","title":"Scaling associative classification for very large datasets","date":"2018-05-10","arxiv_id":"1805.03887","n_code_links":1,"syntology":null},{"paper":null,"slug":"enhancing-the-regularization-effect-of-weight","title":"Enhancing the Regularization Effect of Weight Pruning in Artificial Neural Networks","date":"2018-05-04","arxiv_id":"1805.01930","n_code_links":0,"syntology":null},{"paper":"/paper/accelerator-aware-pruning-for-convolutional","slug":"accelerator-aware-pruning-for-convolutional","title":"Accelerator-Aware Pruning for Convolutional Neural Networks","date":"2018-04-26","arxiv_id":"1804.09862","n_code_links":3,"syntology":null},{"paper":null,"slug":"sparse-persistent-rnns-squeezing-large","title":"Sparse Persistent RNNs: Squeezing Large Recurrent Networks On-Chip","date":"2018-04-26","arxiv_id":"1804.10223","n_code_links":0,"syntology":null},{"paper":"/paper/structured-deep-neural-network-pruning-by","slug":"structured-deep-neural-network-pruning-by","title":"Structured Pruning for Efficient ConvNets via Incremental Regularization","date":"2018-04-25","arxiv_id":"1804.09461","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-contextualized-representation","slug":"efficient-contextualized-representation","title":"Efficient Contextualized Representation: Language Model Pruning for Sequence Labeling","date":"2018-04-20","arxiv_id":"1804.07827","n_code_links":1,"syntology":null},{"paper":null,"slug":"dictionary-learning-from-local-towards-global","title":"Dictionary learning -- from local towards global and adaptive","date":"2018-04-19","arxiv_id":"1804.07101","n_code_links":0,"syntology":null},{"paper":null,"slug":"minimizing-area-and-energy-of-deep-learning","title":"Minimizing Area and Energy of Deep Learning Hardware Design Using Collective Low Precision and Structured Compression","date":"2018-04-19","arxiv_id":"1804.07370","n_code_links":0,"syntology":null},{"paper":"/paper/a-systematic-dnn-weight-pruning-framework","slug":"a-systematic-dnn-weight-pruning-framework","title":"A Systematic DNN Weight Pruning Framework using Alternating Direction Method of Multipliers","date":"2018-04-10","arxiv_id":"1804.03294","n_code_links":4,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["KaiqiZhang/admm-pruning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"a-gpu-based-wfst-decoder-with-exact-lattice","title":"A GPU-based WFST Decoder with Exact Lattice Generation","date":"2018-04-09","arxiv_id":"1804.03243","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-proposal-of-interactive-growing","title":"A Proposal of Interactive Growing Hierarchical SOM","date":"2018-04-08","arxiv_id":"1804.02620","n_code_links":0,"syntology":null},{"paper":"/paper/fisher-pruning-of-deep-nets-for-facial-trait","slug":"fisher-pruning-of-deep-nets-for-facial-trait","title":"Task dependent Deep LDA pruning of neural networks","date":"2018-03-21","arxiv_id":"1803.08134","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-recurrent-neural-networks-using","title":"Efficient Recurrent Neural Networks using Structured Matrices in FPGAs","date":"2018-03-20","arxiv_id":"1803.07661","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-neural-architecture-construction-using","title":"Fast Neural Architecture Construction using EnvelopeNets","date":"2018-03-18","arxiv_id":"1803.06744","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-hardware-realization-of","title":"Efficient Hardware Realization of Convolutional Neural Networks using Intra-Kernel Regular Pruning","date":"2018-03-15","arxiv_id":"1803.05909","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-linear-relationship-in-feature-map","title":"Exploring Linear Relationship in Feature Map Subspace for ConvNets Compression","date":"2018-03-15","arxiv_id":"1803.05729","n_code_links":0,"syntology":null},{"paper":null,"slug":"c-lstm-enabling-efficient-lstm-using","title":"C-LSTM: Enabling Efficient LSTM using Structured Compression Techniques on FPGAs","date":"2018-03-14","arxiv_id":"1803.06305","n_code_links":0,"syntology":null},{"paper":"/paper/feta-a-dca-pruning-algorithm-with","slug":"feta-a-dca-pruning-algorithm-with","title":"FeTa: A DCA Pruning Algorithm with Generalization Error Guarantees","date":"2018-03-12","arxiv_id":"1803.04239","n_code_links":1,"syntology":null},{"paper":null,"slug":"it-was-the-training-data-pruning-too","title":"It was the training data pruning too!","date":"2018-03-12","arxiv_id":"1803.04579","n_code_links":0,"syntology":null},{"paper":"/paper/the-lottery-ticket-hypothesis-finding-sparse","slug":"the-lottery-ticket-hypothesis-finding-sparse","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","date":"2018-03-09","arxiv_id":"1803.03635","n_code_links":24,"syntology":{"ran":12,"of":25,"n_ran_checked":10,"n_instrument":2,"unverified":13,"pointer_only":6,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 13 unverified","official":null}},{"paper":"/paper/stochastic-activation-pruning-for-robust","slug":"stochastic-activation-pruning-for-robust","title":"Stochastic Activation Pruning for Robust Adversarial Defense","date":"2018-03-05","arxiv_id":"1803.01442","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-sparse-structured-ensembles-with-sg","title":"Learning Sparse Structured Ensembles with SG-MCMC and Network Pruning","date":"2018-03-01","arxiv_id":"1803.00184","n_code_links":0,"syntology":null},{"paper":"/paper/compressing-neural-networks-using-the-1","slug":"compressing-neural-networks-using-the-1","title":"Compressing Neural Networks using the Variational Information Bottleneck","date":"2018-02-28","arxiv_id":"1802.10399","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":null}},{"paper":"/paper/escort-efficient-sparse-convolutional-neural","slug":"escort-efficient-sparse-convolutional-neural","title":"Escoin: Efficient Sparse Convolutional Neural Network Inference on GPUs","date":"2018-02-28","arxiv_id":"1802.10280","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-neural-audio-synthesis","slug":"efficient-neural-audio-synthesis","title":"Efficient Neural Audio Synthesis","date":"2018-02-23","arxiv_id":"1802.08435","n_code_links":16,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"layer-wise-synapse-optimization-for","title":"Layer-wise synapse optimization for implementing neural networks on general neuromorphic architectures","date":"2018-02-20","arxiv_id":"1802.06920","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-sparse-winograd-convolutional","slug":"efficient-sparse-winograd-convolutional","title":"Efficient Sparse-Winograd Convolutional Neural Networks","date":"2018-02-18","arxiv_id":"1802.06367","n_code_links":1,"syntology":null},{"paper":"/paper/systematic-weight-pruning-of-dnns-using","slug":"systematic-weight-pruning-of-dnns-using","title":"Systematic Weight Pruning of DNNs using Alternating Direction Method of Multipliers","date":"2018-02-15","arxiv_id":"1802.05747","n_code_links":1,"syntology":null},{"paper":"/paper/attention-based-guided-structured-sparsity-of","slug":"attention-based-guided-structured-sparsity-of","title":"Attention-Based Guided Structured Sparsity of Deep Neural Networks","date":"2018-02-13","arxiv_id":"1802.09902","n_code_links":1,"syntology":null},{"paper":null,"slug":"closnets-a-priori-sparse-topologies-for","title":"ClosNets: a Priori Sparse Topologies for Faster DNN Training","date":"2018-02-12","arxiv_id":"1802.03885","n_code_links":0,"syntology":null},{"paper":null,"slug":"analyzing-and-mitigating-the-impact-of","title":"Analyzing and Mitigating the Impact of Permanent Faults on a Systolic Array Based Neural Network Accelerator","date":"2018-02-11","arxiv_id":"1802.04657","n_code_links":0,"syntology":null},{"paper":null,"slug":"thundervolt-enabling-aggressive-voltage","title":"ThUnderVolt: Enabling Aggressive Voltage Underscaling and Timing Error Resilience for Energy Efficient Deep Neural Network Accelerators","date":"2018-02-11","arxiv_id":"1802.03806","n_code_links":0,"syntology":null},{"paper":"/paper/tsviz-demystification-of-deep-learning-models","slug":"tsviz-demystification-of-deep-learning-models","title":"TSViz: Demystification of Deep Learning Models for Time-Series Analysis","date":"2018-02-08","arxiv_id":"1802.02952","n_code_links":1,"syntology":null},{"paper":"/paper/learning-from-past-mistakes-improving","slug":"learning-from-past-mistakes-improving","title":"Learning from Past Mistakes: Improving Automatic Speech Recognition Output via Noisy-Clean Phrase Context Modeling","date":"2018-02-07","arxiv_id":"1802.02607","n_code_links":1,"syntology":null},{"paper":null,"slug":"re-weighted-learning-for-sparsifying-deep","title":"Re-Weighted Learning for Sparsifying Deep Neural Networks","date":"2018-02-05","arxiv_id":"1802.01616","n_code_links":0,"syntology":null},{"paper":null,"slug":"build-a-compact-binary-neural-network-through","title":"Build a Compact Binary Neural Network through Bit-level Sensitivity and Data Pruning","date":"2018-02-03","arxiv_id":"1802.00904","n_code_links":0,"syntology":null},{"paper":"/paper/scalable-levy-process-priors-for-spectral","slug":"scalable-levy-process-priors-for-spectral","title":"Scalable Lévy Process Priors for Spectral Kernel Learning","date":"2018-02-02","arxiv_id":"1802.00530","n_code_links":1,"syntology":null},{"paper":"/paper/rethinking-the-smaller-norm-less-informative","slug":"rethinking-the-smaller-norm-less-informative","title":"Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers","date":"2018-02-01","arxiv_id":"1802.00124","n_code_links":3,"syntology":null},{"paper":"/paper/recovering-from-random-pruning-on-the","slug":"recovering-from-random-pruning-on-the","title":"Recovering from Random Pruning: On the Plasticity of Deep Convolutional Neural Networks","date":"2018-01-31","arxiv_id":"1801.10447","n_code_links":1,"syntology":null},{"paper":null,"slug":"search-based-code-generation-for-machine","title":"Search Based Code Generation for Machine Learning Programs","date":"2018-01-29","arxiv_id":"1801.09373","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-prune-filters-in-convolutional","title":"Learning to Prune Filters in Convolutional Neural Networks","date":"2018-01-23","arxiv_id":"1801.07365","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-techniques-for-mixed-ensembles-of","slug":"pruning-techniques-for-mixed-ensembles-of","title":"Pruning Techniques for Mixed Ensembles of Genetic Programming Models","date":"2018-01-23","arxiv_id":"1801.07668","n_code_links":1,"syntology":null},{"paper":"/paper/faster-gaze-prediction-with-dense-networks","slug":"faster-gaze-prediction-with-dense-networks","title":"Faster gaze prediction with dense networks and Fisher pruning","date":"2018-01-17","arxiv_id":"1801.05787","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"automatic-parameter-tying-in-neural-networks","title":"Automatic Parameter Tying in Neural Networks","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"building-effective-deep-neural-networks-one","title":"Building effective deep neural networks one feature at a time","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"cheap-dnn-pruning-with-performance-guarantees","title":"Cheap DNN Pruning with Performance Guarantees","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"discovery-of-predictive-representations-with","title":"Discovery of Predictive Representations With a Network of General Value Functions","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"iterative-deep-compression-compressing-deep","title":"Iterative Deep Compression : Compressing Deep Networks for Classification and Semantic Segmentation","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-sparse-neural-networks-through-l_0-1","title":"Learning Sparse Neural Networks through L_0 Regularization","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-networks-with-block-diagonal-inner","title":"Neural Networks with Block Diagonal Inner Product Layers","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"variational-network-quantization","title":"Variational Network Quantization","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"viterbi-based-pruning-for-sparse-matrix-with","title":"Viterbi-based Pruning for Sparse Matrix with Fixed and High Index Compression Ratio","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/wsnet-learning-compact-and-efficient-networks","slug":"wsnet-learning-compact-and-efficient-networks","title":"WSNet: Learning Compact and Efficient Networks with Weight Sampling","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"automated-pruning-for-deep-neural-network","title":"Automated Pruning for Deep Neural Network Compression","date":"2017-12-05","arxiv_id":"1712.01721","n_code_links":0,"syntology":null},{"paper":"/paper/learning-sparse-neural-networks-through-l_0","slug":"learning-sparse-neural-networks-through-l_0","title":"Learning Sparse Neural Networks through $L_0$ Regularization","date":"2017-12-04","arxiv_id":"1712.01312","n_code_links":4,"syntology":null},{"paper":null,"slug":"learning-chordal-markov-networks-via-branch","title":"Learning Chordal Markov Networks via Branch and Bound","date":"2017-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/runtime-neural-pruning","slug":"runtime-neural-pruning","title":"Runtime Neural Pruning","date":"2017-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"scalable-levy-process-priors-for-spectral-1","title":"Scalable Levy Process Priors for Spectral Kernel Learning","date":"2017-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-deep-neural-network-pruning-via","title":"Structured Deep Neural Network Pruning via Matrix Pivoting","date":"2017-12-01","arxiv_id":"1712.01084","n_code_links":0,"syntology":null},{"paper":"/paper/quantitative-cba-small-and-comprehensible","slug":"quantitative-cba-small-and-comprehensible","title":"QCBA: Improving Rule Classifiers Learned from Quantitative Data by Recovering Information Lost by Discretisation","date":"2017-11-28","arxiv_id":"1711.10166","n_code_links":1,"syntology":null},{"paper":null,"slug":"wsnet-compact-and-efficient-networks-through","title":"WSNet: Compact and Efficient Networks Through Weight Sampling","date":"2017-11-28","arxiv_id":"1711.10067","n_code_links":0,"syntology":null},{"paper":"/paper/deep-expander-networks-efficient-deep","slug":"deep-expander-networks-efficient-deep","title":"Deep Expander Networks: Efficient Deep Networks from Graph Theory","date":"2017-11-23","arxiv_id":"1711.08757","n_code_links":2,"syntology":null},{"paper":"/paper/regularization-of-deep-neural-networks-with","slug":"regularization-of-deep-neural-networks-with","title":"Regularization of Deep Neural Networks with Spectral Dropout","date":"2017-11-23","arxiv_id":"1711.08591","n_code_links":0,"syntology":null},{"paper":"/paper/does-higher-order-lstm-have-better-accuracy","slug":"does-higher-order-lstm-have-better-accuracy","title":"Does Higher Order LSTM Have Better Accuracy for Segmenting and Labeling Sequence Data?","date":"2017-11-22","arxiv_id":"1711.08231","n_code_links":1,"syntology":null},{"paper":"/paper/pixie-a-system-for-recommending-3-billion","slug":"pixie-a-system-for-recommending-3-billion","title":"Pixie: A System for Recommending 3+ Billion Items to 200+ Million Users in Real-Time","date":"2017-11-21","arxiv_id":"1711.07601","n_code_links":1,"syntology":null},{"paper":null,"slug":"nisp-pruning-networks-using-neuron-importance","title":"NISP: Pruning Networks using Neuron Importance Score Propagation","date":"2017-11-16","arxiv_id":"1711.05908","n_code_links":0,"syntology":null},{"paper":"/paper/packnet-adding-multiple-tasks-to-a-single","slug":"packnet-adding-multiple-tasks-to-a-single","title":"PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruning","date":"2017-11-15","arxiv_id":"1711.05769","n_code_links":4,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["arunmallya/packnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/deep-rewiring-training-very-sparse-deep","slug":"deep-rewiring-training-very-sparse-deep","title":"Deep Rewiring: Training very sparse deep networks","date":"2017-11-14","arxiv_id":"1711.05136","n_code_links":4,"syntology":null}],"record_sha256":"15a418d701b7e9d81728201c039de5c1f8ba2cff8321c3876cd5661bc2305d21","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}