论文

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

本文提出 Retrieval-Augmented Speculative Decoding (RAPID)，利用 RAG 在长上下文推理中同时加速并提升生成质量，并设计了一种推理时知识迁移机制，通过 RAG 丰富目标分布。Retrieval-Augmented Speculative Decoding (RAPID) is introduced, which leverages RAG for both accelerating and enhancing generation quality in long-context inference and develops an inference-time knowledge transfer that enriches the target distribution by RAG.

引入 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.

RAG 被用于伊斯兰问答，但多数系统采用端到端评估，难以区分检索失败与生成失败。本文研究阿拉伯 fiqh 的"承载答案的检索"——仅当段落陈述问题所需裁决时才视为相关。我们构建了阿拉伯 fiqh 检索测试集，并评估 dense、lexical、hybrid、fine-tuned 及 madhhab-aware 检索策略。最佳检索器 MRR@5 达 0.524，fine-tuning 进一步提升至 0.553；hybrid retrieval 增益有限（原文截断）。Retrieval-Augmented Generation is used for Islamic question answering, but most systems are evaluated end-to-end, making retrieval failures difficult to isolate from generation failures. We study answer-bearing retrieval for Arabic fiqh, where a passage is relevant only if it states the ruling required by the question. We build a retrieval test collection for Arabic fiqh and use it to evaluate dense, lexical, hybrid, fine-tuned, and madhhab-aware retrieval strategies. The best retriever achieves 0.524 MRR@5, while fine-tuning improves performance to 0.553. Hybrid retrieval provides limited gai

是否应将文本嵌入流水线替换为 LLM？我们对此在 37 个任务（涵盖分类、语义文本相似度 STS、聚类、配对分类与检索）上，对覆盖 6 个家族、参数规模 118M 至 14B 的 10 个 LLM 与 26 个嵌入模型进行了受控且考虑成本的对比。总体上两种范式基本持平：最佳 LLM（Gemini 3.1 Pro，77.6）与最佳嵌入模型（77.2）仅相差 0.4 分。两者在不同任务上各有所长：LLM 在推理密集型检索上领先，嵌入模型则在分类任务上领先，且两者……Should you replace your text-embedding pipeline with a large language model? We answer this with a controlled, cost-aware comparison of ten LLMs across six families and 26 embedding models (118M to 14B parameters) on 37 tasks spanning classification, semantic textual similarity (STS), clustering, pair classification, and retrieval. In aggregate the two paradigms are effectively tied: the best LLM (Gemini 3.1 Pro, 77.6) and the best embedding model (77.2) differ by 0.4 points. Their strengths differ by task: LLMs lead on reasoning-heavy retrieval, embedding models lead on classification, and th

长篇连通文档上的 QA 仍具挑战，因为相关证据可能跨越多个实体及其关系。现有 RAG 方法通常将文档以原始 chunk 索引并通过 embedding 相似度检索，当 chunk 边界切断实体与支持证据的联系，或问题需在语料库中多跳推理时性能下降。我们提出 EnSI-RAG（Entity-Structure-Indexed RAG），一个构建 query-independent、以实体为中心的[索引]框架……Question answering (QA) over long, connected documents remains challenging because relevant evidence may span multiple entities and their relationships. Existing retrieval-augmented generation (RAG) methods typically index documents as raw chunks and retrieve them through embedding similarity. Their performance degrades when chunk boundaries separate entities from supporting evidence or when a question requires multi-hop reasoning across the corpus. We propose EnSI-RAG (Entity-Structure-Indexed Retrieval-Augmented Generation), a framework that constructs a query-independent, entity-centered in

检索增强 LLM 越来越多地通过抓取实时网页内容来影响日常消费推荐。这带来一种新风险：LLM 推荐系统可能会摄入被生成式引擎优化（GEO）运营者污染、用于误导其判断的网页内容。我们追问：它们在多大程度上会成为假产品的无意推广者？我们提出 FORGE（Fake Online Recommendations in Generative Environments），在本地将一组固定已抓取网页中的真实商品改写为假商品，并衡量 LLM 跨 15 个类目中 225 件真实商品推荐假商品的频率。Search-augmented LLMs increasingly mediate everyday consumer recommendations by retrieving live web content. This creates a new risk: LLM recommenders may consume web content that Generative Engine Optimization (GEO) operators have polluted to mislead them. We ask: to what extent do they become unwitting promoters of fake products? We introduce 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 categor

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

本工作将 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.

SarseX 模型无关、无需训练，并与 Prefix Cache 兼容，可为多轮对话、检索增强生成 (RAG) 和 Agent 工作流等常见在线服务场景提供统一支持。SarseX is model-agnostic, training-free, and compatible with Prefix Cache, and it provides unified support for common online serving scenarios including multi-round chat, retrieval-augmented generation (RAG), and agent workflows.

本文提出一个 Agentic RAG 框架，使 LLM 能够使用逻辑表达式构建检索意图，同时将检索后端简化为基于倒排索引的系统，并表明将检索过程锚定在逻辑查询上可显著降低生成响应中的幻觉。This paper proposes an agentic RAG framework that enables LLMs to formulate retrieval intents using logical expressions while simplifying the retrieval backend to an inverted-index-based system, and shows that anchoring the retrieval process in logical queries substantially reduces hallucinations in generated responses.

提出 MMAgent-R$^2$，一种将视觉重排序与主动拒答作为内部验证机制的 Agentic mRAG 框架，并通过 GRPO 训练实现外部检索、内部验证与答案生成的联合优化。MMAgent-R$^2$, an agentic mRAG framework that integrates visual reranking and active rejection as its internal verification mechanism, is proposed and achieves joint optimization of external retrieval, internal verification, and answer generation via GRPO training.

提出一种基于不确定性感知框架的自适应问答方法，通过 LLM 内部表征中区分知识不足与知识歧义/冲突的显式信号，在单次前向传播中即可由隐状态高效估计。This work proposes an uncertainty-aware framework for adaptive QA based on explicit signals derived from LLM internal representations that distinguish between knowledge insufficiency and knowledge ambiguity or conflict, and efficiently estimate these from hidden states in a single forward pass.

提出 DynaKRAG，将多跳证据获取建模为针对原子证据操作的状态条件控制，并展示了在演化证据状态下协同检索、诊断与缺口定向获取的优势。DynaKRAG is introduced, which formulates multi-hop evidence acquisition as state-conditioned control over atomic evidence operations, and demonstrates the benefit of coordinating retrieval, diagnosis, and gap-directed acquisition under an evolving evidence state.

结果显示，RAG 在生成完整 API 调用时能够减少幻觉并提升正确性，但在端点已提供的情况下反而会促使生成不必要的参数而降低正确性；约束解码（CD）则能可靠地防止非法 URL、HTTP 方法与参数的出现，并显著提升两种 starter code 的整体正确性。Results show that RAG reduces hallucinations and improves correctness when generating full API invocations but reduces it when the endpoint is already provided as it encourages the generation of unnecessary parameters, and CD reliably prevents illegal URLs, HTTP methods, and arguments and substantially improves overall correctness for both starter codes.

提出一种新颖的进化系统，专注于利用 RAG 增强的 LLM 自动生成空域隐写的代码级代价函数；该方法在隐写安全性上一致优于现有自动设计方法，同时提高了平均代码执行率并降低了搜索成本。A novel evolutionary system focused on exploiting Retrieval-Augmented Generation enhanced LLMs for the automatic code-level generation of spatial steganography cost functions, which consistently achieves higher steganographic security than existing automatically designed methods and increases the average code execution rate while reducing the search cost.

该工作提出了一个端到端的档案处理与检索框架，将大语言模型（LLM）集成到档案流程中，并证明将 LLM 与成熟的文档处理与检索流程相结合，可将数字图书馆从静态存储库提升为可交互、可语义检索的档案系统。This work presents an end-to-end archival processing and retrieval framework that integrates large language models (LLMs) into the archival pipeline and demonstrates that integrating LLMs with established document processing and retrieval pipelines can elevate digital libraries from static repositories to interactive, semantically searchable archival systems.

本文提出 SOLAR，一种学习增强框架，从 regret 累积中推导修改时机，并基于隐式检索反馈的贝叶斯在线学习进行内容选择，实现与缓存大小和时域无关的常数竞争比。SOLAR is proposed, a learning-augmented framework that derives modification timing from regret accumulation and content selection from Bayesian online learning over implicit retrieval feedback and achieves a constant competitive ratio, independent of cache size and horizon.

提出 MEDIAREF：源自网络文档的公共知识库，支持跨 200 个媒体来源、可复现且低成本的 MBC 生成评估；给出可复现的构建与更新方法，并系统评测主流 LLM 在 MBC 生成任务上的表现。MEDIAREF, a publicly available knowledge store of web-sourced documents that enables reproducible, low-cost evaluation of MBC generation across 200 media sources, is introduced, describing a reproducible methodology for constructing and updating the collection, and assessing widely used LLMs on the MBC generation task.