{"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/20","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":20,"pages_in_order":39,"rows_per_page":100,"rows":[1901,2000],"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/19","next":"/method/pruning/papers/21","papers":[{"paper":null,"slug":"hce-improving-performance-and-efficiency-with","title":"HCE: Improving Performance and Efficiency with Heterogeneously Compressed Neural Network Ensemble","date":"2023-01-18","arxiv_id":"2301.07794","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedclip-federated-learning-with-client","title":"FedCliP: Federated Learning with Client Pruning","date":"2023-01-17","arxiv_id":"2301.06768","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-information-theoretic-branch-and-prune","title":"An information-theoretic branch-and-prune algorithm for discrete phase optimization of RIS in massive MIMO","date":"2023-01-16","arxiv_id":"2301.06228","n_code_links":0,"syntology":null},{"paper":null,"slug":"machine-learning-aided-efficient-decoding-of","title":"Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes","date":"2023-01-16","arxiv_id":"2301.06251","n_code_links":0,"syntology":null},{"paper":null,"slug":"gohsp-a-unified-framework-of-graph-and","title":"GOHSP: A Unified Framework of Graph and Optimization-based Heterogeneous Structured Pruning for Vision Transformer","date":"2023-01-13","arxiv_id":"2301.05345","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-reliability-of-spiking-neural","title":"Improving Reliability of Spiking Neural Networks through Fault Aware Threshold Voltage Optimization","date":"2023-01-12","arxiv_id":"2301.05266","n_code_links":0,"syntology":null},{"paper":"/paper/why-is-the-state-of-neural-network-pruning-so","slug":"why-is-the-state-of-neural-network-pruning-so","title":"Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruning","date":"2023-01-12","arxiv_id":"2301.05219","n_code_links":2,"syntology":null},{"paper":null,"slug":"pruning-compact-convnets-for-efficient-1","title":"Pruning Compact ConvNets for Efficient Inference","date":"2023-01-11","arxiv_id":"2301.04502","n_code_links":0,"syntology":null},{"paper":"/paper/cross-model-comparative-loss-for-enhancing","slug":"cross-model-comparative-loss-for-enhancing","title":"Cross-Model Comparative Loss for Enhancing Neuronal Utility in Language Understanding","date":"2023-01-10","arxiv_id":"2301.03765","n_code_links":1,"syntology":null},{"paper":null,"slug":"hypotheses-tree-building-for-one-shot","title":"Hypotheses Tree Building for One-Shot Temporal Sentence Localization","date":"2023-01-05","arxiv_id":"2301.01871","n_code_links":0,"syntology":null},{"paper":null,"slug":"accurate-low-latency-efficient-sar-automatic","title":"Accurate, Low-latency, Efficient SAR Automatic Target Recognition on FPGA","date":"2023-01-04","arxiv_id":"2301.01454","n_code_links":0,"syntology":null},{"paper":"/paper/massive-language-models-can-be-accurately","slug":"massive-language-models-can-be-accurately","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","date":"2023-01-02","arxiv_id":"2301.00774","n_code_links":6,"syntology":{"ran":9,"of":12,"n_ran_checked":7,"n_instrument":2,"unverified":3,"pointer_only":9,"phrase":"9 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; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["ist-daslab/sparsegpt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"accelir-task-aware-image-compression-for","title":"AccelIR: Task-Aware Image Compression for Accelerating Neural Restoration","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-and-background-aware-vision","slug":"adaptive-and-background-aware-vision","title":"Adaptive and Background-Aware Vision Transformer for Real-Time UAV Tracking","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/adversarial-normalization-i-can-visualize","slug":"adversarial-normalization-i-can-visualize","title":"Adversarial Normalization: I Can Visualize Everything (ICE)","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/automatic-network-pruning-via-hilbert-schmidt","slug":"automatic-network-pruning-via-hilbert-schmidt","title":"Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck Principle","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"cp3-channel-pruning-plug-in-for-point-based","title":"CP3: Channel Pruning Plug-In for Point-Based Networks","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-inference-with-grounding-based-vision","title":"Dynamic Inference With Grounding Based Vision and Language Models","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/integral-neural-networks","slug":"integral-neural-networks","title":"Integral Neural Networks","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"nerflight-fast-and-light-neural-radiance","title":"NeRFLight: Fast and Light Neural Radiance Fields Using a Shared Feature Grid","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/progressive-neighbor-consistency-mining-for","slug":"progressive-neighbor-consistency-mining-for","title":"Progressive Neighbor Consistency Mining for Correspondence Pruning","date":"2023-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-parameterization-with-bi-level","title":"Pruning Parameterization With Bi-Level Optimization for Efficient Semantic Segmentation on the Edge","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsemae-sparse-training-meets-masked","title":"SparseMAE: Sparse Training Meets Masked Autoencoders","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"structural-alignment-for-network-pruning","title":"Structural Alignment for Network Pruning through Partial Regularization","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"structure-aware-surface-reconstruction-via","title":"Structure-Aware Surface Reconstruction via Primitive Assembly","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"theoretical-characterization-of-how-neural","title":"Pruning Before Training May Improve Generalization, Provably","date":"2023-01-01","arxiv_id":"2301.00335","n_code_links":0,"syntology":null},{"paper":null,"slug":"tiny-updater-towards-efficient-neural-network","title":"Tiny Updater: Towards Efficient Neural Network-Driven Software Updating","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-fairness-aware-adversarial-network","title":"Towards Fairness-aware Adversarial Network Pruning","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"video-compression-with-entropy-constrained","title":"Video Compression With Entropy-Constrained Neural Representations","date":"2023-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/nirvana-neural-implicit-representations-of","slug":"nirvana-neural-implicit-representations-of","title":"NIRVANA: Neural Implicit Representations of Videos with Adaptive Networks and Autoregressive Patch-wise Modeling","date":"2022-12-30","arxiv_id":"2212.14593","n_code_links":1,"syntology":null},{"paper":"/paper/husp-sp-faster-utility-mining-on-sequence","slug":"husp-sp-faster-utility-mining-on-sequence","title":"HUSP-SP: Faster Utility Mining on Sequence Data","date":"2022-12-29","arxiv_id":"2212.14255","n_code_links":1,"syntology":null},{"paper":null,"slug":"comparative-study-of-parameter-selection-for","title":"Comparative Study of Parameter Selection for Enhanced Edge Inference for a Multi-Output Regression model for Head Pose Estimation","date":"2022-12-28","arxiv_id":"2302.00592","n_code_links":0,"syntology":null},{"paper":"/paper/feature-learning-in-neural-networks-and","slug":"feature-learning-in-neural-networks-and","title":"Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn features","date":"2022-12-28","arxiv_id":"2212.13881","n_code_links":2,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["aradha/deep_neural_feature_ansatz"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/deepcuts-single-shot-interpretability-based","slug":"deepcuts-single-shot-interpretability-based","title":"DeepCuts: Single-Shot Interpretability based Pruning for BERT","date":"2022-12-27","arxiv_id":"2212.13392","n_code_links":1,"syntology":null},{"paper":"/paper/magnitude-and-similarity-based-variable-rate","slug":"magnitude-and-similarity-based-variable-rate","title":"Magnitude and Similarity based Variable Rate Filter Pruning for Efficient Convolution Neural Networks","date":"2022-12-27","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/colt-cyclic-overlapping-lottery-tickets-for","slug":"colt-cyclic-overlapping-lottery-tickets-for","title":"COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks","date":"2022-12-24","arxiv_id":"2212.12770","n_code_links":1,"syntology":null},{"paper":null,"slug":"hyperspherical-quantization-toward-smaller","title":"Hyperspherical Quantization: Toward Smaller and More Accurate Models","date":"2022-12-24","arxiv_id":"2212.12653","n_code_links":0,"syntology":null},{"paper":"/paper/improving-uncertainty-quantification-of","slug":"improving-uncertainty-quantification-of","title":"Improving Uncertainty Quantification of Variance Networks by Tree-Structured Learning","date":"2022-12-24","arxiv_id":"2212.12658","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-on-the-fly-a-recoverable-pruning","title":"Pruning On-the-Fly: A Recoverable Pruning Method without Fine-tuning","date":"2022-12-24","arxiv_id":"2212.12651","n_code_links":0,"syntology":null},{"paper":null,"slug":"calibrating-deep-neural-networks-using","title":"Calibrating Deep Neural Networks using Explicit Regularisation and Dynamic Data Pruning","date":"2022-12-20","arxiv_id":"2212.10005","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-sequence-utility-maximization-under","title":"Towards Sequence Utility Maximization under Utility Occupancy Measure","date":"2022-12-20","arxiv_id":"2212.10452","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-optimal-substructure-for-out-of","title":"Exploring Optimal Substructure for Out-of-distribution Generalization via Feature-targeted Model Pruning","date":"2022-12-19","arxiv_id":"2212.09458","n_code_links":0,"syntology":null},{"paper":null,"slug":"memory-efficient-nllb-200-language-specific","title":"Memory-efficient NLLB-200: Language-specific Expert Pruning of a Massively Multilingual Machine Translation Model","date":"2022-12-19","arxiv_id":"2212.09811","n_code_links":0,"syntology":null},{"paper":null,"slug":"training-lightweight-graph-convolutional","title":"Training Lightweight Graph Convolutional Networks with Phase-field Models","date":"2022-12-19","arxiv_id":"2212.09415","n_code_links":0,"syntology":null},{"paper":null,"slug":"autoslicer-scalable-automated-data-slicing","title":"AutoSlicer: Scalable Automated Data Slicing for ML Model Analysis","date":"2022-12-18","arxiv_id":"2212.09032","n_code_links":0,"syntology":null},{"paper":null,"slug":"fscnn-a-fast-sparse-convolution-neural","title":"FSCNN: A Fast Sparse Convolution Neural Network Inference System","date":"2022-12-17","arxiv_id":"2212.08815","n_code_links":0,"syntology":null},{"paper":null,"slug":"can-we-find-strong-lottery-tickets-in","title":"Can We Find Strong Lottery Tickets in Generative Models?","date":"2022-12-16","arxiv_id":"2212.08311","n_code_links":0,"syntology":null},{"paper":"/paper/gradient-based-intra-attention-pruning-on-pre","slug":"gradient-based-intra-attention-pruning-on-pre","title":"Gradient-based Intra-attention Pruning on Pre-trained Language Models","date":"2022-12-15","arxiv_id":"2212.07634","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["airaria/grain"],"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":["official"]}}},{"paper":null,"slug":"towards-hardware-specific-automatic","title":"Towards Hardware-Specific Automatic Compression of Neural Networks","date":"2022-12-15","arxiv_id":"2212.07818","n_code_links":0,"syntology":null},{"paper":"/paper/random-feature-models-for-learning","slug":"random-feature-models-for-learning","title":"Random Feature Models for Learning Interacting Dynamical Systems","date":"2022-12-11","arxiv_id":"2212.05591","n_code_links":1,"syntology":null},{"paper":null,"slug":"all-in-one-a-highly-representative-dnn","title":"All-in-One: A Highly Representative DNN Pruning Framework for Edge Devices with Dynamic Power Management","date":"2022-12-09","arxiv_id":"2212.05122","n_code_links":0,"syntology":null},{"paper":null,"slug":"ap-selective-activation-for-de-sparsifying","title":"AP: Selective Activation for De-sparsifying Pruned Neural Networks","date":"2022-12-09","arxiv_id":"2212.06145","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-learning-rate-schedules-for","title":"Optimizing Learning Rate Schedules for Iterative Pruning of Deep Neural Networks","date":"2022-12-09","arxiv_id":"2212.06144","n_code_links":0,"syntology":null},{"paper":"/paper/fairify-fairness-verification-of-neural","slug":"fairify-fairness-verification-of-neural","title":"Fairify: Fairness Verification of Neural Networks","date":"2022-12-08","arxiv_id":"2212.06140","n_code_links":1,"syntology":{"ran":0,"of":5,"n_ran_checked":0,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"0 ran · 5 unverified","official":{"repos":["sumonbis/farify"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"paper":null,"slug":"complete-cavity-map-of-the-c-elegans","title":"Complete cavity map of the C. elegans connectome","date":"2022-12-07","arxiv_id":"2212.03660","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-stein-variational-inference-for","title":"Efficient Stein Variational Inference for Reliable Distribution-lossless Network Pruning","date":"2022-12-07","arxiv_id":"2212.03537","n_code_links":0,"syntology":null},{"paper":"/paper/slimmable-pruned-neural-networks","slug":"slimmable-pruned-neural-networks","title":"Slimmable Pruned Neural Networks","date":"2022-12-07","arxiv_id":"2212.03415","n_code_links":1,"syntology":null},{"paper":null,"slug":"attend-who-is-weak-pruning-assisted-medical","title":"Attend Who is Weak: Pruning-assisted Medical Image Localization under Sophisticated and Implicit Imbalances","date":"2022-12-06","arxiv_id":"2212.02675","n_code_links":0,"syntology":null},{"paper":null,"slug":"csq-growing-mixed-precision-quantization","title":"CSQ: Growing Mixed-Precision Quantization Scheme with Bi-level Continuous Sparsification","date":"2022-12-06","arxiv_id":"2212.02770","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedtiny-pruned-federated-learning-towards","title":"Distributed Pruning Towards Tiny Neural Networks in Federated Learning","date":"2022-12-05","arxiv_id":"2212.01977","n_code_links":0,"syntology":null},{"paper":null,"slug":"cstar-towards-compact-and-structured-deep","title":"CSTAR: Towards Compact and STructured Deep Neural Networks with Adversarial Robustness","date":"2022-12-04","arxiv_id":"2212.01957","n_code_links":0,"syntology":null},{"paper":null,"slug":"clip-train-faster-with-less-data","title":"CLIP: Train Faster with Less Data","date":"2022-12-02","arxiv_id":"2212.01452","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-effect-of-data-dimensionality-on-neural","title":"The Effect of Data Dimensionality on Neural Network Prunability","date":"2022-12-01","arxiv_id":"2212.00291","n_code_links":0,"syntology":null},{"paper":"/paper/compressing-volumetric-radiance-fields-to-1","slug":"compressing-volumetric-radiance-fields-to-1","title":"Compressing Volumetric Radiance Fields to 1 MB","date":"2022-11-29","arxiv_id":"2211.16386","n_code_links":1,"syntology":null},{"paper":"/paper/diggan-discriminator-gradient-gap","slug":"diggan-discriminator-gradient-gap","title":"DigGAN: Discriminator gradIent Gap Regularization for GAN Training with Limited Data","date":"2022-11-27","arxiv_id":"2211.14694","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":["ailsaf/diggan"],"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/dynamic-feature-pruning-and-consolidation-for","slug":"dynamic-feature-pruning-and-consolidation-for","title":"Dynamic Feature Pruning and Consolidation for Occluded Person Re-Identification","date":"2022-11-27","arxiv_id":"2211.14742","n_code_links":1,"syntology":null},{"paper":"/paper/exploring-temporal-information-dynamics-in","slug":"exploring-temporal-information-dynamics-in","title":"Exploring Temporal Information Dynamics in Spiking Neural Networks","date":"2022-11-26","arxiv_id":"2211.14406","n_code_links":1,"syntology":null},{"paper":"/paper/transform-once-efficient-operator-learning-in","slug":"transform-once-efficient-operator-learning-in","title":"Transform Once: Efficient Operator Learning in Frequency Domain","date":"2022-11-26","arxiv_id":"2211.14453","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":1,"n_instrument":2,"unverified":2,"pointer_only":5,"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) · 2 unverified","official":{"repos":["diffeqml/kairos"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/galvatron-efficient-transformer-training-over","slug":"galvatron-efficient-transformer-training-over","title":"Galvatron: Efficient Transformer Training over Multiple GPUs Using Automatic Parallelism","date":"2022-11-25","arxiv_id":"2211.13878","n_code_links":3,"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":["pku-dair/hetu"],"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":["listed","official"]}}},{"paper":"/paper/on-designing-light-weight-object-trackers","slug":"on-designing-light-weight-object-trackers","title":"On Designing Light-Weight Object Trackers through Network Pruning: Use CNNs or Transformers?","date":"2022-11-24","arxiv_id":"2211.13769","n_code_links":1,"syntology":null},{"paper":"/paper/reduction-algorithms-for-persistence-diagrams","slug":"reduction-algorithms-for-persistence-diagrams","title":"Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT","date":"2022-11-24","arxiv_id":"2211.13708","n_code_links":1,"syntology":null},{"paper":null,"slug":"developmental-plasticity-inspired-adaptive","title":"Developmental Plasticity-inspired Adaptive Pruning for Deep Spiking and Artificial Neural Networks","date":"2022-11-23","arxiv_id":"2211.12714","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruned-lightweight-encoders-for-computer","title":"Pruned Lightweight Encoders for Computer Vision","date":"2022-11-23","arxiv_id":"2211.13137","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-sparse-structure-development-with","title":"Adaptive Sparse Structure Development with Pruning and Regeneration for Spiking Neural Networks","date":"2022-11-22","arxiv_id":"2211.12219","n_code_links":0,"syntology":null},{"paper":null,"slug":"best-k-search-algorithm-for-neural-text","title":"Best-$k$ Search Algorithm for Neural Text Generation","date":"2022-11-22","arxiv_id":"2211.11924","n_code_links":0,"syntology":null},{"paper":"/paper/branch-and-bound-with-barrier-dominance-and","slug":"branch-and-bound-with-barrier-dominance-and","title":"Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection","date":"2022-11-22","arxiv_id":"2211.13118","n_code_links":2,"syntology":null},{"paper":"/paper/openfe-automated-feature-generation-beyond","slug":"openfe-automated-feature-generation-beyond","title":"OpenFE: Automated Feature Generation with Expert-level Performance","date":"2022-11-22","arxiv_id":"2211.12507","n_code_links":2,"syntology":{"ran":0,"of":4,"n_ran_checked":0,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"0 ran · 4 unverified","official":{"repos":["iiis-li-group/openfe","zhangtp1996/openfe"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"paper":"/paper/sparse-probabilistic-circuits-via-pruning-and","slug":"sparse-probabilistic-circuits-via-pruning-and","title":"Sparse Probabilistic Circuits via Pruning and Growing","date":"2022-11-22","arxiv_id":"2211.12551","n_code_links":1,"syntology":null},{"paper":"/paper/beyond-attentive-tokens-incorporating-token","slug":"beyond-attentive-tokens-incorporating-token","title":"Beyond Attentive Tokens: Incorporating Token Importance and Diversity for Efficient Vision Transformers","date":"2022-11-21","arxiv_id":"2211.11315","n_code_links":1,"syntology":null},{"paper":"/paper/deep-learning-on-a-healthy-data-diet-finding","slug":"deep-learning-on-a-healthy-data-diet-finding","title":"Deep Learning on a Healthy Data Diet: Finding Important Examples for Fairness","date":"2022-11-20","arxiv_id":"2211.11109","n_code_links":1,"syntology":null},{"paper":"/paper/a-fair-loss-function-for-network-pruning","slug":"a-fair-loss-function-for-network-pruning","title":"A Fair Loss Function for Network Pruning","date":"2022-11-18","arxiv_id":"2211.10285","n_code_links":1,"syntology":{"ran":8,"of":12,"n_ran_checked":6,"n_instrument":2,"unverified":4,"pointer_only":12,"phrase":"8 ran (of which 5 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":["robbiemeyer/pw_loss_pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/structured-pruning-adapters","slug":"structured-pruning-adapters","title":"Structured Pruning Adapters","date":"2022-11-17","arxiv_id":"2211.10155","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lukashedegaard/structured-pruning-adapters"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"encoding-feature-supervised-unet-redesigning","title":"Encoding feature supervised UNet++: Redesigning Supervision for liver and tumor segmentation","date":"2022-11-15","arxiv_id":"2211.08146","n_code_links":0,"syntology":null},{"paper":null,"slug":"heatvit-hardware-efficient-adaptive-token","title":"HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformers","date":"2022-11-15","arxiv_id":"2211.08110","n_code_links":0,"syntology":null},{"paper":"/paper/finding-skill-neurons-in-pre-trained","slug":"finding-skill-neurons-in-pre-trained","title":"Finding Skill Neurons in Pre-trained Transformer-based Language Models","date":"2022-11-14","arxiv_id":"2211.07349","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["thu-keg/skill-neuron"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"pruning-very-deep-neural-network-channels-for","title":"Pruning Very Deep Neural Network Channels for Efficient Inference","date":"2022-11-14","arxiv_id":"2211.08339","n_code_links":0,"syntology":null},{"paper":null,"slug":"sniper-training-variable-sparsity-rate","title":"SNIPER Training: Single-Shot Sparse Training for Text-to-Speech","date":"2022-11-14","arxiv_id":"2211.07283","n_code_links":0,"syntology":null},{"paper":"/paper/a-tale-of-two-graphs-freezing-and-denoising","slug":"a-tale-of-two-graphs-freezing-and-denoising","title":"A Tale of Two Graphs: Freezing and Denoising Graph Structures for Multimodal Recommendation","date":"2022-11-13","arxiv_id":"2211.06924","n_code_links":2,"syntology":null},{"paper":null,"slug":"mixbin-towards-budgeted-binarization","title":"Partial Binarization of Neural Networks for Budget-Aware Efficient Learning","date":"2022-11-12","arxiv_id":"2211.06739","n_code_links":0,"syntology":null},{"paper":null,"slug":"bert-on-a-data-diet-finding-important","title":"BERT on a Data Diet: Finding Important Examples by Gradient-Based Pruning","date":"2022-11-10","arxiv_id":"2211.05610","n_code_links":0,"syntology":null},{"paper":null,"slug":"classpruning-speed-up-image-restoration","title":"ClassPruning: Speed Up Image Restoration Networks by Dynamic N:M Pruning","date":"2022-11-10","arxiv_id":"2211.05488","n_code_links":0,"syntology":null},{"paper":"/paper/what-knowledge-is-needed-towards-explainable","slug":"what-knowledge-is-needed-towards-explainable","title":"What Knowledge Is Needed? Towards Explainable Memory for kNN-MT Domain Adaptation","date":"2022-11-08","arxiv_id":"2211.04052","n_code_links":1,"syntology":null},{"paper":"/paper/soft-masking-for-cost-constrained-channel","slug":"soft-masking-for-cost-constrained-channel","title":"Soft Masking for Cost-Constrained Channel Pruning","date":"2022-11-04","arxiv_id":"2211.02206","n_code_links":1,"syntology":null},{"paper":null,"slug":"self-similarity-matrix-based-cnn-filter","title":"Self Similarity Matrix based CNN Filter Pruning","date":"2022-11-03","arxiv_id":"2211.01814","n_code_links":0,"syntology":null},{"paper":"/paper/losses-can-be-blessings-routing-self","slug":"losses-can-be-blessings-routing-self","title":"Losses Can Be Blessings: Routing Self-Supervised Speech Representations Towards Efficient Multilingual and Multitask Speech Processing","date":"2022-11-02","arxiv_id":"2211.01522","n_code_links":1,"syntology":null},{"paper":null,"slug":"simd-size-aware-weight-regularization-for","title":"SIMD-size aware weight regularization for fast neural vocoding on CPU","date":"2022-11-02","arxiv_id":"2211.00898","n_code_links":0,"syntology":null},{"paper":"/paper/adapting-the-size-of-artificial-neural","slug":"adapting-the-size-of-artificial-neural","title":"Adapting the Size of Artificial Neural Networks Using Dynamic Auto-Sizing","date":"2022-11-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"higher-order-mutual-information-reveals","title":"Higher-order mutual information reveals synergistic sub-networks for multi-neuron importance","date":"2022-11-01","arxiv_id":"2211.00416","n_code_links":0,"syntology":null},{"paper":null,"slug":"recognition-of-defective-mineral-wool-using","title":"Recognition of Defective Mineral Wool Using Pruned ResNet Models","date":"2022-11-01","arxiv_id":"2211.00466","n_code_links":0,"syntology":null},{"paper":"/paper/savit-structure-aware-vision-transformer","slug":"savit-structure-aware-vision-transformer","title":"SAViT: Structure-Aware Vision Transformer Pruning via Collaborative Optimization","date":"2022-11-01","arxiv_id":null,"n_code_links":1,"syntology":null}],"record_sha256":"caf1fbb133c50b694e8a9f88c2f09df97d1f37ad4fb5821df8c4b47eed8f8fae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}