论文

提出 Chat2Scenic，是首个以领域特定语言 (DSL) 生成场景脚本的迭代式检索增强框架，并构建了一个涵盖 NHTSA、联合国车辆法规及其他来源共 123 个场景的开源场景生成基准。Chat2Scenic is presented, the first iterative retrieval-augmented framework to generate scenario scripts in Domain Specific Language (DSL) and proposes an open benchmark for scenario generation comprising 123 scenarios from various regulations, including NHTSA and United Nations Vehicle Regulations, as well as other sources.

该综述细致梳理了 RAG 范式的演进，涵盖 Naive RAG、Advanced RAG 与 Modular RAG，并对 RAG 框架的三大基础支柱——检索、生成与增强技术——进行了深入审视。This comprehensive review paper offers a detailed examination of the progression of RAG paradigms, encompassing the Naive RAG, the Advanced RAG, and the Modular RAG, and meticulously scrutinizes the tripartite foundation of RAG frameworks, which includes the retrieval, the generation and the augmentation techniques.

该工作将两步方法的遗憾分解为候选生成遗憾和候选内选择遗憾，并利用最近邻估计器和Transformer的预测误差保证对后者进行了界。This work decomposes the regret of the two-step method into candidate-generation regret and within-candidate choice regret, and bound the latter using prediction-error guarantees for nearest-neighbor estimators and transformers.

本文提出 Chunk Coverage (CC)，一种独立于 oracle 的 RAG 系统检索组件测试充分性准则，结果表明 CC 在无需测试 oracle 的情况下捕获了与有效测试相关的检索多样性。Chunk Coverage (CC), an oracle-independent test adequacy criterion for testing the retrieval component of RAG systems, is introduced and results show that CC captures retrieval diversity relevant to effective testing without requiring test oracles.

研究结果表明，文档表示不应被视为检索开始前一次性的固定预处理选择，而应作为一个明确的优化目标。The results suggest that document representation should not be treated as a fixed preprocessing choice made before retrieval begins, but as an explicit optimization target.

本文提出 IteraSim RAG，一个面向自动化 OpenFOAM 算例生成的 RAG 软件后端，围绕三大局限构建：求解器选择、湍流闭合、边界条件与有限体积默认值。IteraSim RAG is presented, a retrieval-augmented software back-end for automated OpenFOAM case generation built around three limitations: solver selection, turbulence closures, boundary conditions and finite-volume defaults.

本综述对图嵌入文献进行全面回顾，并提出两种图嵌入分类法，分别对应不同图嵌入问题设置中的挑战以及现有工作如何在解决方案中应对这些挑战。This survey conducts a comprehensive review of the literature in graph embedding and proposes two taxonomies ofGraph embedding which correspond to what challenges exist in differentgraph embedding problem settings and how the existing work addresses these challenges in their solutions.

已部署的平台与其面向运维的评估共同构成了一条可信赖、统计上可靠的 AI 辅助工作流，适用于设施运维，并可推广到其他大型科学仪器。Together, the deployed platform and its operations-grounded evaluation present a promising workflow for trustworthy, statistically grounded AI assistance in facility operations, transferable to other large scientific instruments.

DeCoRAG 是一个多模态 Graph RAG pipeline，将知识处理从耦合的视觉-语义推理转向认知层面的 Decoupling，进而把推理空间从稠密、带噪的背景推向纯净、意图驱动的语义簇。DeCoRAG is a multimodal Graph RAG pipeline that shifts knowledge processing from coupled visual-semantic reasoning to cognitive Decoupling, and subsequently drives the reasoning space from dense, noisy backgrounds to purified, intent-driven semantic clusters.

结果表明，RAG 增强的 LLM 能显著提升生成文本的事实一致性、领域专属性与规范精度，同时降低产生无支持内容的风险；本地部署的 RAG 增强 LLM 不应仅被视为文本生成工具，而应作为认知计算基础设施中的语义处理模块，在法律和信息高度动态的环境中支撑合规与组织决策。The results demonstrate that augmenting LLMs with RAG significantly improves the factual consistency, domain specificity and normative precision of generated texts while reducing the risk of unsupported content generation and indicate that locally deployed LLMs enhanced with RAG should be regarded not merely as text generation tools but as semantic processing modules within cognitive computing infrastructures supporting regulatory compliance and organizational decision-making in environments characterized by high legal and informational volatility.

提出一种面向历史文档修复的新框架，利用搭载 RAG 的大语言模型，有效缓解了推断上下文相关专有名词的难题。A novel framework for historical document restoration that leverages large language models with retrieval-augmented generation (RAG) and effectively mitigates the challenge of inferring context-dependent proper nouns is introduced.

RedE 利用 final-answer attention 作为自动监督信号来塑造 step-level 表征空间，使其中的噪声步骤可被可靠识别与过滤，并在检测性能上超越有竞争力的基线。RedE leverages final-answer attention as an automatic supervision signal to shape the step-level representation space, yielding refined embeddings in which noisy steps can be reliably identified and filtered and improves detection performance over competitive baselines.

本文在由专家级 MITRE Center for Threat-Informed Defense 标注构成的、包含 1,207 条 CVE 的精选 gold 数据集上训练多标签分类器，结果表明该分类器受限于标签质量而非数据规模。A multi-label classifier is trained on a curated gold dataset of 1,207 CVEs from expert MITRE Center for Threat-Informed Defense mappings, indicating that the classifier is limited by label quality rather than dataset size.

本文提出 Kontrast，一种利用 Text-to-SPARQL 与 LLM 推理将基于表格的答案与 KG 证据进行对比并对所产生的不一致性进行分类的自动框架，并表明文本、表格与 KG 可通过系统性对比相互补充与纠错。Kontrast is presented, an automatic framework that uses Text-to-SPARQL and LLM reasoning to compare table-based answers with KG evidence and categorize the resulting inconsistencies, and shows that text, tables, and KGs can complement and correct one another through systematic comparison.

BeyondUncertainty 首先引出结构化的临时答案与置信度估计，然后应用在 held-out 验证数据上选定并在测试评估前冻结的模型特定阈值，揭示了更具选择性的证据获取与端到端 token 效率之间的权衡。BeyondUncertainty first elicits a structured provisional answer and confidence estimate, then applies a model-specific threshold selected on held-out validation data and frozen before test evaluation, revealing a trade-off between more selective evidence acquisition and end-to-end token efficiency.

Temporal-Distance-JEPA 通过发现离线日志中的时间进展结构，并将代价形式与规划时部署协同设计，缩小了 JEPA world-model 规划器的训练-规划差距。Temporal-Distance-JEPA narrows the train--plan gap for JEPA world-model planners by discovering temporal progress structure in offline logs and co-designing cost form with plan-time deployment.

提出知识对齐的多跳检索器 KAMR，区分受 query 强约束的 anchor triplet 和弱对齐但在结构上与 anchor 相连的 connected triplet，持续提升多跳检索及下游问答性能。A knowledge-aligned multi-hop retriever, KAMR, which distinguishes anchor triplets that are strongly constrained by the query from connected triplets that are weakly aligned yet structurally linked to the anchors, which consistently improves multi-hop retrieval and downstream question answering performance.

提出 DualG-MRAG，一种面向多模态 RAG 的双层框架，解耦 Macro-reasoning 与 Micro-matching Graph 两类图结构，通过分离全局结构推理与细粒度证据匹配来抑制检索噪声，并引入动态规划解码机制，从 GNN 前向过程中直接提取显式推理路径。DualG-MRAG is proposed, a Dual-tier framework that introduces a decoupled architecture comprising Macro-reasoning and Micro-matching Graphs for Multimodal RAG to suppress retrieval noise by isolating global structural reasoning from fine-grained evidence matching, and introduces a dynamic programming decoding mechanism that extracts explicit reasoning paths directly from the GNN's forward pass.

引入一个基于 GLM 的 retriever，并在单跳与多跳 RAG 场景下对比分析 GLM-based、GNN-based 与传统向量检索 retriever 的相对优势，指出微调后的 GLM retriever 具有更好的跨域泛化能力。This work introduces a GLM-based retriever and investigates the comparative strengths of GLM-based, GNN-based, and traditional vector-search-based retrievers in single- and multi-hop RAG settings, and suggests that finetuned GLM retrievers generalize better out of domain.

提出 ConMem，一个面向 LLM 辅助设备巡检的贡献感知 memory 框架，支持人在环的早期风险筛查，并在受限 memory 预算下保留高价值证据。This work proposes ConMem, a contribution-aware memory framework for LLM-assisted equipment inspection, supporting a human-in-the-loop early-risk screening system and retaining high-value evidence under a constrained memory budget.

OptGraph 是首个引入 GraphRAG 的优化 agentic workflow，首次将可复用经验构建为类型化 graph，刻画建模模式、问题形式化、实现细节与错误修正之间的关系。OptGraph is the first optimization agentic workflow that introduces graph retrieval-augmented generation (GraphRAG) and first constructs reusable experience as a typed graph, capturing the relationships among modeling patterns, problem formalization, implementation details, and error corrections.

提出统一框架，融合时频图结构学习与协变量感知的表示融合，证实其在建模选择性变量交互、利用协变量提升预测精度方面的有效性。This work proposes a unified framework integrating time–frequency graph structure learning with covariate-aware representation fusion, confirming its effectiveness in modeling selective variable interactions and leveraging covariates for improved forecasting accuracy.

结果表明DEFRAG缩小了SLM与LLM之间的准确度差距，同时相比集中式服务成本降低最高达98.4%，峰值吞吐提升最高达97.8%，展现其在边缘实现民主化LLM服务的潜力。Results show that DEFRAG narrows the SLM-LLM accuracy gap, while reducing cost by up to 98.4% and increasing peak throughput by up to 97.8% over centralized services, demonstrating the potential of DEFRAG for democratized LLM services at the edge.

TEngineDB-V通过将全局段解耦索引物化为关系表，使向量搜索成为Tencent OLAP引擎的一等分析原语，消除scatter-gather执行、降低放大效应，并支持原生存储优化。TEngineDB-V makes vector search a first-class analytical primitive in Tencent's OLAP engine through a global segment-decoupled index materialized as relational tables, eliminating scatter-gather execution, reducing amplification, and enabling native storage optimizations.

UEmbed (Unified Embedding)是一种decoder-only多模态嵌入模型，在单次因果前向中同时产出稀疏词项与稠密表示，提供新范式：在单一模型中统一稠密与稀疏嵌入，并将稀疏检索扩展以统一文本与多模态输入。UEmbed (Unified Embedding), a decoder-only multimodal embedding model that produces both sparse lexical and dense representations in one causal forward pass, offers a new paradigm: it unifies dense and sparse embeddings in one model, while further extending sparse retrieval to unify text and multimodal inputs.

本工作提出一种通过引入自注意力来提取可解释句子嵌入的新模型，使用一个二维矩阵表示嵌入，其中矩阵的每一行关注句子的不同部分。A new model for extracting an interpretable sentence embedding by introducing self-attention is proposed, which uses a 2-D matrix to represent the embedding, with each row of the matrix attending on a different part of the sentence.

本文提出 Atlas，一个经过精心设计并预训练的检索增强大语言模型，能以极少训练样例学习知识密集型任务，并研究了文档索引内容的影响，表明该索引可便捷地更新。This work presents Atlas, a carefully designed and pre-trained retrieval augmented language model able to learn knowledge intensive tasks with very few training examples, and studies the impact of the content of the document index, showing that it can easily be updated.

本文通过深度多模态嵌入视觉与自然语言数据，提出了一种用于图文双向检索的模型，并引入结构化的最大间隔目标，使该模型能够显式地跨模态关联片段。This work introduces a model for bidirectional retrieval of images and sentences through a deep, multi-modal embedding of visual and natural language data and introduces a structured max-margin objective that allows this model to explicitly associate fragments across modalities.

本文利用源自 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.