Learning to Perform Complex Tasks through Compositional Fine-Tuning of Language Models
Not on the map. Why?
Abstract (arXiv)
How to usefully encode compositional task structure has long been a core challenge in AI. Recent work in chain of thought prompting has shown that for very large neural language models (LMs), explicitly demonstrating the inferential steps involved in a target task may improve performance over end-to-end learning that focuses on the target task alone. However, chain of thought prompting has significant limitations due to its dependency on huge pretrained LMs. In this work, we present compositional fine-tuning (CFT): an approach based on explicitly decomposing a target task into component tasks, and then fine-tuning smaller LMs on a curriculum of such component tasks. We apply CFT to recommendation tasks in two domains, world travel and local dining, as well as a previously studied inferential task (sports understanding). We show that CFT outperforms end-to-end learning even with equal amounts of data, and gets consistently better as more component tasks are modeled via fine-tuning. Compared with chain of thought prompting, CFT performs at least as well using LMs only 7.4% of the size, and is moreover applicable to task domains for which data are not available during pretraining.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 20 of its 35 references that are in the map. First posted on arXiv 23 Oct 2022.
Builds on
20 of 35 references.
References · 20
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
- 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,397
- 2022STaR: Bootstrapping Reasoning With Reasoningcited by 895
- 2021Show Your Work: Scratchpads for Intermediate Computation with Language Modelscited by 871
- 2019Explain Yourself! Leveraging Language Models for Commonsense Reasoningcited by 367
- 2019Measuring Compositional Generalization: A Comprehensive Method on Realistic Datacited by 280
- 2021AI Chains: Transparent and Controllable Human-AI Interaction by Chaining Large Language Model Promptscited by 265
- 2019QASC: A Dataset for Question Answering via Sentence Compositioncited by 248
8 more
- 2020Compositional Generalization and Natural Language Variation: Can a Semantic Parsing Approach Handle Both?cited by 147
- 2020Break It Down: A Question Understanding Benchmarkcited by 131
- 2019Multi-hop Reading Comprehension through Question Decomposition and Rescoringcited by 119
- 2020Unsupervised Question Decomposition for Question Answeringcited by 118
- 2020What does BERT know about books, movies and music? Probing BERT for Conversational Recommendationcited by 36
- 2017Adversarial Generation of Natural Languagecited by 33
- 2021Hey AI, Can You Solve Complex Tasks by Talking to Agents?cited by 13
- 2021"It doesn't look good for a date": Transforming Critiques into Preferences for Conversational Recommendation Systemscited by 3
Built on by
Citing papers per year: 2023: 3; 2024: 3; 2025: 4.
10 papers.
- 2023Is GPT-4 a reliable rater? Evaluating Consistency in GPT-4 Text Ratingscited by 33
- 2023Designing LLM Chains by Adapting Techniques from Crowdsourcing Workflowscited by 17
- 2024Not Just Novelty: A Longitudinal Study on Utility and Customization of an AI Workflowcited by 13
- 2023CESAR: Automatic Induction of Compositional Instructions for Multi-turn Dialogscited by 3
- 2024V-RECS, a Low-Cost LLM4VIS Recommender with Explanations, Captioning and Suggestionscited by 3
- 2025SLM-Bench: A Comprehensive Benchmark of Small Language Models on Environmental Impacts--Extended Versioncited by 3
- 2025FeedQUAC: Quick Unobtrusive AI-Generated Commentarycited by 2
- 2024DiNeR: a Large Realistic Dataset for Evaluating Compositional Generalizationcited by 1
- 2025E.A.R.T.H.: Structuring Creative Evolution through Model Error in Generative AIcited by 0
- 2025Reflective Agreement: Combining Self-Mixture of Agents with a Sequence Tagger for Robust Event Extractioncited by 0
- 2025Reflective Agreement: Combining Self-Mixture of Agents with a Sequence Tagger for Robust Event Extraction26 Aug 2025
- 2025SLM-Bench: A Comprehensive Benchmark of Small Language Models on Environmental Impacts--Extended Version21 Aug 2025
- 2025E.A.R.T.H.: Structuring Creative Evolution through Model Error in Generative AI24 Jul 2025
- 2025FeedQUAC: Quick Unobtrusive AI-Generated Commentary23 Apr 2025
- 2024V-RECS, a Low-Cost LLM4VIS Recommender with Explanations, Captioning and Suggestions21 Jun 2024
- 2024DiNeR: a Large Realistic Dataset for Evaluating Compositional Generalization7 Jun 2024
- 2024Not Just Novelty: A Longitudinal Study on Utility and Customization of an AI Workflow15 Feb 2024
- 2023Designing LLM Chains by Adapting Techniques from Crowdsourcing Workflows18 Dec 2023
- 2023CESAR: Automatic Induction of Compositional Instructions for Multi-turn Dialogs29 Nov 2023
- 2023Is GPT-4 a reliable rater? Evaluating Consistency in GPT-4 Text Ratings3 Aug 2023
Similar, not cited
Close in wording, no citation either way
- 2024Do Large Language Models Have Compositional Ability? An Investigation into Limitations and Scalability
- 2023Skills-in-Context Prompting: Unlocking Compositionality in Large Language Models
- 2023Dissecting Chain-of-Thought: Compositionality through In-Context Filtering and Learning
- 2026Routing-Aligned Fine-Tuning for Multilingual Downstream Tasks in Mixture-of-Experts Models
- 2026Compositional Reasoning in Language Models under Reinforcement Learning Post-Training
- 2026Beyond the Prompt in Large Language Models: Comprehension, In-Context Learning, and Chain-of-Thought
- 2025UFT: Unifying Supervised and Reinforcement Fine-Tuning
- 2023Training Chain-of-Thought via Latent-Variable Inference