Skip to content

Matryoshka Agent: Unfolding Sub-Agents for Long-Horizon Machine Learning Engineering

Jul 2026 · arXiv.org · Vol abs/2607.25090 · 0 citations · 58 references
Computer Science

TL;DR

Experimental results on a broad range of MLE tasks with diverse model types and scales demonstrate that Matryoshka Agent is an effective and scalable paradigm for long-horizon MLE tasks and complex agentic problem solving.

Abstract

Machine learning engineering (MLE) tasks require long-horizon decision making over iterative solution debugging and refinement, under expensive and feedback-driven environment interactions. Developing and training a monolithic agent for such tasks is fundamentally challenging, as it must simultaneously manage extremely long and noisy contexts, explore vast solution spaces, and remain effective under limited model capacity and computational budgets. To address these challenges, we propose Matryoshka Agent, a unified hierarchical agent framework for complex long-horizon tasks. Matryoshka Agent decomposes agentic problem solving into a coordinated hierarchy of decision making and execution: a high-level Orchestrator maintains compact, long-horizon exploration states and issues strategic instructions, while lower-level Sub-Agents execute concrete solution attempts through direct environment interaction, mediated by standardized Tool interface. This design decouples strategic exploration from costly execution, substantially reducing the burden of long-context reasoning and enabling efficient iterative refinement. We further develop an efficient training paradigm for Matryoshka Agent. Experimental results on a broad range of MLE tasks with diverse model types and scales demonstrate that Matryoshka Agent is an effective and scalable paradigm for long-horizon MLE tasks and complex agentic problem solving. Notably, Matryoshka Agent enables Qwen3-4B-Instruct to reach Orchestrator performance comparable to o4-mini. Applying Matryoshka Agent to Qwen3-30B-Coder results in at most 36.7% relative performance gain.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

openJiuwen: Beyond Static Harnesses for Long-Horizon Coding Agents

OpenJiuwen provides a shared execution substrate and Rail-based capability composition across single agents, delegated sub-agents, and Swarm Flow, enabling developers to construct sophisticated agent harnesses under common execution semantics.

openJiuwen Team Tao Yu, Xin-Yu Zhang, Qian-Qian Chen et al. · 0 citations
Jul 2026

ACM: Agentic Context Management for Long Horizon Tasks

This work proposes Agentic Context Management (ACM), a framework that equips agents with purpose-built context editing tools for lossless context management and develops a post-training pipeline that constructs high-quality demonstrations of context management and improves model performance on both agentic search and coding tasks.

Xiaochuan Li, Ryan Ming, Meng Chu et al. · 1 citation
Jul 2026

AgentOmnia: Scaling Agentic Models for Full-Scenario Applications

A one-round study provides initial evidence for PRD-guided self-evolution, motivating validation at larger scales and in industrial settings, and presents AgentOmnia, a framework coordinating task-space definition, data synthesis, post-training, evaluation, and improvement across To-Consumer (ToC), To-Business (ToB), and To-Employee (ToE) applications.

Hao Jiang, Gang-Tao Xin, Ying Huang et al. · 0 citations
Jul 2026

CHILL-Harness: Counterfactual Harness Learning for Efficient Reasoning in Long-Horizon Agents

CHILL-Harness intervenes at the orchestration layer to enable advantage-guided workflow adaptation, thereby improving reasoning and execution efficiency while preserving task performance and incorporating a success-preserving objective and advantage-margin authorization constraints into CHILL-Harness to promote reliable adaptation.

Jiarun Fu, Lizhong Ding, Si-Da Chen et al. · 0 citations
Open access 2026

AgentSearch: Learning Efficient Agentic Workflows via Deliver Tree Search

This work introduces AgentSearch, a cost-aware Monte Carlo Tree Search (MCTS) framework that constructs agentic workflows through deliberative lookahead search and attains single-episode success while reducing computational costs by up to 47%, thereby eliminating the trial-and-error exploration required by previous adaptive methods.

D. Attota, Ying Xie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.