paper-with-me

홈 › Papers

Layer as Puzzle Pieces: Compressing Large Language Models through Layer Concatenation

2025-10-17 · Fei Wang, Li Shen, Liang Ding, Chao Xue, Ye Liu, Changxing Ding arxiv

Large Language Models excel at natural language processing tasks, but their massive size leads to high computational and storage demands. Recent works have sought to reduce their model size through layer-wise structured pruning. However, they tend to ignore retaining the capabilities in the pruned part. In this work, we re-examine structured pruning paradigms and uncover several key limitations: 1) notable performance degradation due to direct layer removal, 2) incompetent linear weight layer aggregation, and 3) the lack of effective post-training recovery mechanisms. To address these limitations, we propose CoMe, including a progressive layer pruning framework with a Concatenation-based Merging technology and a hierarchical distillation post-training process. Specifically, we introduce a channel sensitivity metric that utilizes activation intensity and weight norms for fine-grained channel selection. Subsequently, we employ a concatenation-based layer merging method to fuse the most critical channels across adjacent layers, enabling progressive model size reduction. Finally, we propose a hierarchical distillation protocol that leverages the correspondences between the original and pruned model layers established during pruning, thereby enabling efficient knowledge transfer. Experiments on seven benchmarks show that CoMe achieves state-of-the-art performance; when pruning 30% of LLaMA-2-7b's parameters, the pruned model retains 83% of its original average accuracy. Our code is available at https://github.com/MPI-Lab/CoMe.

📄 PDF Abstract BibTeX arXiv:2510.15304

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Crossing Cuts Polygonal Puzzles: Models and Solvers

2021-06-19 · CVPR 2021 1 · Peleg Harel, Ohad Ben-Shahar

Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered fragments, is fundamental to numerous applications, and yet most of the literature has focused thus far on l…

GANzzle: Reframing jigsaw puzzle solving as a retrieval task using a generative mental image

2022-07-12 · Davide Talon, Alessio Del Bue, Stuart James

Puzzle solving is a combinatorial challenge due to the difficulty of matching adjacent pieces. Instead, we infer a mental image from all pieces, which a given piece can then be matched against avoiding the combinatorial …

Deep LearningRetrieval

Pictorial and apictorial polygonal jigsaw puzzles: The lazy caterer model, properties, and solvers

2020-08-17 · Peleg Harel, Ohad Ben-Shahar

Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered visual fragments, is fundamental to numerous applications and yet most of the literature of the last two decades…

Solving Multiple Square Jigsaw Puzzles With Missing Pieces

2015-06-01 · CVPR 2015 6 · Genady Paikin, Ayellet Tal

Jigsaw-puzzle solving is necessary in many applications, including biology, archaeology, and every-day life. In this paper we consider the square jigsaw puzzle problem, where the goal is to reconstruct the image from a s…

Solving Small-Piece Jigsaw Puzzles by Growing Consensus

2016-06-01 · CVPR 2016 6 · Kilho Son, Daniel Moreno, James Hays, David B. Cooper

In this paper, we present a novel computational puzzle solver for square-piece image jigsaw puzzles with no prior information such as piece orientation, anchor pieces or resulting dimension of the puzzle. By "piece" we m…