DART: Semantic Recoverability for Structured Tool Agents
Quick Take
DART introduces semantic recoverability for structured tool agents, addressing the dilemma of efficient local recovery versus safe task replay. It certifies recoverable boundaries and selects restore points that preserve downstream commitments, achieving successful recovery in commitment-sensitive scenarios where traditional methods fail.
Key Points
- DART localizes failures and certifies semantically recoverable boundaries.
- It aligns checkpoints with recoverable boundaries to optimize recovery.
- The system successfully recovers all evaluated commitment-sensitive cases.
- A five-domain safety audit found no unsafe admitted rollbacks.
- Sound local recovery requires explicit admissibility checks.
Article Content
From source RSS / original summaryarXiv:2605. 23311v1 Announce Type: new Abstract: When a structured tool agent fails mid-execution, the runtime faces a dilemma: replaying the entire task is safe but wasteful, while restoring from a local checkpoint is efficient but can leave committed downstream work tied to an upstream history that no longer exists. This tension is acute in commitment-sensitive settings, where rollback targets a single failed instance yet downstream consumers have already acted on its output.
Existing recovery approaches provide mechanical rollback but no criterion for whether a local restore remains semantically valid after downstream commitment.
We formalize this gap as semantic recoverability and address it in DART, a modular runtime that localizes the failed instance, certifies semantically recoverable boundaries of that instance, aligns checkpoints to those boundaries, and selects an admissible restore point that preserves committed downstream work under dependency and effect constraints-or blocks otherwise.
Across three LLM-driven domains and external validation on a LangGraph-based substrate, DART correctly recovers all evaluated commitment-sensitive cases where baseline local recovery fails, and a five-domain safety audit finds no unsafe admitted rollbacks. These results show that controller legality does not imply semantic validity, and that sound local recovery requires an explicit admissibility check.
Reader Mode unavailable (could not extract clean content).
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →The Importance of Out-of-Band Metadata for Safe Autonomous Agents: The Redpanda Agentic Data Plane
The Redpanda Agentic Data Plane (ADP) introduces out-of-band metadata channels to enhance the safety of autonomous AI agents, ensuring secure data access and tamper-proof audit trails. This architecture mitigates risks associated with unpredictable AI behavior by enforcing governance throughout the agent lifecycle, demonstrated in a multi-agent trading system with strict data scoping and approval thresholds.