Pith. sign in

REVIEW 2 cited by

Learning to Skip for Language Modeling

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 2311.15436 v1 pith:ULPSHE5B submitted 2023-11-26 cs.CL

classification cs.CL
keywords languageearlyamountcomputationdifferentinputlearningmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Overparameterized large-scale language models have impressive generalization performance of in-context few-shot learning. However, most language models allocate the same amount of parameters or computation to each token, disregarding the complexity or importance of the input data. We argue that in language model pretraining, a variable amount of computation should be assigned to different tokens, and this can be efficiently achieved via a simple routing mechanism. Different from conventional early stopping techniques where tokens can early exit at only early layers, we propose a more general method that dynamically skips the execution of a layer (or module) for any input token with a binary router. In our extensive evaluation across 24 NLP tasks, we demonstrate that the proposed method can significantly improve the 1-shot performance compared to other competitive baselines only at mild extra cost for inference.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. End-to-End Dynamic Sparsity for Resource-Adaptive LLM Inference

    cs.IR 2026-06 unverdicted novelty 6.0 of 10

    L2A trains one LLM with input-and-budget-conditioned gates to adapt sparsity across layers, heads, and tokens, tracing the compute-accuracy frontier while staying within 0.6% of dense performance at 34% layer sparsity...

  2. SkipOPU: An FPGA-based Overlay Processor for Large Language Models with Dynamically Allocated Computation

    cs.AR 2026-03 conditional novelty 6.0 of 10

    An FPGA accelerator for SkipGPT-style pruned LLMs that fuses router/normalization/attention computation to hide nonlinear latency, packs two FP16 products in each DSP, and serves reused KV entries from on-chip URAM to...

Pith tools