arXiv:2610.16182v1 Announce Type: new
Abstract: Flagship large language models (LLMs) offer rich general knowledge and strong reasoning capabilities, but their high inference cost and latency limit t...
By Daoping Wu, Dong Wang, Siyu Liu, Chen Liang, Jian Geng, Ziqi Li, Shuguang Xiong, Ying Zhang
arXiv:2609.24372v1 Announce Type: new
Abstract: In-context learning (ICL) based on large language models (LLMs) has shown promising potential in alleviating performance bottlenecks caused by the limi...
By Jingyu Wang, Shijie Wu, Fusheng Jin
arXiv:2609.14652v1 Announce Type: cross
Abstract: Large Language Model (LLM) applications often transfer domain concepts into the model's context informally, through prompt prose, schema dumps, and e...
By Blake G. Fitch
arXiv:2508.14323v3 Announce Type: replace
Abstract: Tool-augmented LLMs invoke external functions to extend their capabilities, but errors in the invocation decision, such as calling a tool when none...
By Yixin Chen, Ying Xiong, Shangyu Wu, Yufei Cui, Xue Liu, Nan Guan, Chun Jason Xue
arXiv:2610.34866v1 Announce Type: new
Abstract: Large Language Models (LLMs) have shown remarkable capabilities across tasks, but they still struggle with complex reasoning that requires integrating...
By Zicheng Zhao, Linhao Luo, Zongji Yu, Junnan Dong, Yanchao Tan, Shirui Pan, Chen Gong
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:2610.01936v2 Announce Type: replace
Abstract: Large Language Models (LLMs) have demonstrated remarkable fluency and versatility across natural language tasks but remain fundamentally limited by...
By Meghana Sunil, Shravya V, Shravan Venkatraman, Joe Dhanith PR
arXiv:2607. 25718v1 Announce Type: cross Abstract: Large language model (LLM) agents increasingly rely on invoking external tools to complete real-world tasks.
By Xinyi Hong, Pinjun Dong, Xinyang Yu, Binyan Jiang
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
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
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
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