REVISE: Validity-Guided Recovery for Online Revisions in Agent Workflows

• URL: http://arxiv.org/abs/2609.00643v1
• Date: Tue, 01 Sep 2026 03:22:18 GMT
• Title: REVISE: Validity-Guided Recovery for Online Revisions in Agent Workflows
• Abstract summary: textscRevise is validity-guided for fine-grained recovery in structured agent.<n>It stops invalid work, preserves validity-established progress beyond the earliest conflict, and recomputes only the affected region.<n>It reduces model calls by 40.6--56.0% relative to full restart and by 31.3--43.6% relative to suffix recomputation.
• Score: 5.5444120195759785
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Agent revisions expose a fundamental correctness--efficiency trade-off during concurrent execution. Discarding ongoing work preserves latest-version correctness but wastes progress that may remain valid, whereas reusing prior work preserves efficiency but risks propagating stale state into outputs and tool effects. Existing recovery strategies resolve this trade-off in an imbalanced way with coarse-grained policies: they either favor efficiency by allowing potentially stale work to continue, or favor correctness by restarting the workflow or recomputing a linear suffix from the earliest conflict, thereby discarding unaffected progress. We present \textsc{Revise}, a validity-guided runtime for fine-grained recovery in structured agent workflows. When a revision arrives, \textsc{Revise} first intersects its delta with recorded data and control dependencies and propagates the resulting impact through the partially executed DAG to identify affected work. It then stops invalid work, preserves validity-established progress beyond the earliest conflict, and recomputes only the affected region. Incomplete provenance conservatively expands recovery, while reused results are revalidated before commit. Analysis of real coding-agent traces show online recovery opportunities: 118 sessions retain observable work before a queued later message is delivered; across 167 overlapping assistant responses, enqueue-to-completion overlap reaches 56.55~s at p95. Across 300 challenging revision/commit executions, \textsc{Revise} matches a latest-version oracle with no stale outputs or effects. On unmodified LangGraph and LLMCompiler applications using Qwen3-14B, it reduces model calls by 40.6--56.0\% relative to full restart and by 31.3--43.6\% relative to suffix recomputation. Under serving pressure, it further reduces revision-to-correct-completion tokens by 13.26\% and improves SLO goodput by 3.07--5.43\%.

Related papers

• Recoverability as a System Primitive for Long-Horizon AI Agents [5.008310199603767]
  We introduce recoverability as a system primitive that makes reuse an explicit decision.<n>Four deterministic and 20 paired file challenges demonstrate that accurate restoration and successful completion can conceal disallowed starting points.
  arXiv  Detail & Related papers  (2026-09-12T02:54:33Z)
• TROVE: Adaptive Agent Skill Orchestration via Trace-Grounded Route Validation and Editing [14.424308190797683]
  We propose Trace-grounded Route Orchestration via Validation and Editing (TROVE)<n> Offline, TROVE distills evaluated workflow-search traces into atomic and composite skills and an outcome-conditioned transition graph.<n>Online, it treats a planned route as provisional, after committing one top-level skill, the controller retains a valid continuation, inserts a trace-supported local response, or replaces only the invalid suffix.
  arXiv  Detail & Related papers  (2026-09-04T11:38:13Z)
• PURA: Provably Unbiased and Robust Multi-Bit Watermarking for AI-Generated Text Attribution [83.66032773976904]
  We present PURA, a provably unbiased and robust multi-bit watermarking method for text attribution.<n>Instead of perturbing token probabilities directly, PURA embeds payloads in the latent sampling space via keyed inverse transform sampling.<n>We show that PURA substantially outperforms existing unbiased baselines in the high-payload regime.
  arXiv  Detail & Related papers  (2026-08-23T04:44:27Z)
• Independent Patch Verification for Coding Agents with a Bidirectional Reconstruct-and-Verify Framework [49.16055123488827]
  coding agents powered by large language models can now generate code patches directly from bug reports.<n>No mechanism independently verifies whether it truly resolves the reported problem.<n>We propose RETRACE, a training-free post-generation verification framework.
  arXiv  Detail & Related papers  (2026-08-09T22:59:13Z)
• TTHE: Test-Time Harness Evolution [50.26245555541721]
  Existing approaches optimize such harnesses before deployment, searching training or development data for a fixed agent workflow that is then frozen at test time.<n>We ask whether the harness can instead be optimized during evaluation itself, using only the unlabeled execution traces the agent produces on the test inputs.<n>During evaluation, TTHE maintains a population of candidate harnesses and refines them through an agentic proposer that reasons over their execution traces.<n>A judge then commits an improved harness from execution-derived proxy signals, and the selected program persists to govern subsequent inputs.
  arXiv  Detail & Related papers  (2026-07-09T05:53:39Z)
• AgentTether: Graph-Guided Diagnosis and Runtime Intervention for Reliable LLM Agent Operation [27.0859707906163]
  AgentTether is a run-time repair framework that automates post-run diagnosis and guided recovery without modifying the underlying agent or environment.<n>It localizes failure-critical subtrajectories by combining an offline normal-behavior model with a run-local graph detector.<n>It can be deployed as an offline diagnostic-and-guidance tool or as an online repair layer.
  arXiv  Detail & Related papers  (2026-07-07T13:40:31Z)
• Getting Better at Working With You: Compiling User Corrections into Runtime Enforcement for Coding Agents [99.67681154381803]
  Test-time Rule Acquisition and Compiled Enforcement (TRACE) is a skill-layer pipeline for coding-agent runtimes.<n>Unlike runtime checks written ahead of time by developers, TRACE skills come from the user's own chat corrections.
  arXiv  Detail & Related papers  (2026-06-11T10:43:40Z)
• Regimes: An Auditable, Held-Out-Gated Improvement Loop Demonstrated on LongMemEval with ActiveGraph [0.0]
  We show that an event-sourced agent runtime turns controlled improvement into a first-class workflow.<n>When the agent's state is a deterministic projection of an append-only event log, failures are recorded, a run replays exactly from its log, and candidate patches scope to typed pipeline seams, gates are auditable.<n>We demonstrate this with Regimes, a loop on the ActiveGraph runtime that diagnoses failed evaluations, proposes a repair at a pipeline point, and promotes it only after static checks, sandbox execution, in-sample evaluation, and held-out validation.
  arXiv  Detail & Related papers  (2026-06-08T23:04:35Z)
• SKILL.nb: Selective Formalization and Gated Execution for Durable Agent Workflows [16.693609667845948]
  We introduce SKILL.nb, a framework for governing reusable agent with evidence-versus-calibrated lifecycle policies.<n>SKILL.nb uses selective formalization: execution decides which workflow steps should become executable code.<n> gate-conditioned execution lets each step run code when its gates validate, or fall back locally when drift invalidates the executable realization.
  arXiv  Detail & Related papers  (2026-06-06T08:27:18Z)
• ExComm: Exploration-Stage Communication for Error-Resilient Agentic Test-Time Scaling [57.42714978834704]
  ExComm is a communication protocol for exploration-stage agentic test-time scaling.<n>We show that ExComm consistently outperforms strong test-time scaling baselines.
  arXiv  Detail & Related papers  (2026-05-21T07:38:44Z)
• From Agent Loops to Deterministic Graphs: Execution Lineage for Reproducible AI-Native Work [0.10312968200748114]
  We introduce execution lineage: an execution model in which AI-native work is represented as a directed acyclic graph (DAG) of artifact-producing computations.<n>We compare execution-lineage replay against loop-centric update baselines on two controlled policy-memo update tasks.
  arXiv  Detail & Related papers  (2026-05-07T14:39:37Z)
• ANNEAL: Adapting LLM Agents via Governed Symbolic Patch Learning [12.44509691077682]
  We introduce ANNEAL, a neuro-symbolic agent that converts recurring failures into governed symbolic edits of a process knowledge graph.<n>Its core mechanism, Failure-Driven Knowledge Acquisition (FDKA), localizes the responsible operator, synthesizes a typed patch through constrained LLM generation, and validates the proposal.<n>Across four domains and 27 multi-seed runs, ANNEAL is the only evaluated system that commits persistent structural repairs.
  arXiv  Detail & Related papers  (2026-05-04T05:24:03Z)
• Outcome-Conditioned Reasoning Distillation for Resolving Software Issues [49.16055123488827]
  We present an Outcome-Conditioned Reasoning Distillation(O-CRD) framework that uses resolved in-repository issues with verified patches as supervision.<n>Starting from a historical fix, the method reconstructs a stage-wise repair trace backward from the verified outcome.<n>On SWE-Bench Lite, this approach increases Pass@1 by 10.4% with GPT-4o, 8.6% with DeepSeek-V3, and 10.3% with GPT-5.
  arXiv  Detail & Related papers  (2026-01-30T18:25:39Z)

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.