arXiv:2512.00672cs.LGcs.AI2025-12被引 3

构建工具增强型机器学习代理的综合评估基准,提升复杂任务规划能力。

ML-Tool-Bench: Tool-Augmented Planning for ML Tasks

  • 引入61个专业工具与15个Kaggle挑战,支持中间结果命名与管理。
  • 基于GPT-4o,新方法在所有任务中较ReAct提升16.52百分位。
  • 通过分步分解与结构化反馈,显著改善任务轨迹有效性。

构建自主机器学习(ML)代理以完成端到端数据科学工作流是人工智能的重要前沿。这些代理需协调复杂的数据分析、特征工程、模型选择和超参数优化等任务,要求高度规划与迭代能力。尽管现有研究探索了使用大语言模型(LLMs)直接生成代码,但工具增强方法更具模块化与可靠性。然而,现有工具使用基准主要关注特定任务的工具选择或参数提取,未能评估复杂ML代理所需的高级规划能力。本文提出一个综合性基准,包含61个精选工具和15个来自Kaggle的表格型机器学习挑战。该基准引入内存中的命名对象管理机制,支持代理在工作流中灵活命名、保存和检索中间结果。我们发现,标准ReAct方法在生成复杂ML流水线的有效工具序列方面表现不佳,而基于LLM评估的树搜索方法因状态评分不一致而效果受限。为此,我们提出两种简单有效的方法:1)使用设计好的确定性奖励与结构化文本反馈;2)将原问题分解为一系列子任务,显著提升轨迹有效性和任务性能。在GPT-4o上,新方法在所有Kaggle挑战的中位数上比ReAct提升16.52个百分点。本工作为开发更强大的工具增强型规划型机器学习代理奠定了基础。

原文摘要 · Abstract (English)

The development of autonomous machine learning (ML) agents capable of end-to-end data science workflows represents a significant frontier in artificial intelligence. These agents must orchestrate complex sequences of data analysis, feature engineering, model selection, and hyperparameter optimization, tasks that require sophisticated planning and iteration. While recent work on building ML agents has explored using large language models (LLMs) for direct code generation, tool-augmented approaches offer greater modularity and reliability. However, existing tool-use benchmarks focus primarily on task-specific tool selection or argument extraction for tool invocation, failing to evaluate the sophisticated planning capabilities required for ML Agents. In this work, we introduce a comprehensive benchmark for evaluating tool-augmented ML agents using a curated set of 61 specialized tools and 15 tabular ML challenges from Kaggle. Our benchmark goes beyond traditional tool-use evaluation by incorporating an in-memory named object management, allowing agents to flexibly name, save, and retrieve intermediate results throughout the workflows. We demonstrate that standard ReAct-style approaches struggle to generate valid tool sequences for complex ML pipelines, and that tree search methods with LLM-based evaluation underperform due to inconsistent state scoring. To address these limitations, we propose two simple approaches: 1) using shaped deterministic rewards with structured textual feedback, and 2) decomposing the original problem into a sequence of sub-tasks, which significantly improves trajectory validity and task performance. Using GPT-4o, our approach improves over ReAct by 16.52 percentile positions, taking the median across all Kaggle challenges. We believe our work provides a foundation for developing more capable tool-augmented planning ML agents.

机器学习代理工具增强规划推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。