REVIEW 2 cited by
FC-KBQA: A Fine-to-Coarse Composition Framework 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
Signed reviews
read the original abstract
The generalization problem on KBQA has drawn considerable attention. Existing research suffers from the generalization issue brought by the entanglement in the coarse-grained modeling of the logical expression, or inexecutability issues due to the fine-grained modeling of disconnected classes and relations in real KBs. We propose a Fine-to-Coarse Composition framework for KBQA (FC-KBQA) to both ensure the generalization ability and executability of the logical expression. The main idea of FC-KBQA is to extract relevant fine-grained knowledge components from KB and reformulate them into middle-grained knowledge pairs for generating the final logical expressions. FC-KBQA derives new state-of-the-art performance on GrailQA and WebQSP, and runs 4 times faster than the baseline.
Forward citations
Cited by 2 Pith papers
-
Enhancing Large Language Models with Reward-guided Tree Search for Knowledge Graph Question and Answering
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.
-
Search-on-Graph: Iterative Informed Navigation for Large Language Model Reasoning on Knowledge Graphs
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.
Discussion (0). Continue with ORCID to comment.