{"total":25,"rows":[{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800,"area":null},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2401.01867","title":"Dataset Difficulty and the Role of Inductive Bias","created":"2024-01-03","cited_by_count":12,"area":null},{"id":"2310.04680","title":"The Cost of Down-Scaling Language Models: Fact Recall Deteriorates before In-Context Learning","created":"2023-10-07","cited_by_count":7,"area":null},{"id":"2303.04555","title":"Streaming Kernel PCA Algorithm With Small Space","created":"2023-03-08","cited_by_count":5,"area":null},{"id":"2308.08160","title":"Benchmarking Adversarial Robustness of Compressed Deep Learning Models","created":"2023-08-16","cited_by_count":3,"area":null},{"id":"2304.11237","title":"Effective Neural Network $L_0$ Regularization With BinMask","created":"2023-04-21","cited_by_count":2,"area":null},{"id":"2306.12190","title":"Quantifying lottery tickets under label noise: accuracy, calibration, and complexity","created":"2023-06-21","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":"2406.05288","title":"Optimal Eye Surgeon: Finding Image Priors through Sparse Generators at Initialization","created":"2024-06-07","cited_by_count":2,"area":null},{"id":"2501.12486","title":"The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Laws","created":"2025-01-21","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":"2406.02773","title":"Cyclic Sparse Training: Is it Enough?","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2409.09196","title":"Are Sparse Neural Networks Better Hard Sample Learners?","created":"2024-09-13","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":"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":"2310.15074","title":"MGAS: Multi-Granularity Architecture Search for Trade-Off Between Model Effectiveness and Efficiency","created":"2023-10-23","cited_by_count":0,"area":null},{"id":"2403.15022","title":"Insights into the Lottery Ticket Hypothesis and Iterative Magnitude Pruning","created":"2024-03-22","cited_by_count":0,"area":null},{"id":"2501.16376","title":"SwiftPrune: Hessian-Free Weight Pruning for Large Language Models","created":"2025-01-24","cited_by_count":0,"area":null},{"id":"2503.21714","title":"As easy as PIE: understanding when pruning causes language models to disagree","created":"2025-03-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":"2602.07618","title":"Neural Networks With Dense Weights Are Not Universal Approximators","created":"2026-02-07","cited_by_count":0,"area":null},{"id":"2607.27031","title":"Lottery Tickets Are Not Deployment Tickets","created":"2026-07-29","cited_by_count":0,"area":null}],"next_cursor":null}