[KongchangAI]
PaperTwinCheck: Evidence-Grounded Negative-Twin Verification for Stateful Tool Agents

TwinCheck

An inference-phase verification strategy for stateful tool-calling agents. It constructs counterfactual "negative twin" candidates and applies bidirectional ranking-consistency checks via paired validators to accurately identify and correct erroneous tool calls, while avoiding confusion between valid interventions and resampling noise.

Timeline (last 90 days)

Sep 24

TwinCheck is a verification strategy that runs at inference time and verifies whether to replace the agent's proposed action by constructing counterfactual candidate actions (negative twins) bound to the current trajectory.

Unverified50%
Sep 24

TwinCheck only enters the replacement consideration process when the execution trajectory satisfies the evidence conditions bound to the local failure hypothesis of the trajectory.

Unverified50%
Sep 24

TwinCheck replaces the agent's original proposal only when the negative twin simultaneously passes the structural check and the pairwise verifier prefers it under both candidate orderings.

Unverified50%
Sep 24

TwinCheck introduces a precise replay-based pairwise evaluation method that keeps the agent's parsed responses and actions fixed until the first accepted replacement, in order to isolate the intervention effect from resampling noise.

Unverified50%
Sep 24

The researchers selected 159 multi-turn BFCL V4 tasks with complete precise replay paired data for the main analysis.

Unverified50%
Sep 24

The full TwinCheck strategy improved the task success rate of the GPT-5.6 Sol model from 45.3% to 58.5%, with a 95% task bootstrap confidence interval of [8.2, 18.8].

Unverified50%
Sep 24

No regression from success to failure was observed in the experiments.

Unverified50%
Sep 24

The paper "TwinCheck: Evidence-Grounded Negative-Twin Verification for Stateful Tool Agents" was published on arXiv.

Unverified50%

All Facts (8)

Source Articles