The reviewed record of science sign in
Pith

arxiv: 2210.13650 · v1 · pith:WOPUJFOM · submitted 2022-10-24 · cs.CL

ReaRev: Adaptive Reasoning for Question Answering over Knowledge Graphs

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:WOPUJFOMrecord.jsonopen to challenge →

classification cs.CL
keywords questionreasoninginstructionskgqarearevexecutiongraphinstruction
0
0 comments X
read the original abstract

Knowledge Graph Question Answering (KGQA) involves retrieving entities as answers from a Knowledge Graph (KG) using natural language queries. The challenge is to learn to reason over question-relevant KG facts that traverse KG entities and lead to the question answers. To facilitate reasoning, the question is decoded into instructions, which are dense question representations used to guide the KG traversals. However, if the derived instructions do not exactly match the underlying KG information, they may lead to reasoning under irrelevant context. Our method, termed ReaRev, introduces a new way to KGQA reasoning with respect to both instruction decoding and execution. To improve instruction decoding, we perform reasoning in an adaptive manner, where KG-aware information is used to iteratively update the initial instructions. To improve instruction execution, we emulate breadth-first search (BFS) with graph neural networks (GNNs). The BFS strategy treats the instructions as a set and allows our method to decide on their execution order on the fly. Experimental results on three KGQA benchmarks demonstrate the ReaRev's effectiveness compared with previous state-of-the-art, especially when the KG is incomplete or when we tackle complex questions. Our code is publicly available at https://github.com/cmavro/ReaRev_KGQA.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Question-Adaptive Graph Learning for Multi-hop Retrieval Augmented Generation

    cs.LG 2025-10 unverdicted novelty 6.0

    A Multi-L KG and Quest-GNN with question-adaptive intra/inter-level message passing and synthesized pre-training data improves multi-hop RAG performance up to 33.8% on high-hop questions.

  2. S$^3$GNN: Efficient Global Mixing and Local Message Passing for Long-Range Graph Learning

    cs.LG 2026-05 unverdicted novelty 5.0

    S³GNN mitigates oversquashing in message-passing networks via lightweight global mixing without strong prior assumptions, yielding up to 10x error reduction and 50% fewer parameters across multiple domains.