ECHO: Efficient Causal Self-Recursion Beyond Auxiliary Multi-Token Prediction
On the map: LLM pre-training data and scaling laws → Multi-token prediction
Abstract (arXiv)
Existing Multi-token prediction (MTP) methods are auxiliary by design: the multi-horizon loss mostly trains modules attached to the backbone, and each added horizon costs another module and another pass. We propose Efficient Causal Self-Recursion (ECHO), which removes both costs. The backbone's own final layer predicts every horizon, so the supervision lands on the parameters that generate the next token, and Dynamic Depth Sampling (DDS) keeps deeper horizons affordable by drawing the training depth with probabilities that decay along depth. Future prediction thus becomes part of the autoregressive objective rather than a task attached to it, and the gains follow on both sides of it. In pretraining, added depth converts into downstream accuracy where auxiliary modules saturate, concentrating on reasoning and code at half the MTP training overhead of training every depth. At inference, the pretrained model is its own drafter: it drafts beyond the depth it was trained for, and keeps its draft-target alignment on the open-ended, high-entropy generation where post-hoc drafters lose theirs. The advantage survives a doubled token budget, a repeated pretraining run, and supervised finetuning.
Key facts. No citing papers in the map yet (data through 19 Oct 2026). Placed in Multi-token prediction, one of 8 directions in LLM pre-training data and scaling laws. Builds on 52 of its 61 references that are in the map. First posted on arXiv 17 Oct 2026.
Builds on
52 of 61 references.
Closest ancestors · 1
Same direction, newest first
Other references · 51
- 2020Language Models are Few-Shot Learnerscited by 32,760
- 2023GPT-4 Technical Reportcited by 19,192
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,489
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,627
- 2021Training Verifiers to Solve Math Word Problemscited by 10,450
- 2021Evaluating Large Language Models Trained on Codecited by 8,577
- 2020Measuring Massive Multitask Language Understandingcited by 8,168
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,517
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,812
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,820
- 2023Qwen Technical Reportcited by 3,500
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,976
38 more
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,919
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,839
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,081
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,926
- 2020GLU Variants Improve Transformercited by 1,890
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,874
- 2022Fast Inference from Transformers via Speculative Decodingcited by 1,691
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,419
- 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,148
- 2016Deep Networks with Stochastic Depthcited by 987
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 890
- 2024Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Headscited by 873
- 2024Training Large Language Models to Reason in a Continuous Latent Spacecited by 828
- 2018Universal Transformerscited by 684
- 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 632
- 2024EAGLE: Speculative Sampling Requires Rethinking Feature Uncertaintycited by 601
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approachcited by 441
- 2024Measuring short-form factuality in large language modelscited by 401
- 2025EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Testcited by 352
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 290
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 260
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 183
- 2023DistillSpec: Improving Speculative Decoding via Knowledge Distillationcited by 170
- 2026DFlash: Block Diffusion for Flash Speculative Decodingcited by 148
- 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 145
- 2025BIG-Bench Extra Hardcited by 132
- 2025MiMo: Unlocking the Reasoning Potential of Language Model -- From Pretraining to Posttrainingcited by 128
- 2023Online Speculative Decodingcited by 116
- 2025HalluLens: LLM Hallucination Benchmarkcited by 98
- 2025NVIDIA Nemotron 3: Efficient and Open Intelligencecited by 73
- 2026Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decodingcited by 41
- 2026D-PACE: Dynamic Position-Aware Cross-Entropy for Parallel Speculative Draftingcited by 20
- 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decodingcited by 19
- 2025Training Domain Draft Models for Speculative Decoding: Best Practices and Insightscited by 11
- 2026Breaking Entropy Bounds: Accelerating RL Training via MTP with Rejection Samplingcited by 10
- 2025On multi-token prediction for efficient LLM inferencecited by 8
- 2026AngelSpec: Towards Real-World High Performance Inference with Speculative Decodingcited by 6
- 2026Overcoming Joint Intractability with Lossless Hierarchical Speculative Decodingcited by 5
50 most cited of 51 All 51 (JSON)
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Match the Distribution, Not the Compute: Post-Training Multi-Token Prediction Heads
- 2025Pre-Training Curriculum for Multi-Token Prediction in Language Models
- 2026Self-Distillation for Multi-Token Prediction
- 2026What to Preserve in Recursive Computation: A Local Predictive Sufficiency Principle
- 2026LoopMTP: A looped transformer guided by latent multi-token prediction
- 2024The pitfalls of next-token prediction
- 2026AdaMTP: An Adaptive Training Paradigm for Multi-Token Prediction
- 2026ForkLeft: Entropy-First Rollouts for Prefix-Aligned Autoregressive-to-Diffusion Distillation