{"total":36,"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":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"area":null},{"id":"2402.05406","title":"Everybody Prune Now: Structured Pruning of LLMs with only Forward Passes","created":"2024-02-08","cited_by_count":43,"area":null},{"id":"2409.13652","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","created":"2024-09-20","cited_by_count":20,"area":null},{"id":"2406.07831","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","created":"2024-06-12","cited_by_count":19,"area":null},{"id":"2403.12983","title":"OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization","created":"2024-03-02","cited_by_count":18,"area":null},{"id":"2403.07094","title":"FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning","created":"2024-03-11","cited_by_count":11,"area":null},{"id":"2306.05857","title":"How Sparse Can We Prune A Deep Network: A Fundamental Limit Perspective","created":"2023-06-09","cited_by_count":9,"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":"2406.12837","title":"LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging","created":"2024-06-18","cited_by_count":7,"area":null},{"id":"2502.15790","title":"Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representations","created":"2025-02-18","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":"2405.15006","title":"A Rescaling-Invariant Lipschitz Bound Based on Path-Metrics for Modern ReLU Network Parameterizations","created":"2024-05-23","cited_by_count":4,"area":null},{"id":"2408.16167","title":"Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles","created":"2024-08-28","cited_by_count":4,"area":null},{"id":"2502.00899","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","created":"2025-02-02","cited_by_count":3,"area":null},{"id":"2502.17941","title":"Optimal Brain Apoptosis","created":"2025-02-25","cited_by_count":3,"area":null},{"id":"2510.22101","title":"Scaling Up Efficient Small Language Models Serving and Deployment for Semantic Job Search","created":"2025-10-25","cited_by_count":3,"area":null},{"id":"2310.04918","title":"SWAP: Sparse Entropic Wasserstein Regression for Robust Network Pruning","created":"2023-10-07","cited_by_count":2,"area":null},{"id":"2402.03142","title":"Less is KEN: a Universal and Simple Non-Parametric Pruning Algorithm for Large Language Models","created":"2024-02-05","cited_by_count":2,"area":null},{"id":"2502.14305","title":"Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systems","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2503.12822","title":"An Optimization Framework for Differentially Private Sparse Fine-Tuning","created":"2025-03-17","cited_by_count":2,"area":null},{"id":"2512.20636","title":"Data-Free Pruning of Self-Attention Layers in LLMs","created":"2025-12-03","cited_by_count":2,"area":null},{"id":"2604.22746","title":"Relaxation-Informed Training of Neural Network Surrogate Models","created":"2026-04-24","cited_by_count":2,"area":null},{"id":"2408.04759","title":"Confident magnitude-based neural network pruning","created":"2024-08-08","cited_by_count":1,"area":null},{"id":"2412.03035","title":"A Granger-Causal Perspective on Gradient Descent with Application to Pruning","created":"2024-12-04","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":"2601.22141","title":"Routing the Lottery: Adaptive Subnetworks for Heterogeneous Data","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2605.06278","title":"PACE: Prune-And-Compress Ensemble Models","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2402.17902","title":"SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2505.01985","title":"Optimization over Trained (and Sparse) Neural Networks: A Surrogate within a Surrogate","created":"2025-05-04","cited_by_count":0,"area":null},{"id":"2505.23949","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","created":"2025-05-29","cited_by_count":0,"area":null},{"id":"2507.14882","title":"Application-Specific Component-Aware Structured Pruning of Deep Neural Networks in Control via Soft Coefficient Optimization","created":"2025-07-20","cited_by_count":0,"area":null},{"id":"2512.07142","title":"Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search","created":"2025-12-08","cited_by_count":0,"area":null},{"id":"2604.05856","title":"Neural Network Pruning via QUBO Optimization","created":"2026-04-07","cited_by_count":0,"area":null},{"id":"2606.01126","title":"STARFISH: faST Accuracy Recovery in pruned networks From Internal State Healing","created":"2026-05-31","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}