论文

结果表明，思维轨迹是推理任务的有效检索语料；将其转换为结构化、紧凑化或诊断式表征后，可释放出更强的增益。The results suggest that thinking traces are an effective retrieval corpus for reasoning tasks, and transforming them into structured, compact, or diagnostic representations unlocks even stronger gains.

本文提出 SCAR（Semantic Continuity-Aware Retrieval），一种自适应检索策略，通过权衡查询-邻居相关性与结构连续性惩罚来选择性扩展相邻分块，由此得到近似尺度不变的决策规则，无需重新校准即可跨 embedding 模型迁移。SCAR (Semantic Continuity-Aware Retrieval), an adaptive retrieval policy that selectively expands neighboring chunks by weighing query-neighbor relevance against a structural continuity penalty, is proposed, yielding an approximately scale-invariant decision rule that transfers across embedding models without recalibration.

本文提出 PathRouter，一种面向 agentic GraphRAG 的路径感知训练框架，沿答案正确性与证据路径重叠度联合评估每条轨迹，归纳出四类轨迹并采用差异化 GRPO 优势缩放，抑制捷径式强化同时保留证据寻求行为。This work presents PathRouter, a path-aware training framework for agentic GraphRAG that jointly evaluates each trajectory along answer correctness and evidence-path overlap, yielding four trajectory categories with differentiated GRPO advantage scaling that suppresses shortcut reinforcement while preserving evidence-seeking behavior.

本文提出 Diverge，一种即插即用的 agentic RAG 框架，通过迭代式、反思引导的多视角探索以及多样性感知检索支持来改善多样性—质量权衡，并引入用于刻画开放域问答中多样性—质量权衡的评估指标。Diverge is proposed, a plug-and-play agentic RAG framework that improves the diversity--quality trade-off through iterative, reflection-guided exploration of diverse viewpoints and diversity-aware retrieval support, and introduces evaluation metrics for characterizing the diversity-quality trade-off in open-ended question answering.

本文提出名为 InSemRAG 的 RAG 框架，通过迭代检索—校验机制及两个支撑模块——意图感知检索器（IAR）与语义保持切分（SPC）——应对上述挑战。This work proposes a RAG framework, termed InSemRAG, that addresses these challenges via an iterative retrieve-and-check mechanism with two supporting modules, an intention-aware retriever (IAR) and semantics-preserving chunking (SPC).

MRAgent，一种将联想记忆图与主动重构机制相结合的框架，将 LLM 推理直接融入记忆访问，确保记忆检索能动态适配推理上下文，同时避免无约束扩展引发的组合爆炸。MRAgent, a framework that combines an associative memory graph with an active reconstruction mechanism that integrates LLM reasoning directly into memory access, ensuring that memory retrieval is dynamically adapted to the reasoning context while avoiding combinatorial explosion caused by unconstrained expansion.

本文首次系统分析了 LLM 如何通过强化学习（RL）学习针对不同 retriever 调整 query 表述策略，并揭示 RL 能有效教会 LLM 根据特定 retriever 特性定制 query。This work presents the first systematic analysis of how LLMs can learn to adapt their query formulation strategies for different retrievers via reinforcement learning (RL), and reveals that RL effectively teaches an LLM to tailor its queries to specific retriever characteristics.

本文旨在应对常见挑战并简化 RAG 与既有企业基础设施的集成，提出一套面向可扩展本地化部署企业 RAG 方案的综合性 AI 工程蓝图。This paper aims to address the gap in comprehensive on-premises RAG implementation frameworks by presenting a comprehensive AI engineering blueprint for scalable on-premises enterprise RAG solutions to address common challenges and streamline the integration of RAG into existing enterprise infrastructure.

分析表明，鲁棒的长期记忆（Long-Term Memory）安全无法仅在 retrieval 或执行阶段后置加固，而必须在最初就以存储阶段的溯源、版本化与策略感知的 retention 为基础进行锚定。This analysis indicates that robust Long-Term Memory security cannot be retrofitted at retrieval or execution time alone, but must be anchored in storage-time provenance, versioning, and policy-aware retention from the outset.

提出 SIFT：Selective-Index For Fast Compute of RAG Prefill by Exploiting Attention Invariance，离线处理文档并提取每个文档中高分注意力的细粒度位置，以两个紧凑的位向量存储这些高分位置。SIFT: Selective-Index For Fast Compute of RAG Prefill by Exploiting Attention Invariance is proposed, which processes documents offline and extracts fine-grained locations of high attention scores for each document and stores locations of high scores in the form of two compact bit vectors.

提出 TRUSTMARGIN，一种免训练、即插即用的仲裁层，利用模型自身的似然对两个候选进行打分，在不微调、无需外部评判或额外生成的情况下，在直接回答与 RAG 之间进行选择。TRUSTMARGIN is proposed, a training-free, plug-and-play arbitration layer that scores the two existing candidates with the model's own likelihoods and selects between Direct and RAG without fine-tuning, external judges, or additional generation.

本文利用源自 CNN 的同一基础信息重新审视初始搜索与重排序两个检索阶段，显著改进了现有基于 CNN 的识别流水线。This work revisits both retrieval stages, namely initial search and re-ranking, by employing the same primitive information derived from the CNN, and significantly improves existing CNN-based recognition pipeline.