Aug 2026· Journal of King Saud University: Computer and Information Sciences· Vol 38· 0 citations· 47 references
TL;DR
A scale-aware comparative study of reasoning enhancement for SLMs across three major families of methods: prompting-based reasoning, retrieval-based augmentation, and knowledge graph guided scaffolding shows that reasoning-enhancement strategies are not universally transferable across model scales under the evaluated settings.
Abstract
Recent reasoning-enhancement paradigms, including chain-based prompting, retrieval-augmented generation, and graph-guided reasoning, have substantially improved the performance of large language models on question answering and knowledge-intensive tasks. However, whether these paradigms remain effective when transferred to small language models (SLMs) is still insufficiently understood. This question is particularly important for real-world deployments, where smaller models are often preferred due to resource constraints, latency requirements, and privacy considerations. In this paper, we conduct a scale-aware comparative study of reasoning enhancement for SLMs across three major families of methods: prompting-based reasoning, retrieval-based augmentation, and knowledge graph guided scaffolding. Using a unified experimental protocol, we evaluate representative paradigms on diverse question answering benchmarks and examine their behavior from three complementary perspectives: effectiveness, efficiency, and robustness. Our results show that reasoning-enhancement strategies are not universally transferable across model scales under the evaluated settings. In particular, chain-based prompting can become unstable on ultra-small models and is associated with longer, harder-to-control reasoning traces, while simply increasing unstructured retrieved context often yields limited gains at substantially higher token and latency costs. By contrast, graph-organized and graph-guided support is associated with more stable improvements in the evaluated multi-hop and knowledge-intensive settings, although its benefit remains dependent on graph quality, task structure, query-time cost, and the specific construction choices. These observations suggest that the success of reasoning enhancement depends not only on the method itself but also on the interaction with model scale and evidence organization. Beyond benchmarking, our study offers practical guidance for designing more inspectable, traceable, and resource-aware question answering systems, while pointing to structured evidence as a promising direction for adapting reasoning support to smaller foundation models under appropriate deployment conditions.
Large language models (LLMs) have made progress in knowledge-intensive tasks, reasoning and planning, and collaborative problem solving, yet they exhibit intrinsic limitations such as knowledge cutoff, single-threaded reasoning that hinders finer-grained branch and aggregation, and rigid collaboration mechanisms that struggle to coordinate specialized capabilities. Graphs, with their ability to represent relational knowledge and complex dependencies, offer a natural means to address these limitations: they provide structured, high-density knowledge for augmenting or correcting LLMs’ generation; enable revisitable inference by organizing intermediate steps as graphs; and support dynamic coordination among experts or agents in collaborative settings. Motivated by these developments, we present the first systematic survey of graph-assisted LLMs from the perspective of how graph structures mitigate LLMs’ limitations. We introduce a taxonomy spanning Graph-Assisted Knowledge Augmentation, Graph-Assisted Reasoning and Planning, and Graph-Assisted LLM Collaboration , and analyze representative methods, summarize common design patterns, and outline open challenges and future directions for advancing LLMs with graph-based enhancements. The collected papers are available in link here.
Haitong Luo, Fali Wang, Weiyao Zhang et al.· Annual Meeting of the Associ...· 2 citations
Large language models (LLMs) often generate inaccurate answers due to their reliance on static internal knowledge. Retrieval-augmented generation (RAG) addresses this limitation by integrating external knowledge and excelling at single-hop queries. However, it struggles with multi-hop questions that require cross-document reasoning. Existing methods, such as graph structured RAG or question decomposition, often lack dynamic decomposition and effective filtering, which leads to lower efficiency and accuracy. To overcome these limitations, we propose Dynamic Decomposition and Filtering for Multi-Hop Reasoning-Augmented Generation (D2F-ReAG), a novel paradigm that adaptively controls reasoning depth by judging the reliability of the root-level reasoning. If the root reasoning is reliable, the model directly generates the answer. Otherwise, the question is logically decomposed into sub-questions, and the verified reasoning derived from these sub-questions is used to refine the root reasoning. Experiments on three multi-hop benchmarks demonstrate the effectiveness of our method in handling complex multi-hop questions.
Jiaoyang Li, Junhao Ruan, Shengwei Tang et al.· 0 citations
Large Language Models (LLMs) have rapidly become central components of cognitive computing systems and AI-assisted knowledge work. However, the effectiveness of LLM-generated outputs depends not only on the model’s capabilities but also on the structure of the prompts used to guide them. This study investigates how structured prompting techniques influence perceived output usefulness in business-oriented tasks. First, we conduct a systematic literature review following PRISMA guidelines to identify, classify, and synthesize existing prompt enhancement strategies. The review leads to the development of a taxonomy distinguishing task-alignment techniques (e.g., one-shot and few-shot prompting) from reasoning-transparency techniques (e.g., Chain-of-Thought prompting). Building on this taxonomy, we design a controlled experimental study in which knowledge workers evaluate LLM-generated outputs across analytical and summarization tasks. Using linear mixed-effects modeling, we assess the impact of prompting techniques and the moderating role of Generative AI usage frequency. Results indicate that structured prompting significantly increases perceived usefulness compared to baseline approaches, with the combination of example-based conditioning and explicit reasoning scaffolding yielding the highest evaluations. The moderating effect of usage frequency is not statistically significant, suggesting that the benefits of structured prompt design are robust across different experience levels. These findings position prompt structure as a practical cognitive interface mechanism and provide evidence-based guidelines for enhancing human–AI interaction in cognitive computing environments.
A. Cantini, Andrea De Mauro· Big Data and Cognitive Compu...· 0 citations
Retrieval-Augmented Generation (RAG) has improved the factual grounding of large language models, but multi-hop question answering remains challenging because a system may retrieve semantically relevant yet evidence-incomplete contexts. Existing KG-guided RAG methods improve evidence coverage through graph expansion, but they often operate in a single-pass manner and lack an explicit mechanism for judging whether the assembled evidence is sufficient for reliable reasoning. Therefore, we propose AdaKG-RAG, an evidence-sufficiency-driven KG-guided RAG framework for multi-hop question answering. The core of AdaKG-RAG is a Hypothesis-and-Verification Retrieval (HVR) loop, which first forms a tentative answer from the current evidence, verifies whether the evidence is sufficient, and triggers targeted retrieval refinement when bridge facts are missing. To support this loop, AdaKG-RAG uses semantic-aware KG expansion and path-aware evidence organization to recover and structure candidate bridge evidence, followed by answer-aware supporting-fact (SF) reranking for better answer–evidence alignment. Experiments on HotpotQA and MuSiQue, together with a long-context evaluation on TriviaQA, show that AdaKG-RAG improves both answer quality and evidence retrieval quality over representative RAG and KG-RAG baselines. Further analysis indicates that HVR contributes the largest performance gain, while graph-based modules provide complementary improvements in evidence coverage and organization.
Mengsi Yuan, Tao Wang, Yurong Qian· Journal of King Saud Univers...· 0 citations
The increasing deployment of large language models (LLMs) in enterprise environments creates reliability challenges related to hallucination, factual inconsistency, limited knowledge traceability, uncertainty, and operational efficiency. This study develops a literature-based architectural framework for reliable knowledge retrieval systems that separates external knowledge management from LLM-based reasoning and generation. The framework synthesizes architectural mechanisms for knowledge representation, hybrid retrieval, reranking, evidence selection, context construction, response verification, provenance tracking, uncertainty handling, guardrails, and computational efficiency. The resulting architecture organizes these mechanisms into coordinated layers that control the flow of external evidence from knowledge sources to generated responses while supporting traceability and controlled abstention when sufficient evidence is unavailable. The architectural synthesis further identifies complementary strategies for enterprise deployment, including semantic caching, model routing, and human oversight, to balance reliability, scalability, and operational cost. The analysis indicates that reliable LLM deployment should be treated as an end-to-end architectural problem rather than solely a model-performance problem, with knowledge access, evidence quality, verification, provenance, and governance functioning as integrated system components. The proposed framework provides a structured foundation for designing maintainable, auditable, and reliable knowledge retrieval systems for enterprise and other high-stakes applications
Bharat Kumar Reddy Karumuri· International Journal of Eng...· 0 citations
What if pathology foundation models could do more with less? GigaPath-Flash and GigaTIME-Flash cut computational demands while maintaining strong performance, opening the door to larger studies and broader exploration. The post GigaPath-Flash and GigaTIME-Flash: Toward population-scale discovery with efficient pathology foundation models appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduAug 31, 2026
With millions of users across the world, Julia has been used to conduct cutting-edge research and to design new drugs, jet engines, heat pumps, and more.