Publication | Closed Access
Large Language Models are Versatile Decomposers: Decomposing Evidence and Questions for Table-based Reasoning
57
Citations
12
References
2023
Year
Unknown Venue
EngineeringModel-based ReasoningSemanticsLarge Language ModelCorpus LinguisticsTable ReasoningLarge Language ModelsNatural Language ProcessingData ScienceTable-based ReasoningComputational LinguisticsVersatile DecomposersLanguage StudiesQuestion AnsweringReasoning SystemNatural Language InterfaceNlp TaskComputer ScienceSemantic ParsingReasoningRetrieval Augmented GenerationAutomated ReasoningHuge TableLinguisticsComputational SemanticsSemantic Representation
Table-based reasoning has shown remarkable progress in a wide range of table-based tasks. It is a challenging task, which requires reasoning over both free-form natural language (NL) questions and (semi-)structured tabular data. However, previous table-based reasoning solutions usually suffer from significant performance degradation on ''huge'' evidence (tables). In addition, most existing methods struggle to reason over complex questions since the essential information is scattered in different places. To alleviate the above challenges, we exploit large language models (LLMs) as decomposers for effective table-based reasoning, which (i) decompose huge evidence (a huge table) into sub-evidence (a small table) to mitigate the interference of useless information for table reasoning, and (ii) decompose a complex question into simpler sub-questions for text reasoning. First, we use a powerful LLM to decompose the evidence involved in the current question into the sub-evidence that retains the relevant information and excludes the remaining irrelevant information from the ''huge'' evidence. Second, we propose a novel ''parsing-execution-filling'' strategy to decompose a complex question into simper step-by-step sub-questions by generating intermediate SQL queries as a bridge to produce numerical and logical sub-questions with a powerful LLM. Finally, we leverage the decomposed sub-evidence and sub-questions to get the final answer with a few in-context prompting examples. Extensive experiments on three benchmark datasets (TabFact, WikiTableQuestion, and FetaQA) demonstrate that our method achieves significantly better results than competitive baselines for table-based reasoning. Notably, our method outperforms human performance for the first time on the TabFact dataset. In addition to impressive overall performance, our method also has the advantage of interpretability, where the returned results are to some extent tractable with the generated sub-evidence and sub-questions. For reproducibility, we release our source code and data at: https://github.com/AlibabaResearch/DAMO-ConvAI.
| Year | Citations | |
|---|---|---|
Page 1
Page 1