{"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/12","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":12,"pages_in_order":39,"rows_per_page":100,"rows":[1101,1200],"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/11","next":"/method/pruning/papers/13","papers":[{"paper":null,"slug":"attention-driven-training-free-efficiency","title":"Attention-Driven Training-Free Efficiency Enhancement of Diffusion Models","date":"2024-05-08","arxiv_id":"2405.05252","n_code_links":0,"syntology":null},{"paper":null,"slug":"gdgs-gradient-domain-gaussian-splatting-for","title":"GDGS: Gradient Domain Gaussian Splatting for Sparse Representation of Radiance Fields","date":"2024-05-08","arxiv_id":"2405.05446","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-foresight-pruning-meets-zeroth-order","title":"When Foresight Pruning Meets Zeroth-Order Optimization: Efficient Federated Learning for Low-Memory Devices","date":"2024-05-08","arxiv_id":"2405.04765","n_code_links":0,"syntology":null},{"paper":"/paper/unlearning-backdoor-attacks-through-gradient","slug":"unlearning-backdoor-attacks-through-gradient","title":"Unlearning Backdoor Attacks through Gradient-Based Model Pruning","date":"2024-05-07","arxiv_id":"2405.03918","n_code_links":1,"syntology":null},{"paper":null,"slug":"enabling-high-sparsity-foundational-llama","title":"Enabling High-Sparsity Foundational Llama Models with Efficient Pretraining and Deployment","date":"2024-05-06","arxiv_id":"2405.03594","n_code_links":0,"syntology":null},{"paper":null,"slug":"gi-smn-gradient-inversion-attack-against","title":"GI-SMN: Gradient Inversion Attack against Federated Learning without Prior Knowledge","date":"2024-05-06","arxiv_id":"2405.03516","n_code_links":0,"syntology":null},{"paper":"/paper/structure-preserving-network-compression-via","slug":"structure-preserving-network-compression-via","title":"Structure-Preserving Network Compression Via Low-Rank Induced Training Through Linear Layers Composition","date":"2024-05-06","arxiv_id":"2405.03089","n_code_links":1,"syntology":null},{"paper":null,"slug":"ted-accelerate-model-training-by-internal","title":"TED: Accelerate Model Training by Internal Generalization","date":"2024-05-06","arxiv_id":"2405.03228","n_code_links":0,"syntology":null},{"paper":"/paper/iterative-filter-pruning-for-concatenation","slug":"iterative-filter-pruning-for-concatenation","title":"Iterative Filter Pruning for Concatenation-based CNN Architectures","date":"2024-05-04","arxiv_id":"2405.03715","n_code_links":1,"syntology":null},{"paper":null,"slug":"dependency-aware-semi-structured-sparsity-of","title":"Dependency-Aware Semi-Structured Sparsity of GLU Variants in Large Language Models","date":"2024-05-03","arxiv_id":"2405.01943","n_code_links":0,"syntology":null},{"paper":null,"slug":"lightweight-change-detection-in-heterogeneous","title":"Lightweight Change Detection in Heterogeneous Remote Sensing Images with Online All-Integer Pruning Training","date":"2024-05-03","arxiv_id":"2405.01920","n_code_links":0,"syntology":null},{"paper":"/paper/structural-pruning-of-pre-trained-language","slug":"structural-pruning-of-pre-trained-language","title":"Structural Pruning of Pre-trained Language Models via Neural Architecture Search","date":"2024-05-03","arxiv_id":"2405.02267","n_code_links":1,"syntology":null},{"paper":null,"slug":"copal-continual-pruning-in-large-language","title":"COPAL: Continual Pruning in Large Language Generative Models","date":"2024-05-02","arxiv_id":"2405.02347","n_code_links":0,"syntology":null},{"paper":"/paper/faster-learned-sparse-retrieval-with-block","slug":"faster-learned-sparse-retrieval-with-block","title":"Faster Learned Sparse Retrieval with Block-Max Pruning","date":"2024-05-02","arxiv_id":"2405.01117","n_code_links":1,"syntology":null},{"paper":"/paper/torch2chip-an-end-to-end-customizable-deep","slug":"torch2chip-an-end-to-end-customizable-deep","title":"Torch2Chip: An End-to-end Customizable Deep Neural Network Compression and Deployment Toolkit for Prototype Hardware Accelerator Design","date":"2024-05-02","arxiv_id":"2405.01775","n_code_links":1,"syntology":null},{"paper":null,"slug":"lotus-improving-transformer-efficiency-with","title":"LOTUS: Improving Transformer Efficiency with Sparsity Pruning and Data Lottery Tickets","date":"2024-05-01","arxiv_id":"2405.00906","n_code_links":0,"syntology":null},{"paper":"/paper/spectrally-pruned-gaussian-fields-with-neural","slug":"spectrally-pruned-gaussian-fields-with-neural","title":"Spectrally Pruned Gaussian Fields with Neural Compensation","date":"2024-05-01","arxiv_id":"2405.00676","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":8,"phrase":"5 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; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["runyiyang/sundae"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"weight-sparsity-complements-activity-sparsity","title":"Weight Sparsity Complements Activity Sparsity in Neuromorphic Language Models","date":"2024-05-01","arxiv_id":"2405.00433","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-driven-permissible-safe-control-with","title":"Data-Driven Permissible Safe Control with Barrier Certificates","date":"2024-04-30","arxiv_id":"2405.00136","n_code_links":0,"syntology":null},{"paper":null,"slug":"hidden-synergy-l-1-weight-normalization-and-1","title":"Hidden Synergy: $L_1$ Weight Normalization and 1-Path-Norm Regularization","date":"2024-04-29","arxiv_id":"2404.19112","n_code_links":0,"syntology":null},{"paper":"/paper/player-enhancing-llm-based-multi-agent","slug":"player-enhancing-llm-based-multi-agent","title":"PLAYER*: Enhancing LLM-based Multi-Agent Communication and Interaction in Murder Mystery Games","date":"2024-04-26","arxiv_id":"2404.17662","n_code_links":1,"syntology":null},{"paper":"/paper/learning-syntax-without-planting-trees","slug":"learning-syntax-without-planting-trees","title":"Learning Syntax Without Planting Trees: Understanding When and Why Transformers Generalize Hierarchically","date":"2024-04-25","arxiv_id":"2404.16367","n_code_links":1,"syntology":{"ran":10,"of":16,"n_ran_checked":10,"n_instrument":0,"unverified":6,"pointer_only":16,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["kabirahuja2431/transformers-hg"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/sfmvit-slowfast-meet-vit-in-chaotic-world","slug":"sfmvit-slowfast-meet-vit-in-chaotic-world","title":"SFMViT: SlowFast Meet ViT in Chaotic World","date":"2024-04-25","arxiv_id":"2404.16609","n_code_links":1,"syntology":null},{"paper":null,"slug":"fairdedup-detecting-and-mitigating-vision","title":"FairDeDup: Detecting and Mitigating Vision-Language Fairness Disparities in Semantic Dataset Deduplication","date":"2024-04-24","arxiv_id":"2404.16123","n_code_links":0,"syntology":null},{"paper":null,"slug":"nepenthe-entropy-based-pruning-as-a-neural","title":"NEPENTHE: Entropy-Based Pruning as a Neural Network Depth's Reducer","date":"2024-04-24","arxiv_id":"2404.16890","n_code_links":0,"syntology":null},{"paper":null,"slug":"optc-a-toolchain-for-deployment-of-neural","title":"OpTC -- A Toolchain for Deployment of Neural Networks on AURIX TC3xx Microcontrollers","date":"2024-04-24","arxiv_id":"2404.15833","n_code_links":0,"syntology":null},{"paper":"/paper/retrieval-head-mechanistically-explains-long","slug":"retrieval-head-mechanistically-explains-long","title":"Retrieval Head Mechanistically Explains Long-Context Factuality","date":"2024-04-24","arxiv_id":"2404.15574","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":3,"n_instrument":4,"unverified":0,"pointer_only":7,"phrase":"7 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; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["nightdessert/retrieval_head"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"information-re-organization-improves","title":"Information Re-Organization Improves Reasoning in Large Language Models","date":"2024-04-22","arxiv_id":"2404.13985","n_code_links":0,"syntology":null},{"paper":null,"slug":"rapid-deployment-of-dnns-for-edge-computing","title":"Rapid Deployment of DNNs for Edge Computing via Structured Pruning at Initialization","date":"2024-04-22","arxiv_id":"2404.16877","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-explanations-of-neural-networks-using","title":"Sparse Explanations of Neural Networks Using Pruned Layer-Wise Relevance Propagation","date":"2024-04-22","arxiv_id":"2404.14271","n_code_links":0,"syntology":null},{"paper":null,"slug":"tree-of-reviews-a-tree-based-dynamic","title":"Tree of Reviews: A Tree-based Dynamic Iterative Retrieval Framework for Multi-hop Question Answering","date":"2024-04-22","arxiv_id":"2404.14464","n_code_links":0,"syntology":null},{"paper":"/paper/data-independent-module-aware-pruning-for","slug":"data-independent-module-aware-pruning-for","title":"Data-independent Module-aware Pruning for Hierarchical Vision Transformers","date":"2024-04-21","arxiv_id":"2404.13648","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficientgs-streamlining-gaussian-splatting","title":"EfficientGS: Streamlining Gaussian Splatting for Large-Scale High-Resolution Scene Representation","date":"2024-04-19","arxiv_id":"2404.12777","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-gaussians-mesh-consistent-mesh","title":"Dynamic Gaussians Mesh: Consistent Mesh Reconstruction from Monocular Videos","date":"2024-04-18","arxiv_id":"2404.12379","n_code_links":0,"syntology":null},{"paper":null,"slug":"edgefusion-on-device-text-to-image-generation","title":"EdgeFusion: On-Device Text-to-Image Generation","date":"2024-04-18","arxiv_id":"2404.11925","n_code_links":0,"syntology":null},{"paper":null,"slug":"ld-pruner-efficient-pruning-of-latent","title":"LD-Pruner: Efficient Pruning of Latent Diffusion Models using Task-Agnostic Insights","date":"2024-04-18","arxiv_id":"2404.11936","n_code_links":0,"syntology":null},{"paper":"/paper/partial-to-partial-shape-matching-with","slug":"partial-to-partial-shape-matching-with","title":"Partial-to-Partial Shape Matching with Geometric Consistency","date":"2024-04-18","arxiv_id":"2404.12209","n_code_links":2,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":1,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["vikiehm/gc-ppsm"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"paper":null,"slug":"skip-skill-localized-prompt-tuning-for","title":"Skeleton: A New Framework for Accelerating Language Models via Task Neuron Localized Prompt Tuning","date":"2024-04-18","arxiv_id":"2404.11916","n_code_links":0,"syntology":null},{"paper":"/paper/snp-structured-neuron-level-pruning-to","slug":"snp-structured-neuron-level-pruning-to","title":"SNP: Structured Neuron-level Pruning to Preserve Attention Scores","date":"2024-04-18","arxiv_id":"2404.11630","n_code_links":1,"syntology":null},{"paper":null,"slug":"vcc-infuse-towards-accurate-and-efficient","title":"VCC-INFUSE: Towards Accurate and Efficient Selection of Unlabeled Examples in Semi-supervised Learning","date":"2024-04-18","arxiv_id":"2404.11947","n_code_links":0,"syntology":null},{"paper":null,"slug":"energy-efficient-uncertainty-aware-biomass","title":"Energy-Efficient Uncertainty-Aware Biomass Composition Prediction at the Edge","date":"2024-04-17","arxiv_id":"2404.11230","n_code_links":0,"syntology":null},{"paper":null,"slug":"laptop-diff-layer-pruning-and-normalized","title":"LAPTOP-Diff: Layer Pruning and Normalized Distillation for Compressing Diffusion Models","date":"2024-04-17","arxiv_id":"2404.11098","n_code_links":0,"syntology":null},{"paper":null,"slug":"hardware-aware-training-of-models-with","title":"Hardware-aware training of models with synaptic delays for digital event-driven neuromorphic processors","date":"2024-04-16","arxiv_id":"2404.10597","n_code_links":0,"syntology":null},{"paper":null,"slug":"3d-gaussian-splatting-as-markov-chain-monte","title":"3D Gaussian Splatting as Markov Chain Monte Carlo","date":"2024-04-15","arxiv_id":"2404.09591","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedp3-federated-personalized-and-privacy","title":"FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneity","date":"2024-04-15","arxiv_id":"2404.09816","n_code_links":0,"syntology":null},{"paper":null,"slug":"lorap-transformer-sub-layers-deserve","title":"LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Models","date":"2024-04-15","arxiv_id":"2404.09695","n_code_links":0,"syntology":null},{"paper":null,"slug":"arena-a-patch-of-interest-vit-inference","title":"Arena: A Patch-of-Interest ViT Inference Acceleration System for Edge-Assisted Video Analytics","date":"2024-04-14","arxiv_id":"2404.09245","n_code_links":0,"syntology":null},{"paper":null,"slug":"approximate-cluster-based-sparse-document","title":"Approximate Cluster-Based Sparse Document Retrieval with Segmented Maximum Term Weights","date":"2024-04-13","arxiv_id":"2404.08896","n_code_links":0,"syntology":null},{"paper":null,"slug":"structured-model-pruning-for-efficient","title":"Structured Model Pruning for Efficient Inference in Computational Pathology","date":"2024-04-12","arxiv_id":"2404.08831","n_code_links":0,"syntology":null},{"paper":null,"slug":"onnxpruner-onnx-based-general-model-pruning","title":"ONNXPruner: ONNX-Based General Model Pruning Adapter","date":"2024-04-10","arxiv_id":"2404.08016","n_code_links":0,"syntology":null},{"paper":"/paper/end-to-end-rate-distortion-optimized-3d","slug":"end-to-end-rate-distortion-optimized-3d","title":"End-to-End Rate-Distortion Optimized 3D Gaussian Representation","date":"2024-04-09","arxiv_id":"2406.01597","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":8,"n_instrument":0,"unverified":3,"pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["ustc-imcl/rdo-gaussian"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/mlp-can-be-a-good-transformer-learner","slug":"mlp-can-be-a-good-transformer-learner","title":"MLP Can Be A Good Transformer Learner","date":"2024-04-08","arxiv_id":"2404.05657","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sihaoevery/lambda_vit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/multiflow-shifting-towards-task-agnostic","slug":"multiflow-shifting-towards-task-agnostic","title":"MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning","date":"2024-04-08","arxiv_id":"2404.05621","n_code_links":1,"syntology":{"ran":8,"of":27,"n_ran_checked":4,"n_instrument":4,"unverified":19,"pointer_only":27,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 19 unverified","official":{"repos":["farinamatteo/multiflow"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":19,"ran_from_kinds":["official"]}}},{"paper":"/paper/robust-data-pruning-uncovering-and-overcoming","slug":"robust-data-pruning-uncovering-and-overcoming","title":"DRoP: Distributionally Robust Pruning","date":"2024-04-08","arxiv_id":"2404.05579","n_code_links":1,"syntology":null},{"paper":null,"slug":"seer-moe-sparse-expert-efficiency-through","title":"SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Experts","date":"2024-04-07","arxiv_id":"2404.05089","n_code_links":0,"syntology":null},{"paper":"/paper/spectral-graph-pruning-against-over-squashing","slug":"spectral-graph-pruning-against-over-squashing","title":"Spectral Graph Pruning Against Over-Squashing and Over-Smoothing","date":"2024-04-06","arxiv_id":"2404.04612","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["relationalml/spectralpruningbraess"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"towards-generalized-entropic-sparsification","title":"Towards Generalized Entropic Sparsification for Convolutional Neural Networks","date":"2024-04-06","arxiv_id":"2404.04734","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-few-shot-ensemble-learning-with-focal","title":"Robust Few-Shot Ensemble Learning with Focal Diversity-Based Pruning","date":"2024-04-05","arxiv_id":"2404.04434","n_code_links":0,"syntology":null},{"paper":"/paper/ressa-repair-sparse-vision-language-models","slug":"ressa-repair-sparse-vision-language-models","title":"Rethinking Pruning for Vision-Language Models: Strategies for Effective Sparsity and Performance Restoration","date":"2024-04-03","arxiv_id":"2404.02424","n_code_links":2,"syntology":null},{"paper":null,"slug":"catp-cross-attention-token-pruning-for","title":"CATP: Cross-Attention Token Pruning for Accuracy Preserved Multimodal Model Inference","date":"2024-04-02","arxiv_id":"2404.08567","n_code_links":0,"syntology":null},{"paper":null,"slug":"cirp-cross-item-relational-pre-training-for","title":"CIRP: Cross-Item Relational Pre-training for Multimodal Product Bundling","date":"2024-04-02","arxiv_id":"2404.01735","n_code_links":0,"syntology":null},{"paper":null,"slug":"drive-dual-gradient-based-rapid-iterative","title":"DRIVE: Dual Gradient-Based Rapid Iterative Pruning","date":"2024-04-01","arxiv_id":"2404.03687","n_code_links":0,"syntology":null},{"paper":"/paper/prompt-prompted-mixture-of-experts-for","slug":"prompt-prompted-mixture-of-experts-for","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","date":"2024-04-01","arxiv_id":"2404.01365","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":7,"n_instrument":2,"unverified":1,"pointer_only":10,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["hdong920/griffin"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/some-orders-are-important-partially","slug":"some-orders-are-important-partially","title":"Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning","date":"2024-04-01","arxiv_id":"2404.01503","n_code_links":1,"syntology":null},{"paper":null,"slug":"rl-mul-multiplier-design-optimization-with","title":"RL-MUL 2.0: Multiplier Design Optimization with Parallel Deep Reinforcement Learning and Space Reduction","date":"2024-03-31","arxiv_id":"2404.00639","n_code_links":0,"syntology":null},{"paper":null,"slug":"separate-dynamic-and-differentiable-smart","title":"Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Tasks","date":"2024-03-29","arxiv_id":"2403.19969","n_code_links":0,"syntology":null},{"paper":"/paper/compressing-large-language-models-by","slug":"compressing-large-language-models-by","title":"Streamlining Redundant Layers to Compress Large Language Models","date":"2024-03-28","arxiv_id":"2403.19135","n_code_links":1,"syntology":null},{"paper":null,"slug":"jointly-training-and-pruning-cnns-via","title":"Jointly Training and Pruning CNNs via Learnable Agent Guidance and Alignment","date":"2024-03-28","arxiv_id":"2403.19490","n_code_links":0,"syntology":null},{"paper":"/paper/retrieval-enhanced-knowledge-editing-for","slug":"retrieval-enhanced-knowledge-editing-for","title":"Retrieval-enhanced Knowledge Editing in Language Models for Multi-Hop Question Answering","date":"2024-03-28","arxiv_id":"2403.19631","n_code_links":1,"syntology":{"ran":6,"of":8,"n_ran_checked":6,"n_instrument":0,"unverified":2,"pointer_only":8,"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) · 2 unverified","official":{"repos":["sycny/rae"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"dense-vision-transformer-compression-with-few","title":"Dense Vision Transformer Compression with Few Samples","date":"2024-03-27","arxiv_id":"2403.18708","n_code_links":0,"syntology":null},{"paper":"/paper/the-unreasonable-ineffectiveness-of-the","slug":"the-unreasonable-ineffectiveness-of-the","title":"The Unreasonable Ineffectiveness of the Deeper Layers","date":"2024-03-26","arxiv_id":"2403.17887","n_code_links":3,"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":"towards-explainable-clustering-a-constrained","title":"Towards Explainable Clustering: A Constrained Declarative based Approach","date":"2024-03-26","arxiv_id":"2403.18101","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-study-in-dataset-pruning-for-image-super","title":"A Study in Dataset Pruning for Image Super-Resolution","date":"2024-03-25","arxiv_id":"2403.17083","n_code_links":0,"syntology":null},{"paper":"/paper/papr-training-free-one-step-patch-pruning","slug":"papr-training-free-one-step-patch-pruning","title":"PaPr: Training-Free One-Step Patch Pruning with Lightweight ConvNets for Faster Inference","date":"2024-03-24","arxiv_id":"2403.16020","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tanvir-utexas/PaPr"],"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":"modeling-unified-semantic-discourse-structure","title":"Modeling Unified Semantic Discourse Structure for High-quality Headline Generation","date":"2024-03-23","arxiv_id":"2403.15776","n_code_links":0,"syntology":null},{"paper":"/paper/once-for-both-single-stage-of-importance-and","slug":"once-for-both-single-stage-of-importance-and","title":"Once for Both: Single Stage of Importance and Sparsity Search for Vision Transformer Compression","date":"2024-03-23","arxiv_id":"2403.15835","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 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["hankye/once-for-both"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"insights-into-the-lottery-ticket-hypothesis","title":"Insights into the Lottery Ticket Hypothesis and Iterative Magnitude Pruning","date":"2024-03-22","arxiv_id":"2403.15022","n_code_links":0,"syntology":null},{"paper":"/paper/lsk3dnet-towards-effective-and-efficient-3d","slug":"lsk3dnet-towards-effective-and-efficient-3d","title":"LSK3DNet: Towards Effective and Efficient 3D Perception with Large Sparse Kernels","date":"2024-03-22","arxiv_id":"2403.15173","n_code_links":1,"syntology":null},{"paper":null,"slug":"accelerating-vit-inference-on-fpga-through","title":"Accelerating ViT Inference on FPGA through Static and Dynamic Pruning","date":"2024-03-21","arxiv_id":"2403.14047","n_code_links":0,"syntology":null},{"paper":null,"slug":"advancing-iiot-with-over-the-air-federated","title":"Advancing IIoT with Over-the-Air Federated Learning: The Role of Iterative Magnitude Pruning","date":"2024-03-21","arxiv_id":"2403.14120","n_code_links":0,"syntology":null},{"paper":"/paper/auto-train-once-controller-network-guided","slug":"auto-train-once-controller-network-guided","title":"Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratch","date":"2024-03-21","arxiv_id":"2403.14729","n_code_links":1,"syntology":{"ran":12,"of":14,"n_ran_checked":7,"n_instrument":5,"unverified":2,"pointer_only":14,"phrase":"12 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","official":{"repos":["xidongwu/autotrainonce"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":1,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"fedmef-towards-memory-efficient-federated","title":"FedMef: Towards Memory-efficient Federated Dynamic Pruning","date":"2024-03-21","arxiv_id":"2403.14737","n_code_links":0,"syntology":null},{"paper":"/paper/language-repository-for-long-video","slug":"language-repository-for-long-video","title":"Language Repository for Long Video Understanding","date":"2024-03-21","arxiv_id":"2403.14622","n_code_links":1,"syntology":{"ran":9,"of":9,"n_ran_checked":8,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["kkahatapitiya/langrepo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"an-analysis-on-matching-mechanisms-and-token","title":"An Analysis on Matching Mechanisms and Token Pruning for Late-interaction Models","date":"2024-03-20","arxiv_id":"2403.13291","n_code_links":0,"syntology":null},{"paper":"/paper/diversity-aware-channel-pruning-for-stylegan","slug":"diversity-aware-channel-pruning-for-stylegan","title":"Diversity-aware Channel Pruning for StyleGAN Compression","date":"2024-03-20","arxiv_id":"2403.13548","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jiwoogit/dcp-gan"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"orthcaps-an-orthogonal-capsnet-with-sparse","title":"OrthCaps: An Orthogonal CapsNet with Sparse Attention Routing and Pruning","date":"2024-03-20","arxiv_id":"2403.13351","n_code_links":0,"syntology":null},{"paper":null,"slug":"radsplat-radiance-field-informed-gaussian","title":"RadSplat: Radiance Field-Informed Gaussian Splatting for Robust Real-Time Rendering with 900+ FPS","date":"2024-03-20","arxiv_id":"2403.13806","n_code_links":0,"syntology":null},{"paper":null,"slug":"gvgen-text-to-3d-generation-with-volumetric","title":"GVGEN: Text-to-3D Generation with Volumetric Representation","date":"2024-03-19","arxiv_id":"2403.12957","n_code_links":0,"syntology":null},{"paper":null,"slug":"hcpm-hierarchical-candidates-pruning-for","title":"HCPM: Hierarchical Candidates Pruning for Efficient Detector-Free Matching","date":"2024-03-19","arxiv_id":"2403.12543","n_code_links":0,"syntology":null},{"paper":null,"slug":"lnpt-label-free-network-pruning-and-training","title":"LNPT: Label-free Network Pruning and Training","date":"2024-03-19","arxiv_id":"2403.12690","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-for-improved-adc-efficiency-in","title":"Pruning for Improved ADC Efficiency in Crossbar-based Analog In-memory Accelerators","date":"2024-03-19","arxiv_id":"2403.13082","n_code_links":0,"syntology":null},{"paper":"/paper/seven-pruning-transformer-model-by-reserving","slug":"seven-pruning-transformer-model-by-reserving","title":"SEVEN: Pruning Transformer Model by Reserving Sentinels","date":"2024-03-19","arxiv_id":"2403.12688","n_code_links":1,"syntology":null},{"paper":"/paper/accelerating-matrix-factorization-by-dynamic","slug":"accelerating-matrix-factorization-by-dynamic","title":"Accelerating Matrix Factorization by Dynamic Pruning for Fast Recommendation","date":"2024-03-18","arxiv_id":"2404.04265","n_code_links":1,"syntology":null},{"paper":null,"slug":"decoding-compressed-trust-scrutinizing-the","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","date":"2024-03-18","arxiv_id":"2403.15447","n_code_links":0,"syntology":null},{"paper":null,"slug":"effiperception-an-efficient-framework-for","title":"EffiPerception: an Efficient Framework for Various Perception Tasks","date":"2024-03-18","arxiv_id":"2403.12317","n_code_links":0,"syntology":null},{"paper":null,"slug":"let-s-focus-on-neuron-neuron-level-supervised","title":"Let's Focus on Neuron: Neuron-Level Supervised Fine-tuning for Large Language Model","date":"2024-03-18","arxiv_id":"2403.11621","n_code_links":0,"syntology":null},{"paper":null,"slug":"neds-slam-a-novel-neural-explicit-dense","title":"NEDS-SLAM: A Neural Explicit Dense Semantic SLAM Framework using 3D Gaussian Splatting","date":"2024-03-18","arxiv_id":"2403.11679","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-expansion-in-pruned-recurrent-neural","title":"Graph Expansion in Pruned Recurrent Neural Network Layers Preserve Performance","date":"2024-03-17","arxiv_id":"2403.11100","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-pruning-of-large-language-model","title":"Toward Adaptive Large Language Models Structured Pruning via Hybrid-grained Weight Importance Assessment","date":"2024-03-16","arxiv_id":"2403.10799","n_code_links":0,"syntology":null},{"paper":"/paper/federated-learning-based-on-pruning-and","slug":"federated-learning-based-on-pruning-and","title":"Federated Learning based on Pruning and Recovery","date":"2024-03-16","arxiv_id":"2403.15439","n_code_links":1,"syntology":null}],"record_sha256":"453074675707ed892e127ba7e99e4d083fb3f183742be96b2b5daf5a86e7dacc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}