paper-with-me

Papers

FASP: Fast and Accurate Structured Pruning of Large Language Models

2025-01-16 · Hanyu Hu, Pengxiang Zhao, Ping Li, Yi Zheng, Zhefeng Wang, Xiaoming Yuan

The rapid increase in the size of large language models (LLMs) has significantly escalated their computational and memory demands, posing challenges for efficient deployment, especially on resource-constrained devices. Structured pruning has emerged as an effective model compression method that can reduce these demands while preserving performance. In this paper, we introduce FASP (Fast and Accurate Structured Pruning), a novel structured pruning framework for LLMs that emphasizes both speed and accuracy. FASP employs a distinctive pruning structure that interlinks sequential layers, allowing for the removal of columns in one layer while simultaneously eliminating corresponding rows in the preceding layer without incurring additional performance loss. The pruning metric, inspired by Wanda, is computationally efficient and effectively selects components to prune. Additionally, we propose a restoration mechanism that enhances model fidelity by adjusting the remaining weights post-pruning. We evaluate FASP on the OPT and LLaMA model families, demonstrating superior performance in terms of perplexity and accuracy on downstream tasks compared to state-of-the-art methods. Our approach achieves significant speed-ups, pruning models such as OPT-125M in 17 seconds and LLaMA-30B in 15 minutes on a single NVIDIA RTX 4090 GPU, making it a highly practical solution for optimizing LLMs.

📄 PDF Abstract BibTeX arXiv:2501.09412

Code (0)

등록된 구현이 없습니다.

Tasks

GPUModel Compression

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…
Pruning 설명 없음
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…
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…

Similar Papers 제목 키워드 기반

Grounding Bound Founded Answer Set Programs

2014-05-14 · Rehan Abdul Aziz, Geoffrey Chu, Peter James Stuckey

To appear in Theory and Practice of Logic Programming (TPLP) Bound Founded Answer Set Programming (BFASP) is an extension of Answer Set Programming (ASP) that extends stable model semantics to numeric variables. While …

FASPell: A Fast, Adaptable, Simple, Powerful Chinese Spell Checker Based On DAE-Decoder Paradigm

2019-11-01 · WS 2019 11 · Yuzhong Hong, Xianguo Yu, Neng He, Nan Liu 외

We propose a Chinese spell checker {--} FASPell based on a new paradigm which consists of a denoising autoencoder (DAE) and a decoder. In comparison with previous state-of-the-art models, the new paradigm allows our spel…

Chinese Spell CheckingDecoderDenoisingLanguage Modeling+1

SlimLLM: Accurate Structured Pruning for Large Language Models

2025-05-28 · Jialong Guo, Xinghao Chen, Yehui Tang, Yunhe Wang

Large language models(LLMs) have garnered significant attention and demonstrated impressive capabilities in a wide range of applications. However, due to their enormous computational costs, the deployment and application…

Fine-tune Before Structured Pruning: Towards Compact and Accurate Self-Supervised Models for Speaker Diarization

2025-05-30 · Jiangyu Han, Federico Landini, Johan Rohdin, Anna Silnova 외

Self-supervised learning (SSL) models like WavLM can be effectively utilized when building speaker diarization systems but are often large and slow, limiting their use in resource constrained scenarios. Previous studies …

GPUKnowledge DistillationSelf-Supervised Learningspeaker-diarization+1

Everybody Prune Now: Structured Pruning of LLMs with only Forward Passes

2024-02-08 · Lucio Dery, Steven Kolawole, Jean-François Kagy, Virginia Smith 외

Structured pruning is a promising approach to create smaller, faster LLMs. However, existing methods typically rely on backward passes, which can inflate memory requirements and compute costs. In this work we introduce B…

GPU