Self-DC: When to Reason and When to Act? Self Divide-and-Conquer for Compositional Unknown Questions (2025.naacl-long)
Copied to clipboard
Hongru Wang, Boyang Xue, Baohang Zhou, Tianhua Zhang, Cunxiang Wang, Huimin Wang, Guanhua Chen, Kam-Fai Wong
| Challenge: | Existing studies focus on leveraging internal knowledge of Large Language Models (LLMs) to answer known questions. |
| Approach: | They propose a framework that allows LLMs to choose between internal and external knowledge . they use a dataset to analyze compositional questions that are composed of unknown sub-questions . |
| Outcome: | The proposed framework can achieve comparable or even better performance with much fewer external calls compared with several strong baselines. |
Similar Papers
Understanding and Patching Compositional Reasoning in LLMs (2024.findings-acl)
Copied to clipboard
| Challenge: | LLMs have marked a revolutonary shift, yet they falter when faced with compositional reasoning tasks. |
| Approach: | They propose a lightweight method to patch compositional reasoning errors via editing the located MHSA modules in LLMs. |
| Outcome: | The proposed method can be used to patch compositional reasoning errors using MHSA modules located within the layers of the LLMs. |
Select to Know: An Internal-External Knowledge Self-Selection Framework for Domain-Specific Question Answering (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) perform well in general QA but often struggle in domain-specific scenarios. |
| Approach: | They propose a framework that internalizes domain knowledge through internal-external knowledge self-selection and selective supervised fine-tuning. |
| Outcome: | The proposed framework outperforms existing methods and matches domain-pretrained LLMs with significantly lower cost. |
Don’t Just Say “I don’t know”! Self-aligning Large Language Models for Responding to Unknown Questions with Explanations (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies investigate ways to refuse to answer unknown questions . Large Language Models (LLMs) display a significant level of overconfidence when answering questions that they are aware of. |
| Approach: | They propose a self-alignment method to utilize Large Language Models to enhance its response-ability to unknown questions. |
| Outcome: | The proposed method is superior to baseline methods on four types of unknown questions. |
Measuring and Narrowing the Compositionality Gap in Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | a language model can correctly answer all sub-problems but not generate the overall solution. |
| Approach: | They propose a method that asks itself and then answers follow-up questions to narrow the compositionality gap by reasoning explicitly instead of implicitly. |
| Outcome: | The proposed method improves on chain of thought by asking itself and answering follow-up questions. |
DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text (2024.findings-naacl)
Copied to clipboard
| Challenge: | Retrievalaugmented LLMs have been used to ground LLM in external knowledge . a gap exists in the current landscape regarding the effectiveness of grounding LLM on heterogeneous knowledge sources. |
| Approach: | They propose a model that uses symbolic language to generate symbolic queries . they use a dataset that is generated using predefined reasoning chains and human annotation . |
| Outcome: | The proposed model outperforms previous approaches by a significant margin in QA tasks over text. |
Training LLMs for Divide-and-Conquer Reasoning Elevates Test-Time Scalability (2026.acl-long)
Copied to clipboard
Xiao Liang, Zhong-Zhi Li, Zhenghao Lin, Eric Hanchen Jiang, Hengyuan Zhang, Yelong Shen, Kai-Wei Chang, Ying Nian Wu, Yeyun Gong, Weizhu Chen
| Challenge: | Large language models have demonstrated strong reasoning capabilities through step-by-step chain-of-thought (CoT) reasoning, but their strictly sequential nature constrains test-time scalability. |
| Approach: | They propose an end-to-end reinforcement learning framework to enhance LLMs' DAC-style reasoning capacity by decomposing a problem into subproblems and solving them sequentially. |
| Outcome: | The proposed model surpasses CoT by 8.6% and 6.3% on competition-level benchmarks and is available at the [github.com/MasterVito/DAC-RL]. |
Gradually Excavating External Knowledge for Implicit Complex Question Answering (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) have gained attention for their human-comparable capabilities but they may not solve open-domain implicit questions due to out-of-date domain knowledge, one-shot generation and restricted comprehensiveness. |
| Approach: | They propose a gradual knowledge excavation framework for open-domain complex question answering using extrinsic knowledge and historical knowledge. |
| Outcome: | The proposed framework achieves 78.17% accuracy with less than 6% parameters of its competitors, setting new SOTA in the 10B LLM class. |
Piece of Table: A Divide-and-Conquer Approach for Selecting Subtables in Table Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to QA tables rely on independent row or column selection, fail to capture cross-row and cross-column dependencies, or attempt global reasoning. |
| Approach: | They propose a divide-and-conquer subtable selection framework that aggregates local evidence without requiring explicit global reasoning. |
| Outcome: | The proposed framework outperforms previous approaches to table QA in the noisy context. |
Just Ask One More Time! Self-Agreement Improves Reasoning of Language Models in (Almost) All Scenarios (2024.findings-acl)
Copied to clipboard
Lei Lin, Jiayi Fu, Pengli Liu, Qingyang Li, Yan Gong, Junchen Wan, Fuzheng Zhang, Zhongyuan Wang, Di Zhang, Kun Gai
| Challenge: | chain-of-thought (CoT) prompting has been shown to be effective on complex reasoning tasks, but the naive greedy decoding used in CoT prompting causes the repetitiveness and local optimality. |
| Approach: | They propose a generalizable ensemble-optimization method that uses a set of reasoning paths to prompt a language model one more time to determine the optimal answer. |
| Outcome: | The proposed method can be generalized to almost all scenarios where the type of input questions and answer format of reasoning paths may be unknown. |
Analyzing the Inner Workings of Transformers in Compositional Generalization (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing studies on compositional generalization abilities of neural models have focused on benchmarks, but the results do not reflect the underlying competence of the model. |
| Approach: | They propose to find an existing subnetwork that contributes to the generalization performance and perform causal analyses on how the model utilizes syntactic features. |
| Outcome: | The proposed model relies on syntactic features but the subnetwork with better generalization performance relies mainly on a non-compositional algorithm . |