{"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/35","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":35,"pages_in_order":39,"rows_per_page":100,"rows":[3401,3500],"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/34","next":"/method/pruning/papers/36","papers":[{"paper":null,"slug":"spec2-spectral-sparse-cnn-accelerator-on","title":"SPEC2: SPECtral SParsE CNN Accelerator on FPGAs","date":"2019-10-16","arxiv_id":"1910.11103","n_code_links":0,"syntology":null},{"paper":"/paper/learning-sparsity-and-quantization-jointly","slug":"learning-sparsity-and-quantization-jointly","title":"Automatic Neural Network Compression by Sparsity-Quantization Joint Learning: A Constrained Optimization-based Approach","date":"2019-10-14","arxiv_id":"1910.05897","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-a-bert-based-question-answering-model","title":"Structured Pruning of a BERT-based Question Answering Model","date":"2019-10-14","arxiv_id":"1910.06360","n_code_links":0,"syntology":null},{"paper":null,"slug":"diabdeep-pervasive-diabetes-diagnosis-based","title":"DiabDeep: Pervasive Diabetes Diagnosis based on Wearable Medical Sensors and Efficient Neural Networks","date":"2019-10-11","arxiv_id":"1910.04925","n_code_links":0,"syntology":null},{"paper":"/paper/sipping-neural-networks-sensitivity-informed","slug":"sipping-neural-networks-sensitivity-informed","title":"SiPPing Neural Networks: Sensitivity-informed Provable Pruning of Neural Networks","date":"2019-10-11","arxiv_id":"1910.05422","n_code_links":2,"syntology":null},{"paper":"/paper/structured-pruning-of-large-language-models","slug":"structured-pruning-of-large-language-models","title":"Structured Pruning of Large Language Models","date":"2019-10-10","arxiv_id":"1910.04732","n_code_links":2,"syntology":{"ran":8,"of":12,"n_ran_checked":6,"n_instrument":2,"unverified":4,"pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["asappresearch/flop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/traned-rank-pruning-for-efficient-deep-neural","slug":"traned-rank-pruning-for-efficient-deep-neural","title":"Trained Rank Pruning for Efficient Deep Neural Networks","date":"2019-10-09","arxiv_id":"1910.04576","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-algorithms-for-low-dimensional-non","title":"Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study","date":"2019-10-08","arxiv_id":"1910.03539","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-stochastic-channel-based","title":"Privacy Preserving Stochastic Channel-Based Federated Learning with Neural Network Pruning","date":"2019-10-04","arxiv_id":"1910.02115","n_code_links":0,"syntology":null},{"paper":"/paper/adversarial-robustness-vs-model-compression","slug":"adversarial-robustness-vs-model-compression","title":"Adversarial Robustness vs. Model Compression, or Both?","date":"2019-10-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/sub-architecture-ensemble-pruning-in-neural","slug":"sub-architecture-ensemble-pruning-in-neural","title":"Sub-Architecture Ensemble Pruning in Neural Architecture Search","date":"2019-10-01","arxiv_id":"1910.00370","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-efficient-convolutional-networks-2","title":"Learning Efficient Convolutional Networks through Irregular Convolutional Kernels","date":"2019-09-29","arxiv_id":"1909.13239","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrated-triaging-for-fast-reading","title":"Integrated Triaging for Fast Reading Comprehension","date":"2019-09-28","arxiv_id":"1909.13128","n_code_links":0,"syntology":null},{"paper":"/paper/global-sparse-momentum-sgd-for-pruning-very","slug":"global-sparse-momentum-sgd-for-pruning-very","title":"Global Sparse Momentum SGD for Pruning Very Deep Neural Networks","date":"2019-09-27","arxiv_id":"1909.12778","n_code_links":4,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["DingXiaoH/GSM-SGD"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/pruning-from-scratch","slug":"pruning-from-scratch","title":"Pruning from Scratch","date":"2019-09-27","arxiv_id":"1909.12579","n_code_links":1,"syntology":null},{"paper":null,"slug":"reweighted-proximal-pruning-for-large-scale-1","title":"Reweighted Proximal Pruning for Large-Scale Language Representation","date":"2019-09-27","arxiv_id":"1909.12486","n_code_links":0,"syntology":null},{"paper":"/paper/model-pruning-enables-efficient-federated","slug":"model-pruning-enables-efficient-federated","title":"Model Pruning Enables Efficient Federated Learning on Edge Devices","date":"2019-09-26","arxiv_id":"1909.12326","n_code_links":2,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"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) · 3 unverified","official":{"repos":["jiangyuang/PruneFL"],"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":"optimizing-speech-recognition-for-the-edge","title":"Optimizing Speech Recognition For The Edge","date":"2019-09-26","arxiv_id":"1909.12408","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-closer-look-at-network-resolution-for-1","title":"A closer look at network resolution for efficient network design","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"filter-redistribution-templates-for-iteration","title":"Filter redistribution templates for iteration-lessconvolutional model reduction","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"finding-deep-local-optima-using-network","title":"Finding Deep Local Optima Using Network Pruning","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"global-adversarial-robustness-guarantees-for","title":"Global Adversarial Robustness Guarantees for Neural Networks","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"how-can-we-generalise-learning-distributed","title":"How can we generalise learning distributed representations of graphs?","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"meta-learning-with-network-pruning-for","title":"Meta-Learning with Network Pruning for Overfitting Reduction","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"network-pruning-for-low-rank-binary-index","title":"Network Pruning for Low-Rank Binary Index","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-decision-boundaries-of-deep-neural","title":"On the Decision Boundaries of Deep Neural Networks: A Tropical Geometry Perspective","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"prune-or-quantize-strategy-for-pareto","title":"Prune or quantize? Strategy for Pareto-optimally low-cost and accurate CNN","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/reducing-transformer-depth-on-demand-with-1","slug":"reducing-transformer-depth-on-demand-with-1","title":"Reducing Transformer Depth on Demand with Structured Dropout","date":"2019-09-25","arxiv_id":"1909.11556","n_code_links":5,"syntology":null},{"paper":null,"slug":"selective-brain-damage-measuring-the-1","title":"Selective Brain Damage: Measuring the Disparate Impact of Model Pruning","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"semantic-pruning-for-single-class","title":"Semantic Pruning for Single Class Interpretability","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"split-lbi-for-deep-learning-structural","title":"Split LBI for Deep Learning: Structural Sparsity via Differential Inclusion Paths","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"starfire-regularization-free-adversarially","title":"Starfire: Regularization-Free Adversarially-Robust Structured Sparse Training","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"the-sooner-the-better-investigating-structure","title":"The Sooner The Better: Investigating Structure of Early Winning Lottery Tickets","date":"2019-09-25","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/gate-decorator-global-filter-pruning-method","slug":"gate-decorator-global-filter-pruning-method","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","date":"2019-09-18","arxiv_id":"1909.08174","n_code_links":2,"syntology":{"ran":17,"of":18,"n_ran_checked":17,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["youzhonghui/gate-decorator-pruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"dasnet-dynamic-activation-sparsity-for-neural","title":"DASNet: Dynamic Activation Sparsity for Neural Network Efficiency Improvement","date":"2019-09-13","arxiv_id":"1909.06964","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-multi-stage-sparsification-for","title":"Learning Multi-Stage Sparsification for Maximum Clique Enumeration","date":"2019-09-12","arxiv_id":"1910.00517","n_code_links":0,"syntology":null},{"paper":null,"slug":"differentiable-mask-pruning-for-neural","title":"Differentiable Mask for Pruning Convolutional and Recurrent Networks","date":"2019-09-10","arxiv_id":"1909.04567","n_code_links":0,"syntology":null},{"paper":null,"slug":"vacl-variance-aware-cross-layer","title":"VACL: Variance-Aware Cross-Layer Regularization for Pruning Deep Residual Networks","date":"2019-09-10","arxiv_id":"1909.04485","n_code_links":0,"syntology":null},{"paper":null,"slug":"respiratory-rate-estimation-from-face-videos","title":"Respiratory Rate Estimation from Face Videos","date":"2019-09-08","arxiv_id":"1909.03503","n_code_links":0,"syntology":null},{"paper":null,"slug":"pconv-the-missing-but-desirable-sparsity-in","title":"PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devices","date":"2019-09-06","arxiv_id":"1909.05073","n_code_links":0,"syntology":null},{"paper":"/paper/rnn-architecture-learning-with-sparse","slug":"rnn-architecture-learning-with-sparse","title":"RNN Architecture Learning with Sparse Regularization","date":"2019-09-06","arxiv_id":"1909.03011","n_code_links":1,"syntology":null},{"paper":"/paper/learning-digital-circuits-a-journey-through","slug":"learning-digital-circuits-a-journey-through","title":"Learning Digital Circuits: A Journey Through Weight Invariant Self-Pruning Neural Networks","date":"2019-08-30","arxiv_id":"1909.00052","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-ultra-efficient-memristor-based-dnn","title":"An Ultra-Efficient Memristor-Based DNN Framework with Structured Weight Pruning and Quantization Using ADMM","date":"2019-08-29","arxiv_id":"1908.11691","n_code_links":0,"syntology":null},{"paper":null,"slug":"defending-against-misclassification-attacks","title":"Defeating Misclassification Attacks Against Transfer Learning","date":"2019-08-29","arxiv_id":"1908.11230","n_code_links":0,"syntology":null},{"paper":"/paper/image-captioning-with-sparse-recurrent-neural","slug":"image-captioning-with-sparse-recurrent-neural","title":"Image Captioning with Sparse Recurrent Neural Network","date":"2019-08-28","arxiv_id":"1908.10797","n_code_links":1,"syntology":null},{"paper":null,"slug":"tiny-but-accurate-a-pruned-quantized-and","title":"Tiny but Accurate: A Pruned, Quantized and Optimized Memristor Crossbar Framework for Ultra Efficient DNN Implementation","date":"2019-08-27","arxiv_id":"1908.10017","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-evaluation-of-feature-matchers","title":"An Evaluation of Feature Matchers for Fundamental Matrix Estimation","date":"2019-08-26","arxiv_id":"1908.09474","n_code_links":0,"syntology":null},{"paper":"/paper/multi-channel-graph-neural-network-for-entity-1","slug":"multi-channel-graph-neural-network-for-entity-1","title":"Multi-Channel Graph Neural Network for Entity Alignment","date":"2019-08-26","arxiv_id":"1908.09898","n_code_links":1,"syntology":null},{"paper":"/paper/once-for-all-train-one-network-and-specialize","slug":"once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","arxiv_id":"1908.09791","n_code_links":10,"syntology":{"ran":24,"of":34,"n_ran_checked":22,"n_instrument":2,"unverified":10,"pointer_only":8,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 1 honoured, 1 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","official":{"repos":["mit-han-lab/once-for-all"],"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":"exploring-the-performance-of-deep-residual","title":"Exploring the Performance of Deep Residual Networks in Crazyhouse Chess","date":"2019-08-25","arxiv_id":"1908.09296","n_code_links":0,"syntology":null},{"paper":null,"slug":"190807888","title":"Towards Better Understanding of Spontaneous Conversations: Overcoming Automatic Speech Recognition Errors With Intent Recognition","date":"2019-08-21","arxiv_id":"1908.07888","n_code_links":0,"syntology":null},{"paper":"/paper/protecting-neural-networks-with-hierarchical","slug":"protecting-neural-networks-with-hierarchical","title":"Protecting Neural Networks with Hierarchical Random Switching: Towards Better Robustness-Accuracy Trade-off for Stochastic Defenses","date":"2019-08-20","arxiv_id":"1908.07116","n_code_links":1,"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":["KieranXWang/HRS"],"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":"/paper/efficient-discovery-of-expressive-multi-label","slug":"efficient-discovery-of-expressive-multi-label","title":"Efficient Discovery of Expressive Multi-label Rules using Relaxed Pruning","date":"2019-08-19","arxiv_id":"1908.06874","n_code_links":1,"syntology":null},{"paper":null,"slug":"prune-sampling-a-mcmc-inference-technique-for","title":"Prune Sampling: a MCMC inference technique for discrete and deterministic Bayesian networks","date":"2019-08-17","arxiv_id":"1908.06335","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-explanation-of-inferences-on-large","title":"Scalable Explanation of Inferences on Large Graphs","date":"2019-08-13","arxiv_id":"1908.06482","n_code_links":0,"syntology":null},{"paper":"/paper/adversarial-neural-pruning","slug":"adversarial-neural-pruning","title":"Adversarial Neural Pruning with Latent Vulnerability Suppression","date":"2019-08-12","arxiv_id":"1908.04355","n_code_links":1,"syntology":null},{"paper":null,"slug":"group-pruning-using-a-bounded-lp-norm-for","title":"Group Pruning using a Bounded-Lp norm for Group Gating and Regularization","date":"2019-08-09","arxiv_id":"1908.03463","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-inference-of-cnns-via-channel","title":"Efficient Inference of CNNs via Channel Pruning","date":"2019-08-08","arxiv_id":"1908.03266","n_code_links":0,"syntology":null},{"paper":"/paper/consensus-maximization-tree-search-revisited","slug":"consensus-maximization-tree-search-revisited","title":"Consensus Maximization Tree Search Revisited","date":"2019-08-06","arxiv_id":"1908.02021","n_code_links":1,"syntology":null},{"paper":null,"slug":"exploiting-channel-similarity-for","title":"Exploiting Channel Similarity for Accelerating Deep Convolutional Neural Networks","date":"2019-08-06","arxiv_id":"1908.02620","n_code_links":0,"syntology":null},{"paper":null,"slug":"architecture-aware-network-pruning-for-vision","title":"Architecture-aware Network Pruning for Vision Quality Applications","date":"2019-08-05","arxiv_id":"1908.02125","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-cnn-training-by-sparsifying","title":"Accelerating CNN Training by Pruning Activation Gradients","date":"2019-08-01","arxiv_id":"1908.00173","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-instance-wise-sparsity-for","title":"Learning Instance-wise Sparsity for Accelerating Deep Models","date":"2019-07-27","arxiv_id":"1907.11840","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-hard-exploration-for-reinforcement","title":"On Hard Exploration for Reinforcement Learning: a Case Study in Pommerman","date":"2019-07-26","arxiv_id":"1907.11788","n_code_links":0,"syntology":null},{"paper":"/paper/optuna-a-next-generation-hyperparameter","slug":"optuna-a-next-generation-hyperparameter","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","date":"2019-07-25","arxiv_id":"1907.10902","n_code_links":11,"syntology":{"ran":14,"of":20,"n_ran_checked":14,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["pfnet/optuna"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/slimyolov3-narrower-faster-and-better-for","slug":"slimyolov3-narrower-faster-and-better-for","title":"SlimYOLOv3: Narrower, Faster and Better for Real-Time UAV Applications","date":"2019-07-25","arxiv_id":"1907.11093","n_code_links":2,"syntology":null},{"paper":null,"slug":"adaptive-compression-based-lifelong-learning","title":"Adaptive Compression-based Lifelong Learning","date":"2019-07-23","arxiv_id":"1907.09695","n_code_links":0,"syntology":null},{"paper":null,"slug":"association-rule-mining-and-itemset","title":"Association rule mining and itemset-correlation based variants","date":"2019-07-22","arxiv_id":"1907.09535","n_code_links":0,"syntology":null},{"paper":null,"slug":"ensyth-a-pruning-approach-to-synthesis-of","title":"EnSyth: A Pruning Approach to Synthesis of Deep Learning Ensembles","date":"2019-07-22","arxiv_id":"1907.09286","n_code_links":0,"syntology":null},{"paper":null,"slug":"retrieving-similar-trajectories-from-cellular","title":"Retrieving Similar Trajectories from Cellular Data at City Scale","date":"2019-07-20","arxiv_id":"1907.12371","n_code_links":0,"syntology":null},{"paper":"/paper/satellite-system-graph-towards-the-efficiency","slug":"satellite-system-graph-towards-the-efficiency","title":"High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility","date":"2019-07-13","arxiv_id":"1907.06146","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-targeted-acceleration-and-compression","title":"A Targeted Acceleration and Compression Framework for Low bit Neural Networks","date":"2019-07-09","arxiv_id":"1907.05271","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-activation-function-coresets-for-network","title":"Data-Independent Neural Pruning via Coresets","date":"2019-07-09","arxiv_id":"1907.04018","n_code_links":0,"syntology":null},{"paper":null,"slug":"sat-solvers-and-computer-algebra-systems-a","title":"SAT Solvers and Computer Algebra Systems: A Powerful Combination for Mathematics","date":"2019-07-09","arxiv_id":"1907.04408","n_code_links":0,"syntology":null},{"paper":null,"slug":"autoslim-an-automatic-dnn-structured-pruning","title":"AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression Rates","date":"2019-07-06","arxiv_id":"1907.03141","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-survey-of-pruning-methods-for-efficient","title":"Exploiting Prunability for Person Re-Identification","date":"2019-07-04","arxiv_id":"1907.02547","n_code_links":0,"syntology":null},{"paper":null,"slug":"non-structured-dnn-weight-pruning-considered","title":"Non-Structured DNN Weight Pruning -- Is It Beneficial in Any Platform?","date":"2019-07-03","arxiv_id":"1907.02124","n_code_links":0,"syntology":null},{"paper":"/paper/two-stage-optimization-for-machine-learning","slug":"two-stage-optimization-for-machine-learning","title":"Two-stage Optimization for Machine Learning Workflow","date":"2019-07-01","arxiv_id":"1907.00678","n_code_links":1,"syntology":null},{"paper":null,"slug":"dissecting-pruned-neural-networks","title":"Dissecting Pruned Neural Networks","date":"2019-06-29","arxiv_id":"1907.00262","n_code_links":0,"syntology":null},{"paper":"/paper/amf-aggregated-mondrian-forests-for-online","slug":"amf-aggregated-mondrian-forests-for-online","title":"AMF: Aggregated Mondrian Forests for Online Learning","date":"2019-06-25","arxiv_id":"1906.10529","n_code_links":2,"syntology":null},{"paper":"/paper/cop-customized-deep-model-compression-via","slug":"cop-customized-deep-model-compression-via","title":"COP: Customized Deep Model Compression via Regularized Correlation-Based Filter-Level Pruning","date":"2019-06-25","arxiv_id":"1906.10337","n_code_links":1,"syntology":{"ran":0,"of":4,"n_ran_checked":0,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"0 ran · 4 unverified","official":{"repos":["ZJULearning/COP"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"paper":"/paper/importance-estimation-for-neural-network-1","slug":"importance-estimation-for-neural-network-1","title":"Importance Estimation for Neural Network Pruning","date":"2019-06-25","arxiv_id":"1906.10771","n_code_links":3,"syntology":null},{"paper":"/paper/an-improved-trade-off-between-accuracy-and","slug":"an-improved-trade-off-between-accuracy-and","title":"Progressive Gradient Pruning for Classification, Detection and DomainAdaptation","date":"2019-06-20","arxiv_id":"1906.08746","n_code_links":1,"syntology":null},{"paper":null,"slug":"joint-pruning-on-activations-and-weights-for","title":"Joint Regularization on Activations and Weights for Efficient Neural Network Pruning","date":"2019-06-19","arxiv_id":"1906.07875","n_code_links":0,"syntology":null},{"paper":"/paper/swiftnet-using-graph-propagation-as-meta","slug":"swiftnet-using-graph-propagation-as-meta","title":"SwiftNet: Using Graph Propagation as Meta-knowledge to Search Highly Representative Neural Architectures","date":"2019-06-19","arxiv_id":"1906.08305","n_code_links":1,"syntology":null},{"paper":"/paper/xnas-neural-architecture-search-with-expert","slug":"xnas-neural-architecture-search-with-expert","title":"XNAS: Neural Architecture Search with Expert Advice","date":"2019-06-19","arxiv_id":"1906.08031","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-one-step-pruning-recovery-framework-for","title":"A One-step Pruning-recovery Framework for Acceleration of Convolutional Neural Networks","date":"2019-06-18","arxiv_id":"1906.07488","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-pruning-of-recurrent-neural","title":"Structured Pruning of Recurrent Neural Networks through Neuron Selection","date":"2019-06-17","arxiv_id":"1906.06847","n_code_links":0,"syntology":null},{"paper":"/paper/a-signal-propagation-perspective-for-pruning","slug":"a-signal-propagation-perspective-for-pruning","title":"A Signal Propagation Perspective for Pruning Neural Networks at Initialization","date":"2019-06-14","arxiv_id":"1906.06307","n_code_links":1,"syntology":{"ran":10,"of":13,"n_ran_checked":10,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["namhoonlee/spp-public"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"towards-compact-and-robust-deep-neural","title":"Towards Compact and Robust Deep Neural Networks","date":"2019-06-14","arxiv_id":"1906.06110","n_code_links":0,"syntology":null},{"paper":null,"slug":"parameterized-structured-pruning-for-deep","title":"Parameterized Structured Pruning for Deep Neural Networks","date":"2019-06-12","arxiv_id":"1906.05180","n_code_links":0,"syntology":null},{"paper":"/paper/reinforcement-knowledge-graph-reasoning-for","slug":"reinforcement-knowledge-graph-reasoning-for","title":"Reinforcement Knowledge Graph Reasoning for Explainable Recommendation","date":"2019-06-12","arxiv_id":"1906.05237","n_code_links":1,"syntology":null},{"paper":null,"slug":"run-time-efficient-rnn-compression-for","title":"Run-Time Efficient RNN Compression for Inference on Edge Devices","date":"2019-06-12","arxiv_id":"1906.04886","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-taxonomy-of-channel-pruning-signals-in-cnns","title":"Taxonomy of Saliency Metrics for Channel Pruning","date":"2019-06-11","arxiv_id":"1906.04675","n_code_links":0,"syntology":null},{"paper":null,"slug":"basisconv-a-method-for-compressed","title":"BasisConv: A method for compressed representation and learning in CNNs","date":"2019-06-11","arxiv_id":"1906.04509","n_code_links":0,"syntology":null},{"paper":null,"slug":"simultaneously-learning-architectures-and","title":"Simultaneously Learning Architectures and Features of Deep Neural Networks","date":"2019-06-11","arxiv_id":"1906.04505","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-generalization-stability-tradeoff-in","title":"The Generalization-Stability Tradeoff In Neural Network Pruning","date":"2019-06-09","arxiv_id":"1906.03728","n_code_links":0,"syntology":null},{"paper":"/paper/adversarial-examples-for-non-parametric","slug":"adversarial-examples-for-non-parametric","title":"Robustness for Non-Parametric Classification: A Generic Attack and Defense","date":"2019-06-07","arxiv_id":"1906.03310","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":4,"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) · 3 unverified","official":{"repos":["yangarbiter/adversarial-nonparametrics"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ensemble-pruning-via-margin-maximization","title":"Ensemble Pruning via Margin Maximization","date":"2019-06-07","arxiv_id":"1906.03247","n_code_links":0,"syntology":null},{"paper":null,"slug":"pen-ultimate-dnn-pruning","title":"(Pen-) Ultimate DNN Pruning","date":"2019-06-06","arxiv_id":"1906.02535","n_code_links":0,"syntology":null}],"record_sha256":"e9ec97208bc92c9e5877faa04685241e7216df8c0a9c37e30fe1bef64575c083","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}