{"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/10","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":10,"pages_in_order":39,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/method/pruning/papers/11","papers":[{"paper":null,"slug":"pass-visual-prompt-locates-good-structure","title":"(PASS) Visual Prompt Locates Good Structure Sparsity through a Recurrent HyperNetwork","date":"2024-07-24","arxiv_id":"2407.17412","n_code_links":0,"syntology":null},{"paper":null,"slug":"sfprompt-communication-efficient-split","title":"SFPrompt: Communication-Efficient Split Federated Fine-Tuning for Large Pre-Trained Models over Resource-Limited Devices","date":"2024-07-24","arxiv_id":"2407.17533","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-the-neural-burden-in-pruned-models","title":"Exploring The Neural Burden In Pruned Models: An Insight Inspired By Neuroscience","date":"2024-07-23","arxiv_id":"2407.16716","n_code_links":0,"syntology":null},{"paper":"/paper/2408-00801","slug":"2408-00801","title":"Low Rank Field-Weighted Factorization Machines for Low Latency Item Recommendation","date":"2024-07-22","arxiv_id":"2408.00801","n_code_links":1,"syntology":null},{"paper":null,"slug":"comprehensive-study-on-performance-evaluation","title":"Comprehensive Study on Performance Evaluation and Optimization of Model Compression: Bridging Traditional Deep Learning and Large Language Models","date":"2024-07-22","arxiv_id":"2407.15904","n_code_links":0,"syntology":null},{"paper":null,"slug":"token-picker-accelerating-attention-in-text","title":"Token-Picker: Accelerating Attention in Text Generation with Minimized Memory Transfer via Probability Estimation","date":"2024-07-21","arxiv_id":"2407.15131","n_code_links":0,"syntology":null},{"paper":"/paper/compact-language-models-via-pruning-and","slug":"compact-language-models-via-pruning-and","title":"Compact Language Models via Pruning and Knowledge Distillation","date":"2024-07-19","arxiv_id":"2407.14679","n_code_links":1,"syntology":null},{"paper":null,"slug":"lazyllm-dynamic-token-pruning-for-efficient","title":"LazyLLM: Dynamic Token Pruning for Efficient Long Context LLM Inference","date":"2024-07-19","arxiv_id":"2407.14057","n_code_links":0,"syntology":null},{"paper":"/paper/straightforward-layer-wise-pruning-for-more","slug":"straightforward-layer-wise-pruning-for-more","title":"Straightforward Layer-wise Pruning for More Efficient Visual Adaptation","date":"2024-07-19","arxiv_id":"2407.14330","n_code_links":1,"syntology":null},{"paper":"/paper/thinking-racial-bias-in-fair-forgery","slug":"thinking-racial-bias-in-fair-forgery","title":"Thinking Racial Bias in Fair Forgery Detection: Models, Datasets and Evaluations","date":"2024-07-19","arxiv_id":"2407.14367","n_code_links":1,"syntology":null},{"paper":null,"slug":"2408-00794","title":"CCSRP: Robust Pruning of Spiking Neural Networks through Cooperative Coevolution","date":"2024-07-18","arxiv_id":"2408.00794","n_code_links":0,"syntology":null},{"paper":null,"slug":"reconstruct-the-pruned-model-without-any","title":"Reconstruct the Pruned Model without Any Retraining","date":"2024-07-18","arxiv_id":"2407.13331","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-three-stage-algorithm-for-the-closest","title":"A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences","date":"2024-07-17","arxiv_id":"2407.13023","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-dynamic-pruning-a-pathway-to-efficient","title":"Hybrid Dynamic Pruning: A Pathway to Efficient Transformer Inference","date":"2024-07-17","arxiv_id":"2407.12893","n_code_links":0,"syntology":null},{"paper":null,"slug":"strawberry-detection-and-counting-based-on","title":"Strawberry detection and counting based on YOLOv7 pruning and information based tracking algorithm","date":"2024-07-17","arxiv_id":"2407.12614","n_code_links":0,"syntology":null},{"paper":null,"slug":"mini-llm-memory-efficient-structured-pruning","title":"MINI-LLM: Memory-Efficient Structured Pruning for Large Language Models","date":"2024-07-16","arxiv_id":"2407.11681","n_code_links":0,"syntology":null},{"paper":"/paper/neural-passage-quality-estimation-for-static","slug":"neural-passage-quality-estimation-for-static","title":"Neural Passage Quality Estimation for Static Pruning","date":"2024-07-16","arxiv_id":"2407.12170","n_code_links":1,"syntology":null},{"paper":null,"slug":"tackling-oversmoothing-in-gnn-via-graph","title":"Tackling Oversmoothing in GNN via Graph Sparsification: A Truss-based Approach","date":"2024-07-16","arxiv_id":"2407.11928","n_code_links":0,"syntology":null},{"paper":null,"slug":"gtpt-group-based-token-pruning-transformer","title":"GTPT: Group-based Token Pruning Transformer for Efficient Human Pose Estimation","date":"2024-07-15","arxiv_id":"2407.10756","n_code_links":0,"syntology":null},{"paper":"/paper/minimizing-plm-based-few-shot-intent","slug":"minimizing-plm-based-few-shot-intent","title":"Minimizing PLM-Based Few-Shot Intent Detectors","date":"2024-07-13","arxiv_id":"2407.09943","n_code_links":1,"syntology":null},{"paper":"/paper/team-up-gbdts-and-dnns-advancing-efficient","slug":"team-up-gbdts-and-dnns-advancing-efficient","title":"Team up GBDTs and DNNs: Advancing Efficient and Effective Tabular Prediction with Tree-hybrid MLPs","date":"2024-07-13","arxiv_id":"2407.09790","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":6,"n_instrument":1,"unverified":2,"pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["jyansir/tmlp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"diversifying-the-expert-knowledge-for-task","title":"Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts","date":"2024-07-12","arxiv_id":"2407.09590","n_code_links":0,"syntology":null},{"paper":null,"slug":"admm-based-semi-structured-pattern-pruning","title":"ADMM Based Semi-Structured Pattern Pruning Framework For Transformer","date":"2024-07-11","arxiv_id":"2407.08334","n_code_links":0,"syntology":null},{"paper":"/paper/automatic-pruning-of-fine-tuning-datasets-for","slug":"automatic-pruning-of-fine-tuning-datasets-for","title":"Automatic Pruning of Fine-tuning Datasets for Transformer-based Language Models","date":"2024-07-11","arxiv_id":"2407.08887","n_code_links":1,"syntology":null},{"paper":null,"slug":"characterizing-prompt-compression-methods-for","title":"Characterizing Prompt Compression Methods for Long Context Inference","date":"2024-07-11","arxiv_id":"2407.08892","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-encoder-size-based-on-data-driven","title":"Dynamic Encoder Size Based on Data-Driven Layer-wise Pruning for Speech Recognition","date":"2024-07-10","arxiv_id":"2407.18930","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploiting-heterogeneity-in-timescales-for","title":"Exploiting Heterogeneity in Timescales for Sparse Recurrent Spiking Neural Networks for Energy-Efficient Edge Computing","date":"2024-07-08","arxiv_id":"2407.06452","n_code_links":0,"syntology":null},{"paper":"/paper/ldgcn-an-edge-end-lightweight-dual-gcn-based","slug":"ldgcn-an-edge-end-lightweight-dual-gcn-based","title":"LDGCN: An Edge-End Lightweight Dual GCN Based on Single-Channel EEG for Driver Drowsiness Monitoring","date":"2024-07-08","arxiv_id":"2407.05749","n_code_links":1,"syntology":null},{"paper":"/paper/pruning-large-language-models-to-intra-module","slug":"pruning-large-language-models-to-intra-module","title":"Pruning Large Language Models to Intra-module Low-rank Architecture with Transitional Activations","date":"2024-07-08","arxiv_id":"2407.05690","n_code_links":1,"syntology":null},{"paper":"/paper/spatio-temporal-structure-of-excitation-and","slug":"spatio-temporal-structure-of-excitation-and","title":"Learning Delays Through Gradients and Structure: Emergence of Spatiotemporal Patterns in Spiking Neural Networks","date":"2024-07-07","arxiv_id":"2407.18917","n_code_links":1,"syntology":null},{"paper":"/paper/beyond-perplexity-multi-dimensional-safety","slug":"beyond-perplexity-multi-dimensional-safety","title":"Beyond Perplexity: Multi-dimensional Safety Evaluation of LLM Compression","date":"2024-07-06","arxiv_id":"2407.04965","n_code_links":1,"syntology":{"ran":14,"of":16,"n_ran_checked":14,"n_instrument":0,"unverified":2,"pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["zhichaoxu-shufe/beyond-perplexity-compression-safety-eval"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"code-less-align-more-efficient-llm-fine","title":"Code Less, Align More: Efficient LLM Fine-tuning for Code Generation with Data Pruning","date":"2024-07-06","arxiv_id":"2407.05040","n_code_links":0,"syntology":null},{"paper":"/paper/dmtg-one-shot-differentiable-multi-task","slug":"dmtg-one-shot-differentiable-multi-task","title":"DMTG: One-Shot Differentiable Multi-Task Grouping","date":"2024-07-06","arxiv_id":"2407.05082","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":6,"n_instrument":1,"unverified":2,"pointer_only":9,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ethanygao/dmtg"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"the-solution-for-the-aigc-inference","title":"The Solution for the AIGC Inference Performance Optimization Competition","date":"2024-07-06","arxiv_id":"2407.04991","n_code_links":0,"syntology":null},{"paper":"/paper/an-interactive-multi-modal-query-answering","slug":"an-interactive-multi-modal-query-answering","title":"An Interactive Multi-modal Query Answering System with Retrieval-Augmented Large Language Models","date":"2024-07-05","arxiv_id":"2407.04217","n_code_links":1,"syntology":null},{"paper":"/paper/isomorphic-pruning-for-vision-models","slug":"isomorphic-pruning-for-vision-models","title":"Isomorphic Pruning for Vision Models","date":"2024-07-05","arxiv_id":"2407.04616","n_code_links":1,"syntology":{"ran":4,"of":7,"n_ran_checked":3,"n_instrument":1,"unverified":3,"pointer_only":7,"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) · 3 unverified","official":{"repos":["vainf/isomorphic-pruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/layershuffle-enhancing-robustness-in-vision","slug":"layershuffle-enhancing-robustness-in-vision","title":"LayerShuffle: Enhancing Robustness in Vision Transformers by Randomizing Layer Execution Order","date":"2024-07-05","arxiv_id":"2407.04513","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-impact-of-quantization-and-pruning-on","title":"The Impact of Quantization and Pruning on Deep Reinforcement Learning Models","date":"2024-07-05","arxiv_id":"2407.04803","n_code_links":0,"syntology":null},{"paper":null,"slug":"functional-faithfulness-in-the-wild-circuit","title":"Functional Faithfulness in the Wild: Circuit Discovery with Differentiable Computation Graph Pruning","date":"2024-07-04","arxiv_id":"2407.03779","n_code_links":0,"syntology":null},{"paper":"/paper/sparsest-models-elude-pruning-an-expose-of","slug":"sparsest-models-elude-pruning-an-expose-of","title":"Sparsest Models Elude Pruning: An Exposé of Pruning's Current Capabilities","date":"2024-07-04","arxiv_id":"2407.04075","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-dnn-powered-software-with-fair","title":"Efficient DNN-Powered Software with Fair Sparse Models","date":"2024-07-03","arxiv_id":"2407.02805","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancements-for-real-time-monte-carlo-tree","title":"Enhancements for Real-Time Monte-Carlo Tree Search in General Video Game Playing","date":"2024-07-03","arxiv_id":"2407.03049","n_code_links":0,"syntology":null},{"paper":null,"slug":"dm3d-distortion-minimized-weight-pruning-for","title":"DM3D: Distortion-Minimized Weight Pruning for Lossless 3D Object Detection","date":"2024-07-02","arxiv_id":"2407.02098","n_code_links":0,"syntology":null},{"paper":"/paper/lpvit-low-power-semi-structured-pruning-for","slug":"lpvit-low-power-semi-structured-pruning-for","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","date":"2024-07-02","arxiv_id":"2407.02068","n_code_links":1,"syntology":{"ran":12,"of":12,"n_ran_checked":11,"n_instrument":1,"unverified":0,"pointer_only":12,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 1 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Akimoto-Cris/LPViT"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"universal-approximation-theory-the-basic-1","title":"Dynamic Universal Approximation Theory: The Basic Theory for Deep Learning-Based Computer Vision Models","date":"2024-07-02","arxiv_id":"2407.17480","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-expert-pruning-for-sparse-mixture","slug":"efficient-expert-pruning-for-sparse-mixture","title":"Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs","date":"2024-07-01","arxiv_id":"2407.00945","n_code_links":1,"syntology":null},{"paper":"/paper/joint-pruning-and-channel-wise-mixed","slug":"joint-pruning-and-channel-wise-mixed","title":"Joint Pruning and Channel-wise Mixed-Precision Quantization for Efficient Deep Neural Networks","date":"2024-07-01","arxiv_id":"2407.01054","n_code_links":1,"syntology":null},{"paper":"/paper/pruning-one-more-token-is-enough-leveraging","slug":"pruning-one-more-token-is-enough-leveraging","title":"Pruning One More Token is Enough: Leveraging Latency-Workload Non-Linearities for Vision Transformers on the Edge","date":"2024-07-01","arxiv_id":"2407.05941","n_code_links":1,"syntology":null},{"paper":null,"slug":"universal-approximation-theory-the-basic","title":"Dynamic Universal Approximation Theory: The Basic Theory for Transformer-based Large Language Models","date":"2024-07-01","arxiv_id":"2407.00958","n_code_links":0,"syntology":null},{"paper":null,"slug":"brevity-is-the-soul-of-wit-pruning-long-files","title":"Brevity is the soul of wit: Pruning long files for code generation","date":"2024-06-29","arxiv_id":"2407.00434","n_code_links":0,"syntology":null},{"paper":"/paper/untangling-the-unrestricted-web-automatic","slug":"untangling-the-unrestricted-web-automatic","title":"Automatic register identification for the open web using multilingual deep learning","date":"2024-06-28","arxiv_id":"2406.19892","n_code_links":1,"syntology":null},{"paper":null,"slug":"fedmap-iterative-magnitude-based-pruning-for","title":"FedMap: Iterative Magnitude-Based Pruning for Communication-Efficient Federated Learning","date":"2024-06-27","arxiv_id":"2406.19050","n_code_links":0,"syntology":null},{"paper":null,"slug":"which-neurons-matter-in-ir-applying","title":"Which Neurons Matter in IR? Applying Integrated Gradients-based Methods to Understand Cross-Encoders","date":"2024-06-27","arxiv_id":"2406.19309","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-data-pruning-for-automatic-speech","title":"Dynamic Data Pruning for Automatic Speech Recognition","date":"2024-06-26","arxiv_id":"2406.18373","n_code_links":0,"syntology":null},{"paper":"/paper/factfinders-at-checkthat-2024-refining-check","slug":"factfinders-at-checkthat-2024-refining-check","title":"FactFinders at CheckThat! 2024: Refining Check-worthy Statement Detection with LLMs through Data Pruning","date":"2024-06-26","arxiv_id":"2406.18297","n_code_links":1,"syntology":null},{"paper":"/paper/hierarchical-context-pruning-optimizing-real","slug":"hierarchical-context-pruning-optimizing-real","title":"Hierarchical Context Pruning: Optimizing Real-World Code Completion with Repository-Level Pretrained Code LLMs","date":"2024-06-26","arxiv_id":"2406.18294","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":["hambaobao/hcp-coder"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/trimming-the-fat-efficient-compression-of-3d","slug":"trimming-the-fat-efficient-compression-of-3d","title":"Trimming the Fat: Efficient Compression of 3D Gaussian Splats through Pruning","date":"2024-06-26","arxiv_id":"2406.18214","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["salmanali96/trimming-the-fat"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/consensus-learning-with-deep-sets-for","slug":"consensus-learning-with-deep-sets-for","title":"Consensus Learning with Deep Sets for Essential Matrix Estimation","date":"2024-06-25","arxiv_id":"2406.17414","n_code_links":1,"syntology":null},{"paper":null,"slug":"geometric-median-gm-matching-for-robust-data","title":"Geometric Median (GM) Matching for Robust Data Pruning","date":"2024-06-25","arxiv_id":"2406.17188","n_code_links":0,"syntology":null},{"paper":"/paper/trawl-tensor-reduced-and-approximated-weights","slug":"trawl-tensor-reduced-and-approximated-weights","title":"TRAWL: Tensor Reduced and Approximated Weights for Large Language Models","date":"2024-06-25","arxiv_id":"2406.17261","n_code_links":1,"syntology":null},{"paper":"/paper/variable-layer-wise-quantization-a-simple-and","slug":"variable-layer-wise-quantization-a-simple-and","title":"Layer-Wise Quantization: A Pragmatic and Effective Method for Quantizing LLMs Beyond Integer Bit-Levels","date":"2024-06-25","arxiv_id":"2406.17415","n_code_links":1,"syntology":null},{"paper":null,"slug":"and-audio-network-dissection-for-interpreting","title":"AND: Audio Network Dissection for Interpreting Deep Acoustic Models","date":"2024-06-24","arxiv_id":"2406.16990","n_code_links":0,"syntology":null},{"paper":null,"slug":"clothedreamer-text-guided-garment-generation","title":"ClotheDreamer: Text-Guided Garment Generation with 3D Gaussians","date":"2024-06-24","arxiv_id":"2406.16815","n_code_links":0,"syntology":null},{"paper":"/paper/finding-transformer-circuits-with-edge","slug":"finding-transformer-circuits-with-edge","title":"Finding Transformer Circuits with Edge Pruning","date":"2024-06-24","arxiv_id":"2406.16778","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":3,"n_instrument":5,"unverified":0,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","official":{"repos":["princeton-nlp/edge-pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"learning-on-transformers-is-provable-low-rank","title":"Learning on Transformers is Provable Low-Rank and Sparse: A One-layer Analysis","date":"2024-06-24","arxiv_id":"2406.17167","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-via-merging-compressing-llms-via","slug":"pruning-via-merging-compressing-llms-via","title":"Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Merging","date":"2024-06-24","arxiv_id":"2406.16330","n_code_links":1,"syntology":{"ran":10,"of":13,"n_ran_checked":3,"n_instrument":7,"unverified":3,"pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","official":{"repos":["sempraety/pruning-via-merging"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"reducing-the-memory-footprint-of-3d-gaussian","title":"Reducing the Memory Footprint of 3D Gaussian Splatting","date":"2024-06-24","arxiv_id":"2406.17074","n_code_links":0,"syntology":null},{"paper":null,"slug":"seeking-certainty-in-uncertainty-dual-stage","title":"D2SP: Dynamic Dual-Stage Purification Framework for Dual Noise Mitigation in Vision-based Affective Recognition","date":"2024-06-24","arxiv_id":"2406.16473","n_code_links":0,"syntology":null},{"paper":"/paper/shadowllm-predictor-based-contextual-sparsity","slug":"shadowllm-predictor-based-contextual-sparsity","title":"ShadowLLM: Predictor-based Contextual Sparsity for Large Language Models","date":"2024-06-24","arxiv_id":"2406.16635","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":["abdelfattah-lab/shadow_llm"],"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":"/paper/text-alpha-2-discovering-logical-formulaic","slug":"text-alpha-2-discovering-logical-formulaic","title":"$\\text{Alpha}^2$: Discovering Logical Formulaic Alphas using Deep Reinforcement Learning","date":"2024-06-24","arxiv_id":"2406.16505","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-lightweight-graph-neural-network","title":"Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsification","date":"2024-06-24","arxiv_id":"2406.16357","n_code_links":0,"syntology":null},{"paper":"/paper/lgs-a-light-weight-4d-gaussian-splatting-for","slug":"lgs-a-light-weight-4d-gaussian-splatting-for","title":"LGS: A Light-weight 4D Gaussian Splatting for Efficient Surgical Scene Reconstruction","date":"2024-06-23","arxiv_id":"2406.16073","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":5,"n_instrument":0,"unverified":4,"pointer_only":9,"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) · 4 unverified","official":{"repos":["CUHK-AIM-Group/LGS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"disha-low-energy-sparse-transformer-at-edge","title":"DISHA: Low-Energy Sparse Transformer at Edge for Outdoor Navigation for the Visually Impaired Individuals","date":"2024-06-22","arxiv_id":"2406.15864","n_code_links":0,"syntology":null},{"paper":"/paper/edge-llm-enabling-efficient-large-language","slug":"edge-llm-enabling-efficient-large-language","title":"EDGE-LLM: Enabling Efficient Large Language Model Adaptation on Edge Devices via Layerwise Unified Compression and Adaptive Layer Tuning and Voting","date":"2024-06-22","arxiv_id":"2406.15758","n_code_links":1,"syntology":null},{"paper":null,"slug":"rankadaptor-hierarchical-dynamic-low-rank","title":"RankAdaptor: Hierarchical Rank Allocation for Efficient Fine-Tuning Pruned LLMs via Performance Model","date":"2024-06-22","arxiv_id":"2406.15734","n_code_links":0,"syntology":null},{"paper":"/paper/what-matters-in-transformers-not-all","slug":"what-matters-in-transformers-not-all","title":"What Matters in Transformers? Not All Attention is Needed","date":"2024-06-22","arxiv_id":"2406.15786","n_code_links":2,"syntology":{"ran":5,"of":10,"n_ran_checked":5,"n_instrument":0,"unverified":5,"pointer_only":3,"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) · 5 unverified","official":{"repos":["case-lab-umd/llm-drop","shwai-he/llm-drop"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/rethinking-pruning-large-language-models","slug":"rethinking-pruning-large-language-models","title":"Rethinking Pruning Large Language Models: Benefits and Pitfalls of Reconstruction Error Minimization","date":"2024-06-21","arxiv_id":"2406.15524","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":3,"n_instrument":0,"unverified":5,"pointer_only":8,"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) · 5 unverified","official":{"repos":["log-postech/rethinking-llm-pruning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"measuring-sample-importance-in-data-pruning","title":"Measuring Sample Importance in Data Pruning for Language Models based on Information Entropy","date":"2024-06-20","arxiv_id":"2406.14124","n_code_links":0,"syntology":null},{"paper":"/paper/xcomet-lite-bridging-the-gap-between","slug":"xcomet-lite-bridging-the-gap-between","title":"xCOMET-lite: Bridging the Gap Between Efficiency and Quality in Learned MT Evaluation Metrics","date":"2024-06-20","arxiv_id":"2406.14553","n_code_links":1,"syntology":null},{"paper":"/paper/large-scale-dataset-pruning-in-adversarial","slug":"large-scale-dataset-pruning-in-adversarial","title":"Large-Scale Dataset Pruning in Adversarial Training through Data Importance Extrapolation","date":"2024-06-19","arxiv_id":"2406.13283","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":7,"n_instrument":0,"unverified":2,"pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["BjoernNieth/LS-Dataset-pruning-in-AT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/attention-score-is-not-all-you-need-for-token","slug":"attention-score-is-not-all-you-need-for-token","title":"Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matters","date":"2024-06-18","arxiv_id":"2406.12335","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"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) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","official":{"repos":["guozhiyu/vatp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/federated-learning-with-a-single-shared-image","slug":"federated-learning-with-a-single-shared-image","title":"Federated Learning with a Single Shared Image","date":"2024-06-18","arxiv_id":"2406.12658","n_code_links":1,"syntology":null},{"paper":"/paper/layermerge-neural-network-depth-compression","slug":"layermerge-neural-network-depth-compression","title":"LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging","date":"2024-06-18","arxiv_id":"2406.12837","n_code_links":1,"syntology":{"ran":17,"of":23,"n_ran_checked":9,"n_instrument":8,"unverified":6,"pointer_only":2,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 8 where Syntology's instrument failed) · 6 unverified","official":{"repos":["snu-mllab/layermerge"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/pruningbench-a-comprehensive-benchmark-of","slug":"pruningbench-a-comprehensive-benchmark-of","title":"A Comprehensive Study of Structural Pruning for Vision Models","date":"2024-06-18","arxiv_id":"2406.12315","n_code_links":1,"syntology":null},{"paper":null,"slug":"reproducibility-of-predictive-networks-for","title":"Reproducibility of predictive networks for mouse visual cortex","date":"2024-06-18","arxiv_id":"2406.12625","n_code_links":0,"syntology":null},{"paper":"/paper/score-a-1d-reparameterization-technique-to","slug":"score-a-1d-reparameterization-technique-to","title":"SCORE: A 1D Reparameterization Technique to Break Bayesian Optimization's Curse of Dimensionality","date":"2024-06-18","arxiv_id":"2406.12661","n_code_links":1,"syntology":null},{"paper":"/paper/the-heterophilic-snowflake-hypothesis","slug":"the-heterophilic-snowflake-hypothesis","title":"The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs","date":"2024-06-18","arxiv_id":"2406.12539","n_code_links":1,"syntology":null},{"paper":"/paper/beyond-boundaries-learning-a-universal-entity","slug":"beyond-boundaries-learning-a-universal-entity","title":"Beyond Boundaries: Learning a Universal Entity Taxonomy across Datasets and Languages for Open Named Entity Recognition","date":"2024-06-17","arxiv_id":"2406.11192","n_code_links":1,"syntology":null},{"paper":"/paper/della-merging-reducing-interference-in-model","slug":"della-merging-reducing-interference-in-model","title":"DELLA-Merging: Reducing Interference in Model Merging through Magnitude-Based Sampling","date":"2024-06-17","arxiv_id":"2406.11617","n_code_links":1,"syntology":{"ran":12,"of":15,"n_ran_checked":12,"n_instrument":0,"unverified":3,"pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["declare-lab/della"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"multi-dimensional-pruning-joint-channel-layer","title":"Multi-Dimensional Pruning: Joint Channel, Layer and Block Pruning with Latency Constraint","date":"2024-06-17","arxiv_id":"2406.12079","n_code_links":0,"syntology":null},{"paper":"/paper/not-all-prompts-are-made-equal-prompt-based","slug":"not-all-prompts-are-made-equal-prompt-based","title":"Not All Prompts Are Made Equal: Prompt-based Pruning of Text-to-Image Diffusion Models","date":"2024-06-17","arxiv_id":"2406.12042","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["rezashkv/diffusion_pruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"on-the-feasibility-of-fidelity-for-graph","title":"On the Feasibility of Fidelity$^-$ for Graph Pruning","date":"2024-06-17","arxiv_id":"2406.11504","n_code_links":0,"syntology":null},{"paper":"/paper/pick-or-mix-dynamic-channel-sampling-for-1","slug":"pick-or-mix-dynamic-channel-sampling-for-1","title":"Pick-or-Mix: Dynamic Channel Sampling for ConvNets","date":"2024-06-16","arxiv_id":"2406.10935","n_code_links":1,"syntology":null},{"paper":"/paper/blockpruner-fine-grained-pruning-for-large","slug":"blockpruner-fine-grained-pruning-for-large","title":"BlockPruner: Fine-grained Pruning for Large Language Models","date":"2024-06-15","arxiv_id":"2406.10594","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":6,"n_instrument":3,"unverified":3,"pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["MrGGLS/BlockPruner"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"optimization-based-structural-pruning-for","title":"Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient","date":"2024-06-15","arxiv_id":"2406.10576","n_code_links":0,"syntology":null},{"paper":"/paper/hiro-hierarchical-information-retrieval","slug":"hiro-hierarchical-information-retrieval","title":"HIRO: Hierarchical Information Retrieval Optimization","date":"2024-06-14","arxiv_id":"2406.09979","n_code_links":1,"syntology":null},{"paper":"/paper/pup-3d-gs-principled-uncertainty-pruning-for","slug":"pup-3d-gs-principled-uncertainty-pruning-for","title":"PUP 3D-GS: Principled Uncertainty Pruning for 3D Gaussian Splatting","date":"2024-06-14","arxiv_id":"2406.10219","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["j-alex-hanson/gaussian-splatting-pup"],"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":"av-gs-learning-material-and-geometry-aware","title":"AV-GS: Learning Material and Geometry Aware Priors for Novel View Acoustic Synthesis","date":"2024-06-13","arxiv_id":"2406.08920","n_code_links":0,"syntology":null},{"paper":null,"slug":"gaussian-forest-hierarchical-hybrid-3d","title":"GaussianForest: Hierarchical-Hybrid 3D Gaussian Splatting for Compressed Scene Modeling","date":"2024-06-13","arxiv_id":"2406.08759","n_code_links":0,"syntology":null},{"paper":null,"slug":"llm-based-knowledge-pruning-for-time-series","title":"LLM-based Knowledge Pruning for Time Series Data Analytics on Edge-computing Devices","date":"2024-06-13","arxiv_id":"2406.08765","n_code_links":0,"syntology":null}],"record_sha256":"dacd3e6c905d201ce13170618bd3a0515eb328d877ea58704e4a1044658fd464","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}