{"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/3","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":3,"pages_in_order":39,"rows_per_page":100,"rows":[201,300],"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/2","next":"/method/pruning/papers/4","papers":[{"paper":null,"slug":"enhanced-pruning-strategy-for-multi-component","title":"Enhanced Pruning Strategy for Multi-Component Neural Architectures Using Component-Aware Graph Analysis","date":"2025-04-17","arxiv_id":"2504.13296","n_code_links":0,"syntology":null},{"paper":"/paper/towards-lossless-token-pruning-in-late","slug":"towards-lossless-token-pruning-in-late","title":"Towards Lossless Token Pruning in Late-Interaction Retrieval Models","date":"2025-04-17","arxiv_id":"2504.12778","n_code_links":1,"syntology":null},{"paper":"/paper/sparsity-outperforms-low-rank-projections-in","slug":"sparsity-outperforms-low-rank-projections-in","title":"Sparsity Outperforms Low-Rank Projections in Few-Shot Adaptation","date":"2025-04-16","arxiv_id":"2504.12436","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":["nairouz/SO"],"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":null,"slug":"unveiling-hidden-collaboration-within-mixture","title":"Unveiling Hidden Collaboration within Mixture-of-Experts in Large Language Models","date":"2025-04-16","arxiv_id":"2504.12359","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptively-pruned-spiking-neural-networks-for","title":"Adaptively Pruned Spiking Neural Networks for Energy-Efficient Intracortical Neural Decoding","date":"2025-04-15","arxiv_id":"2504.11568","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-hybrid-language-model-compression","title":"Efficient Hybrid Language Model Compression through Group-Aware SSM Pruning","date":"2025-04-15","arxiv_id":"2504.11409","n_code_links":0,"syntology":null},{"paper":null,"slug":"lvlm-csp-accelerating-large-vision-language","title":"LVLM_CSP: Accelerating Large Vision Language Models via Clustering, Scattering, and Pruning for Reasoning Segmentation","date":"2025-04-15","arxiv_id":"2504.10854","n_code_links":0,"syntology":null},{"paper":"/paper/tamp-token-adaptive-layerwise-pruning-in","slug":"tamp-token-adaptive-layerwise-pruning-in","title":"TAMP: Token-Adaptive Layerwise Pruning in Multimodal Large Language Models","date":"2025-04-14","arxiv_id":"2504.09897","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-enhanced-iterative-deepening-search","title":"An Enhanced Iterative Deepening Search Algorithm for the Unrestricted Container Rehandling Problem","date":"2025-04-12","arxiv_id":"2504.09046","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-mixture-of-geographical-species-for","title":"Efficient Mixture of Geographical Species for On Device Wildlife Monitoring","date":"2025-04-11","arxiv_id":"2504.08620","n_code_links":0,"syntology":null},{"paper":"/paper/pact-pruning-and-clustering-based-token","slug":"pact-pruning-and-clustering-based-token","title":"PACT: Pruning and Clustering-Based Token Reduction for Faster Visual Language Models","date":"2025-04-11","arxiv_id":"2504.08966","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":["orailix/pact"],"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":null,"slug":"preserving-privacy-without-compromising","title":"Preserving Privacy Without Compromising Accuracy: Machine Unlearning for Handwritten Text Recognition","date":"2025-04-11","arxiv_id":"2504.08616","n_code_links":0,"syntology":null},{"paper":"/paper/cluster-driven-expert-pruning-for-mixture-of","slug":"cluster-driven-expert-pruning-for-mixture-of","title":"Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models","date":"2025-04-10","arxiv_id":"2504.07807","n_code_links":1,"syntology":null},{"paper":"/paper/cafe-ad-cross-scenario-adaptive-feature","slug":"cafe-ad-cross-scenario-adaptive-feature","title":"CAFE-AD: Cross-Scenario Adaptive Feature Enhancement for Trajectory Planning in Autonomous Driving","date":"2025-04-09","arxiv_id":"2504.06584","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-signal-compression-using-raman-tinyml","title":"Neural Signal Compression using RAMAN tinyML Accelerator for BCI Applications","date":"2025-04-09","arxiv_id":"2504.06996","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-neural-architecture-search-with","title":"Federated Neural Architecture Search with Model-Agnostic Meta Learning","date":"2025-04-08","arxiv_id":"2504.06457","n_code_links":0,"syntology":null},{"paper":null,"slug":"finding-fantastic-experts-in-moes-a-unified","title":"Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observations","date":"2025-04-08","arxiv_id":"2504.05586","n_code_links":0,"syntology":null},{"paper":null,"slug":"balancing-robustness-and-efficiency-in","title":"Balancing Robustness and Efficiency in Embedded DNNs Through Activation Function Selection","date":"2025-04-07","arxiv_id":"2504.05119","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-vision-mamba","slug":"dynamic-vision-mamba","title":"Dynamic Vision Mamba","date":"2025-04-07","arxiv_id":"2504.04787","n_code_links":1,"syntology":null},{"paper":null,"slug":"two-is-better-than-one-efficient-ensemble","title":"Two is Better than One: Efficient Ensemble Defense for Robust and Compact Models","date":"2025-04-07","arxiv_id":"2504.04747","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperflows-pruning-reveals-the-importance-of","title":"Hyperflows: Pruning Reveals the Importance of Weights","date":"2025-04-06","arxiv_id":"2504.05349","n_code_links":0,"syntology":null},{"paper":null,"slug":"saliency-driven-dynamic-token-pruning-for","title":"Saliency-driven Dynamic Token Pruning for Large Language Models","date":"2025-04-06","arxiv_id":"2504.04514","n_code_links":0,"syntology":null},{"paper":"/paper/thanos-a-block-wise-pruning-algorithm-for","slug":"thanos-a-block-wise-pruning-algorithm-for","title":"Thanos: A Block-wise Pruning Algorithm for Efficient Large Language Model Compression","date":"2025-04-06","arxiv_id":"2504.05346","n_code_links":1,"syntology":null},{"paper":null,"slug":"nemotron-h-a-family-of-accurate-and-efficient","title":"Nemotron-H: A Family of Accurate and Efficient Hybrid Mamba-Transformer Models","date":"2025-04-04","arxiv_id":"2504.03624","n_code_links":0,"syntology":null},{"paper":null,"slug":"learnat-learning-nl2sql-with-ast-guided-task","title":"LearNAT: Learning NL2SQL with AST-guided Task Decomposition for Large Language Models","date":"2025-04-03","arxiv_id":"2504.02327","n_code_links":0,"syntology":null},{"paper":"/paper/scaling-video-language-models-to-10k-frames","slug":"scaling-video-language-models-to-10k-frames","title":"Scaling Video-Language Models to 10K Frames via Hierarchical Differential Distillation","date":"2025-04-03","arxiv_id":"2504.02438","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":2,"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":["steven-ccq/vilamp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"paper":null,"slug":"mdp-multidimensional-vision-model-pruning","title":"MDP: Multidimensional Vision Model Pruning with Latency Constraint","date":"2025-04-02","arxiv_id":"2504.02168","n_code_links":0,"syntology":null},{"paper":null,"slug":"sky-of-unlearning-soul-rewiring-federated","title":"Sky of Unlearning (SoUL): Rewiring Federated Machine Unlearning via Selective Pruning","date":"2025-04-02","arxiv_id":"2504.01705","n_code_links":0,"syntology":null},{"paper":"/paper/thinkprune-pruning-long-chain-of-thought-of","slug":"thinkprune-pruning-long-chain-of-thought-of","title":"ThinkPrune: Pruning Long Chain-of-Thought of LLMs via Reinforcement Learning","date":"2025-04-02","arxiv_id":"2504.01296","n_code_links":1,"syntology":{"ran":5,"of":10,"n_ran_checked":3,"n_instrument":2,"unverified":5,"pointer_only":0,"phrase":"5 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; 2 where Syntology's instrument failed) · 5 unverified","official":{"repos":["UCSB-NLP-Chang/ThinkPrune"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/token-pruning-in-audio-transformers","slug":"token-pruning-in-audio-transformers","title":"Token Pruning in Audio Transformers: Optimizing Performance and Decoding Patch Importance","date":"2025-04-02","arxiv_id":"2504.01690","n_code_links":1,"syntology":null},{"paper":null,"slug":"when-reasoning-meets-compression-benchmarking","title":"When Reasoning Meets Compression: Benchmarking Compressed Large Reasoning Models on Complex Reasoning Tasks","date":"2025-04-02","arxiv_id":"2504.02010","n_code_links":0,"syntology":null},{"paper":null,"slug":"fedpai-achieving-extreme-sparsity-in","title":"FedPaI: Achieving Extreme Sparsity in Federated Learning via Pruning at Initialization","date":"2025-04-01","arxiv_id":"2504.00308","n_code_links":0,"syntology":null},{"paper":null,"slug":"geometric-median-matching-for-robust-k-subset","title":"Geometric Median Matching for Robust k-Subset Selection from Noisy Data","date":"2025-04-01","arxiv_id":"2504.00564","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-pruning-for-3d-scene-reconstruction","title":"Neural Pruning for 3D Scene Reconstruction: Efficient NeRF Acceleration","date":"2025-04-01","arxiv_id":"2504.00950","n_code_links":0,"syntology":null},{"paper":null,"slug":"local-information-matters-inference","title":"Local Information Matters: Inference Acceleration For Grounded Conversation Generation Models Through Adaptive Local-Aware Token Pruning","date":"2025-03-31","arxiv_id":"2503.23959","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-hemorrhage-and-the-robustness-limits-of","title":"Model Hemorrhage and the Robustness Limits of Large Language Models","date":"2025-03-31","arxiv_id":"2503.23924","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-token-compression-for-vision","slug":"efficient-token-compression-for-vision","title":"Efficient Token Compression for Vision Transformer with Spatial Information Preserved","date":"2025-03-30","arxiv_id":"2503.23455","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":13,"n_instrument":0,"unverified":1,"pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["nust-machine-intelligence-laboratory/prune_and_merge"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/fastvar-linear-visual-autoregressive-modeling","slug":"fastvar-linear-visual-autoregressive-modeling","title":"FastVAR: Linear Visual Autoregressive Modeling via Cached Token Pruning","date":"2025-03-30","arxiv_id":"2503.23367","n_code_links":1,"syntology":{"ran":11,"of":14,"n_ran_checked":11,"n_instrument":0,"unverified":3,"pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["csguoh/fastvar"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/reinforcement-learning-based-token-pruning-in","slug":"reinforcement-learning-based-token-pruning-in","title":"Reinforcement Learning-based Token Pruning in Vision Transformers: A Markov Game Approach","date":"2025-03-30","arxiv_id":"2503.23459","n_code_links":1,"syntology":null},{"paper":"/paper/cosil-software-issue-localization-via-llm","slug":"cosil-software-issue-localization-via-llm","title":"CoSIL: Software Issue Localization via LLM-Driven Code Repository Graph Searching","date":"2025-03-28","arxiv_id":"2503.22424","n_code_links":1,"syntology":null},{"paper":"/paper/cppo-accelerating-the-training-of-group","slug":"cppo-accelerating-the-training-of-group","title":"CPPO: Accelerating the Training of Group Relative Policy Optimization-Based Reasoning Models","date":"2025-03-28","arxiv_id":"2503.22342","n_code_links":1,"syntology":{"ran":8,"of":13,"n_ran_checked":5,"n_instrument":3,"unverified":5,"pointer_only":1,"phrase":"8 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; 3 where Syntology's instrument failed) · 5 unverified","official":{"repos":["lzhxmu/cppo"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"learnable-cut-flow","title":"Learnable cut flow","date":"2025-03-28","arxiv_id":"2503.22498","n_code_links":0,"syntology":null},{"paper":"/paper/stade-standard-deviation-as-a-pruning-metric","slug":"stade-standard-deviation-as-a-pruning-metric","title":"STADE: Standard Deviation as a Pruning Metric","date":"2025-03-28","arxiv_id":"2503.22451","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-71-2-m-w-speech-recognition-accelerator","title":"A 71.2-$μ$W Speech Recognition Accelerator with Recurrent Spiking Neural Network","date":"2025-03-27","arxiv_id":"2503.21337","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-low-power-streaming-speech-enhancement","title":"A Low-Power Streaming Speech Enhancement Accelerator For Edge Devices","date":"2025-03-27","arxiv_id":"2503.21335","n_code_links":0,"syntology":null},{"paper":"/paper/as-easy-as-pie-understanding-when-pruning","slug":"as-easy-as-pie-understanding-when-pruning","title":"As easy as PIE: understanding when pruning causes language models to disagree","date":"2025-03-27","arxiv_id":"2503.21714","n_code_links":1,"syntology":null},{"paper":"/paper/boosting-large-language-models-with-mask-fine","slug":"boosting-large-language-models-with-mask-fine","title":"Boosting Large Language Models with Mask Fine-Tuning","date":"2025-03-27","arxiv_id":"2503.22764","n_code_links":1,"syntology":null},{"paper":null,"slug":"neuroplasticity-in-artificial-intelligence-an","title":"Neuroplasticity in Artificial Intelligence -- An Overview and Inspirations on Drop In & Out Learning","date":"2025-03-27","arxiv_id":"2503.21419","n_code_links":0,"syntology":null},{"paper":null,"slug":"sparse-bayesian-learning-for-label-efficiency","title":"Sparse Bayesian Learning for Label Efficiency in Cardiac Real-Time MRI","date":"2025-03-27","arxiv_id":"2503.21443","n_code_links":0,"syntology":null},{"paper":null,"slug":"atp-adaptive-threshold-pruning-for-efficient","title":"ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networks","date":"2025-03-26","arxiv_id":"2503.21815","n_code_links":0,"syntology":null},{"paper":"/paper/beyond-intermediate-states-explaining-visual","slug":"beyond-intermediate-states-explaining-visual","title":"Beyond Intermediate States: Explaining Visual Redundancy through Language","date":"2025-03-26","arxiv_id":"2503.20540","n_code_links":1,"syntology":null},{"paper":null,"slug":"lipschitz-constant-meets-condition-number","title":"Lipschitz Constant Meets Condition Number: Learning Robust and Compact Deep Neural Networks","date":"2025-03-26","arxiv_id":"2503.20454","n_code_links":0,"syntology":null},{"paper":"/paper/surgeon-memory-adaptive-fully-test-time","slug":"surgeon-memory-adaptive-fully-test-time","title":"SURGEON: Memory-Adaptive Fully Test-Time Adaptation via Dynamic Activation Sparsity","date":"2025-03-26","arxiv_id":"2503.20354","n_code_links":1,"syntology":{"ran":15,"of":19,"n_ran_checked":10,"n_instrument":5,"unverified":4,"pointer_only":19,"phrase":"15 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 5 honoured, 1 violated, 4 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":null,"slug":"kshseek-data-driven-approaches-to-mitigating","title":"KSHSeek: Data-Driven Approaches to Mitigating and Detecting Knowledge-Shortcut Hallucinations in Generative Models","date":"2025-03-25","arxiv_id":"2503.19482","n_code_links":0,"syntology":null},{"paper":null,"slug":"mindfullime-a-stable-solution-for","title":"MindfulLIME: A Stable Solution for Explanations of Machine Learning Models with Enhanced Localization Precision -- A Medical Image Case Study","date":"2025-03-25","arxiv_id":"2503.20758","n_code_links":0,"syntology":null},{"paper":"/paper/scaling-vision-pre-training-to-4k-resolution","slug":"scaling-vision-pre-training-to-4k-resolution","title":"Scaling Vision Pre-Training to 4K Resolution","date":"2025-03-25","arxiv_id":"2503.19903","n_code_links":2,"syntology":{"ran":11,"of":14,"n_ran_checked":7,"n_instrument":4,"unverified":3,"pointer_only":2,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":null,"slug":"maximum-redundancy-pruning-a-principle-driven","title":"Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMs","date":"2025-03-24","arxiv_id":"2503.18377","n_code_links":0,"syntology":null},{"paper":null,"slug":"nexusgs-sparse-view-synthesis-with-epipolar","title":"NexusGS: Sparse View Synthesis with Epipolar Depth Priors in 3D Gaussian Splatting","date":"2025-03-24","arxiv_id":"2503.18794","n_code_links":0,"syntology":null},{"paper":"/paper/severing-spurious-correlations-with-data","slug":"severing-spurious-correlations-with-data","title":"Severing Spurious Correlations with Data Pruning","date":"2025-03-24","arxiv_id":"2503.18258","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["JEKimLab/ICLR2025_SpuriousDataPruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":null,"slug":"topv-compatible-token-pruning-with-inference","title":"TopV: Compatible Token Pruning with Inference Time Optimization for Fast and Low-Memory Multimodal Vision Language Model","date":"2025-03-24","arxiv_id":"2503.18278","n_code_links":0,"syntology":null},{"paper":null,"slug":"video-xl-pro-reconstructive-token-compression","title":"Video-XL-Pro: Reconstructive Token Compression for Extremely Long Video Understanding","date":"2025-03-24","arxiv_id":"2503.18478","n_code_links":0,"syntology":null},{"paper":null,"slug":"agent-based-models-for-two-stocks-with","title":"Agent-Based Models for Two Stocks with Superhedging","date":"2025-03-23","arxiv_id":"2503.18165","n_code_links":0,"syntology":null},{"paper":null,"slug":"finding-stable-subnetworks-at-initialization","title":"Finding Stable Subnetworks at Initialization with Dataset Distillation","date":"2025-03-23","arxiv_id":"2503.17905","n_code_links":0,"syntology":null},{"paper":null,"slug":"causal-inference-based-transfer-learning-with","title":"Causal Inference based Transfer Learning with LLMs: An Efficient Framework for Industrial RUL Prediction","date":"2025-03-22","arxiv_id":"2503.17686","n_code_links":0,"syntology":null},{"paper":null,"slug":"energy-aware-llms-a-step-towards-sustainable","title":"Energy-Aware LLMs: A step towards sustainable AI for downstream applications","date":"2025-03-22","arxiv_id":"2503.17783","n_code_links":0,"syntology":null},{"paper":null,"slug":"feather-sql-a-lightweight-nl2sql-framework","title":"Feather-SQL: A Lightweight NL2SQL Framework with Dual-Model Collaboration Paradigm for Small Language Models","date":"2025-03-22","arxiv_id":"2503.17811","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-quantization-with-post-training","title":"Improving Quantization with Post-Training Model Expansion","date":"2025-03-21","arxiv_id":"2503.17513","n_code_links":0,"syntology":null},{"paper":null,"slug":"temporal-action-detection-model-compression","title":"Temporal Action Detection Model Compression by Progressive Block Drop","date":"2025-03-21","arxiv_id":"2503.16916","n_code_links":0,"syntology":null},{"paper":null,"slug":"token-dynamics-towards-efficient-and-dynamic","title":"Token Dynamics: Towards Efficient and Dynamic Video Token Representation for Video Large Language Models","date":"2025-03-21","arxiv_id":"2503.16980","n_code_links":0,"syntology":null},{"paper":null,"slug":"1000-fps-4d-gaussian-splatting-for-dynamic","title":"1000+ FPS 4D Gaussian Splatting for Dynamic Scene Rendering","date":"2025-03-20","arxiv_id":"2503.16422","n_code_links":0,"syntology":null},{"paper":null,"slug":"attention-pruning-automated-fairness-repair","title":"Attention Pruning: Automated Fairness Repair of Language Models via Surrogate Simulated Annealing","date":"2025-03-20","arxiv_id":"2503.15815","n_code_links":0,"syntology":null},{"paper":null,"slug":"bezier-splatting-for-fast-and-differentiable","title":"Bézier Splatting for Fast and Differentiable Vector Graphics Rendering","date":"2025-03-20","arxiv_id":"2503.16424","n_code_links":0,"syntology":null},{"paper":"/paper/psa-mil-a-probabilistic-spatial-attention","slug":"psa-mil-a-probabilistic-spatial-attention","title":"PSA-MIL: A Probabilistic Spatial Attention-Based Multiple Instance Learning for Whole Slide Image Classification","date":"2025-03-20","arxiv_id":"2503.16284","n_code_links":1,"syntology":null},{"paper":"/paper/xattention-block-sparse-attention-with","slug":"xattention-block-sparse-attention-with","title":"XAttention: Block Sparse Attention with Antidiagonal Scoring","date":"2025-03-20","arxiv_id":"2503.16428","n_code_links":1,"syntology":null},{"paper":null,"slug":"efficientllava-generalizable-auto-pruning-for","title":"EfficientLLaVA:Generalizable Auto-Pruning for Large Vision-language Models","date":"2025-03-19","arxiv_id":"2503.15369","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-agent-actor-critic-with-harmonic","title":"Multi-Agent Actor-Critic with Harmonic Annealing Pruning for Dynamic Spectrum Access Systems","date":"2025-03-19","arxiv_id":"2503.15172","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-based-tinyml-optimization-of-machine","slug":"pruning-based-tinyml-optimization-of-machine","title":"Pruning-Based TinyML Optimization of Machine Learning Models for Anomaly Detection in Electric Vehicle Charging Infrastructure","date":"2025-03-19","arxiv_id":"2503.14799","n_code_links":1,"syntology":null},{"paper":null,"slug":"bg-triangle-bezier-gaussian-triangle-for-3d","title":"BG-Triangle: Bézier Gaussian Triangle for 3D Vectorization and Rendering","date":"2025-03-18","arxiv_id":"2503.13961","n_code_links":0,"syntology":null},{"paper":null,"slug":"growing-a-twig-to-accelerate-large-vision","title":"Growing a Twig to Accelerate Large Vision-Language Models","date":"2025-03-18","arxiv_id":"2503.14075","n_code_links":0,"syntology":null},{"paper":"/paper/improving-adaptive-density-control-for-3d","slug":"improving-adaptive-density-control-for-3d","title":"Improving Adaptive Density Control for 3D Gaussian Splatting","date":"2025-03-18","arxiv_id":"2503.14274","n_code_links":1,"syntology":null},{"paper":null,"slug":"light4gs-lightweight-compact-4d-gaussian","title":"Light4GS: Lightweight Compact 4D Gaussian Splatting Generation via Context Model","date":"2025-03-18","arxiv_id":"2503.13948","n_code_links":0,"syntology":null},{"paper":"/paper/lifting-the-veil-on-visual-information-flow","slug":"lifting-the-veil-on-visual-information-flow","title":"Lifting the Veil on Visual Information Flow in MLLMs: Unlocking Pathways to Faster Inference","date":"2025-03-17","arxiv_id":"2503.13108","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 4 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) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","official":{"repos":["ustc-hyin/HiMAP"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"optipmb-enhancing-3d-multi-object-tracking","title":"OptiPMB: Enhancing 3D Multi-Object Tracking with Optimized Poisson Multi-Bernoulli Filtering","date":"2025-03-17","arxiv_id":"2503.12968","n_code_links":0,"syntology":null},{"paper":"/paper/ph-decoding-adaptive-foresight-sampling-for","slug":"ph-decoding-adaptive-foresight-sampling-for","title":"$φ$-Decoding: Adaptive Foresight Sampling for Balanced Inference-Time Exploration and Exploitation","date":"2025-03-17","arxiv_id":"2503.13288","n_code_links":2,"syntology":null},{"paper":"/paper/scale-efficient-training-for-large-datasets-1","slug":"scale-efficient-training-for-large-datasets-1","title":"Scale Efficient Training for Large Datasets","date":"2025-03-17","arxiv_id":"2503.13385","n_code_links":1,"syntology":{"ran":3,"of":6,"n_ran_checked":0,"n_instrument":3,"unverified":3,"pointer_only":6,"phrase":"3 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; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["mrazhou/seta"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/sparselut-sparse-connectivity-optimization","slug":"sparselut-sparse-connectivity-optimization","title":"SparseLUT: Sparse Connectivity Optimization for Lookup Table-based Deep Neural Networks","date":"2025-03-17","arxiv_id":"2503.12829","n_code_links":1,"syntology":null},{"paper":"/paper/fastvid-dynamic-density-pruning-for-fast","slug":"fastvid-dynamic-density-pruning-for-fast","title":"FastVID: Dynamic Density Pruning for Fast Video Large Language Models","date":"2025-03-14","arxiv_id":"2503.11187","n_code_links":2,"syntology":{"ran":7,"of":11,"n_ran_checked":1,"n_instrument":6,"unverified":4,"pointer_only":4,"phrase":"7 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; 6 where Syntology's instrument failed) · 4 unverified","official":{"repos":["lunarshen/fastvid"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"paper":null,"slug":"multi-view-node-pruning-for-accurate-graph","title":"Multi-View Node Pruning for Accurate Graph Representation","date":"2025-03-14","arxiv_id":"2503.11737","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantifying-interpretability-in-clip-models","title":"Quantifying Interpretability in CLIP Models with Concept Consistency","date":"2025-03-14","arxiv_id":"2503.11103","n_code_links":0,"syntology":null},{"paper":"/paper/similarity-aware-token-pruning-your-vlm-but","slug":"similarity-aware-token-pruning-your-vlm-but","title":"Similarity-Aware Token Pruning: Your VLM but Faster","date":"2025-03-14","arxiv_id":"2503.11549","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-extreme-pruning-of-llms-with-plug-and","title":"Towards Extreme Pruning of LLMs with Plug-and-Play Mixed Sparsity","date":"2025-03-14","arxiv_id":"2503.11164","n_code_links":0,"syntology":null},{"paper":null,"slug":"amr-transformer-enabling-efficient-long-range","title":"AMR-Transformer: Enabling Efficient Long-range Interaction for Complex Neural Fluid Simulation","date":"2025-03-13","arxiv_id":"2503.10257","n_code_links":0,"syntology":null},{"paper":null,"slug":"attentionrag-attention-guided-context-pruning","title":"AttentionRAG: Attention-Guided Context Pruning in Retrieval-Augmented Generation","date":"2025-03-13","arxiv_id":"2503.10720","n_code_links":0,"syntology":null},{"paper":null,"slug":"declarealigner-a-leap-towards-efficient","title":"DeclareAligner: A Leap Towards Efficient Optimal Alignments for Declarative Process Model Conformance Checking","date":"2025-03-13","arxiv_id":"2503.10479","n_code_links":0,"syntology":null},{"paper":"/paper/keyframe-oriented-vision-token-pruning","slug":"keyframe-oriented-vision-token-pruning","title":"Keyframe-oriented Vision Token Pruning: Enhancing Efficiency of Large Vision Language Models on Long-Form Video Processing","date":"2025-03-13","arxiv_id":"2503.10742","n_code_links":1,"syntology":{"ran":7,"of":10,"n_ran_checked":1,"n_instrument":6,"unverified":3,"pointer_only":3,"phrase":"7 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; 6 where Syntology's instrument failed) · 3 unverified","official":{"repos":["1999Lyd/KVTP"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"roodi-reconstructing-occluded-objects-with","title":"ROODI: Reconstructing Occluded Objects with Denoising Inpainters","date":"2025-03-13","arxiv_id":"2503.10256","n_code_links":0,"syntology":null},{"paper":"/paper/zeromerge-parameter-free-kv-cache-compression","slug":"zeromerge-parameter-free-kv-cache-compression","title":"ZeroMerge: Parameter-Free KV Cache Compression for Memory-Efficient Long-Context LLMs","date":"2025-03-13","arxiv_id":"2503.10714","n_code_links":2,"syntology":null},{"paper":null,"slug":"batch-list-decodable-linear-regression-via","title":"Batch List-Decodable Linear Regression via Higher Moments","date":"2025-03-12","arxiv_id":"2503.09802","n_code_links":0,"syntology":null},{"paper":null,"slug":"tyr-the-pruner-unlocking-accurate-50","title":"Týr-the-Pruner: Unlocking Accurate 50% Structural Pruning for LLMs via Global Sparsity Distribution Optimization","date":"2025-03-12","arxiv_id":"2503.09657","n_code_links":0,"syntology":null},{"paper":"/paper/accelerate-3d-object-detection-models-via","slug":"accelerate-3d-object-detection-models-via","title":"Accelerate 3D Object Detection Models via Zero-Shot Attention Key Pruning","date":"2025-03-11","arxiv_id":"2503.08101","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"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":["iseri27/tg_gbc"],"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"]}}}],"record_sha256":"d22fcab8f30fc53014f99870ca66e780620fdc7bbda06e18742420a0aa70829f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}