SABER: Stability-Aware Early Exit for LLM Reasoning via Adversarial Branch Probing

• URL: http://arxiv.org/abs/2608.27963v1
• Date: Fri, 28 Aug 2026 06:13:23 GMT
• Title: SABER: Stability-Aware Early Exit for LLM Reasoning via Adversarial Branch Probing
• Abstract summary: SABER is a training-free framework for stability-aware early exit via adversarial branch probing.<n>It reduces reasoning token consumption by 30.2%--39.8% on average while maintaining competitive accuracy with full-length reasoning.
• Score: 32.867599324353456
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Large Reasoning Models (LRMs) achieve strong reasoning capabilities, yet long-chain reasoning becomes inefficient once the intermediate answer stabilizes across reasoning steps: additional reasoning yields little marginal benefit while incurring substantial inference cost. Existing early-exit methods based on confidence or entropy poorly capture reasoning stability, while consistency-based approaches rely on multi-step trajectory agreement, requiring sequential evaluations that delay exit. To better balance efficiency and reliability, we propose SABER, a training-free framework for stability-aware early exit via adversarial branch probing. SABER constructs simple yet effective semantic perturbations around intermediate reasoning states to form adversarial branches, and applies lightweight probing to estimate their likely final outcomes without full trajectory rollouts. When the probed outcomes remain consistent across branches, SABER exits early; otherwise, it continues reasoning. Experiments across multiple reasoning benchmarks and model architectures show that SABER reduces reasoning token consumption by 30.2\%--39.8\% on average while maintaining competitive accuracy with full-length reasoning.

Related papers

• Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models [17.588873255093596]
  Large Reasoning Models (LRMs) achieve strong performance by generating long chains of thought (CoT)<n>LRMs often overthink, continuing to reason after a solution has already stabilized and thereby wasting tokens and increasing latency.<n>We propose PUMA, a plug-and-play framework that combines a lightweight Redundancy Detector with answer-level verification.
  arXiv  Detail & Related papers  (2026-05-17T22:04:11Z)
• Confidence-Aware Alignment Makes Reasoning LLMs More Reliable [65.44962502963378]
  We introduce CASPO, a framework that aligns token-level confidence with step-wise logical correctness without training a separate reward model.<n>During inference, we propose Confidence-aware Thought (CaT), which dynamically prunes uncertain reasoning branches with negligible O(V) latency.<n>Experiments across ten benchmarks and multiple model families show that CASPO consistently improves reasoning reliability and inference efficiency.
  arXiv  Detail & Related papers  (2026-05-08T07:08:25Z)
• Stabilizing Efficient Reasoning with Step-Level Advantage Selection [54.563811052329235]
  We show that short-context post-training alone, using standard GRPO without any length-aware objective, already induces substantial reasoning compression.<n>We propose Step-level Advantage Selection (SAS), which operates at the reasoning-step level and assigns a zero advantage to low-confidence steps in correct rollouts and to high-confidence steps in verifier-failed rollouts.
  arXiv  Detail & Related papers  (2026-04-27T03:34:59Z)
• Efficient Test-Time Scaling via Temporal Reasoning Aggregation [5.87118425760756]
  We propose TRACE, a training-free framework for efficient test-time scaling.<n>TRACE determines when to terminate reasoning based on temporal aggregation of multi-step evidence.<n>We show that TRACE reduces reasoning token usage by 25-30% on average while maintaining accuracy within 1-2% of full-length reasoning.
  arXiv  Detail & Related papers  (2026-04-19T07:39:40Z)
• Early Stopping for Large Reasoning Models via Confidence Dynamics [55.67938134245981]
  Large reasoning models rely on long chain-of-thought generation to solve complex problems.<n>Key challenge is determining when the model should stop reasoning and produce the final answer.<n>We propose CoDE-Stop, an early stopping method that leverages the dynamics of intermediate answer confidence to decide when to terminate reasoning.
  arXiv  Detail & Related papers  (2026-04-06T17:59:45Z)
• Learning When to Sample: Confidence-Aware Self-Consistency for Efficient LLM Chain-of-Thought Reasoning [7.8668388431725695]
  Large language models (LLMs) achieve strong reasoning performance through chain-of-thought (CoT) reasoning.<n>Recent self-consistency-based approaches further improve accuracy but require sampling and aggregating multiple reasoning trajectories.<n>This paper introduces a confidence-aware decision framework that analyzes a single completed reasoning trajectory to adaptively select between single-path and multi-path reasoning.
  arXiv  Detail & Related papers  (2026-03-09T22:34:06Z)
• Balancing Faithfulness and Performance in Reasoning via Multi-Listener Soft Execution [79.98699884805636]
  Reasoning Execution by Multiple Listeners (REMUL) is a multi-party reinforcement learning approach.<n>REMUL builds on the hypothesis that reasoning traces which other parties can follow will be more faithful.<n>Speakers are rewarded for producing reasoning that is clear to listeners.
  arXiv  Detail & Related papers  (2026-02-18T02:55:55Z)
• Stop Spinning Wheels: Mitigating LLM Overthinking via Mining Patterns for Early Reasoning Exit [114.83867400179354]
  Overthinking can degrade overall performance of large language models.<n>We categorize reasoning into three stages: insufficient exploration stage, compensatory reasoning stage, and reasoning convergence stage.<n>We develop a lightweight thresholding strategy based on rules to improve reasoning accuracy.
  arXiv  Detail & Related papers  (2025-08-25T03:17:17Z)
• ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning [64.93140713419561]
  Large Reasoning Models (LRMs) perform strongly in complex reasoning tasks via Chain-of-Thought (CoT) prompting, but often suffer from verbose outputs.<n>Existing fine-tuning-based compression methods either operate post-hoc pruning, risking disruption to reasoning coherence, or rely on sampling-based selection.<n>We introduce ConCISE, a framework designed to generate concise reasoning chains, integrating Confidence Injection to boost reasoning confidence, and Early Stopping to terminate reasoning when confidence is sufficient.
  arXiv  Detail & Related papers  (2025-05-08T01:40:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.