Title: InternAgent-MLE: Navigating Fine-Grained Optimization for Coding Agent
Primary area: applications to computer vision, audio, language, and other modalities
Keywords: LLM Agent, code generation, AutoML, MLE-bench, search

Abstract: Large language models (LLMs) have shown impressive performance in general programming tasks. However, in Machine Learning Engineering (MLE) scenarios such as AutoML and Kaggle competitions, achieving high performance depends heavily on expert intervention and repeated adjustments rather than simply generating correct code. When applied directly to these tasks, LLMs often lack fine-grained domain priors, and existing MLE approaches that use linear or tree-structured searches limit knowledge transfer to adjacent hierarchical links. As a result, they cannot leverage past full trajectories or share information across branches, limiting self-evolving ability and search-space diversity.
To address these limitations, we introduce InternAgent-MLE, an LLM-based coding agent that integrates a domain knowledge base for high-quality prior guidance and Monte Carlo Graph Search (MCGS) for efficient exploration. MCGS retains the tree-guided exploration of MCTS while embedding a graph structure into the expansion stage to enable dynamic path reorganization, historical trajectory reuse, and multi-solution fusion to support both self-evolution and collaborative learning. Combined with fine-grained operator sets, this design improves stability and accelerates convergence. 
Evaluation on the MLE-Bench shows that InternAgent-MLE achieves state-of-the-art performance in numerous dimensions, such as the average medal rate and valid submission rate, under a 12-hour budget (half the standard runtime).