One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models

Existing pruning methods for large language models (LLMs) focus on achieving high compression rates while maintaining model performance.Although these methods have demonstrated satisfactory performance in handling a single user's compression request, their processing time increases linearly with the number of requests, making them inefficient for realworld scenarios with multiple simultaneous requests.To address this limitation, we propose a Univeral Model for Customized Compression (UniCuCo) for LLMs, which introduces a Strat-Net that learns to map arbitrary requests to their optimal pruning strategy.The challenge in training StratNet lies in the high computational cost of evaluating pruning strategies and the non-differentiable nature of the pruning process, which hinders gradient backpropagation for StratNet updates.To overcome these challenges, we leverage a Gaussian process to approximate the evaluation process.Since the gradient of the Gaussian process is computable, we can use it to approximate the gradient of the non-differentiable pruning process, thereby enabling StratNet updates.Experimental results show that UniCuCo is 28 times faster than baselines in processing 64 requests, while maintaining comparable accuracy to baselines.

Authors

Institutions

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.findings-acl.132
Citations
2
Primary Topic
Natural Language Processing Techniques
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models

Rongguang Ye, Ming Tang
2 citations
Natural Language Processing Techniques
4.96
article

One-for-All Pruning: A Universal Model for Customized Compression of Large Language Models

Rongguang Ye, Ming Tang
article en
2 citations

Abstract

Existing pruning methods for large language models (LLMs) focus on achieving high compression rates while maintaining model performance.Although these methods have demonstrated satisfactory performance in handling a single user's compression request, their processing time increases linearly with the number of requests, making them inefficient for realworld scenarios with multiple simultaneous requests.To address this limitation, we propose a Univeral Model for Customized Compression (UniCuCo) for LLMs, which introduces a Strat-Net that learns to map arbitrary requests to their optimal pruning strategy.The challenge in training StratNet lies in the high computational cost of evaluating pruning strategies and the non-differentiable nature of the pruning process, which hinders gradient backpropagation for StratNet updates.To overcome these challenges, we leverage a Gaussian process to approximate the evaluation process.Since the gradient of the Gaussian process is computable, we can use it to approximate the gradient of the non-differentiable pruning process, thereby enabling StratNet updates.Experimental results show that UniCuCo is 28 times faster than baselines in processing 64 requests, while maintaining comparable accuracy to baselines.

Southern University of Science and Technology (CN)
National Natural Science Foundation of China, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 5%
Natural Language Processing Techniques
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.