arXiv AI
Is Complex Query Answering Really Complex?
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jun 29
Ontology-Guided Evidence Path Inference for Multi-hop Knowledge Graph Question Answering
arXiv:2606. 28076v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) aims to answer natural-language questions by reasoning over structured facts.
arXiv Machine Learning
Sep 3
Oracle, will I ever learn? A study of prediction convergence and complementarity across link prediction models
The paper investigates how different link prediction models for knowledge graphs produce varying predictions and explores the extent of their complementary knowledge. By evaluating an oracle that selects the best prediction from a set of models, the authors show a significant performance gap between individual models and the oracle, indicating substantial complementarity. However, this complementarity quickly saturates as more models are added, leaving many queries unsolved even with many models.
arXiv AI
Aug 25
Compositional Chain-of-Relations for Faithful Knowledge Graph Question Answering with Large Language Models
arXiv:2608.22762v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) is a key task for evaluating KG-augmented Large Language Models (LLMs), and complex KGQA that requires multi-...
arXiv Computation and Language
Oct 7
Wikidata Search Traces: A Dataset for Training Knowledge Graph Search Agents
arXiv:2610.06650v2 Announce Type: replace Abstract: Wikidata is one of the largest open knowledge bases, yet answering a complex question over it still requires a SPARQL query that names the right en...
arXiv Machine Learning
Sep 30
UltRAG: a Universal Simple Scalable Recipe for Knowledge Graph RAG
arXiv:2603.28773v2 Announce Type: replace-cross Abstract: Large language models (LLMs) frequently generate confident yet factually incorrect content when used for language generation (a phenomenon of...
arXiv AI
Aug 11
KGCache: Amortized Subgraph Retrieval for KG Reasoning with LLMs
arXiv:2608. 07954v1 Announce Type: new Abstract: Large language models can answer knowledge-intensive questions more reliably when they are grounded with knowledge graphs, but systems such as Think-on-Graph and Reasoning-on-Graph repeatedly query the same graph neighborhoods across different questions.