{"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/11","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":11,"pages_in_order":39,"rows_per_page":100,"rows":[1001,1100],"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/10","next":"/method/pruning/papers/12","papers":[{"paper":"/paper/scene-graph-generation-in-large-size-vhr","slug":"scene-graph-generation-in-large-size-vhr","title":"STAR: A First-Ever Dataset and A Large-Scale Benchmark for Scene Graph Generation in Large-Size Satellite Imagery","date":"2024-06-13","arxiv_id":"2406.09410","n_code_links":3,"syntology":null},{"paper":null,"slug":"a-generic-layer-pruning-method-for-signal","title":"A Generic Layer Pruning Method for Signal Modulation Recognition Deep Learning Models","date":"2024-06-12","arxiv_id":"2406.07929","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptively-bypassing-vision-transformer","title":"Adaptively Bypassing Vision Transformer Blocks for Efficient Visual Tracking","date":"2024-06-12","arxiv_id":"2406.08037","n_code_links":0,"syntology":null},{"paper":null,"slug":"alps-improved-optimization-for-highly-sparse","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","date":"2024-06-12","arxiv_id":"2406.07831","n_code_links":0,"syntology":null},{"paper":null,"slug":"asymptotic-unbiased-sample-sampling-to-speed","title":"Asymptotic Unbiased Sample Sampling to Speed Up Sharpness-Aware Minimization","date":"2024-06-12","arxiv_id":"2406.08001","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-is-optimal-for-learning-sparse","title":"Pruning is Optimal for Learning Sparse Features in High-Dimensions","date":"2024-06-12","arxiv_id":"2406.08658","n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-model-collapse-scaling-up-with","title":"Beyond Model Collapse: Scaling Up with Synthesized Data Requires Verification","date":"2024-06-11","arxiv_id":"2406.07515","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-tabular-data-optimization-with-a","title":"Enhancing Tabular Data Optimization with a Flexible Graph-based Reinforced Exploration Strategy","date":"2024-06-11","arxiv_id":"2406.07404","n_code_links":0,"syntology":null},{"paper":"/paper/moreaupruner-robust-pruning-of-large-language","slug":"moreaupruner-robust-pruning-of-large-language","title":"MoreauPruner: Robust Pruning of Large Language Models against Weight Perturbations","date":"2024-06-11","arxiv_id":"2406.07017","n_code_links":1,"syntology":null},{"paper":"/paper/geometric-sparsification-in-recurrent-neural","slug":"geometric-sparsification-in-recurrent-neural","title":"Geometric sparsification in recurrent neural networks","date":"2024-06-10","arxiv_id":"2406.06290","n_code_links":1,"syntology":null},{"paper":null,"slug":"corrmae-pre-training-correspondence","title":"CorrMAE: Pre-training Correspondence Transformers with Masked Autoencoder","date":"2024-06-09","arxiv_id":"2406.05773","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-shapley-values-for-attributing","title":"An Efficient Framework for Crediting Data Contributors of Diffusion Models","date":"2024-06-09","arxiv_id":"2407.03153","n_code_links":0,"syntology":null},{"paper":"/paper/federated-lora-with-sparse-communication","slug":"federated-lora-with-sparse-communication","title":"Federated LoRA with Sparse Communication","date":"2024-06-07","arxiv_id":"2406.05233","n_code_links":1,"syntology":null},{"paper":"/paper/optimal-eye-surgeon-finding-image-priors","slug":"optimal-eye-surgeon-finding-image-priors","title":"Optimal Eye Surgeon: Finding Image Priors through Sparse Generators at Initialization","date":"2024-06-07","arxiv_id":"2406.05288","n_code_links":1,"syntology":null},{"paper":"/paper/optimal-recurrent-network-topologies-for","slug":"optimal-recurrent-network-topologies-for","title":"Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction","date":"2024-06-07","arxiv_id":"2406.04934","n_code_links":1,"syntology":null},{"paper":null,"slug":"sexism-detection-on-a-data-diet","title":"Sexism Detection on a Data Diet","date":"2024-06-07","arxiv_id":"2406.04892","n_code_links":0,"syntology":null},{"paper":null,"slug":"vtrans-accelerating-transformer-compression","title":"VTrans: Accelerating Transformer Compression with Variational Information Bottleneck based Pruning","date":"2024-06-07","arxiv_id":"2406.05276","n_code_links":0,"syntology":null},{"paper":null,"slug":"concurrent-training-and-layer-pruning-of-deep","title":"Concurrent Training and Layer Pruning of Deep Neural Networks","date":"2024-06-06","arxiv_id":"2406.04549","n_code_links":0,"syntology":null},{"paper":"/paper/decay-pruning-method-smooth-pruning-with-a","slug":"decay-pruning-method-smooth-pruning-with-a","title":"Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure","date":"2024-06-06","arxiv_id":"2406.03879","n_code_links":1,"syntology":null},{"paper":"/paper/elfs-enhancing-label-free-coreset-selection","slug":"elfs-enhancing-label-free-coreset-selection","title":"ELFS: Enhancing Label-Free Coreset Selection via Clustering-based Pseudo-Labeling","date":"2024-06-06","arxiv_id":"2406.04273","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["eltsai/elfs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/enhancing-in-context-learning-performance","slug":"enhancing-in-context-learning-performance","title":"Enhancing In-Context Learning Performance with just SVD-Based Weight Pruning: A Theoretical Perspective","date":"2024-06-06","arxiv_id":"2406.03768","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["chen123ctrls/enhancingicl_svdpruning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/light-peft-lightening-parameter-efficient","slug":"light-peft-lightening-parameter-efficient","title":"Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruning","date":"2024-06-06","arxiv_id":"2406.03792","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":3,"n_instrument":1,"unverified":2,"pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["gccnlp/light-peft"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"improving-plan-execution-flexibility-using","title":"Improving Plan Execution Flexibility using Block-Substitution","date":"2024-06-05","arxiv_id":"2406.03091","n_code_links":0,"syntology":null},{"paper":"/paper/pruner-zero-evolving-symbolic-pruning-metric","slug":"pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","arxiv_id":"2406.02924","n_code_links":1,"syntology":{"ran":8,"of":17,"n_ran_checked":5,"n_instrument":3,"unverified":9,"pointer_only":2,"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) · 9 unverified","official":{"repos":["pprp/pruner-zero"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":9,"ran_from_kinds":["official"]}}},{"paper":"/paper/branches-a-fast-dynamic-programming-and","slug":"branches-a-fast-dynamic-programming-and","title":"Branches: Efficiently Seeking Optimal Sparse Decision Trees with AO*","date":"2024-06-04","arxiv_id":"2406.02175","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["Chaoukia/branches"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"cyclic-sparse-training-is-it-enough","title":"Cyclic Sparse Training: Is it Enough?","date":"2024-06-04","arxiv_id":"2406.02773","n_code_links":0,"syntology":null},{"paper":null,"slug":"eres2netv2-boosting-short-duration-speaker","title":"ERes2NetV2: Boosting Short-Duration Speaker Verification Performance with Computational Efficiency","date":"2024-06-04","arxiv_id":"2406.02167","n_code_links":0,"syntology":null},{"paper":null,"slug":"linguistic-fingerprint-in-transformer-models","title":"Linguistic Fingerprint in Transformer Models: How Language Variation Influences Parameter Selection in Irony Detection","date":"2024-06-04","arxiv_id":"2406.02338","n_code_links":0,"syntology":null},{"paper":null,"slug":"polynomial-augmented-neural-networks-panns","title":"Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation","date":"2024-06-04","arxiv_id":"2406.02336","n_code_links":0,"syntology":null},{"paper":"/paper/a-new-branch-and-bound-pruning-framework-for","slug":"a-new-branch-and-bound-pruning-framework-for","title":"A New Branch-and-Bound Pruning Framework for $\\ell_0$-Regularized Problems","date":"2024-06-03","arxiv_id":"2406.03504","n_code_links":2,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["TheoGuyard/El0ps"],"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/bmrs-bayesian-model-reduction-for-structured","slug":"bmrs-bayesian-model-reduction-for-structured","title":"BMRS: Bayesian Model Reduction for Structured Pruning","date":"2024-06-03","arxiv_id":"2406.01345","n_code_links":1,"syntology":{"ran":11,"of":11,"n_ran_checked":10,"n_instrument":1,"unverified":0,"pointer_only":11,"phrase":"11 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 9 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["saintslab/bmrs-structured-pruning"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":1,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"dha-learning-decoupled-head-attention-from","title":"DHA: Learning Decoupled-Head Attention from Transformer Checkpoints via Adaptive Heads Fusion","date":"2024-06-03","arxiv_id":"2406.06567","n_code_links":0,"syntology":null},{"paper":null,"slug":"effective-subset-selection-through-the-lens","title":"Effective Subset Selection Through The Lens of Neural Network Pruning","date":"2024-06-03","arxiv_id":"2406.01086","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-behavior-tree-planning-with","slug":"efficient-behavior-tree-planning-with","title":"HBTP: Heuristic Behavior Tree Planning with Large Language Model Reasoning","date":"2024-06-03","arxiv_id":"2406.00965","n_code_links":1,"syntology":null},{"paper":null,"slug":"effiqa-efficient-question-answering-with","title":"EffiQA: Efficient Question-Answering with Strategic Multi-Model Collaboration on Knowledge Graphs","date":"2024-06-03","arxiv_id":"2406.01238","n_code_links":0,"syntology":null},{"paper":"/paper/finding-lottery-tickets-in-vision-models-via","slug":"finding-lottery-tickets-in-vision-models-via","title":"Finding Lottery Tickets in Vision Models via Data-driven Spectral Foresight Pruning","date":"2024-06-03","arxiv_id":"2406.01820","n_code_links":1,"syntology":null},{"paper":null,"slug":"focus-on-the-core-efficient-attention-via","title":"Focus on the Core: Efficient Attention via Pruned Token Compression for Document Classification","date":"2024-06-03","arxiv_id":"2406.01283","n_code_links":0,"syntology":null},{"paper":null,"slug":"toward-efficient-deep-spiking-neuron-networks","title":"Toward Efficient Deep Spiking Neuron Networks:A Survey On Compression","date":"2024-06-03","arxiv_id":"2407.08744","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-efficient-deep-spiking-neural","title":"Towards Efficient Deep Spiking Neural Networks Construction with Spiking Activity based Pruning","date":"2024-06-03","arxiv_id":"2406.01072","n_code_links":0,"syntology":null},{"paper":null,"slug":"prunerf-segment-centric-dataset-pruning-via","title":"PruNeRF: Segment-Centric Dataset Pruning via 3D Spatial Consistency","date":"2024-06-02","arxiv_id":"2406.00798","n_code_links":0,"syntology":null},{"paper":null,"slug":"memorized-images-in-diffusion-models-share-a","title":"Memorized Images in Diffusion Models share a Subspace that can be Located and Deleted","date":"2024-06-01","arxiv_id":"2406.18566","n_code_links":0,"syntology":null},{"paper":"/paper/spafl-communication-efficient-federated","slug":"spafl-communication-efficient-federated","title":"SpaFL: Communication-Efficient Federated Learning with Sparse Models and Low computational Overhead","date":"2024-06-01","arxiv_id":"2406.00431","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":4,"n_instrument":0,"unverified":4,"pointer_only":8,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["news-vt/spafl_neruips_2024"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"automatic-channel-pruning-for-multi-head","title":"Automatic Channel Pruning for Multi-Head Attention","date":"2024-05-31","arxiv_id":"2405.20867","n_code_links":0,"syntology":null},{"paper":null,"slug":"investigating-calibration-and-corruption","title":"Investigating Calibration and Corruption Robustness of Post-hoc Pruned Perception CNNs: An Image Classification Benchmark Study","date":"2024-05-31","arxiv_id":"2405.20876","n_code_links":0,"syntology":null},{"paper":null,"slug":"prune-at-the-clients-not-the-server","title":"Sparse-ProxSkip: Accelerated Sparse-to-Sparse Training in Federated Learning","date":"2024-05-31","arxiv_id":"2405.20623","n_code_links":0,"syntology":null},{"paper":null,"slug":"self-degraded-contrastive-domain-adaptation","title":"Self-degraded contrastive domain adaptation for industrial fault diagnosis with bi-imbalanced data","date":"2024-05-31","arxiv_id":"2405.20700","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-earlybird-gets-the-worm-heuristically","title":"The EarlyBird Gets the WORM: Heuristically Accelerating EarlyBird Convergence","date":"2024-05-31","arxiv_id":"2406.11872","n_code_links":0,"syntology":null},{"paper":null,"slug":"dual-sparse-training-framework-inducing","title":"Dual sparse training framework: inducing activation map sparsity via Transformed $\\ell1$ regularization","date":"2024-05-30","arxiv_id":"2405.19652","n_code_links":0,"syntology":null},{"paper":null,"slug":"gaussianroom-improving-3d-gaussian-splatting","title":"GaussianRoom: Improving 3D Gaussian Splatting with SDF Guidance and Monocular Cues for Indoor Scene Reconstruction","date":"2024-05-30","arxiv_id":"2405.19671","n_code_links":0,"syntology":null},{"paper":"/paper/occam-gradient-descent","slug":"occam-gradient-descent","title":"Occam Gradient Descent","date":"2024-05-30","arxiv_id":"2405.20194","n_code_links":1,"syntology":null},{"paper":null,"slug":"perplexed-by-perplexity-perplexity-based-data","title":"Perplexed by Perplexity: Perplexity-Based Data Pruning With Small Reference Models","date":"2024-05-30","arxiv_id":"2405.20541","n_code_links":0,"syntology":null},{"paper":null,"slug":"unveiling-and-mitigating-backdoor","title":"Unveiling and Mitigating Backdoor Vulnerabilities based on Unlearning Weight Changes and Backdoor Activeness","date":"2024-05-30","arxiv_id":"2405.20291","n_code_links":0,"syntology":null},{"paper":"/paper/conceptprune-concept-editing-in-diffusion","slug":"conceptprune-concept-editing-in-diffusion","title":"ConceptPrune: Concept Editing in Diffusion Models via Skilled Neuron Pruning","date":"2024-05-29","arxiv_id":"2405.19237","n_code_links":2,"syntology":null},{"paper":null,"slug":"critical-learning-periods-leveraging-early","title":"Critical Learning Periods: Leveraging Early Training Dynamics for Efficient Data Pruning","date":"2024-05-29","arxiv_id":"2405.19462","n_code_links":0,"syntology":null},{"paper":null,"slug":"lp-3dgs-learning-to-prune-3d-gaussian","title":"LP-3DGS: Learning to Prune 3D Gaussian Splatting","date":"2024-05-29","arxiv_id":"2405.18784","n_code_links":0,"syntology":null},{"paper":null,"slug":"stat-shrinking-transformers-after-training","title":"STAT: Shrinking Transformers After Training","date":"2024-05-29","arxiv_id":"2406.00061","n_code_links":0,"syntology":null},{"paper":"/paper/unipts-a-unified-framework-for-proficient","slug":"unipts-a-unified-framework-for-proficient","title":"UniPTS: A Unified Framework for Proficient Post-Training Sparsity","date":"2024-05-29","arxiv_id":"2405.18810","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-network-pruning-a-comparative-study-on","title":"Deep Network Pruning: A Comparative Study on CNNs in Face Recognition","date":"2024-05-28","arxiv_id":"2405.18302","n_code_links":0,"syntology":null},{"paper":null,"slug":"finercut-finer-grained-interpretable-layer","title":"FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Models","date":"2024-05-28","arxiv_id":"2405.18218","n_code_links":0,"syntology":null},{"paper":null,"slug":"llama-nas-efficient-neural-architecture","title":"LLaMA-NAS: Efficient Neural Architecture Search for Large Language Models","date":"2024-05-28","arxiv_id":"2405.18377","n_code_links":0,"syntology":null},{"paper":null,"slug":"magnitude-based-neuron-pruning-for-backdoor","title":"Magnitude-based Neuron Pruning for Backdoor Defens","date":"2024-05-28","arxiv_id":"2405.17750","n_code_links":0,"syntology":null},{"paper":null,"slug":"rethinking-pruning-for-backdoor-mitigation-an","title":"Rethinking Pruning for Backdoor Mitigation: An Optimization Perspective","date":"2024-05-28","arxiv_id":"2405.17746","n_code_links":0,"syntology":null},{"paper":"/paper/safeguardgs-3d-gaussian-primitive-pruning","slug":"safeguardgs-3d-gaussian-primitive-pruning","title":"SafeguardGS: 3D Gaussian Primitive Pruning While Avoiding Catastrophic Scene Destruction","date":"2024-05-28","arxiv_id":"2405.17793","n_code_links":1,"syntology":null},{"paper":"/paper/slmrec-empowering-small-language-models-for","slug":"slmrec-empowering-small-language-models-for","title":"SLMRec: Distilling Large Language Models into Small for Sequential Recommendation","date":"2024-05-28","arxiv_id":"2405.17890","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":3,"phrase":"0 ran · 3 unverified","official":{"repos":["wujiangxu/slmrec"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"paper":"/paper/chess-contextual-harnessing-for-efficient-sql","slug":"chess-contextual-harnessing-for-efficient-sql","title":"CHESS: Contextual Harnessing for Efficient SQL Synthesis","date":"2024-05-27","arxiv_id":"2405.16755","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":6,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["shayantalaei/chess"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/dora-enhancing-parameter-efficient-fine","slug":"dora-enhancing-parameter-efficient-fine","title":"DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution","date":"2024-05-27","arxiv_id":"2405.17357","n_code_links":4,"syntology":null},{"paper":"/paper/effective-layer-pruning-through-similarity","slug":"effective-layer-pruning-through-similarity","title":"Effective Layer Pruning Through Similarity Metric Perspective","date":"2024-05-27","arxiv_id":"2405.17081","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-provably-effective-method-for-pruning","title":"A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts","date":"2024-05-26","arxiv_id":"2405.16646","n_code_links":0,"syntology":null},{"paper":"/paper/grag-graph-retrieval-augmented-generation","slug":"grag-graph-retrieval-augmented-generation","title":"GRAG: Graph Retrieval-Augmented Generation","date":"2024-05-26","arxiv_id":"2405.16506","n_code_links":1,"syntology":null},{"paper":null,"slug":"subspace-node-pruning","title":"Subspace Node Pruning","date":"2024-05-26","arxiv_id":"2405.17506","n_code_links":0,"syntology":null},{"paper":"/paper/spp-sparsity-preserved-parameter-efficient","slug":"spp-sparsity-preserved-parameter-efficient","title":"SPP: Sparsity-Preserved Parameter-Efficient Fine-Tuning for Large Language Models","date":"2024-05-25","arxiv_id":"2405.16057","n_code_links":1,"syntology":null},{"paper":"/paper/dissecting-the-interplay-of-attention-paths","slug":"dissecting-the-interplay-of-attention-paths","title":"Dissecting the Interplay of Attention Paths in a Statistical Mechanics Theory of Transformers","date":"2024-05-24","arxiv_id":"2405.15926","n_code_links":1,"syntology":null},{"paper":null,"slug":"large-language-model-pruning","title":"Large Language Model Pruning","date":"2024-05-24","arxiv_id":"2406.00030","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-accurate-and-interpretable-tree","title":"Learning accurate and interpretable tree-based models","date":"2024-05-24","arxiv_id":"2405.15911","n_code_links":0,"syntology":null},{"paper":"/paper/graph-sparsification-via-mixture-of-graphs","slug":"graph-sparsification-via-mixture-of-graphs","title":"Graph Sparsification via Mixture of Graphs","date":"2024-05-23","arxiv_id":"2405.14260","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yanweiyue/mog"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"path-metrics-pruning-and-generalization","title":"A rescaling-invariant Lipschitz bound based on path-metrics for modern ReLU network parameterizations","date":"2024-05-23","arxiv_id":"2405.15006","n_code_links":0,"syntology":null},{"paper":"/paper/privcirnet-efficient-private-inference-via","slug":"privcirnet-efficient-private-inference-via","title":"PrivCirNet: Efficient Private Inference via Block Circulant Transformation","date":"2024-05-23","arxiv_id":"2405.14569","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["tianshi-xu/privcirnet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"real-time-deep-learning-weapon-detection","title":"Real Time Deep Learning Weapon Detection Techniques for Mitigating Lone Wolf Attacks","date":"2024-05-23","arxiv_id":"2405.14148","n_code_links":0,"syntology":null},{"paper":null,"slug":"gs-ror-3d-gaussian-splatting-for-reflective","title":"GS-ROR$^2$: Bidirectional-guided 3DGS and SDF for Reflective Object Relighting and Reconstruction","date":"2024-05-22","arxiv_id":"2406.18544","n_code_links":0,"syntology":null},{"paper":null,"slug":"combining-relevance-and-magnitude-for","title":"Combining Relevance and Magnitude for Resource-Aware DNN Pruning","date":"2024-05-21","arxiv_id":"2405.13088","n_code_links":0,"syntology":null},{"paper":null,"slug":"explaining-expert-search-and-team-formation","title":"Explaining Expert Search and Team Formation Systems with ExES","date":"2024-05-21","arxiv_id":"2405.12881","n_code_links":0,"syntology":null},{"paper":"/paper/pyramidinfer-pyramid-kv-cache-compression-for","slug":"pyramidinfer-pyramid-kv-cache-compression-for","title":"PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference","date":"2024-05-21","arxiv_id":"2405.12532","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"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) · 0 unverified","official":null}},{"paper":null,"slug":"distill-then-prune-an-efficient-compression","title":"Distill-then-prune: An Efficient Compression Framework for Real-time Stereo Matching Network on Edge Devices","date":"2024-05-20","arxiv_id":"2405.11809","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-graph-pruning-for-recommendation","title":"Knowledge Graph Pruning for Recommendation","date":"2024-05-19","arxiv_id":"2405.11531","n_code_links":0,"syntology":null},{"paper":null,"slug":"cost-effective-fault-tolerance-for-cnns-using","title":"Cost-Effective Fault Tolerance for CNNs Using Parameter Vulnerability Based Hardening and Pruning","date":"2024-05-17","arxiv_id":"2405.10658","n_code_links":0,"syntology":null},{"paper":null,"slug":"feature-based-low-rank-compression-of-large","title":"Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimization","date":"2024-05-17","arxiv_id":"2405.10616","n_code_links":0,"syntology":null},{"paper":"/paper/automated-federated-learning-via-informed","slug":"automated-federated-learning-via-informed","title":"Federated Hybrid Model Pruning through Loss Landscape Exploration","date":"2024-05-16","arxiv_id":"2405.10271","n_code_links":1,"syntology":null},{"paper":"/paper/hw-gpt-bench-hardware-aware-architecture","slug":"hw-gpt-bench-hardware-aware-architecture","title":"HW-GPT-Bench: Hardware-Aware Architecture Benchmark for Language Models","date":"2024-05-16","arxiv_id":"2405.10299","n_code_links":2,"syntology":null},{"paper":null,"slug":"a-robust-uav-based-approach-for-power","title":"A Robust UAV-Based Approach for Power-Modulated Jammer Localization Using DoA","date":"2024-05-15","arxiv_id":"2405.09245","n_code_links":0,"syntology":null},{"paper":"/paper/phylotrack-c-and-python-libraries-for-in","slug":"phylotrack-c-and-python-libraries-for-in","title":"Phylotrack: C++ and Python libraries for in silico phylogenetic tracking","date":"2024-05-15","arxiv_id":"2405.09389","n_code_links":1,"syntology":null},{"paper":"/paper/achieving-fairness-through-channel-pruning","slug":"achieving-fairness-through-channel-pruning","title":"Achieving Fairness Through Channel Pruning for Dermatological Disease Diagnosis","date":"2024-05-14","arxiv_id":"2405.08681","n_code_links":1,"syntology":null},{"paper":"/paper/scalable-sparse-regression-for-model","slug":"scalable-sparse-regression-for-model","title":"Scalable Sparse Regression for Model Discovery: The Fast Lane to Insight","date":"2024-05-14","arxiv_id":"2405.09579","n_code_links":2,"syntology":null},{"paper":null,"slug":"neural-network-compression-for-reinforcement","title":"Neural Network Compression for Reinforcement Learning Tasks","date":"2024-05-13","arxiv_id":"2405.07748","n_code_links":0,"syntology":null},{"paper":null,"slug":"rage-against-the-machine-retrieval-augmented","title":"RAGE Against the Machine: Retrieval-Augmented LLM Explanations","date":"2024-05-11","arxiv_id":"2405.13000","n_code_links":0,"syntology":null},{"paper":null,"slug":"characterizing-the-accuracy-efficiency-trade","title":"Characterizing the Accuracy -- Efficiency Trade-off of Low-rank Decomposition in Language Models","date":"2024-05-10","arxiv_id":"2405.06626","n_code_links":0,"syntology":null},{"paper":null,"slug":"pruning-as-a-domain-specific-llm-extractor","title":"Pruning as a Domain-specific LLM Extractor","date":"2024-05-10","arxiv_id":"2405.06275","n_code_links":0,"syntology":null},{"paper":null,"slug":"puma-margin-based-data-pruning","title":"PUMA: margin-based data pruning","date":"2024-05-10","arxiv_id":"2405.06298","n_code_links":0,"syntology":null},{"paper":"/paper/a-multi-level-superoptimizer-for-tensor","slug":"a-multi-level-superoptimizer-for-tensor","title":"Mirage: A Multi-Level Superoptimizer for Tensor Programs","date":"2024-05-09","arxiv_id":"2405.05751","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":8,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["mirage-project/mirage"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"approximate-dec-pomdp-solving-using-multi","title":"Approximate Dec-POMDP Solving Using Multi-Agent A*","date":"2024-05-09","arxiv_id":"2405.05662","n_code_links":0,"syntology":null},{"paper":"/paper/openba-v2-reaching-77-3-high-compression","slug":"openba-v2-reaching-77-3-high-compression","title":"OpenBA-V2: Reaching 77.3% High Compression Ratio with Fast Multi-Stage Pruning","date":"2024-05-09","arxiv_id":"2405.05957","n_code_links":1,"syntology":null}],"record_sha256":"f9bdff1b3724939a1e732b0ef54550a56eba56f211283e69cf2ac528e1d229cc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}