{"total":119,"rows":[{"id":"2308.06767","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","created":"2023-08-13","cited_by_count":202,"area":null},{"id":"2109.05687","title":"Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning","created":"2021-09-13","cited_by_count":146,"area":null},{"id":"2303.00566","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","created":"2023-03-01","cited_by_count":122,"area":null},{"id":"2106.10404","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","created":"2021-06-19","cited_by_count":84,"area":null},{"id":"2110.13981","title":"CHIP: CHannel Independence-based Pruning for Compact Neural Networks","created":"2021-10-26","cited_by_count":78,"area":null},{"id":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62,"area":null},{"id":"2106.12379","title":"AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks","created":"2021-06-23","cited_by_count":59,"area":null},{"id":"2403.15447","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","created":"2024-03-18","cited_by_count":57,"area":null},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50,"area":null},{"id":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"area":null},{"id":"2210.05497","title":"Improving Sharpness-Aware Minimization with Fisher Mask for Better Generalization on Language Models","created":"2022-10-11","cited_by_count":42,"area":null},{"id":"2306.03805","title":"The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter","created":"2023-06-06","cited_by_count":42,"area":null},{"id":"2107.11442","title":"Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decomposition","created":"2021-07-23","cited_by_count":33,"area":null},{"id":"2111.11146","title":"On the Existence of Universal Lottery Tickets","created":"2021-11-22","cited_by_count":30,"area":null},{"id":"2109.02220","title":"GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarization","created":"2021-09-06","cited_by_count":29,"area":null},{"id":"2208.06118","title":"An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformers","created":"2022-08-12","cited_by_count":29,"area":null},{"id":"2310.02556","title":"NOLA: Compressing LoRA using Linear Combination of Random Basis","created":"2023-10-04","cited_by_count":29,"area":null},{"id":"2102.13229","title":"Consistent Sparse Deep Learning: Theory and Computation","created":"2021-02-25","cited_by_count":27,"area":null},{"id":"2110.05323","title":"ProgFed: Effective, Communication, and Computation Efficient Federated Learning by Progressive Training","created":"2021-10-11","cited_by_count":27,"area":null},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27,"area":null},{"id":"2101.08837","title":"Time-Correlated Sparsification for Communication-Efficient Federated Learning","created":"2021-01-21","cited_by_count":26,"area":null},{"id":"2106.09857","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","created":"2021-06-18","cited_by_count":26,"area":null},{"id":"2111.12485","title":"Understanding the Dynamics of DNNs Using Graph Modularity","created":"2021-11-24","cited_by_count":26,"area":null},{"id":"2105.03193","title":"Network Pruning That Matters: A Case Study on Retraining Variants","created":"2021-05-07","cited_by_count":25,"area":null},{"id":"2310.08670","title":"Every Parameter Matters: Ensuring the Convergence of Federated Learning with Dynamic Heterogeneous Models Reduction","created":"2023-10-12","cited_by_count":24,"area":null},{"id":"2103.16547","title":"The Elastic Lottery Ticket Hypothesis","created":"2021-03-30","cited_by_count":23,"area":null},{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","cited_by_count":20,"area":null},{"id":"2306.16788","title":"Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging","created":"2023-06-29","cited_by_count":20,"area":null},{"id":"2105.14797","title":"RED : Looking for Redundancies for Data-Free Structured Compression of Deep Neural Networks","created":"2021-05-31","cited_by_count":19,"area":null},{"id":"2110.01397","title":"RED++ : Data-Free Pruning of Deep Neural Networks via Input Splitting and Output Merging","created":"2021-09-30","cited_by_count":19,"area":null},{"id":"2311.12831","title":"ECNR: Efficient Compressive Neural Representation of Time-Varying Volumetric Datasets","created":"2023-10-02","cited_by_count":17,"area":null},{"id":"2105.14713","title":"1xN Pattern for Pruning Convolutional Neural Networks","created":"2021-05-31","cited_by_count":16,"area":null},{"id":"2106.08895","title":"Masked Training of Neural Networks with Partial Gradients","created":"2021-06-16","cited_by_count":16,"area":null},{"id":"2110.08350","title":"Differentiable Network Pruning for Microcontrollers","created":"2021-10-15","cited_by_count":16,"area":null},{"id":"2202.07190","title":"Pruning Networks with Cross-Layer Ranking & k-Reciprocal Nearest Filters","created":"2022-02-15","cited_by_count":16,"area":null},{"id":"2205.11921","title":"Compression-aware Training of Neural Networks using Frank-Wolfe","created":"2022-05-24","cited_by_count":16,"area":null},{"id":"2308.10438","title":"Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural Networks","created":"2023-08-21","cited_by_count":15,"area":null},{"id":"2209.14624","title":"Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruning","created":"2022-09-29","cited_by_count":13,"area":null},{"id":"2302.02390","title":"Quantized Distributed Training of Large Models with Convergence Guarantees","created":"2023-02-05","cited_by_count":13,"area":null},{"id":"2111.00843","title":"How I Learned to Stop Worrying and Love Retraining","created":"2021-11-01","cited_by_count":12,"area":null},{"id":"2211.02206","title":"Soft Masking for Cost-Constrained Channel Pruning","created":"2022-11-04","cited_by_count":12,"area":null},{"id":"2401.10341","title":"ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks","created":"2024-01-18","cited_by_count":11,"area":null},{"id":"2405.16057","title":"SPP: Sparsity-Preserved Parameter-Efficient Fine-Tuning for Large Language Models","created":"2024-05-25","cited_by_count":11,"area":null},{"id":"2201.05842","title":"UDC: Unified DNAS for Compressible TinyML Models","created":"2022-01-15","cited_by_count":10,"area":null},{"id":"2305.09042","title":"Adaptive Federated Pruning in Hierarchical Wireless Networks","created":"2023-05-15","cited_by_count":10,"area":null},{"id":"2307.08483","title":"Differentiable Transportation Pruning","created":"2023-07-17","cited_by_count":10,"area":null},{"id":"2308.01562","title":"Hierarchical Federated Learning in Wireless Networks: Pruning Tackles Bandwidth Scarcity and System Heterogeneity","created":"2023-08-03","cited_by_count":10,"area":null},{"id":"2207.04089","title":"SInGE: Sparsity via Integrated Gradients Estimation of Neuron Relevance","created":"2022-07-08","cited_by_count":9,"area":null},{"id":"2204.12430","title":"Federated Progressive Sparsification (Purge, Merge, Tune)+","created":"2022-04-26","cited_by_count":8,"area":null},{"id":"2408.17163","title":"The Iterative Optimal Brain Surgeon: Faster Sparse Recovery by Leveraging Second-Order Information","created":"2024-08-30","cited_by_count":8,"area":null},{"id":"2110.00653","title":"Sparse Deep Learning: A New Framework Immune to Local Traps and Miscalibration","created":"2021-10-01","cited_by_count":7,"area":null},{"id":"2205.08358","title":"Perturbation of Deep Autoencoder Weights for Model Compression and Classification of Tabular Data","created":"2022-05-17","cited_by_count":7,"area":null},{"id":"2207.14200","title":"CrAM: A Compression-Aware Minimizer","created":"2022-07-28","cited_by_count":7,"area":null},{"id":"2202.01290","title":"Cyclical Pruning for Sparse Neural Networks","created":"2022-02-02","cited_by_count":6,"area":null},{"id":"2306.16484","title":"Towards a Better Theoretical Understanding of Independent Subnetwork Training","created":"2023-06-28","cited_by_count":6,"area":null},{"id":"2407.01320","title":"Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning","created":"2024-07-01","cited_by_count":6,"area":null},{"id":"2602.00693","title":"Topology and Geometry of the Learning Space of ReLU Networks: Connectivity and Singularities","created":"2026-01-31","cited_by_count":6,"area":null},{"id":"2107.06916","title":"Training Compact CNNs for Image Classification using Dynamic-coded Filter Fusion","created":"2021-07-14","cited_by_count":5,"area":null},{"id":"2201.12826","title":"OptG: Optimizing Gradient-driven Criteria in Network Sparsity","created":"2022-01-30","cited_by_count":5,"area":null},{"id":"2303.09736","title":"Dynamic Structure Pruning for Compressing CNNs","created":"2023-03-17","cited_by_count":5,"area":null},{"id":"2306.05056","title":"Magnitude Attention-based Dynamic Pruning","created":"2023-06-08","cited_by_count":5,"area":null},{"id":"2506.06866","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2106.14126","title":"AdaptCL: Efficient Collaborative Learning with Dynamic and Adaptive Pruning","created":"2021-06-27","cited_by_count":4,"area":null},{"id":"2109.04660","title":"Dynamic Collective Intelligence Learning: Finding Efficient Sparse Model via Refined Gradients for Pruned Weights","created":"2021-09-10","cited_by_count":4,"area":null},{"id":"2201.11803","title":"On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning","created":"2022-01-27","cited_by_count":4,"area":null},{"id":"2302.11286","title":"Neural-based classification rule learning for sequential data","created":"2023-02-22","cited_by_count":4,"area":null},{"id":"2401.09068","title":"DTMM: Deploying TinyML Models on Extremely Weak IoT Devices with Pruning","created":"2024-01-17","cited_by_count":4,"area":null},{"id":"2406.19301","title":"MCNC: Manifold-Constrained Reparameterization for Neural Compression","created":"2024-06-27","cited_by_count":4,"area":null},{"id":"2510.18784","title":"CAGE: Curvature-Aware Gradient Estimation For Accurate Quantization-Aware Training","created":"2025-10-21","cited_by_count":4,"area":null},{"id":"2512.10922","title":"SparseSwaps: Tractable LLM Pruning Mask Refinement at Scale","created":"2025-12-11","cited_by_count":4,"area":null},{"id":"2104.13343","title":"Sifting out the features by pruning: Are convolutional networks the winning lottery ticket of fully connected ones?","created":"2021-04-27","cited_by_count":3,"area":null},{"id":"2210.12818","title":"Pushing the Efficiency Limit Using Structured Sparse Convolutions","created":"2022-10-23","cited_by_count":3,"area":null},{"id":"2306.07030","title":"Resource Efficient Neural Networks Using Hessian Based Pruning","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2404.03687","title":"DRIVE: Dual Gradient-Based Rapid Iterative Pruning","created":"2024-04-01","cited_by_count":3,"area":null},{"id":"2404.08016","title":"ONNXPruner: ONNX-Based General Model Pruning Adapter","created":"2024-04-10","cited_by_count":3,"area":null},{"id":"2405.05808","title":"Fast and Controllable Post-training Sparsity: Learning Optimal Sparsity Allocation with Global Constraint in Minutes","created":"2024-05-09","cited_by_count":3,"area":null},{"id":"2411.03171","title":"Navigating Extremes: Dynamic Sparsity in Large Output Spaces","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2210.12957","title":"On the optimization and pruning for Bayesian deep learning","created":"2022-10-24","cited_by_count":2,"area":null},{"id":"2304.06941","title":"AUTOSPARSE: Towards Automated Sparse Training of Deep Neural Networks","created":"2023-04-14","cited_by_count":2,"area":null},{"id":"2309.06805","title":"FedDIP: Federated Learning with Extreme Dynamic Pruning and Incremental Regularization","created":"2023-09-13","cited_by_count":2,"area":null},{"id":"2401.05667","title":"EsaCL: Efficient Continual Learning of Sparse Models","created":"2024-01-11","cited_by_count":2,"area":null},{"id":"2405.06038","title":"From Algorithm to Hardware: A Survey on Efficient and Safe Deployment of Deep Neural Networks","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2110.15192","title":"RGP: Neural Network Pruning through Its Regular Graph Structure","created":"2021-10-28","cited_by_count":1,"area":null},{"id":"2111.02399","title":"Learning Pruned Structure and Weights Simultaneously from Scratch: an Attention based Approach","created":"2021-11-01","cited_by_count":1,"area":null},{"id":"2112.02819","title":"Finding Deviated Behaviors of the Compressed DNN Models for Image Classifications","created":"2021-12-06","cited_by_count":1,"area":null},{"id":"2206.08464","title":"PRANC: Pseudo RAndom Networks for Compacting deep models","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2306.05785","title":"End-to-End Neural Network Compression via $\\frac{\\ell_1}{\\ell_2}$ Regularized Latency Surrogates","created":"2023-06-09","cited_by_count":1,"area":null},{"id":"2307.04365","title":"One-Shot Pruning for Fast-adapting Pre-trained Models on Devices","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2310.01843","title":"Selective Feature Adapter for Dense Vision Transformers","created":"2023-10-03","cited_by_count":1,"area":null},{"id":"2312.10181","title":"Integrating Fairness and Model Pruning Through Bi-level Optimization","created":"2023-12-15","cited_by_count":1,"area":null},{"id":"2402.14139","title":"NeuroFlux: Memory-Efficient CNN Training Using Adaptive Local Learning","created":"2024-02-21","cited_by_count":1,"area":null},{"id":"2403.19969","title":"Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Tasks","created":"2024-03-29","cited_by_count":1,"area":null},{"id":"2406.03879","title":"Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure","created":"2024-06-06","cited_by_count":1,"area":null},{"id":"2502.03658","title":"Advancing Weight and Channel Sparsification with Enhanced Saliency","created":"2025-02-05","cited_by_count":1,"area":null},{"id":"2502.18168","title":"SECURA: Sigmoid-Enhanced CUR Decomposition with Uninterrupted Retention and Low-Rank Adaptation in Large Language Models","created":"2025-02-25","cited_by_count":1,"area":null},{"id":"2506.05271","title":"Tight analyses of first-order methods with error feedback","created":"2025-06-05","cited_by_count":1,"area":null},{"id":"2506.07975","title":"Hyperpruning: Efficient Search through Pruned Variants of Recurrent Neural Networks Leveraging Lyapunov Spectrum","created":"2025-06-09","cited_by_count":1,"area":null},{"id":"2507.09428","title":"On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization","created":"2025-07-12","cited_by_count":1,"area":null},{"id":"2508.10836","title":"SoK: Data Minimization in Machine Learning","created":"2025-08-14","cited_by_count":1,"area":null},{"id":"2510.20800","title":"Compress to Impress: Efficient LLM Adaptation Using a Single Gradient Step on 100 Samples","created":"2025-10-23","cited_by_count":1,"area":null}],"next_cursor":"100"}