{"total":41,"rows":[{"id":"2102.00554","title":"Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks","created":"2021-01-31","cited_by_count":527,"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":"2103.03014","title":"Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracy","created":"2021-03-04","cited_by_count":62,"area":null},{"id":"2203.04466","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","created":"2022-03-09","cited_by_count":41,"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":"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":"2303.04185","title":"Gradient-Free Structured Pruning with Unlabeled Data","created":"2023-03-07","cited_by_count":26,"area":null},{"id":"2302.05601","title":"Pruning Deep Neural Networks from a Sparsity Perspective","created":"2023-02-11","cited_by_count":25,"area":null},{"id":"2203.02474","title":"Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms","created":"2022-03-04","cited_by_count":22,"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":"2111.03044","title":"A Unified Approach to Coreset Learning","created":"2021-11-04","cited_by_count":18,"area":null},{"id":"2105.10065","title":"A Probabilistic Approach to Neural Network Pruning","created":"2021-05-20","cited_by_count":15,"area":null},{"id":"2110.05667","title":"Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks","created":"2021-10-12","cited_by_count":14,"area":null},{"id":"2106.12718","title":"Sparse Flows: Pruning Continuous-depth Models","created":"2021-06-24","cited_by_count":13,"area":null},{"id":"2106.14952","title":"Adversarial Robustness of Streaming Algorithms through Importance Sampling","created":"2021-06-28","cited_by_count":13,"area":null},{"id":"2202.08070","title":"On Measuring Excess Capacity in Neural Networks","created":"2022-02-16","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":"2301.07966","title":"Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regions","created":"2023-01-19","cited_by_count":8,"area":null},{"id":"2203.03009","title":"Coresets for Data Discretization and Sine Wave Fitting","created":"2022-03-06","cited_by_count":6,"area":null},{"id":"2203.04075","title":"Obstacle Aware Sampling for Path Planning","created":"2022-03-08","cited_by_count":6,"area":null},{"id":"2303.02095","title":"Data-Efficient Training of CNNs and Transformers with Coresets: A Stability Perspective","created":"2023-03-03","cited_by_count":6,"area":null},{"id":"2206.05604","title":"A Theoretical Understanding of Neural Network Compression from Sparse Linear Approximation","created":"2022-06-11","cited_by_count":5,"area":null},{"id":"2104.02822","title":"Low-Regret Active learning","created":"2021-04-06","cited_by_count":3,"area":null},{"id":"2205.04650","title":"Robust Learning of Parsimonious Deep Neural Networks","created":"2022-05-10","cited_by_count":3,"area":null},{"id":"2102.02804","title":"A Deeper Look into Convolutions via Eigenvalue-based Pruning","created":"2021-02-04","cited_by_count":2,"area":null},{"id":"2110.11804","title":"Probabilistic fine-tuning of pruning masks and PAC-Bayes self-bounded learning","created":"2021-10-22","cited_by_count":2,"area":null},{"id":"2212.00291","title":"The Effect of Data Dimensionality on Neural Network Prunability","created":"2022-12-01","cited_by_count":2,"area":null},{"id":"2305.05318","title":"How Informative is the Approximation Error from Tensor Decomposition for Neural Network Compression?","created":"2023-05-09","cited_by_count":2,"area":null},{"id":"2405.20620","title":"\"Forgetting\" in Machine Learning and Beyond: A Survey","created":"2024-05-31","cited_by_count":2,"area":null},{"id":"2607.02721","title":"Provable Pruning for Efficient 3D Gaussian Splatting via Coresets","created":"2026-07-02","cited_by_count":2,"area":null},{"id":"2112.04905","title":"i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery","created":"2021-12-07","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":"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},{"id":"2512.06288","title":"Theoretical Compression Bounds for Wide Multilayer Perceptrons","created":"2025-12-06","cited_by_count":1,"area":null},{"id":"2203.07989","title":"Approximability and Generalisation","created":"2022-03-15","cited_by_count":0,"area":null},{"id":"2210.04807","title":"Efficient NTK using Dimensionality Reduction","created":"2022-10-10","cited_by_count":0,"area":null},{"id":"2306.16557","title":"Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2601.00361","title":"Deterministic Coreset for Lp Subspace","created":"2026-01-01","cited_by_count":0,"area":null},{"id":"2604.19015","title":"FedProxy: Federated Fine-Tuning of LLMs via Proxy SLMs and Heterogeneity-Aware Fusion","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2608.05464","title":"Effective pruning of task-trained recurrent neural networks using noisy fluctuations and connection rescaling","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2608.21752","title":"Width-Independent Compressibility of Deep Neural Networks","created":"2026-08-22","cited_by_count":0,"area":null}],"next_cursor":null}