DAEDALUS: Bootstrapping Agent Memory from Self-Generated Tasks
cs.AI, cs.CL, cs.LG
Submitted: 2026-10-06
Updated: 2026-10-06
Comments: 9 pages (31 including Appendix), 8 figures (11 including Appendix). We release the code and artifacts, including generation and inference traces, at https://github.com/illuin-tech/daedalus
Code: https://github.com/illuin-tech/daedalus
License: http://creativecommons.org/licenses/by/4.0/
The gist: LLM agents often lack the operational knowledge to act reliably in new environments, as they must discover specific tool behaviors or environment conventions on their own.
Terminology
Abstract
LLM agents often lack the operational knowledge to act reliably in new environments, as they must discover specific tool behaviors or environment conventions on their own. Without memory of past attempts, they repeat the same mistakes across tasks, leading to more task failures and longer trajectories. To address this, agentic systems typically rely on human-written guidelines or on procedural memory built from training tasks and an oracle verifier, both of which require prior knowledge of the environment. We present DAEDALUS, a method for bootstrapping reusable agent memory from self-generated practice without existing tasks or oracle verifiers. DAEDALUS pairs two agents: an explorer that interacts with the environment to generate challenging yet solvable tasks, and a solver that attempts them. A heuristic is derived from each solver failure and accepted only after the solver repeatedly succeeds with that heuristic in context. These outcomes also provide feedback for the explorer to refine the difficulty of future tasks. Accepted heuristics are then consolidated into a memory bank for test-time use. Across AppWorld, τ squared-bench, and AutomationBench, DAEDALUS improves mean success rates by up to 15.9 points and pass 5 by up to 2.2x over a no-memory baseline, and is competitive with methods using training tasks, at a lower inference cost than most. We show that performance gains already emerge with a small exploration budget, and that its heuristics also benefit agents from other model families. Our ablations further reveal that solver traces provide the key information needed to derive effective heuristics, while factorizing early discoveries makes exploration more cost-efficient. Beyond memory construction, we find that the tasks generated by DAEDALUS can serve as a proxy for benchmark tasks when ranking models by performance. Code and artifacts: www.github.com/illuin-tech/daedalus.
Sources
- PREPING: Zero-Task Agent Memory Construction via Self-Practice
- Agent-World: Scaling Real-World Environment Synthesis for Evolving General Agent Intelligence
- Trajectory-Informed Memory Generation for Self-Improving Agent Systems
- Skill Self-Play: Pushing the Frontier of LLM Capability with Co-Evolving Skills
- The Shift to Agentic AI: Evidence from Codex
- SPICE: Self-Play In Corpus Environments Improves Reasoning
- SPADE: Self-Play in Adaptive Synthetic Executable Environments
- Artificial Intelligence Index Report 2026
- AutomationBench
- OBLIQ-Bench: Exposing Overlooked Bottlenecks in Modern Retrievers with Latent and Implicit Queries
- Autonomous Continual Learning for Environment Adaptation of Computer-Use Agents
- SkillOpt: Executive Strategy for Self-Evolving Agent Skills
- Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models
- SkillWeaver: Web Agents can Self-Improve by Discovering and Honing Skills
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems