{"total":26,"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":"2303.00566","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","created":"2023-03-01","cited_by_count":122,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2211.10155","title":"Structured Pruning Adapters","created":"2022-11-17","cited_by_count":12,"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":"2311.00447","title":"On the Opportunities of Green Computing: A Survey","created":"2023-11-01","cited_by_count":7,"area":null},{"id":"2405.17081","title":"Effective Layer Pruning Through Similarity Metric Perspective","created":"2024-05-27","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":"2411.00147","title":"Mutual Information Preserving Neural Network Pruning","created":"2024-10-31","cited_by_count":5,"area":null},{"id":"2308.06755","title":"Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining","created":"2023-08-13","cited_by_count":4,"area":null},{"id":"2402.17862","title":"REPrune: Channel Pruning via Kernel Representative Selection","created":"2024-02-27","cited_by_count":4,"area":null},{"id":"2510.17700","title":"Elastic ViTs from Pretrained Models without Retraining","created":"2025-10-20","cited_by_count":4,"area":null},{"id":"2508.05521","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","created":"2025-08-07","cited_by_count":3,"area":null},{"id":"2309.14157","title":"LAPP: Layer Adaptive Progressive Pruning for Compressing CNNs from Scratch","created":"2023-09-25","cited_by_count":2,"area":null},{"id":"2412.05517","title":"Test-time Cost-and-Quality Controllable Arbitrary-Scale Super-Resolution with Variable Fourier Components","created":"2024-12-07","cited_by_count":2,"area":null},{"id":"2503.18377","title":"Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMs","created":"2025-03-24","cited_by_count":2,"area":null},{"id":"2501.15240","title":"Hardware-Aware DNN Compression for Homogeneous Edge Devices","created":"2025-01-25","cited_by_count":1,"area":null},{"id":"2510.00192","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","created":"2025-09-30","cited_by_count":1,"area":null},{"id":"2407.17412","title":"(PASS) Visual Prompt Locates Good Structure Sparsity through a Recurrent HyperNetwork","created":"2024-07-24","cited_by_count":0,"area":null},{"id":"2409.03777","title":"A Greedy Hierarchical Approach to Whole-Network Filter-Pruning in CNNs","created":"2024-08-22","cited_by_count":0,"area":null},{"id":"2411.14345","title":"Layer Pruning with Consensus: A Triple-Win Solution","created":"2024-11-21","cited_by_count":0,"area":null},{"id":"2505.24469","title":"Smooth Model Compression without Fine-Tuning","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2506.04513","title":"Pruning Everything, Everywhere, All at Once","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2511.09901","title":"Explore and Establish Synergistic Effects Between Weight Pruning and Coreset Selection in Neural Network Training","created":"2025-11-13","cited_by_count":0,"area":null},{"id":"2511.15390","title":"Automatic Pruning Discovery for Large Language Models","created":"2025-11-19","cited_by_count":0,"area":null},{"id":"2608.29765","title":"PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning","created":"2026-08-30","cited_by_count":0,"area":null}],"next_cursor":null}