Pith. sign in

REVIEW 3 cited by

RnG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answering

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.08678 v2 pith:YNBYP5ES submitted 2021-09-17 cs.CL

classification cs.CL
keywords generationapproachapproachesgeneralizationpriorrng-kbqastrongcoverage
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Existing KBQA approaches, despite achieving strong performance on i.i.d. test data, often struggle in generalizing to questions involving unseen KB schema items. Prior ranking-based approaches have shown some success in generalization, but suffer from the coverage issue. We present RnG-KBQA, a Rank-and-Generate approach for KBQA, which remedies the coverage issue with a generation model while preserving a strong generalization capability. Our approach first uses a contrastive ranker to rank a set of candidate logical forms obtained by searching over the knowledge graph. It then introduces a tailored generation model conditioned on the question and the top-ranked candidates to compose the final logical form. We achieve new state-of-the-art results on GrailQA and WebQSP datasets. In particular, our method surpasses the prior state-of-the-art by a large margin on the GrailQA leaderboard. In addition, RnG-KBQA outperforms all prior approaches on the popular WebQSP benchmark, even including the ones that use the oracle entity linking. The experimental results demonstrate the effectiveness of the interplay between ranking and generation, which leads to the superior performance of our proposed approach across all settings with especially strong improvements in zero-shot generalization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Leveraging Trajectory Graphs for Pre-Execution Error Diagnosis in Agentic LLM Systems

    cs.AI 2026-07 conditional novelty 6.0 of 10

    Modeling agent trajectories as action-centric probabilistic graphs lets a GNN warn LLM agents of likely step-level errors before execution, improving pass ratio ~14.7% across four benchmarks.

  2. Enhancing Large Language Models with Reward-guided Tree Search for Knowledge Graph Question and Answering

    cs.CL 2025-05 conditional novelty 6.0 of 10

    RTSoG combines question decomposition, LLM-reward-guided Monte Carlo Tree Search with a self-critic stop signal, and weighted path stacking to achieve new state-of-the-art KGQA accuracy, though without code or error bars.

  3. Search-on-Graph: Iterative Informed Navigation for Large Language Model Reasoning on Knowledge Graphs

    cs.CL 2025-10 conditional novelty 5.0 of 10

    An LLM that iteratively inspects 1-hop neighbors of a knowledge-graph entity and chooses the next relation achieves state-of-the-art KGQA scores on six Freebase/Wikidata benchmarks without fine-tuning.

Pith tools