SEGO:用于数学问题求解的序列子目标优化
SEGO: Sequential Subgoal Optimization for Mathematical Problem-Solving
AI总结:
本文提出SEGO框架,通过建立子目标分解与求解概率的联系,生成并优化特定子目标以训练策略模型,在GSM8K和MATH基准上显著提升了LLMs的数学问题求解能力。
摘要:
近年来,大型语言模型(LLMs)推动了人工智能的实质性进展,在包括数学问题求解在内的广泛任务中展现出令人印象深刻的能力。受基于子目标方法的成功启发,我们提出了一个名为序列子目标优化(SEGO)的新颖框架,以增强LLMs解决数学问题的能力。通过建立子目标分解过程与问题求解概率之间的联系,SEGO旨在以理论保证识别更好的子目标。针对在庞大解空间中识别合适子目标的挑战,我们的框架生成特定于问题的子目标,并根据精心设计的标准对其进行调整。将这些优化后的子目标纳入策略模型训练,带来了问题求解性能的显著提升。我们在GSM8K和MATH两个基准上通过实验验证了SEGO的有效性,我们的方法优于现有方法,突显了SEGO在AI驱动的数学问题求解中的潜力。与本文相关的数据和代码将在https://github.com/zhaoxlpku/SEGO上提供。
英文摘要:
Large Language Models (LLMs) have driven substantial progress in artificial intelligence in recent years, exhibiting impressive capabilities across a wide range of tasks, including mathematical problem-solving. Inspired by the success of subgoal-based methods, we propose a novel framework called \textbf{SE}quential sub\textbf{G}oal \textbf{O}ptimization (SEGO) to enhance LLMs' ability to solve mathematical problems. By establishing a connection between the subgoal breakdown process and the probability of solving problems, SEGO aims to identify better subgoals with theoretical guarantees. Addressing the challenge of identifying suitable subgoals in a large solution space, our framework generates problem-specific subgoals and adjusts them according to carefully designed criteria. Incorporating these optimized subgoals into the policy model training leads to significant improvements in problem-solving performance. We validate SEGO's efficacy through experiments on two benchmarks, GSM8K and MATH, where our approach outperforms existing methods, highlighting the potential of SEGO in AI-driven mathematical problem-solving. Data and code associated with this paper will be available at https://github.com/zhaoxlpku/SEGO
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。