Skip to content
Preprint

F-WANDA: Fisher-Reweighted Post-Training Pruning for Sustainable Deployment of Large Language Models

Aug 2026 · 0 citations · 24 references
Computer Science

TL;DR

F-WANDA is introduced, a drop-in modification of WANDA that reallocates the per-row keep budget across output neurons in proportion to the empirical Fisher information of the pre-activation, placing F-WANDA on the Pareto frontier of quality versus pruning cost for sustainable LLM compression.

Abstract

One-shot post-training pruning is the most energy-frugal compression strategy for largelanguage models (LLMs), yet existing approaches trade either quality (WANDA) or compute cost (SPARSEGPT). We introduce F-WANDA, a drop-in modification of WANDA that reallocates the per-row keep budget across output neurons in proportion to the empirical Fisher information of the pre-activation. The Fisher signal is collected in a single additional backward pass over the same calibration corpus WANDA already uses; no weights are updated. On LLAMA-2-7B at 50 % unstructured sparsity, F-WANDA attains WikiText-2 perplexity of 6.85, matches WANDA fluency, and improves 5-shot MMLU by +1.6 pp over WANDA and +1.1 pp over SPARSEGPT, while incurring only one-third of SPARSEGPT pruning wall-clock and energy. The headline trade-off is achieved without extra calibration data or fine-tuning, placing F-WANDA on the Pareto frontier of quality versus pruning cost for sustainable LLM compression.

View source

Similar papers

Jul 2026

Super-Tuning: From Activation-Aware Pruning to Sparse Fine-Tuning

The results suggest that simple pruning-inspired orderings can provide useful fixed sparse supports for PEFT, especially when combined with low-rank adapters.

Ivan D. Ilin, Philip Zmushko, Peter Richtárik · 0 citations
Conference Open access 2026

LaCo: Layer-wise Compensation for Pruned Large Language Models

Pruning is essential for the efficient deployment of Large Language Models (LLMs); however, it causes severe performance degradation due to the structural distortion induced by sparsity. Existing recovery strategies, such as LoRA, predominantly employ global fine-tuning, often overlooking the mechanistic root of this d...

Yingen Liu, Fan Wu, Xuyan Pan et al. · 0 citations
Jul 2026

CoCurve: Cross-Module Co-Pruning Curvature for Training-Free Structured LLM Pruning

CoCurve (Cross-Module Co-Pruning Curvature), a calibration-only, fine-tuning-free method that prunes attention and FFN units jointly, and reduces to one budgeted quadratic program, solved in a single shot under a shared attention--FFN budget, with no labels, fine-tuning, or recovery.

Z. Gong, Zihao Zeng, Zijie Wang et al. · 1 citation
Preprint Jul 2026

Uncertainty-gated selection for block-sparse attention

A value-of-information router that measures, for each query, how decisively the top-k cut was made, and doubles the kept set for the queries where that gap is smallest is proposed; the rule is backbone-agnostic and stacks with existing block-scoring methods such as Quest.

T. Rossi · 0 citations
Jul 2026

It Takes a MAESTRO To Prune Bad Experts

MAESTRO (Markov-chain Approximated Expert Sparsification via Transition-based ROuting), a structured pruning framework designed for MoE architectures that models autoregressive expert activation trajectories as Ergodic Markov chains whose stationary distributions encode cross-layer dependencies, yielding a globally awa...

Palaash Goel, Ayush Maheshwari, Tanmoy Chakraborty · 1 citation
Jul 2026

TopoTuner: Topological Finetuning of Large Language Models

TopoTuner is competitive with full fine-tuning while training only 1-2% of the model parameters, and outperforms LoRA in 7 out of 9 model-dataset settings, which can change up to 39.57% of the projection parameters.

Abdulkadir Erol, Yash Mahajan, Vepaul Hariprashad et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.