Skip to content

Beyond Confidence: Stability-Aware Test-Time Adaptation for LLM Reasoning

Sep 2026 · 0 citations · 37 references
Computer Science

TL;DR

This work proposes Test-Time Adaptation via Stability-Aware Confidence Optimization (TASCO), a framework that incorporates local stability into confidence-based test-time adaptation while keeping the LLM frozen and improves reasoning accuracy and token efficiency across diverse LLMs and reasoning benchmarks.

Abstract

Test-time adaptation has emerged as a lightweight alternative to costly post-training for improving the reasoning capabilities of Large Language Models (LLMs) on downstream tasks. Predictive entropy provides a model-derived signal for such adaptation, guiding models toward higher-confidence reasoning states without external verifiers or reward models. However, higher confidence does not necessarily imply correctness, as LLMs may remain highly confident along incorrect reasoning trajectories. We observe that high-confidence reasoning is more likely to be correct when confidence remains stable under local perturbations. Based on this observation, we propose Test-Time Adaptation via Stability-Aware Confidence Optimization (TASCO), a framework that incorporates local stability into confidence-based test-time adaptation while keeping the LLM frozen. TASCO operationalizes local stability by optimizing a lightweight task-level prefix under two alternative perturbation strategies: Random Perturbation promotes distributional stability across trajectories induced by nearby perturbed prefixes, whereas Sharpness-Aware Perturbation targets worst-case local sensitivity. Experiments demonstrate that TASCO improves reasoning accuracy and token efficiency across diverse LLMs and reasoning benchmarks, while behavioral analyses show that it maintains stable confidence under local perturbations without prematurely concentrating the model's predictive distribution.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

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

This work proposes SABER, a training-free framework for stability-aware early exit via adversarial branch probing, and shows that SABER reduces reasoning token consumption by 30.2% on average while maintaining competitive accuracy with full-length reasoning.

Wanzhe Cheng, Hai-Yang Xiang, Jun-Tao Li et al. · 1 citation
#natural language process... Preprint Sep 2026

When Confidence Rises Too Early: Detecting Shortcut Reasoning via Premature Answer Commitment

The Distributional Answer Commitment Score (DACS) is proposed, a distributional confidence estimator that measures the entropy of the model's probability distribution over answer commitment at each reasoning step to capture how concentrated the model's answer belief is without requiring ground-truth answers or task-spe...

Zhao-Han Zhang, Jun-Jie Liu, Chengzhengxu Li et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Test-time Calibration Learning for Large Language Model Reasoning

Reliable large language models (LLMs) must not only produce accurate answers but also express confidence that faithfully reflects their probability of being correct. Such calibration is essential for identifying uncertain predictions and supporting reliable decision-making in real-world deployment. Recent studies incor...

Zi-Zhuo Zhang, Xiong Peng, Jing-Wei Sun et al. · 0 citations
#artificial intelligence Preprint Aug 2026

AERA: Adaptive Evidence Residual Allocation for Efficient Test-Time Reasoning

The results suggest that adaptive reasoning should estimate the future value of computation rather than equating present confidence with correctness, and introduce Adaptive Evidence Residual Allocation (AERA), a sequential controller that learns whether additional computation is likely to recover a better answer from c...

Zimin Wang, I. Tsang, Hang-Wei Qian · 0 citations
Conference Aug 2026

Post-Training for Reasoning LLMs with Reinforcement Learning: A Stability–Efficiency Perspective

Reinforcement Learning (RL)-based post-training has become a key mechanism for improving reasoning Large Language Models (LLMs), especially when automated verifiers enable Reinforcement Learning with Verifiable Reward (RLVR). Recent methods, however, are increasingly modular: many apparent algorithmic advances recombin...

Liu Yang, Han Zhu, Zheng-Yang Zhong et al. · 2 citations
#artificial intelligence Preprint Sep 2026

Jailbreaks for Black-Box Uncertainty Quantification in Large Reasoning Models

While Large Reasoning Models (LRMs) excel at complex reasoning, alignment through reinforcement learning often induces systemic overconfidence. In production environments, where logits may be unavailable, robust black-box uncertainty quantification (UQ) is essential for trustworthiness and safety. Focusing on question-...

Lucas Biechy, Cédric Eichler, Adrien Boiret et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.