Re-Tuning:通过递归调优克服大型语言模型的组合性限制
Re-Tuning: Overcoming the Compositionality Limits of Large Language Models with Recursive Tuning
AI总结:
本文提出 Re-Tuning 方法,通过递归调优使大模型分解并求解子问题,在整数加法、动态规划和奇偶校验任务上显著提升准确率并降低 GPU 内存开销。
摘要:
我们提出了一种使大型语言模型解决组合性任务的新方法。尽管大型语言模型在传统语言理解任务上表现出色,但在解决组合性任务时仍面临困难,这类任务的解依赖于先解决同一问题的较小实例。我们提出一种自然的递归求解组合性任务的方法。我们的方法 Re-Tuning 对模型进行调优,使其将问题分解为子问题,求解这些子问题,并合并结果。我们表明,该方法在三个代表性组合性任务上显著提升了模型性能:整数加法、动态规划和奇偶校验。与保留中间求解步骤的现有最优方法相比,Re-Tuning 取得了显著更高的准确率,并且具有更高的 GPU 内存效率。
英文摘要:
We present a new method for large language models to solve compositional tasks. Although they have shown strong performance on traditional language understanding tasks, large language models struggle to solve compositional tasks, where the solution depends on solving smaller instances of the same problem. We propose a natural approach to solve compositional tasks recursively. Our method, Re-Tuning, tunes models to break down a problem into subproblems, solve those subproblems, and combine the results. We show that our method significantly improves model performance on three representative compositional tasks: integer addition, dynamic programming, and parity. Compared to state-of-the-art methods that keep intermediate steps towards solving the problems, Re-Tuning achieves significantly higher accuracy and is more GPU memory efficient.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。