mlsanityData to 7 Oct 2026

The End of Manual Decoding: Towards Truly End-to-End Language Models

arXiv 2510.26697 ↗First posted 30 Oct 2025cs.CL cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

The "end-to-end" label for LLMs is a misnomer. In practice, they depend on a non-differentiable decoding process that requires laborious, hand-tuning of hyperparameters like temperature and top-p. This paper introduces AutoDeco, a novel architecture that enables truly "end-to-end" generation by learning to control its own decoding strategy. We augment the standard transformer with lightweight heads that, at each step, dynamically predict context-specific temperature and top-p values alongside the next-token logits. This approach transforms decoding into a parametric, token-level process, allowing the model to self-regulate its sampling strategy within a single forward pass. Through extensive experiments on eight benchmarks, we demonstrate that AutoDeco not only significantly outperforms default decoding strategies but also achieves performance comparable to an oracle-tuned baseline derived from "hacking the test set"-a practical upper bound for any static method. Crucially, we uncover an emergent capability for instruction-based decoding control: the model learns to interpret natural language commands (e.g., "generate with low randomness") and adjusts its predicted temperature and top-p on a token-by-token basis, opening a new paradigm for steerable and interactive LLM decoding.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 26 of its 30 references that are in the map. First posted on arXiv 30 Oct 2025.

Builds on

26 of 30 references.

References · 26

  1. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  2. 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
  3. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  4. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  5. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 1,906
  6. 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
  7. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
  8. 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,258
  9. 2018Hierarchical Neural Story Generationcited by 1,182
  10. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
  11. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 975
  12. 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 948
14 more
  1. 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 793
  2. 2022Contrastive Decoding: Open-ended Text Generation as Optimizationcited by 598
  3. 2013Generating Sequences With Recurrent Neural Networkscited by 549
  4. 2023DoLa: Decoding by Contrasting Layers Improves Factuality in Large Language Modelscited by 367
  5. 2016Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Modelscited by 299
  6. 2025MathArena: Evaluating LLMs on Uncontaminated Math Competitionscited by 275
  7. 2025DeepMath-103K: A Large-Scale, Challenging, Decontaminated, and Verifiable Mathematical Dataset for Advancing Reasoningcited by 261
  8. 2022A Contrastive Framework for Neural Text Generationcited by 224
  9. 2025Llama-Nemotron: Efficient Reasoning Modelscited by 151
  10. 2025Pass@k Training for Adaptively Balancing Exploration and Exploitation of Large Reasoning Modelscited by 134
  11. 2025On the Generalization of SFT: A Reinforcement Learning Perspective with Reward Rectificationcited by 121
  12. 2024A Thorough Examination of Decoding Methods in the Era of LLMscited by 112
  13. 2022Contrastive Search Is What You Need For Neural Text Generationcited by 58
  14. 2025Trust, But Verify: A Self-Verification Approach to Reinforcement Learning with Verifiable Rewardscited by 38

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 5.

5 papers.