论文

潜变量世界模型在预测未来状态和在真实世界中规划方面表现出色。然而在实践中，我们缺乏一种原则性的方法来估计其能力如何随模型规模、数据和算力扩展，这一开放问题减缓了该领域进展。本工作提出 RoboJEPA，一种基于联合嵌入预测架构 (JEPA) 的世界模型，在涵盖 12 种机器人形态的大规模数据集上训练。我们表明 RoboJEPA 的想象误差——其潜变量推演的误差——遵循关于算力的二阶幂律，使我们能够预先Latent world models have shown a remarkable ability to predict future states and to plan in the real world. In practice, however, we lack a principled way to estimate how their capabilities scale with model size, data, and compute, an open problem that slows progress in the field. In this work we present RoboJEPA, a world model based on the Joint Embedding Predictive Architecture (JEPA) and trained on a large-scale dataset spanning 12 robotic embodiments. We show that RoboJEPA's imagination error, the error of its latent rollouts, follows a second-order power law in compute, allowing us to pre

恶意软件防御通常会尽快移除或隔离可疑程序。该策略虽便于遏制，却也浪费了观察攻击者行为与部署针对性反制的机会。ORCAGen 另辟蹊径：离线利用 GenAI 构建针对特定恶意软件的欺骗剧本，部署前进行校验，运行时仅强制执行已验证的逻辑。ORCAGen 将 RAG 与结构化提示工程相结合，以同时生成 PoC 恶意软件及对应的欺骗编排代码。Malware defenses often remove or isolate suspicious programs as quickly as possible. While effective for containment, this approach can also waste an opportunity to observe attacker behavior and deploy targeted countermeasures. ORCAGen takes a different approach: it uses GenAI to build malware-specific deception playbooks offline, validates them before deployment, and enforces only the verified logic at runtime. ORCAGen combines Retrieval-Augmented Generation (RAG) with structured prompt engineering to generate both proof-of-concept (PoC) malware and corresponding deception orchestration code.

大规模信息检索系统（包括 RAG 与推荐引擎）广泛采用多层分层数据结构，以在高维向量空间中实现超高速近似最近邻搜索。然而，确保贪心导航既精确又高效的几何条件仍未被充分理解。本文研究由 d 维环面 T^d 上 n 个数据点构建的邻近图分层结构上的贪心导航效率，并确定了一个确定性覆盖条件，在该条件下……Large-scale information retrieval systems, including retrieval-augmented generation (RAG) and recommendation engines, widely use multi-layered hierarchical data structures for ultra-fast approximate nearest-neighbor search in high-dimensional vector spaces. However, the geometric conditions that ensure accurate and efficient greedy navigation remain poorly understood. In this work, we study the efficiency of greedy navigation on a hierarchy of proximity graphs constructed from \(n\) data points on the \(d\)-dimensional torus~$\mathbb{T}^d$. We identify a deterministic coverage condition under

LLM 可在前缀式提取下泄露记忆化的训练序列：给定训练样本的前缀，模型可能为原始续写赋予高概率。但在部署系统中，前缀很少被单独评估，常与指令、检索文档或其他任务相关上下文一同出现，正如 RAG 所做的那样。这促使我们去考察：上下文条件化究竟是缓解了记忆化，还是仅仅改变了可被提取的记忆化样本集合。本文对这一问题展开研究……Large language models (LLMs) can expose memorized training sequences under prefix-based extraction: given a prefix from a training example, the model may assign high probability to the original continuation. In deployed systems, however, prefixes are rarely evaluated in isolation. They often appear together with instructions, retrieved documents, or other task-specific context, as in retrieval-augmented generation (RAG). This motivates examining whether contextual conditioning mitigates memorization or merely changes the set of memorized samples that become extractable. We investigate this iss

该工作提出了一个端到端的档案处理与检索框架，将大语言模型（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.

将预测的味觉空间作为基于内容的检索索引，对 309 项条目池的排序比 CLAP-text 基线（处于随机水平）忠实得多；ridge probes 与 audio-bandstop knockout 在已记载的声-味对应关系上读出了最强表征。Operationalised as a content-based retrieval index, the predicted taste space ranks a 309-item pool far more faithfully than a CLAP-text baseline, which sits at chance; ridge probes and an audio-bandstop knockout read the strongest representations against documented sound-taste correspondences.

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

CheckRLM：通过 RAG 及时校验并修正事实错误的框架，有效提升推理过程的可靠性，大幅超越现有基线。CheckRLM is a framework that improves the reliability of the reasoning process through Retrieval-Augmented Generation (RAG) by timely checking and correcting factual errors, and substantially outperforms existing baselines.

本文提出基于检索增强生成的多模态大学聊天机器人，将 LLM 与语义检索相结合，从以学校为中心的资源（如大学手册）中生成基于上下文的回复。This work presents the multimodal university chatbot with retrieval-augmented generation, which combines the large language model with semantic retrieval to produce context-based responses from institution-centric resources, such as the university handbook.

提出 Logit 贡献度评分（LOCOS），一种可感知写入的检测器，通过将每个注意力头的 OV 电路输出投影到答案 token 的去嵌入方向进行打分，在单次前向传播中对比 needle 与非 needle 源位置。Logit-Contribution Scoring (LOCOS) is introduced, a write-aware detector that scores each head by the projection of its OV-circuit output onto the answer-token unembedding direction, contrasting needle and off-needle source positions in a single forward pass.

仅启用记忆（不修改模型的任务-动作行为）即可将基础 Agent 性能提升约 2–4 倍，使 32B 开源权重模型具备与 Claude Opus 4.5、Gemini 3.1 Pro Thinking 等前沿系统相竞争的能力。Opting memory alone--without modifying the model's task-action behavior--improved the base agent's performance ~2x-4x, bringing a 32B open-weight model competitive with frontier systems such as Claude Opus 4.5 and Gemini 3.1 Pro Thinking.

结果表明，在重建频繁或高维场景中（如 multiprobe grid 等）基于网格的方法可能具有竞争力，因为这些场景下索引成本与维度鲁棒性决定性能。The results suggest that grid-based methods such as multiprobe grid may be competitive in rebuild-heavy or high-dimensional settings where indexing cost and dimensional robustness dictate performance.

AdaTrans 是一个通过三大核心机制解决 C 代码到 Rust 自动转换的框架：策略驱动的检索增强生成（RAG）机制，用于将编译器错误映射到具体修复；错误分层转换策略（ESTS），可根据错误类型自适应调整行为；以及多阶段验证流水线，以确保可编译性与功能等价性。AdaTrans is a framework that addresses the automated transformation of C code to Rust through three core mechanisms: a Strategy-Driven Retrieval-Augmented Generation (RAG) mechanism to map compiler errors to specific repairs, an Error-Stratified Transformation Strategy (ESTS) that adapts its behavior based on error types, and a multi-stage validation pipeline to ensure both compilability and functional equivalence.

AGE 专注于预测关键节点以外的节点，采用可学习节点采样器，在基于非参数检索组件的 GraphQA 任务上取得显著提升，在四个具有不同特征的基准数据集上均达到更高的准确率。AGE focuses on predicting nodes apart from key nodes, utilizing a learnable node sampler, and significantly improves approaches using non-parametric search component in GraphQA tasks, achieving superior accuracy across four benchmark datasets with distinct characteristics.

本文提出 SHIFT，一种新颖的框架，将神经元级修改重构为可学习的门控调制，使 LLM 能够自适应地调节内部激活以解决知识冲突。SHIFT is introduced, a novel framework that reformulates neuron-level modification as learnable gate modulation, allowing LLMs to adaptively regulate internal activations for knowledge conflict resolution, allowing LLMs to adaptively regulate internal activations for knowledge conflict resolution.

提出 ZooClaw-FashionSigLIP2——一款面向时尚领域的专用 SigLIP2-base 模型，以简洁方案化解该权衡，性能上优于 LoRA、更大骨干网络以及外部训练数据。ZooClaw-FashionSigLIP2, a fashion-specialized SigLIP2-base model that resolves this tradeoff with a simple recipe and outperforms LoRA, larger backbones, and external training data, is presented.

核心结论是"过时事实错误率"：在被要求作答时，RAG 有 15%–40% 的概率输出已被取代的旧值；MemStrata 将该比率降至约 0%，而这一类失效是 RAG 本身无法规避的。The central result is the stale-fact-error rate: when required to answer, RAG serves superseded values 15-40% of the time; MemStrata drives this to ~0%, a failure class RAG cannot avoid.

提出一种面向 LCA 解释的视角条件化检索增强生成框架，在 AI 辅助的 LCA 中引入多视角检索与受控合成，以支持超出传统 LCA 研究的、面向落地的决策。A perspective-conditioned retrieval-augmented generation framework for LCA interpretation, where a multi-perspective retrieval and controlled synthesis is incorporated in the artificial intelligence (AI)-assisted LCA to support implementation-oriented decision-making beyond conventional LCA studies.

提出 MIRROR——一个统一的跨表层框架，在显式新颖性约束下以检索到的上下文为条件生成候选，并执行记忆引导的蒙特卡洛树搜索，使检索可影响搜索先验，同时避免提示词级别的复制。MIRROR is presented, a unified cross-surface framework that performs memory-guided Monte Carlo tree search while conditioning candidate generation on retrieved context under an explicit novelty constraint, allowing retrieval to inform search priors without enabling prompt copying.

本文提出 TRACE——一种通过 token 影响归因追踪答案相关 token 来识别投毒攻击的轻量检测框架；该方法首先发现跨检索文档的反复出现的高影响关键词，再经二次验证确认其对模型预测的影响。TRACE is presented, a lightweight detection framework that identifies poisoning attacks by tracing answer-related tokens through token influence attribution, and first discovers recurrent high-influence keywords across retrieved documents and then performs a secondary verification to confirm their influence on model predictions.

本文全面审视集中式、设备端、联邦与混合范式下 RAG 系统的隐私与安全挑战，并勾勒出构建可信、安全、韧性 RAG 系统的开放性研究挑战。A comprehensive examination of privacy and security challenges across RAG systems deployed in centralized, on-device, federated, and hybrid paradigms is provided and open research challenges toward building trustworthy, secure, and resilient RAG systems are outlined.

提出一个简洁而高效的检索增强生成框架用于文生艺术图像任务，将艺术检索机制与基于 LoRA 的模型微调相结合，能够生成与用户输入高度匹配的艺术作品，性能显著优于现有方案。A simple yet efficient retrieval augmented generation framework for text-to-artistic image generation by integrating an art retrieval mechanism with LoRA-based model fine-tuning, which can generate artworks that closely match the user's input, significantly outperforming existing solutions.

概述了通过 LLM 进行空间推理所面临的挑战，并展望了搜索引擎与 LLM 集成、通过图增强推理来回答复杂空间问题的未来。The challenges associated with spatial reasoning through LLMs are outlined and a future in which search engines integrate with LLMs to answer complex spatial questions through graph-enhanced reasoning is envisioned.

HAKARI-Bench 是一个轻量级基准，将现有检索套件重建为统一格式的小型数据集（Nano-sets），支持在同一条件下对五类检索方法及其效率变体进行与模型无关的对比。HAKARI-Bench is a lightweight benchmark that reconstructs existing retrieval suites into small datasets (Nano-sets) in a unified format, enabling same-condition, model-agnostic comparison of five retrieval families and their efficiency variants.

本文命名了"检索状态锁定"这一失败模式，通过分离单一置信度分数所混淆的三个对象——答案表面、检索到的证据以及检索状态本身——来诊断该问题，并直接衡量"一致性盲区"。This work names the failure retrieval-state lock-in and diagnose it by separating the three objects a single confidence score conflates: the answer surface, the retrieved evidence, and the retrieval state itself, and measures the agreement blind spot directly.

本文提出一种将 LLM 与检索增强生成（RAG）相结合的混合方法，用于自动化跨版本 Qiskit 代码迁移，验证了这种以数据为中心的方法在促进技术独立性和提供缓解 API 过时问题的鲁棒智能助手方面的潜力。A hybrid approach integrating LLMs with Retrieval-Augmented Generation (RAG) to automate the migration of Qiskit code across versions and confirms the potential of this data-centric methodology to foster technological independence and provide robust, intelligent assistants that mitigate API obsolescence.

本文命名并测量了推测性查询的检索收敛到包含答案结果时的输入流位置——"工具意图稳定化"：即推测性查询的检索收敛到包含答案结果的输入流位置。This work names and measures the point in the input stream at which a speculative query's retrieval converges on the answer-bearing result, tool-intent stabilization: the point in the input stream at which a speculative query's retrieval converges on the answer-bearing result.

HACD-H 为建模自适应人-AI 社交交互与开发社交智能 AI 系统提供了统一的理论基础，并表明社交智能源自长期社交认知的协同进化，而非孤立的对话能力。The HACD-H provides a unified theoretical foundation for modeling adaptive human-AI social interaction and developing socially intelligent AI systems and suggests that social intelligence emerges from long-term social cognitive coevolution rather than isolated conversational capabilities.

提出 MCompassRAG，一种由元数据引导的检索框架，将主题级信号作为语义罗盘以选择相关证据，在同一 embedding 空间中以主题元数据丰富 chunk 表示，并通过 LLM 教师蒸馏训练轻量级检索器。MCompassRAG is introduced, a metadata-guided retrieval framework that uses topic-level signals as a semantic compass for selecting relevant evidence and enriches chunk representations with topic metadata in the same embedding space and trains a lightweight retriever through LLM-teacher distillation.

提出 HistoRAG，一个将史学原则转化为具体架构干预的框架，为特定领域认识论承诺如何转化为 RAG 设计决策提供模型，并可迁移至其他处理大规模语料的诠释性学科。HistoRAG is introduced, a framework that translates historiographical principles into concrete architectural interventions and offers a model for how domain-specific epistemological commitments can be translated into RAG design decisions, and may transfer to other interpretive disciplines working with large corpora.

提出 HyGRAG，一种分层图 RAG 框架，通过解决三个核心挑战超越源文档限制：构建真正融合上下文与关系信息的摘要、利用这些综合表示在检索阶段访问涌现知识、以及为动态语料高效更新分层结构。HyGRAG is proposed, a hierarchical graph RAG framework that transcends source documents by addressing three core challenges: constructing summaries that genuinely integrate contextual and relational information, leveraging these synthesized representations to access emergent knowledge during retrieval, and efficiently updating hierarchical structures for dynamic corpora.

本文提出一个面向规则驱动查询改写的自进化框架，无需任何参数训练即可增强 BM25，并揭示 LLM 利用先前实验结果的能力以及其对规则消除的内在知识，在通过自进化精炼规则集方面起到关键作用。This work proposes a self-evolving framework for rule-driven query rewriting that enhances BM25 without any parameter training, and reveals that LLM's capabilities to leverage previous experimental results and its intrinsic knowledge of rule elimination play critical roles in refining the rule set via self-evolution.

RL-Index 被提出，是一个将检索索引推理建模为强化学习问题的索引框架，能持续提升检索与下游问答性能，同时显著降低在线推理延迟。RL-Index is proposed, an indexing framework that formulates retrieval index reasoning as a reinforcement learning problem that consistently improves both retrieval and downstream question-answering performance, while significantly reducing online inference latency.

本文提出 MAGE-RAG，一个面向长文档多模态问答的多粒度自适应图证据框架，并建立了涵盖 Direct MLLM、Text RAG、Page-level Visual RAG 与 Graph/Agentic RAG 的统一比较与分析协议。This paper proposes MAGE-RAG, a multigranular adaptive graph evidence framework for long-document multimodal QA, and establishes a unified comparison and analysis protocol covering Direct MLLM, Text RAG, Page-level Visual RAG, and Graph/Agentic RAG.

本文理论上证明，归一化离散 Ricci Flow 可通过识别边权中的不同渐近行为来检测社区结构，并支持移除相对于 query 节点具有大权重与负 Ricci 曲率的"噪声"文档片段。It is theoretically prove that normalized discrete Ricci flow can detect community structures by identifying distinct asymptotic behaviors in edge weights, and supports the removal of ``noisy''document chunks characterized by large weights and negative Ricci curvature relative to the query node.