LYNX: Learning Dynamic Exits for Confidence-Controlled Reasoning
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Large reasoning models achieve strong performance on complex tasks by generating extended chains of thought, but they often "overthink": continuing to reason long after they have enough information to answer correctly. This wastes inference-time compute and can hurt accuracy. Existing attempts to stop early either manipulate decoding with extra sampling and heuristics, rely on auxiliary verifier models, or operate only as post-hoc analysis pipelines without formal guarantees. We introduce LYNX, an online early-exit mechanism that turns a model's own hidden-state awareness into confidence-controlled stopping decisions. LYNX attaches exit decisions to naturally occurring reasoning cues (e.g., "hmm", "wait") during generation, trains a lightweight probe on hidden states at those cue tokens using supervision from forced exits, and wraps the resulting scores in split conformal prediction to obtain distribution-free control over premature exits. Crucially, we train and calibrate this probe once on a generic mathematical corpus and reuse it unchanged across benchmarks, decoding temperatures, and even non-mathematical tasks. Across three model families spanning 1.5B to 32B parameters, a single mathematically trained probe per base model yields strong accuracy--efficiency tradeoffs. On GSM8K, LYNX matches or improves baseline accuracy while reducing tokens by 40--65%; on MATH-500 it improves accuracy by up to 12 points with roughly 35--60% fewer tokens; on AIME 2024 it recovers baseline accuracy with more than 50% token savings; and on CommonsenseQA, a non-math benchmark, it transfers zero-shot with modest accuracy gains and up to 70% fewer tokens. Compared to state-of-the-art early-exit methods, LYNX offers competitive or superior Pareto frontiers while remaining fully online, requiring no proxy models at inference, and providing explicit, user-tunable confidence guarantees.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 19 of its 28 references that are in the map. First posted on arXiv 5 Dec 2025.
Builds on
19 of 28 references.
Closest ancestors · 7
Same direction, newest first
- 2025The Zero-Step Thinking: An Empirical Study of Mode Selection as Harder Early Exit in Reasoning Models22 Oct
- 2025Wait, We Don't Need to "Wait"! Removing Thinking Tokens Improves Reasoning Efficiency10 Jun
- 2025Think or Not? Exploring Thinking Efficiency in Large Reasoning Models via an Information-Theoretic Lens23 May
- 2025FlashThink: An Early Exit Method For Efficient Reasoning20 May
- 2025Between Underthinking and Overthinking: An Empirical Study of Reasoning Length and correctness in LLMs30 Apr
- 2025Dynamic Early Exit in Reasoning Models22 Apr
- 2025Reasoning Models Know When They're Right: Probing Hidden States for Self-Verification7 Apr
Other references · 12
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2023Let's Verify Step by Stepcited by 3,789
- 2016Understanding intermediate layers using linear classifier probescited by 1,353
- 2021A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantificationcited by 792
- 2022Discovering Latent Knowledge in Language Models Without Supervisioncited by 767
- 2019Designing and Interpreting Probes with Control Taskscited by 640
- 2023Conformal Language Modelingcited by 170
- 2019How Does BERT Answer Questions? A Layer-Wise Analysis of Transformer Representationscited by 63
- 2025The Trilemma of Truth in Large Language Modelscited by 6
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Modelscited by 7
- 2026Mitigating Overthinking in Large Reasoning Language Models via Reasoning Path Deviation Monitoringcited by 6
- 2026Rethinking RL for LLM Reasoning: It's Sparse Policy Selection, Not Capability Learningcited by 3
- 2026Know When To Fold 'Em: Token-Efficient LLM Synthetic Data Generation via Multi-Stage In-Flight Rejectioncited by 0
- 2026BLADE: Boundary-Expanded and Layer-Adaptive Dynamic Exit for Efficient LLM Reasoningcited by 0
- 2026Settle: Learning When to Stop Reasoningcited by 0
- 2026Settle: Learning When to Stop Reasoning30 Sep 2026
- 2026BLADE: Boundary-Expanded and Layer-Adaptive Dynamic Exit for Efficient LLM Reasoning31 Jul 2026
- 2026Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models17 May 2026
- 2026Know When To Fold 'Em: Token-Efficient LLM Synthetic Data Generation via Multi-Stage In-Flight Rejection13 May 2026
- 2026Rethinking RL for LLM Reasoning: It's Sparse Policy Selection, Not Capability Learning7 May 2026
- 2026Mitigating Overthinking in Large Reasoning Language Models via Reasoning Path Deviation Monitoring15 Mar 2026
Similar, not cited
Close in wording, no citation either way
- 2026Early Stopping for Large Reasoning Models via Confidence Dynamics
- 2025Speculative Thinking: Enhancing Small-Model Reasoning with Large Model Guidance at Inference Time
- 2026Learning to Stop without Learning to Stop: Self-Supervised Confidence Training Improves Reasoning Efficiency
- 2026TERMINATOR: Learning Optimal Exit Points for Early Stopping in Chain-of-Thought Reasoning
- 2025SpecExit: Accelerating Large Reasoning Model via Speculative Exit
- 2026Improving reasoning at inference time via uncertainty minimisation
- 2026ROM: Real-time Overthinking Mitigation via Streaming Detection and Intervention
- 2026When Does Learning to Stop Help? A Cost-Aware Study of Early Exits in Reasoning Models