{"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/21","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":21,"pages_in_order":39,"rows_per_page":100,"rows":[2001,2100],"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/20","next":"/method/pruning/papers/22","papers":[{"paper":"/paper/sparse-winning-tickets-are-data-efficient","slug":"sparse-winning-tickets-are-data-efficient","title":"Sparse Winning Tickets are Data-Efficient Image Recognizers","date":"2022-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/vtc-lfc-vision-transformer-compression-with","slug":"vtc-lfc-vision-transformer-compression-with","title":"VTC-LFC: Vision Transformer Compression with Low-Frequency Components","date":"2022-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-heuristics-for-the-maximum-clique","title":"Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations","date":"2022-10-30","arxiv_id":"2210.16963","n_code_links":0,"syntology":null},{"paper":"/paper/a-pruning-method-based-on-the-dissimilarity","slug":"a-pruning-method-based-on-the-dissimilarity","title":"A pruning method based on the dissimilarity of angle among channels and filters","date":"2022-10-29","arxiv_id":"2210.16504","n_code_links":1,"syntology":null},{"paper":null,"slug":"learninggroup-a-real-time-sparse-training-on","title":"LearningGroup: A Real-Time Sparse Training on FPGA via Learnable Weight Grouping for Multi-Agent Reinforcement Learning","date":"2022-10-29","arxiv_id":"2210.16624","n_code_links":0,"syntology":null},{"paper":"/paper/coverage-centric-coreset-selection-for-high","slug":"coverage-centric-coreset-selection-for-high","title":"Coverage-centric Coreset Selection for High Pruning Rates","date":"2022-10-28","arxiv_id":"2210.15809","n_code_links":1,"syntology":null},{"paper":"/paper/debiasing-masks-a-new-framework-for-shortcut","slug":"debiasing-masks-a-new-framework-for-shortcut","title":"Debiasing Masks: A New Framework for Shortcut Mitigation in NLU","date":"2022-10-28","arxiv_id":"2210.16079","n_code_links":1,"syntology":null},{"paper":null,"slug":"autoattention-automatic-field-pair-selection","title":"AutoAttention: Automatic Field Pair Selection for Attention in User Behavior Modeling","date":"2022-10-27","arxiv_id":"2210.15154","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-similarity-based-passive-filter","slug":"efficient-similarity-based-passive-filter","title":"Efficient Similarity-based Passive Filter Pruning for Compressing CNNs","date":"2022-10-27","arxiv_id":"2210.17416","n_code_links":1,"syntology":null},{"paper":"/paper/fast-distilbert-on-cpus","slug":"fast-distilbert-on-cpus","title":"Fast DistilBERT on CPUs","date":"2022-10-27","arxiv_id":"2211.07715","n_code_links":1,"syntology":null},{"paper":"/paper/procontext-exploring-progressive-context","slug":"procontext-exploring-progressive-context","title":"ProContEXT: Exploring Progressive Context Transformer for Tracking","date":"2022-10-27","arxiv_id":"2210.15511","n_code_links":4,"syntology":null},{"paper":null,"slug":"self-consistent-reasoning-for-solving-math","title":"Self-consistent Reasoning For Solving Math Word Problems","date":"2022-10-27","arxiv_id":"2210.15373","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-correlated-sequential-rules","title":"Towards Correlated Sequential Rules","date":"2022-10-27","arxiv_id":"2210.15637","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-s-effect-on-generalization-through","title":"Pruning's Effect on Generalization Through the Lens of Training and Regularization","date":"2022-10-25","arxiv_id":"2210.13738","n_code_links":0,"syntology":null},{"paper":null,"slug":"toward-domain-generalized-pruning-by-scoring","title":"Toward domain generalized pruning by scoring out-of-distribution importance","date":"2022-10-25","arxiv_id":"2210.13810","n_code_links":0,"syntology":null},{"paper":null,"slug":"legal-tech-open-diaries-lesson-learned-on-how","title":"Legal-Tech Open Diaries: Lesson learned on how to develop and deploy light-weight models in the era of humongous Language Models","date":"2022-10-24","arxiv_id":"2210.13086","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-optimization-and-pruning-for-bayesian","slug":"on-the-optimization-and-pruning-for-bayesian","title":"On the optimization and pruning for Bayesian deep learning","date":"2022-10-24","arxiv_id":"2210.12957","n_code_links":1,"syntology":null},{"paper":null,"slug":"self-configuring-nnu-nets-detect-clouds-in","title":"Self-Configuring nnU-Nets Detect Clouds in Satellite Images","date":"2022-10-24","arxiv_id":"2210.13659","n_code_links":0,"syntology":null},{"paper":"/paper/weight-fixing-networks","slug":"weight-fixing-networks","title":"Weight Fixing Networks","date":"2022-10-24","arxiv_id":"2210.13554","n_code_links":1,"syntology":null},{"paper":null,"slug":"pushing-the-efficiency-limit-using-structured","title":"Pushing the Efficiency Limit Using Structured Sparse Convolutions","date":"2022-10-23","arxiv_id":"2210.12818","n_code_links":0,"syntology":null},{"paper":null,"slug":"sub-network-multi-objective-evolutionary","title":"Sub-network Multi-objective Evolutionary Algorithm for Filter Pruning","date":"2022-10-22","arxiv_id":"2211.01957","n_code_links":0,"syntology":null},{"paper":"/paper/multitasking-models-are-robust-to-structural","slug":"multitasking-models-are-robust-to-structural","title":"Multitasking Models are Robust to Structural Failure: A Neural Model for Bilingual Cognitive Reserve","date":"2022-10-20","arxiv_id":"2210.11618","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":0,"n_instrument":4,"unverified":1,"pointer_only":5,"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) · 1 unverified","official":{"repos":["giannisdaras/multilingual_robustness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"optimal-settings-for-cryptocurrency-trading","title":"Optimal Settings for Cryptocurrency Trading Pairs","date":"2022-10-20","arxiv_id":"2210.10971","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-by-active-attention-manipulation","title":"Pruning by Active Attention Manipulation","date":"2022-10-20","arxiv_id":"2210.11114","n_code_links":0,"syntology":null},{"paper":"/paper/towards-accurate-subgraph-similarity","slug":"towards-accurate-subgraph-similarity","title":"Towards Accurate Subgraph Similarity Computation via Neural Graph Pruning","date":"2022-10-19","arxiv_id":"2210.10643","n_code_links":1,"syntology":null},{"paper":"/paper/alibaba-translate-china-s-submission-for-wmt-1","slug":"alibaba-translate-china-s-submission-for-wmt-1","title":"Alibaba-Translate China's Submission for WMT 2022 Quality Estimation Shared Task","date":"2022-10-18","arxiv_id":"2210.10049","n_code_links":1,"syntology":null},{"paper":null,"slug":"domain-specific-sub-network-for-multi-domain","title":"Domain Specific Sub-network for Multi-Domain Neural Machine Translation","date":"2022-10-18","arxiv_id":"2210.09805","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-properties-of-decision-trees","title":"Generalization Properties of Decision Trees on Real-valued and Categorical Features","date":"2022-10-18","arxiv_id":"2210.10781","n_code_links":0,"syntology":null},{"paper":"/paper/principled-pruning-of-bayesian-neural","slug":"principled-pruning-of-bayesian-neural","title":"Principled Pruning of Bayesian Neural Networks through Variational Free Energy Minimization","date":"2022-10-17","arxiv_id":"2210.09134","n_code_links":1,"syntology":null},{"paper":"/paper/token-merging-your-vit-but-faster","slug":"token-merging-your-vit-but-faster","title":"Token Merging: Your ViT But Faster","date":"2022-10-17","arxiv_id":"2210.09461","n_code_links":5,"syntology":{"ran":5,"of":5,"n_ran_checked":2,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["facebookresearch/tome"],"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":["listed","official","unlocated"]}}},{"paper":null,"slug":"connection-based-scheduling-for-real-time","title":"Connection-Based Scheduling for Real-Time Intersection Control","date":"2022-10-16","arxiv_id":"2210.08445","n_code_links":0,"syntology":null},{"paper":"/paper/close-the-gate-detecting-backdoored-models-in","slug":"close-the-gate-detecting-backdoored-models-in","title":"CrowdGuard: Federated Backdoor Detection in Federated Learning","date":"2022-10-14","arxiv_id":"2210.07714","n_code_links":1,"syntology":null},{"paper":"/paper/efficientvlm-fast-and-accurate-vision","slug":"efficientvlm-fast-and-accurate-vision","title":"EfficientVLM: Fast and Accurate Vision-Language Models via Knowledge Distillation and Modal-adaptive Pruning","date":"2022-10-14","arxiv_id":"2210.07795","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":4,"n_instrument":3,"unverified":2,"pointer_only":9,"phrase":"7 ran (of which 0 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":["swaggy-tn/efficientvlm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"infip-an-explainable-dnn-intellectual","title":"InFIP: An Explainable DNN Intellectual Property Protection Method based on Intrinsic Features","date":"2022-10-14","arxiv_id":"2210.07481","n_code_links":0,"syntology":null},{"paper":"/paper/lightweight-alpha-matting-network-using","slug":"lightweight-alpha-matting-network-using","title":"Lightweight Alpha Matting Network Using Distillation-Based Channel Pruning","date":"2022-10-14","arxiv_id":"2210.07760","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-network-compression-by-joint-sparsity","title":"Neural Network Compression by Joint Sparsity Promotion and Redundancy Reduction","date":"2022-10-14","arxiv_id":"2210.07451","n_code_links":0,"syntology":null},{"paper":null,"slug":"ovit-an-accurate-second-order-pruning","title":"CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models","date":"2022-10-14","arxiv_id":"2210.09223","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-topological-data-analysis-study-on-murine","title":"A Topological Data Analysis Study on Murine Pulmonary Arterial Trees with Pulmonary Hypertension","date":"2022-10-13","arxiv_id":"2210.07345","n_code_links":0,"syntology":null},{"paper":"/paper/an-open-world-lottery-ticket-for-out-of","slug":"an-open-world-lottery-ticket-for-out-of","title":"The Open-World Lottery Ticket Hypothesis for OOD Intent Classification","date":"2022-10-13","arxiv_id":"2210.07071","n_code_links":1,"syntology":null},{"paper":"/paper/structural-pruning-via-latency-saliency","slug":"structural-pruning-via-latency-saliency","title":"Structural Pruning via Latency-Saliency Knapsack","date":"2022-10-13","arxiv_id":"2210.06659","n_code_links":1,"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":null}},{"paper":null,"slug":"gmp-well-tuned-global-magnitude-pruning-can","title":"GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methods","date":"2022-10-12","arxiv_id":"2210.06384","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-pre-trained-language-models-without","slug":"pruning-pre-trained-language-models-without","title":"Pruning Pre-trained Language Models Without Fine-Tuning","date":"2022-10-12","arxiv_id":"2210.06210","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-debiasing-with-contrastive-weight","slug":"efficient-debiasing-with-contrastive-weight","title":"Training Debiased Subnetworks with Contrastive Weight Pruning","date":"2022-10-11","arxiv_id":"2210.05247","n_code_links":1,"syntology":null},{"paper":"/paper/sait-sparse-vision-transformers-through","slug":"sait-sparse-vision-transformers-through","title":"SaiT: Sparse Vision Transformers through Adaptive Token Pruning","date":"2022-10-11","arxiv_id":"2210.05832","n_code_links":1,"syntology":null},{"paper":null,"slug":"shapley-head-pruning-identifying-and-removing","title":"Shapley Head Pruning: Identifying and Removing Interference in Multilingual Transformers","date":"2022-10-11","arxiv_id":"2210.05709","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-adversarially-robust-neural-networks","slug":"pruning-adversarially-robust-neural-networks","title":"Pruning Adversarially Robust Neural Networks without Adversarial Examples","date":"2022-10-09","arxiv_id":"2210.04311","n_code_links":1,"syntology":{"ran":6,"of":14,"n_ran_checked":5,"n_instrument":1,"unverified":8,"pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["neu-spiral/pwoa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/sparseadapter-an-easy-approach-for-improving","slug":"sparseadapter-an-easy-approach-for-improving","title":"SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters","date":"2022-10-09","arxiv_id":"2210.04284","n_code_links":1,"syntology":null},{"paper":"/paper/advancing-model-pruning-via-bi-level","slug":"advancing-model-pruning-via-bi-level","title":"Advancing Model Pruning via Bi-level Optimization","date":"2022-10-08","arxiv_id":"2210.04092","n_code_links":1,"syntology":{"ran":1,"of":7,"n_ran_checked":1,"n_instrument":0,"unverified":6,"pointer_only":7,"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) · 6 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["optml-group/bip"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"unmasking-the-lottery-ticket-hypothesis-what","title":"Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?","date":"2022-10-06","arxiv_id":"2210.03044","n_code_links":0,"syntology":null},{"paper":"/paper/how-erdos-and-renyi-win-the-lottery","slug":"how-erdos-and-renyi-win-the-lottery","title":"Why Random Pruning Is All We Need to Start Sparse","date":"2022-10-05","arxiv_id":"2210.02412","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-improved-multi-state-constraint-kalman","title":"An Improved Multi-State Constraint Kalman Filter for Visual-Inertial Odometry","date":"2022-10-04","arxiv_id":"2210.08117","n_code_links":0,"syntology":null},{"paper":null,"slug":"eapruning-evolutionary-pruning-for-vision","title":"EAPruning: Evolutionary Pruning for Vision Transformers and CNNs","date":"2022-10-01","arxiv_id":"2210.00181","n_code_links":0,"syntology":null},{"paper":null,"slug":"pipeline-coreference-resolution-model-for","title":"Pipeline Coreference Resolution Model for Anaphoric Identity in Dialogues","date":"2022-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"token-and-head-adaptive-transformers-for","title":"Token and Head Adaptive Transformers for Efficient Natural Language Processing","date":"2022-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"energy-efficient-hardware-acceleration-of","title":"Energy Efficient Hardware Acceleration of Neural Networks with Power-of-Two Quantisation","date":"2022-09-30","arxiv_id":"2209.15257","n_code_links":0,"syntology":null},{"paper":"/paper/dataset-distillation-using-parameter-pruning","slug":"dataset-distillation-using-parameter-pruning","title":"Dataset Distillation Using Parameter Pruning","date":"2022-09-29","arxiv_id":"2209.14609","n_code_links":1,"syntology":null},{"paper":"/paper/is-complexity-required-for-neural-network","slug":"is-complexity-required-for-neural-network","title":"Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruning","date":"2022-09-29","arxiv_id":"2209.14624","n_code_links":1,"syntology":null},{"paper":"/paper/adaptive-sparse-vit-towards-learnable","slug":"adaptive-sparse-vit-towards-learnable","title":"Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention","date":"2022-09-28","arxiv_id":"2209.13802","n_code_links":1,"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":["cydia2018/as-vit"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":null,"slug":"devit-deformed-vision-transformers-in-video","title":"DeViT: Deformed Vision Transformers in Video Inpainting","date":"2022-09-28","arxiv_id":"2209.13925","n_code_links":0,"syntology":null},{"paper":"/paper/neural-network-panning-screening-the-optimal","slug":"neural-network-panning-screening-the-optimal","title":"Neural Network Panning: Screening the Optimal Sparse Network Before Training","date":"2022-09-27","arxiv_id":"2209.13378","n_code_links":1,"syntology":null},{"paper":"/paper/sauron-u-net-simple-automated-redundancy","slug":"sauron-u-net-simple-automated-redundancy","title":"Sauron U-Net: Simple automated redundancy elimination in medical image segmentation via filter pruning","date":"2022-09-27","arxiv_id":"2209.13590","n_code_links":1,"syntology":null},{"paper":null,"slug":"totally-ordered-sequential-rules-for-utility","title":"Totally-ordered Sequential Rules for Utility Maximization","date":"2022-09-27","arxiv_id":"2209.13501","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-multi-prize-lottery-tickets","title":"Efficient Multi-Prize Lottery Tickets: Enhanced Accuracy, Training, and Inference Speed","date":"2022-09-26","arxiv_id":"2209.12839","n_code_links":0,"syntology":null},{"paper":"/paper/cryptogcn-fast-and-scalable-homomorphically","slug":"cryptogcn-fast-and-scalable-homomorphically","title":"CryptoGCN: Fast and Scalable Homomorphically Encrypted Graph Convolutional Network Inference","date":"2022-09-24","arxiv_id":"2209.11904","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":4,"n_instrument":1,"unverified":2,"pointer_only":7,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ranran0523/cryptogcn"],"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":"tiered-pruning-for-efficient-differentialble","title":"Tiered Pruning for Efficient Differentialble Inference-Aware Neural Architecture Search","date":"2022-09-23","arxiv_id":"2209.11785","n_code_links":0,"syntology":null},{"paper":null,"slug":"epic-tts-models-empirical-pruning","title":"EPIC TTS Models: Empirical Pruning Investigations Characterizing Text-To-Speech Models","date":"2022-09-22","arxiv_id":"2209.10890","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-trio-method-for-retinal-vessel-segmentation","title":"A Trio-Method for Retinal Vessel Segmentation using Image Processing","date":"2022-09-19","arxiv_id":"2209.11230","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-neural-networks-via-coresets-and","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","date":"2022-09-18","arxiv_id":"2209.08554","n_code_links":0,"syntology":null},{"paper":"/paper/make-heterophily-graphs-better-fit-gnn-a","slug":"make-heterophily-graphs-better-fit-gnn-a","title":"Make Heterophily Graphs Better Fit GNN: A Graph Rewiring Approach","date":"2022-09-17","arxiv_id":"2209.08264","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-attentive-pooling-for-efficient-deep","title":"Self-Attentive Pooling for Efficient Deep Learning","date":"2022-09-16","arxiv_id":"2209.07659","n_code_links":0,"syntology":null},{"paper":"/paper/forgetting-to-remember-a-scalable-incremental","slug":"forgetting-to-remember-a-scalable-incremental","title":"Forgetting to Remember: A Scalable Incremental Learning Framework for Cross-Task Blind Image Quality Assessment","date":"2022-09-15","arxiv_id":"2209.07126","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph-to-text-generation-with-dynamic","title":"Graph-to-Text Generation with Dynamic Structure Pruning","date":"2022-09-15","arxiv_id":"2209.07258","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-networks-reduction-via-lumping","title":"Neural Networks Reduction via Lumping","date":"2022-09-15","arxiv_id":"2209.07475","n_code_links":0,"syntology":null},{"paper":null,"slug":"training-recipe-for-n-m-structured-sparsity","title":"Training Recipe for N:M Structured Sparsity with Decaying Pruning Mask","date":"2022-09-15","arxiv_id":"2209.07617","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-pruning-improving-neural-network","title":"Federated Pruning: Improving Neural Network Efficiency with Federated Learning","date":"2022-09-14","arxiv_id":"2209.06359","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-asr-pathways-a-sparse-multilingual","title":"Learning ASR pathways: A sparse multilingual ASR model","date":"2022-09-13","arxiv_id":"2209.05735","n_code_links":0,"syntology":null},{"paper":null,"slug":"one-shot-network-pruning-at-initialization","title":"One-shot Network Pruning at Initialization with Discriminative Image Patches","date":"2022-09-13","arxiv_id":"2209.05683","n_code_links":0,"syntology":null},{"paper":"/paper/towards-sparsification-of-graph-neural","slug":"towards-sparsification-of-graph-neural","title":"Towards Sparsification of Graph Neural Networks","date":"2022-09-11","arxiv_id":"2209.04766","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":4,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["harveyp123/iccd_sptrn_slr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/sparsity-guided-network-design-for-frame","slug":"sparsity-guided-network-design-for-frame","title":"Sparsity-guided Network Design for Frame Interpolation","date":"2022-09-09","arxiv_id":"2209.04551","n_code_links":1,"syntology":null},{"paper":null,"slug":"cap-instance-complexity-aware-network-pruning","title":"CWP: Instance complexity weighted channel-wise soft masks for network pruning","date":"2022-09-08","arxiv_id":"2209.03534","n_code_links":0,"syntology":null},{"paper":"/paper/ssl-wm-a-black-box-watermarking-approach-for","slug":"ssl-wm-a-black-box-watermarking-approach-for","title":"SSL-WM: A Black-Box Watermarking Approach for Encoders Pre-trained by Self-supervised Learning","date":"2022-09-08","arxiv_id":"2209.03563","n_code_links":1,"syntology":null},{"paper":"/paper/autopruner-transformer-based-call-graph","slug":"autopruner-transformer-based-call-graph","title":"AutoPruner: Transformer-Based Call Graph Pruning","date":"2022-09-07","arxiv_id":"2209.03230","n_code_links":1,"syntology":null},{"paper":"/paper/interpretations-steered-network-pruning-via","slug":"interpretations-steered-network-pruning-via","title":"Interpretations Steered Network Pruning via Amortized Inferred Saliency Maps","date":"2022-09-07","arxiv_id":"2209.02869","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-role-of-biology-in-deep-learning","title":"The Role Of Biology In Deep Learning","date":"2022-09-07","arxiv_id":"2209.04425","n_code_links":0,"syntology":null},{"paper":null,"slug":"risk-aware-belief-dependent-constrained-pomdp","title":"Risk Aware Adaptive Belief-dependent Probabilistically Constrained Continuous POMDP Planning","date":"2022-09-06","arxiv_id":"2209.02679","n_code_links":0,"syntology":null},{"paper":null,"slug":"what-to-prune-and-what-not-to-prune-at-1","title":"What to Prune and What Not to Prune at Initialization","date":"2022-09-06","arxiv_id":"2209.02201","n_code_links":0,"syntology":null},{"paper":null,"slug":"salenet-a-low-power-end-to-end-cnn","title":"SaleNet: A low-power end-to-end CNN accelerator for sustained attention level evaluation using EEG","date":"2022-09-03","arxiv_id":"2209.01386","n_code_links":0,"syntology":null},{"paper":"/paper/pointclm-a-contrastive-learning-based","slug":"pointclm-a-contrastive-learning-based","title":"PointCLM: A Contrastive Learning-based Framework for Multi-instance Point Cloud Registration","date":"2022-09-01","arxiv_id":"2209.00219","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 2 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":["phdymz/pointclm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"sparse-attention-acceleration-with","title":"Sparse Attention Acceleration with Synergistic In-Memory Pruning and On-Chip Recomputation","date":"2022-09-01","arxiv_id":"2209.00606","n_code_links":0,"syntology":null},{"paper":"/paper/large-scale-multi-granular-concept-extraction","slug":"large-scale-multi-granular-concept-extraction","title":"Large-scale Multi-granular Concept Extraction Based on Machine Reading Comprehension","date":"2022-08-30","arxiv_id":"2208.14139","n_code_links":1,"syntology":null},{"paper":null,"slug":"swiftpruner-reinforced-evolutionary-pruning","title":"SwiftPruner: Reinforced Evolutionary Pruning for Efficient Ad Relevance","date":"2022-08-30","arxiv_id":"2209.00625","n_code_links":0,"syntology":null},{"paper":null,"slug":"symmetric-pruning-in-quantum-neural-networks","title":"Symmetric Pruning in Quantum Neural Networks","date":"2022-08-30","arxiv_id":"2208.14057","n_code_links":0,"syntology":null},{"paper":null,"slug":"complexity-driven-cnn-compression-for","title":"Complexity-Driven CNN Compression for Resource-constrained Edge AI","date":"2022-08-26","arxiv_id":"2208.12816","n_code_links":0,"syntology":null},{"paper":null,"slug":"itemset-utility-maximization-with-correlation","title":"Itemset Utility Maximization with Correlation Measure","date":"2022-08-26","arxiv_id":"2208.12551","n_code_links":0,"syntology":null},{"paper":null,"slug":"reducing-computational-complexity-of-neural","title":"Reducing Computational Complexity of Neural Networks in Optical Channel Equalization: From Concepts to Implementation","date":"2022-08-26","arxiv_id":"2208.12866","n_code_links":0,"syntology":null},{"paper":null,"slug":"temporal-fuzzy-utility-maximization-with","title":"Temporal Fuzzy Utility Maximization with Remaining Measure","date":"2022-08-26","arxiv_id":"2208.12439","n_code_links":0,"syntology":null},{"paper":"/paper/optimal-brain-compression-a-framework-for","slug":"optimal-brain-compression-a-framework-for","title":"Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning","date":"2022-08-24","arxiv_id":"2208.11580","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-sparsified-federated-neuroimaging","title":"Towards Sparsified Federated Neuroimaging Models via Weight Pruning","date":"2022-08-24","arxiv_id":"2208.11669","n_code_links":0,"syntology":null},{"paper":"/paper/lottery-pools-winning-more-by-interpolating","slug":"lottery-pools-winning-more-by-interpolating","title":"Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost","date":"2022-08-23","arxiv_id":"2208.10842","n_code_links":1,"syntology":null},{"paper":null,"slug":"automated-pruning-of-polyculture-plants","title":"Automated Pruning of Polyculture Plants","date":"2022-08-22","arxiv_id":"2208.10472","n_code_links":0,"syntology":null}],"record_sha256":"6d0adb825c126dce4099a42a5a0cd2a4875092703ed1dd32ddf9f1d859ac00b3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}