{"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/34","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":34,"pages_in_order":39,"rows_per_page":100,"rows":[3301,3400],"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/33","next":"/method/pruning/papers/35","papers":[{"paper":"/paper/efficient-model-for-image-classification-with","slug":"efficient-model-for-image-classification-with","title":"Efficient Model for Image Classification With Regularization Tricks","date":"2020-02-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-and-stable-graph-scattering","title":"Efficient and Stable Graph Scattering Transforms via Pruning","date":"2020-01-27","arxiv_id":"2001.09882","n_code_links":0,"syntology":null},{"paper":null,"slug":"progressive-local-filter-pruning-for-image","title":"Progressive Local Filter Pruning for Image Retrieval Acceleration","date":"2020-01-24","arxiv_id":"2001.08878","n_code_links":0,"syntology":null},{"paper":null,"slug":"blk-rew-a-unified-block-based-dnn-pruning","title":"BLK-REW: A Unified Block-based DNN Pruning Framework using Reweighted Regularization Method","date":"2020-01-23","arxiv_id":"2001.08357","n_code_links":0,"syntology":null},{"paper":"/paper/channel-pruning-via-automatic-structure","slug":"channel-pruning-via-automatic-structure","title":"Channel Pruning via Automatic Structure Search","date":"2020-01-23","arxiv_id":"2001.08565","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 1 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; the one sample that ran constructed an object rather than computing a result","official":{"repos":["lmbxmu/ABCPruner"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/filter-sketch-for-network-pruning","slug":"filter-sketch-for-network-pruning","title":"Filter Sketch for Network Pruning","date":"2020-01-23","arxiv_id":"2001.08514","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lmbxmu/FilterSketch"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ss-auto-a-single-shot-automatic-structured","title":"SS-Auto: A Single-Shot, Automatic Structured Weight Pruning Framework of DNNs with Ultra-High Efficiency","date":"2020-01-23","arxiv_id":"2001.08839","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-cnns-with-linear-filter-ensembles","title":"Pruning CNN's with linear filter ensembles","date":"2020-01-22","arxiv_id":"2001.08142","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-neural-belief-propagation-decoders","title":"Pruning Neural Belief Propagation Decoders","date":"2020-01-21","arxiv_id":"2001.07464","n_code_links":0,"syntology":null},{"paper":"/paper/teaser-fast-and-certifiable-point-cloud","slug":"teaser-fast-and-certifiable-point-cloud","title":"TEASER: Fast and Certifiable Point Cloud Registration","date":"2020-01-21","arxiv_id":"2001.07715","n_code_links":7,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["MIT-SPARK/TEASER-plusplus"],"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":["listed","official"]}}},{"paper":null,"slug":"an-image-enhancing-pattern-based-sparsity-for","title":"An Image Enhancing Pattern-based Sparsity for Real-time Inference on Mobile Devices","date":"2020-01-20","arxiv_id":"2001.07710","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-network-pruning-network-approach-to-deep","title":"A \"Network Pruning Network\" Approach to Deep Model Compression","date":"2020-01-15","arxiv_id":"2001.05545","n_code_links":0,"syntology":null},{"paper":"/paper/filter-grafting-for-deep-neural-networks","slug":"filter-grafting-for-deep-neural-networks","title":"Filter Grafting for Deep Neural Networks","date":"2020-01-15","arxiv_id":"2001.05868","n_code_links":2,"syntology":null},{"paper":null,"slug":"on-iterative-neural-network-pruning-1","title":"On Iterative Neural Network Pruning, Reinitialization, and the Similarity of Masks","date":"2020-01-14","arxiv_id":"2001.05050","n_code_links":0,"syntology":null},{"paper":"/paper/pops-policy-pruning-and-shrinking-for-deep","slug":"pops-policy-pruning-and-shrinking-for-deep","title":"PoPS: Policy Pruning and Shrinking for Deep Reinforcement Learning","date":"2020-01-14","arxiv_id":"2001.05012","n_code_links":1,"syntology":null},{"paper":"/paper/quantisation-and-pruning-for-neural-network","slug":"quantisation-and-pruning-for-neural-network","title":"Quantisation and Pruning for Neural Network Compression and Regularisation","date":"2020-01-14","arxiv_id":"2001.04850","n_code_links":1,"syntology":null},{"paper":null,"slug":"modeling-of-pruning-techniques-for-deep","title":"Modeling of Pruning Techniques for Deep Neural Networks Simplification","date":"2020-01-13","arxiv_id":"2001.04062","n_code_links":0,"syntology":null},{"paper":"/paper/intelligence-physics-and-information-the","slug":"intelligence-physics-and-information-the","title":"Intelligence, physics and information -- the tradeoff between accuracy and simplicity in machine learning","date":"2020-01-11","arxiv_id":"2001.03780","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-convolutional-neural-networks-with","title":"Pruning Convolutional Neural Networks with Self-Supervision","date":"2020-01-10","arxiv_id":"2001.03554","n_code_links":0,"syntology":null},{"paper":null,"slug":"campfire-compressable-regularization-free","title":"Campfire: Compressible, Regularization-Free, Structured Sparse Training for Hardware Accelerators","date":"2020-01-09","arxiv_id":"2001.03253","n_code_links":0,"syntology":null},{"paper":null,"slug":"investigation-and-analysis-of-hyper-and-hypo","title":"Investigation and Analysis of Hyper and Hypo neuron pruning to selectively update neurons during Unsupervised Adaptation","date":"2020-01-06","arxiv_id":"2001.01755","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-fine-grained-search-space-pruning","title":"Learning fine-grained search space pruning and heuristics for combinatorial optimization","date":"2020-01-05","arxiv_id":"2001.01230","n_code_links":0,"syntology":null},{"paper":"/paper/discrimination-aware-network-pruning-for-deep","slug":"discrimination-aware-network-pruning-for-deep","title":"Discrimination-aware Network Pruning for Deep Model Compression","date":"2020-01-04","arxiv_id":"2001.01050","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["SCUT-AILab/DCP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ds-2lbi-exploring-structural-sparsity-on-deep","title":"dS^2LBI: Exploring Structural Sparsity on Deep Network via Differential Inclusion Paths","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"maskconvnet-training-efficient-convnets-from","title":"MaskConvNet: Training Efficient ConvNets from Scratch via Budget-constrained Filter Pruning","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"network-pruning-by-greedy-subnetwork","title":"Network Pruning by Greedy Subnetwork Selection","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"patdnn-achieving-real-time-dnn-execution-on","title":"PatDNN: Achieving Real-Time DNN Execution on Mobile Devices with Pattern-based Weight Pruning","date":"2020-01-01","arxiv_id":"2001.00138","n_code_links":0,"syntology":null},{"paper":null,"slug":"rank-aggregation-from-pairwise-comparisons-in","title":"Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"train-big-then-compress-rethinking-model-size","title":"Train Big, Then Compress: Rethinking Model Size for Efficient Training and Inference of Transformers","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"alpha-discovery-neural-network-based-on-prior","title":"Alpha Discovery Neural Network based on Prior Knowledge","date":"2019-12-26","arxiv_id":"1912.11761","n_code_links":0,"syntology":null},{"paper":null,"slug":"high-utility-interval-based-sequences","title":"High Utility Interval-Based Sequences","date":"2019-12-24","arxiv_id":"1912.11165","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-deep-neural-networks-architectures","title":"Pruning Deep Convolutional Neural Networks Architectures with Evolution Strategy","date":"2019-12-24","arxiv_id":"1912.11527","n_code_links":0,"syntology":null},{"paper":null,"slug":"aegr-a-simple-approach-to-gradient-reversal","title":"AEGR: A simple approach to gradient reversal in autoencoders for network anomaly detection","date":"2019-12-21","arxiv_id":"1912.13387","n_code_links":0,"syntology":null},{"paper":null,"slug":"dbp-discrimination-based-block-level-pruning","title":"DBP: Discrimination Based Block-Level Pruning for Deep Model Acceleration","date":"2019-12-21","arxiv_id":"1912.10178","n_code_links":0,"syntology":null},{"paper":"/paper/east-encoding-aware-sparse-training-for-deep","slug":"east-encoding-aware-sparse-training-for-deep","title":"EAST: Encoding-Aware Sparse Training for Deep Memory Compression of ConvNets","date":"2019-12-20","arxiv_id":"1912.10087","n_code_links":1,"syntology":null},{"paper":null,"slug":"taxonomy-and-evaluation-of-structured","title":"Taxonomy and Evaluation of Structured Compression of Convolutional Neural Networks","date":"2019-12-20","arxiv_id":"1912.09802","n_code_links":0,"syntology":null},{"paper":"/paper/overcoming-long-term-catastrophic-forgetting","slug":"overcoming-long-term-catastrophic-forgetting","title":"Overcoming Long-term Catastrophic Forgetting through Adversarial Neural Pruning and Synaptic Consolidation","date":"2019-12-19","arxiv_id":"1912.09091","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":1,"n_instrument":1,"unverified":3,"pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","official":{"repos":["GeoX-Lab/ANPyC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruning-by-explaining-a-novel-criterion-for","slug":"pruning-by-explaining-a-novel-criterion-for","title":"Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruning","date":"2019-12-18","arxiv_id":"1912.08881","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-error-tolerant-quantized-neural","title":"Efficient Error-Tolerant Quantized Neural Network Accelerators","date":"2019-12-16","arxiv_id":"1912.07394","n_code_links":0,"syntology":null},{"paper":"/paper/linear-mode-connectivity-and-the-lottery","slug":"linear-mode-connectivity-and-the-lottery","title":"Linear Mode Connectivity and the Lottery Ticket Hypothesis","date":"2019-12-11","arxiv_id":"1912.05671","n_code_links":2,"syntology":null},{"paper":"/paper/uct-adp-progressive-bias-algorithm-for","slug":"uct-adp-progressive-bias-algorithm-for","title":"UCT-ADP Progressive Bias Algorithm for Solving Gomoku","date":"2019-12-11","arxiv_id":"1912.05407","n_code_links":1,"syntology":null},{"paper":"/paper/unet-redesigning-skip-connections-to-exploit","slug":"unet-redesigning-skip-connections-to-exploit","title":"UNet++: Redesigning Skip Connections to Exploit Multiscale Features in Image Segmentation","date":"2019-12-11","arxiv_id":"1912.05074","n_code_links":13,"syntology":{"ran":4,"of":9,"n_ran_checked":3,"n_instrument":1,"unverified":5,"pointer_only":3,"phrase":"4 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; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["MrGiovanni/UNetPlusPlus"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"magnitude-and-uncertainty-pruning-criterion","title":"Magnitude and Uncertainty Pruning Criterion for Neural Networks","date":"2019-12-10","arxiv_id":"1912.04845","n_code_links":0,"syntology":null},{"paper":"/paper/winning-the-lottery-with-continuous-1","slug":"winning-the-lottery-with-continuous-1","title":"Winning the Lottery with Continuous Sparsification","date":"2019-12-10","arxiv_id":"1912.04427","n_code_links":2,"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":["lolemacs/continuous-sparsification"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/the-search-for-sparse-robust-neural-networks","slug":"the-search-for-sparse-robust-neural-networks","title":"The Search for Sparse, Robust Neural Networks","date":"2019-12-05","arxiv_id":"1912.02386","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["justincosentino/robust-sparse-networks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ultrafast-photorealistic-style-transfer-via","title":"Ultrafast Photorealistic Style Transfer via Neural Architecture Search","date":"2019-12-05","arxiv_id":"1912.02398","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-model-compression-via-deep-reinforcement","title":"Deep Model Compression Via Two-Stage Deep Reinforcement Learning","date":"2019-12-04","arxiv_id":"1912.02254","n_code_links":0,"syntology":null},{"paper":"/paper/extreme-learning-machine-design-for-dealing","slug":"extreme-learning-machine-design-for-dealing","title":"Extreme Learning Machine design for dealing with unrepresentative features","date":"2019-12-04","arxiv_id":"1912.02154","n_code_links":1,"syntology":null},{"paper":"/paper/protecting-geolocation-privacy-of-photo","slug":"protecting-geolocation-privacy-of-photo","title":"Protecting Geolocation Privacy of Photo Collections","date":"2019-12-04","arxiv_id":"1912.02085","n_code_links":1,"syntology":null},{"paper":null,"slug":"edas-efficient-and-differentiable","title":"EDAS: Efficient and Differentiable Architecture Search","date":"2019-12-03","arxiv_id":"1912.01237","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-agent-communication-under-limited","title":"Learning Agent Communication under Limited Bandwidth by Message Pruning","date":"2019-12-03","arxiv_id":"1912.05304","n_code_links":0,"syntology":null},{"paper":null,"slug":"anomaly-detection-in-particulate-matter","title":"Anomaly Detection in Particulate Matter Sensor using Hypothesis Pruning Generative Adversarial Network","date":"2019-12-02","arxiv_id":"1912.00583","n_code_links":0,"syntology":null},{"paper":null,"slug":"experiencethinking-hyperparameter","title":"ExperienceThinking: Constrained Hyperparameter Optimization based on Knowledge and Pruning","date":"2019-12-02","arxiv_id":"1912.00602","n_code_links":0,"syntology":null},{"paper":"/paper/tx-ray-quantifying-and-explaining-model","slug":"tx-ray-quantifying-and-explaining-model","title":"TX-Ray: Quantifying and Explaining Model-Knowledge Transfer in (Un-)Supervised NLP","date":"2019-12-02","arxiv_id":"1912.00982","n_code_links":2,"syntology":null},{"paper":"/paper/autoprune-automatic-network-pruning-by","slug":"autoprune-automatic-network-pruning-by","title":"AutoPrune: Automatic Network Pruning by Regularizing Auxiliary Parameters","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/constraint-based-causal-structure-learning","slug":"constraint-based-causal-structure-learning","title":"Constraint-based Causal Structure Learning with Consistent Separating Sets","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/partitioning-structure-learning-for-segmented","slug":"partitioning-structure-learning-for-segmented","title":"Partitioning Structure Learning for Segmented Linear Regression Trees","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/tab-vcr-tags-and-attributes-based-vcr-1","slug":"tab-vcr-tags-and-attributes-based-vcr-1","title":"TAB-VCR: Tags and Attributes based VCR Baselines","date":"2019-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"one-shot-pruning-of-recurrent-neural-networks-1","title":"One-Shot Pruning of Recurrent Neural Networks by Jacobian Spectrum Evaluation","date":"2019-11-30","arxiv_id":"1912.00120","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-at-a-glance-global-neural-pruning-for","title":"Pruning at a Glance: Global Neural Pruning for Model Compression","date":"2019-11-30","arxiv_id":"1912.00200","n_code_links":0,"syntology":null},{"paper":null,"slug":"explaining-neural-networks-via-perturbing","title":"Improving Feature Attribution through Input-specific Network Pruning","date":"2019-11-25","arxiv_id":"1911.11081","n_code_links":0,"syntology":null},{"paper":null,"slug":"real-time-object-tracking-via-meta-learning","title":"Real-Time Object Tracking via Meta-Learning: Efficient Model Adaptation and One-Shot Channel Pruning","date":"2019-11-25","arxiv_id":"1911.11170","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-sot-mram-based-processing-in-memory-engine","title":"A SOT-MRAM-based Processing-In-Memory Engine for Highly Compressed DNN Implementation","date":"2019-11-24","arxiv_id":"1912.05416","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploiting-operation-importance-for","title":"Exploiting Operation Importance for Differentiable Neural Architecture Search","date":"2019-11-24","arxiv_id":"1911.10511","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-pruning-for-model-compression","title":"Graph Pruning for Model Compression","date":"2019-11-22","arxiv_id":"1911.09817","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-method-for-identifying-the-deep","title":"A novel method for identifying the deep neural network model with the Serial Number","date":"2019-11-19","arxiv_id":"1911.08053","n_code_links":0,"syntology":null},{"paper":"/paper/cup-cluster-pruning-for-compressing-deep","slug":"cup-cluster-pruning-for-compressing-deep","title":"CUP: Cluster Pruning for Compressing Deep Neural Networks","date":"2019-11-19","arxiv_id":"1911.08630","n_code_links":1,"syntology":null},{"paper":null,"slug":"darb-a-density-aware-regular-block-pruning","title":"DARB: A Density-Aware Regular-Block Pruning for Deep Neural Networks","date":"2019-11-19","arxiv_id":"1911.08020","n_code_links":0,"syntology":null},{"paper":"/paper/neural-network-pruning-with-residual","slug":"neural-network-pruning-with-residual","title":"Neural Network Pruning with Residual-Connections and Limited-Data","date":"2019-11-19","arxiv_id":"1911.08114","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":0,"n_instrument":4,"unverified":3,"pointer_only":2,"phrase":"4 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; 4 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/provable-filter-pruning-for-efficient-neural-1","slug":"provable-filter-pruning-for-efficient-neural-1","title":"Provable Filter Pruning for Efficient Neural Networks","date":"2019-11-18","arxiv_id":"1911.07412","n_code_links":2,"syntology":null},{"paper":"/paper/pvae-learning-disentangled-representations","slug":"pvae-learning-disentangled-representations","title":"PVAE: Learning Disentangled Representations with Intrinsic Dimension via Approximated L0 Regularization","date":"2019-11-15","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"dynamic-connected-neural-decision-classifier","title":"Dynamic Connected Neural Decision Classifier and Regressor with Dynamic Softing Pruning","date":"2019-11-13","arxiv_id":"1911.05443","n_code_links":0,"syntology":null},{"paper":"/paper/selective-brain-damage-measuring-the","slug":"selective-brain-damage-measuring-the","title":"What Do Compressed Deep Neural Networks Forget?","date":"2019-11-13","arxiv_id":"1911.05248","n_code_links":2,"syntology":null},{"paper":null,"slug":"iteratively-training-look-up-tables-for-1","title":"Iteratively Training Look-Up Tables for Network Quantization","date":"2019-11-12","arxiv_id":"1911.04951","n_code_links":0,"syntology":null},{"paper":null,"slug":"structural-pruning-in-deep-neural-networks-a","title":"Structural Pruning in Deep Neural Networks: A Small-World Approach","date":"2019-11-11","arxiv_id":"1911.04453","n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-multi-head-attention-in","title":"Understanding Multi-Head Attention in Abstractive Summarization","date":"2019-11-10","arxiv_id":"1911.03898","n_code_links":0,"syntology":null},{"paper":null,"slug":"hardware-aware-pruning-of-dnns-using-lfsr","title":"Hardware-aware Pruning of DNNs using LFSR-Generated Pseudo-Random Indices","date":"2019-11-09","arxiv_id":"1911.04468","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-different-take-on-the-best-first-game-tree","title":"A different take on the best-first game tree pruning algorithms","date":"2019-11-08","arxiv_id":"1911.03388","n_code_links":0,"syntology":null},{"paper":"/paper/a-programmable-approach-to-model-compression","slug":"a-programmable-approach-to-model-compression","title":"A Programmable Approach to Neural Network Compression","date":"2019-11-06","arxiv_id":"1911.02497","n_code_links":1,"syntology":null},{"paper":null,"slug":"localization-aware-channel-pruning-for-object","title":"Localization-aware Channel Pruning for Object Detection","date":"2019-11-06","arxiv_id":"1911.02237","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-compressed-pneumonia-detection-for-low","title":"Deep Compressed Pneumonia Detection for Low-Power Embedded Devices","date":"2019-11-04","arxiv_id":"1911.02007","n_code_links":0,"syntology":null},{"paper":"/paper/comprehensive-snn-compression-using-admm","slug":"comprehensive-snn-compression-using-admm","title":"Comprehensive SNN Compression Using ADMM Optimization and Activity Regularization","date":"2019-11-03","arxiv_id":"1911.00822","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":{"repos":["yjwu17/ADMM-Compression-for-SNNs"],"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":["official"]}}},{"paper":null,"slug":"sjtu-nict-at-mrp-2019-multi-task-learning-for","title":"SJTU-NICT at MRP 2019: Multi-Task Learning for End-to-End Uniform Semantic Graph Parsing","date":"2019-11-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/confident-learning-estimating-uncertainty-in","slug":"confident-learning-estimating-uncertainty-in","title":"Confident Learning: Estimating Uncertainty in Dataset Labels","date":"2019-10-31","arxiv_id":"1911.00068","n_code_links":4,"syntology":{"ran":21,"of":29,"n_ran_checked":17,"n_instrument":4,"unverified":8,"pointer_only":3,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","official":{"repos":["cleanlab/cleanlab"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"short-term-and-spike-timing-dependent","title":"Short-term and spike-timing-dependent plasticities facilitate the formation of modular neural networks","date":"2019-10-31","arxiv_id":"1911.00052","n_code_links":0,"syntology":null},{"paper":"/paper/tab-vcr-tags-and-attributes-based-vcr","slug":"tab-vcr-tags-and-attributes-based-vcr","title":"TAB-VCR: Tags and Attributes based Visual Commonsense Reasoning Baselines","date":"2019-10-31","arxiv_id":"1910.14671","n_code_links":1,"syntology":null},{"paper":null,"slug":"when-does-diversity-help-generalization-in","title":"When does Diversity Help Generalization in Classification Ensembles?","date":"2019-10-30","arxiv_id":"1910.13631","n_code_links":0,"syntology":null},{"paper":"/paper/scalable-deep-neural-networks-via-low-rank-1","slug":"scalable-deep-neural-networks-via-low-rank-1","title":"Decomposable-Net: Scalable Low-Rank Compression for Neural Networks","date":"2019-10-29","arxiv_id":"1910.13141","n_code_links":1,"syntology":null},{"paper":null,"slug":"layer-pruning-for-accelerating-very-deep","title":"Layer Pruning for Accelerating Very Deep Neural Networks","date":"2019-10-28","arxiv_id":"1910.12727","n_code_links":0,"syntology":null},{"paper":null,"slug":"cross-channel-intragroup-sparsity-neural","title":"Cross-Channel Intragroup Sparsity Neural Network","date":"2019-10-26","arxiv_id":"1910.11971","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparative-study-of-neural-network","title":"A Comparative Study of Neural Network Compression","date":"2019-10-24","arxiv_id":"1910.11144","n_code_links":0,"syntology":null},{"paper":"/paper/lutnet-learning-fpga-configurations-for","slug":"lutnet-learning-fpga-configurations-for","title":"LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference","date":"2019-10-24","arxiv_id":"1910.12625","n_code_links":2,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["awai54st/LUTNet"],"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":"optimistic-regret-minimization-for-extensive","title":"Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions","date":"2019-10-24","arxiv_id":"1910.10906","n_code_links":0,"syntology":null},{"paper":"/paper/autoencoding-with-xcsf","slug":"autoencoding-with-xcsf","title":"Autoencoding with a Classifier System","date":"2019-10-23","arxiv_id":"1910.10579","n_code_links":1,"syntology":null},{"paper":null,"slug":"stochastic-channel-based-federated-learning","title":"Stochastic Channel-Based Federated Learning for Medical Data Privacy Preserving","date":"2019-10-23","arxiv_id":"1910.11160","n_code_links":0,"syntology":null},{"paper":null,"slug":"spiking-neural-networks-trained-with","title":"Spiking neural networks trained with backpropagation for low power neuromorphic implementation of voice activity detection","date":"2019-10-22","arxiv_id":"1910.09993","n_code_links":0,"syntology":null},{"paper":null,"slug":"directed-weighting-group-lasso-for-eltwise","title":"Directed-Weighting Group Lasso for Eltwise Blocked CNN Pruning","date":"2019-10-21","arxiv_id":"1910.09318","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-adaptive-network-pruning","title":"Self-Adaptive Network Pruning","date":"2019-10-20","arxiv_id":"1910.08906","n_code_links":0,"syntology":null},{"paper":"/paper/b-bit-sketch-trie-scalable-similarity-search","slug":"b-bit-sketch-trie-scalable-similarity-search","title":"$b$-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches","date":"2019-10-18","arxiv_id":"1910.08278","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-generalized-and-robust-method-towards","title":"A Generalized and Robust Method Towards Practical Gaze Estimation on Smart Phone","date":"2019-10-16","arxiv_id":"1910.07331","n_code_links":0,"syntology":null}],"record_sha256":"fba27a59d980569ff635a5077396831f54ff3b0c1a0100847fcbce955d277eac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}