Skip to content

How to Speculate about Uncertainty in Agentic Coding? A Draft-Model Gate Method

Sep 2026 · 1 citation · 22 references
Computer Science

TL;DR

Speculative Uncertainty (SU), a method that recovers a predictive failure signal for a black-box agent from its output tokens alone, with no access to logits, weights, activations, or repeated sampling, is presented.

Abstract

LLM agents deployed for software engineering fail expensively: they act confidently wrong, and bad actions are recognized only after costly execution and retry. We present Speculative Uncertainty (SU), a method that recovers a predictive failure signal for a black-box agent from its output tokens alone, with no access to logits, weights, activations, or repeated sampling. Inverting speculative decoding, a small open-weight draft model scores the agent's already-generated trajectory in a single forward pass. From these speculative cross-likelihoods we extract phase-aware features by separating the reasoning and action spans, and calibrate them against a verifiable objective. SU produces a failure-likelihood score that any downstream policy, such as routing, human intervention, or extra test-time compute, can consume directly. To show the signal is actionable, we instantiate one such policy, a pre-execution veto gate, on software engineering agents Qwen3-Coder-480B and closed-source Claude 3.5 Sonnet, cutting execution error rate by 6-8 percentage points and token cost by 14-19% in deployment, transferring to out-of-distribution benchmarks without retraining, and generalizing across agent models.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Do Agents Know When They Succeed? Calibrating Agent Confidence from Internal Representations

This paper investigates whether model's internal representations provide stronger signals of eventual task success in multi-turn agentic setups, and introduces two complementary methods: Latent Trajectory Dynamics (LTD) and the Action Representation Probe (ARP), which predicts success from representations formed at act...

Priyanka Mary Mammen, Emil Joswin, Srujananjali Medicherla · 0 citations
#artificial intelligence Preprint Sep 2026

Belief-State Engine: Augmenting LLMs for Principled Planning Under Partial Observability

It is proved that the LLM paired with the BSE is a sound Markov policy on the belief MDP induced by the underlying POMDP, and inherits the Bellman optimality guarantees of classical POMDP theory, provided the LLM is never exposed to the raw history.

Arnab Chattopadhayay, Debdipta Halder · 0 citations
Preprint Sep 2026

From Experiments to Decisions: Reusing Evidence in Autonomous Coding Research

This work reconstructs how evidence is reused in a 400-task NeuroGolf campaign, with selected wellbore-prediction records from the same operator as cross-domain comparisons, to preserve not just experimental results, but their limits on subsequent action.

Bo-Da Cheng · 0 citations
#artificial intelligence Preprint Oct 2026

DeReAct: Decomposed Reasoning and Acting for Reliable AI Agents

ReAct-based agents typically rely on a single LLM policy to propose actions, interact with the environment, and decide when a task is complete. This coupling makes action authorization and completion control difficult to enforce independently, allowing errors to propagate and unsupported completion claims to terminate...

Ajay Vohra, Tao Chen, Neeti Narayan et al. · 0 citations
#artificial intelligence Preprint Sep 2026

StateTape: Action-Conditioned Evidence Lifecycle Modeling for Long-Horizon Coding Agents

A novel and scalable framework that rewrites a coding agent's context as the repository changes rather than as the context grows, and can achieve a higher resolve rate in all experiments spanned by six coding agents and three edit-heavy benchmarks with little computational overhead.

Zi-Yang Yu, Liang Zhao, Bo-Wen Zhu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

How Strongly Should Task State Influence an LLM Agent?

Across three models, two reasoning regimes, and two domains, four findings hold without per-turn reasoning: displaying accurate state is unreliable, an unverified ledger the agent writes itself beats an accurate checklist it is shown, directives help in proportion to the model's obedience, and enforcement needs no obed...

C. Zhang, Wonbin Kweon, Jia-Wei Han · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

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