Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods of logical reasoning focus on entity-aware information but ignore hierarchical relations that may even have mutual effects. |
| Approach: | They propose a holistic graph network that deals with context at both discourse-level and word-level as the basis for logical reasoning. |
| Outcome: | The proposed method improves on logical reasoning QA datasets and natural language inference datasets. |
Similar Papers
DAGN: Discourse-Aware Graph Network for Logical Reasoning (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent QA with logical reasoning questions requires passage-level relations among the sentences. |
| Approach: | They propose a discourse-aware graph network that aggregates passage-level clues for QA by using discourse-based information. |
| Outcome: | The proposed model achieves competitive results on two logical reasoning QA datasets. |
AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods and limitations for machine reading comprehension are insufficient for logical reasoning over text. |
| Approach: | They propose a neural-symbolic approach which passes messages over a graph representing logical relations between text units to predict an answer. |
| Outcome: | The proposed approach outperforms existing methods on ReClor and LogiQA. |
Reasoning with Latent Structure Refinement for Document-Level Relation Extraction (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction capture non-local interactions but are not able to capture rich non-linguistic interactions. |
| Approach: | They propose a document-level relation extraction model that empowers relational reasoning across sentences by automatically inducing the latent document- level graph. |
| Outcome: | The proposed model achieves an F1 score of 59.05 on a large-scale document-level dataset (DocRED), significantly improving over the previous results. |
Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to machine reading comprehension treat documents at their hierarchical nature, ignoring their dependencies. |
| Approach: | They propose a machine reading comprehension benchmark with two-grained answers . they use graph attention networks to model documents at their hierarchical nature . |
| Outcome: | The proposed framework outperforms existing systems at long and short answer criteria. |
Double Graph Based Reasoning for Document-level Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction fail to recognize relations between entities across sentences. |
| Approach: | They propose a method to recognize relations for long paragraphs by a Graph Aggregation-and-Inference Network (GAIN) they propose to use a heterogeneous mention-level graph and an entity-level EG graph to analyze the relationships. |
| Outcome: | The proposed method achieves a significant performance improvement (2.85 on F1) over the previous state-of-the-art. |
Machine Reading Comprehension Using Structural Knowledge Graph-aware Network (D19-1)
Copied to clipboard
| Challenge: | Recent large-scale datasets specify that external knowledge is required to answer questions. |
| Approach: | They propose a model that leverages external knowledge to construct sub-graphs for entities in machine comprehension context. |
| Outcome: | The proposed model achieves state-of-the-art performance on the ReCoRD dataset. |
Document-level Relation Extraction with Dual-tier Heterogeneous Graph (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods focus on extracting relations from single sentence . document-level relation extraction requires a comprehension of the whole document . |
| Approach: | They propose a graph-based model with Dual-tier Heterogeneous Graph (DHG) for document-level relation extraction. |
| Outcome: | The proposed model achieves state-of-the-art performance on two widely used datasets. |
Connecting the Dots: Document-level Neural Relation Extraction with Edge-oriented Graphs (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to document-level relation extraction use nodes and edges as relations between nodes. |
| Approach: | They propose an edge-oriented graph neural model for document-level relation extraction that uses different types of nodes and edges to create a document-based graph. |
| Outcome: | The proposed model can learn intra- and inter-sentence relations using multi-instance learning internally. |
DRLK: Dynamic Hierarchical Reasoning with Language Model and Knowledge Graph for Question Answering (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing work only uses the same QA context representation to interact with multiple layers of KG, which results in a restricted interaction. |
| Approach: | They propose a model that utilizes dynamic hierarchical interactions between QA context and KG for reasoning. |
| Outcome: | The proposed model performs state-of-the-art on two benchmark datasets and competitively on the others. |
Towards a Holistic and Automated Evaluation Framework for Multi-Level Comprehension of LLMs in Book-Length Contexts (2025.emnlp-main)
Copied to clipboard
Yuho Lee, Jiaqi Deng, Nicole Hee-Yeon Kim, Hyangsuk Min, Taewon Yun, Minjeong Ban, Kim Yul, Hwanjun Song
| Challenge: | HAMLET is a framework for evaluating the long-context comprehension of large language models. |
| Approach: | They propose a framework for evaluating the long-context comprehension of large language models . HAMLET structures key information of source texts into a three-level hierarchy . |
| Outcome: | HAMLET achieves 90% agreement with expert judgments while reducing evaluation cost by up to 25. |