REVIEW 2 cited by
SPINACH: SPARQL-Based Information Navigation for Challenging Real-World Questions
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
abstract
Large Language Models (LLMs) have led to significant improvements in the Knowledge Base Question Answering (KBQA) task. However, datasets used in KBQA studies do not capture the true complexity of KBQA tasks. They either have simple questions, use synthetically generated logical forms, or are based on small knowledge base (KB) schemas. We introduce the SPINACH dataset, an expert-annotated KBQA dataset collected from discussions on Wikidata's "Request a Query" forum with 320 decontextualized question-SPARQL pairs. The complexity of these in-the-wild queries calls for a KBQA system that can dynamically explore large and often incomplete schemas and reason about them, as it is infeasible to create a comprehensive training dataset. We also introduce an in-context learning KBQA agent, also called SPINACH, that mimics how a human expert would write SPARQLs to handle challenging questions. SPINACH achieves a new state of the art on the QALD-7, QALD-9 Plus and QALD-10 datasets by 31.0%, 27.0%, and 10.0% in $F_1$, respectively, and coming within 1.6% of the fine-tuned LLaMA SOTA model on WikiWebQuestions. On our new SPINACH dataset, the SPINACH agent outperforms all baselines, including the best GPT-4-based KBQA agent, by at least 38.1% in $F_1$.
Forward citations
Cited by 2 Pith papers
-
SAGA: Schema-Aware Grounding for Agentic Text-to-SPARQL Generation
Schema-aware property filtering during interactive KBQA grounding improves answer F1 on nine benchmarks and reduces empty results.
-
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.