arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2403.00799cs.CLcs.AIcs.LG
收藏

LLM数学推理中数据能力边界的实证研究

An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning

School of Information Science and Technology, ShanghaiTech University(上海科技大学信息科学与技术学院);Shanghai Innovation Center for Processor Technologies(上海处理器技术创新中心);School of Information Science and Technology, University of Science and Technology of China(中国科学技术大学信息科学与技术学院)

Zui Chen, Yezeng Chen, Jiaqi Han, Zhijie Huang, Ji Qi, Yi Zhou

AI总结:

本文研究SFT数据对LLM数学推理的能力边界,提出混合各类型最小最优数据集合的MMOS方法,以更低成本实现SOTA,并重新评估GSM-HARD与数值鲁棒性。

摘要:

大语言模型(LLM)在数学推理任务上正展现出涌现能力,通过监督微调(SFT)增强开源LLM能力也受到越来越多关注。本文旨在探索一种面向监督数据的通用数据策略,以帮助优化和扩展数学推理能力。首先,我们通过识别推理路径的最小最优集合,确定推理路径增强的能力边界。其次,我们验证了模型的不同能力可通过混合相应类型数据的最小最优集合(Mix of Minimal Optimal Sets)得到累积增强;同时,我们的模型MMOS在低得多的构建成本下,于一系列基座模型上取得SOTA性能。此外,我们指出GSM-HARD并非真正困难,如今的LLM也不再缺乏数值鲁棒性。我们还提供了用于鲁棒性测试和教育应用的Auto Problem Generator。代码和数据已公开发布于https://github.com/cyzhh/MMOS。

英文摘要:

Large language models (LLMs) are displaying emergent abilities for math reasoning tasks,and there is a growing attention on enhancing the ability of open-source LLMs through supervised fine-tuning (SFT).In this paper, we aim to explore a general data strategy for supervised data to help optimize and expand math reasoning ability.Firstly, we determine the ability boundary of reasoning paths augmentation by identifying these paths' minimal optimal set.Secondly, we validate that different abilities of the model can be cumulatively enhanced by Mix of Minimal Optimal Sets of corresponding types of data, while our models MMOS achieve SOTA performance on series base models under much lower construction costs.Besides, we point out GSM-HARD is not really hard and today's LLMs no longer lack numerical robustness.Also, we provide an Auto Problem Generator for robustness testing and educational applications.Our code and data are publicly available at https://github.com/cyzhh/MMOS.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑