Pith. sign in

REVIEW 3 cited by

AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference

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 2501.02336 v1 pith:HDY2Y5ZU submitted 2025-01-04 cs.CL cs.AI

classification cs.CLcs.AI
keywords inferencelong-contextskippingsublayersysnameadaptiveexistinglayer-wise
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Long-context large language models (LLMs) inference is increasingly critical, motivating a number of studies devoted to alleviating the substantial storage and computational costs in such scenarios. Layer-wise skipping methods are promising optimizations but rarely explored in long-context inference. We observe that existing layer-wise skipping strategies have several limitations when applied in long-context inference, including the inability to adapt to model and context variability, disregard for sublayer significance, and inapplicability for the prefilling phase. This paper proposes \sysname, an adaptive sublayer skipping method specifically designed for long-context inference. \sysname adaptively identifies less important layers by leveraging on-the-fly similarity information, enables sublayer-wise skipping, and accelerates both the prefilling and decoding phases. The effectiveness of \sysname is demonstrated through extensive experiments on various long-context benchmarks and models, showcasing its superior inference performance over existing baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. QTALE: Quantization-Robust Token-Adaptive Layer Execution for LLMs

    cs.LG 2026-02 conditional novelty 5.0 of 10

    QTALE's entropy-regularized routing plus an inference-time threshold adjustment recovers most of the accuracy lost when quantizing token-adaptive layer-skipping LLMs.

  2. DASH: Input-Aware Dynamic Layer Skipping for Efficient LLM Inference with Markov Decision Policies

    cs.CL 2025-05 conditional novelty 5.0 of 10

    DASH trains a token-level policy to skip, quantize, or fully run each Transformer layer, reporting 1.33x-2.0x compute reduction with smaller accuracy loss than prior skipping methods.

  3. SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decoupling

    cs.CL 2025-06 conditional novelty 4.0 of 10

    SkipGPT learns per-token, per-module routers that dynamically skip attention and MLP blocks, then uses LoRA to recover most of the original model's quality.

Pith tools