Learning to Decompose: Hypothetical Question Decomposition Based on Comparable Texts (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to end-to-end questionanswering assume that pre-trained language can decompose complex tasks into more straightforward sub-tasks. |
| Approach: | They propose to use distant supervision to train decomposition-based transformers for large-scale parallel news. |
| Outcome: | The proposed model improves on semantic parsing and on hotpotQA and strategyQA datasets by 20% to 30%. |
Similar Papers
Decomposition-Enhanced Training for Post-Hoc Attributions in Language Models (2026.eacl-long)
Copied to clipboard
Sriram Balasubramanian, Samyadeep Basu, Koustava Goswami, Ryan A. Rossi, Varun Manjunatha, Roshan Santhosh, Ruiyi Zhang, Soheil Feizi, Nedim Lipka
| Challenge: | Existing methods for extractive QA struggle in multi-hop, abstractive, and semi-extractive settings. |
| Approach: | They propose a method that prompts models to produce answer decompositions as intermediate reasoning steps. |
| Outcome: | The proposed method outperforms existing methods and matches or exceeds state-of-the-art frontier models. |
Is a Question Decomposition Unit All We Need? (2022.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LMs) have achieved state-of-the-art performance on many NLP benchmarks. |
| Approach: | They propose to decompose a hard question into simpler questions that are easier for models to answer. |
| Outcome: | The proposed approach significantly improves model performance (24% for GPT3 and 29% for RoBERTa-SQuAD along with a symbolic calculator) by decomposing a hard question into simpler questions that are easier for models to answer. |
Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing approaches to decompose complex tasks into simpler ones do not require annotated decompositions. |
| Approach: | They propose a framework for building interpretable systems that learn to solve complex tasks by decomposing existing models into simpler ones solvable by existing models. |
| Outcome: | The proposed framework is more versatile than existing explainable systems for DROP and HotpotQA datasets, is more robust than state-of-the-art blackbox (uninterpretable) systems, and generates more understandable and trustworthy explanations compared to prior work. |
Generating Complex Question Decompositions in the Face of Distribution Shifts (2025.naacl-long)
Copied to clipboard
| Challenge: | Question decomposition has been found to improve large language models’ (LLMs) performance on complex question answering (QA) however, performance on the task remains dominated by supervised approaches, suggesting room for making LLMs better decomposers. |
| Approach: | They propose to generate synthetic decomposition data with only five annotated examples by extending recent advances in using LLM-as-judge and for reranking in novel ways. |
| Outcome: | The proposed approach generates synthetic decomposition data with only five examples over two benchmark datasets. |
Unsupervised Question Decomposition for Question Answering (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing QA systems struggle to answer complex questions because information is scattered in different places. |
| Approach: | They propose an unsupervised algorithm that decomposes hard questions into simpler sub-questions . they propose an algorithm that can be used to generate a final answer from millions of questions . |
| Outcome: | The proposed algorithm decomposes hard questions into simpler sub-questions that existing QA systems can answer. |
Bridging the Gap between Synthetic and Natural Questions via Sentence Decomposition for Semantic Parsing (2023.tacl-1)
Copied to clipboard
| Challenge: | Existing methods to train a parser to perform zero-shot learning are limited by the lack of training data. |
| Approach: | They propose a decomposition-based method to unify the sentence structures of questions . their method can generalize to natural questions with novel text expressions . |
| Outcome: | The proposed method improves on synthetic data and on complex web questions with novel expressions. |
SPARQLing Database Queries from Intermediate Question Decompositions (2021.emnlp-main)
Copied to clipboard
| Challenge: | Using annotated datasets is difficult as it requires query-language expertise. |
| Approach: | They propose a crowdsourcing pipeline to annotate natural language questions using intermediate question representations. |
| Outcome: | The proposed pipeline reduces the burden of annotating a large dataset with queries by using intermediate question representations. |
When Do Decompositions Help for Machine Reading? (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on decompositions of complex questions has focused on multi-step reasoning . but, in machine reading, it is unclear when decomposing is helpful . |
| Approach: | They conduct experiments on decompositions in machine reading to unify recent work . they find that decomposing complex questions can be helpful in zero or limited-data settings . |
| Outcome: | The proposed model can learn decompositions implicitly even with limited data, the study shows . the results are consistent with previous work on decomposing complex questions . |
Teaching Broad Reasoning Skills for Multi-Step QA by Generating Hard Contexts (2022.emnlp-main)
Copied to clipboard
| Challenge: | Question-answering datasets require a broad set of reasoning skills. |
| Approach: | They use QDMR representations to programmatically create hard-to-cheat synthetic contexts for real questions in multi-step reasoning datasets. |
| Outcome: | The proposed model improves performance by 13 F1 points on 4 multi-step QA datasets and 21 points on more complex questions. |
Visual Question Decomposition on Multimodal Large Language Models (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for question decomposition focus on unimodal language models, but question decomposing capability of Multimodal Large Language Models (MLLMs) has yet to be explored. |
| Approach: | They propose a finetuning dataset and a training objective for selective decomposition to enhance the model's question decomposing capability. |
| Outcome: | The proposed dataset shows that existing models struggle to produce high-quality sub-questions. |