论文

结果表明，思维轨迹是推理任务的有效检索语料；将其转换为结构化、紧凑化或诊断式表征后，可释放出更强的增益。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.

引入 D（Domain-Collection-Document），一种面向领域的设计，用于在不修改底层语言模型的前提下组织 RAG 系统中的知识并控制查询处理。D (Domain-Collection-Document), a domain-oriented design to structure knowledge and control query processing in RAG systems without modifying the underlying language model, is introduced.

提出 Tail-Aware Adaptive-k（TAA-k），一个无需训练、通过局部验证策略将 EVT 落地的框架，检索质量接近 oracle，相较全局 EVT 方法获得数量级的效率提升，并在不同 embedding 模型和压缩维度下保持稳健。Tail-Aware Adaptive-k (TAA-k), a training-free framework that operationalizes EVT through a localized validation strategy, is proposed, which achieves near-oracle retrieval quality with orders-of-magnitude efficiency gains over global EVT methods, while maintaining robustness across embedding models and compression dimensions.

分析表明，鲁棒的长期记忆（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.

本文提出 personalized auto-research 问题，将研究流程的每个阶段都以个体研究者的表征为条件，并提出了一个通用且灵活的框架，将基于图的研究者上下文贯穿于检索、假设搜索、实验、写作与评审之中。This work introduces the problem of personalized auto-research, which conditions every stage of the research process on a representation of the individual researcher, and proposes a general and flexible framework that threads a graph-grounded researcher context through retrieval, hypothesis search, experimentation, writing, and review.

读者特定的效用确实存在，但偏好并非干预：稳定的排序相似性不能授权帮助/伤害决策的迁移，稳定的序数相似性也无法预测跨读者的干预迁移。Reader-specific utility exists, but preference is not intervention: stable ranking similarity does not license transfer of help/harm decisions, and stable ordinal similarity fails to predict cross-reader intervention transfer.

提出 CoAL-RAG，一种复杂度感知的法律检索增强生成方法，通过构建基于"问题本质"与"检索一致性"的多维评估机制，实现检索策略的自适应路由。CoAL-RAG is proposed, a complexity-aware legal retrieval-augmented generation method, which constructs a multi-dimensional evaluation mechanism based on ``question essence'' and ``retrieval consistency'' to enable adaptive routing of retrieval strategies.

结果表明，Engram 可充当可复用的外部知识工件，前提是目标侧具备兼容的 Reader 接口；当直接复用 Reader 效果不足时，目标侧适配可进一步改善对齐效果。The results suggest that Engram can serve as a reusable external knowledge artifact, provided that the target has access to a compatible reader interface and target-side adaptation can further improve alignment when direct reader reuse is insufficient.

受搜索与推荐系统启发，本文构建了 Find、Attempt 与 Recommend（FAR），即一个从文献到综述的级联流程，可自动搜索合适的问题，并将人类注意力聚焦于经过多阶段筛选的成果上。Inspired by search and recommender systems, this work builds Find, Attempt, and Recommend (FAR), a literature-to-review cascade that automates the search for suitable problems and focuses human attention on artifacts that have passed several stages of filtering.

本文提出 IAR（Inject, Align, and Recover），一个三阶段后训练框架，将结构化文档知识注入、问答行为对齐与通用能力恢复解耦，提升面向无检索文档内化的"领域主—领域通"前沿。This work proposes IAR (Inject, Align, and Recover), a three-stage post-training framework that separates structured document knowledge injection, QA behavior alignment, and general ability recovery and improves the domain-primary domain-general frontier for retrieval-free document internalization.

本文提出 NAPE（Next-Audio-Patch-Embedding prediction），一个自监督框架：因果 Transformer 仅依据因果掩码与 stop-gradient，从先前 patch 嵌入预测对数梅尔频谱图的下一 patch 嵌入。NAPE (Next-Audio-Patch-Embedding prediction), a self-supervised framework in which a causal Transformer predicts each next patch embedding of a log-mel spectrogram from the previous ones, using causal masking and stop-gradient as its sole training signal is introduced.

本文为阿拉伯法学（fiqh）构建了一个检索测试集，并基于此评估稠密、词法、混合、微调及教法学派感知（madhhab-aware）等检索策略；错误分析表明，主要挑战在于区分包含答案的段落与主题相似但不含目标教法的段落。This work builds a retrieval test collection for Arabic fiqh and uses it to evaluate dense, lexical, hybrid, fine-tuned, and madhhab-aware retrieval strategies, and presents an error analysis showing that the main challenge is distinguishing answer-bearing passages from topically similar passages that do not contain the requested ruling.

这些结果支持一种分工：使用 embedding 模型处理相似度、分类与聚类任务，将 LLM 留给推理密集型的检索任务。These results support a division of labour: use embedding models for similarity, classification, and clustering, and reserve LLMs for reasoning-intensive retrieval, and reserve LLMs for reasoning-intensive retrieval.

本文提出 EnSI-RAG（Entity-Structure-Indexed Retrieval-Augmented Generation），通过构建查询无关、以实体为中心的索引，将证据定位与答案合成解耦，同时保留可追溯的源证据。This work proposes EnSI-RAG (Entity-Structure-Indexed Retrieval-Augmented Generation), a framework that constructs a query-independent, entity-centered index that separates evidence localization from answer synthesis while preserving traceable source evidence.

本文提出 FORGE（Fake Online Recommendations in Generative Environments），将一组固定检索网页中的真实商品在本地改写为虚假商品，并在 15 个类别、5 种消费场景下的 225 件真实商品上，衡量 LLM 推荐虚假商品的频率。This work introduces FORGE (Fake Online Recommendations in Generative Environments), which locally rewrites real products in a frozen set of retrieved web pages into fake ones and measures how often the LLM recommends the fake product, across 225 real products in 15 categories and 5 consumer scenarios.

提出 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.

本文提出一种构建 Context-Enhanced MMKG (CEMMKG) 的新框架，能够有效利用上下文信息提升基于 MMKG 的 RAG 性能，并在不同基于 MMKG 的 RAG 方法上的有效性验证了其广泛适用性。A novel framework for constructing a Context-Enhanced MMKG (CEMMKG) is proposed, effective in leveraging contextual information to improve MMKG-based RAG performance and its effectiveness across different MMKG-based RAG methods demonstrates its broad applicability.

提出 CaSKG，一种反事实因果 Skill 图谱框架，在检索前校准程序关系，将边置信度校准定位为大规模紧凑且可执行的 Skill 检索的有效路径。CaSKG, a counterfactual-causal skill graph framework that calibrates procedural relations before retrieval, is proposed, position edge-confidence calibration as an effective route to compact and executable skill retrieval at scale.

本工作将 embedding 缩放作为正交于稀疏度缩放的强有力维度加以探索，并推出 LongCat-Flash-Lite，一个从零训练的 68.5B 参数、约 30 亿激活参数的模型，不仅超越参数等量级的 MoE 基线，还对同规模现有模型展现出卓越竞争力。This work explores embedding scaling as a potent, orthogonal dimension for scaling sparsity and introduces LongCat-Flash-Lite, a 68.5B parameter model with ~3B activated trained from scratch that not only surpasses parameter-equivalent MoE baselines but also exhibits exceptional competitiveness against existing models of comparable scale.

该研究将 358,896 条消息切分为 22,329 个时间连贯的块，并构建三种搜索表示：raw_text、生成的 summary，以及将 summary 与 raw_text 片段及其他固定文本相结合的 embedding_text。This study segmented 358,896 messages into 22,329 temporally coherent chunks and constructed three search representations: raw_text, a generated summary, and embedding_text, which combines a summary with a raw-text excerpt and other fixed text.

提出 CamoDocs，一种通过将对抗文档伪装在良性内容中来避免直接包含查询的投毒攻击，并表明 TrustRAG 等以擦除为主的聚类防御可降低 ASR，但会在 NeoQA 等依赖检索的基准上造成显著的效用下降。CamoDocs is proposed, a poisoning attack that avoids direct query inclusion by camouflaging adversarial documents among benign content, and shows that erasure-heavy clustering defenses such as TrustRAG can reduce ASR, but only with substantial utility drops on retrieval-dependent benchmarks such as NeoQA.

一种神经符号架构，将逻辑知识图谱（LKG）与动态求解器路由相结合，并引入基于本体的 LKG，将逻辑规则和约束视为一等拓扑节点，从而支持对从文本中抽取的依赖关系进行显式建模。A Neuro-Symbolic architecture that integrates a Logical Knowledge Graph (LKG) with dynamic solver routing, and introduces an ontology-based LKG that treats logical rules and constraints as first-class topological nodes, enabling explicit modeling of dependencies extracted from text.

该候选名单可在不牺牲检索质量的前提下短路全语料库加密搜索：200–500 个候选即可在 5 个零样本语料库（规模从 25K 到 5.4M 文档）中与全语料库检索效果接近匹配。This shortlist short-circuits full-corpus cryptographic search without sacrificing retrieval quality: with 200-500 candidates, it closely matches full-corpus retrieval across five zero-shot corpora spanning 25K to 5.4M documents.

结果表明，即便在算力预算匹配的前提下，循环（looping）仍可提升 Transformer，提供了一种将深度复用转化为可衡量增益的实用方案。Results show that looping can improve Transformers even under budget matching, offering a practical recipe that turns depth reuse into measurable gains.

ACToR 在生成过程中识别关键 token，按需触发有针对性的检索，在这些决定性位置提供仓库上下文；并为稠密检索器设计了一种位置感知加权方法，以优先考虑对生成更具信息量的上下文。ACToR identifies critical tokens during generation and triggers targeted retrieval on demand to provide repository context at these decisive positions, and designs a position-aware weighting method for dense retrievers to prioritize context that is more informative for generation.

本文提出 ViSAR（Visual Semantic Activation Retrieval），一种面向 late-interaction 视觉文档检索的无训练自适应 k 检索方法，并表明相似度矩阵结构与答案准确率相关，为面向检索质量感知的文档理解指明了未来方向。ViSAR (Visual Semantic Activation Retrieval), a training-free adaptive-$k$ retrieval method for late-interaction visual document retrieval, is introduced and it is shown that the similarity matrix structure correlates with answer accuracy, suggesting future directions for retrieval quality-aware document understanding.

本文提出 NE-R1，一种面向自适应检索增强 NER 的新框架，在多个基准上达到 SOTA 性能，域内评估平均 F1 提升 2.52%，零样本跨域评估平均 F1 提升 1.18%。This paper proposes NE-R1, a novel framework for adaptive retrieval-augmented NER, which achieves state-of-the-art performance on various benchmarks, with an average F1 score gain of 2.52% in in-domain evaluation and 1.18% in zero-shot cross-domain evaluation.

本文提出 KBMR，首个面向 KB-VQA 的基于 MLLM 的 embedding retriever，并引入一个基于 MLLM 的语义判别器以生成连续的实体一致性权重，应对维基百科规模检索中的噪声监督挑战。KBMR is proposed, the first MLLM-based embedding retriever tailored for KB-VQA, and an MLLM-based semantic discriminator that generates continuous entity-consistency weights is introduced to tackle the challenge of noisy supervision in Wikipedia-scale retrieval.