arXiv AI

pro-team at LLMs4OL 2026 Tasks Flagship and Reuse: Retrieval-Augmented Generation and Vocabulary-Constrained Filtering for Ontology Learning

The pro-team at LLMs4OL 2026 presented a system for ontology learning that tackles both the End-to-End Flagship Task (Task A) and the Ontology Extension Reuse Task (Task B). Their approach uses an offline retrieval‑augmented few‑shot prompting pipeline with Qwen2.5‑14B‑Instruct and MiniLM‑L6‑v2 for retrieval, selecting top‑5 examples for Task A and top‑2 for Task B, and applies a left‑truncated context‑windowing strategy to keep task instructions in long prompts. For Task B, generated triples are filtered deterministically by a vocabulary constraint, keeping triples that involve at least one term from the closed vocabulary and removing duplicates of the initial ontology, achieving high scores in Semantic Graph Similarity, Term‑Typing F1, and Taxonomy Discovery F1, though no non‑taxonomic relations were extracted.

arXiv AI
Oct 2

Mapping the RAG Landscape: A Four Axis Taxonomy of Efficiency, Defense, Interactivity, and Reasoning

The paper surveys recent advances in Retrieval Augmented Generation (RAG), a technique that integrates external retrieval into language model generation to reduce hallucinations and keep knowledge current. It introduces a four‑axis taxonomy—efficiency, defense, interactivity, and reasoning—to organize contemporary RAG research, covering retrieval methods, fusion strategies, embedding optimizations, and reinforcement learning policies. The survey also reviews evaluation practices, domain‑specific applications, and architectural variants, while highlighting ongoing challenges such as retrieval quality, reliability, domain adaptation, scalability, and explainability.

By Meghana Sunil, Shravya V, Shravan Venkatraman, Joe Dhanith PR
arXiv AI
Oct 2

Build2SPARQL: A Large-Scale Text-to-SPARQL Benchmark Dataset for Building Knowledge Graph Querying

Build2SPARQL is a large-scale benchmark dataset for translating natural-language questions into SPARQL queries over building knowledge graphs. The dataset is generated by a KG‑grounded pipeline that produces 6,136 executable SPARQL queries and 30,680 corresponding natural-language questions across six query-pattern families and five vocabulary registers, covering 201 building KGs. Human validation shows high semantic fidelity, naturalness, and operational plausibility, and retrieval‑augmented evaluation demonstrates significant accuracy gains for open‑weight language models.

By Wooyoung Jung
arXiv Computation and Language
Oct 22

Reasoning-Search-Augmented LLMs: An Operational Taxonomy, Benchmark Analysis and Controlled Evidence Synthesis

The paper reviews and categorizes large language models that combine step‑by‑step reasoning with interactive search, treating retrieval as an action within an iterative agentic loop. It analyzes these systems along four architectural axes—retrieval coupling, controller design, knowledge source, and grounding strictness—while also considering the learning signal as a cross‑cutting factor. The authors conduct controlled ablations and benchmark analyses to clarify how design choices affect search, stopping, and grounding behavior, aiming to provide a unified perspective for future research.

By Biswas Poudel, Nilson Chapagain, Amit Kumar, Xianshun Jiang
arXiv Machine Learning
Nov 2

Peeling the Matryoshka: Extracting Ontological Structure from Retrieval Embeddings

The paper demonstrates that Matryoshka Representation Learning (MRL) embeddings contain a natural coarse‑to‑fine hierarchy, with prefix length aligning to gold taxonomy granularity. By training a simple order‑embedding probe called PEEL on these frozen embeddings, the authors can recover high‑fidelity taxonomic DAGs from a concept vocabulary alone, achieving strong results on two OLLM benchmarks and transferring to new domains without target‑edge supervision. The study shows that pre‑trained retrieval embeddings encode a decodable granularity gradient, enabling a minimal probe to extract explicit parent‑child (is‑a) structure.

By Eunchan Kim, Inwhee Joe
arXiv Machine Learning
Sep 11

Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN)

The paper introduces EXYGEN, a framework that enables conversational access to large knowledge graphs by combining VoID descriptions, ShEx schemas, retrieved triples, and example question‑query pairs in a retrieval‑augmented generation pipeline. On the SciQA benchmark, this approach achieves an exact‑match score of 0.419 without fine‑tuning any large language model, and shows that larger general‑purpose LLMs can outperform smaller code‑specialized ones when provided sufficient context. To scale metadata generation for very large KGs, the authors propose a predicate‑coverage‑aware parallel graph sampling strategy that preserves structural diversity, reduces runtime by over 80× on OpenCitations Meta and GESIS, and is the only tractable method for obtaining complete metadata on ORKG.

By Harshdeep Singh, Yurui Zhu, Giovanni Colavizza, Matteo Romanello