Yongwei Zhou, Junwei Bao, Chaoqun Duan, Haipeng Sun, Jiahui Liang, Yifan Wang, Jing Zhao, Youzheng Wu, Xiaodong He, Tiejun Zhao
| Challenge: | Existing methods to predict logical forms ignore the utilization of symbolic operations and lack reasoning ability and interpretability. |
| Approach: | They propose an operation-pivoted discrete reasoning framework that uses symbolic operations as neural modules to facilitate reasoning ability and interpretability. |
| Outcome: | Extensive experiments on DROP and RACENum datasets show the reasoning ability of OPERA. |
Similar Papers
Giving BERT a Calculator: Finding Operations and Arguments with Reading Comprehension (D19-1)
Copied to clipboard
| Challenge: | End-to-end reading comprehension models have been successful at extracting text answers, but there are still problems with generalizing them to abstractive numerical reasoning. |
| Approach: | They propose to augment a BERT-based reading comprehension model with a set of executable ‘programs’ which encompass simple arithmetic as well as extraction. |
| Outcome: | The proposed model can perform 33% absolute improvement on the DROP dataset, with very few training examples. |
A Multi-Type Multi-Span Network for Reading Comprehension that Requires Discrete Reasoning (D19-1)
Copied to clipboard
| Challenge: | Existing models for reading comprehension and question answering do not support discrete reasoning abilities. |
| Approach: | They propose a reading comprehension model that uses a multi-type answer predictor and a multiple-span extraction method to produce one or multiple text spans. |
| Outcome: | The proposed model achieves 79.9 F1 on the DROP hidden test set, creating new state-of-the-art results. |
Multi-choice Relational Reasoning for Machine Reading Comprehension (2020.coling-main)
Copied to clipboard
| Challenge: | cloze-style reading comprehension is a task that requires much semantic understanding and reasoning using various clues from texts. |
| Approach: | They propose a multi-choice relational reasoning model that emulates human reading comprehension by combining fusion representations of document, query and candidates. |
| Outcome: | The proposed model outperforms baseline models significantly on four datasets. |
LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers (2023.emnlp-main)
Copied to clipboard
Theo Olausson, Alex Gu, Ben Lipkin, Cedegao Zhang, Armando Solar-Lezama, Joshua Tenenbaum, Roger Levy
| Challenge: | Logical reasoning is an important task for artificial intelligence, says a new study . many prompting-based strategies to enable large language models fail in subtle and unpredictable ways. |
| Approach: | They propose to reformulate logical reasoning tasks by leveraging large language models . they use a modular neurosymbolic programming approach to translate premises and conclusions from natural language to logic . |
| Outcome: | The proposed approach outperforms open-source models on FOLIO and ProofWriter while showing distinct failure modes. |
Rethinking Tabular Data Understanding with Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are capable of various tasks, yet their capability in interpreting and reasoning over tabular data remains an underexplored area. |
| Approach: | They propose a method for table structure normalization to improve model performance . they propose aggregation of multiple reasoning pathways to improve performance based on textual and symbolic reasoning. |
| Outcome: | The proposed method improves performance on symbolic reasoning tasks with textual reasoning slightly outperforming symbolic reasoning on tables. |
Multi-Step Inference for Reasoning Over Paragraphs (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for complex reasoning use symbols or black-box transformers . a compositional model can chain together free-form predicates and logical connectives . |
| Approach: | They propose a compositional model that finds relevant sentences and then chains them together using neural modules. |
| Outcome: | The proposed model improves performance on a recently-introduced dataset. |
Numerical reasoning in machine reading comprehension tasks: are we there yet? (2021.emnlp-main)
Copied to clipboard
| Challenge: | Numerical reasoning based machine reading comprehension models have achieved near-human performance on a variety of benchmarks, but are they capable of learning to reason? |
| Approach: | They propose to use a DROP benchmark to measure machine reading comprehension and investigate models that have achieved near-human performance over standard metrics. |
| Outcome: | The DROP benchmark has inspired the design of specialized BERT and embedding the results into a specialized model. |
Self- and Pseudo-self-supervised Prediction of Speaker and Key-utterance for Multi-party Dialogue Reading Comprehension (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for multi-party dialogue machine reading comprehension focus on how to incorporate speaker information into the model, which is usually rare in real scenarios. |
| Approach: | They propose to model speaker and key-utterances using self-supervised prediction tasks and capture salient clues in a long dialogue. |
| Outcome: | The proposed method outperforms baseline models and state-of-the-art models on two benchmark datasets. |
NumNet: Machine Reading Comprehension with Numerical Reasoning (D19-1)
Copied to clipboard
| Challenge: | Existing numerical MRC models are weak in numerical reasoning, such as addition, subtraction, sorting and counting. |
| Approach: | They propose a numerical MRC model that integrates numerical reasoning into existing MRC models and achieves an EM-score of 64.56% on the DROP dataset. |
| Outcome: | The proposed model outperforms all existing machine reading comprehension models by considering the numerical relations among numbers on the DROP dataset. |
ESTER: A Machine Reading Comprehension Dataset for Reasoning about Event Semantic Relations (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent event-centric reading comprehension datasets focus mostly on event arguments or temporal relations. |
| Approach: | They propose a machine reading comprehension dataset that leverages natural language queries to reason about the five most common event semantic relations. |
| Outcome: | The proposed dataset shows that current SOTA systems achieve 22.1%, 63.3% and 83.5% for token-based exact-match, **F1** and event-based **HIT@1** scores. |