{"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/28","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":28,"pages_in_order":39,"rows_per_page":100,"rows":[2701,2800],"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/27","next":"/method/pruning/papers/29","papers":[{"paper":null,"slug":"work-in-progress-mobile-or-fpga-a","title":"Improving DNN Fault Tolerance using Weight Pruning and Differential Crossbar Mapping for ReRAM-based Edge AI","date":"2021-06-16","arxiv_id":"2106.09166","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-micro-structured-weight-unification","title":"Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression","date":"2021-06-15","arxiv_id":"2106.08301","n_code_links":0,"syntology":null},{"paper":"/paper/simon-says-evaluating-and-mitigating-bias-in","slug":"simon-says-evaluating-and-mitigating-bias-in","title":"Simon Says: Evaluating and Mitigating Bias in Pruned Neural Networks with Knowledge Distillation","date":"2021-06-15","arxiv_id":"2106.07849","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":2,"n_instrument":2,"unverified":3,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["codestar12/pruning-distilation-bias"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"differentiable-neural-architecture-search","title":"Differentiable Neural Architecture Search with Morphism-based Transformable Backbone Architectures","date":"2021-06-14","arxiv_id":"2106.07211","n_code_links":0,"syntology":null},{"paper":null,"slug":"gridless-evolutionary-approach-for-line","title":"Gridless Evolutionary Approach for Line Spectral Estimation with Unknown Model Order","date":"2021-06-14","arxiv_id":"2106.07323","n_code_links":0,"syntology":null},{"paper":"/paper/pix2rule-end-to-end-neuro-symbolic-rule","slug":"pix2rule-end-to-end-neuro-symbolic-rule","title":"pix2rule: End-to-end Neuro-symbolic Rule Learning","date":"2021-06-14","arxiv_id":"2106.07487","n_code_links":3,"syntology":null},{"paper":null,"slug":"adaptive-dynamic-pruning-for-non-iid","title":"Heterogeneous Federated Learning using Dynamic Model Pruning and Adaptive Gradient","date":"2021-06-13","arxiv_id":"2106.06921","n_code_links":0,"syntology":null},{"paper":null,"slug":"parp-prune-adjust-and-re-prune-for-self","title":"PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition","date":"2021-06-10","arxiv_id":"2106.05933","n_code_links":0,"syntology":null},{"paper":null,"slug":"ex-uno-plures-splitting-one-model-into-an","title":"Ex uno plures: Splitting One Model into an Ensemble of Subnetworks","date":"2021-06-09","arxiv_id":"2106.04767","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-more-powerful-selective-inference","title":"Fast and More Powerful Selective Inference for Sparse High-order Interaction Model","date":"2021-06-09","arxiv_id":"2106.04929","n_code_links":0,"syntology":null},{"paper":"/paper/chasing-sparsity-in-vision-transformers-an","slug":"chasing-sparsity-in-vision-transformers-an","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","date":"2021-06-08","arxiv_id":"2106.04533","n_code_links":1,"syntology":{"ran":2,"of":7,"n_ran_checked":1,"n_instrument":1,"unverified":5,"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) · 5 unverified","official":{"repos":["VITA-Group/SViTE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"grapevine-winter-pruning-automation-on","title":"Grapevine Winter Pruning Automation: On Potential Pruning Points Detection through 2D Plant Modeling using Grapevine Segmentation","date":"2021-06-08","arxiv_id":"2106.04208","n_code_links":0,"syntology":null},{"paper":null,"slug":"fednilm-applying-federated-learning-to-nilm","title":"FedNILM: Applying Federated Learning to NILM Applications at the Edge","date":"2021-06-07","arxiv_id":"2106.07751","n_code_links":0,"syntology":null},{"paper":"/paper/heavy-tails-in-sgd-and-compressibility-of","slug":"heavy-tails-in-sgd-and-compressibility-of","title":"Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks","date":"2021-06-07","arxiv_id":"2106.03795","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-lottery-ticket-finding-less-data-is","slug":"efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","arxiv_id":"2106.03225","n_code_links":1,"syntology":{"ran":7,"of":14,"n_ran_checked":3,"n_instrument":4,"unverified":7,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 7 unverified","official":{"repos":["VITA-Group/PrAC-LTH"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"towards-fast-and-accurate-multi-person-pose","title":"Towards Fast and Accurate Multi-Person Pose Estimation on Mobile Devices","date":"2021-06-06","arxiv_id":"2106.15304","n_code_links":0,"syntology":null},{"paper":null,"slug":"feature-flow-regularization-improving","title":"Feature Flow Regularization: Improving Structured Sparsity in Deep Neural Networks","date":"2021-06-05","arxiv_id":"2106.02914","n_code_links":0,"syntology":null},{"paper":"/paper/dynamicvit-efficient-vision-transformers-with","slug":"dynamicvit-efficient-vision-transformers-with","title":"DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsification","date":"2021-06-03","arxiv_id":"2106.02034","n_code_links":2,"syntology":{"ran":7,"of":9,"n_ran_checked":4,"n_instrument":3,"unverified":2,"pointer_only":1,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["raoyongming/DynamicViT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":"/paper/lgesql-line-graph-enhanced-text-to-sql-model","slug":"lgesql-line-graph-enhanced-text-to-sql-model","title":"LGESQL: Line Graph Enhanced Text-to-SQL Model with Mixed Local and Non-Local Relations","date":"2021-06-02","arxiv_id":"2106.01093","n_code_links":1,"syntology":{"ran":10,"of":11,"n_ran_checked":10,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 3 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["rhythmcao/text2sql-lgesql"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"on-the-distribution-sparsity-and-inference","title":"On the Distribution, Sparsity, and Inference-time Quantization of Attention Values in Transformers","date":"2021-06-02","arxiv_id":"2106.01335","n_code_links":0,"syntology":null},{"paper":"/paper/smooth-bilevel-programming-for-sparse","slug":"smooth-bilevel-programming-for-sparse","title":"Smooth Bilevel Programming for Sparse Regularization","date":"2021-06-02","arxiv_id":"2106.01429","n_code_links":2,"syntology":null},{"paper":"/paper/dot-an-efficient-double-transformer-for-nlp","slug":"dot-an-efficient-double-transformer-for-nlp","title":"DoT: An efficient Double Transformer for NLP tasks with tables","date":"2021-06-01","arxiv_id":"2106.00479","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":1,"n_instrument":4,"unverified":4,"pointer_only":0,"phrase":"5 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; 4 where Syntology's instrument failed) · 4 unverified","official":{"repos":["google-research/tapas"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"on-attention-redundancy-a-comprehensive-study","title":"On Attention Redundancy: A Comprehensive Study","date":"2021-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/1-times-n-block-pattern-for-network-sparsity","slug":"1-times-n-block-pattern-for-network-sparsity","title":"1xN Pattern for Pruning Convolutional Neural Networks","date":"2021-05-31","arxiv_id":"2105.14713","n_code_links":1,"syntology":null},{"paper":"/paper/gans-can-play-lottery-tickets-too-1","slug":"gans-can-play-lottery-tickets-too-1","title":"GANs Can Play Lottery Tickets Too","date":"2021-05-31","arxiv_id":"2106.00134","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["VITA-Group/GAN-LTH"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/greedy-layer-pruning-decreasing-inference","slug":"greedy-layer-pruning-decreasing-inference","title":"Greedy-layer Pruning: Speeding up Transformer Models for Natural Language Processing","date":"2021-05-31","arxiv_id":"2105.14839","n_code_links":1,"syntology":null},{"paper":null,"slug":"red-looking-for-redundancies-for-data-free","title":"RED : Looking for Redundancies for Data-Free Structured Compression of Deep Neural Networks","date":"2021-05-31","arxiv_id":"2105.14797","n_code_links":0,"syntology":null},{"paper":"/paper/mlpruning-a-multilevel-structured-pruning","slug":"mlpruning-a-multilevel-structured-pruning","title":"LEAP: Learnable Pruning for Transformer-based Models","date":"2021-05-30","arxiv_id":"2105.14636","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: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yaozhewei/mlpruning"],"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":"accelerating-neural-odes-using-model-order","title":"Accelerating Neural ODEs Using Model Order Reduction","date":"2021-05-28","arxiv_id":"2105.14070","n_code_links":0,"syntology":null},{"paper":null,"slug":"advparams-an-active-dnn-intellectual-property","title":"AdvParams: An Active DNN Intellectual Property Protection Technique via Adversarial Perturbation Based Parameter Encryption","date":"2021-05-28","arxiv_id":"2105.13697","n_code_links":0,"syntology":null},{"paper":"/paper/evaluation-of-concept-drift-adaptation-for","slug":"evaluation-of-concept-drift-adaptation-for","title":"Evaluation of concept drift adaptation for acoustic scene classifier based on Kernel Density Drift Detection and Combine Merge Gaussian Mixture Model","date":"2021-05-27","arxiv_id":"2105.13220","n_code_links":1,"syntology":null},{"paper":null,"slug":"dynamic-probabilistic-pruning-a-general","title":"Dynamic Probabilistic Pruning: A general framework for hardware-constrained pruning at different granularities","date":"2021-05-26","arxiv_id":"2105.12686","n_code_links":0,"syntology":null},{"paper":null,"slug":"real-time-monocular-depth-estimation-with","title":"Real-time Monocular Depth Estimation with Sparse Supervision on Mobile","date":"2021-05-25","arxiv_id":"2105.12053","n_code_links":0,"syntology":null},{"paper":null,"slug":"airnet-neural-network-transmission-over-the","title":"AirNet: Neural Network Transmission over the Air","date":"2021-05-24","arxiv_id":"2105.11166","n_code_links":0,"syntology":null},{"paper":"/paper/towards-compact-cnns-via-collaborative","slug":"towards-compact-cnns-via-collaborative","title":"Towards Compact CNNs via Collaborative Compression","date":"2021-05-24","arxiv_id":"2105.11228","n_code_links":1,"syntology":null},{"paper":"/paper/spectral-pruning-for-recurrent-neural","slug":"spectral-pruning-for-recurrent-neural","title":"Spectral Pruning for Recurrent Neural Networks","date":"2021-05-23","arxiv_id":"2105.10832","n_code_links":1,"syntology":null},{"paper":null,"slug":"whole-body-control-on-non-holonomic-mobile","title":"Whole-Body Control on Non-holonomic Mobile Manipulation for Grapevine Winter Pruning Automation","date":"2021-05-22","arxiv_id":"2105.10777","n_code_links":0,"syntology":null},{"paper":null,"slug":"bcnet-searching-for-network-width-with","title":"BCNet: Searching for Network Width with Bilaterally Coupled Network","date":"2021-05-21","arxiv_id":"2105.10533","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-probabilistic-approach-to-neural-network","title":"A Probabilistic Approach to Neural Network Pruning","date":"2021-05-20","arxiv_id":"2105.10065","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-pruning-of-a-neural-network-via","title":"Dynamic Pruning of a Neural Network via Gradient Signal-to-Noise Ratio","date":"2021-05-20","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/intra-document-cascading-learning-to-select","slug":"intra-document-cascading-learning-to-select","title":"Intra-Document Cascading: Learning to Select Passages for Neural Document Ranking","date":"2021-05-20","arxiv_id":"2105.09816","n_code_links":1,"syntology":null},{"paper":null,"slug":"model-compression","title":"Model Compression","date":"2021-05-20","arxiv_id":"2105.10059","n_code_links":0,"syntology":null},{"paper":"/paper/visual-fudge-form-understanding-via-dynamic","slug":"visual-fudge-form-understanding-via-dynamic","title":"Visual FUDGE: Form Understanding via Dynamic Graph Editing","date":"2021-05-17","arxiv_id":"2105.08194","n_code_links":3,"syntology":null},{"paper":null,"slug":"high-robustness-low-transferability","title":"High-Robustness, Low-Transferability Fingerprinting of Neural Networks","date":"2021-05-14","arxiv_id":"2105.07078","n_code_links":0,"syntology":null},{"paper":null,"slug":"bwcp-probabilistic-learning-to-prune-channels","title":"BWCP: Probabilistic Learning-to-Prune Channels for ConvNets via Batch Whitening","date":"2021-05-13","arxiv_id":"2105.06423","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-pruning-based-on-quantified-similarity","title":"Model Pruning Based on Quantified Similarity of Feature Maps","date":"2021-05-13","arxiv_id":"2105.06052","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamical-isometry-the-missing-ingredient-for","title":"Dynamical Isometry: The Missing Ingredient for Neural Network Pruning","date":"2021-05-12","arxiv_id":"2105.05916","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-pomdp-planning-via-simplification","title":"Online POMDP Planning via Simplification","date":"2021-05-11","arxiv_id":"2105.05296","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-of-deep-spiking-neural-networks","slug":"pruning-of-deep-spiking-neural-networks","title":"Pruning of Deep Spiking Neural Networks through Gradient Rewiring","date":"2021-05-11","arxiv_id":"2105.04916","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":["Yanqi-Chen/Gradient-Rewiring"],"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/accelerating-large-scale-real-time-gnn","slug":"accelerating-large-scale-real-time-gnn","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","date":"2021-05-10","arxiv_id":"2105.04528","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["tedzhouhk/GCNP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/recommendations-for-item-set-completion-on","slug":"recommendations-for-item-set-completion-on","title":"Recommendations for Item Set Completion: On the Semantics of Item Co-Occurrence With Data Sparsity, Input Size, and Input Modalities","date":"2021-05-10","arxiv_id":"2105.04376","n_code_links":1,"syntology":null},{"paper":null,"slug":"automated-decision-based-adversarial-attacks","title":"Automated Decision-based Adversarial Attacks","date":"2021-05-09","arxiv_id":"2105.03931","n_code_links":0,"syntology":null},{"paper":"/paper/ezcrop-energy-zoned-channels-for-robust","slug":"ezcrop-energy-zoned-channels-for-robust","title":"EZCrop: Energy-Zoned Channels for Robust Output Pruning","date":"2021-05-08","arxiv_id":"2105.03679","n_code_links":1,"syntology":null},{"paper":"/paper/adapting-by-pruning-a-case-study-on-bert","slug":"adapting-by-pruning-a-case-study-on-bert","title":"Adapting by Pruning: A Case Study on BERT","date":"2021-05-07","arxiv_id":"2105.03343","n_code_links":1,"syntology":null},{"paper":"/paper/network-pruning-that-matters-a-case-study-on-1","slug":"network-pruning-that-matters-a-case-study-on-1","title":"Network Pruning That Matters: A Case Study on Retraining Variants","date":"2021-05-07","arxiv_id":"2105.03193","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":6,"n_instrument":2,"unverified":4,"pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["lehduong/NPTM"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"exact-acceleration-of-k-means-and-k-means","title":"Exact Acceleration of K-Means++ and K-Means$\\|$","date":"2021-05-06","arxiv_id":"2105.02936","n_code_links":0,"syntology":null},{"paper":"/paper/physics-informed-spline-learning-for","slug":"physics-informed-spline-learning-for","title":"Physics-informed Spline Learning for Nonlinear Dynamics Discovery","date":"2021-05-05","arxiv_id":"2105.02368","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"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":["isds-neu/PiSL"],"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":null,"slug":"sequential-encryption-of-sparse-neural","title":"Encoding Weights of Irregular Sparsity for Fixed-to-Fixed Model Compression","date":"2021-05-05","arxiv_id":"2105.01869","n_code_links":0,"syntology":null},{"paper":null,"slug":"alternate-model-growth-and-pruning-for","title":"Alternate Model Growth and Pruning for Efficient Training of Recommendation Systems","date":"2021-05-04","arxiv_id":"2105.01064","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-lottery-tickets-and-minimal-task","title":"On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learning","date":"2021-05-04","arxiv_id":"2105.01648","n_code_links":0,"syntology":null},{"paper":"/paper/effective-sparsification-of-neural-networks","slug":"effective-sparsification-of-neural-networks","title":"Effective Sparsification of Neural Networks with Global Sparsity Constraint","date":"2021-05-03","arxiv_id":"2105.01571","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":2,"phrase":"0 ran · 2 unverified","official":{"repos":["x-zho14/ProbMask-official"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":"/paper/initialization-and-regularization-of-1","slug":"initialization-and-regularization-of-1","title":"Initialization and Regularization of Factorized Neural Layers","date":"2021-05-03","arxiv_id":"2105.01029","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 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["microsoft/fnl_paper"],"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":"/paper/a-1d-cnn-based-deep-learning-technique-for","slug":"a-1d-cnn-based-deep-learning-technique-for","title":"A 1D-CNN Based Deep Learning Technique for Sleep Apnea Detection in IoT Sensors","date":"2021-05-02","arxiv_id":"2105.00528","n_code_links":1,"syntology":null},{"paper":"/paper/personalized-federated-learning-by-structured","slug":"personalized-federated-learning-by-structured","title":"Personalized Federated Learning by Structured and Unstructured Pruning under Data Heterogeneity","date":"2021-05-02","arxiv_id":"2105.00562","n_code_links":1,"syntology":null},{"paper":null,"slug":"post-training-deep-neural-network-pruning-via","title":"Post-training deep neural network pruning via layer-wise calibration","date":"2021-04-30","arxiv_id":"2104.15023","n_code_links":0,"syntology":null},{"paper":"/paper/stealthy-backdoors-as-compression-artifacts","slug":"stealthy-backdoors-as-compression-artifacts","title":"Stealthy Backdoors as Compression Artifacts","date":"2021-04-30","arxiv_id":"2104.15129","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":7,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["yulongtzzz/Stealthy-Backdoors-as-Compression-Artifacts"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"studying-the-consistency-and-composability-of","title":"Studying the Consistency and Composability of Lottery Ticket Pruning Masks","date":"2021-04-30","arxiv_id":"2104.14753","n_code_links":0,"syntology":null},{"paper":null,"slug":"discovery-of-slow-variables-in-a-class-of","title":"Discovery of slow variables in a class of multiscale stochastic systems via neural networks","date":"2021-04-28","arxiv_id":"2104.13911","n_code_links":0,"syntology":null},{"paper":null,"slug":"preserving-earlier-knowledge-in-continual","title":"Preserving Earlier Knowledge in Continual Learning with the Help of All Previous Feature Extractors","date":"2021-04-28","arxiv_id":"2104.13614","n_code_links":0,"syntology":null},{"paper":"/paper/sifting-out-the-features-by-pruning-are","slug":"sifting-out-the-features-by-pruning-are","title":"Sifting out the features by pruning: Are convolutional networks the winning lottery ticket of fully connected ones?","date":"2021-04-27","arxiv_id":"2104.13343","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-hyperparameter-optimization-for","title":"Efficient Hyperparameter Optimization for Physics-based Character Animation","date":"2021-04-26","arxiv_id":"2104.12365","n_code_links":0,"syntology":null},{"paper":null,"slug":"spatio-temporal-pruning-and-quantization-for","title":"Spatio-Temporal Pruning and Quantization for Low-latency Spiking Neural Networks","date":"2021-04-26","arxiv_id":"2104.12528","n_code_links":0,"syntology":null},{"paper":null,"slug":"balancing-accuracy-and-latency-in-multipath","title":"Balancing Accuracy and Latency in Multipath Neural Networks","date":"2021-04-25","arxiv_id":"2104.12040","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantization-of-deep-neural-networks-for-1","title":"Quantization of Deep Neural Networks for Accurate Edge Computing","date":"2021-04-25","arxiv_id":"2104.12046","n_code_links":0,"syntology":null},{"paper":"/paper/carrying-out-cnn-channel-pruning-in-a-white","slug":"carrying-out-cnn-channel-pruning-in-a-white","title":"Carrying out CNN Channel Pruning in a White Box","date":"2021-04-24","arxiv_id":"2104.11883","n_code_links":1,"syntology":null},{"paper":"/paper/improving-the-filtering-of-branch-and-bound","slug":"improving-the-filtering-of-branch-and-bound","title":"Improving the filtering of Branch-And-Bound MDD solver (extended)","date":"2021-04-24","arxiv_id":"2104.11951","n_code_links":1,"syntology":null},{"paper":null,"slug":"partitioning-sparse-deep-neural-networks-for","title":"Partitioning sparse deep neural networks for scalable training and inference","date":"2021-04-23","arxiv_id":"2104.11805","n_code_links":0,"syntology":null},{"paper":null,"slug":"playing-lottery-tickets-with-vision-and","title":"Playing Lottery Tickets with Vision and Language","date":"2021-04-23","arxiv_id":"2104.11832","n_code_links":0,"syntology":null},{"paper":null,"slug":"mrrt-multiple-rapidly-exploring-random-trees","title":"MRRT: Multiple Rapidly-Exploring Random Trees for Fast Online Replanning in Dynamic Environments","date":"2021-04-22","arxiv_id":"2104.11059","n_code_links":0,"syntology":null},{"paper":"/paper/beyond-outlier-detection-outlier","slug":"beyond-outlier-detection-outlier","title":"Beyond Outlier Detection: Outlier Interpretation by Attention-Guided Triplet Deviation Network","date":"2021-04-19","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-to-sparsify-travelling-salesman","title":"Learning to Sparsify Travelling Salesman Problem Instances","date":"2021-04-19","arxiv_id":"2104.09345","n_code_links":0,"syntology":null},{"paper":null,"slug":"protecting-the-intellectual-properties-of","title":"Protecting the Intellectual Properties of Deep Neural Networks with an Additional Class and Steganographic Images","date":"2021-04-19","arxiv_id":"2104.09203","n_code_links":0,"syntology":null},{"paper":"/paper/anytime-ranking-on-document-ordered-indexes","slug":"anytime-ranking-on-document-ordered-indexes","title":"Anytime Ranking on Document-Ordered Indexes","date":"2021-04-18","arxiv_id":"2104.08976","n_code_links":1,"syntology":null},{"paper":"/paper/lottery-jackpots-exist-in-pre-trained-models","slug":"lottery-jackpots-exist-in-pre-trained-models","title":"Lottery Jackpots Exist in Pre-trained Models","date":"2021-04-18","arxiv_id":"2104.08700","n_code_links":2,"syntology":null},{"paper":"/paper/rethinking-network-pruning-under-the-pre","slug":"rethinking-network-pruning-under-the-pre","title":"Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigm","date":"2021-04-18","arxiv_id":"2104.08682","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":["derronxu/sparsebert"],"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/visual-transformer-pruning","slug":"visual-transformer-pruning","title":"Vision Transformer Pruning","date":"2021-04-17","arxiv_id":"2104.08500","n_code_links":2,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"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) · 1 unverified","official":null}},{"paper":null,"slug":"telcos-ondevice-text-localization-with","title":"TeLCoS: OnDevice Text Localization with Clustering of Script","date":"2021-04-16","arxiv_id":"2104.08045","n_code_links":0,"syntology":null},{"paper":null,"slug":"disentangling-representations-of-text-by-1","title":"Disentangling Representations of Text by Masking Transformers","date":"2021-04-14","arxiv_id":"2104.07155","n_code_links":0,"syntology":null},{"paper":null,"slug":"approach-for-modeling-single-branches-of","title":"Approach for modeling single branches of meadow orchard trees with 3D point clouds","date":"2021-04-12","arxiv_id":"2104.05282","n_code_links":0,"syntology":null},{"paper":"/paper/fruit-quality-and-defect-image-classification","slug":"fruit-quality-and-defect-image-classification","title":"Fruit Quality and Defect Image Classification with Conditional GAN Data Augmentation","date":"2021-04-12","arxiv_id":"2104.05647","n_code_links":1,"syntology":null},{"paper":null,"slug":"piracy-resistant-dnn-watermarking-by-block","title":"Piracy-Resistant DNN Watermarking by Block-Wise Image Transformation with Secret Key","date":"2021-04-09","arxiv_id":"2104.04241","n_code_links":0,"syntology":null},{"paper":null,"slug":"reversible-watermarking-in-deep-convolutional","title":"Reversible Watermarking in Deep Convolutional Neural Networks for Integrity Authentication","date":"2021-04-09","arxiv_id":"2104.04268","n_code_links":0,"syntology":null},{"paper":null,"slug":"convolutional-neural-network-pruning-with","title":"Convolutional Neural Network Pruning with Structural Redundancy Reduction","date":"2021-04-08","arxiv_id":"2104.03438","n_code_links":0,"syntology":null},{"paper":"/paper/content-aware-gan-compression","slug":"content-aware-gan-compression","title":"Content-Aware GAN Compression","date":"2021-04-06","arxiv_id":"2104.02244","n_code_links":1,"syntology":{"ran":9,"of":16,"n_ran_checked":6,"n_instrument":3,"unverified":7,"pointer_only":0,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","official":{"repos":["lychenyoko/content-aware-gan-compression"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"low-complexity-joint-impairment-mitigation-of","title":"Low Complexity Joint Impairment Mitigation of I/Q Modulator and PA Using Neural Networks","date":"2021-04-06","arxiv_id":"2104.02512","n_code_links":0,"syntology":null},{"paper":null,"slug":"tight-compression-compressing-cnn-through","title":"Tight Compression: Compressing CNN Through Fine-Grained Pruning and Weight Permutation for Efficient Implementation","date":"2021-04-03","arxiv_id":"2104.01303","n_code_links":0,"syntology":null},{"paper":"/paper/anchor-pruning-for-object-detection","slug":"anchor-pruning-for-object-detection","title":"Anchor Pruning for Object Detection","date":"2021-04-01","arxiv_id":"2104.00432","n_code_links":1,"syntology":null},{"paper":null,"slug":"automated-classification-of-written","title":"Automated Classification of Written Proficiency Levels on the CEFR-Scale through Complexity Contours and RNNs","date":"2021-04-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/der-dynamically-expandable-representation-for","slug":"der-dynamically-expandable-representation-for","title":"DER: Dynamically Expandable Representation for Class Incremental Learning","date":"2021-03-31","arxiv_id":"2103.16788","n_code_links":2,"syntology":{"ran":6,"of":11,"n_ran_checked":2,"n_instrument":4,"unverified":5,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","official":{"repos":["Rhyssiyan/DER-ClassIL.pytorch"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-response-interpretation-through-the","slug":"neural-response-interpretation-through-the","title":"Neural Response Interpretation through the Lens of Critical Pathways","date":"2021-03-31","arxiv_id":"2103.16886","n_code_links":2,"syntology":{"ran":1,"of":8,"n_ran_checked":0,"n_instrument":1,"unverified":7,"pointer_only":7,"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) · 7 unverified","official":{"repos":["CAMP-eXplain-AI/PathwayGrad","CAMP-eXplain-AI/RoarTorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}}],"record_sha256":"36d225cc7271394680392aa8f1ec70779a65464c12ed18ce4e81894061364056","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}