FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decoding
On the map: Efficient LLM inference and serving → Speculative decoding
Abstract (arXiv)
Speculative decoding accelerates LLM generation through lightweight drafting and parallel verification. It is particularly promising for long inputs, where KV-cache access costs can be amortized over multiple accepted tokens. Yet most drafters are trained on short sequences and degrade on long inputs, while long-context training is costly. Existing training-free approaches restrict the context window, rescale positions, or augment recent context with retrieved distant entries. Drafters, however, read target hidden states that already encode contextual and positional information, and their lightweight architecture makes full-history attention affordable. We propose FOLD, a training-free method that preserves exact local positions and treats all distant entries as far memory at a shared position. To counter attention dilution as the memory grows, we sharpen attention within it to emphasize relevant entries while separately controlling its total weight relative to the local window. Across six target-drafter pairs and diverse benchmarks of up to 256K tokens, FOLD predominantly delivers the highest speedup, with the best case more than doubling the speedup over autoregressive decoding, from 2.08× to 4.22×.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Speculative decoding, one of 12 directions in Efficient LLM inference and serving. Builds on 32 of its 41 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
32 of 41 references.
Closest ancestors · 14
Same direction, newest first
- 2026H-Spec: Parallel Speculative Decoding Without a Drafter-Side KV Cache21 Sep
- 2026LiLiCorr: Lightweight Likelihood Correlation of Parallel Drafts for Speculative Decoding20 Aug
- 2026DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation6 Jul
- 2026Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding28 May
- 2026SPEED-Bench: A Unified and Diverse Benchmark for Speculative Decoding10 Feb
- 2026Vegas: Self-Speculative Decoding with Verification-Guided Sparse Attention6 Feb
- 2026DFlash: Block Diffusion for Flash Speculative Decoding5 Feb
- 2025SpecExtend: A Drop-in Enhancement for Speculative Decoding of Long Sequences27 May
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test3 Mar
- 2025LongSpec: Long-Context Lossless Speculative Decoding with Efficient Drafting and Verification24 Feb
- 2024MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding20 Aug
- 2024TriForce: Lossless Acceleration of Long Sequence Generation with Hierarchical Speculative Decoding18 Apr
2 more
Other references · 18
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2025Qwen3 Technical Reportcited by 8,820
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,141
- 2023Extending Context Window of Large Language Models via Positional Interpolationcited by 740
- 2024LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitaskscited by 379
6 more
- 2024∞Bench: Extending Long Context Evaluation Beyond 100K Tokenscited by 367
- 2023RepoBench: Benchmarking Repository-Level Code Auto-Completion Systemscited by 353
- 2024InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memorycited by 197
- 2022Transformer Language Models without Positional Encodings Still Learn Positional Informationcited by 150
- 2024Why Does the Effective Context Length of LLMs Fall Short?cited by 63
- 2024Long Code Arena: a Set of Benchmarks for Long-Context Code Modelscited by 50
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026FlexDraft: Flexible Speculative Decoding via Attention Tuning and Bonus-Guided Calibration
- 2026Strong Drafts Need Compact Memories: Long-Context Speculative Decoding with Compressed KV Cache
- 2026When Hidden States Drift: Can KV Caches Rescue Long-Range Speculative Decoding?
- 2026A Sparse Glimpse of the Whole: Train-Free Self-Speculative Decoding
- 2026LongSpark: Efficient speculative decoding with a fixed-cost parallel drafter
- 2026Carryover Drafting: Recycling Rejected States for Speculative Decoding
- 2025Fail Fast, Win Big: Rethinking the Drafting Strategy in Speculative Decoding via Diffusion LLMs
- 2026KnapSpec: Self-Speculative Decoding via Adaptive Layer Selection as a Knapsack Problem