The reviewed record of science sign in
Pith

arxiv: 2506.03510 · v1 · pith:JOTSOH4J · submitted 2025-06-04 · cs.CL

Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JOTSOH4Jrecord.jsonopen to challenge →

classification cs.CL
keywords pruningsublayersublayersllmssprintaccuracylatencytunability
0
0 comments X
read the original abstract

How can we accelerate large language models(LLMs) without sacrificing accuracy? The slow inference speed of LLMs hinders us to benefit from their remarkable performance in diverse applications. This is mainly because numerous sublayers are stacked together in LLMs. Sublayer pruning compresses and expedites LLMs via removing unnecessary sublayers. However, existing sublayer pruning algorithms are limited in accuracy since they naively select sublayers to prune, overlooking the different characteristics of each sublayer. In this paper, we propose SPRINT (Sublayer PRuning wIth LateNcy and Tunability Information), an accurate sublayer pruning method for LLMs. SPRINT accurately selects a target sublayer to prune by considering 1) the amount of latency reduction after pruning and 2) the tunability of sublayers. SPRINT iteratively prunes redundant sublayers and swiftly tunes the parameters of remaining sublayers. Experiments show that SPRINT achieves the best accuracy-speedup trade-off, exhibiting up to 23.88%p higher accuracy on zero-shot commonsense reasoning benchmarks compared to existing pruning algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.