Divide-or-Conquer? Which Part Should You Distill Your LLM?

Zhuofeng Wu, He Bai, Aonan Zhang, Jiatao Gu, VG Vinod Vydiswaran +2 more
2/22/2024
cs.CLcs.LG

No official code found. Best implementation: apple/ml-divide-or-conquer (14 stars, last commit 2024-11-19).

Abstract

Recent methods have demonstrated that Large Language Models (LLMs) can solve reasoning tasks better when they are encouraged to solve subtasks of the main task first. In this paper we devise a similar strategy that breaks down reasoning tasks into a problem decomposition phase and a problem solving phase and show that the strategy is able to outperform a single stage solution. Further, we hypothesize that the decomposition should be easier to distill into a smaller model compared to the problem solving because the latter requires large amounts of domain knowledge while the former only requires learning general problem solving strategies. We propose methods to distill these two capabilities and evaluate their impact on reasoning outcomes and inference cost. We find that we can distill the problem decomposition phase and at the same time achieve good generalization across tasks, datasets, and models. However, it is harder to distill the problem solving capability without losing performance and the resulting distilled model struggles with generalization. These results indicate that by using smaller, distilled problem decomposition models in combination with problem solving LLMs we can achieve reasoning with cost-efficient inference and local adaptation.

View on arXivView PDF

Code Implementations(1)

144PythonNov 9, 20241 years agoNOASSERTION

Similar Papers

Cite this paper

@article{wu2024divideorconquer,
  title  = {Divide-or-Conquer? Which Part Should You Distill Your LLM?},
  author = {Zhuofeng Wu and He Bai and Aonan Zhang and Jiatao Gu and VG Vinod Vydiswaran and Navdeep Jaitly and Yizhe Zhang},
  year   = {2024},
  eprint = {2402.15000},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.15000v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.15000.svg)](https://codeofpaper.com/paper/2402.15000)

Discussion