{"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/31","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":31,"pages_in_order":39,"rows_per_page":100,"rows":[3001,3100],"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/30","next":"/method/pruning/papers/32","papers":[{"paper":"/paper/scop-scientific-control-for-reliable-neural","slug":"scop-scientific-control-for-reliable-neural","title":"SCOP: Scientific Control for Reliable Neural Network Pruning","date":"2020-10-21","arxiv_id":"2010.10732","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, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["huawei-noah/Pruning"],"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":"comparing-fisher-information-regularization","title":"Comparing Fisher Information Regularization with Distillation for DNN Quantization","date":"2020-10-19","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"noisy-neural-network-compression-for-analog","title":"Noisy Neural Network Compression for Analog Storage Devices","date":"2020-10-19","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"softer-pruning-incremental-regularization","title":"Softer Pruning, Incremental Regularization","date":"2020-10-19","arxiv_id":"2010.09498","n_code_links":0,"syntology":null},{"paper":null,"slug":"mlcask-efficient-management-of-component","title":"MLCask: Efficient Management of Component Evolution in Collaborative Data Analytics Pipelines","date":"2020-10-17","arxiv_id":"2010.10246","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-dense-to-sparse-paradigm-for-pruning","title":"Adaptive Dense-to-Sparse Paradigm for Pruning Online Recommendation System with Non-Stationary Data","date":"2020-10-16","arxiv_id":"2010.08655","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-feature-selection-for-end-to-end","slug":"adaptive-feature-selection-for-end-to-end","title":"Adaptive Feature Selection for End-to-End Speech Translation","date":"2020-10-16","arxiv_id":"2010.08518","n_code_links":1,"syntology":null},{"paper":null,"slug":"timeshap-explaining-recurrent-models-through-1","title":"TimeSHAP: Explaining Recurrent Models through Sequence Perturbations","date":"2020-10-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/a-deeper-look-at-the-layerwise-sparsity-of-1","slug":"a-deeper-look-at-the-layerwise-sparsity-of-1","title":"Layer-adaptive sparsity for the Magnitude-based Pruning","date":"2020-10-15","arxiv_id":"2010.07611","n_code_links":1,"syntology":null},{"paper":"/paper/an-algorithm-for-learning-smaller","slug":"an-algorithm-for-learning-smaller","title":"An Algorithm for Learning Smaller Representations of Models With Scarce Data","date":"2020-10-15","arxiv_id":"2010.07990","n_code_links":1,"syntology":null},{"paper":null,"slug":"fpraker-a-processing-element-for-accelerating","title":"FPRaker: A Processing Element For Accelerating Neural Network Training","date":"2020-10-15","arxiv_id":"2010.08065","n_code_links":0,"syntology":null},{"paper":"/paper/decision-trees-as-partitioning-machines-to","slug":"decision-trees-as-partitioning-machines-to","title":"Decision trees as partitioning machines to characterize their generalization properties","date":"2020-10-14","arxiv_id":"2010.07374","n_code_links":1,"syntology":null},{"paper":null,"slug":"semantic-segmentation-for-partially-occluded","title":"Semantic Segmentation for Partially Occluded Apple Trees Based on Deep Learning","date":"2020-10-14","arxiv_id":"2010.06879","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-accurate-quantization-and-pruning-via","title":"Towards Accurate Quantization and Pruning via Data-free Knowledge Transfer","date":"2020-10-14","arxiv_id":"2010.07334","n_code_links":0,"syntology":null},{"paper":"/paper/towards-optimal-filter-pruning-with-balanced","slug":"towards-optimal-filter-pruning-with-balanced","title":"Towards Optimal Filter Pruning with Balanced Performance and Pruning Speed","date":"2020-10-14","arxiv_id":"2010.06821","n_code_links":1,"syntology":null},{"paper":null,"slug":"coarse-and-fine-grained-automatic-cropping","title":"Coarse and fine-grained automatic cropping deep convolutional neural network","date":"2020-10-13","arxiv_id":"2010.06379","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-efficiency-of-k-means-clustering","title":"On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection","date":"2020-10-13","arxiv_id":"2010.06654","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-model-compression-method-with-matrix","title":"A Model Compression Method with Matrix Product Operators for Speech Enhancement","date":"2020-10-10","arxiv_id":"2010.04950","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerate-your-cnn-from-three-dimensions-a","title":"Accelerate CNNs from Three Dimensions: A Comprehensive Pruning Framework","date":"2020-10-10","arxiv_id":"2010.04879","n_code_links":0,"syntology":null},{"paper":null,"slug":"be-your-own-best-competitor-multi-branched","title":"Be Your Own Best Competitor! Multi-Branched Adversarial Knowledge Transfer","date":"2020-10-09","arxiv_id":"2010.04516","n_code_links":0,"syntology":null},{"paper":null,"slug":"connection-pruning-for-deep-spiking-neural","title":"Connection Pruning for Deep Spiking Neural Networks with On-Chip Learning","date":"2020-10-09","arxiv_id":"2010.04351","n_code_links":0,"syntology":null},{"paper":"/paper/multi-objective-optimisation-of-multi-output","slug":"multi-objective-optimisation-of-multi-output","title":"Multi-Objective Optimisation of Multi-Output Neural Trees","date":"2020-10-09","arxiv_id":"2010.04524","n_code_links":1,"syntology":null},{"paper":"/paper/text-based-rl-agents-with-commonsense","slug":"text-based-rl-agents-with-commonsense","title":"Text-based RL Agents with Commonsense Knowledge: New Challenges, Environments and Baselines","date":"2020-10-08","arxiv_id":"2010.03790","n_code_links":2,"syntology":{"ran":11,"of":13,"n_ran_checked":11,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["IBM/commonsense-rl"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/gradient-flow-in-sparse-neural-networks-and-1","slug":"gradient-flow-in-sparse-neural-networks-and-1","title":"Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win","date":"2020-10-07","arxiv_id":"2010.03533","n_code_links":1,"syntology":null},{"paper":"/paper/optimizing-transformers-with-approximate-1","slug":"optimizing-transformers-with-approximate-1","title":"AxFormer: Accuracy-driven Approximation of Transformers for Faster, Smaller and more Accurate NLP Models","date":"2020-10-07","arxiv_id":"2010.03688","n_code_links":1,"syntology":null},{"paper":"/paper/additive-tree-structured-conditional","slug":"additive-tree-structured-conditional","title":"Additive Tree-Structured Conditional Parameter Spaces in Bayesian Optimization: A Novel Covariance Function and a Fast Implementation","date":"2020-10-06","arxiv_id":"2010.03171","n_code_links":1,"syntology":null},{"paper":null,"slug":"characterising-bias-in-compressed-models","title":"Characterising Bias in Compressed Models","date":"2020-10-06","arxiv_id":"2010.03058","n_code_links":0,"syntology":null},{"paper":null,"slug":"comprehensive-online-network-pruning-via","title":"Comprehensive Online Network Pruning via Learnable Scaling Factors","date":"2020-10-06","arxiv_id":"2010.02623","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-inference-for-neural-machine","title":"Efficient Inference For Neural Machine Translation","date":"2020-10-06","arxiv_id":"2010.02416","n_code_links":0,"syntology":null},{"paper":null,"slug":"rank-and-run-time-aware-compression-of-nlp","title":"Rank and run-time aware compression of NLP Applications","date":"2020-10-06","arxiv_id":"2010.03193","n_code_links":0,"syntology":null},{"paper":"/paper/ranp-resource-aware-neuron-pruning-at","slug":"ranp-resource-aware-neuron-pruning-at","title":"RANP: Resource Aware Neuron Pruning at Initialization for 3D CNNs","date":"2020-10-06","arxiv_id":"2010.02488","n_code_links":1,"syntology":null},{"paper":null,"slug":"joint-pruning-quantization-for-extremely","title":"Joint Pruning & Quantization for Extremely Sparse Neural Networks","date":"2020-10-05","arxiv_id":"2010.01892","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-redundant-mappings-in-transformer","slug":"pruning-redundant-mappings-in-transformer","title":"Pruning Redundant Mappings in Transformer Models via Spectral-Normalized Identity Prior","date":"2020-10-05","arxiv_id":"2010.01791","n_code_links":1,"syntology":null},{"paper":"/paper/winning-lottery-tickets-in-deep-generative","slug":"winning-lottery-tickets-in-deep-generative","title":"Winning Lottery Tickets in Deep Generative Models","date":"2020-10-05","arxiv_id":"2010.02350","n_code_links":1,"syntology":null},{"paper":null,"slug":"optimal-neural-program-synthesis-from-1","title":"Optimal Neural Program Synthesis from Multimodal Specifications","date":"2020-10-04","arxiv_id":"2010.01678","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-variational-information-bottleneck-based","title":"A Variational Information Bottleneck Based Method to Compress Sequential Networks for Human Action Recognition","date":"2020-10-03","arxiv_id":"2010.01343","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-adaptive-hessian-approximated-stochastic","title":"An adaptive Hessian approximated stochastic gradient MCMC method","date":"2020-10-03","arxiv_id":"2010.01384","n_code_links":0,"syntology":null},{"paper":null,"slug":"ucp-uniform-channel-pruning-for-deep","title":"UCP: Uniform Channel Pruning for Deep Convolutional Neural Networks Compression and Acceleration","date":"2020-10-03","arxiv_id":"2010.01251","n_code_links":0,"syntology":null},{"paper":"/paper/differentiable-weighted-finite-state","slug":"differentiable-weighted-finite-state","title":"Differentiable Weighted Finite-State Transducers","date":"2020-10-02","arxiv_id":"2010.01003","n_code_links":1,"syntology":null},{"paper":"/paper/understanding-tables-with-intermediate-pre","slug":"understanding-tables-with-intermediate-pre","title":"Understanding tables with intermediate pre-training","date":"2020-10-01","arxiv_id":"2010.00571","n_code_links":1,"syntology":null},{"paper":null,"slug":"auber-automated-bert-regularization","title":"AUBER: Automated BERT Regularization","date":"2020-09-30","arxiv_id":"2009.14409","n_code_links":0,"syntology":null},{"paper":null,"slug":"erratum-concerning-the-obfuscated-gradients","title":"Erratum Concerning the Obfuscated Gradients Attack on Stochastic Activation Pruning","date":"2020-09-30","arxiv_id":"2010.00071","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-filter-in-filter","slug":"pruning-filter-in-filter","title":"Pruning Filter in Filter","date":"2020-09-30","arxiv_id":"2009.14410","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-discriminant-analysis-for-task-dependent","title":"Grow-Push-Prune: aligning deep discriminants for effective structural network compression","date":"2020-09-29","arxiv_id":"2009.13716","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-binary-trees-via-sparse-relaxation","title":"Learning Binary Trees via Sparse Relaxation","date":"2020-09-28","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"neuron-activation-analysis-for-multi-joint","title":"Neuron Activation Analysis for Multi-Joint Robot Reinforcement Learning","date":"2020-09-28","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-from-extreme-bandit-feedback","title":"Learning from eXtreme Bandit Feedback","date":"2020-09-27","arxiv_id":"2009.12947","n_code_links":0,"syntology":null},{"paper":"/paper/a-gradient-flow-framework-for-analyzing","slug":"a-gradient-flow-framework-for-analyzing","title":"A Gradient Flow Framework For Analyzing Network Pruning","date":"2020-09-24","arxiv_id":"2009.11839","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":0,"n_instrument":2,"unverified":3,"pointer_only":0,"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) · 3 unverified","official":{"repos":["EkdeepSLubana/flowandprune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/bootstrapped-q-learning-with-context-relevant","slug":"bootstrapped-q-learning-with-context-relevant","title":"Bootstrapped Q-learning with Context Relevant Observation Pruning to Generalize in Text-based Games","date":"2020-09-24","arxiv_id":"2009.11896","n_code_links":1,"syntology":null},{"paper":null,"slug":"generating-commonsense-explanation-by","title":"Generating Commonsense Explanation by Extracting Bridge Concepts from Reasoning Paths","date":"2020-09-24","arxiv_id":"2009.11753","n_code_links":0,"syntology":null},{"paper":null,"slug":"procrustes-a-dataflow-and-accelerator-for","title":"Procrustes: a Dataflow and Accelerator for Sparse Deep Neural Network Training","date":"2020-09-23","arxiv_id":"2009.10976","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-convolutional-filters-using-batch","title":"Pruning Convolutional Filters using Batch Bridgeout","date":"2020-09-23","arxiv_id":"2009.10893","n_code_links":0,"syntology":null},{"paper":"/paper/sanity-checking-pruning-methods-random","slug":"sanity-checking-pruning-methods-random","title":"Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot","date":"2020-09-22","arxiv_id":"2009.11094","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":3,"n_instrument":1,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["JingtongSu/sanity-checking-pruning"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"paper":null,"slug":"conditional-automated-channel-pruning-for","title":"Conditional Automated Channel Pruning for Deep Neural Networks","date":"2020-09-21","arxiv_id":"2009.09724","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-neural-networks-at-initialization-why","title":"Pruning Neural Networks at Initialization: Why are We Missing the Mark?","date":"2020-09-18","arxiv_id":"2009.08576","n_code_links":0,"syntology":null},{"paper":null,"slug":"dissecting-lottery-ticket-transformers","title":"Dissecting Lottery Ticket Transformers: Structural and Behavioral Study of Sparse Neural Machine Translation","date":"2020-09-17","arxiv_id":"2009.13270","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-transformer-based-large-scale","title":"Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruning","date":"2020-09-17","arxiv_id":"2009.08065","n_code_links":0,"syntology":null},{"paper":null,"slug":"holistic-filter-pruning-for-efficient-deep","title":"Holistic Filter Pruning for Efficient Deep Neural Networks","date":"2020-09-17","arxiv_id":"2009.08169","n_code_links":0,"syntology":null},{"paper":null,"slug":"ensemble-learning-of-diffractive-optical","title":"Ensemble learning of diffractive optical networks","date":"2020-09-15","arxiv_id":"2009.06869","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-use-of-local-structural-properties-for","title":"On the use of local structural properties for improving the efficiency of hierarchical community detection methods","date":"2020-09-15","arxiv_id":"2009.06798","n_code_links":0,"syntology":null},{"paper":"/paper/yolobile-real-time-object-detection-on-mobile","slug":"yolobile-real-time-object-detection-on-mobile","title":"YOLObile: Real-Time Object Detection on Mobile Devices via Compression-Compilation Co-Design","date":"2020-09-12","arxiv_id":"2009.05697","n_code_links":3,"syntology":null},{"paper":null,"slug":"achieving-adversarial-robustness-via-sparsity","title":"Achieving Adversarial Robustness via Sparsity","date":"2020-09-11","arxiv_id":"2009.05423","n_code_links":0,"syntology":null},{"paper":null,"slug":"enabling-image-recognition-on-constrained","title":"Enabling Image Recognition on Constrained Devices Using Neural Network Pruning and a CycleGAN","date":"2020-09-11","arxiv_id":"2009.05300","n_code_links":0,"syntology":null},{"paper":"/paper/orthoreg-robust-network-pruning-using","slug":"orthoreg-robust-network-pruning-using","title":"OrthoReg: Robust Network Pruning Using Orthonormality Regularization","date":"2020-09-10","arxiv_id":"2009.05014","n_code_links":1,"syntology":null},{"paper":null,"slug":"prune-responsibly","title":"Prune Responsibly","date":"2020-09-10","arxiv_id":"2009.09936","n_code_links":0,"syntology":null},{"paper":null,"slug":"cnnpruner-pruning-convolutional-neural","title":"CNNPruner: Pruning Convolutional Neural Networks with Visual Analytics","date":"2020-09-08","arxiv_id":"2009.09940","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-personalized-community-detection","title":"Efficient Personalized Community Detection via Genetic Evolution","date":"2020-09-06","arxiv_id":"2009.02657","n_code_links":0,"syntology":null},{"paper":null,"slug":"flipout-uncovering-redundant-weights-via-sign","title":"FlipOut: Uncovering Redundant Weights via Sign Flipping","date":"2020-09-05","arxiv_id":"2009.02594","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-and-sparse-neural-networks-by","slug":"efficient-and-sparse-neural-networks-by","title":"Efficient and Sparse Neural Networks by Pruning Weights in a Multiobjective Learning Approach","date":"2020-08-31","arxiv_id":"2008.13590","n_code_links":1,"syntology":null},{"paper":"/paper/ranking-policy-decisions","slug":"ranking-policy-decisions","title":"Ranking Policy Decisions","date":"2020-08-31","arxiv_id":"2008.13607","n_code_links":2,"syntology":null},{"paper":null,"slug":"deep-reinforcement-learning-for-contact-rich","title":"Deep Reinforcement Learning for Contact-Rich Skills Using Compliant Movement Primitives","date":"2020-08-30","arxiv_id":"2008.13223","n_code_links":0,"syntology":null},{"paper":"/paper/accelerating-sparse-dnn-models-without","slug":"accelerating-sparse-dnn-models-without","title":"Accelerating Sparse DNN Models without Hardware-Support via Tile-Wise Sparsity","date":"2020-08-29","arxiv_id":"2008.13006","n_code_links":1,"syntology":null},{"paper":null,"slug":"mcmia-model-compression-against-membership","title":"Against Membership Inference Attack: Pruning is All You Need","date":"2020-08-28","arxiv_id":"2008.13578","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-quantum-classical-optimization-for","title":"Hybrid quantum-classical optimization for financial index tracking","date":"2020-08-27","arxiv_id":"2008.12050","n_code_links":0,"syntology":null},{"paper":"/paper/the-impact-of-discretization-method-on-the","slug":"the-impact-of-discretization-method-on-the","title":"The Impact of Discretization Method on the Detection of Six Types of Anomalies in Datasets","date":"2020-08-27","arxiv_id":"2008.12330","n_code_links":1,"syntology":null},{"paper":null,"slug":"sparsert-accelerating-unstructured-sparsity","title":"SparseRT: Accelerating Unstructured Sparsity on GPUs for Deep Learning Inference","date":"2020-08-26","arxiv_id":"2008.11849","n_code_links":0,"syntology":null},{"paper":"/paper/gan-slimming-all-in-one-gan-compression-by-a","slug":"gan-slimming-all-in-one-gan-compression-by-a","title":"GAN Slimming: All-in-One GAN Compression by A Unified Optimization Framework","date":"2020-08-25","arxiv_id":"2008.11062","n_code_links":2,"syntology":{"ran":10,"of":13,"n_ran_checked":6,"n_instrument":4,"unverified":3,"pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","official":{"repos":["TAMU-VITA/GAN-Slimming"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"properties-of-winning-tickets-on-skin-lesion","title":"Properties Of Winning Tickets On Skin Lesion Classification","date":"2020-08-25","arxiv_id":"2008.12141","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-adaptive-lasso-learning-sparse","slug":"hierarchical-adaptive-lasso-learning-sparse","title":"HALO: Learning to Prune Neural Networks with Shrinkage","date":"2020-08-24","arxiv_id":"2008.10183","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-tail-performance-of-a-deliberation","title":"Improving Tail Performance of a Deliberation E2E ASR Model Using a Large Text Corpus","date":"2020-08-24","arxiv_id":"2008.10491","n_code_links":0,"syntology":null},{"paper":"/paper/vlanet-video-language-alignment-network-for","slug":"vlanet-video-language-alignment-network-for","title":"VLANet: Video-Language Alignment Network for Weakly-Supervised Video Moment Retrieval","date":"2020-08-24","arxiv_id":"2008.10238","n_code_links":1,"syntology":null},{"paper":"/paper/training-sparse-neural-networks-using","slug":"training-sparse-neural-networks-using","title":"Training Sparse Neural Networks using Compressed Sensing","date":"2020-08-21","arxiv_id":"2008.09661","n_code_links":1,"syntology":null},{"paper":null,"slug":"utilizing-explainable-ai-for-quantization-and","title":"Utilizing Explainable AI for Quantization and Pruning of Deep Neural Networks","date":"2020-08-20","arxiv_id":"2008.09072","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-independent-structured-pruning-of-neural","title":"Data-Independent Structured Pruning of Neural Networks via Coresets","date":"2020-08-19","arxiv_id":"2008.08316","n_code_links":0,"syntology":null},{"paper":null,"slug":"restructuring-pruning-and-adjustment-of-deep","title":"Restructuring, Pruning, and Adjustment of Deep Models for Parallel Distributed Inference","date":"2020-08-19","arxiv_id":"2008.08289","n_code_links":0,"syntology":null},{"paper":null,"slug":"cascaded-channel-pruning-using-hierarchical","title":"Cascaded channel pruning using hierarchical self-distillation","date":"2020-08-16","arxiv_id":"2008.06814","n_code_links":0,"syntology":null},{"paper":"/paper/secoda-segmentation-and-combination-based","slug":"secoda-segmentation-and-combination-based","title":"SECODA: Segmentation- and Combination-Based Detection of Anomalies","date":"2020-08-16","arxiv_id":"2008.06869","n_code_links":1,"syntology":null},{"paper":null,"slug":"antidote-attention-based-dynamic-optimization","title":"AntiDote: Attention-based Dynamic Optimization for Neural Network Runtime Efficiency","date":"2020-08-14","arxiv_id":"2008.06543","n_code_links":0,"syntology":null},{"paper":"/paper/estimating-magnitude-and-phase-of-automotive","slug":"estimating-magnitude-and-phase-of-automotive","title":"Estimating the Magnitude and Phase of Automotive Radar Signals under Multiple Interference Sources with Fully Convolutional Networks","date":"2020-08-11","arxiv_id":"2008.05948","n_code_links":1,"syntology":null},{"paper":null,"slug":"rarts-a-relaxed-architecture-search-method","title":"RARTS: An Efficient First-Order Relaxed Architecture Search Method","date":"2020-08-10","arxiv_id":"2008.03901","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-convolutions-for-efficient-neural","title":"Structured Convolutions for Efficient Neural Network Design","date":"2020-08-06","arxiv_id":"2008.02454","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-ad-pruning-of-sponsored-search","title":"Optimizing AD Pruning of Sponsored Search with Reinforcement Learning","date":"2020-08-05","arxiv_id":"2008.02014","n_code_links":0,"syntology":null},{"paper":"/paper/ultra-light-deep-mir-by-trimming-lottery","slug":"ultra-light-deep-mir-by-trimming-lottery","title":"Ultra-light deep MIR by trimming lottery tickets","date":"2020-07-31","arxiv_id":"2007.16187","n_code_links":1,"syntology":null},{"paper":null,"slug":"growing-efficient-deep-networks-by-structured","title":"Growing Efficient Deep Networks by Structured Continuous Sparsification","date":"2020-07-30","arxiv_id":"2007.15353","n_code_links":0,"syntology":null},{"paper":null,"slug":"ultrahigh-dimensional-instrument-detection","title":"Instrument variable detection with graph learning : an application to high dimensional GIS-census data for house pricing","date":"2020-07-30","arxiv_id":"2007.15769","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantity-vs-quality-on-hyperparameter","title":"Quantity vs. Quality: On Hyperparameter Optimization for Deep Reinforcement Learning","date":"2020-07-29","arxiv_id":"2007.14604","n_code_links":0,"syntology":null},{"paper":null,"slug":"alf-autoencoder-based-low-rank-filter-sharing","title":"ALF: Autoencoder-based Low-rank Filter-sharing for Efficient Convolutional Neural Networks","date":"2020-07-27","arxiv_id":"2007.13384","n_code_links":0,"syntology":null},{"paper":"/paper/a-lite-distributed-semantic-communication","slug":"a-lite-distributed-semantic-communication","title":"A Lite Distributed Semantic Communication System for Internet of Things","date":"2020-07-21","arxiv_id":"2007.11095","n_code_links":1,"syntology":null},{"paper":null,"slug":"sparsetrain-exploiting-dataflow-sparsity-for","title":"SparseTrain: Exploiting Dataflow Sparsity for Efficient Convolutional Neural Networks Training","date":"2020-07-21","arxiv_id":"2007.13595","n_code_links":0,"syntology":null},{"paper":null,"slug":"achieving-real-time-execution-of-3d","title":"RT3D: Achieving Real-Time Execution of 3D Convolutional Neural Networks on Mobile Devices","date":"2020-07-20","arxiv_id":"2007.09835","n_code_links":0,"syntology":null}],"record_sha256":"a89081926345f1105e52e2ed3e1617fc9b1e542dfce18f0386a909e768a328af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}