DynaKRAG is a unified framework that learns a state‑conditioned policy to control evidence acquisition in multi‑hop retrieval‑augmented generation. It uses a deterministic validity layer to build an action set, a learned continuation gate to decide between generating an answer or gathering more evidence, and an advantage scorer to rank evidence operations by predicted gain. Across HotpotQA, 2Wiki, and MuSiQue with various backbone models, DynaKRAG achieves top EM and F1 scores, improves token and retrieval efficiency, and enables terminal evidence compression that reduces context size while boosting answer quality.
By Chenyu Zhou, Yaqi Wu, Xiaolei Guo, Jiaqi Huang, Xianfa Zhang, Junxu Zhang, Zhuo Yu, Zhubo Shi, Jianghao Lin, Dongdong Ge
arXiv:2607. 21324v1 Announce Type: cross Abstract: Retrieval-Augmented Generation (RAG) systems increasingly employ multiple LLM agents.
By Paolo Pedinotti, Enrico Santus
Entity-Memory graph retrieval preserves dialogue turns as verbatim memory nodes, links repeated mentions via shared entities, and connects adjacent memories with chronological edges. During retrieval, the system gates through entities, fuses semantics, and performs one‑hop chronological recovery before dense backfill, allowing it to keep neighboring memories that dense cosine ranking might miss. On 1,986 questions from ten LoCoMo conversations, this graph retrieval method increases official evidence recall at top‑k 25 from 79.7468 % to 84.4842 %, with the advantage extending from top‑k 5 to 50, though it does not improve overall final‑answer F1.
By Shumao Sun
Retrieval-Augmented Generation (RAG) systems increasingly employ multiple LLM agents. Yet, most prior work optimizes components in isolation rather than coordinating improvements across the pipeline.
Hi-Q is a new framework for multi‑hop question answering that refines queries hierarchically based on evidence retrieved from a corpus. At each node it tests whether the current query unit is supported by evidence; if not, the node is expanded using a dependency‑preserving binary operator and verified for semantic coverage. The resulting query tree grows according to corpus support signals, and Hi‑Q achieves state‑of‑the‑art performance on three multi‑hop QA benchmarks, outperforming both iterative retrieval and graph‑based baselines without constructing a corpus‑wide graph.
By Jueun Kim, Sungho Park, Wook-Shin Han
The paper introduces Iris-mini and Iris-pro, two search agents trained at 35B and 397B parameter scales. They use a novel data pipeline that constructs reverse‑engineered multi‑hop queries from web hyperlinks, filters trajectories, and alternates supervised fine‑tuning with reinforcement learning in a process called SFT‑RL climbing. Evaluations on several benchmarks show that, with inference‑time context management, the agents achieve the best open‑source results in their parameter ranges.
By Ziyuan Liu, Hengqi Liu, Zichuan Wang, Yang Qin, Jiachen Liang, Xu Chu, Shaowei Chen, Yuantao Gu, Mu Chuan