paper-with-me

홈 › Papers

GRASPrune: Global Gating for Budgeted Structured Pruning of Large Language Models

2026-04-21 · Ziyang Wang, Jiangfeng Xiao, Chuan Xiao, Ruoxiang Li, Rui Mao, Jianbin Qin arxiv

Large language models (LLMs) are expensive to serve because model parameters, attention computation, and KV caches impose substantial memory and latency costs. We present GRASPrune, a structured pruning framework applied after pretraining that jointly prunes FFN channels and KV head groups under a single global budget. Instead of learning importance scores without constraints and applying the budget only after training, GRASPrune learns lightweight gate scores with a projected straight-through estimator that enforces a hard mask satisfying the budget at every step while keeping the backbone weights frozen. After the mask is fixed, we calibrate scaling factors on the retained units to mitigate scale mismatch caused by pruning, and fold these factors into the pruned weights to obtain a smaller dense checkpoint with no extra parameters at inference. On LLaMA-2-7B, GRASPrune removes 50% of parameters and achieves 12.18 perplexity on WikiText-2 while maintaining competitive average zero-shot accuracy on five benchmarks, using four epochs on 512 unlabeled calibration sequences on a single NVIDIA A100 80GB GPU without any full model fine-tuning.

📄 PDF Abstract BibTeX arXiv:2604.19398

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocation

2020-04-05 · ECCV 2020 8 · Xuefei Ning, Tianchen Zhao, Wenshuo Li, Peng Lei 외

Budgeted pruning is the problem of pruning under resource constraints. In budgeted pruning, how to distribute the resources across layers (i.e., sparsity allocation) is the key problem. Traditional methods solve it by di…

Budgeted Attention Allocation: Cost-Conditioned Compute Control for Efficient Transformers

2026-05-07 · Amrit Nidhi arxiv

Transformers usually expose one inference cost per trained model, while deployed systems often need multiple cost-quality operating points. We study Budgeted Attention Allocation, a monotone head-gating mechanism conditi…

Budgeted Broadcast: An Activity-Dependent Pruning Rule for Neural Network Efficiency

2025-09-26 · Yaron Meirovitch, Fuming Yang, Jeff Lichtman, Nir Shavit arxiv

Most pruning methods remove parameters ranked by impact on loss (e.g., magnitude or gradient). We propose Budgeted Broadcast (BB), which gives each unit a local traffic budget (the product of its long-term on-rate $a_i$ …

Face Identification

An Once-for-All Budgeted Pruning Framework for ConvNets Considering Input Resolution

2020-12-02 · Wenyu Sun, Jian Cao, Pengtao Xu, Xiangcheng Liu 외

We propose an efficient once-for-all budgeted pruning framework (OFARPruning) to find many compact network structures close to winner tickets in the early training stage considering the effect of input resolution during …

Allimage-classificationImage Classificationobject-detection+1

StructPrune: Structured Global Pruning asymptotics with $\mathcal{O}(\sqrt{N})$ GPU Memory

2025-09-25 · Xinyuan Song, Guangji Bai, Liang Zhao arxiv

Pruning is critical for scaling large language models (LLMs). Global pruning achieves strong performance but requires $\mathcal{O}(N)$ memory, which is infeasible for billion-parameter models. Local pruning reduces GPU m…