{"total":54,"rows":[{"id":"2106.04533","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","created":"2021-06-08","cited_by_count":183,"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":"2210.13738","title":"Pruning's Effect on Generalization Through the Lens of Training and Regularization","created":"2022-10-25","cited_by_count":31,"area":null},{"id":"2202.04736","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","created":"2022-02-09","cited_by_count":27,"area":null},{"id":"2307.05831","title":"Memorization Through the Lens of Curvature of Loss Function Around Samples","created":"2023-07-11","cited_by_count":27,"area":null},{"id":"2206.08684","title":"Sparse Double Descent: Where Network Pruning Aggravates Overfitting","created":"2022-06-17","cited_by_count":26,"area":null},{"id":"2111.11802","title":"Pruning Self-attentions into Convolutional Layers in Single Path","created":"2021-11-23","cited_by_count":24,"area":null},{"id":"2108.04890","title":"On the Effect of Pruning on Adversarial Robustness","created":"2021-08-10","cited_by_count":23,"area":null},{"id":"2408.13233","title":"Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time","created":"2024-08-23","cited_by_count":22,"area":null},{"id":"2201.08542","title":"Can Model Compression Improve NLP Fairness","created":"2022-01-21","cited_by_count":20,"area":null},{"id":"2205.12694","title":"Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models","created":"2022-05-25","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":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2306.14306","title":"Adaptive Sharpness-Aware Pruning for Robust Sparse Networks","created":"2023-06-25","cited_by_count":17,"area":null},{"id":"2203.07808","title":"Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNs","created":"2022-03-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":"2202.02664","title":"No Parameters Left Behind: Sensitivity Guided Adaptive Learning Rate for Training Large Transformer Models","created":"2022-02-06","cited_by_count":15,"area":null},{"id":"2108.06277","title":"Towards Structured Dynamic Sparse Pre-Training of BERT","created":"2021-08-13","cited_by_count":12,"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":"2205.08099","title":"Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey","created":"2022-05-17","cited_by_count":12,"area":null},{"id":"2303.06237","title":"Complement Sparsification: Low-Overhead Model Pruning for Federated Learning","created":"2023-03-10","cited_by_count":12,"area":null},{"id":"2204.05023","title":"Machine Learning and Deep Learning -- A review for Ecologists","created":"2022-04-11","cited_by_count":11,"area":null},{"id":"2210.14672","title":"Sparsity in Continuous-Depth Neural Networks","created":"2022-10-26","cited_by_count":10,"area":null},{"id":"2205.07320","title":"Analyzing Lottery Ticket Hypothesis from PAC-Bayesian Theory Perspective","created":"2022-05-15","cited_by_count":9,"area":null},{"id":"2206.02976","title":"Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithm","created":"2022-06-07","cited_by_count":9,"area":null},{"id":"2506.09816","title":"Identifiability Challenges in Sparse Linear Ordinary Differential Equations","created":"2025-06-11","cited_by_count":7,"area":null},{"id":"2301.03573","title":"Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correction","created":"2023-01-09","cited_by_count":5,"area":null},{"id":"2304.13718","title":"Sparsified Model Zoo Twins: Investigating Populations of Sparsified Neural Network Models","created":"2023-04-26","cited_by_count":4,"area":null},{"id":"2503.23455","title":"Efficient Token Compression for Vision Transformer with Spatial Information Preserved","created":"2025-03-30","cited_by_count":4,"area":"inference"},{"id":"2109.15014","title":"Deep Neural Compression Via Concurrent Pruning and Self-Distillation","created":"2021-09-30","cited_by_count":3,"area":"distill"},{"id":"2212.12770","title":"COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks","created":"2022-12-24","cited_by_count":3,"area":null},{"id":"2104.00851","title":"Estimating the Generalization in Deep Neural Networks via Sparsity","created":"2021-04-02","cited_by_count":2,"area":null},{"id":"2202.05226","title":"Deadwooding: Robust Global Pruning for Deep Neural Networks","created":"2022-02-10","cited_by_count":2,"area":null},{"id":"2211.00106","title":"Data-Efficient Cross-Lingual Transfer with Language-Specific Subnetworks","created":"2022-10-31","cited_by_count":2,"area":null},{"id":"2305.17559","title":"Pruning at Initialization -- A Sketching Perspective","created":"2023-05-27","cited_by_count":2,"area":null},{"id":"2306.13237","title":"Pruning for Better Domain Generalizability","created":"2023-06-22","cited_by_count":2,"area":null},{"id":"2511.08092","title":"Pruning as Regularization: Sensitivity-Aware One-Shot Pruning in ASR","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2512.09953","title":"ZK-APEX: Zero-Knowledge Approximate Personalized Unlearning with Executable Proofs","created":"2025-12-09","cited_by_count":2,"area":"safety"},{"id":"2301.03765","title":"Cross-Model Comparative Loss for Enhancing Neuronal Utility in Language Understanding","created":"2023-01-10","cited_by_count":1,"area":null},{"id":"2303.11453","title":"Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensing","created":"2023-03-20","cited_by_count":1,"area":null},{"id":"2409.17994","title":"CRoP: Context-wise Robust Static Human-Sensing Personalization","created":"2024-09-26","cited_by_count":1,"area":null},{"id":"2506.02256","title":"Human Heterogeneity Invariant Stress Sensing","created":"2025-06-02","cited_by_count":1,"area":null},{"id":"2210.16504","title":"A pruning method based on the dissimilarity of angle among channels and filters","created":"2022-10-29","cited_by_count":0,"area":null},{"id":"2305.18402","title":"Neural Sculpting: Uncovering hierarchically modular task structure in neural networks through pruning and network analysis","created":"2023-05-28","cited_by_count":0,"area":null},{"id":"2305.18789","title":"Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketching","created":"2023-05-30","cited_by_count":0,"area":null},{"id":"2411.00273","title":"Efficient Model Compression for Bayesian Neural Networks","created":"2024-11-01","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.18996","title":"Automatic and Structure-Aware Sparsification of Hybrid Neural ODEs","created":"2025-05-25","cited_by_count":0,"area":null},{"id":"2510.12939","title":"Pruning Cannot Hurt Robustness: Certified Trade-offs in Reinforcement Learning","created":"2025-10-14","cited_by_count":0,"area":"deeprl"},{"id":"2601.19739","title":"TokenSeek: Memory Efficient Fine Tuning via Instance-Aware Token Ditching","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2601.23131","title":"Regularisation in neural networks: a survey and empirical analysis of approaches","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2608.08624","title":"Domain-Aware Pruning: Sparsity and Domain Generalization via Regularized Probabilistic Masking","created":"2026-08-09","cited_by_count":0,"area":null},{"id":"2609.21126","title":"Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layers","created":"2026-09-17","cited_by_count":0,"area":null}],"next_cursor":null}