Pith. sign in

REVIEW 3 cited by

LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.09695 v1 pith:KN4PYLFX submitted 2024-04-15 cs.LG cs.AIcs.CL

LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Models

classification cs.LG cs.AIcs.CL
keywords low-ranksub-layercompressionstructuredparameterpruningdegreesimportant
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Large language models (LLMs) show excellent performance in difficult tasks, but they often require massive memories and computational resources. How to reduce the parameter scale of LLMs has become research hotspots. In this study, we make an important observation that the multi-head self-attention (MHA) sub-layer of Transformer exhibits noticeable low-rank structure, while the feed-forward network (FFN) sub-layer does not. With this regard, we design a mixed compression model, which organically combines Low-Rank matrix approximation And structured Pruning (LoRAP). For the MHA sub-layer, we propose an input activation weighted singular value decomposition method to strengthen the low-rank characteristic. Furthermore, we discover that the weight matrices in MHA sub-layer have different low-rank degrees. Thus, a novel parameter allocation scheme according to the discrepancy of low-rank degrees is devised. For the FFN sub-layer, we propose a gradient-free structured channel pruning method. During the pruning, we get an interesting finding that the least important 1% of parameter actually play a vital role in model performance. Extensive evaluations on zero-shot perplexity and zero-shot task classification indicate that our proposal is superior to previous structured compression rivals under multiple compression ratios.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Deterministic Differentiable Structured Pruning for Large Language Models

    cs.LG 2026-03 unverdicted novelty 6.0

    DDP replaces stochastic hard-concrete masks with a deterministic soft surrogate for l0-constrained structured pruning, delivering 1% performance loss on Qwen3 models at 20% sparsity and faster convergence than prior methods.

  2. CR-Net: Scaling Parameter-Efficient Training with Cross-Layer Low-Rank Structure

    cs.LG 2025-09 unverdicted novelty 6.0

    CR-Net uses cross-layer low-rank residuals in a dual-path network plus specialized recomputation to outperform prior low-rank methods on 60M-7B model pre-training while using less compute and memory.

  3. GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation

    cs.CL 2026-02 conditional novelty 5.0

    Layer pruning is accelerated and accuracy improved by using one-backward-pass gradient scores for layer selection and a single projection-compensation matrix on the most-drifted layer.