Papers for

automation platform engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Training language agents with better task sequences in complex tool environments

GRADUS: Discovering and Recovering Agent Lessons from the Environment's Latent Syllabus

Abstract: Training LLM agents for policy-constrained tool environments, such as an airline backend with booking, refund, and cancellation policies, requires tasks that exercise the environment's rules individually and in combination. Existing synthesis pipelines let a model propose tasks and retain only those it immediately solves, biasing training data toward easier behaviors. We introduce Gradus (Graded Rungs of Ascending Difficulty from an Underlying System), which decouples what a task should teach from the concrete task and solution used to teach it. Without seed tasks, Gradus treats a fixed environment as a latent syllabus, extracting guarded behavioral operators that capture how actions depend on current conditions and how their effects reshape subsequent decisions. It composes these operators into increasingly demanding tasks while using corpus-level feedback to target missing outcome combinations. Crucially, Gradus jointly calibrates tasks and solutions against the environment: execution feedback identifies which side to refine while preserving the intended behavioral requirements. Verification thus becomes a recovery signal rather than a terminal filter, coupling coverage-guided exploration with the preservation of difficult examples. From off-the-shelf backbones, the resulting curriculum lifts a 30B model from 59% to 89% on $τ^2$-Bench and from 47% to 83% on CAR-Bench with an Opus 4.5 proposer, and to 76% and 62%, respectively, with an open-weight Qwen3-235B proposer. These results show the value of jointly controlling which behaviors are explored and which survive into verified training data.

Tue 20 OctArtificial Intelligence
The gist
Some AI systems need to learn how to use software tools that have many rules, like airline booking and refund systems. The authors designed Gradus, a method that figures out the hidden steps and conditions behind the rules of such environments without needing example tasks first. Gradus creates a series of tasks that get harder and checks how well the AI did, using that feedback to improve both the tasks and the solutions. This approach helps train AI agents to understand and follow complex policies better, raising their accuracy significantly.
Open → 2610.27781v1

Guard models miss unfulfilled safety actions in AI agents

Safe Actions Alone Do Not Ensure Safe Agents: Identifying Unfulfilled Obligations with Guard Models

Abstract: Guard models are increasingly used to safeguard LLM-based agents, primarily by identifying actions that agents are forbidden to perform. However, identifying forbidden actions alone is insufficient to ensure agent safety. In this paper, we argue that agent safety also depends on identifying required yet unperformed safety-critical actions, which we call obligations. Our preliminary study on a popular benchmark for evaluating safety shows that 56.92% of GLM-5.3 trajectories contain unfulfilled obligations, compared with only 30.00% containing forbidden actions. This finding reveals unfulfilled obligations as a major and previously overlooked source of safety risk. However, to our knowledge, no existing benchmark evaluates whether guard models can identify these obligations. To close this gap, we introduce ObligationBench, the first benchmark for evaluating the capability of obligation identification, comprising 240 expert-validated trajectories covering issue resolution, feature development, and terminal operations. Our evaluation of 14 representative models reveals substantial limitations: the highest recall and exact-match rate are only 48.97% and 10.00%, respectively. To address these limitations, we develop ObligationGuard using 40,000 synthetic training examples. ObligationGuard achieves 57.52% recall and an exact-match rate of 21.67%, surpassing all evaluated models on both metrics. We call on the community to incorporate obligation identification into the design and evaluation of future guard models to improve agent safety.

Thu 8 OctArtificial Intelligence
The gist
Many AI systems are designed to avoid doing unsafe things, but this paper shows that just avoiding bad actions is not enough to keep them safe. The researchers found that AI agents often fail to take important safe actions they are supposed to do, which can be risky. They created a new test called ObligationBench to measure how well AI systems recognize these required but missing actions. Their new method, ObligationGuard, performs better than existing systems at spotting these missed safety steps, suggesting future AI safety tools should look for both bad actions and missing good actions.
Open → 2610.11773v1

StateWise improves agent reliability by fixing outdated task data

StateWise: Diagnosing and Repairing Persistent Operational State Before Agent Actions

Abstract: LLM agents combine reasoning, tool use, and persistent memory to support work across tasks by reusing stored operational records as premises for later actions. However, environmental or requirement changes can invalidate these records, while existing action review, provenance tracking, and clarification mechanisms may leave the underlying persistent state uncorrected. Our audit of coding-agent trajectories identifies candidate failure chains in which invalid records are reused, leading to task failures and unsafe modifications. We propose StateWise, a framework for diagnosing and repairing persistent operational state before action execution. StateWise uses record-level counterfactual replanning to identify decision-critical records, then establishes their current validity through reliability checks, read-only verification of machine-observable facts, and targeted clarification of developer-owned intent. Typed evidence grounding binds evidence to specific records and scopes, enabling persistent corrections with repair lineage. The agent then replans from the repaired state, followed by an independent state-action check before execution. We evaluate StateWise on 150 executable coding-agent cases across diverse runtime environments, workspace configurations, and repository settings, complemented by cross-model evaluations. Under corrupted persistent state, StateWise achieves 93.3% overall correctness, compared with 38.7% for the baseline agent, with no unsafe actions. Component ablations, multi-task experiments, and transfer evaluations further demonstrate effective recovery, persistent corrections, and transferability across repositories and tool interfaces.

Sun 4 OctSoftware EngineeringArtificial Intelligence
The gist
When AI agents reuse old information to make decisions, sometimes that information becomes wrong as situations change, leading to mistakes. The authors found that common ways of tracking and reviewing actions don’t fix these underlying errors in stored information. They created StateWise, a method that checks and corrects this outdated information before the AI acts again, helping it avoid errors and unsafe changes. Testing showed it greatly improves accuracy across different coding tasks and environments.
Open → 2610.05241v1

Dynamic agent systems improve task accuracy and efficiency per query

Dynamic Harness Search: Building Multi-Agent Systems Per-Query via Prediction

Abstract: Agent harnesses specify the roles, instructions, tools, and communication structure used to solve a task, and the right harness depends on the query. Because the value of each design choice is observable only through execution, tailoring a harness to each query has required either executing alternatives at inference time or costly manual design. We introduce SHIFT, which moves execution out of the per-query search loop. A local LLM architect learns a policy over harness-building actions from search, and a value function that predicts, from measured executions, a utility balancing accuracy against execution cost. For each query, Monte Carlo tree search uses these predictions to construct a harness. Across 9,193 tasks in six benchmarks, from math to document and general-assistant tasks, with a Gemini 3.5 Flash executor, SHIFT attains the highest mean accuracy, about 80%, outperforming 17 baselines that span prompting, prompt optimization, and workflow search, and exceeding the strongest baseline by 7.2 percentage points. A cheaper mode of SHIFT also attains a higher mean accuracy than every baseline while using 32% fewer execution tokens than the strongest baseline. We further show that choosing structure, instructions, and tools jointly beats choosing only instructions or only tools by up to 9.1 percentage points, and that learned value selection identifies more accurate harnesses with lower execution cost from candidate pools.

Fri 2 OctMachine Learning
The gist
Solving complex tasks with multiple AI agents usually requires setting up roles and tools carefully, which can be slow or need lots of trial and error. This paper presents SHIFT, a method that learns from past attempts to predict the best way to organize these agents for each new task, speeding up the process without testing many options each time. By using predictions, SHIFT builds customized setups that work better and use fewer resources than previous methods on thousands of tasks.
Open → 2610.04137v1

Small language models improve checking AI tool choices for task relevance

Toward SLM-based agentic task-tool intent matching

Abstract: Tool-equipped AI agents use tool calls to access data and act on external systems. Horizontal growth of agentic systems increases the number of these interactions, and further motivates the need for automated, per-call oversight that can operate at low latency and/or on-prem. Conventional authorization schemes can determine whether an agent is allowed to invoke a tool, but cannot assess the agent's underlying cognition, specifically, whether the tool selection represents a logical, relevant step toward satisfying the intent of the task or not. Consequently, an allowed call may still deviate from the task's intent: a rogue agent might deviate the calls or nudge other agents to make a combination of calls that would not align with the intent of the task. Therefore, every call needs to be verified. In this study we investigate the applicability of Small Language Models (SLMs) to this purpose: an SLM functions as a task-tool relevance classifier that evaluates every selected tool independently against the assigned task and returns a relevance signal for downstream enforcement. Equipped with a novel dataset with multi-tool tasks whose required tools span distinct Model Context Protocol (MCP) servers, we used prompt-optimization, supervised fine-tuning, and reinforcement learning through GRPO to optimize and specialize SLMs.

Fri 2 OctArtificial Intelligence
The gist
AI agents often use different tools to complete tasks, but sometimes they pick tools that don't really help with the main goal. The authors studied if smaller AI language models can check each tool choice quickly to see if it's actually helpful for the task. They created a new dataset where tasks need multiple tools and trained these small models to judge tool relevance better. This can help catch mistakes or bad choices while the AI is working.
Open → 2610.03213v1

Improving language model agents by alternating training and task guidance updates

VACE: Validation-Gated Alternating Co-Evolution of Agent Models and Harnesses

Abstract: Language model agents can be improved by updating their model weights or refining the harness that guides task execution. These components are coupled: weight updates change how the model uses the harness, while harness updates change the trajectories used for training. We propose VACE, Validation-Gated Alternating CoEvolution, which alternates agentic reinforcement learning with trajectory-driven harness refinement. After each RL stage, VACE reuses the collected trajectories to propose a harness revision and evaluates the incumbent and candidate with the updated model held fixed. The candidate guides subsequent training only if it improves validation performance. With Qwen3.5-9B, VACE achieves 45.26% test accuracy on OfficeQA and a mean partial-credit score of 75.19% on AutomationBench, exceeding weight-only RL by 6.43 and 9.09 percentage points and ungated alternation by 4.59 and 6.95 points, respectively. Across 44 harness proposals, 17 reduce validation performance at the updated checkpoint and are rejected before subsequent RL training, highlighting the importance of validation gating.

Tue 29 SeptMachine LearningArtificial IntelligenceComputation and Language
The gist
Language model agents can be improved not just by changing their internal parameters but also by improving how they are guided during tasks. The authors propose a method called VACE that alternates between training the model and improving its guidance system, called a harness. After each training phase, they check if the harness update actually helps using a validation step before continuing. This approach gave better results on certain question answering and automation benchmarks compared to just training the model or updating the harness without checks.
Open → 2609.37105v1

Tool agents improve request fulfillment with faster repair searches

One Readout, Many Repairs: Diffusion-Guided Hierarchical Search for Tool-Agent Repair

Abstract: Tool agents use large language models to act through external tools, yet successfully executed calls can still leave user requests unfulfilled. Tool-agent repair seeks alternative call sequences that execute successfully and fulfill the original requests. However, repair requires exploring both operation choices and their concrete realizations, making complete-sequence regeneration costly. Moreover, regeneration repeats operation selection even when failure arises from how those operations are realized. The resulting challenge is to reduce this repetition while preserving exploration of alternative operations and realizations. Therefore, we formulate repair as hierarchical search over operation supports, which we introduce as sets of permitted operation types that define reusable search regions for concrete tool-call sequences. We propose ReCommit, a training-free, diffusion-guided framework for improving tool-agent failure recovery while reducing repair computation. ReCommit amortizes operation-level proposal computation across repair trials by reusing operation-type scores from a single parallel readout of a masked diffusion language model. These scores guide search across supports, while realization search explores alternative entity bindings, arguments, and action composition within each support. Experiments on real failures across four enterprise services in the Agent-Diff benchmark show 75.9\% and 63.2\% relative recovery gains with 61.3\% and 51.3\% reductions in mean full-budget repair time at repair budgets $B=3$ and $B=13$, respectively, over the strongest evaluated 8B comparison method. ReCommit achieves a favorable recovery--cost trade-off, including in comparisons with the evaluated 32B models.

Mon 28 SeptArtificial IntelligenceComputation and Language
The gist
Sometimes, computer programs that use other tools to help perform tasks don’t complete what the user wants perfectly. The authors studied how to fix these programs without starting over each time something goes wrong. They developed a method called ReCommit that smartly guides the repair process by focusing on sets of possible actions rather than redoing everything from scratch. This approach lets the program find fixes more quickly and successfully, saving time and effort when fixing errors.
Open → 2609.34879v1

MACE improves multi-agent memory use for better task success

MACE: Memory-Agent Co-Evolution with Adaptive Memory Graphs for Multi-Agent Systems

Abstract: LLM-based multi-agent systems generate collaboration traces that record how agents plan tasks, verify intermediate results, and repair failures. Reusing these procedures requires preserving an action's prerequisites and the outputs needed by subsequent agents. Our empirical studies show that grouping these dependencies into functional memory units improves their retention, while connecting units increases retrieval of the units and links jointly required by a task. The preferred combination of units also changes between instructions and checklists, even when each combination's content is fixed across formats. Updating choices from the outcomes of each combination and format pairing outperforms scoring combinations and formats separately. These findings motivate MACE, a memory-agent co-evolution framework that adapts memory organization and agent memory use through execution feedback. Its MemGoG structure represents functional units as subgraphs of related conditions, actions, and outputs, connecting them through support, conflict, and repair relations. MACE Loop selects task-relevant units and relations within a memory budget and provides each agent with instructions or checklists for its current operation. It records the selected units, presentation formats, agent outputs, and task outcomes to update unit scores and relations for retrieval and inform subsequent presentation choices. Across eight benchmarks, MACE outperforms ten baselines with an average score of 81.11%, compared with 78.97% for the strongest baseline, SAGE.

Fri 18 SeptMachine Learning
The gist
Multi-agent systems made up of large language models can plan and work together on complex tasks. The authors found that breaking down the agents’ memory into connected groups called functional units helps them remember and reuse important steps better. They made a new system called MACE that adapts how memory is organized and used based on feedback from each task. MACE helps agents choose the best parts of memory and instructions during tasks, leading to better overall task performance compared to previous methods.
Open → 2609.21533v1