{"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/4","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":4,"pages_in_order":39,"rows_per_page":100,"rows":[301,400],"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/3","next":"/method/pruning/papers/5","papers":[{"paper":null,"slug":"mvgsr-multi-view-consistency-gaussian","title":"MVGSR: Multi-View Consistency Gaussian Splatting for Robust Surface Reconstruction","date":"2025-03-11","arxiv_id":"2503.08093","n_code_links":0,"syntology":null},{"paper":"/paper/prism-privacy-preserving-improved-stochastic","slug":"prism-privacy-preserving-improved-stochastic","title":"PRISM: Privacy-Preserving Improved Stochastic Masking for Federated Generative Models","date":"2025-03-11","arxiv_id":"2503.08085","n_code_links":1,"syntology":null},{"paper":"/paper/quota-query-oriented-token-assignment-via-cot","slug":"quota-query-oriented-token-assignment-via-cot","title":"QuoTA: Query-oriented Token Assignment via CoT Query Decouple for Long Video Comprehension","date":"2025-03-11","arxiv_id":"2503.08689","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":["mac-automl/quota"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"paper":null,"slug":"datawiseagent-a-notebook-centric-llm-agent","title":"DatawiseAgent: A Notebook-Centric LLM Agent Framework for Automated Data Science","date":"2025-03-10","arxiv_id":"2503.07044","n_code_links":0,"syntology":null},{"paper":"/paper/federated-multimodal-learning-with-dual","slug":"federated-multimodal-learning-with-dual","title":"Federated Multimodal Learning with Dual Adapters and Selective Pruning for Communication and Computational Efficiency","date":"2025-03-10","arxiv_id":"2503.07552","n_code_links":1,"syntology":null},{"paper":"/paper/iterative-prompt-relocation-for-distribution","slug":"iterative-prompt-relocation-for-distribution","title":"Iterative Prompt Relocation for Distribution-Adaptive Visual Prompt Tuning","date":"2025-03-10","arxiv_id":"2503.06901","n_code_links":1,"syntology":null},{"paper":"/paper/seap-training-free-sparse-expert-activation","slug":"seap-training-free-sparse-expert-activation","title":"SEAP: Training-free Sparse Expert Activation Pruning Unlock the Brainpower of Large Language Models","date":"2025-03-10","arxiv_id":"2503.07605","n_code_links":1,"syntology":null},{"paper":"/paper/when-large-vision-language-model-meets-large","slug":"when-large-vision-language-model-meets-large","title":"When Large Vision-Language Model Meets Large Remote Sensing Imagery: Coarse-to-Fine Text-Guided Token Pruning","date":"2025-03-10","arxiv_id":"2503.07588","n_code_links":1,"syntology":null},{"paper":"/paper/pre-training-meta-rule-selection-policy-for","slug":"pre-training-meta-rule-selection-policy-for","title":"Pre-Training Meta-Rule Selection Policy for Visual Generative Abductive Learning","date":"2025-03-09","arxiv_id":"2503.06427","n_code_links":1,"syntology":null},{"paper":null,"slug":"disrupting-model-merging-a-parameter-level","title":"Disrupting Model Merging: A Parameter-Level Defense Without Sacrificing Accuracy","date":"2025-03-08","arxiv_id":"2503.07661","n_code_links":0,"syntology":null},{"paper":null,"slug":"iterabre-iterative-recovery-aided-block","title":"IteRABRe: Iterative Recovery-Aided Block Reduction","date":"2025-03-08","arxiv_id":"2503.06291","n_code_links":0,"syntology":null},{"paper":null,"slug":"mad-max-modular-and-diverse-malicious-attack","title":"MAD-MAX: Modular And Diverse Malicious Attack MiXtures for Automated LLM Red Teaming","date":"2025-03-08","arxiv_id":"2503.06253","n_code_links":0,"syntology":null},{"paper":null,"slug":"sample-aware-adaptive-structured-pruning-for","title":"Sample-aware Adaptive Structured Pruning for Large Language Models","date":"2025-03-08","arxiv_id":"2503.06184","n_code_links":0,"syntology":null},{"paper":null,"slug":"securegs-boosting-the-security-and-fidelity","title":"SecureGS: Boosting the Security and Fidelity of 3D Gaussian Splatting Steganography","date":"2025-03-08","arxiv_id":"2503.06118","n_code_links":0,"syntology":null},{"paper":"/paper/d2gv-deformable-2d-gaussian-splatting-for","slug":"d2gv-deformable-2d-gaussian-splatting-for","title":"D2GV: Deformable 2D Gaussian Splatting for Video Representation in 400FPS","date":"2025-03-07","arxiv_id":"2503.05600","n_code_links":1,"syntology":null},{"paper":null,"slug":"idea-prune-an-integrated-enlarge-and-prune","title":"IDEA Prune: An Integrated Enlarge-and-Prune Pipeline in Generative Language Model Pretraining","date":"2025-03-07","arxiv_id":"2503.05920","n_code_links":0,"syntology":null},{"paper":"/paper/reward-centered-rest-mcts-a-robust-decision","slug":"reward-centered-rest-mcts-a-robust-decision","title":"Reward-Centered ReST-MCTS: A Robust Decision-Making Framework for Robotic Manipulation in High Uncertainty Environments","date":"2025-03-07","arxiv_id":"2503.05226","n_code_links":1,"syntology":null},{"paper":"/paper/pdx-a-data-layout-for-vector-similarity","slug":"pdx-a-data-layout-for-vector-similarity","title":"PDX: A Data Layout for Vector Similarity Search","date":"2025-03-06","arxiv_id":"2503.04422","n_code_links":1,"syntology":null},{"paper":"/paper/wanda-pruning-large-language-models-via-1","slug":"wanda-pruning-large-language-models-via-1","title":"Wanda++: Pruning Large Language Models via Regional Gradients","date":"2025-03-06","arxiv_id":"2503.04992","n_code_links":1,"syntology":null},{"paper":null,"slug":"lewis-layer-wise-sparsity-a-training-free","title":"LEWIS (LayEr WIse Sparsity) -- A Training Free Guided Model Merging Approach","date":"2025-03-05","arxiv_id":"2503.03874","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-decision-tree-pruning-revisited","title":"Optimal Decision Tree Pruning Revisited: Algorithms and Complexity","date":"2025-03-05","arxiv_id":"2503.03576","n_code_links":0,"syntology":null},{"paper":null,"slug":"rasd-retrieval-augmented-speculative-decoding","title":"RASD: Retrieval-Augmented Speculative Decoding","date":"2025-03-05","arxiv_id":"2503.03434","n_code_links":0,"syntology":null},{"paper":null,"slug":"skeletonisation-scale-spaces","title":"Skeletonisation Scale-Spaces","date":"2025-03-05","arxiv_id":"2503.03450","n_code_links":0,"syntology":null},{"paper":null,"slug":"cordic-is-all-you-need","title":"CORDIC Is All You Need","date":"2025-03-04","arxiv_id":"2503.11685","n_code_links":0,"syntology":null},{"paper":"/paper/divprune-diversity-based-visual-token-pruning","slug":"divprune-diversity-based-visual-token-pruning","title":"DivPrune: Diversity-based Visual Token Pruning for Large Multimodal Models","date":"2025-03-04","arxiv_id":"2503.02175","n_code_links":1,"syntology":null},{"paper":null,"slug":"fairsense-ai-responsible-ai-meets","title":"FairSense-AI: Responsible AI Meets Sustainability","date":"2025-03-04","arxiv_id":"2503.02865","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-a-robust-r2d2-paradigm-for-radio","title":"Towards a robust R2D2 paradigm for radio-interferometric imaging: revisiting DNN training and architecture","date":"2025-03-04","arxiv_id":"2503.02554","n_code_links":0,"syntology":null},{"paper":null,"slug":"opengs-slam-open-set-dense-semantic-slam-with","title":"OpenGS-SLAM: Open-Set Dense Semantic SLAM with 3D Gaussian Splatting for Object-Level Scene Understanding","date":"2025-03-03","arxiv_id":"2503.01646","n_code_links":0,"syntology":null},{"paper":null,"slug":"transferring-between-sparse-and-dense","title":"Transferring between sparse and dense matching via probabilistic reweighting","date":"2025-03-03","arxiv_id":"2503.01472","n_code_links":0,"syntology":null},{"paper":"/paper/training-free-dataset-pruning-for-instance","slug":"training-free-dataset-pruning-for-instance","title":"Training-Free Dataset Pruning for Instance Segmentation","date":"2025-03-02","arxiv_id":"2503.00828","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":1,"n_instrument":4,"unverified":3,"pointer_only":8,"phrase":"5 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; 4 where Syntology's instrument failed) · 3 unverified","official":{"repos":["he-y/dataset-pruning-for-instance-segmentation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"speculative-decoding-and-beyond-an-in-depth","title":"Speculative Decoding and Beyond: An In-Depth Review of Techniques","date":"2025-02-27","arxiv_id":"2502.19732","n_code_links":0,"syntology":null},{"paper":"/paper/a-sliding-layer-merging-method-for-efficient","slug":"a-sliding-layer-merging-method-for-efficient","title":"A Sliding Layer Merging Method for Efficient Depth-Wise Pruning in LLMs","date":"2025-02-26","arxiv_id":"2502.19159","n_code_links":1,"syntology":null},{"paper":null,"slug":"accurate-3d-grapevine-structure-extraction","title":"Accurate 3D Grapevine Structure Extraction from High-Resolution Point Clouds","date":"2025-02-26","arxiv_id":"2502.20417","n_code_links":0,"syntology":null},{"paper":null,"slug":"cabs-conflict-aware-and-balanced","title":"CABS: Conflict-Aware and Balanced Sparsification for Enhancing Model Merging","date":"2025-02-26","arxiv_id":"2503.01874","n_code_links":0,"syntology":null},{"paper":null,"slug":"kanana-compute-efficient-bilingual-language","title":"Kanana: Compute-efficient Bilingual Language Models","date":"2025-02-26","arxiv_id":"2502.18934","n_code_links":0,"syntology":null},{"paper":null,"slug":"compressing-language-models-for-specialized","title":"Compressing Language Models for Specialized Domains","date":"2025-02-25","arxiv_id":"2502.18424","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-device-edge-learning-for-iot-data-streams","title":"On-device edge learning for IoT data streams: a survey","date":"2025-02-25","arxiv_id":"2502.17788","n_code_links":0,"syntology":null},{"paper":"/paper/optimal-brain-apoptosis","slug":"optimal-brain-apoptosis","title":"Optimal Brain Apoptosis","date":"2025-02-25","arxiv_id":"2502.17941","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["neu-real/oba"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/cipherprune-efficient-and-scalable-private","slug":"cipherprune-efficient-and-scalable-private","title":"CipherPrune: Efficient and Scalable Private Transformer Inference","date":"2025-02-24","arxiv_id":"2502.16782","n_code_links":1,"syntology":{"ran":3,"of":9,"n_ran_checked":3,"n_instrument":0,"unverified":6,"pointer_only":9,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["ucf-lou-lab-pet/cipher-prune-inference"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"dbudgetkv-dynamic-budget-in-kv-cache","title":"DBudgetKV: Dynamic Budget in KV Cache Compression for Ensuring Optimal Performance","date":"2025-02-24","arxiv_id":"2502.16886","n_code_links":0,"syntology":null},{"paper":"/paper/delta-decompression-for-moe-based-llms","slug":"delta-decompression-for-moe-based-llms","title":"Delta Decompression for MoE-based LLMs Compression","date":"2025-02-24","arxiv_id":"2502.17298","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":["lliai/d2moe"],"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":null,"slug":"geometric-properties-and-graph-based","title":"Geometric Properties and Graph-Based Optimization of Neural Networks: Addressing Non-Linearity, Dimensionality, and Scalability","date":"2025-02-24","arxiv_id":"2503.05761","n_code_links":0,"syntology":null},{"paper":null,"slug":"low-rank-and-sparse-model-merging-for-multi","title":"Low-Rank and Sparse Model Merging for Multi-Lingual Speech Recognition and Translation","date":"2025-02-24","arxiv_id":"2502.17380","n_code_links":0,"syntology":null},{"paper":null,"slug":"systematic-weight-evaluation-for-pruning","title":"Systematic Weight Evaluation for Pruning Large Language Models: Enhancing Performance and Sustainability","date":"2025-02-24","arxiv_id":"2502.17071","n_code_links":0,"syntology":null},{"paper":"/paper/automatic-joint-structured-pruning-and","slug":"automatic-joint-structured-pruning-and","title":"Automatic Joint Structured Pruning and Quantization for Efficient Neural Network Training and Compression","date":"2025-02-23","arxiv_id":"2502.16638","n_code_links":1,"syntology":{"ran":1,"of":5,"n_ran_checked":1,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["microsoft/geta"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"energy-efficient-transformer-inference","title":"Energy-Efficient Transformer Inference: Optimization Strategies for Time Series Classification","date":"2025-02-23","arxiv_id":"2502.16627","n_code_links":0,"syntology":null},{"paper":null,"slug":"lattice-based-pruning-in-recurrent-neural","title":"Lattice-Based Pruning in Recurrent Neural Networks via Poset Modeling","date":"2025-02-23","arxiv_id":"2502.16525","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-agnostic-coreset-selection-via-llm","title":"Model-agnostic Coreset Selection via LLM-based Concept Bottlenecks","date":"2025-02-23","arxiv_id":"2502.16733","n_code_links":0,"syntology":null},{"paper":null,"slug":"spectral-theory-for-edge-pruning-in","title":"Spectral Theory for Edge Pruning in Asynchronous Recurrent Graph Neural Networks","date":"2025-02-23","arxiv_id":"2502.17522","n_code_links":0,"syntology":null},{"paper":null,"slug":"recurrent-knowledge-identification-and-fusion","title":"Recurrent Knowledge Identification and Fusion for Language Model Continual Learning","date":"2025-02-22","arxiv_id":"2502.17510","n_code_links":0,"syntology":null},{"paper":null,"slug":"zigong-1-0-a-large-language-model-for","title":"ZiGong 1.0: A Large Language Model for Financial Credit","date":"2025-02-22","arxiv_id":"2502.16159","n_code_links":0,"syntology":null},{"paper":"/paper/modality-aware-neuron-pruning-for-unlearning","slug":"modality-aware-neuron-pruning-for-unlearning","title":"Modality-Aware Neuron Pruning for Unlearning in Multimodal Large Language Models","date":"2025-02-21","arxiv_id":"2502.15910","n_code_links":1,"syntology":{"ran":6,"of":18,"n_ran_checked":0,"n_instrument":6,"unverified":12,"pointer_only":18,"phrase":"6 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; 6 where Syntology's instrument failed) · 12 unverified","official":{"repos":["franciscoliu/MANU"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":12,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ppc-gpt-federated-task-specific-compression","title":"PPC-GPT: Federated Task-Specific Compression of Large Language Models via Pruning and Chain-of-Thought Distillation","date":"2025-02-21","arxiv_id":"2502.15857","n_code_links":0,"syntology":null},{"paper":"/paper/probe-pruning-accelerating-llms-through","slug":"probe-pruning-accelerating-llms-through","title":"Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probing","date":"2025-02-21","arxiv_id":"2502.15618","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":1,"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":["qi-le1/probe_pruning"],"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","unlocated"]}}},{"paper":null,"slug":"when-compression-meets-model-compression","title":"When Compression Meets Model Compression: Memory-Efficient Double Compression for Large Language Models","date":"2025-02-21","arxiv_id":"2502.15443","n_code_links":0,"syntology":null},{"paper":null,"slug":"plphp-per-layer-per-head-vision-token-pruning","title":"PLPHP: Per-Layer Per-Head Vision Token Pruning for Efficient Large Vision-Language Models","date":"2025-02-20","arxiv_id":"2502.14504","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-efficient-automatic-self-pruning-of","title":"Towards Efficient Automatic Self-Pruning of Large Language Models","date":"2025-02-20","arxiv_id":"2502.14413","n_code_links":0,"syntology":null},{"paper":"/paper/ets-efficient-tree-search-for-inference-time","slug":"ets-efficient-tree-search-for-inference-time","title":"ETS: Efficient Tree Search for Inference-Time Scaling","date":"2025-02-19","arxiv_id":"2502.13575","n_code_links":1,"syntology":null},{"paper":null,"slug":"maskprune-mask-based-llm-pruning-for-layer","title":"MaskPrune: Mask-based LLM Pruning for Layer-wise Uniform Structures","date":"2025-02-19","arxiv_id":"2502.14008","n_code_links":0,"syntology":null},{"paper":null,"slug":"nvr-vector-runahead-on-npus-for-sparse-memory","title":"NVR: Vector Runahead on NPUs for Sparse Memory Access","date":"2025-02-19","arxiv_id":"2502.13873","n_code_links":0,"syntology":null},{"paper":"/paper/train-small-infer-large-memory-efficient-lora","slug":"train-small-infer-large-memory-efficient-lora","title":"Train Small, Infer Large: Memory-Efficient LoRA Training for Large Language Models","date":"2025-02-19","arxiv_id":"2502.13533","n_code_links":1,"syntology":{"ran":5,"of":13,"n_ran_checked":4,"n_instrument":1,"unverified":8,"pointer_only":1,"phrase":"5 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","official":{"repos":["junzhang-zj/LoRAM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official","unlocated"]}}},{"paper":null,"slug":"boost-disentangle-and-customize-a-robust","title":"Boost, Disentangle, and Customize: A Robust System2-to-System1 Pipeline for Code Generation","date":"2025-02-18","arxiv_id":"2502.12492","n_code_links":0,"syntology":null},{"paper":null,"slug":"dsmoe-matrix-partitioned-experts-with-dynamic","title":"DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs","date":"2025-02-18","arxiv_id":"2502.12455","n_code_links":0,"syntology":null},{"paper":"/paper/g-refer-graph-retrieval-augmented-large","slug":"g-refer-graph-retrieval-augmented-large","title":"G-Refer: Graph Retrieval-Augmented Large Language Model for Explainable Recommendation","date":"2025-02-18","arxiv_id":"2502.12586","n_code_links":1,"syntology":null},{"paper":"/paper/iron-sharpens-iron-defending-against-attacks","slug":"iron-sharpens-iron-defending-against-attacks","title":"Iron Sharpens Iron: Defending Against Attacks in Machine-Generated Text Detection with Adversarial Training","date":"2025-02-18","arxiv_id":"2502.12734","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"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":["liyuuuu111/greater"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ntp-int-network-traffic-prediction-driven-in","title":"NTP-INT: Network Traffic Prediction-Driven In-band Network Telemetry for High-load Switches","date":"2025-02-18","arxiv_id":"2502.12834","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-as-a-defense-reducing-memorization-in","title":"Pruning as a Defense: Reducing Memorization in Large Language Models","date":"2025-02-18","arxiv_id":"2502.15796","n_code_links":0,"syntology":null},{"paper":null,"slug":"signal-collapse-in-one-shot-pruning-when","title":"Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representations","date":"2025-02-18","arxiv_id":"2502.15790","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-row-based-sparse-fine-tuning","title":"An Efficient Row-Based Sparse Fine-Tuning","date":"2025-02-17","arxiv_id":"2502.11439","n_code_links":0,"syntology":null},{"paper":null,"slug":"dictionary-learning-based-data-pruning-for","title":"Dictionary-Learning-Based Data Pruning for System Identification","date":"2025-02-17","arxiv_id":"2502.11484","n_code_links":0,"syntology":null},{"paper":"/paper/fishing-for-cheap-and-efficient-pruners-at","slug":"fishing-for-cheap-and-efficient-pruners-at","title":"Fishing For Cheap And Efficient Pruners At Initialization","date":"2025-02-17","arxiv_id":"2502.11450","n_code_links":1,"syntology":null},{"paper":null,"slug":"fitlight-federated-imitation-learning-for","title":"FitLight: Federated Imitation Learning for Plug-and-Play Autonomous Traffic Signal Control","date":"2025-02-17","arxiv_id":"2502.11937","n_code_links":0,"syntology":null},{"paper":"/paper/sql-o1-a-self-reward-heuristic-dynamic-search","slug":"sql-o1-a-self-reward-heuristic-dynamic-search","title":"SQL-o1: A Self-Reward Heuristic Dynamic Search Method for Text-to-SQL","date":"2025-02-17","arxiv_id":"2502.11741","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["shuailyu0110/sql-o1"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/stop-looking-for-important-tokens-in","slug":"stop-looking-for-important-tokens-in","title":"Stop Looking for Important Tokens in Multimodal Language Models: Duplication Matters More","date":"2025-02-17","arxiv_id":"2502.11494","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":2,"n_instrument":5,"unverified":1,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","official":{"repos":["zichenwen1/dart"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"token-pruning-in-multimodal-large-language","title":"Token Pruning in Multimodal Large Language Models: Are We Solving the Right Problem?","date":"2025-02-17","arxiv_id":"2502.11501","n_code_links":0,"syntology":null},{"paper":null,"slug":"cachefocus-dynamic-cache-re-positioning-for","title":"CacheFocus: Dynamic Cache Re-Positioning for Efficient Retrieval-Augmented Generation","date":"2025-02-16","arxiv_id":"2502.11101","n_code_links":0,"syntology":null},{"paper":null,"slug":"gs-gvins-a-tightly-integrated-gnss-visual","title":"GS-GVINS: A Tightly-integrated GNSS-Visual-Inertial Navigation System Augmented by 3D Gaussian Splatting","date":"2025-02-16","arxiv_id":"2502.10975","n_code_links":0,"syntology":null},{"paper":null,"slug":"optishear-towards-efficient-and-adaptive","title":"OPTISHEAR: Towards Efficient and Adaptive Pruning of Large Language Models via Evolutionary Optimization","date":"2025-02-15","arxiv_id":"2502.10735","n_code_links":0,"syntology":null},{"paper":null,"slug":"janus-collaborative-vision-transformer-under","title":"Janus: Collaborative Vision Transformer Under Dynamic Network Environment","date":"2025-02-14","arxiv_id":"2502.10047","n_code_links":0,"syntology":null},{"paper":"/paper/text-guided-sparse-voxel-pruning-for","slug":"text-guided-sparse-voxel-pruning-for","title":"Text-guided Sparse Voxel Pruning for Efficient 3D Visual Grounding","date":"2025-02-14","arxiv_id":"2502.10392","n_code_links":1,"syntology":null},{"paper":null,"slug":"automatic-pruning-via-structured-lasso-with","title":"Automatic Pruning via Structured Lasso with Class-wise Information","date":"2025-02-13","arxiv_id":"2502.09125","n_code_links":0,"syntology":null},{"paper":null,"slug":"densesplat-densifying-gaussian-splatting-slam","title":"DenseSplat: Densifying Gaussian Splatting SLAM with Neural Radiance Prior","date":"2025-02-13","arxiv_id":"2502.09111","n_code_links":0,"syntology":null},{"paper":null,"slug":"infinitehip-extending-language-model-context","title":"InfiniteHiP: Extending Language Model Context Up to 3 Million Tokens on a Single GPU","date":"2025-02-13","arxiv_id":"2502.08910","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-first-order-method-for-certifying","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","date":"2025-02-13","arxiv_id":"2502.09502","n_code_links":0,"syntology":null},{"paper":null,"slug":"contextual-compression-encoding-for-large","title":"Contextual Compression Encoding for Large Language Models: A Novel Framework for Multi-Layered Parameter Space Pruning","date":"2025-02-12","arxiv_id":"2502.08323","n_code_links":0,"syntology":null},{"paper":null,"slug":"skrr-skip-and-re-use-text-encoder-layers-for","title":"Skrr: Skip and Re-use Text Encoder Layers for Memory Efficient Text-to-Image Generation","date":"2025-02-12","arxiv_id":"2502.08690","n_code_links":0,"syntology":null},{"paper":"/paper/top-theta-attention-sparsifying-transformers","slug":"top-theta-attention-sparsifying-transformers","title":"Top-Theta Attention: Sparsifying Transformers by Compensated Thresholding","date":"2025-02-12","arxiv_id":"2502.08363","n_code_links":1,"syntology":null},{"paper":null,"slug":"breaking-down-bias-on-the-limits-of","title":"Breaking Down Bias: On The Limits of Generalizable Pruning Strategies","date":"2025-02-11","arxiv_id":"2502.07771","n_code_links":0,"syntology":null},{"paper":"/paper/darwinlm-evolutionary-structured-pruning-of","slug":"darwinlm-evolutionary-structured-pruning-of","title":"DarwinLM: Evolutionary Structured Pruning of Large Language Models","date":"2025-02-11","arxiv_id":"2502.07780","n_code_links":1,"syntology":null},{"paper":null,"slug":"exploring-neural-network-pruning-with","title":"Exploring Neural Network Pruning with Screening Methods","date":"2025-02-11","arxiv_id":"2502.07189","n_code_links":0,"syntology":null},{"paper":null,"slug":"partial-label-learning-with-conformal","title":"Partial-Label Learning with Conformal Candidate Cleaning","date":"2025-02-11","arxiv_id":"2502.07661","n_code_links":0,"syntology":null},{"paper":"/paper/lightweight-dataset-pruning-without-full","slug":"lightweight-dataset-pruning-without-full","title":"Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty","date":"2025-02-10","arxiv_id":"2502.06905","n_code_links":1,"syntology":null},{"paper":null,"slug":"low-rank-compression-for-imc-arrays","title":"Low-Rank Compression for IMC Arrays","date":"2025-02-10","arxiv_id":"2502.07820","n_code_links":0,"syntology":null},{"paper":null,"slug":"synergistic-effects-of-knowledge-distillation","title":"Synergistic Effects of Knowledge Distillation and Structured Pruning for Self-Supervised Speech Models","date":"2025-02-09","arxiv_id":"2502.05837","n_code_links":0,"syntology":null},{"paper":null,"slug":"diffusion-model-for-interest-refinement-in","title":"Diffusion Model for Interest Refinement in Multi-Interest Recommendation","date":"2025-02-08","arxiv_id":"2502.05561","n_code_links":0,"syntology":null},{"paper":null,"slug":"mix-data-or-merge-models-balancing-the","title":"Mix Data or Merge Models? Balancing the Helpfulness, Honesty, and Harmlessness of Large Language Model via Model Merging","date":"2025-02-08","arxiv_id":"2502.06876","n_code_links":0,"syntology":null},{"paper":"/paper/distillation-and-pruning-for-scalable-self","slug":"distillation-and-pruning-for-scalable-self","title":"Distillation and Pruning for Scalable Self-Supervised Representation-Based Speech Quality Assessment","date":"2025-02-07","arxiv_id":"2502.05356","n_code_links":1,"syntology":null},{"paper":"/paper/model-fusion-via-neuron-transplantation","slug":"model-fusion-via-neuron-transplantation","title":"Model Fusion via Neuron Transplantation","date":"2025-02-07","arxiv_id":"2502.06849","n_code_links":1,"syntology":null},{"paper":null,"slug":"detecting-backdoor-attacks-via-similarity-in","title":"Detecting Backdoor Attacks via Similarity in Semantic Communication Systems","date":"2025-02-06","arxiv_id":"2502.03721","n_code_links":0,"syntology":null},{"paper":"/paper/identify-critical-kv-cache-in-llm-inference","slug":"identify-critical-kv-cache-in-llm-inference","title":"Identify Critical KV Cache in LLM Inference from an Output Perturbation Perspective","date":"2025-02-06","arxiv_id":"2502.03805","n_code_links":2,"syntology":{"ran":4,"of":11,"n_ran_checked":3,"n_instrument":1,"unverified":7,"pointer_only":0,"phrase":"4 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","official":{"repos":["NVIDIA/kvpress"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}}],"record_sha256":"70c7db301d0a2b8a30ab783cec992e528d4687e5326aa0a72b41b45bc0406bbe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}