dorsal/arxiv
View SchemaAdaptive Layer Selection for Layer-Wise Token Pruning in LLM Inference
| Authors | Rei Taniguchi, Yuyang Dong, Makoto Onizuka, Chuan Xiao |
|---|---|
| Categories | |
| ArXiv ID | 2601.07667vv1 |
| URL | https://arxiv.org/abs/2601.07667 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Due to the prevalence of large language models (LLMs), key-value (KV) cache reduction for LLM inference has received remarkable attention. Among numerous works that have been proposed in recent years, layer-wise token pruning approaches, which select a subset of tokens at particular layers to retain in KV cache and prune others, are one of the most popular schemes. They primarily adopt a set of pre-defined layers, at which tokens are selected. Such design is inflexible in the sense that the accuracy significantly varies across tasks and deteriorates in harder tasks such as KV retrieval. In this paper, we propose ASL, a training-free method that adaptively chooses the selection layer for KV cache reduction, exploiting the variance of token ranks ordered by attention score. The proposed method balances the performance across different tasks while meeting the user-specified KV budget requirement. ASL operates during the prefilling stage and can be jointly used with existing KV cache reduction methods such as SnapKV to optimize the decoding stage. By evaluations on the InfiniteBench, RULER, and NIAH benchmarks, we show that equipped with one-shot token selection, where tokens are selected at a layer and propagated to deeper layers, ASL outperforms state-of-the-art layer-wise token selection methods in accuracy while maintaining decoding speed and KV cache reduction.
{
"annotation_id": "b456087c-4cc6-4450-9863-2b8290a0a0b6",
"date_created": "2026-02-17T05:53:12.480000Z",
"date_modified": "2026-02-17T05:53:12.480000Z",
"file_hash": "b24c6724c0a8c4efbbc6786f970fd930ccb3efcf8dac77534f641d6f7dcb2d28",
"private": false,
"record": {
"abstract": "Due to the prevalence of large language models (LLMs), key-value (KV) cache reduction for LLM inference has received remarkable attention. Among numerous works that have been proposed in recent years, layer-wise token pruning approaches, which select a subset of tokens at particular layers to retain in KV cache and prune others, are one of the most popular schemes. They primarily adopt a set of pre-defined layers, at which tokens are selected. Such design is inflexible in the sense that the accuracy significantly varies across tasks and deteriorates in harder tasks such as KV retrieval. In this paper, we propose ASL, a training-free method that adaptively chooses the selection layer for KV cache reduction, exploiting the variance of token ranks ordered by attention score. The proposed method balances the performance across different tasks while meeting the user-specified KV budget requirement. ASL operates during the prefilling stage and can be jointly used with existing KV cache reduction methods such as SnapKV to optimize the decoding stage. By evaluations on the InfiniteBench, RULER, and NIAH benchmarks, we show that equipped with one-shot token selection, where tokens are selected at a layer and propagated to deeper layers, ASL outperforms state-of-the-art layer-wise token selection methods in accuracy while maintaining decoding speed and KV cache reduction.",
"arxiv_id": "2601.07667",
"authors": [
"Rei Taniguchi",
"Yuyang Dong",
"Makoto Onizuka",
"Chuan Xiao"
],
"categories": [
"cs.CL",
"cs.AI",
"cs.LG"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Adaptive Layer Selection for Layer-Wise Token Pruning in LLM Inference",
"url": "https://arxiv.org/abs/2601.07667",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f8a5746d-e313-4199-b9d1-8bc6ddf8e6fa",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}