{"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/14","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":14,"pages_in_order":39,"rows_per_page":100,"rows":[1301,1400],"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/13","next":"/method/pruning/papers/15","papers":[{"paper":"/paper/apt-adaptive-pruning-and-tuning-pretrained","slug":"apt-adaptive-pruning-and-tuning-pretrained","title":"APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inference","date":"2024-01-22","arxiv_id":"2401.12200","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":5,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["roim1998/apt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"knowledge-distillation-on-spatial-temporal","title":"Knowledge Distillation on Spatial-Temporal Graph Convolutional Network for Traffic Prediction","date":"2024-01-22","arxiv_id":"2401.11798","n_code_links":0,"syntology":null},{"paper":null,"slug":"zero-space-cost-fault-tolerance-for","title":"Zero-Space Cost Fault Tolerance for Transformer-based Language Models on ReRAM","date":"2024-01-22","arxiv_id":"2401.11664","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-betweenness-clustering-for-semi","title":"Adaptive Betweenness Clustering for Semi-Supervised Domain Adaptation","date":"2024-01-21","arxiv_id":"2401.11448","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-detection-of-non-overlapping-images","title":"Image detection using combinatorial auction","date":"2024-01-21","arxiv_id":"2401.11413","n_code_links":0,"syntology":null},{"paper":null,"slug":"prilora-pruned-and-rank-increasing-low-rank","title":"PRILoRA: Pruned and Rank-Increasing Low-Rank Adaptation","date":"2024-01-20","arxiv_id":"2401.11316","n_code_links":0,"syntology":null},{"paper":null,"slug":"spatial-temporal-demand-clustering-for","title":"Spatial-temporal-demand clustering for solving large-scale vehicle routing problems with time windows","date":"2024-01-20","arxiv_id":"2402.00041","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-scalability-in-recommender-systems","title":"Enhancing Scalability in Recommender Systems through Lottery Ticket Hypothesis and Knowledge Distillation-based Neural Network Pruning","date":"2024-01-19","arxiv_id":"2401.10484","n_code_links":0,"syntology":null},{"paper":"/paper/pruning-for-protection-increasing-jailbreak","slug":"pruning-for-protection-increasing-jailbreak","title":"Pruning for Protection: Increasing Jailbreak Resistance in Aligned LLMs Without Fine-Tuning","date":"2024-01-19","arxiv_id":"2401.10862","n_code_links":1,"syntology":null},{"paper":"/paper/symbolnet-neural-symbolic-regression-with","slug":"symbolnet-neural-symbolic-regression-with","title":"SymbolNet: Neural Symbolic Regression with Adaptive Dynamic Pruning for Compression","date":"2024-01-18","arxiv_id":"2401.09949","n_code_links":1,"syntology":null},{"paper":null,"slug":"tiny-multi-agent-drl-for-twins-migration-in","title":"Tiny Multi-Agent DRL for Twins Migration in UAV Metaverses: A Multi-Leader Multi-Follower Stackelberg Game Approach","date":"2024-01-18","arxiv_id":"2401.09680","n_code_links":0,"syntology":null},{"paper":null,"slug":"dtmm-deploying-tinyml-models-on-extremely","title":"DTMM: Deploying TinyML Models on Extremely Weak IoT Devices with Pruning","date":"2024-01-17","arxiv_id":"2401.09068","n_code_links":0,"syntology":null},{"paper":null,"slug":"ppr-enhancing-dodging-attacks-while","title":"Rethinking Impersonation and Dodging Attacks on Face Recognition Systems","date":"2024-01-17","arxiv_id":"2401.08903","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-subnetwork-annealing-a","title":"Stochastic Subnetwork Annealing: A Regularization Technique for Fine Tuning Pruned Subnetworks","date":"2024-01-16","arxiv_id":"2401.08830","n_code_links":0,"syntology":null},{"paper":null,"slug":"three-ways-that-non-differentiability-affects","title":"GD doesn't make the cut: Three ways that non-differentiability affects neural network training","date":"2024-01-16","arxiv_id":"2401.08426","n_code_links":0,"syntology":null},{"paper":"/paper/a-deep-hierarchical-feature-sparse-framework","slug":"a-deep-hierarchical-feature-sparse-framework","title":"A Deep Hierarchical Feature Sparse Framework for Occluded Person Re-Identification","date":"2024-01-15","arxiv_id":"2401.07469","n_code_links":0,"syntology":null},{"paper":null,"slug":"edge-enabled-anomaly-detection-and","title":"Edge-Enabled Anomaly Detection and Information Completion for Social Network Knowledge Graphs","date":"2024-01-13","arxiv_id":"2401.07022","n_code_links":0,"syntology":null},{"paper":null,"slug":"updp-a-unified-progressive-depth-pruner-for","title":"UPDP: A Unified Progressive Depth Pruner for CNN and Vision Transformer","date":"2024-01-12","arxiv_id":"2401.06426","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-lightweight-feature-fusion-architecture-for","title":"A Lightweight Feature Fusion Architecture For Resource-Constrained Crowd Counting","date":"2024-01-11","arxiv_id":"2401.05968","n_code_links":0,"syntology":null},{"paper":null,"slug":"esacl-efficient-continual-learning-of-sparse","title":"EsaCL: Efficient Continual Learning of Sparse Models","date":"2024-01-11","arxiv_id":"2401.05667","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-the-accuracy-and-interpretability-1","title":"Theoretical and Empirical Advances in Forest Pruning","date":"2024-01-10","arxiv_id":"2401.05535","n_code_links":0,"syntology":null},{"paper":"/paper/quantumsea-in-time-sparse-exploration-for","slug":"quantumsea-in-time-sparse-exploration-for","title":"QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits","date":"2024-01-10","arxiv_id":"2401.05571","n_code_links":1,"syntology":null},{"paper":"/paper/effective-pruning-of-web-scale-datasets-based","slug":"effective-pruning-of-web-scale-datasets-based","title":"Effective pruning of web-scale datasets based on complexity of concept clusters","date":"2024-01-09","arxiv_id":"2401.04578","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":["amro-kamal/effective_pruning"],"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":"fine-grained-embedding-dimension-optimization","title":"Fine-Grained Embedding Dimension Optimization During Training for Recommender Systems","date":"2024-01-09","arxiv_id":"2401.04408","n_code_links":0,"syntology":null},{"paper":"/paper/bclnet-bilateral-consensus-learning-for-two","slug":"bclnet-bilateral-consensus-learning-for-two","title":"BCLNet: Bilateral Consensus Learning for Two-View Correspondence Pruning","date":"2024-01-07","arxiv_id":"2401.03459","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-physics-guided-generative-ai-toolkit-for","title":"A Physics-guided Generative AI Toolkit for Geophysical Monitoring","date":"2024-01-06","arxiv_id":"2401.03131","n_code_links":0,"syntology":null},{"paper":"/paper/hyperparameter-free-approach-for-faster","slug":"hyperparameter-free-approach-for-faster","title":"Hyperparameter-Free Approach for Faster Minimum Bayes Risk Decoding","date":"2024-01-05","arxiv_id":"2401.02749","n_code_links":1,"syntology":null},{"paper":null,"slug":"coss-co-optimizing-sensor-and-sampling-rate","title":"CoSS: Co-optimizing Sensor and Sampling Rate for Data-Efficient AI in Human Activity Recognition","date":"2024-01-03","arxiv_id":"2401.05426","n_code_links":0,"syntology":null},{"paper":null,"slug":"dataset-difficulty-and-the-role-of-inductive","title":"Dataset Difficulty and the Role of Inductive Bias","date":"2024-01-03","arxiv_id":"2401.01867","n_code_links":0,"syntology":null},{"paper":"/paper/large-language-models-relearn-removed","slug":"large-language-models-relearn-removed","title":"Large Language Models Relearn Removed Concepts","date":"2024-01-03","arxiv_id":"2401.01814","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"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) · 1 unverified","official":{"repos":["fbarez/neuroplasticity"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"bilevelpruning-unified-dynamic-and-static","title":"BilevelPruning: Unified Dynamic and Static Channel Pruning for Convolutional Neural Networks","date":"2024-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/cakdp-category-aware-knowledge-distillation","slug":"cakdp-category-aware-knowledge-distillation","title":"CaKDP: Category-aware Knowledge Distillation and Pruning Framework for Lightweight 3D Object Detection","date":"2024-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/device-wise-federated-network-pruning","slug":"device-wise-federated-network-pruning","title":"Device-Wise Federated Network Pruning","date":"2024-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/fast-and-optimal-weight-update-for-pruned","slug":"fast-and-optimal-weight-update-for-pruned","title":"Fast and Effective Weight Update for Pruned Large Language Models","date":"2024-01-01","arxiv_id":"2401.02938","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":2,"n_instrument":1,"unverified":5,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["fmfi-compbio/admm-pruning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/machine-translation-testing-via-syntactic","slug":"machine-translation-testing-via-syntactic","title":"Machine Translation Testing via Syntactic Tree Pruning","date":"2024-01-01","arxiv_id":"2401.00751","n_code_links":1,"syntology":null},{"paper":"/paper/online-task-free-continual-generative-and","slug":"online-task-free-continual-generative-and","title":"Online Task-Free Continual Generative and Discriminative Learning via Dynamic Cluster Memory","date":"2024-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/resource-efficient-transformer-pruning-for","slug":"resource-efficient-transformer-pruning-for","title":"Resource-Efficient Transformer Pruning for Finetuning of Large Models","date":"2024-01-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"sheared-backpropagation-for-fine-tuning","title":"Sheared Backpropagation for Fine-tuning Foundation Models","date":"2024-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"one-shot-multi-rate-pruning-of-graph","title":"One-Shot Multi-Rate Pruning of Graph Convolutional Networks","date":"2023-12-29","arxiv_id":"2312.17615","n_code_links":0,"syntology":null},{"paper":null,"slug":"block-pruning-for-enhanced-efficiency-in","title":"Block Pruning for Enhanced Efficiency in Convolutional Neural Networks","date":"2023-12-28","arxiv_id":"2312.16904","n_code_links":0,"syntology":null},{"paper":"/paper/the-llm-surgeon","slug":"the-llm-surgeon","title":"The LLM Surgeon","date":"2023-12-28","arxiv_id":"2312.17244","n_code_links":1,"syntology":{"ran":4,"of":10,"n_ran_checked":4,"n_instrument":0,"unverified":6,"pointer_only":10,"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) · 6 unverified","official":{"repos":["qualcomm-ai-research/llm-surgeon"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/graph-context-transformation-learning-for","slug":"graph-context-transformation-learning-for","title":"Graph Context Transformation Learning for Progressive Correspondence Pruning","date":"2023-12-26","arxiv_id":"2312.15971","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-neural-pruning-with-gradient-sampling","title":"Robust Neural Pruning with Gradient Sampling Optimization for Residual Neural Networks","date":"2023-12-26","arxiv_id":"2312.16020","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-sdm-accelerating-stable-diffusion-through","title":"A-SDM: Accelerating Stable Diffusion through Redundancy Removal and Performance Optimization","date":"2023-12-24","arxiv_id":"2312.15516","n_code_links":0,"syntology":null},{"paper":"/paper/fairness-aware-structured-pruning-in","slug":"fairness-aware-structured-pruning-in","title":"Fairness-Aware Structured Pruning in Transformers","date":"2023-12-24","arxiv_id":"2312.15398","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":{"repos":["chandar-lab/fasp"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":null,"slug":"hardware-aware-dnn-compression-via-diverse","title":"Hardware-Aware DNN Compression via Diverse Pruning and Mixed-Precision Quantization","date":"2023-12-23","arxiv_id":"2312.15322","n_code_links":0,"syntology":null},{"paper":"/paper/perp-rethinking-the-prune-retrain-paradigm-in","slug":"perp-rethinking-the-prune-retrain-paradigm-in","title":"PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs","date":"2023-12-23","arxiv_id":"2312.15230","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":["zib-iol/perp"],"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":"compressing-image-to-image-translation-gans","title":"Compressing Image-to-Image Translation GANs Using Local Density Structures on Their Learned Manifold","date":"2023-12-22","arxiv_id":"2312.14776","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-architecture-search-via-bi-level","title":"Efficient Architecture Search via Bi-level Data Pruning","date":"2023-12-21","arxiv_id":"2312.14200","n_code_links":0,"syntology":null},{"paper":null,"slug":"elevating-defenses-bridging-adversarial","title":"Elevating Defenses: Bridging Adversarial Training and Watermarking for Model Resilience","date":"2023-12-21","arxiv_id":"2312.14260","n_code_links":0,"syntology":null},{"paper":null,"slug":"how-to-prune-your-language-model-recovering","title":"How to Prune Your Language Model: Recovering Accuracy on the \"Sparsity May Cry'' Benchmark","date":"2023-12-21","arxiv_id":"2312.13547","n_code_links":0,"syntology":null},{"paper":"/paper/mini-gpts-efficient-large-language-models","slug":"mini-gpts-efficient-large-language-models","title":"Mini-GPTs: Efficient Large Language Models through Contextual Pruning","date":"2023-12-20","arxiv_id":"2312.12682","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"not-all-steps-are-equal-efficient-generation","title":"Adaptive Training Meets Progressive Scaling: Elevating Efficiency in Diffusion Models","date":"2023-12-20","arxiv_id":"2312.13307","n_code_links":0,"syntology":null},{"paper":"/paper/fluctuation-based-adaptive-structured-pruning","slug":"fluctuation-based-adaptive-structured-pruning","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","date":"2023-12-19","arxiv_id":"2312.11983","n_code_links":1,"syntology":{"ran":4,"of":8,"n_ran_checked":1,"n_instrument":3,"unverified":4,"pointer_only":1,"phrase":"4 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; 3 where Syntology's instrument failed) · 4 unverified","official":{"repos":["casia-iva-lab/flap"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-computationally-efficient-neural-video","title":"A Computationally Efficient Neural Video Compression Accelerator Based on a Sparse CNN-Transformer Hybrid Network","date":"2023-12-17","arxiv_id":"2312.10716","n_code_links":0,"syntology":null},{"paper":null,"slug":"cr-sfp-learning-consistent-representation-for","title":"CR-SFP: Learning Consistent Representation for Soft Filter Pruning","date":"2023-12-17","arxiv_id":"2312.11555","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-dense-feed-forward-neural-networks","title":"Optimizing Dense Feed-Forward Neural Networks","date":"2023-12-16","arxiv_id":"2312.10560","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unifying-tensor-view-for-lightweight-cnns","title":"A Unifying Tensor View for Lightweight CNNs","date":"2023-12-15","arxiv_id":"2312.09922","n_code_links":0,"syntology":null},{"paper":null,"slug":"coupling-fairness-and-pruning-in-a-single-run","title":"Integrating Fairness and Model Pruning Through Bi-level Optimization","date":"2023-12-15","arxiv_id":"2312.10181","n_code_links":0,"syntology":null},{"paper":"/paper/otov3-automatic-architecture-agnostic-neural","slug":"otov3-automatic-architecture-agnostic-neural","title":"OTOv3: Automatic Architecture-Agnostic Neural Network Training and Compression from Structured Pruning to Erasing Operators","date":"2023-12-15","arxiv_id":"2312.09411","n_code_links":2,"syntology":null},{"paper":null,"slug":"picking-the-underused-heads-a-network-pruning","title":"Picking the Underused Heads: A Network Pruning Perspective of Attention Head Selection for Fusing Dialogue Coreference Information","date":"2023-12-15","arxiv_id":"2312.09541","n_code_links":0,"syntology":null},{"paper":"/paper/achelous-power-oriented-water-surface","slug":"achelous-power-oriented-water-surface","title":"Achelous++: Power-Oriented Water-Surface Panoptic Perception Framework on Edge Devices based on Vision-Radar Fusion and Pruning of Heterogeneous Modalities","date":"2023-12-14","arxiv_id":"2312.08851","n_code_links":1,"syntology":null},{"paper":null,"slug":"split-ensemble-efficient-ood-aware-ensemble","title":"Split-Ensemble: Efficient OOD-aware Ensemble via Task and Model Splitting","date":"2023-12-14","arxiv_id":"2312.09148","n_code_links":0,"syntology":null},{"paper":"/paper/vsformer-visual-spatial-fusion-transformer","slug":"vsformer-visual-spatial-fusion-transformer","title":"VSFormer: Visual-Spatial Fusion Transformer for Correspondence Pruning","date":"2023-12-14","arxiv_id":"2312.08774","n_code_links":1,"syntology":null},{"paper":null,"slug":"edgepruner-poisoned-edge-pruning-in-graph","title":"EdgePruner: Poisoned Edge Pruning in Graph Contrastive Learning","date":"2023-12-12","arxiv_id":"2312.07022","n_code_links":0,"syntology":null},{"paper":"/paper/rethinking-compression-reduced-order","slug":"rethinking-compression-reduced-order","title":"Rethinking Compression: Reduced Order Modelling of Latent Features in Large Language Models","date":"2023-12-12","arxiv_id":"2312.07046","n_code_links":1,"syntology":null},{"paper":"/paper/class-aware-pruning-for-efficient-neural","slug":"class-aware-pruning-for-efficient-neural","title":"Class-Aware Pruning for Efficient Neural Networks","date":"2023-12-10","arxiv_id":"2312.05875","n_code_links":1,"syntology":null},{"paper":"/paper/agile-quant-activation-guided-quantization","slug":"agile-quant-activation-guided-quantization","title":"Agile-Quant: Activation-Guided Quantization for Faster Inference of LLMs on the Edge","date":"2023-12-09","arxiv_id":"2312.05693","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":["shawnricecake/agile-quant"],"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":"not-all-data-matters-an-end-to-end-adaptive","title":"Not All Data Matters: An End-to-End Adaptive Dataset Pruning Framework for Enhancing Model Performance and Efficiency","date":"2023-12-09","arxiv_id":"2312.05599","n_code_links":0,"syntology":null},{"paper":"/paper/0-1-data-makes-segment-anything-slim","slug":"0-1-data-makes-segment-anything-slim","title":"SlimSAM: 0.1% Data Makes Segment Anything Slim","date":"2023-12-08","arxiv_id":"2312.05284","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["czg1225/slimsam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"accelerating-convolutional-neural-network","title":"Accelerating Convolutional Neural Network Pruning via Spatial Aura Entropy","date":"2023-12-08","arxiv_id":"2312.04926","n_code_links":0,"syntology":null},{"paper":"/paper/continual-learning-for-surface-defect","slug":"continual-learning-for-surface-defect","title":"Continual learning for surface defect segmentation by subnetwork creation and selection","date":"2023-12-08","arxiv_id":"2312.05100","n_code_links":1,"syntology":null},{"paper":null,"slug":"pruning-convolutional-filters-via","title":"Pruning Convolutional Filters via Reinforcement Learning with Entropy Minimization","date":"2023-12-08","arxiv_id":"2312.04918","n_code_links":0,"syntology":null},{"paper":"/paper/eagles-efficient-accelerated-3d-gaussians","slug":"eagles-efficient-accelerated-3d-gaussians","title":"EAGLES: Efficient Accelerated 3D Gaussians with Lightweight EncodingS","date":"2023-12-07","arxiv_id":"2312.04564","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":6,"n_instrument":0,"unverified":1,"pointer_only":7,"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) · 1 unverified","official":{"repos":["sharath-girish/efficientgaussian"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-masked-pruning-approach-for-dimensionality","title":"A Masked Pruning Approach for Dimensionality Reduction in Communication-Efficient Federated Learning Systems","date":"2023-12-06","arxiv_id":"2312.03889","n_code_links":0,"syntology":null},{"paper":null,"slug":"f3-pruning-a-training-free-and-generalized","title":"F3-Pruning: A Training-Free and Generalized Pruning Strategy towards Faster and Finer Text-to-Video Synthesis","date":"2023-12-06","arxiv_id":"2312.03459","n_code_links":0,"syntology":null},{"paper":"/paper/multicoated-and-folded-graph-neural-networks","slug":"multicoated-and-folded-graph-neural-networks","title":"Multicoated and Folded Graph Neural Networks with Strong Lottery Tickets","date":"2023-12-06","arxiv_id":"2312.03236","n_code_links":1,"syntology":null},{"paper":null,"slug":"subnetwork-to-go-elastic-neural-network-with","title":"Subnetwork-to-go: Elastic Neural Network with Dynamic Training and Customizable Inference","date":"2023-12-06","arxiv_id":"2312.03464","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-sobolev-training","title":"Towards Sobolev Pruning","date":"2023-12-06","arxiv_id":"2312.03510","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-learnt-video-codecs-with","title":"Accelerating Learnt Video Codecs with Gradient Decay and Layer-wise Distillation","date":"2023-12-05","arxiv_id":"2312.02605","n_code_links":0,"syntology":null},{"paper":null,"slug":"decoding-data-quality-via-synthetic","title":"Decoding Data Quality via Synthetic Corruptions: Embedding-guided Pruning of Code Data","date":"2023-12-05","arxiv_id":"2312.02418","n_code_links":0,"syntology":null},{"paper":"/paper/split-merge-unlocking-the-potential-of-visual","slug":"split-merge-unlocking-the-potential-of-visual","title":"MoSA: Mixture of Sparse Adapters for Visual Efficient Tuning","date":"2023-12-05","arxiv_id":"2312.02923","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-end-to-end-network-pruning-pipeline-with","title":"An End-to-End Network Pruning Pipeline with Sparsity Enforcement","date":"2023-12-04","arxiv_id":"2312.01653","n_code_links":0,"syntology":null},{"paper":"/paper/tree-of-attacks-jailbreaking-black-box-llms","slug":"tree-of-attacks-jailbreaking-black-box-llms","title":"Tree of Attacks: Jailbreaking Black-Box LLMs Automatically","date":"2023-12-04","arxiv_id":"2312.02119","n_code_links":2,"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":["ricommunity/tap"],"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/visual-prompting-upgrades-neural-network","slug":"visual-prompting-upgrades-neural-network","title":"Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective","date":"2023-12-03","arxiv_id":"2312.01397","n_code_links":1,"syntology":null},{"paper":null,"slug":"token-fusion-bridging-the-gap-between-token","title":"Token Fusion: Bridging the Gap between Token Pruning and Token Merging","date":"2023-12-02","arxiv_id":"2312.01026","n_code_links":0,"syntology":null},{"paper":"/paper/deepcache-accelerating-diffusion-models-for","slug":"deepcache-accelerating-diffusion-models-for","title":"DeepCache: Accelerating Diffusion Models for Free","date":"2023-12-01","arxiv_id":"2312.00858","n_code_links":3,"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":["horseee/deepcache"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/physics-inspired-criterion-for-pruning","slug":"physics-inspired-criterion-for-pruning","title":"Physics Inspired Criterion for Pruning-Quantization Joint Learning","date":"2023-12-01","arxiv_id":"2312.00851","n_code_links":1,"syntology":null},{"paper":"/paper/the-cost-of-compression-investigating-the","slug":"the-cost-of-compression-investigating-the","title":"The Cost of Compression: Investigating the Impact of Compression on Parametric Knowledge in Language Models","date":"2023-12-01","arxiv_id":"2312.00960","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":["namburisrinath/llmcompression"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/scaffold-gs-structured-3d-gaussians-for-view","slug":"scaffold-gs-structured-3d-gaussians-for-view","title":"Scaffold-GS: Structured 3D Gaussians for View-Adaptive Rendering","date":"2023-11-30","arxiv_id":"2312.00109","n_code_links":1,"syntology":{"ran":8,"of":10,"n_ran_checked":8,"n_instrument":0,"unverified":2,"pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["city-super/Scaffold-GS"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"layercollapse-adaptive-compression-of-neural","title":"LayerCollapse: Adaptive compression of neural networks","date":"2023-11-29","arxiv_id":"2311.17943","n_code_links":0,"syntology":null},{"paper":"/paper/towards-higher-ranks-via-adversarial-weight-1","slug":"towards-higher-ranks-via-adversarial-weight-1","title":"Towards Higher Ranks via Adversarial Weight Pruning","date":"2023-11-29","arxiv_id":"2311.17493","n_code_links":1,"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":{"repos":["huawei-noah/Efficient-Computing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"compressing-the-backward-pass-of-large-scale","title":"Compressing the Backward Pass of Large-Scale Neural Architectures by Structured Activation Pruning","date":"2023-11-28","arxiv_id":"2311.16883","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-for-time-series-classification-3","title":"Deep Learning for Time Series Classification of Parkinson's Disease Eye Tracking Data","date":"2023-11-28","arxiv_id":"2311.16381","n_code_links":0,"syntology":null},{"paper":"/paper/filter-pruning-of-lightweight-face-detectors","slug":"filter-pruning-of-lightweight-face-detectors","title":"Filter-Pruning of Lightweight Face Detectors Using a Geometric Median Criterion","date":"2023-11-28","arxiv_id":"2311.16613","n_code_links":1,"syntology":null},{"paper":"/paper/humangaussian-text-driven-3d-human-generation","slug":"humangaussian-text-driven-3d-human-generation","title":"HumanGaussian: Text-Driven 3D Human Generation with Gaussian Splatting","date":"2023-11-28","arxiv_id":"2311.17061","n_code_links":1,"syntology":{"ran":11,"of":12,"n_ran_checked":10,"n_instrument":1,"unverified":1,"pointer_only":4,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":null,"slug":"l2match-optimization-techniques-on-subgraph","title":"l2Match: Optimization Techniques on Subgraph Matching Algorithm using Label Pair, Neighboring Label Index, and Jump-Redo method","date":"2023-11-28","arxiv_id":"2311.16603","n_code_links":0,"syntology":null},{"paper":"/paper/lightgaussian-unbounded-3d-gaussian","slug":"lightgaussian-unbounded-3d-gaussian","title":"LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPS","date":"2023-11-28","arxiv_id":"2311.17245","n_code_links":1,"syntology":{"ran":17,"of":22,"n_ran_checked":3,"n_instrument":14,"unverified":5,"pointer_only":22,"phrase":"17 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 14 where Syntology's instrument failed) · 5 unverified","official":{"repos":["VITA-Group/LightGaussian"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"influence-scores-at-scale-for-efficient","title":"Influence Scores at Scale for Efficient Language Data Sampling","date":"2023-11-27","arxiv_id":"2311.16298","n_code_links":0,"syntology":null},{"paper":null,"slug":"relationship-between-model-compression-and","title":"Relationship between Model Compression and Adversarial Robustness: A Review of Current Evidence","date":"2023-11-27","arxiv_id":"2311.15782","n_code_links":0,"syntology":null}],"record_sha256":"23a85b66b30d8c8701d8afe9236ce98914ad1ed2ab1ee9d3ef628f171264e708","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}