Skip to content
Review

Argus: A General-Purpose Agentic Reasoning Runtime for Long-Horizon Tasks

Aug 2026 · 2 citations · ⚡ 1 influential · 47 references
Computer Science

TL;DR

Results show that a fixed-weight, self-evolving harness can revise, recover, and accumulate verified approaches while producing structured trajectories for future supervised and reinforcement learning.

Abstract

Long-horizon reasoning requires an agentic runtime that can persist when evidence supports its current approach and pivot when measurements reveal failure, hidden constraints, or a misspecified objective. We present Argus, a persistent, self-evolving runtime in which Manager, Planner, Engineer, and Reviewer execute bounded missions over durable project state. Argus separates stable user intent from operational objectives, constraints, and verification criteria, and admits memories, skills, procedures, verifiers, routing decisions, and rejected routes only after role-owned review and, when available, task-native verification. Model weights remain fixed; self-evolution occurs through persistent runtime state and control policy, with autonomous execution between operator-owned escalation points. Across seven GPT-5.5 benchmark arenas, Argus achieves about 78% on SWE-Bench Pro versus 59% for Direct Copilot while using 1.41 times the aggregate tokens. After verification-gated self-evolution, mature SWE-Bench waves use 21% fewer solve-input tokens and 15% less active workflow time per task than startup waves, while recording 34 verifier recoveries and 22 strict review-loop rescues. Argus also reaches 76.8% on AARRI-Bench and a 28.0-point gap on mathematical data synthesis, with competitive GPU-kernel and language-model-training results. Beyond benchmarks, an optimized RWKV6 kernel was merged upstream; a multi-day mathematics campaign retained falsified routes and proof-backed frontier updates; and six paper pipelines completed 254 missions with 16 stage rollbacks. These results show that a fixed-weight, self-evolving harness can revise, recover, and accumulate verified approaches while producing structured trajectories for future supervised and reinforcement learning.

View source

Similar papers

Preprint Aug 2026

Compiling and Benchmarking Task-State Horizons for Embodied Agents

This work introduces RoboGraph, a robotic task compiler that translates state-transition dependencies into executable symbolic graphs, and constructs task-state horizons from spatial and temporal causal dependencies, including those induced by unexpected failures and interventions during task execution.

Mei Wang, Shichao Li · 0 citations
Preprint Aug 2026

Don't Solve, Just Compare: Tiny Advisors for Runtime Intervention in LLM Agents

LLM agents are emerging as an important paradigm for real-world tasks that require reasoning, tool use, and sequential decision-making. As these agents operate over longer horizons, runtime intervention offers a way to improve reliability without retraining the underlying actor. Failure detection alone is insufficient. Effective intervention must also provide a useful direction for recovery. Existing approaches often rely on an expert solver or a critic that generates task-specific corrections, incurring either the cost of another capable solver or the capacity demands of a task-capable critic. We introduce Comparison-Only Tiny Advisor (COTA), a comparison-only framework for constructive runtime intervention. In COTA, a tiny comparator judges whether sampled alternatives lead to better continuations than the actor's proposal, and repeated comparisons determine when intervention is warranted. We train the comparator using pairwise supervision constructed from same-prefix counterfactual branches. Preferred alternatives are returned as non-binding advice, leaving the original actor to replan. Across WebShop, ALFWorld, and tau^3-Retail with three actors, COTA improves all nine evaluation settings and outperforms the compared baselines. These results show that constructive runtime intervention can remain effective even when the auxiliary model has substantially weaker task-solving capability than the actor.

Yanze Jiang, Mingxuan Li, Yuhao Wang et al. · 0 citations
Preprint Aug 2026

LongHorizon-Harness: Advancing Long-Horizon Agents for Real-World Tasks

This work reformulate long-horizon execution as a task-state management problem and proposes LongHorizon-Harness, which maintains the task state explicitly outside execution and updates it only with facts independently verified from the environment.

Ziyu Ma, Hailang Huang, Shun Zou et al. · 2 citations
Preprint Aug 2026

AstronOS: A Unified Execution Model and Runtime for Long-Horizon Agentic Systems

A unified execution model that maintains a work item's persistent identity and versioned authoritative state across calls is introduced that is associated with higher end-to-end pass rates across fresh sessions in this benchmark, at a measurable time cost.

Zhenhang Nie, Gui Zheng, Xudong Sun et al. · 0 citations
Preprint Aug 2026

AgentRewind: Recoverable Execution for Long-Horizon LLM Agents

AgentRewind is presented, a runtime recovery framework that records aligned checkpoints of the agent context and controlled environment, allowing agents to return to an earlier state and resume execution with information from previous attempts, improving task success rate and average checklist progress over the compared baselines.

Yu Zhuang, Kefei Chen, Yitong Duan et al. · 2 citations