arXiv:2608.10424cs.AIcs.LG2026-08

修复自研智能体在表格数据上的算力浪费问题

Recovering Wasted Compute in Autoresearch Agents

论文配图:Recovering Wasted Compute in Autoresearch Agents
图 1 · 摘自论文原文
  • 引入全局调试顾问共享运行时约束,避免重复修复相同错误
  • 通过提示优化和搜索算法改进,提升超参调优效率
  • 适合关注智能体设计优化的研究者与工业界应用开发者

近期大量工作致力于构建端到端解决研究问题的智能体,这一范式被称为自研(autoresearch)。尽管该方向已吸引大量产业投资,但我们发现其核心建模流程在处理表格数据时存在普遍缺陷:(1)反复浪费算力修复相同错误;(2)即使剩余算力充足也难以完成超参调优;(3)树搜索算法缺乏探索性;(4)虽模仿人类进行数据分析,却未利用分析结果指导下游决策。我们提出针对性干预措施,包括全局调试顾问、提示与控制层级优化、以及改进的树搜索算法,成功恢复了被浪费的算力。实验表明,在保持底层语言模型不变的前提下,仅通过智能体设计优化即可显著提升性能。

原文摘要 · Abstract (English)

A slew of recent works develop agents for solving research problems end-to-end, a paradigm increasingly referred to as autoresearch. Such agents have inspired large industry investment, motivated by their potential to automate time-consuming human labor and customize machine learning solutions for specialized applications. In this paper, we study the modeling pipeline at the core of these autoresearch systems and identify common failure modes when they are applied to tabular datasets: (1) they waste compute resolving the same bugs over and over again; (2) they often fail to tune hyperparameters even when they have a large remaining compute budget; (3) the tree-search algorithms that power them do not explore; and (4) they perform data analysis, mimicking the humans whose data they are trained on, but do not use that analysis to make downstream decisions. We explore targeted interventions and find that a global debug consultant that shares discovered runtime constraints across all branches of the search tree, prompt- and control-level enhancements, and refined tree-search algorithms successfully recover wasted compute. Our results show that large gains in autoresearch agent performance are achievable through agentic design alone, holding the underlying language model fixed.

智能体自研算力优化

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