Long-context / context-window extension
StreamingLLM
Efficient Streaming Language Models with Attention Sinks
Heavily superseded — a standard baseline that newer methods routinely beat
3 papers critique it · 7 beat it on benchmarks
What papers say
Verbatim critique sentences, each from a paper that cites StreamingLLM as a baseline.
While these methods differ in selecting tokens for KV cache retention, they generally apply a uniform budget size across layers, even though the optimal budget size may vary.
“The sparse attention method StreamingLLM, based on fixed sparse patterns, can guarantee some of the model's capabilities, but due to discarding a large amount of long-context information, it performs poorly on retrieval-related tasks (R.PK, R.Num, R.KV).”
“StreamingLLM~xiao2023efficient prioritizes continuous generation but compromises accuracy on long-context tasks.”
Beaten on benchmarks
Head-to-head results where a newer method reports beating StreamingLLM. Values are copied from the source paper's tables — verify against the cited paper.
TokenSelect beats StreamingLLM
49.08 vs 16.07
ReRoPE beats StreamingLLM
19.271 vs 12.656
ZigZagKV beats StreamingLLM
43.30 vs 30.18
LaCache beats StreamingLLM
5.20 vs 6.67
perplexity · [Llama2-7B-Chat, cache budget 512]
LaCache: Ladder-Shaped KV Caching for Efficient Long-Context Modeling of Large Language ModelsDHSA beats StreamingLLM
31.8 vs 27.0
Avg. · [Llama-3.1-8B-Instruct (4-bit)]
Long-Context Modeling with Dynamic Hierarchical Sparse Attention for On-Device LLMsStreamingLLM w/ C.S., I.S. beats StreamingLLM
0.70 vs 0.67
Accuracy (ACC) · [4096 evaluation length, StreamingLLM variants]
Information Entropy Invariance: Enhancing Length Extrapolation in Attention Mechanisms
What to use instead
Recent methods in the same sub-problem, not yet superseded in the knowledge base — arXiv benchmark leaders, not vetted production recommendations.