Skip to content

Lua-LLM: Learning Unstructured-Sparsity Allocation for Large Language Models

2025 · Neural Information Processing Systems · pp. 136850-136876 · 1 citation · 84 references
Computer Science

TL;DR

Lua-LLM is proposed, a learning-based global pruning framework that explores the optimal unstructured sparsity allocation and achieves flexible allocation for both layer-wise and intra-layer sparsity.

Abstract

Large Language Models (LLMs) have demonstrated remarkable capabilities, yet their extensive parameter scales pose significant challenges for practical deployment. Unstructured pruning has emerged as an effective model compression strategy with minimal performance loss, which introduces fine-grained sparsity for weight parameters. While existing methods employ a layer-wise pruning strategy to avoid the complexity of global pruning for billion-scale LLMs, they require appropriate sparsity allocation for the layer-wise pruning objectives and often lead to suboptimal solutions for the overall model. In this paper, we propose Lua-LLM ( L earning u nstructured-sparsity a llocation in LLMs), a learning-based global pruning framework that explores the optimal unstructured sparsity allocation. Unlike existing pruning methods, which primarily focus on allocating per-layer sparsity, Lua-LLM achieves flexible allocation for both layer-wise and intra-layer sparsity. Furthermore, Lua-LLM leverages a soft Top-K operator to approximate the importance-based mask selection mechanism, enabling efficient binary mask learning. Experimental results on LLaMA and OPT families demonstrate significant performance improvements over existing methods.

View source

Similar papers

#machine learning Preprint Aug 2026

Correlation-Aware Structured Pruning for Large Language Models

This work forms the pruning objective as a cardinality-constrained binary quadratic program that explicitly models cross-unit dependencies in the reconstruction error, and develops a greedy interaction algorithm based on dependency-aware marginal costs to optimize unit selection.

Si-Cheng Xu, Hao Shi, Wei Zhang et al. · 0 citations
#natural language process... Preprint Sep 2026

Debias-SparseGPT: Bias-Aware Pruning for Large Language Models

Debias-SparseGPT is introduced, a post-training pruning method incorporating representational debiasing using a second-order term defined over demographically contrasting inputs that consistently reduces pruning-induced bias compared to SparseGPT while preserving model perplexity and zero-shot accuracy.

Irina Proskurina, Guillaume Metzler, Antoine Gourru et al. · 0 citations
Open access 2026

StructTune: Structured Sparse Fine-Tuning for Efficient Adaptation of Large Language Models

This work introduces StructTune1, a PEFT method that uses entire rows or columns as basic units for identifying task-relevant sparse components and develops a sensitivity-based framework to efficiently identify task-relevant weight structures without full fine-tuning.

Yu-Yang Liu, Lai-Man Po, Kwok-Wai Cheung et al. · 0 citations
Preprint Aug 2026

Reservoir of Importance: Learning Semi-Structured Sparsity with Differentiable Subset Sampling

Semi-structured $N$:$M$ sparsity has emerged as a practical direction for accelerating large language models (LLMs). However, existing learnable-mask approaches incur substantial parameter and memory overhead, limiting their scalability to large models and aggressive sparsity regimes. In this work, we revisit semi-stru...

H. Dinh, Xuan Duy Ta, K. Thân et al. · 0 citations
#machine learning Preprint Sep 2026

LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometry

Extending LILA to dynamically allocate sparsity budgets via KS-scores yields state-of-the-art generative preservation at moderate compression, while uncovering fundamental single-layer architectural bottlenecks at higher compression regimes.

Sankar Behera, Dhruv Singh, Anshika Agnihotri 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.