跳到正文
arXiv cs.CL· Dylan Johnston, Robert P. Smith·· 15 小时前AI 评分38

RidgeFill:免训练的上层缓存填充加速 prefill

RidgeFill: Training-Free Late-Layer Cache Fill for Faster Prefill

AI 导读

RidgeFill 提出一种免训练方法加速 LLM 的 prefill:下层正常计算到切分层,由每层一个岭回归映射预测后续各层输入并直接写入缓存,无需训练、不丢弃任何 token。

正文 · 原文

View PDF HTML (experimental)

Abstract:RidgeFill shortens prefill by not computing most of a model's upper layers for the prompt. The lower layers run exactly up to a split; from the split layer's state a per-layer map predicts every later layer's input, and each late layer writes its cache from that prediction. The design follows YOCO and DeepSeek-V4.1-Flash, where the projection is trained into the model. RidgeFill retrofits it onto models that were never trained for it: the map is a ridge regression fitted once in closed form from one pass over calibration text, the layer's own projections run unchanged, and a chosen set of rows, the last few thousand tokens, and every decoding step run the full model. Nothing is trained and no token is dropped.
Most of the work was in measurement, finding a repeatable methodology. Loss averaged over all tokens hides RidgeFill's error. Needle retrieval in the filled region, loss on tokens that depend on distant context, and splice tests that swap filled keys or values for exact ones show which component carries it: the keys on Llama-3.1-8B, half of it in their scale, and the values and the recurrent state on Qwen3.5-9B.
On Qwen3.8-27B in a this http URL fork on an A100, time to first token is 1.25 to 1.31x faster at 16K to 120K tokens with the maps in VRAM; RULER changes by -1.2 and -1.4 points and LongBench v2 by -1.4; the 95 % intervals include zero but do not rule out losses of a few points. On Qwen3.8-Flash-Next in vLLM it is 1.50 to 1.60x faster than exact at 9K to 32K tokens, with RULER's needle tasks at 99.8 against 100.0 and perplexity on novel tokens 2.65 % higher [-0.02 %, +4.93 %]. On three 8 to 9B reference models, at the same split and tail as the identity fill, the fitted map retrieves 49.1 and 49.6 more filled-region RULER points on the two dense models (at that split Llama's loss is worse), and its long-document loss is +/-0.03 nats of the released SwiftKV checkpoint's.
Comments: 50 pages, 15 figures, 38 tables. Code and data: this https URL
Subjects: Machine Learning (cs.LG); Computation and Language (cs.CL)
Cite as: arXiv:2611.09709 [cs.LG]
  (or arXiv:2611.09709v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2611.09709

arXiv-issued DOI via DataCite (pending registration)

Related DOI: https://doi.org/10.5281/zenodo.23890246

DOI(s) linking to related resources

Submission history

From: Dylan Johnston [view email]
[v1] Fri, 6 Nov 2026 16:52:41 UTC (473 KB)

来源:arXiv cs.CL · arxiv.org