Agents

LLM agents and the systems around them: harnesses and orchestration, tool use and MCP, multi-agent systems, agent memory and planning

600 articles · page 8 of 13

Agents

Models Learn to Allocate Context and Scale Inference More Effectively

Li and colleagues study contextual reasoning, the ability to allocate multiple context windows and decide what information should pass between them during inference. Their Hermes harness gives models varying degrees of control over those decisions, while Hermes-Learn uses supervised fine-tuning followed by reinforcement learning to teach smaller models how to use that control. The authors report that training produces adaptive strategies and performance gains that persist across benchmarks, models, and inference budgets.

·3 min
Agents

Reusable harness components let agents adapt workflows to each task

Kuang and colleagues argue that a single agent harness is poorly suited to heterogeneous tasks because mechanisms such as verification, context management and termination logic can help in one setting but distract or slow an agent in another. Their STITCH framework composes task-specific harnesses from reusable primitives, improving reported task success by up to 12 percentage points over fixed harnesses while adding 2.7% test-time overhead.

·3 min
Agents

Selective self-distillation helps LLM judges generalize on subjective evaluations

Hong et al. train LLM judges using preference rationales and rubrics rather than relying only on rewards for correct final verdicts. Their position-selective self-distillation method withholds supervision at tokens where feedback sharply narrows the model toward one expression, improving generalization and outperforming outcome-supervised reinforcement learning by 2 to 9 percentage points on evaluated subjective categories.

·3 min
Agents

Cross-checking coding agents improves reliability in automated model research

Chen and colleagues present RankEvolve, a harness that automates repeated proposal, implementation, training and evaluation of ranking-model changes while enforcing a predefined experimental process. Their central result is that combining Claude Code and Codex as cross-checking execution nodes raised fully correct execution from 45.8 percent to 62.5 percent, although consequential defects still passed silently in 10.4 percent of cases.

·3 min
Agents

Research agents can reuse experience to avoid unnecessary experiments

Wei and colleagues introduce Experimental Experience Modeling, a memory framework that helps autonomous research agents decide whether a candidate direction merits costly full-scale evaluation. Instead of treating every experiment independently, the framework distills earlier outcomes into reusable records, retrieves relevant evidence, and commissions a low-cost pilot when the available evidence is insufficient.

·2 min
Agents

Contrasting multiple trajectories sharpens skill learning for LLMs

Li et al. propose SkillCome, a method that improves large language models by iteratively refining textual skills. For each question, the system generates multiple trajectories, contrasts successful and failed ones to pinpoint effective actions, and accumulates evidence across iterations in a dual memory system. On six benchmarks spanning reasoning and agentic tasks, SkillCome consistently outperformed prior skill evolution baselines, with gains up to +5.69 points.

·3 min
Agents

StepLearn lets agents use new knowledge immediately while requiring validation before persistent reuse.

The authors introduce StepLearn, a nonparametric framework for test-time learning in LLM agents. Instead of learning only from completed episodes, StepLearn distills individual transitions into hypotheses that can guide the next decision, while deferring persistent reuse until those hypotheses are prospectively validated in later episodes. Across five rounds on WebArena-Lite and ALFWorld, StepLearn outperforms the strongest baseline EvoTest by 2.2 to 12.7 percentage points.

·3 min
Agents

Statistical gates help self-editing agents avoid lasting performance regressions

Wang et al. examine how agents decide whether to retain proposed edits to persistent instructions that encode workflows, tool use and decision rules. Their SAGE gate compares old and edited skills on the same validation items, penalizes regressions, and abstains when evidence of improvement is statistically weak. Across five benchmarks and four language models, it reduced regressions in 19 of 20 settings while producing the highest final score in every setting.

·3 min
Agents

Specialized executors follow declared agent plans more faithfully

Oota et al. separate agent planning into two problems: choosing an appropriate planning mode and executing that mode faithfully. Across four benchmarks and three language models, generic Plan+ReAct agents frequently abandoned their declared structure, while pattern-specific executors largely closed this execution gap. The remaining weakness was selection, since models did not reliably choose the best mode for each task.

·3 min
Agents

Counterfactual credit teaches language models which memories stay useful

Tang, Liu and Sarabi address a central problem in persistent language-model memory: a rewrite may help only much later, and its apparent value may actually come from information already stored. Their Memory Gain Policy Optimization method compares updated and prior memory states to isolate the value created by each rewrite, improving document-level information extraction while cutting average memory length by nearly 80% from the initial policy.

·2 min
Agents

Retrieving existing agent skills improves optimization across different execution harnesses

Chu et al. introduce Retrieval-Augmented Skill Optimization, or RASO, for improving the natural-language instructions that guide agents inside particular tool and execution environments. Across four benchmarks and two language models, the authors report that retrieving and adapting existing skills consistently outperformed optimization baselines that lacked retrieval during initialization and updating.

·2 min