Efficient Pretraining Length Scaling
On the map: Efficient LLM inference and serving → Early exit and edge inference
Abstract (arXiv)
Recent advances in large language models have demonstrated the effectiveness of length scaling during post-training, yet its potential in pre-training remains underexplored. We present the Parallel Hidden Decoding Transformer (textitPHD-Transformer), a novel framework that enables efficient length scaling during pre-training while maintaining inference efficiency. textitPHD-Transformer achieves this through an innovative KV cache management strategy that distinguishes between original tokens and hidden decoding tokens. By retaining only the KV cache of original tokens for long-range dependencies while immediately discarding hidden decoding tokens after use, our approach maintains the same KV cache size as the vanilla transformer while enabling effective length scaling. To further enhance performance, we introduce two optimized variants: textitPHD-SWA employs sliding window attention to preserve local dependencies, while textitPHD-CSWA implements chunk-wise sliding window attention to eliminate linear growth in pre-filling time. Extensive experiments demonstrate consistent improvements across multiple benchmarks.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. Builds on 52 of its 58 references that are in the map. First posted on arXiv 21 Apr 2025.
Builds on
52 of 58 references.
References · 52
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2020Longformer: The Long-Document Transformercited by 3,362
38 more
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
- 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,175
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,883
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2024OpenHands: An Open Platform for AI Software Developers as Generalist Agentscited by 956
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 763
- 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 507
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 487
- 2023Ring Attention with Blockwise Transformers for Near-Infinite Contextcited by 448
- 2023LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compressioncited by 443
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 391
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 372
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
- 20242 OLMo 2 Furiouscited by 302
- 2024Quiet-STaR: Language Models Can Teach Themselves to Think Before Speakingcited by 292
- 2021Scaling Laws for Transfercited by 265
- 2023Think before you speak: Training Language Models With Pause Tokenscited by 254
- 2022Unified Scaling Laws for Routed Language Modelscited by 249
- 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
- 2023LongNet: Scaling Transformers to 1,000,000,000 Tokenscited by 201
- 2025MiniMax-01: Scaling Foundation Models with Lightning Attentioncited by 157
- 2023SparQ Attention: Bandwidth-Efficient LLM Inferencecited by 119
- 2024Step-level Value Preference Optimization for Mathematical Reasoningcited by 71
- 2023FlashDecoding++: Faster Large Language Model Inference on GPUscited by 70
- 2025Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinkingcited by 56
- 2023Striped Attention: Faster Ring Attention for Causal Transformerscited by 52
- 2021SparseBERT: Rethinking the Importance Analysis in Self-attentioncited by 46
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
- 2025Parallel Loop Transformer for Efficient Test-Time Computation Scalingcited by 23
- 2026Hidden Decoding at Scale: Latent Computation Scaling for Large Language Modelscited by 4
- 2026Universal YOCO for Efficient Depth Scalingcited by 1
- 2026Scratchpad Patching: Decoupling Compute from Patch Size in Byte-Level Language Modelscited by 1
- 2026Hidden Decoding at Scale: Latent Computation Scaling for Large Language Models9 Jul 2026
- 2026Scratchpad Patching: Decoupling Compute from Patch Size in Byte-Level Language Models10 May 2026
- 2026Universal YOCO for Efficient Depth Scaling1 Apr 2026
- 2025Scaling Latent Reasoning via Looped Language Models29 Oct 2025
- 2025Parallel Loop Transformer for Efficient Test-Time Computation Scaling28 Oct 2025
Similar, not cited
Close in wording, no citation either way
- 2026Shallow Prefill, Deep Decoding: Efficient Long-Context Inference via Layer-Asymmetric KV Visibility
- 2025Inference-Time Hyper-Scaling with KV Cache Compression
- 2026Decode-Branch Transformers: Decoupling the Primary Prefill Path from Additional Decode Computation
- 2024Prepacking: A Simple Method for Fast Prefilling and Increased Throughput in Large Language Models
- 2026KITE: KV-Invariant Transformer Expansion for Efficient Agentic LLM Scaling
- 2025RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compression
- 2025FastKV: Decoupling of Context Reduction and KV Cache Compression for Prefill-Decoding Acceleration
- 2026SpotAttention: Plug-In Block-Sparse Routing for Pretrained Long-Context Transformers