paper-with-me

Papers

LLM-Barber: Block-Aware Rebuilder for Sparsity Mask in One-Shot for Large Language Models

2024-08-20 · Yupeng Su, Ziyi Guan, Xiaoqun Liu, Tianlai Jin, Dongkuan Wu, Graziano Chesi, Ngai Wong, Hao Yu

Large language models (LLMs) have grown significantly in scale, leading to a critical need for efficient model pruning techniques. Existing post-training pruning techniques primarily focus on measuring weight importance on converged dense models to determine salient weights to retain. However, they often overlook the changes in weight importance during the pruning process, which can lead to performance degradation in the pruned models. To address this issue, we present LLM-Barber (Block-Aware Rebuilder for Sparsity Mask in One-Shot), a novel one-shot pruning framework that rebuilds the sparsity mask of pruned models without any retraining or weight reconstruction. LLM-Barber incorporates block-aware error optimization across Self-Attention and MLP blocks, ensuring global performance optimization. Inspired by the recent discovery of prominent outliers in LLMs, LLM-Barber introduces an innovative pruning metric that identifies weight importance using weights multiplied by gradients. Our experiments show that LLM-Barber can efficiently prune models like LLaMA and OPT families with 7B to 13B parameters on a single A100 GPU in just 30 minutes, achieving state-of-the-art results in both perplexity and zero-shot performance across various language benchmarks. Code is available at https://github.com/YupengSu/LLM-Barber.

📄 PDF Abstract BibTeX arXiv:2408.10631

Code (1)

yupengsu/llm-barber 공식 구현 pytorch

Tasks

GPU

Methods 이 논문이 사용한 방법론

LLaMA LLaMA is a collection of foundation language models ranging from 7B to 65B parameters. It is based on the transformer architecture with various improvements that were…
Pruning 설명 없음
OPT OPT is a suite of decoder-only pre-trained transformers ranging from 125M to 175B parameters. The model uses an AdamW optimizer and weight decay of 0.1. It follows a linear…
Focus 설명 없음

Similar Papers 제목 키워드 기반

Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks

2021-02-16 · NeurIPS 2021 12 · Itay Hubara, Brian Chmiel, Moshe Island, Ron Banner 외

Unstructured pruning reduces the memory footprint in deep neural networks (DNNs). Recently, researchers proposed different types of structural pruning intending to reduce also the computation complexity. In this work, we…

db-SP: Accelerating Sparse Attention for Visual Generative Models with Dual-Balanced Sequence Parallelism

2025-11-28 · Siqi Chen, Ke Hong, Tianchen Zhao, Ruiqi Xie 외 arxiv

Scaling Diffusion Transformer (DiT) inference via sequence parallelism is critical for reducing latency in visual generation, but is severely hampered by workload imbalance when applied to models employing block-wise spa…

Efficiently Dispatching Flash Attention For Partially Filled Attention Masks

2024-09-23 · Agniv Sharma, Jonas Geiping

Transformers are widely used across various applications, many of which yield sparse or partially filled attention matrices. Examples include attention masks designed to reduce the quadratic complexity of attention, sequ…

Spartan: Differentiable Sparsity via Regularized Transportation

2022-05-27 · Kai Sheng Tai, Taipeng Tian, Ser-Nam Lim

We present Spartan, a method for training sparse neural network models with a predetermined level of sparsity. Spartan is based on a combination of two techniques: (1) soft top-k masking of low-magnitude parameters via a…

Network Pruning

Masked Representation Modeling for Domain-Adaptive Segmentation

2025-09-17 · Wenlve Zhou, Zhiheng Zhou, Tiantao Xian, Yikui Zhai 외 arxiv

Unsupervised domain adaptation (UDA) for semantic segmentation seeks to transfer models from a labeled source domain to an unlabeled target domain. While auxiliary self-supervised tasks such as contrastive learning have …

Unsupervised Domain AdaptationSemantic SegmentationContrastive Learning