{"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/36","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":36,"pages_in_order":39,"rows_per_page":100,"rows":[3501,3600],"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/35","next":"/method/pruning/papers/37","papers":[{"paper":null,"slug":"playing-the-lottery-with-rewards-and-multiple","title":"Playing the lottery with rewards and multiple languages: lottery tickets in RL and NLP","date":"2019-06-06","arxiv_id":"1906.02768","n_code_links":0,"syntology":null},{"paper":"/paper/uncertainty-guided-continual-learning-with","slug":"uncertainty-guided-continual-learning-with","title":"Uncertainty-guided Continual Learning with Bayesian Neural Networks","date":"2019-06-06","arxiv_id":"1906.02425","n_code_links":2,"syntology":{"ran":3,"of":11,"n_ran_checked":2,"n_instrument":1,"unverified":8,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["SaynaEbrahimi/UCB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/190600398","slug":"190600398","title":"Cost-sensitive Boosting Pruning Trees for depression detection on Twitter","date":"2019-06-02","arxiv_id":"1906.00398","n_code_links":1,"syntology":null},{"paper":null,"slug":"190600399","title":"Multi-Objective Pruning for CNNs Using Genetic Algorithm","date":"2019-06-02","arxiv_id":"1906.00399","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-mainsubsidiary-network-framework-for-1","title":"A Main/Subsidiary Network Framework for Simplifying Binary Neural Networks","date":"2019-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/compressing-convolutional-neural-networks-via","slug":"compressing-convolutional-neural-networks-via","title":"Compressing Convolutional Neural Networks via Factorized Convolutional Filters","date":"2019-06-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"variational-convolutional-neural-network","title":"Variational Convolutional Neural Network Pruning","date":"2019-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"increasing-compactness-of-deep-learning-based","title":"Increasing Compactness Of Deep Learning Based Speech Enhancement Models With Parameter Pruning And Quantization Techniques","date":"2019-05-31","arxiv_id":"1906.01078","n_code_links":0,"syntology":null},{"paper":"/paper/learning-sparse-networks-using-targeted","slug":"learning-sparse-networks-using-targeted","title":"Learning Sparse Networks Using Targeted Dropout","date":"2019-05-31","arxiv_id":"1905.13678","n_code_links":2,"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":null}},{"paper":null,"slug":"robust-sparse-regularization-simultaneously","title":"Robust Sparse Regularization: Simultaneously Optimizing Neural Network Robustness and Compactness","date":"2019-05-30","arxiv_id":"1905.13074","n_code_links":0,"syntology":null},{"paper":"/paper/oicsr-out-in-channel-sparsity-regularization-1","slug":"oicsr-out-in-channel-sparsity-regularization-1","title":"OICSR: Out-In-Channel Sparsity Regularization for Compact Deep Neural Networks","date":"2019-05-28","arxiv_id":"1905.11664","n_code_links":1,"syntology":null},{"paper":null,"slug":"online-filter-clustering-and-pruning-for","title":"Online Filter Clustering and Pruning for Efficient Convnets","date":"2019-05-28","arxiv_id":"1905.11787","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-sparse-architecture-search-for-cnns-on","title":"SpArSe: Sparse Architecture Search for CNNs on Resource-Constrained Microcontrollers","date":"2019-05-28","arxiv_id":"1905.12107","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-efficient-neural-networks-on-a-chip","title":"Towards Efficient Neural Networks On-a-chip: Joint Hardware-Algorithm Approaches","date":"2019-05-28","arxiv_id":"1906.08866","n_code_links":0,"syntology":null},{"paper":null,"slug":"cgap-continuous-growth-and-pruning-for","title":"CGaP: Continuous Growth and Pruning for Efficient Deep Learning","date":"2019-05-27","arxiv_id":"1905.11533","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-network-construction-through","title":"Efficient Network Construction through Structural Plasticity","date":"2019-05-27","arxiv_id":"1905.11530","n_code_links":0,"syntology":null},{"paper":"/paper/are-sixteen-heads-really-better-than-one","slug":"are-sixteen-heads-really-better-than-one","title":"Are Sixteen Heads Really Better than One?","date":"2019-05-25","arxiv_id":"1905.10650","n_code_links":4,"syntology":null},{"paper":null,"slug":"structured-compression-by-unstructured","title":"Structured Compression by Weight Encryption for Unstructured Pruning and Quantization","date":"2019-05-24","arxiv_id":"1905.10138","n_code_links":0,"syntology":null},{"paper":"/paper/analyzing-multi-head-self-attention","slug":"analyzing-multi-head-self-attention","title":"Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Pruned","date":"2019-05-23","arxiv_id":"1905.09418","n_code_links":1,"syntology":null},{"paper":null,"slug":"disentangling-redundancy-for-multi-task","title":"Pruning-Aware Merging for Efficient Multitask Inference","date":"2019-05-23","arxiv_id":"1905.09676","n_code_links":0,"syntology":null},{"paper":"/paper/network-pruning-via-transformable","slug":"network-pruning-via-transformable","title":"Network Pruning via Transformable Architecture Search","date":"2019-05-23","arxiv_id":"1905.09717","n_code_links":4,"syntology":null},{"paper":"/paper/on-pruning-for-score-based-bayesian-network","slug":"on-pruning-for-score-based-bayesian-network","title":"On Pruning for Score-Based Bayesian Network Structure Learning","date":"2019-05-23","arxiv_id":"1905.09943","n_code_links":1,"syntology":null},{"paper":"/paper/parsimonious-deep-learning-a-differential","slug":"parsimonious-deep-learning-a-differential","title":"Exploring Structural Sparsity of Deep Networks via Inverse Scale Spaces","date":"2019-05-23","arxiv_id":"1905.09449","n_code_links":1,"syntology":null},{"paper":null,"slug":"revisiting-hard-thresholding-for-dnn-pruning","title":"Revisiting hard thresholding for DNN pruning","date":"2019-05-21","arxiv_id":"1905.08793","n_code_links":0,"syntology":null},{"paper":"/paper/sparse-transfer-learning-via-winning-lottery","slug":"sparse-transfer-learning-via-winning-lottery","title":"Sparse Transfer Learning via Winning Lottery Tickets","date":"2019-05-19","arxiv_id":"1905.07785","n_code_links":1,"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: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["rahulsmehta/sparsity-experiments"],"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":null,"slug":"investigating-channel-pruning-through","title":"Investigating Channel Pruning through Structural Redundancy Reduction -- A Statistical Study","date":"2019-05-16","arxiv_id":"1905.06498","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-neural-network-channel-execution-for","title":"Dynamic Neural Network Channel Execution for Efficient Training","date":"2019-05-15","arxiv_id":"1905.06435","n_code_links":0,"syntology":null},{"paper":"/paper/eigendamage-structured-pruning-in-the","slug":"eigendamage-structured-pruning-in-the","title":"EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasis","date":"2019-05-15","arxiv_id":"1905.05934","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":{"repos":["alecwangcq/EigenDamage-Pytorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"network-pruning-for-low-rank-binary-indexing","title":"Network Pruning for Low-Rank Binary Indexing","date":"2019-05-14","arxiv_id":"1905.05686","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-the-linear-fascicle-evaluation","title":"Optimizing the Linear Fascicle Evaluation Algorithm for Multi-Core and Many-Core Systems","date":"2019-05-14","arxiv_id":"1905.06234","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesnas-a-bayesian-approach-for-neural","title":"BayesNAS: A Bayesian Approach for Neural Architecture Search","date":"2019-05-13","arxiv_id":"1905.04919","n_code_links":0,"syntology":null},{"paper":null,"slug":"implicit-filter-sparsification-in","title":"Implicit Filter Sparsification In Convolutional Neural Networks","date":"2019-05-13","arxiv_id":"1905.04967","n_code_links":0,"syntology":null},{"paper":"/paper/approximated-oracle-filter-pruning-for","slug":"approximated-oracle-filter-pruning-for","title":"Approximated Oracle Filter Pruning for Destructive CNN Width Optimization","date":"2019-05-12","arxiv_id":"1905.04748","n_code_links":1,"syntology":null},{"paper":"/paper/play-and-prune-adaptive-filter-pruning-for","slug":"play-and-prune-adaptive-filter-pruning-for","title":"Play and Prune: Adaptive Filter Pruning for Deep Model Compression","date":"2019-05-11","arxiv_id":"1905.04446","n_code_links":1,"syntology":null},{"paper":null,"slug":"compressing-weight-updates-for-image","title":"Compressing Weight-updates for Image Artifacts Removal Neural Networks","date":"2019-05-10","arxiv_id":"1905.04079","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-dense-mapping-for-large-scale-dynamic","title":"Robust Dense Mapping for Large-Scale Dynamic Environments","date":"2019-05-07","arxiv_id":"1905.02781","n_code_links":0,"syntology":null},{"paper":null,"slug":"creating-lightweight-object-detectors-with","title":"Creating Lightweight Object Detectors with Model Compression for Deployment on Edge Devices","date":"2019-05-06","arxiv_id":"1905.01787","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximate-lstms-for-time-constrained","title":"Approximate LSTMs for Time-Constrained Inference: Enabling Fast Reaction in Self-Driving Cars","date":"2019-05-02","arxiv_id":"1905.00689","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-trim-revisiting-l1-regularization-for","title":"DEEP-TRIM: REVISITING L1 REGULARIZATION FOR CONNECTION PRUNING OF DEEP NETWORK","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"double-viterbi-weight-encoding-for-high","title":"Double Viterbi: Weight Encoding for High Compression Ratio and Fast On-Chip Reconstruction for Deep Neural Network","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"globally-soft-filter-pruning-for-efficient","title":"Globally Soft Filter Pruning For Efficient Convolutional Neural Networks","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"integral-pruning-on-activations-and-weights","title":"Integral Pruning on Activations and Weights for Efficient Neural Networks","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"interpretable-convolutional-filter-pruning-1","title":"INTERPRETABLE CONVOLUTIONAL FILTER PRUNING","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-internal-dense-but-external-sparse","title":"Learning Internal Dense But External Sparse Structures of Deep Neural Network","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-search-efficient-densenet-with","title":"Learning to Search Efficient DenseNet with Layer-wise Pruning","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"mean-replacement-pruning","title":"Mean Replacement Pruning","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pcnn-environment-adaptive-model-without","title":"PCNN: Environment Adaptive Model Without Finetuning","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-in-training-learning-and-ranking","title":"PRUNING IN TRAINING: LEARNING AND RANKING SPARSE CONNECTIONS IN DEEP CONVOLUTIONAL NETWORKS","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-with-hints-an-efficient-framework-for","title":"PRUNING WITH HINTS: AN EFFICIENT FRAMEWORK FOR MODEL ACCELERATION","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"selective-convolutional-units-improving-cnns","title":"Selective Convolutional Units: Improving CNNs via Channel Selectivity","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"single-shot-neural-architecture-search-via","title":"Single Shot Neural Architecture Search Via Direct Sparse Optimization","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"resnet-can-be-pruned-60x-introducing-network","title":"ResNet Can Be Pruned 60x: Introducing Network Purification and Unused Path Removal (P-RM) after Weight Pruning","date":"2019-04-30","arxiv_id":"1905.00136","n_code_links":0,"syntology":null},{"paper":"/paper/legr-filter-pruning-via-learned-global","slug":"legr-filter-pruning-via-learned-global","title":"Towards Efficient Model Compression via Learned Global Ranking","date":"2019-04-28","arxiv_id":"1904.12368","n_code_links":1,"syntology":{"ran":10,"of":13,"n_ran_checked":7,"n_instrument":3,"unverified":3,"pointer_only":1,"phrase":"10 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; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["cmu-enyac/LeGR"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"learning-to-prune-speeding-up-repeated","title":"Learning to Prune: Speeding up Repeated Computations","date":"2019-04-26","arxiv_id":"1904.11875","n_code_links":0,"syntology":null},{"paper":null,"slug":"characterization-of-glue-variables-in-cdcl","title":"Characterization of Glue Variables in CDCL SAT Solving","date":"2019-04-25","arxiv_id":"1904.11106","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-pruning-method-for-neural","title":"Plug-in, Trainable Gate for Streamlining Arbitrary Neural Networks","date":"2019-04-24","arxiv_id":"1904.10921","n_code_links":0,"syntology":null},{"paper":"/paper/towards-learning-of-filter-level","slug":"towards-learning-of-filter-level","title":"Towards Learning of Filter-Level Heterogeneous Compression of Convolutional Neural Networks","date":"2019-04-22","arxiv_id":"1904.09872","n_code_links":2,"syntology":null},{"paper":null,"slug":"data-priming-network-for-automatic-check-out","title":"Data Priming Network for Automatic Check-Out","date":"2019-04-10","arxiv_id":"1904.04978","n_code_links":0,"syntology":null},{"paper":"/paper/l_0-arm-network-sparsification-via-stochastic","slug":"l_0-arm-network-sparsification-via-stochastic","title":"$L_0$-ARM: Network Sparsification via Stochastic Binary Optimization","date":"2019-04-09","arxiv_id":"1904.04432","n_code_links":1,"syntology":null},{"paper":"/paper/asap-architecture-search-anneal-and-prune","slug":"asap-architecture-search-anneal-and-prune","title":"ASAP: Architecture Search, Anneal and Prune","date":"2019-04-08","arxiv_id":"1904.04123","n_code_links":1,"syntology":null},{"paper":"/paper/centripetal-sgd-for-pruning-very-deep","slug":"centripetal-sgd-for-pruning-very-deep","title":"Centripetal SGD for Pruning Very Deep Convolutional Networks with Complicated Structure","date":"2019-04-08","arxiv_id":"1904.03837","n_code_links":1,"syntology":null},{"paper":null,"slug":"meta-filter-pruning-to-accelerate-deep","title":"Filter Pruning by Switching to Neighboring CNNs with Good Attributes","date":"2019-04-08","arxiv_id":"1904.03961","n_code_links":0,"syntology":null},{"paper":null,"slug":"c2s2-cost-aware-channel-sparse-selection-for","title":"C2S2: Cost-aware Channel Sparse Selection for Progressive Network Pruning","date":"2019-04-06","arxiv_id":"1904.03508","n_code_links":0,"syntology":null},{"paper":null,"slug":"m2kd-multi-model-and-multi-level-knowledge","title":"M2KD: Multi-model and Multi-level Knowledge Distillation for Incremental Learning","date":"2019-04-03","arxiv_id":"1904.01769","n_code_links":0,"syntology":null},{"paper":"/paper/lutnet-rethinking-inference-in-fpga-soft","slug":"lutnet-rethinking-inference-in-fpga-soft","title":"LUTNet: Rethinking Inference in FPGA Soft Logic","date":"2019-04-01","arxiv_id":"1904.00938","n_code_links":2,"syntology":null},{"paper":null,"slug":"multimodal-sparse-classifier-for-adolescent","title":"Multimodal Sparse Classifier for Adolescent Brain Age Prediction","date":"2019-04-01","arxiv_id":"1904.01070","n_code_links":0,"syntology":null},{"paper":"/paper/second-rethinking-of-network-pruning-in-the","slug":"second-rethinking-of-network-pruning-in-the","title":"Adversarial Robustness vs Model Compression, or Both?","date":"2019-03-29","arxiv_id":"1903.12561","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["yeshaokai/Robustness-Aware-Pruning-ADMM"],"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/network-slimming-by-slimmable-networks","slug":"network-slimming-by-slimmable-networks","title":"AutoSlim: Towards One-Shot Architecture Search for Channel Numbers","date":"2019-03-27","arxiv_id":"1903.11728","n_code_links":10,"syntology":null},{"paper":null,"slug":"towards-stable-symbol-grounding-with-zero","title":"Towards Stable Symbol Grounding with Zero-Suppressed State AutoEncoder","date":"2019-03-27","arxiv_id":"1903.11277","n_code_links":0,"syntology":null},{"paper":"/paper/accelerating-deep-unsupervised-domain","slug":"accelerating-deep-unsupervised-domain","title":"Accelerating Deep Unsupervised Domain Adaptation with Transfer Channel Pruning","date":"2019-03-25","arxiv_id":"1904.02654","n_code_links":1,"syntology":null},{"paper":"/paper/metapruning-meta-learning-for-automatic","slug":"metapruning-meta-learning-for-automatic","title":"MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning","date":"2019-03-25","arxiv_id":"1903.10258","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":["liuzechun/MetaPruning"],"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/progressive-dnn-compression-a-key-to-achieve","slug":"progressive-dnn-compression-a-key-to-achieve","title":"Progressive DNN Compression: A Key to Achieve Ultra-High Weight Pruning and Quantization Rates using ADMM","date":"2019-03-23","arxiv_id":"1903.09769","n_code_links":2,"syntology":null},{"paper":null,"slug":"enhancing-generalization-of-first-order-meta","title":"Enhancing Generalization of First-Order Meta-Learning","date":"2019-03-22","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/towards-optimal-structured-cnn-pruning-via","slug":"towards-optimal-structured-cnn-pruning-via","title":"Towards Optimal Structured CNN Pruning via Generative Adversarial Learning","date":"2019-03-22","arxiv_id":"1903.09291","n_code_links":1,"syntology":null},{"paper":"/paper/max-plus-operators-applied-to-filter","slug":"max-plus-operators-applied-to-filter","title":"Max-plus Operators Applied to Filter Selection and Model Pruning in Neural Networks","date":"2019-03-19","arxiv_id":"1903.08072","n_code_links":1,"syntology":null},{"paper":"/paper/evolving-and-understanding-sparse-deep-neural","slug":"evolving-and-understanding-sparse-deep-neural","title":"A Brain-inspired Algorithm for Training Highly Sparse Neural Networks","date":"2019-03-17","arxiv_id":"1903.07138","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":3,"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":{"repos":["joostPieterse/CosineSET","zahraatashgahi/ctre"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"cascaded-projection-end-to-end-network","title":"Cascaded Projection: End-to-End Network Compression and Acceleration","date":"2019-03-12","arxiv_id":"1903.04988","n_code_links":0,"syntology":null},{"paper":null,"slug":"continual-learning-via-neural-pruning","title":"Continual Learning via Neural Pruning","date":"2019-03-11","arxiv_id":"1903.04476","n_code_links":0,"syntology":null},{"paper":"/paper/fastdepth-fast-monocular-depth-estimation-on","slug":"fastdepth-fast-monocular-depth-estimation-on","title":"FastDepth: Fast Monocular Depth Estimation on Embedded Systems","date":"2019-03-08","arxiv_id":"1903.03273","n_code_links":1,"syntology":{"ran":7,"of":11,"n_ran_checked":7,"n_instrument":0,"unverified":4,"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) · 4 unverified","official":null}},{"paper":"/paper/improving-device-edge-cooperative-inference","slug":"improving-device-edge-cooperative-inference","title":"Improving Device-Edge Cooperative Inference of Deep Learning via 2-Step Pruning","date":"2019-03-08","arxiv_id":"1903.03472","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-the-quantization-of-cellular-neural","title":"On the Quantization of Cellular Neural Networks for Cyber-Physical Systems","date":"2019-03-05","arxiv_id":"1903.02048","n_code_links":0,"syntology":null},{"paper":"/paper/the-lottery-ticket-hypothesis-at-scale","slug":"the-lottery-ticket-hypothesis-at-scale","title":"Stabilizing the Lottery Ticket Hypothesis","date":"2019-03-05","arxiv_id":"1903.01611","n_code_links":3,"syntology":null},{"paper":null,"slug":"multi-loss-aware-channel-pruning-of-deep","title":"Multi-loss-aware Channel Pruning of Deep Networks","date":"2019-02-27","arxiv_id":"1902.10364","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-mbpep-a-deep-ensemble-pruning-algorithm","title":"The MBPEP: a deep ensemble pruning algorithm providing high quality uncertainty prediction","date":"2019-02-25","arxiv_id":"1902.09238","n_code_links":0,"syntology":null},{"paper":"/paper/the-state-of-sparsity-in-deep-neural-networks","slug":"the-state-of-sparsity-in-deep-neural-networks","title":"The State of Sparsity in Deep Neural Networks","date":"2019-02-25","arxiv_id":"1902.09574","n_code_links":6,"syntology":null},{"paper":null,"slug":"fine-grained-search-space-classification-for","title":"Fine-grained Search Space Classification for Hard Enumeration Variants of Subset Problems","date":"2019-02-22","arxiv_id":"1902.08455","n_code_links":0,"syntology":null},{"paper":null,"slug":"performance-study-of-distributed-apriori-like","title":"Performance study of distributed Apriori-like frequent itemsets mining","date":"2019-02-21","arxiv_id":"1903.03008","n_code_links":0,"syntology":null},{"paper":null,"slug":"single-shot-channel-pruning-based-on","title":"Single-shot Channel Pruning Based on Alternating Direction Method of Multipliers","date":"2019-02-18","arxiv_id":"1902.06382","n_code_links":0,"syntology":null},{"paper":null,"slug":"speeding-up-convolutional-networks-pruning","title":"Speeding up convolutional networks pruning with coarse ranking","date":"2019-02-18","arxiv_id":"1902.06385","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-pruning-methods-in-gene-network","title":"Evaluating Pruning Methods in Gene Network Inference","date":"2019-02-16","arxiv_id":"1902.06028","n_code_links":0,"syntology":null},{"paper":null,"slug":"parameter-efficient-training-of-deep","title":"Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization","date":"2019-02-15","arxiv_id":"1902.05967","n_code_links":0,"syntology":null},{"paper":"/paper/binary-stochastic-filtering-a-solution-for","slug":"binary-stochastic-filtering-a-solution-for","title":"Binary Stochastic Filtering: a Method for Neural Network Size Minimization and Supervised Feature Selection","date":"2019-02-12","arxiv_id":"1902.04510","n_code_links":1,"syntology":null},{"paper":null,"slug":"effective-network-compression-using","title":"Effective Network Compression Using Simulation-Guided Iterative Pruning","date":"2019-02-12","arxiv_id":"1902.04224","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-practical-maximum-clique-algorithm-for","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","date":"2019-02-05","arxiv_id":"1902.01534","n_code_links":0,"syntology":null},{"paper":null,"slug":"micik-mining-cross-layer-inherent-similarity","title":"MICIK: MIning Cross-Layer Inherent Similarity Knowledge for Deep Model Compression","date":"2019-02-03","arxiv_id":"1902.00918","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-end-to-end-generative-retrieval-method-for","title":"An end-to-end Generative Retrieval Method for Sponsored Search Engine --Decoding Efficiently into a Closed Target Domain","date":"2019-02-02","arxiv_id":"1902.00592","n_code_links":0,"syntology":null},{"paper":null,"slug":"rethinking-visual-relationships-for-high","title":"VrR-VG: Refocusing Visually-Relevant Relationships","date":"2019-02-01","arxiv_id":"1902.00313","n_code_links":0,"syntology":null},{"paper":"/paper/prunetrain-gradual-structured-pruning-from","slug":"prunetrain-gradual-structured-pruning-from","title":"PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfiguration","date":"2019-01-26","arxiv_id":"1901.09290","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":null}},{"paper":null,"slug":"really-should-we-pruning-after-model-be","title":"Really should we pruning after model be totally trained? Pruning based on a small amount of training","date":"2019-01-24","arxiv_id":"1901.08455","n_code_links":0,"syntology":null},{"paper":"/paper/towards-compact-convnets-via-structure","slug":"towards-compact-convnets-via-structure","title":"Towards Compact ConvNets via Structure-Sparsity Regularized Filter Pruning","date":"2019-01-23","arxiv_id":"1901.07827","n_code_links":1,"syntology":null}],"record_sha256":"d5cdf9ee38a1ba13054886634bca60f892349b5c0837b72a24f915f418e20cee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}