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.
@article{arxiv.2407.04787,
title = {Re-Tuning: Overcoming the Compositionality Limits of Large Language Models with Recursive Tuning},
author = {Eric Pasewark and Kyle Montgomery and Kefei Duan and Dawn Song and Chenguang Wang},
journal= {arXiv preprint arXiv:2407.04787},
year = {2024}
}