{"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","slug":"pruning","name":"Pruning","full_name":"Pruning","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Pruning Filters for Efficient ConvNets","paper":"/paper/pruning-filters-for-efficient-convnets","first_author":"Hao Li","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/pruning-filters-for-efficient-convnets"},"source":{"url":"http://arxiv.org/abs/1608.08710v3","title":"Pruning Filters for Efficient ConvNets","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Model Compression","url":"/methods/category/model-compression","pwc_aliases":[]}],"n_papers_tagged":3874,"archive_num_papers":3874,"papers_newest_first":[{"paper":null,"slug":"a-mixed-primitive-based-gaussian-splatting","title":"A Mixed-Primitive-based Gaussian Splatting Method for Surface Reconstruction","date":"2025-07-15","arxiv_id":"2507.11321","n_code_links":0,"syntology":null},{"paper":"/paper/enhancing-safe-and-controllable-protein","slug":"enhancing-safe-and-controllable-protein","title":"Enhancing Safe and Controllable Protein Generation via Knowledge Preference Optimization","date":"2025-07-15","arxiv_id":"2507.10923","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: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hicai-zju/kpo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/hashed-watermark-as-a-filter-defeating","slug":"hashed-watermark-as-a-filter-defeating","title":"Hashed Watermark as a Filter: Defeating Forging and Overwriting Attacks in Weight-based Neural Network Watermarking","date":"2025-07-15","arxiv_id":"2507.11137","n_code_links":1,"syntology":null},{"paper":null,"slug":"lightweight-federated-learning-over-wireless","title":"Lightweight Federated Learning over Wireless Edge Networks","date":"2025-07-13","arxiv_id":"2507.09546","n_code_links":0,"syntology":null},{"paper":"/paper/boosting-parameter-efficiency-in-llm-based","slug":"boosting-parameter-efficiency-in-llm-based","title":"Boosting Parameter Efficiency in LLM-Based Recommendation through Sophisticated Pruning","date":"2025-07-09","arxiv_id":"2507.07064","n_code_links":1,"syntology":null},{"paper":"/paper/design-encrypted-gnn-inference-via-server","slug":"design-encrypted-gnn-inference-via-server","title":"DESIGN: Encrypted GNN Inference via Server-Side Input Graph Pruning","date":"2025-07-08","arxiv_id":"2507.05649","n_code_links":0,"syntology":{"ran":4,"of":6,"n_ran_checked":3,"n_instrument":1,"unverified":2,"pointer_only":6,"phrase":"4 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; 1 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":null,"slug":"lighthousegs-indoor-structure-aware-3d","title":"LighthouseGS: Indoor Structure-aware 3D Gaussian Splatting for Panorama-Style Mobile Captures","date":"2025-07-08","arxiv_id":"2507.06109","n_code_links":0,"syntology":null},{"paper":null,"slug":"orthorank-token-selection-via-sink-token","title":"OrthoRank: Token Selection via Sink Token Orthogonality for Efficient LLM inference","date":"2025-07-05","arxiv_id":"2507.03865","n_code_links":0,"syntology":null},{"paper":"/paper/when-does-pruning-benefit-vision","slug":"when-does-pruning-benefit-vision","title":"When Does Pruning Benefit Vision Representations?","date":"2025-07-02","arxiv_id":"2507.01722","n_code_links":1,"syntology":null},{"paper":null,"slug":"sub-moe-efficient-mixture-of-expert-llms","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","date":"2025-06-29","arxiv_id":"2506.23266","n_code_links":0,"syntology":null},{"paper":"/paper/curve-aware-gaussian-splatting-for-3d","slug":"curve-aware-gaussian-splatting-for-3d","title":"Curve-Aware Gaussian Splatting for 3D Parametric Curve Reconstruction","date":"2025-06-26","arxiv_id":"2506.21401","n_code_links":1,"syntology":null},{"paper":null,"slug":"little-by-little-continual-learning-via-self","title":"Little By Little: Continual Learning via Self-Activated Sparse Mixture-of-Rank Adaptive Learning","date":"2025-06-26","arxiv_id":"2506.21035","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-an-optimal-control-perspective-of","title":"Towards an Optimal Control Perspective of ResNet Training","date":"2025-06-26","arxiv_id":"2506.21453","n_code_links":0,"syntology":null},{"paper":null,"slug":"duogpt-training-free-dual-sparsity-through","title":"DuoGPT: Training-free Dual Sparsity through Activation-aware Pruning in LLMs","date":"2025-06-25","arxiv_id":"2506.20194","n_code_links":0,"syntology":null},{"paper":"/paper/gptailor-large-language-model-pruning-through","slug":"gptailor-large-language-model-pruning-through","title":"GPTailor: Large Language Model Pruning Through Layer Cutting and Stitching","date":"2025-06-25","arxiv_id":"2506.20480","n_code_links":1,"syntology":null},{"paper":null,"slug":"joint-quantization-and-pruning-neural","title":"Joint Quantization and Pruning Neural Networks Approach: A Case Study on FSO Receivers","date":"2025-06-25","arxiv_id":"2506.20084","n_code_links":0,"syntology":null},{"paper":"/paper/loss-aware-automatic-selection-of-structured-1","slug":"loss-aware-automatic-selection-of-structured-1","title":"Loss-Aware Automatic Selection of Structured Pruning Criteria for Deep Neural Network Acceleration","date":"2025-06-25","arxiv_id":"2506.20152","n_code_links":2,"syntology":null},{"paper":null,"slug":"orthogonal-soft-pruning-for-efficient-class","title":"Orthogonal Soft Pruning for Efficient Class Unlearning","date":"2025-06-24","arxiv_id":"2506.19891","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-large-language-model-based-multi-agent-1","title":"A Large Language Model-based Multi-Agent Framework for Analog Circuits' Sizing Relationships Extraction","date":"2025-06-23","arxiv_id":"2506.18424","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-and-generalizable-speaker","slug":"efficient-and-generalizable-speaker","title":"Efficient and Generalizable Speaker Diarization via Structured Pruning of Self-Supervised Models","date":"2025-06-23","arxiv_id":"2506.18623","n_code_links":1,"syntology":null},{"paper":"/paper/evolving-prompts-in-context-an-open-ended","slug":"evolving-prompts-in-context-an-open-ended","title":"Evolving Prompts In-Context: An Open-ended, Self-replicating Perspective","date":"2025-06-22","arxiv_id":"2506.17930","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jianyu-cs/promptquine"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/safe-pruning-lora-robust-distance-guided","slug":"safe-pruning-lora-robust-distance-guided","title":"Safe Pruning LoRA: Robust Distance-Guided Pruning for Safety Alignment in Adaptation of LLMs","date":"2025-06-21","arxiv_id":"2506.18931","n_code_links":1,"syntology":{"ran":6,"of":8,"n_ran_checked":3,"n_instrument":3,"unverified":2,"pointer_only":8,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["aoshuang92/splora"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/pbft-backed-semantic-voting-for-multi-agent","slug":"pbft-backed-semantic-voting-for-multi-agent","title":"PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning","date":"2025-06-19","arxiv_id":"2506.17338","n_code_links":1,"syntology":null},{"paper":null,"slug":"intrinsic-and-extrinsic-organized-attention","title":"Intrinsic and Extrinsic Organized Attention: Softmax Invariance and Network Sparsity","date":"2025-06-18","arxiv_id":"2506.15541","n_code_links":0,"syntology":null},{"paper":null,"slug":"hrgs-hierarchical-gaussian-splatting-for","title":"HRGS: Hierarchical Gaussian Splatting for Memory-Efficient High-Resolution 3D Reconstruction","date":"2025-06-17","arxiv_id":"2506.14229","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-lora-with-variational-learning","title":"Improving LoRA with Variational Learning","date":"2025-06-17","arxiv_id":"2506.14280","n_code_links":0,"syntology":null},{"paper":null,"slug":"lingoloop-attack-trapping-mllms-via","title":"LingoLoop Attack: Trapping MLLMs via Linguistic Context and State Entrapment into Endless Loops","date":"2025-06-17","arxiv_id":"2506.14493","n_code_links":0,"syntology":null},{"paper":null,"slug":"think-clearly-improving-reasoning-via","title":"Think Clearly: Improving Reasoning via Redundant Token Pruning","date":"2025-06-17","arxiv_id":"2507.08806","n_code_links":0,"syntology":null},{"paper":"/paper/attribution-guided-pruning-for-compression","slug":"attribution-guided-pruning-for-compression","title":"Attribution-guided Pruning for Compression, Circuit Discovery, and Targeted Correction in LLMs","date":"2025-06-16","arxiv_id":"2506.13727","n_code_links":1,"syntology":null},{"paper":null,"slug":"greedyprune-retenting-critical-visual-token","title":"GreedyPrune: Retenting Critical Visual Token Set for Large Vision Language Models","date":"2025-06-16","arxiv_id":"2506.13166","n_code_links":0,"syntology":null},{"paper":"/paper/training-free-llm-merging-for-multi-task","slug":"training-free-llm-merging-for-multi-task","title":"Training-free LLM Merging for Multi-task Learning","date":"2025-06-14","arxiv_id":"2506.12379","n_code_links":1,"syntology":null},{"paper":"/paper/beyond-attention-or-similarity-maximizing","slug":"beyond-attention-or-similarity-maximizing","title":"Beyond Attention or Similarity: Maximizing Conditional Diversity for Token Pruning in MLLMs","date":"2025-06-12","arxiv_id":"2506.10967","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":1,"n_instrument":7,"unverified":0,"pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","official":{"repos":["theia-4869/cdpruner"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"auto-compressing-networks","title":"Auto-Compressing Networks","date":"2025-06-11","arxiv_id":"2506.09714","n_code_links":0,"syntology":null},{"paper":null,"slug":"awp-activation-aware-weight-pruning-and","title":"AWP: Activation-Aware Weight Pruning and Quantization with Projected Gradient Descent","date":"2025-06-11","arxiv_id":"2506.10205","n_code_links":0,"syntology":null},{"paper":null,"slug":"causal-sufficiency-and-necessity-improves","title":"Causal Sufficiency and Necessity Improves Chain-of-Thought Reasoning","date":"2025-06-11","arxiv_id":"2506.09853","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficientvla-training-free-acceleration-and","title":"EfficientVLA: Training-Free Acceleration and Compression for Vision-Language-Action Models","date":"2025-06-11","arxiv_id":"2506.10100","n_code_links":0,"syntology":null},{"paper":null,"slug":"gaussian-herding-across-pens-an-optimal","title":"Gaussian Herding across Pens: An Optimal Transport Perspective on Global Gaussian Reduction for 3DGS","date":"2025-06-11","arxiv_id":"2506.09534","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparsessm-efficient-selective-structured","title":"SparseSSM: Efficient Selective Structured State Space Models Can Be Pruned in One-Shot","date":"2025-06-11","arxiv_id":"2506.09613","n_code_links":0,"syntology":null},{"paper":null,"slug":"2506-08602","title":"WGLE:Backdoor-free and Multi-bit Black-box Watermarking for Graph Neural Networks","date":"2025-06-10","arxiv_id":"2506.08602","n_code_links":0,"syntology":null},{"paper":null,"slug":"2506-10035","title":"FastFLUX: Pruning FLUX with Block-wise Replacement and Sandwich Training","date":"2025-06-10","arxiv_id":"2506.10035","n_code_links":0,"syntology":null},{"paper":"/paper/diversity-guided-mlp-reduction-for-efficient","slug":"diversity-guided-mlp-reduction-for-efficient","title":"Diversity-Guided MLP Reduction for Efficient Large Vision Transformers","date":"2025-06-10","arxiv_id":"2506.08591","n_code_links":1,"syntology":null},{"paper":"/paper/effective-data-pruning-through-score","slug":"effective-data-pruning-through-score","title":"Effective Data Pruning through Score Extrapolation","date":"2025-06-10","arxiv_id":"2506.09010","n_code_links":1,"syntology":null},{"paper":null,"slug":"merging-smarter-generalizing-better-enhancing","title":"Merging Smarter, Generalizing Better: Enhancing Model Merging on OOD Data","date":"2025-06-10","arxiv_id":"2506.09093","n_code_links":0,"syntology":null},{"paper":"/paper/olica-efficient-structured-pruning-of-large","slug":"olica-efficient-structured-pruning-of-large","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","date":"2025-06-10","arxiv_id":"2506.08436","n_code_links":1,"syntology":{"ran":4,"of":10,"n_ran_checked":3,"n_instrument":1,"unverified":6,"pointer_only":10,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","official":{"repos":["bettertmrr/llm-olica"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/sdmprune-self-distillation-mlp-pruning-for","slug":"sdmprune-self-distillation-mlp-pruning-for","title":"SDMPrune: Self-Distillation MLP Pruning for Efficient Large Language Models","date":"2025-06-10","arxiv_id":"2506.11120","n_code_links":1,"syntology":null},{"paper":null,"slug":"hyperpruning-efficient-search-through-pruned","title":"Hyperpruning: Efficient Search through Pruned Variants of Recurrent Neural Networks Leveraging Lyapunov Spectrum","date":"2025-06-09","arxiv_id":"2506.07975","n_code_links":0,"syntology":null},{"paper":"/paper/speedy-deformable-3d-gaussian-splatting-fast","slug":"speedy-deformable-3d-gaussian-splatting-fast","title":"Speedy Deformable 3D Gaussian Splatting: Fast Rendering and Compression of Dynamic Scenes","date":"2025-06-09","arxiv_id":"2506.07917","n_code_links":1,"syntology":null},{"paper":null,"slug":"dm-3-net-dual-camera-super-resolution-via","title":"DM$^3$Net: Dual-Camera Super-Resolution via Domain Modulation and Multi-scale Matching","date":"2025-06-08","arxiv_id":"2506.06993","n_code_links":0,"syntology":null},{"paper":null,"slug":"dual-priv-pruning-efficient-differential","title":"Dual-Priv Pruning : Efficient Differential Private Fine-Tuning in Multimodal Large Language Models","date":"2025-06-08","arxiv_id":"2506.07077","n_code_links":0,"syntology":null},{"paper":"/paper/safe-finding-sparse-and-flat-minima-to","slug":"safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","arxiv_id":"2506.06866","n_code_links":2,"syntology":{"ran":10,"of":18,"n_ran_checked":4,"n_instrument":6,"unverified":8,"pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 8 unverified","official":{"repos":["LOG-postech/safe-torch","log-postech/safe-jax"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/eigenspectrum-analysis-of-neural-networks","slug":"eigenspectrum-analysis-of-neural-networks","title":"Eigenspectrum Analysis of Neural Networks without Aspect Ratio Bias","date":"2025-06-06","arxiv_id":"2506.06280","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"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":"/paper/pruning-spurious-subgraphs-for-graph-out-of","slug":"pruning-spurious-subgraphs-for-graph-out-of","title":"Pruning Spurious Subgraphs for Graph Out-of-Distribtuion Generalization","date":"2025-06-06","arxiv_id":"2506.05957","n_code_links":1,"syntology":null},{"paper":null,"slug":"retention-resource-efficient-tree-based","title":"RETENTION: Resource-Efficient Tree-Based Ensemble Model Acceleration with Content-Addressable Memory","date":"2025-06-06","arxiv_id":"2506.05994","n_code_links":0,"syntology":null},{"paper":null,"slug":"token-transforming-a-unified-and-training","title":"Token Transforming: A Unified and Training-Free Token Compression Framework for Vision Transformer Acceleration","date":"2025-06-06","arxiv_id":"2506.05709","n_code_links":0,"syntology":null},{"paper":null,"slug":"robustness-as-architecture-designing-iqa","title":"Robustness as Architecture: Designing IQA Models to Withstand Adversarial Perturbations","date":"2025-06-05","arxiv_id":"2506.04951","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-storage-efficient-visual-document","title":"Towards Storage-Efficient Visual Document Retrieval: An Empirical Study on Reducing Patch-Level Embeddings","date":"2025-06-05","arxiv_id":"2506.04997","n_code_links":0,"syntology":null},{"paper":"/paper/epic-towards-lossless-speedup-for-reasoning","slug":"epic-towards-lossless-speedup-for-reasoning","title":"EPiC: Towards Lossless Speedup for Reasoning Training through Edge-Preserving CoT Condensation","date":"2025-06-04","arxiv_id":"2506.04205","n_code_links":1,"syntology":null},{"paper":null,"slug":"plugging-schema-graph-into-multi-table-qa-a","title":"Plugging Schema Graph into Multi-Table QA: A Human-Guided Framework for Reducing LLM Reliance","date":"2025-06-04","arxiv_id":"2506.04427","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-everything-everywhere-all-at-once","slug":"pruning-everything-everywhere-all-at-once","title":"Pruning Everything, Everywhere, All at Once","date":"2025-06-04","arxiv_id":"2506.04513","n_code_links":2,"syntology":null},{"paper":"/paper/adaptive-graph-pruning-for-multi-agent","slug":"adaptive-graph-pruning-for-multi-agent","title":"Adaptive Graph Pruning for Multi-Agent Communication","date":"2025-06-03","arxiv_id":"2506.02951","n_code_links":1,"syntology":null},{"paper":"/paper/metok-multi-stage-event-based-token","slug":"metok-multi-stage-event-based-token","title":"METok: Multi-Stage Event-based Token Compression for Efficient Long Video Understanding","date":"2025-06-03","arxiv_id":"2506.02850","n_code_links":1,"syntology":null},{"paper":null,"slug":"rethinking-dynamic-networks-and-heterogeneous","title":"Rethinking Dynamic Networks and Heterogeneous Computing with Automatic Parallelization","date":"2025-06-03","arxiv_id":"2506.02787","n_code_links":0,"syntology":null},{"paper":null,"slug":"exchangeability-in-neural-network","title":"Exchangeability in Neural Network Architectures and its Application to Dynamic Pruning","date":"2025-06-02","arxiv_id":"2506.02210","n_code_links":0,"syntology":null},{"paper":null,"slug":"flexisaga-a-flexible-systolic-array-gemm","title":"FlexiSAGA: A Flexible Systolic Array GEMM Accelerator for Sparse and Dense Processing","date":"2025-06-02","arxiv_id":"2506.01566","n_code_links":0,"syntology":null},{"paper":null,"slug":"out-of-vocabulary-sampling-boosts-speculative","title":"Out-of-Vocabulary Sampling Boosts Speculative Decoding","date":"2025-06-02","arxiv_id":"2506.03206","n_code_links":0,"syntology":null},{"paper":"/paper/structured-pruning-and-quantization-for","slug":"structured-pruning-and-quantization-for","title":"Structured Pruning and Quantization for Learned Image Compression","date":"2025-06-02","arxiv_id":"2506.01229","n_code_links":1,"syntology":null},{"paper":null,"slug":"countingfruit-real-time-3d-fruit-counting","title":"CountingFruit: Real-Time 3D Fruit Counting with Language-Guided Semantic Gaussian Splatting","date":"2025-06-01","arxiv_id":"2506.01109","n_code_links":0,"syntology":null},{"paper":null,"slug":"generic-token-compression-in-multimodal-large","title":"Generic Token Compression in Multimodal Large Language Models from an Explainability Perspective","date":"2025-06-01","arxiv_id":"2506.01097","n_code_links":0,"syntology":null},{"paper":null,"slug":"assortment-of-attention-heads-accelerating","title":"Assortment of Attention Heads: Accelerating Federated PEFT with Head Pruning and Strategic Client Selection","date":"2025-05-31","arxiv_id":"2506.00743","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-simple-linear-patch-revives-layer-pruned","title":"A Simple Linear Patch Revives Layer-Pruned Large Language Models","date":"2025-05-30","arxiv_id":"2505.24680","n_code_links":0,"syntology":null},{"paper":null,"slug":"aflora-adaptive-federated-fine-tuning-of","title":"AFLoRA: Adaptive Federated Fine-Tuning of Large Language Models with Resource-Aware Low-Rank Adaption","date":"2025-05-30","arxiv_id":"2505.24773","n_code_links":0,"syntology":null},{"paper":null,"slug":"autochemschematic-ai-a-closed-loop-physics","title":"AutoChemSchematic AI: A Closed-Loop, Physics-Aware Agentic Framework for Auto-Generating Chemical Process and Instrumentation Diagrams","date":"2025-05-30","arxiv_id":"2505.24584","n_code_links":0,"syntology":null},{"paper":null,"slug":"fine-tune-before-structured-pruning-towards","title":"Fine-tune Before Structured Pruning: Towards Compact and Accurate Self-Supervised Models for Speaker Diarization","date":"2025-05-30","arxiv_id":"2505.24111","n_code_links":0,"syntology":null},{"paper":"/paper/hyperbolic-dataset-distillation","slug":"hyperbolic-dataset-distillation","title":"Hyperbolic Dataset Distillation","date":"2025-05-30","arxiv_id":"2505.24623","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Guang000/Awesome-Dataset-Distillation"],"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":["found_in_text"]}}},{"paper":null,"slug":"lpass-linear-probes-as-stepping-stones-for","title":"LPASS: Linear Probes as Stepping Stones for vulnerability detection using compressed LLMs","date":"2025-05-30","arxiv_id":"2505.24451","n_code_links":0,"syntology":null},{"paper":null,"slug":"smooth-model-compression-without-fine-tuning","title":"Smooth Model Compression without Fine-Tuning","date":"2025-05-30","arxiv_id":"2505.24469","n_code_links":0,"syntology":null},{"paper":"/paper/denoiserotator-enhance-pruning-robustness-for","slug":"denoiserotator-enhance-pruning-robustness-for","title":"DenoiseRotator: Enhance Pruning Robustness for LLMs via Importance Concentration","date":"2025-05-29","arxiv_id":"2505.23049","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["axel-gu/denoiserotator"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/flat-llm-fine-grained-low-rank-activation","slug":"flat-llm-fine-grained-low-rank-activation","title":"FLAT-LLM: Fine-grained Low-rank Activation Space Transformation for Large Language Model Compression","date":"2025-05-29","arxiv_id":"2505.23966","n_code_links":1,"syntology":null},{"paper":"/paper/leave-it-to-the-specialist-repair-sparse-llms","slug":"leave-it-to-the-specialist-repair-sparse-llms","title":"Leave it to the Specialist: Repair Sparse LLMs with Sparse Fine-Tuning via Sparsity Evolution","date":"2025-05-29","arxiv_id":"2505.24037","n_code_links":1,"syntology":null},{"paper":"/paper/less-is-more-unlocking-specialization-of-time","slug":"less-is-more-unlocking-specialization-of-time","title":"Less is More: Unlocking Specialization of Time Series Foundation Models via Structured Pruning","date":"2025-05-29","arxiv_id":"2505.23195","n_code_links":0,"syntology":{"ran":3,"of":5,"n_ran_checked":2,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":null,"slug":"lodge-level-of-detail-large-scale-gaussian","title":"LODGE: Level-of-Detail Large-Scale Gaussian Splatting with Efficient Rendering","date":"2025-05-29","arxiv_id":"2505.23158","n_code_links":0,"syntology":null},{"paper":null,"slug":"tsenor-highly-efficient-algorithm-for-finding","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","date":"2025-05-29","arxiv_id":"2505.23949","n_code_links":0,"syntology":null},{"paper":null,"slug":"effective-and-efficient-one-pass-compression","title":"Effective and Efficient One-pass Compression of Speech Foundation Models Using Sparsity-aware Self-pinching Gates","date":"2025-05-28","arxiv_id":"2505.22608","n_code_links":0,"syntology":null},{"paper":"/paper/mustafar-promoting-unstructured-sparsity-for","slug":"mustafar-promoting-unstructured-sparsity-for","title":"Mustafar: Promoting Unstructured Sparsity for KV Cache Pruning in LLM Inference","date":"2025-05-28","arxiv_id":"2505.22913","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"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":["dhjoo98/mustafar"],"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/on-the-dynamic-regret-of-following-the","slug":"on-the-dynamic-regret-of-following-the","title":"On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning","date":"2025-05-28","arxiv_id":"2505.22899","n_code_links":1,"syntology":null},{"paper":"/paper/shapley-value-driven-data-pruning-for","slug":"shapley-value-driven-data-pruning-for","title":"Shapley Value-driven Data Pruning for Recommender Systems","date":"2025-05-28","arxiv_id":"2505.22057","n_code_links":1,"syntology":null},{"paper":null,"slug":"slimllm-accurate-structured-pruning-for-large","title":"SlimLLM: Accurate Structured Pruning for Large Language Models","date":"2025-05-28","arxiv_id":"2505.22689","n_code_links":0,"syntology":null},{"paper":"/paper/starbase-gp-biologically-guided-automated","slug":"starbase-gp-biologically-guided-automated","title":"StarBASE-GP: Biologically-Guided Automated Machine Learning for Genotype-to-Phenotype Association Analysis","date":"2025-05-28","arxiv_id":"2505.22746","n_code_links":1,"syntology":null},{"paper":null,"slug":"up-slam-adaptively-structured-gaussian-slam","title":"UP-SLAM: Adaptively Structured Gaussian SLAM with Uncertainty Prediction in Dynamic Environments","date":"2025-05-28","arxiv_id":"2505.22335","n_code_links":0,"syntology":null},{"paper":null,"slug":"vscan-rethinking-visual-token-reduction-for","title":"VScan: Rethinking Visual Token Reduction for Efficient Large Vision-Language Models","date":"2025-05-28","arxiv_id":"2505.22654","n_code_links":0,"syntology":null},{"paper":"/paper/dlp-dynamic-layerwise-pruning-in-large","slug":"dlp-dynamic-layerwise-pruning-in-large","title":"DLP: Dynamic Layerwise Pruning in Large Language Models","date":"2025-05-27","arxiv_id":"2505.23807","n_code_links":1,"syntology":{"ran":0,"of":10,"n_ran_checked":0,"n_instrument":0,"unverified":10,"pointer_only":0,"phrase":"0 ran · 10 unverified","official":{"repos":["ironartisan/dlp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":10,"ran_from_kinds":[]}}},{"paper":"/paper/geollava-8k-scaling-remote-sensing-multimodal","slug":"geollava-8k-scaling-remote-sensing-multimodal","title":"GeoLLaVA-8K: Scaling Remote-Sensing Multimodal Large Language Models to 8K Resolution","date":"2025-05-27","arxiv_id":"2505.21375","n_code_links":1,"syntology":null},{"paper":"/paper/holitom-holistic-token-merging-for-fast-video","slug":"holitom-holistic-token-merging-for-fast-video","title":"HoliTom: Holistic Token Merging for Fast Video Large Language Models","date":"2025-05-27","arxiv_id":"2505.21334","n_code_links":1,"syntology":null},{"paper":"/paper/sparsified-state-space-models-are-efficient","slug":"sparsified-state-space-models-are-efficient","title":"Sparsified State-Space Models are Efficient Highway Networks","date":"2025-05-27","arxiv_id":"2505.20698","n_code_links":1,"syntology":null},{"paper":null,"slug":"adatp-attention-debiased-token-pruning-for","title":"AdaTP: Attention-Debiased Token Pruning for Video Large Language Models","date":"2025-05-26","arxiv_id":"2505.20100","n_code_links":0,"syntology":null},{"paper":"/paper/can-compressed-llms-truly-act-an-empirical","slug":"can-compressed-llms-truly-act-an-empirical","title":"Can Compressed LLMs Truly Act? An Empirical Evaluation of Agentic Capabilities in LLM Compression","date":"2025-05-26","arxiv_id":"2505.19433","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["pprp/acbench"],"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","unlocated"]}}},{"paper":"/paper/efficient-multi-modal-long-context-learning","slug":"efficient-multi-modal-long-context-learning","title":"Efficient Multi-modal Long Context Learning for Training-free Adaptation","date":"2025-05-26","arxiv_id":"2505.19812","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-speech-translation-through-model","slug":"efficient-speech-translation-through-model","title":"Efficient Speech Translation through Model Compression and Knowledge Distillation","date":"2025-05-26","arxiv_id":"2505.20237","n_code_links":1,"syntology":null},{"paper":"/paper/flowcut-rethinking-redundancy-via-information","slug":"flowcut-rethinking-redundancy-via-information","title":"FlowCut: Rethinking Redundancy via Information Flow for Efficient Vision-Language Models","date":"2025-05-26","arxiv_id":"2505.19536","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"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":["tungchintao/flowcut"],"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/grokking-explaind-unifying-model-data-and","slug":"grokking-explaind-unifying-model-data-and","title":"Grokking ExPLAIND: Unifying Model, Data, and Training Attribution to Study Model Behavior","date":"2025-05-26","arxiv_id":"2505.20076","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","official":{"repos":["mainlp/explaind"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_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":388,"every_run_a_failure_of_syntologys_instrument":90,"listed_with_a_run_with_no_instrument_failure":388,"listed_every_run_a_failure_of_syntologys_instrument":90,"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"},"papers_where_code_ran":478,"papers_where_code_ran_first_page":"/method/pruning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":39,"url":"/method/pruning/papers/2","json":"/method/pruning/papers/2.json","rows":100},{"order":"archive","page":3,"of":39,"url":"/method/pruning/papers/3","json":"/method/pruning/papers/3.json","rows":100},{"order":"archive","page":4,"of":39,"url":"/method/pruning/papers/4","json":"/method/pruning/papers/4.json","rows":100},{"order":"archive","page":5,"of":39,"url":"/method/pruning/papers/5","json":"/method/pruning/papers/5.json","rows":100},{"order":"archive","page":6,"of":39,"url":"/method/pruning/papers/6","json":"/method/pruning/papers/6.json","rows":100},{"order":"archive","page":7,"of":39,"url":"/method/pruning/papers/7","json":"/method/pruning/papers/7.json","rows":100},{"order":"archive","page":8,"of":39,"url":"/method/pruning/papers/8","json":"/method/pruning/papers/8.json","rows":100},{"order":"archive","page":9,"of":39,"url":"/method/pruning/papers/9","json":"/method/pruning/papers/9.json","rows":100},{"order":"archive","page":10,"of":39,"url":"/method/pruning/papers/10","json":"/method/pruning/papers/10.json","rows":100},{"order":"archive","page":11,"of":39,"url":"/method/pruning/papers/11","json":"/method/pruning/papers/11.json","rows":100},{"order":"archive","page":12,"of":39,"url":"/method/pruning/papers/12","json":"/method/pruning/papers/12.json","rows":100},{"order":"archive","page":13,"of":39,"url":"/method/pruning/papers/13","json":"/method/pruning/papers/13.json","rows":100},{"order":"archive","page":14,"of":39,"url":"/method/pruning/papers/14","json":"/method/pruning/papers/14.json","rows":100},{"order":"archive","page":15,"of":39,"url":"/method/pruning/papers/15","json":"/method/pruning/papers/15.json","rows":100},{"order":"archive","page":16,"of":39,"url":"/method/pruning/papers/16","json":"/method/pruning/papers/16.json","rows":100},{"order":"archive","page":17,"of":39,"url":"/method/pruning/papers/17","json":"/method/pruning/papers/17.json","rows":100},{"order":"archive","page":18,"of":39,"url":"/method/pruning/papers/18","json":"/method/pruning/papers/18.json","rows":100},{"order":"archive","page":19,"of":39,"url":"/method/pruning/papers/19","json":"/method/pruning/papers/19.json","rows":100},{"order":"archive","page":20,"of":39,"url":"/method/pruning/papers/20","json":"/method/pruning/papers/20.json","rows":100},{"order":"archive","page":21,"of":39,"url":"/method/pruning/papers/21","json":"/method/pruning/papers/21.json","rows":100},{"order":"archive","page":22,"of":39,"url":"/method/pruning/papers/22","json":"/method/pruning/papers/22.json","rows":100},{"order":"archive","page":23,"of":39,"url":"/method/pruning/papers/23","json":"/method/pruning/papers/23.json","rows":100},{"order":"archive","page":24,"of":39,"url":"/method/pruning/papers/24","json":"/method/pruning/papers/24.json","rows":100},{"order":"archive","page":25,"of":39,"url":"/method/pruning/papers/25","json":"/method/pruning/papers/25.json","rows":100},{"order":"archive","page":26,"of":39,"url":"/method/pruning/papers/26","json":"/method/pruning/papers/26.json","rows":100},{"order":"archive","page":27,"of":39,"url":"/method/pruning/papers/27","json":"/method/pruning/papers/27.json","rows":100},{"order":"archive","page":28,"of":39,"url":"/method/pruning/papers/28","json":"/method/pruning/papers/28.json","rows":100},{"order":"archive","page":29,"of":39,"url":"/method/pruning/papers/29","json":"/method/pruning/papers/29.json","rows":100},{"order":"archive","page":30,"of":39,"url":"/method/pruning/papers/30","json":"/method/pruning/papers/30.json","rows":100},{"order":"archive","page":31,"of":39,"url":"/method/pruning/papers/31","json":"/method/pruning/papers/31.json","rows":100},{"order":"archive","page":32,"of":39,"url":"/method/pruning/papers/32","json":"/method/pruning/papers/32.json","rows":100},{"order":"archive","page":33,"of":39,"url":"/method/pruning/papers/33","json":"/method/pruning/papers/33.json","rows":100},{"order":"archive","page":34,"of":39,"url":"/method/pruning/papers/34","json":"/method/pruning/papers/34.json","rows":100},{"order":"archive","page":35,"of":39,"url":"/method/pruning/papers/35","json":"/method/pruning/papers/35.json","rows":100},{"order":"archive","page":36,"of":39,"url":"/method/pruning/papers/36","json":"/method/pruning/papers/36.json","rows":100},{"order":"archive","page":37,"of":39,"url":"/method/pruning/papers/37","json":"/method/pruning/papers/37.json","rows":100},{"order":"archive","page":38,"of":39,"url":"/method/pruning/papers/38","json":"/method/pruning/papers/38.json","rows":100},{"order":"archive","page":39,"of":39,"url":"/method/pruning/papers/39","json":"/method/pruning/papers/39.json","rows":74},{"order":"ran","page":1,"of":5,"url":"/method/pruning/papers/ran/1","json":"/method/pruning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":5,"url":"/method/pruning/papers/ran/2","json":"/method/pruning/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":5,"url":"/method/pruning/papers/ran/3","json":"/method/pruning/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":5,"url":"/method/pruning/papers/ran/4","json":"/method/pruning/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":5,"url":"/method/pruning/papers/ran/5","json":"/method/pruning/papers/ran/5.json","rows":78}],"tasks":[{"task":"/task/network-pruning","name":"Network Pruning","papers":453},{"task":"/task/model-compression","name":"Model Compression","papers":357},{"task":"/task/quantization","name":"Quantization","papers":333},{"task":"/task/image-classification","name":"Image Classification","papers":195},{"task":"/task/image-classification","name":"image-classification","papers":174},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":161},{"task":"/task/language-modelling","name":"Language Modelling","papers":159},{"task":null,"name":"GPU","papers":146},{"task":"/task/language-modeling","name":"Language Modeling","papers":133},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":96},{"task":"/task/federated-learning","name":"Federated Learning","papers":96},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":90},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":85},{"task":"/task/object-detection","name":"Object Detection","papers":84},{"task":"/task/object-detection-1","name":"object-detection","papers":83},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":69},{"task":"/task/diversity","name":"Diversity","papers":62},{"task":"/task/large-language-model","name":"Large Language Model","papers":62},{"task":"/task/neural-network-compression","name":"Neural Network Compression","papers":62},{"task":"/task/retrieval","name":"Retrieval","papers":62}],"tasks_shown":20,"n_tasks":792,"usage_by_year":[{"year":"2016","papers":15},{"year":"2017","papers":74},{"year":"2018","papers":175},{"year":"2019","papers":281},{"year":"2020","papers":414},{"year":"2021","papers":524},{"year":"2022","papers":462},{"year":"2023","papers":591},{"year":"2024","papers":848},{"year":"2025","papers":490}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/pruning"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Pruning","read_at":"2026-10-05T01:00:43+00:00","query":"Pruning","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1608.08710","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Pruning' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["IG-Pruning","ATV-Pruning","Edge Pruning","path pruning","Probe Pruning","Block Pruning","greedy pruning","filter pruning"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"ae5a398901f3cd8862c4b270253f1684531b7aa4d01a52ce9d5caf76d6c5e4bf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}