{"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/29","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":29,"pages_in_order":39,"rows_per_page":100,"rows":[2801,2900],"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/28","next":"/method/pruning/papers/30","papers":[{"paper":"/paper/alphaevolve-a-learning-framework-to-discover","slug":"alphaevolve-a-learning-framework-to-discover","title":"AlphaEvolve: A Learning Framework to Discover Novel Alphas in Quantitative Investment","date":"2021-03-30","arxiv_id":"2103.16196","n_code_links":1,"syntology":null},{"paper":null,"slug":"production-machine-learning-pipelines","title":"Production Machine Learning Pipelines: Empirical Analysis and Optimization Opportunities","date":"2021-03-30","arxiv_id":"2103.16007","n_code_links":0,"syntology":null},{"paper":"/paper/the-elastic-lottery-ticket-hypothesis","slug":"the-elastic-lottery-ticket-hypothesis","title":"The Elastic Lottery Ticket Hypothesis","date":"2021-03-30","arxiv_id":"2103.16547","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["VITA-Group/ElasticLTH"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/panoptic-polarnet-proposal-free-lidar-point","slug":"panoptic-polarnet-proposal-free-lidar-point","title":"Panoptic-PolarNet: Proposal-free LiDAR Point Cloud Panoptic Segmentation","date":"2021-03-27","arxiv_id":"2103.14962","n_code_links":2,"syntology":{"ran":11,"of":11,"n_ran_checked":9,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["edwardzhou130/Panoptic-PolarNet"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"prototype-based-personalized-pruning","title":"Prototype-based Personalized Pruning","date":"2021-03-25","arxiv_id":"2103.15564","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-slimmable-network","slug":"dynamic-slimmable-network","title":"Dynamic Slimmable Network","date":"2021-03-24","arxiv_id":"2103.13258","n_code_links":1,"syntology":{"ran":7,"of":17,"n_ran_checked":5,"n_instrument":2,"unverified":10,"pointer_only":17,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","official":{"repos":["changlin31/DS-Net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"paper":"/paper/rosita-refined-bert-compression-with","slug":"rosita-refined-bert-compression-with","title":"ROSITA: Refined BERT cOmpreSsion with InTegrAted techniques","date":"2021-03-21","arxiv_id":"2103.11367","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["llyx97/Rosita"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"cascade-weight-shedding-in-deep-neural","title":"Cascade Weight Shedding in Deep Neural Networks: Benefits and Pitfalls for Network Pruning","date":"2021-03-19","arxiv_id":"2103.10629","n_code_links":0,"syntology":null},{"paper":null,"slug":"toward-compact-deep-neural-networks-via","title":"Toward Compact Deep Neural Networks via Energy-Aware Pruning","date":"2021-03-19","arxiv_id":"2103.10858","n_code_links":0,"syntology":null},{"paper":"/paper/cdfi-compression-driven-network-design-for","slug":"cdfi-compression-driven-network-design-for","title":"CDFI: Compression-Driven Network Design for Frame Interpolation","date":"2021-03-18","arxiv_id":"2103.10559","n_code_links":1,"syntology":null},{"paper":"/paper/multi-prize-lottery-ticket-hypothesis-finding-1","slug":"multi-prize-lottery-ticket-hypothesis-finding-1","title":"Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Network","date":"2021-03-17","arxiv_id":"2103.09377","n_code_links":1,"syntology":null},{"paper":"/paper/emerging-paradigms-of-neural-network-pruning","slug":"emerging-paradigms-of-neural-network-pruning","title":"Recent Advances on Neural Network Pruning at Initialization","date":"2021-03-11","arxiv_id":"2103.06460","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["mingsun-tse/awesome-pruning-at-initialization","mingsun-tse/smile-pruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/manifold-regularized-dynamic-network-pruning","slug":"manifold-regularized-dynamic-network-pruning","title":"Manifold Regularized Dynamic Network Pruning","date":"2021-03-10","arxiv_id":"2103.05861","n_code_links":7,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":null}},{"paper":null,"slug":"robustness-to-pruning-predicts-generalization-1","title":"Robustness to Pruning Predicts Generalization in Deep Neural Networks","date":"2021-03-10","arxiv_id":"2103.06002","n_code_links":0,"syntology":null},{"paper":"/paper/pointdsc-robust-point-cloud-registration","slug":"pointdsc-robust-point-cloud-registration","title":"PointDSC: Robust Point Cloud Registration using Deep Spatial Consistency","date":"2021-03-09","arxiv_id":"2103.05465","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"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) · 1 unverified","official":{"repos":["XuyangBai/PointDSC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/robust-black-box-watermarking-for-deep","slug":"robust-black-box-watermarking-for-deep","title":"Robust Black-box Watermarking for Deep NeuralNetwork using Inverse Document Frequency","date":"2021-03-09","arxiv_id":"2103.05590","n_code_links":1,"syntology":null},{"paper":"/paper/pufferfish-communication-efficient-models-at","slug":"pufferfish-communication-efficient-models-at","title":"Pufferfish: Communication-efficient Models At No Extra Cost","date":"2021-03-05","arxiv_id":"2103.03936","n_code_links":1,"syntology":null},{"paper":"/paper/teachers-do-more-than-teach-compressing-image","slug":"teachers-do-more-than-teach-compressing-image","title":"Teachers Do More Than Teach: Compressing Image-to-Image Models","date":"2021-03-05","arxiv_id":"2103.03467","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-neural-network-models-compression","title":"Deep Neural Network Models Compression","date":"2021-03-04","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"diversity-based-edge-pruning-of-neural","title":"Diversity Based Edge Pruning of Neural Networks Using Determinantal Point Processes","date":"2021-03-04","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/lost-in-pruning-the-effects-of-pruning-neural","slug":"lost-in-pruning-the-effects-of-pruning-neural","title":"Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracy","date":"2021-03-04","arxiv_id":"2103.03014","n_code_links":1,"syntology":null},{"paper":null,"slug":"network-compression-for-machine-learnt-fluid-1","title":"NETWORK COMPRESSION FOR MACHINE-LEARNT FLUID SIMULATIONS","date":"2021-03-04","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-diversity-based-neural-network","title":"Understanding Diversity Based Neural Network Pruning in Teacher Student Setup","date":"2021-03-04","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"activeguard-an-active-dnn-ip-protection","title":"ActiveGuard: An Active DNN IP Protection Technique via Adversarial Examples","date":"2021-03-02","arxiv_id":"2103.01527","n_code_links":0,"syntology":null},{"paper":"/paper/network-pruning-via-resource-reallocation","slug":"network-pruning-via-resource-reallocation","title":"Network Pruning via Resource Reallocation","date":"2021-03-02","arxiv_id":"2103.01847","n_code_links":1,"syntology":null},{"paper":null,"slug":"transtailor-pruning-the-pre-trained-model-for","title":"TransTailor: Pruning the Pre-trained Model for Improved Transfer Learning","date":"2021-03-02","arxiv_id":"2103.01542","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-framework-for-pruning-deep-neural-networks","title":"A Framework For Pruning Deep Neural Networks Using Energy-Based Models","date":"2021-02-25","arxiv_id":"2102.13188","n_code_links":0,"syntology":null},{"paper":"/paper/ps-and-qs-quantization-aware-pruning-for","slug":"ps-and-qs-quantization-aware-pruning-for","title":"Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference","date":"2021-02-22","arxiv_id":"2102.11289","n_code_links":1,"syntology":null},{"paper":"/paper/pruning-the-index-contents-for-memory","slug":"pruning-the-index-contents-for-memory","title":"Pruning the Index Contents for Memory Efficient Open-Domain QA","date":"2021-02-21","arxiv_id":"2102.10697","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["KNOT-FIT-BUT/R2-D2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/fm-2-field-matrixed-factorization-machines","slug":"fm-2-field-matrixed-factorization-machines","title":"$FM^2$: Field-matrixed Factorization Machines for Recommender Systems","date":"2021-02-20","arxiv_id":"2102.12994","n_code_links":2,"syntology":null},{"paper":null,"slug":"lottery-ticket-implies-accuracy-degradation","title":"Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?","date":"2021-02-19","arxiv_id":"2102.11068","n_code_links":0,"syntology":null},{"paper":null,"slug":"refinement-type-directed-search-for-meta","title":"Refinement Type Directed Search for Meta-Interpretive-Learning of Higher-Order Logic Programs","date":"2021-02-18","arxiv_id":"2102.12553","n_code_links":0,"syntology":null},{"paper":null,"slug":"do-gan-a-double-oracle-framework-for-1","title":"DO-GAN: A Double Oracle Framework for Generative Adversarial Networks","date":"2021-02-17","arxiv_id":"2102.08577","n_code_links":0,"syntology":null},{"paper":"/paper/accelerated-sparse-neural-training-a-provable","slug":"accelerated-sparse-neural-training-a-provable","title":"Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks","date":"2021-02-16","arxiv_id":"2102.08124","n_code_links":1,"syntology":null},{"paper":"/paper/successive-pruning-for-model-compression-via","slug":"successive-pruning-for-model-compression-via","title":"An Information-Theoretic Justification for Model Pruning","date":"2021-02-16","arxiv_id":"2102.08329","n_code_links":1,"syntology":null},{"paper":"/paper/chipnet-budget-aware-pruning-with-heaviside-1","slug":"chipnet-budget-aware-pruning-with-heaviside-1","title":"ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximations","date":"2021-02-14","arxiv_id":"2102.07156","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"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) · 0 unverified","official":{"repos":["transmuteAI/ChipNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"doping-a-technique-for-efficient-compression","title":"Doping: A technique for efficient compression of LSTM models using sparse structured additive matrices","date":"2021-02-14","arxiv_id":"2102.07071","n_code_links":0,"syntology":null},{"paper":null,"slug":"error-driven-pruning-of-language-models-for","title":"Error-driven Pruning of Language Models for Virtual Assistants","date":"2021-02-14","arxiv_id":"2102.07219","n_code_links":0,"syntology":null},{"paper":"/paper/a-unified-lottery-ticket-hypothesis-for-graph","slug":"a-unified-lottery-ticket-hypothesis-for-graph","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","date":"2021-02-12","arxiv_id":"2102.06790","n_code_links":2,"syntology":null},{"paper":null,"slug":"dancing-along-battery-enabling-transformer","title":"Dancing along Battery: Enabling Transformer with Run-time Reconfigurability on Mobile Devices","date":"2021-02-12","arxiv_id":"2102.06336","n_code_links":0,"syntology":null},{"paper":"/paper/dense-for-the-price-of-sparse-improved","slug":"dense-for-the-price-of-sparse-improved","title":"Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset","date":"2021-02-12","arxiv_id":"2102.07655","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"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) · 1 unverified","official":{"repos":["IlanPrice/DCTpS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/early-abandoning-and-pruning-for-elastic","slug":"early-abandoning-and-pruning-for-elastic","title":"Early Abandoning and Pruning for Elastic Distances including Dynamic Time Warping","date":"2021-02-10","arxiv_id":"2102.05221","n_code_links":2,"syntology":null},{"paper":"/paper/pruning-of-convolutional-neural-networks","slug":"pruning-of-convolutional-neural-networks","title":"Pruning of Convolutional Neural Networks Using Ising Energy Model","date":"2021-02-10","arxiv_id":"2102.05437","n_code_links":1,"syntology":null},{"paper":"/paper/ranp-resource-aware-neuron-pruning-at-1","slug":"ranp-resource-aware-neuron-pruning-at-1","title":"RANP: Resource Aware Neuron Pruning at Initialization for 3D CNNs","date":"2021-02-09","arxiv_id":"2103.08457","n_code_links":1,"syntology":null},{"paper":null,"slug":"sparsification-via-compressed-sensing-for","title":"Sparsification via Compressed Sensing for Automatic Speech Recognition","date":"2021-02-09","arxiv_id":"2102.04932","n_code_links":0,"syntology":null},{"paper":"/paper/extracting-the-locus-of-attention-at-a","slug":"extracting-the-locus-of-attention-at-a","title":"Extracting the Auditory Attention in a Dual-Speaker Scenario from EEG using a Joint CNN-LSTM Model","date":"2021-02-08","arxiv_id":"2102.03957","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-procedure-for-automated-tree-pruning","title":"A procedure for automated tree pruning suggestion using LiDAR scans of fruit trees","date":"2021-02-07","arxiv_id":"2102.03700","n_code_links":0,"syntology":null},{"paper":"/paper/gnn-rl-compression-topology-aware-network","slug":"gnn-rl-compression-topology-aware-network","title":"Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learning","date":"2021-02-05","arxiv_id":"2102.03214","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["yusx-swapp/gnn-rl-model-compression"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/squeezelight-towards-scalable-optical-neural","slug":"squeezelight-towards-scalable-optical-neural","title":"SqueezeLight: Towards Scalable Optical Neural Networks with Multi-Operand Ring Resonators","date":"2021-02-05","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/a-deeper-look-into-convolutions-via-pruning","slug":"a-deeper-look-into-convolutions-via-pruning","title":"A Deeper Look into Convolutions via Eigenvalue-based Pruning","date":"2021-02-04","arxiv_id":"2102.02804","n_code_links":1,"syntology":null},{"paper":"/paper/compressed-object-detection","slug":"compressed-object-detection","title":"Compressed Object Detection","date":"2021-02-04","arxiv_id":"2102.02896","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-cnns-for-large-scale-species","title":"Deep CNNs for large scale species classification","date":"2021-02-03","arxiv_id":"2102.01863","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-a-reinforcement-learning-de-novo","title":"A step toward a reinforcement learning de novo genome assembler","date":"2021-02-02","arxiv_id":"2102.02649","n_code_links":0,"syntology":null},{"paper":null,"slug":"aacp-model-compression-by-accurate-and","title":"AACP: Model Compression by Accurate and Automatic Channel Pruning","date":"2021-01-31","arxiv_id":"2102.00390","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-and-discriminative-deep-belief","title":"Generative and Discriminative Deep Belief Network Classifiers: Comparisons Under an Approximate Computing Framework","date":"2021-01-31","arxiv_id":"2102.00534","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsity-in-deep-learning-pruning-and-growth","title":"Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks","date":"2021-01-31","arxiv_id":"2102.00554","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-advancing-the-earthquake-forecasting","title":"Towards advancing the earthquake forecasting by machine learning of satellite data","date":"2021-01-31","arxiv_id":"2102.04334","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-model-compression-based-on-the-training","title":"Deep Model Compression based on the Training History","date":"2021-01-30","arxiv_id":"2102.00160","n_code_links":0,"syntology":null},{"paper":null,"slug":"inductive-synthesis-for-probabilistic","title":"Inductive Synthesis for Probabilistic Programs Reaches New Horizons","date":"2021-01-29","arxiv_id":"2101.12683","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-paths-perspective-for-pruning-at-1","title":"A Unified Paths Perspective for Pruning at Initialization","date":"2021-01-26","arxiv_id":"2101.10552","n_code_links":0,"syntology":null},{"paper":null,"slug":"a2p-mann-adaptive-attention-inference-hops","title":"A2P-MANN: Adaptive Attention Inference Hops Pruned Memory-Augmented Neural Networks","date":"2021-01-24","arxiv_id":"2101.09693","n_code_links":0,"syntology":null},{"paper":null,"slug":"gst-group-sparse-training-for-accelerating","title":"GST: Group-Sparse Training for Accelerating Deep Reinforcement Learning","date":"2021-01-24","arxiv_id":"2101.09650","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-and-quantization-for-deep-neural","title":"Pruning and Quantization for Deep Neural Network Acceleration: A Survey","date":"2021-01-24","arxiv_id":"2101.09671","n_code_links":0,"syntology":null},{"paper":"/paper/baseline-pruning-based-approach-to-trojan","slug":"baseline-pruning-based-approach-to-trojan","title":"Baseline Pruning-Based Approach to Trojan Detection in Neural Networks","date":"2021-01-22","arxiv_id":"2101.12016","n_code_links":2,"syntology":null},{"paper":"/paper/hessian-aware-pruning-and-optimal-neural","slug":"hessian-aware-pruning-and-optimal-neural","title":"Hessian-Aware Pruning and Optimal Neural Implant","date":"2021-01-22","arxiv_id":"2101.08940","n_code_links":1,"syntology":null},{"paper":"/paper/better-short-than-greedy-interpretable-models","slug":"better-short-than-greedy-interpretable-models","title":"Better Short than Greedy: Interpretable Models through Optimal Rule Boosting","date":"2021-01-21","arxiv_id":"2101.08380","n_code_links":1,"syntology":null},{"paper":"/paper/non-parametric-adaptive-network-pruning","slug":"non-parametric-adaptive-network-pruning","title":"Network Pruning using Adaptive Exemplar Filters","date":"2021-01-20","arxiv_id":"2101.07985","n_code_links":1,"syntology":null},{"paper":"/paper/sparsednn-fast-sparse-deep-learning-inference","slug":"sparsednn-fast-sparse-deep-learning-inference","title":"SparseDNN: Fast Sparse Deep Learning Inference on CPUs","date":"2021-01-20","arxiv_id":"2101.07948","n_code_links":1,"syntology":null},{"paper":"/paper/zero-cost-proxies-for-lightweight-nas-1","slug":"zero-cost-proxies-for-lightweight-nas-1","title":"Zero-Cost Proxies for Lightweight NAS","date":"2021-01-20","arxiv_id":"2101.08134","n_code_links":2,"syntology":null},{"paper":"/paper/learnable-embedding-sizes-for-recommender-1","slug":"learnable-embedding-sizes-for-recommender-1","title":"Learnable Embedding Sizes for Recommender Systems","date":"2021-01-19","arxiv_id":"2101.07577","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ssui-liu/learnable-embed-sizes-for-RecSys"],"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":"multi-task-network-pruning-and-embedded","title":"Multi-Task Network Pruning and Embedded Optimization for Real-time Deployment in ADAS","date":"2021-01-19","arxiv_id":"2101.07831","n_code_links":0,"syntology":null},{"paper":"/paper/red-alarm-for-pre-trained-models-universal","slug":"red-alarm-for-pre-trained-models-universal","title":"Red Alarm for Pre-trained Models: Universal Vulnerability to Neuron-Level Backdoor Attacks","date":"2021-01-18","arxiv_id":"2101.06969","n_code_links":1,"syntology":null},{"paper":null,"slug":"kcp-kernel-cluster-pruning-for-dense-labeling","title":"KCP: Kernel Cluster Pruning for Dense Labeling Neural Networks","date":"2021-01-17","arxiv_id":"2101.06686","n_code_links":0,"syntology":null},{"paper":null,"slug":"network-automatic-pruning-start-nap-and-take","title":"Network Automatic Pruning: Start NAP and Take a Nap","date":"2021-01-17","arxiv_id":"2101.06608","n_code_links":0,"syntology":null},{"paper":"/paper/acp-automatic-channel-pruning-via-clustering","slug":"acp-automatic-channel-pruning-via-clustering","title":"ACP: Automatic Channel Pruning via Clustering and Swarm Intelligence Optimization for CNN","date":"2021-01-16","arxiv_id":"2101.06407","n_code_links":1,"syntology":null},{"paper":null,"slug":"convolutional-neural-network-with-pruning","title":"Convolutional Neural Network with Pruning Method for Handwritten Digit Recognition","date":"2021-01-15","arxiv_id":"2101.05996","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-width-based-planning-and","slug":"hierarchical-width-based-planning-and","title":"Hierarchical Width-Based Planning and Learning","date":"2021-01-15","arxiv_id":"2101.06177","n_code_links":1,"syntology":null},{"paper":null,"slug":"abs-automatic-bit-sharing-for-model-1","title":"Single-path Bit Sharing for Automatic Loss-aware Model Compression","date":"2021-01-13","arxiv_id":"2101.04935","n_code_links":0,"syntology":null},{"paper":"/paper/fast-convolutional-neural-networks-on-fpgas","slug":"fast-convolutional-neural-networks-on-fpgas","title":"Fast convolutional neural networks on FPGAs with hls4ml","date":"2021-01-13","arxiv_id":"2101.05108","n_code_links":2,"syntology":null},{"paper":null,"slug":"activation-density-based-mixed-precision","title":"Activation Density based Mixed-Precision Quantization for Energy Efficient Neural Networks","date":"2021-01-12","arxiv_id":"2101.04354","n_code_links":0,"syntology":null},{"paper":null,"slug":"convolutional-neural-network-simplification","title":"Convolutional Neural Network Simplification with Progressive Retraining","date":"2021-01-12","arxiv_id":"2101.04699","n_code_links":0,"syntology":null},{"paper":null,"slug":"statistical-methods-for-cis-mendelian","title":"Statistical Methods for cis-Mendelian Randomization with Two-sample Summary-level Data","date":"2021-01-11","arxiv_id":"2101.04081","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-semantic-adjacency-criterion-in-time","title":"The Semantic Adjacency Criterion in Time Intervals Mining","date":"2021-01-11","arxiv_id":"2101.03842","n_code_links":0,"syntology":null},{"paper":null,"slug":"residual-networks-classify-inputs-based-on-1","title":"Residual networks classify inputs based on their neural transient dynamics","date":"2021-01-08","arxiv_id":"2101.03009","n_code_links":0,"syntology":null},{"paper":null,"slug":"brds-an-fpga-based-lstm-accelerator-with-row","title":"BRDS: An FPGA-based LSTM Accelerator with Row-Balanced Dual-Ratio Sparsification","date":"2021-01-07","arxiv_id":"2101.02667","n_code_links":0,"syntology":null},{"paper":null,"slug":"l2pf-learning-to-prune-faster","title":"L2PF -- Learning to Prune Faster","date":"2021-01-07","arxiv_id":"2101.02663","n_code_links":0,"syntology":null},{"paper":"/paper/max-affine-spline-insights-into-deep-network-1","slug":"max-affine-spline-insights-into-deep-network-1","title":"Max-Affine Spline Insights Into Deep Network Pruning","date":"2021-01-07","arxiv_id":"2101.02338","n_code_links":1,"syntology":null},{"paper":null,"slug":"real-time-optimized-n-gram-for-mobile-devices","title":"Real-Time Optimized N-gram For Mobile Devices","date":"2021-01-07","arxiv_id":"2101.03967","n_code_links":0,"syntology":null},{"paper":null,"slug":"cap-context-aware-pruning-for-semantic","title":"CAP-Context-Aware-Pruning-for-Semantic-Segmentation","date":"2021-01-06","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"cap-context-aware-pruning-for-semantic-1","title":"CAP: Context-Aware Pruning for Semantic-Segmentation","date":"2021-01-06","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/consensus-guided-correspondence-denoising","slug":"consensus-guided-correspondence-denoising","title":"Progressive Correspondence Pruning by Consensus Learning","date":"2021-01-03","arxiv_id":"2101.00591","n_code_links":2,"syntology":{"ran":6,"of":11,"n_ran_checked":3,"n_instrument":3,"unverified":5,"pointer_only":5,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/an-empirical-study-of-a-pruning-mechanism","slug":"an-empirical-study-of-a-pruning-mechanism","title":"An empirical study of a pruning mechanism","date":"2021-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"balancing-training-time-vs-performance-with","title":"Balancing training time vs. performance with Bayesian Early Pruning","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/deep-ensembles-with-hierarchical-diversity","slug":"deep-ensembles-with-hierarchical-diversity","title":"Deep Ensembles with Hierarchical Diversity Pruning","date":"2021-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"dynamic-probabilistic-pruning-training-sparse","title":"Dynamic Probabilistic Pruning: Training sparse networks based on stochastic and dynamic masking","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"effective-training-of-sparse-neural-networks","title":"Effective Training of Sparse Neural Networks under Global Sparsity Constraint","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"exploration-and-estimation-for-model","title":"Exploration and Estimation for Model Compression","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"extract-local-inference-chains-of-deep-neural","title":"Extract Local Inference Chains of Deep Neural Nets","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"less-bits-is-more-how-pruning-deep-binary","title":"Less bits is more: How pruning deep binary networks increases weight capacity","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"linguine-learning-to-prune-on-subgraph","title":"LINGUINE: LearnIng to pruNe on subGraph convolUtIon NEtworks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"record_sha256":"9ebc740338b1a26a25ee61959cc71ed6fc17e817f2acf79d8d741d50043a3258","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}