Mixture of Structural-and-Textual Retrieval over Text-rich Graph Knowledge Bases (2025.findings-acl)
Copied to clipboard
Yongjia Lei, Haoyu Han, Ryan A. Rossi, Franck Dernoncourt, Nedim Lipka, Mahantesh M Halappanavar, Jiliang Tang, Yu Wang
| Challenge: | Existing methods for textual and structural retrieval ignore mutual reinforcement and only use structural retrievals for text-rich Graph Knowledge Bases (TG-KBs). |
| Approach: | They propose a Mixture of Structural-and-Textual Retrieval to retrieve textual and structural knowledge via a Planning-Reasoning-Organizing framework. |
| Outcome: | Experiments show that the proposed framework performs better than existing methods in analyzing TG-KBs and integrating structural trajectories for candidate reranking. |
Similar Papers
DynaSemble: Dynamic Ensembling of Textual and Structure-Based Models for Knowledge Graph Completion (2024.acl-short)
Copied to clipboard
| Challenge: | Existing approaches to Knowledge Graph Completion use textual descriptions of the KG entities and relations to perform the task. |
| Approach: | They propose a method to combine two popular approaches to Knowledge Graph Completion . structure-based models perform better when gold answer is easily reachable . textual models exploit textual descriptions to give good performance . |
| Outcome: | The proposed method achieves 6.8 pt MRR and 8.3 pTits@1 gains over the best baseline model for WN18RR dataset. |
Structure-aware Knowledge Graph-to-text Generation with Planning Selection and Similarity Distinction (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to generate knowledge graph-to-text (KG-to) text rely on pre-trained language models to bridge the gap between the different structures of the input KG and the target text. |
| Approach: | They propose a method that integrates graph structure-aware modules with pre-trained language models to capture the intricate topology information present in the KG. |
| Outcome: | The proposed model captures the topology information present in the knowledge graph and distinguishes similar input KGs through contrastive learning techniques. |
Using Local Knowledge Graph Construction to Scale Seq2Seq Models to Multi-Document Inputs (D19-1)
Copied to clipboard
| Challenge: | Current approaches extract portions of web text as input to Sequence-to-Sequence models . a problem is generating relevant knowledge from noisy and redundant input such as webpages . |
| Approach: | They propose to restructure free text into local knowledge graphs that are linearized into sequences . they propose to encode the graph as a sequence and then linearize it into a structured sequence . |
| Outcome: | The proposed method compresses web search information and reduces redundancy . it can be used for open-domain question answering and multi-document summarization tasks . |
STEM: Structure-Tracing Evidence Mining for Knowledge Graphs-Driven Retrieval-Augmented Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing reasoning path retrieval methods lack a global structural perspective. |
| Approach: | They propose a framework that reframes multi-hop reasoning as a schema-guided graph search task. |
| Outcome: | The proposed framework improves accuracy and evidence completeness of multi-hop reasoning graph retrieval. |
Augmenting Reasoning Capabilities of LLMs with Graph Structures in Knowledge Base Question Answering (2024.findings-emnlp)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Hao Wang, Jun Yang, Jing Xu, Ruanmin Cao, HaoYu Wang
| Challenge: | Recent work uses Large Language Models (LLMs) for semantic parsing to address Knowledge Base Question Answering tasks. |
| Approach: | They propose a framework that augments reasoning capabilities of LLMs with Graph Structures in Knowledge Base Question Answering to retrieve question-related graph structures. |
| Outcome: | The proposed framework outperforms existing methods on GrailQA and WebQSP under the few-shot setting. |
From Phrases to Subgraphs: Fine-Grained Semantic Parsing for Knowledge Graph Question Answering (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph question answering (KGQA) face semantic misalignment and reasoning noise. |
| Approach: | They propose a fine-grained semantic parsing framework for KGQA that maps natural language queries to executable logical forms. |
| Outcome: | The proposed framework achieves 18.5% performance improvement over the SOTA on a multi-hop CWQ dataset. |
Enrich-on-Graph: Query-Graph Alignment for Complex Reasoning with LLM Enriching (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods employ resource-intensive, non-scalable workflows reasoning on vanilla KGs, but overlook this gap. |
| Approach: | They propose a flexible framework that leverages LLMs’ prior knowledge to enrich KGs and bridge the semantic gap between queries and graphs. |
| Outcome: | The proposed framework bridges the semantic gap between structured knowledge graphs and unstructured queries while ensuring low computational costs, scalability, and adaptability across different methods. |
KG-CQR: Leveraging Structured Relation Representations in Knowledge Graphs for Contextual Query Retrieval (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods that address corpus-level context loss focus on query enrichment through structured relation representations. |
| Approach: | They propose a framework for Contextual Query Retrieval that enriches queries with contextual representations derived from a corpus-centric KG. |
| Outcome: | The proposed framework outperforms strong baselines on RAGBench and MultiHop-RAG datasets in terms of retrieval effectiveness. |
Thesis Proposal: On the Granularity-Robustness Trade-off in Text-Derived Knowledge Graphs (2026.acl-srw)
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) based on dense embeddings is a dominant paradigm for text retrieval, but many real-world applications require attribute-specific querying. |
| Approach: | They propose a query-driven framework for constructing and retrieving knowledge graphs from text using dense embeddings. |
| Outcome: | The proposed framework combines the robustness of dense retrieval with the explicit queryability of symbolic representations. |
Subgraph-Guided Executable Logical Form Generation for Knowledge Base Question Answering (2026.findings-acl)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Jun Yang, Huipeng Ma, Chenhao Li, Luan Zhang, Yading Li, Xudong Li, Shenxi Liu, Jing Jiang
| Challenge: | Existing retrieval-augmented approaches focus on ignoring the structural information of the Knowledge Base (KB) and the question. |
| Approach: | They propose a structure-aware subgraph retrieval stage that ranks candidate subgraphs by aligning them with the question’s structure, along with semantic relevance. |
| Outcome: | Experiments on GrailQA, WebQSP, and GraphQuestions show that the proposed framework achieves state-of-the-art performance. |