arXiv:2611.02797v1 Announce Type: new
Abstract: Recursively self-improving (RSI) systems are increasingly viewed as a promising means of accelerating progress toward artificial general intelligence. They aim to autonomously improve their capabilities by refining their working pipelines and recursively improving the strategies that guide subsequent refinements, with gains generalizing to unseen scenarios.However, existing evaluations lack reliable metrics to distinguish capability gains from scenario fitting, sustainable and extensible protocols for unseen tasks and difficulties, and fine-grained attribution of improvement to evolution traces. To this end, we propose SelfImprove-Bench,an RSI evaluation framework that organizes tasks into three primary capabilities (i.e., Exploring, Planning, Reasoning) as scenarios for guiding model evolution. We instantiated the tasks on games for controllability and reproducibility, and pairs them with scalable generation and orchestration driven by task templates and difficulty coefficients. Beyond task-level scores, SelfImprove-Bench organizes evaluation into generalization ladder levels G0 to G4 that measure how far gains transfer from training conditions. Experiments reveal that the evolutionary gains of existing RSI methods are inconsistent across generalization levels.
arxiv
SelfImprove-Bench: Evaluating Generalization in Self-Improving Agents
SelfImprove-Bench is a new evaluation framework for recursively self-improving (RSI) agents, organizing tasks into three core capabilities—Exploring, Planning, Reasoning—using controllable game environments. It introduces a generalization ladder (G0–G4) to measure how well capability gains transfer beyond training conditions. Experiments show that existing RSI methods achieve inconsistent generalization across these levels, highlighting the need for more robust self-improvement strategies.
Provides a rigorous, standardized benchmark for measuring generalization in self-improving AI systems, a critical gap in current RSI research.
Comments & Questions (0)
No comments yet
Be the first to comment!