{"total":24,"rows":[{"id":"2409.17481","title":"MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models","created":"2024-09-26","cited_by_count":50,"area":null},{"id":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"area":null},{"id":"2405.16325","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","created":"2024-05-25","cited_by_count":20,"area":null},{"id":"2407.20584","title":"Pruning Large Language Models with Semi-Structural Adaptive Sparse Training","created":"2024-07-30","cited_by_count":20,"area":null},{"id":"2404.01847","title":"Accelerating Transformer Pre-training with 2:4 Sparsity","created":"2024-04-02","cited_by_count":19,"area":null},{"id":"2405.20935","title":"Effective Interplay between Sparsity and Quantization: From Theory to Practice","created":"2024-05-31","cited_by_count":19,"area":null},{"id":"2402.04744","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","created":"2024-02-07","cited_by_count":18,"area":null},{"id":"2410.09615","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","created":"2024-10-12","cited_by_count":12,"area":null},{"id":"2308.02060","title":"Accurate Neural Network Pruning Requires Rethinking Sparse Optimization","created":"2023-08-03","cited_by_count":10,"area":null},{"id":"2506.16500","title":"SparseLoRA: Accelerating LLM Fine-Tuning with Contextual Sparsity","created":"2025-06-19","cited_by_count":9,"area":null},{"id":"2409.09099","title":"S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training","created":"2024-09-13","cited_by_count":7,"area":null},{"id":"2602.18116","title":"Cut Less, Fold More: Model Compression through the Lens of Projection Geometry","created":"2026-02-20","cited_by_count":4,"area":null},{"id":"2409.09708","title":"ELSA: Exploiting Layer-wise N:M Sparsity for Vision Transformer Acceleration","created":"2024-09-15","cited_by_count":2,"area":null},{"id":"2410.16135","title":"Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUs","created":"2024-10-21","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":"2506.12876","title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","created":"2025-06-15","cited_by_count":1,"area":null},{"id":"2510.10136","title":"PermLLM: Learnable Channel Permutation for N:M Sparse Large Language Models","created":"2025-10-11","cited_by_count":1,"area":null},{"id":"2511.12097","title":"Sparse by Rule: Probability-Based N:M Pruning for Spiking Neural Networks","created":"2025-11-15","cited_by_count":1,"area":null},{"id":"2607.03784","title":"Rethinking Depth Pruning for Vision Transformers: A Heterogeneity-Aware Perspective","created":"2026-07-04","cited_by_count":1,"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":"2511.08360","title":"Extreme Model Compression with Structured Sparsity at Low Precision","created":"2025-11-11","cited_by_count":0,"area":null},{"id":"2601.22980","title":"Learnable Permutation for Structured Sparsity on Transformer Models","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2605.03667","title":"ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsity","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2608.24070","title":"Compression Trinity: Exploring Sparsity, Quantization, and Low-Rank Approximations for LLM Compression","created":"2026-08-25","cited_by_count":0,"area":null}],"next_cursor":null}