arXiv:2510. 04399v3 Announce Type: replace Abstract: We develop a learning-theoretic framework for analyzing self-improving agents by decomposing self-modification into five axes.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
The paper introduces Generalized Agent Iteration (GAI), a formal framework that unifies iterative policy improvement and recursive self‑improvement (RSI) under a single learning paradigm. GAI treats an agent as a configuration of modifiable components and models learning as a cycle of evaluation and improvement, with two key dials: whether the improving mechanism is part of the agent and whether the evaluation standard is external. These dials distinguish between generalized policy iteration (GPI) and RSI, and classify systems as anchored, goal‑drift, or fully self‑referential, allowing existing systems to be mapped and RSI defects to be analyzed systematically.
AREX-2 is a new approach that enhances the self‑improving ability of large language model agents by combining reflection—producing better solutions—and long‑horizon execution—maintaining effectiveness over many iterations. The method synthesizes improvement trajectories from machine‑learning and algorithmic programming tasks, providing verifiable feedback and sustained iteration. Trained on this data, an agent based on Qwen3.8‑27B achieves strong performance across multiple benchmarks and continues to improve as more iterative rounds are allowed.
arXiv:2608. 10157v1 Announce Type: new Abstract: Self-improving agents seek to reduce the human engineering effort behind AI systems by enabling them to evolve and self-improve their performance over time.
The paper introduces temporal self‑distillation for reinforcement learning with verifiable rewards (RLVR), proposing that a policy can learn from a stronger future checkpoint of itself. Two methods—Near‑Future Policy Optimization (NPO) and Near‑Future Policy Distillation (NPD)—use verified future‑self trajectories and token‑level transfer, respectively, while AutoNPO adaptively selects the optimal future checkpoint. Experiments on eight image‑text benchmarks show that near‑future teachers yield higher performance than far‑future ones, indicating that the balance between new capability and learner compatibility is key.
arXiv:2607. 13104v1 Announce Type: new Abstract: Self-improving autonomous agents are moving from research prototypes to deployed systems.
The paper presents an algorithm that lets a learning agent ask for help from a mentor and transfer knowledge between similar states, enabling safe and effective learning in Markov decision processes with irreversible dynamics and infinite state spaces. It proves that both regret and the number of mentor queries grow sublinearly over time, using a sequence of three reductions to achieve a general result. The work claims to be the first formal proof that an agent can achieve high reward while becoming self‑sufficient in an unknown, unbounded, high‑stakes environment without resets.