AlphaResearch:利用语言模型加速新算法发现
AlphaResearch: Accelerating New Algorithm Discovery with Language Models
AI总结:
AlphaResearch通过迭代提出新想法、编程验证和优化研究提案,实现了在开放性问题上发现新算法的突破,其在六个开放性问题上的表现优于其他系统,尤其在圆圈排列问题上超越了人类和基线模型。
摘要:
LLMs在复杂但易验证的问题上取得了显著进展,但仍然难以发现未知领域。本文提出了AlphaResearch,一个自主研究代理,通过迭代执行以下步骤:(1)提出新想法(2)编程验证(3)优化研究提案。为了协同发现过程的可行性和创新性,我们构建了新颖的双环境,结合执行基于可验证奖励和模拟真实世界同行评审环境的奖励。我们构建了包含八个开放性算法问题竞赛的\dataset,以基准测试AlphaResearch。实验结果表明,AlphaResearch在六个开放性问题上比其他代理发现系统表现更优。值得注意的是,AlphaResearch在“圆圈排列”问题上发现的算法达到最佳已知性能,超越了人类研究人员和最近工作的强基线(如AlphaEvolve)。此外,我们还对自主研究代理的益处和剩余挑战进行了全面分析,为未来研究提供了有价值的见解。
英文摘要:
LLMs have made significant progress in complex but easy-to-verify problems, yet they still struggle with discovering the unknown. In this paper, we present \textbf{AlphaResearch}, an autonomous research agent designed to discover new algorithms on open-ended problems by iteratively running the following steps: (1) propose new ideas (2) program to verify (3) optimize the research proposals. To synergize the feasibility and innovation of the discovery process, we construct a novel dual environment by combining the execution-based verifiable reward and reward from simulated real-world peer review environment in AlphaResearch. We construct \textbf{\dataset}, a set of questions that includes an eight open-ended algorithmic problems competition to benchmark AlphaResearch. Experimental results show that AlphaResearch achieves stronger discovery performance than other agentic discovery systems on six open-ended problems. Notably, the algorithm discovered by AlphaResearch on the \emph{``packing circles''} problem achieves the best-of-known performance, surpassing the results of human researchers and strong baselines from recent work (e.g., AlphaEvolve). Additionally, we conduct a comprehensive analysis of the benefits and remaining challenges of autonomous research agent, providing valuable insights for future research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。