RL Post-Training in Diffusion Transformers Is Activation Steering
Reinforcement learning (RL) post-training substantially improves the visual quality, text rendering, and compositional accuracy of diffusion transformers. Because capabilities such as rendering requested text or composing multiple objects are inherently prompt-dependent, a natural hypothesis is that improving them requires learning complex, input-dependent transformations. To isolate how much of these gains an input-independent shift explains, we probe each RL-tuned model with a deliberately simple parameterization: a fixed set of steering vectors added to the block outputs of the frozen base model. On SD3.5-M, these vectors hold 65x fewer parameters than the RL-tuned LoRA (0.29M against 18.8M). We fit them to match the velocity predictions of public RL-tuned checkpoints, with no reward in the objective. Although the vectors are identical for every prompt, token, and sampling seed, they recover 90.0-96.3% of the reward gains of six RL-tuned image models, and 89.8% and 111.9% on two RL-tuned video models. Initialized at zero and trained with online RL, the vectors alone exceed the reward gains of weight-based RL on text rendering (OCR) and human preference (PickScore) on SD3.5-M. A constant shift thus suffices for most of the gain of policy-gradient RL post-training: without new input-dependent transformations, it steers the pretrained generator toward what it can already compute.
Updated: 2026-11-19 18:59:53
标题: 扩散变换器中的强化学习后训练即激活引导
摘要: 强化学习(RL)后训练能够显著提升扩散变换器的视觉质量、文本渲染能力和构图准确性。由于渲染所要求的文本或组合多个物体等能力本质上依赖于提示词,一个自然的假设是:提升这些能力需要学习复杂的、依赖输入的变换。为了分离输入无关的偏移能够解释这些提升的程度,我们使用一种刻意简化的参数化方式探测每个经过 RL 调优的模型:在冻结的基础模型各模块输出上添加一组固定的引导向量。在 SD3.5-M 上,这些向量的参数量比经过 RL 调优的 LoRA 少 65 倍(0.29M 对 18.8M)。我们拟合这些向量,使其匹配公开 RL 调优检查点的速度预测,且目标函数中不包含奖励。尽管对于每个提示词、每个 token 和每个采样种子,这些向量都完全相同,但它们恢复了六个经过 RL 调优的图像模型奖励增益的 90.0%–96.3%,并在两个经过 RL 调优的视频模型上分别达到 89.8% 和 111.9%。以零值初始化并通过在线 RL 训练时,仅凭这些向量就在 SD3.5-M 的文本渲染(OCR)和人类偏好(PickScore)方面超过了基于权重的 RL 所带来的奖励增益。因此,一个恒定偏移就足以实现策略梯度 RL 后训练所带来大部分增益:无需引入新的、依赖输入的变换,它便能将预训练生成器引导向其本已具备计算能力的结果。
更新时间: 2026-11-19 18:59:53
领域: cs.CV,cs.LG
PlayCraft: Designing Engaging Games from Agent Play Experience
Recent AI agents can generate playable games, but these games are not necessarily engaging. Mastery is a key source of engagement, yet designing for it requires extensive human play and tuning. We propose PlayCraft, an automated framework that uses a vision-based agent to play games and draws on its detailed play experience to revise them for mastery. Starting from an initial game, PlayCraft alternates between playing and crafting. In the playing stage, a player agent watches the game screen, uses the controls, and pursues the game objective over repeated episodes while retaining memory. After each episode, it reports its progress, outcomes, decisions, and reflections. In the crafting stage, a crafter agent uses these reports to revise the game. It estimates player abilities, predicts performance at different proficiency levels, and compares those predictions with a target learning progression. It diagnoses the game and addresses the gaps by giving players meaningful opportunities to improve through better decisions and execution. We evaluate games in fresh runs with player agents across three intelligence settings, measuring learning gain and learning slope. Compared with the initial games, PlayCraft yields larger learning gains and steeper learning slopes in most games. It also outperforms the baselines on the macro-average of each metric at every intelligence setting.
Updated: 2026-11-19 18:59:34
标题: PlayCraft:基于智能体游玩经验设计引人入胜的游戏
摘要: 近期的人工智能代理能够生成可玩的游戏,但这些游戏未必具有吸引力。精通感是产生吸引力的关键来源之一,然而,为此进行设计需要大量的人类试玩与调试。我们提出了 PlayCraft,一种自动化框架,利用基于视觉的代理游玩游戏,并借助其详尽的游玩经验对游戏进行修改,以促进玩家达成精通。从一个初始游戏开始,PlayCraft 在游玩与创作之间交替进行。在游玩阶段,玩家代理观察游戏画面、使用控制器,并在多轮游戏过程中追求游戏目标,同时保留记忆。每轮游戏结束后,它会报告自己的进展、结果、决策与反思。在创作阶段,创作代理利用这些报告修改游戏。它估计玩家能力,预测不同熟练程度下的表现,并将这些预测与目标学习进程进行比较。随后,它诊断游戏,并通过为玩家提供借助更佳决策与操作来提升自身能力的有意义机会,弥补其中的差距。我们在三种智能水平设置下,使用玩家代理在全新运行中评估游戏,测量学习增益与学习斜率。与初始游戏相比,PlayCraft 在大多数游戏中带来了更大的学习增益和更陡的学习斜率。在每种智能水平设置下,它在各项指标的宏平均值上也都优于基线方法。
更新时间: 2026-11-19 18:59:34
领域: cs.AI,cs.CV
EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL
Reinforcement Learning (RL) has enabled Large Language Models (LLMs) to acquire increasingly complex reasoning and agentic behaviors. In this work, we propose two simple techniques to improve policy gradient algorithms for LLMs. First, we replace the fixed anchor policy during RL with an Exponential Moving Average (EMA), similar to a target network in deep Q-learning. Second, we introduce Top-$k$ KL estimator, which allows for flexible interpolation between exact KL and sampled KL. We derive the stability conditions for using EMA anchor; moreover, we show that our Top-$k$ KL estimator yields both unbiased KL values and unbiased gradients at any $k$, while bringing the benefits of exact KL. When combined with GRPO, the two techniques (EMA-PG) lead to a significant performance boost. On math reasoning, it allows R1-distilled Qwen-1.5B to reach 53.9% on OlympiadBench compared to 50.8% by GRPO. On agentic RL domains, with Qwen-3B base, EMA-PG improves GRPO by an average of 35.6% across 7 datasets of Q&A with search engines, including 29.7% $\rightarrow$ 45.8% on HotpotQA, 27.4% $\rightarrow$ 40.5% on 2WikiMultiHopQA. Overall, we show that EMA-PG is a simple, principled, and powerful approach to scaling RL for LLMs. Code: https://github.com/LunjunZhang/ema-pg
Updated: 2026-11-19 18:58:48
标题: EMA策略梯度:利用EMA锚点与Top-k KL驯服大语言模型强化学习
摘要: 强化学习(RL)使大型语言模型(LLM)能够习得日益复杂的推理能力和智能体行为。在本文中,我们提出了两种简单的技术,用于改进面向大型语言模型的策略梯度算法。首先,我们使用指数移动平均(EMA)策略替代强化学习过程中固定的锚定策略,这类似于深度 Q 学习中的目标网络。其次,我们引入 Top-k KL 估计器,使得在精确 KL 与采样 KL 之间能够灵活插值。我们推导了使用 EMA 锚定策略的稳定性条件;此外,我们证明,Top-k KL 估计器在任意 k 下都能同时得到无偏的 KL 值和无偏的梯度,并兼具精确 KL 的优势。将这两种技术与 GRPO 结合后,所得方法(EMA-PG)带来了显著的性能提升。在数学推理任务中,R1-distilled Qwen-1.5B 在 OlympiadBench 上的得分达到 53.9%,而 GRPO 为 50.8%。在智能体强化学习领域,以 Qwen-3B 为基础模型,EMA-PG 在包含搜索引擎问答的 7 个数据集上平均提升 GRPO 35.6%,其中 HotpotQA 从 29.7% 提升至 45.8%,2WikiMultiHopQA 从 27.4% 提升至 40.5%。总体而言,我们表明,EMA-PG 是一种简单、有理论依据且强大的方法,能够扩展面向大型语言模型的强化学习。代码:https://github.com/LunjunZhang/ema-pg
更新时间: 2026-11-19 18:58:48
领域: cs.LG,cs.AI
TideCache: Efficient Hybrid LLM Serving with Transparent Cache Management and Layer-Wise Streaming
Hybrid architectures have become mainstream among open-weight language models. Their global-attention and bounded-state layers maintain heterogeneous caches whose demands vary with context length and concurrency. We present TideCache, a serving system on CPU--GPU superchips with three components for allocating GPU memory among caches and managing their residency across GPU and host memory. The Transparent Cache Pool redistributes physical pages among cache components behind fixed virtual addresses, preserving cache layouts and backend interfaces. The Cache Streamer uses computation intervals provided by bounded-state layers to prefetch the next global-attention layer's prefix into GPU slots shared across global-attention layers, reducing GPU residency while overlapping layer-wise transfers with computation. Generated KV remains resident. The Request Scheduler selects resident or streamed execution and triggers capacity adjustments according to request size and queue state. Together, they let HBM released by streaming accommodate other cache components and additional requests. Implemented in SGLang and evaluated on GB300 and GH200 across seven model/platform configurations, TideCache completes up to 2.04x as many agent turns, reduces overall P50 per-token latency by 20--59%, and improves agent P50 TTFT by 1.40--3.05x compared with SGLang with HiCache.
Updated: 2026-11-19 18:58:31
标题: TideCache:通过透明缓存管理与逐层流式传输实现高效的混合式大语言模型服务
摘要: 混合架构已成为开放权重语言模型的主流架构。其全局注意力层和有界状态层维护着异构缓存,而这些缓存的需求会随上下文长度和并发量变化。我们提出了 TideCache,这是一种运行在 CPU–GPU 超级芯片上的服务系统,包含三个组件,用于在不同缓存之间分配 GPU 内存,并管理缓存驻留于 GPU 内存和主机内存中的状态。 透明缓存池(Transparent Cache Pool)在固定虚拟地址之后重新分配缓存组件之间的物理页,从而保留缓存布局和后端接口。缓存流处理器(Cache Streamer)利用有界状态层提供的计算间隔,将下一全局注意力层的前缀预取到由各全局注意力层共享的 GPU 槽位中,在降低 GPU 驻留需求的同时,将逐层传输与计算重叠。生成的 KV 始终驻留在 GPU 中。请求调度器(Request Scheduler)根据请求大小和队列状态,在驻留执行与流式执行之间进行选择,并触发容量调整。 这些机制共同使流式传输所释放的高带宽内存(HBM)能够容纳其他缓存组件和更多请求。我们在 SGLang 中实现了 TideCache,并在 GB300 和 GH200 上针对七种模型与平台配置进行了评估。与采用 HiCache 的 SGLang 相比,TideCache 最多可完成 2.04 倍数量的智能体轮次,将整体每 token P50 延迟降低 20%–59%,并将智能体 P50 首 token 生成时间(TTFT)提升 1.40–3.05 倍。
更新时间: 2026-11-19 18:58:31
领域: cs.DC,cs.LG
One Prior, Two Dynamics: Repurposing Video Diffusion Transformers for Self-Supervised Latent Action Learning
Videos reveal how the world changes, but rarely the actions that cause those changes. Latent action learning recovers such supervision from visual transitions, yet often learns the underlying dynamics largely from scratch. We ask whether a pretrained video generator can instead provide the prior for both inverse and forward dynamics. We introduce O$^{2}$LaF, built on a simple principle: one prior, two dynamics. We initialize both models from the same pretrained video DiT and adapt them to their distinct roles: a feed-forward transition encoder with learnable action queries for inverse dynamics, and a causal, action-conditioned video generator for forward dynamics. By controlling information access and optimizing both dynamics end-to-end through a compact bottleneck, O$^{2}$LaF learns transferable actions from unlabeled videos. Across navigation and robotic manipulation, O$^{2}$LaF sets a new state of the art in few-shot action probing and enables stronger zero-shot action transfer across visual contexts and embodiments. Beyond generative video priors, we further extend our framework to predictive representation priors such as V-JEPA2, achieving competitive performance. Our findings suggest a broader paradigm for latent-action learning: repurposing pretrained video models to discover transferable actions and predict their consequences.
Updated: 2026-11-19 18:58:14
标题: 一个先验,两种动力学:重新利用视频扩散变换器进行自监督潜在动作学习
摘要: 视频揭示了世界如何变化,却很少展现导致这些变化的动作。潜在动作学习从视觉状态转变中恢复这类监督信号,但通常需要从头开始大量学习底层动力学。我们探讨,预训练视频生成器能否同时为逆动力学和正向动力学提供先验。为此,我们提出 O$^{2}$LaF,其核心原则十分简单:一个先验,两种动力学。我们使用同一个预训练视频 DiT 初始化两个模型,并针对各自的角色进行适配:用于逆动力学的前馈式状态转变编码器配备可学习的动作查询;用于正向动力学的模型则是一个因果的、以动作为条件的视频生成器。通过控制信息获取范围,并利用一个紧凑的瓶颈对两种动力学进行端到端优化,O$^{2}$LaF 能够从无标注视频中学习具有迁移能力的动作。在导航和机器人操作任务中,O$^{2}$LaF 在少样本动作探测方面取得了新的最优性能,并在不同视觉环境和具身形态之间实现了更强的零样本动作迁移。除生成式视频先验之外,我们还将该框架扩展到 V-JEPA2 等预测表征先验,并取得了具有竞争力的性能。我们的研究结果表明,潜在动作学习可以采用一种更广泛的范式:重新利用预训练视频模型,发现具有迁移能力的动作并预测其后果。
更新时间: 2026-11-19 18:58:14
领域: cs.CV,cs.AI,cs.LG,cs.RO
Designing Algorithmic Recommendations to Achieve Human-AI Complementarity
Algorithms frequently assist, rather than replace, human decision-makers. However, the design and analysis of algorithms often focus on predicting outcomes and do not explicitly model their effect on human decisions. This discrepancy between the design and role of algorithmic assistants becomes particularly concerning in light of empirical evidence that suggests that algorithmic assistants again and again fail to improve human decisions. In this article, we formalize the design of recommendation algorithms that assist human decision-makers without making restrictive ex-ante assumptions about how recommendations affect decisions. We formulate an algorithmic-design problem that leverages the potential-outcomes framework from causal inference to model the effect of recommendations on a human decision-maker's binary treatment choice. Within this model, we make a connection between algorithmic recommendations and instrumental variables. Leveraging this connection, we introduce a monotonicity assumption that leads to an intuitive classification of human responses to the algorithm. Under this assumption, we can express the human's response to algorithmic recommendations in terms of their compliance with the algorithm and the active decision they would take if the algorithm sends no recommendation. We showcase the utility of our framework using an online experiment that simulates a hiring task. We argue that our approach can make sense of the relative performance of different recommendation algorithms in the experiment and can help design solutions that realize human-AI complementarity. Finally, we leverage our approach to derive maximin-optimal recommendation algorithms that can be implemented with machine learning using limited training data.
Updated: 2026-11-19 18:57:23
标题: 设计实现人机互补的算法推荐系统
摘要: 算法往往是协助而非取代人类决策者。然而,算法的设计与分析通常侧重于预测结果,而没有明确建模算法对人类决策的影响。鉴于经验证据表明,算法助手一再未能改善人类决策,这种算法助手的设计与其实际作用之间的不一致尤其令人担忧。本文形式化研究了推荐算法的设计问题:在不对推荐如何影响决策作出严格先验假设的情况下,协助人类决策者进行决策。我们借鉴因果推断中的潜在结果框架,提出一个算法设计问题,用于建模推荐对人类决策者二元处理选择的影响。在这一模型中,我们建立了算法推荐与工具变量之间的联系。基于这一联系,我们引入单调性假设,从而对人类对算法的反应进行直观分类。在该假设下,我们可以根据人类对算法的遵从程度,以及在算法不发送任何推荐时他们会采取的主动决策,来表达人类对算法推荐的反应。我们通过一项模拟招聘任务的在线实验展示了该框架的实用性。我们认为,这一方法能够解释实验中不同推荐算法的相对表现,并有助于设计实现人机互补的解决方案。最后,我们利用该方法推导出极小极大最优的推荐算法,这些算法可以借助机器学习并使用有限的训练数据加以实现。
更新时间: 2026-11-19 18:57:23
领域: cs.HC,cs.LG,econ.EM,stat.ML
Implicit Neural Representations of Individual Behavior
We study policy representation learning from unlabeled multi-policy behavioral data. Each episode is generated by a fixed policy, but policy labels are unavailable. This setting appears in robotics play, demonstrations, games, racing, and other datasets where heterogeneous behaviors are mixed without annotations. We introduce Behavioral INR, a self-supervised generative model that adapts implicit neural representations (INRs) from vision to behavior. Instead of mapping coordinates to RGB values, Behavioral INR represents a policy as a state-action function mapping states to subsequent actions. An episode-level latent modulates this function through FiLM layers, yielding a generative prior over policies and allowing policy identity to be inferred without supervision. Because INRs treat each datapoint as samples from an underlying function, the same model naturally accommodates variable episode lengths and different sampling granularities, as in vision INRs with different image resolutions. We also define policy-level out-of-distribution (OOD) shifts along state-distribution and action-distribution axes, which arise when policies overlap in states or actions but are not captured by standard behavioral OOD settings based only on new agents or environments. We evaluate on synthetic Gaussian random field data, MuJoCo demonstrations with controlled OOD splits, and real-world chess, Formula 1 racing, robotics, and Seek-Avoid datasets. Behavioral INR most consistently improves policy identifiability in the hardest continuous state-action settings, especially when longer episodes, more policies, and OOD splits reduce the usefulness of marginal shortcuts; amortized history encoders remain competitive when policy identity can be recovered from symbolic repetition or low-dimensional action statistics.
Updated: 2026-11-19 18:56:35
标题: 个体行为的隐式神经表示
摘要: 我们研究从无标签的多策略行为数据中学习策略表示。每个回合均由一个固定策略生成,但策略标签不可用。这种情形出现在机器人探索、演示数据、游戏、赛车以及其他将异质行为混合且未加注释的数据集中。我们提出 Behavioral INR,这是一种自监督生成模型,将隐式神经表示(INR)从视觉领域适配到行为建模中。Behavioral INR 不再将坐标映射为 RGB 值,而是将策略表示为一个状态—动作函数,把状态映射为后续动作。回合级潜变量通过 FiLM 层调制该函数,从而构建策略的生成先验,并使模型能够在无监督的情况下推断策略身份。由于 INR 将每个数据点视为底层函数的样本,同一模型可以自然地适应不同的回合长度和采样粒度,这类似于视觉 INR 对不同图像分辨率的适应能力。 我们还沿状态分布和动作分布两个维度定义策略级分布外(OOD)偏移。当不同策略在状态或动作上存在重叠时,这类偏移便会出现;而仅基于新智能体或新环境的标准行为 OOD 设置无法捕捉这种情况。我们在合成高斯随机场数据、具有受控 OOD 划分的 MuJoCo 演示数据,以及真实世界的国际象棋、一级方程式赛车、机器人和 Seek-Avoid 数据集上进行了评估。Behavioral INR 在最具挑战性的连续状态—动作设置中最稳定地提升了策略可辨识性,尤其是在更长的回合、更多策略以及 OOD 划分削弱边际捷径的有效性时;而当策略身份可以通过符号重复或低维动作统计量恢复时,摊销式历史编码器仍具有竞争力。
更新时间: 2026-11-19 18:56:35
领域: cs.LG,cs.AI
Bio-PM-Guided Synthetic IMU Generation
Collecting and labeling inertial measurement unit (IMU) data for human activity recognition (HAR) is expensive, and models trained on one group of subjects often fail to generalize to unseen individuals. Even with balanced data, classifiers struggle to distinguish dynamically similar activity classes and benefit from targeted augmentation. We explore whether synthetic IMU data generated in the representation space of a pretrained biosignal encoder, Bio-PM \cite{b1}, can serve as a practical augmentation source. Rather than synthesizing raw signals, we leverage Bio-PM's frozen encoder to convert 10-second IMU windows into token embedding sequences and train class-conditional decoders in this space: (1) an autoregressive transformer decoder that predicts tokens sequentially, and (2) a diffusion decoder that learns the token distribution through a denoising objective. We analyze generation realism through distributional metrics and embedding-space visualizations, evaluate downstream utility through leave-one-subject-out HAR classification, and present a PatchDecoder for approximate raw waveform reconstruction. Our diffusion decoder achieves a Train-on-Synthetic-Test-on-Real (TSTR) macro-F1 of 0.68, demonstrating that generated tokens are realistic enough to train a classifier that transfers to real data. Combining synthetic-token augmentation with a 320-dimensional gravity-aware feature representation raises LOSO macro-F1 from 0.729 to 0.809 over a real-only baseline across 51 subjects on the WISDM benchmark, with statistically significant gains concentrated in the most challenging activity classes. These results demonstrate that high-fidelity generation in a pretrained encoder's representation space is achievable and practically useful for cross-subject HAR augmentation.
Updated: 2026-11-19 18:56:25
标题: 生物物理模型引导的合成惯性测量单元生成
摘要: 收集并标注用于人体活动识别(HAR)的惯性测量单元(IMU)数据成本高昂,而且在一组受试者上训练的模型往往无法泛化到未见过的个体。即使数据保持均衡,分类器仍难以区分动态特征相似的活动类别,因此需要有针对性的数据增强。我们探讨了在预训练生物信号编码器 Bio-PM \cite{b1} 的表征空间中生成合成 IMU 数据,能否作为一种实用的数据增强来源。我们不直接合成原始信号,而是利用 Bio-PM 的冻结编码器将 10 秒的 IMU 窗口转换为词元嵌入序列,并在该空间中训练类别条件解码器:(1)按序预测词元的自回归 Transformer 解码器;(2)通过去噪目标学习词元分布的扩散解码器。我们通过分布度量和嵌入空间可视化分析生成数据的真实性,通过留一受试者交叉验证的人体活动识别分类评估其下游效用,并提出一种 PatchDecoder,用于近似重建原始波形。我们的扩散解码器在“合成数据训练、真实数据测试”(TSTR)设置下取得了 0.68 的宏平均 F1,表明生成的词元具有足够的真实性,能够训练出可迁移到真实数据的分类器。在 WISDM 基准数据集的 51 名受试者上,将合成词元增强与 320 维、考虑重力因素的特征表示相结合,使留一受试者交叉验证的宏平均 F1 从仅使用真实数据的基线 0.729 提升至 0.809,且具有统计显著性的增益主要集中在最具挑战性的活动类别中。这些结果表明,在预训练编码器的表征空间中实现高保真数据生成是可行的,并且对于跨受试者人体活动识别增强具有实际价值。
更新时间: 2026-11-19 18:56:25
领域: cs.LG
Depth Pro 2: Sharp and Temporally Consistent Metric Monocular Depth
We present Depth Pro 2, an approach to estimating dense metric depth for images and video at full resolution. By analyzing prior methods for monocular depth estimation, we find that they commonly trade off temporal consistency and boundary sharpness: multi-frame methods favor consistency, single-frame methods favor sharpness. To overcome this trade-off, we train a single, scalable network that processes both images and video and predicts depth maps at native resolution. Depth Pro 2 produces depth maps that are metrically accurate, sharp, and temporally consistent all at once, outperforming prior work in all of these dimensions. We release a family of models that define a new Pareto frontier in terms of metric accuracy, sharpness, temporal consistency, and runtime. We release code and weights at https://apple-aiml-research.github.io/ml-depth-pro-2/
Updated: 2026-11-19 18:55:41
标题: Depth Pro 2:清晰且时间一致的度量单目深度估计
摘要: 我们提出 Depth Pro 2,一种以全分辨率估计图像和视频稠密度量深度的方法。通过分析以往的单目深度估计方法,我们发现它们通常需要在时间一致性和边界清晰度之间进行权衡:多帧方法更注重一致性,单帧方法更注重清晰度。为克服这一权衡,我们训练了一个可扩展的单一网络,同时处理图像和视频,并以原生分辨率预测深度图。Depth Pro 2 能够同时生成具有度量准确性、清晰边界和时间一致性的深度图,在所有这些方面均优于以往方法。我们发布了一系列模型,在度量准确性、清晰度、时间一致性和运行时间方面确立了新的帕累托前沿。代码和模型权重已发布于 https://apple-aiml-research.github.io/ml-depth-pro-2/
更新时间: 2026-11-19 18:55:41
领域: cs.CV,cs.LG
SoK: Assessing the Evolution of LLM Capability in Software Vulnerability Research
LLM-based agents are becoming increasingly capable at discovering, validating and patching vulnerabilities in real software, and vendors and researchers report that this is already changing how vulnerabilities are found and fixed. These claims, however, are scattered across papers, vendor reports and disclosures and are rarely comparable. We introduce a framework that rates these capabilities on an autonomy scale modeled on the levels of driving automation, and qualifies each claim by its correctness, its availability and the strength of its evidence. We use this framework to systematize the published evidence on LLM capability in vulnerability research. We find that agents discovered, validated, and patched vulnerabilities in real-world software without human intervention before the restricted frontier models of 2026, and that open-weight models subsequently attained comparable autonomy for discovery and validation. We then measure the consequences of evolving LLM security capabilities in a decade of public vulnerability records, advisories and exploitation data. In 2026 the number of disclosed vulnerabilities more than doubled, with an increasing share rated critical or high, and severe bugs that had survived a decade or more in widely used code were reported several times more often than before. Yet the time between the stages of a vulnerability's life, from report to fix and from disclosure to attack, has not shifted noticeably so far. We grade the mitigations proposed in the literature with an explicit rubric and draw guidance for each group of stakeholders from the best-supported ones.
Updated: 2026-11-19 18:54:19
标题: 知识综述:评估大语言模型在软件漏洞研究中的能力演进
摘要: 基于大语言模型的智能体在真实软件中发现、验证和修补漏洞方面的能力日益增强,供应商和研究人员报告称,这已经在改变漏洞的发现与修复方式。然而,这些说法散见于论文、供应商报告和披露材料中,且很少具有可比性。我们提出了一个评估框架,参照驾驶自动化等级建立自主性量表,并根据每项能力声明的正确性、可获得性和证据强度对其进行限定。我们利用该框架,系统梳理了有关大语言模型漏洞研究能力的已发表证据。我们发现,在2026年的受限前沿模型出现之前,智能体已经能够在无人干预的情况下,在真实世界软件中发现、验证并修补漏洞;此后,开放权重模型在漏洞发现和验证方面也达到了相当的自主水平。随后,我们利用十年来的公开漏洞记录、安全公告和漏洞利用数据,衡量大语言模型安全能力不断演进所带来的影响。2026年,披露的漏洞数量增加了一倍以上,其中被评为严重或高危的漏洞占比不断上升;而那些潜伏在广泛使用的软件代码中长达十年甚至更久的严重漏洞,其报告频率也比以往高出数倍。然而,到目前为止,漏洞生命周期各阶段之间的时间间隔——从报告到修复,以及从披露到遭受攻击——尚未出现明显变化。我们采用明确的评价标准,对文献中提出的缓解措施进行评级,并根据证据最充分的措施,为各类利益相关者提出指导建议。
更新时间: 2026-11-19 18:54:19
领域: cs.CR,cs.AI,cs.SE
Active Feature Acquisition by Distilling an Oracle Teacher
Acquiring every feature of an instance is often costly: a measurement can carry a monetary price, a time delay, or a privacy cost. Active Feature Acquisition (AFA) addresses this by learning a policy that decides, per instance, which features to acquire under a budget. Existing AFA methods train this policy by optimizing a self-constructed utility target rather than distilling an explicit teacher. We construct this teacher explicitly. At training time the label and the unobserved feature values are available, and together they determine the teacher in closed form: an oracle that ranks every candidate by its effect on the downstream predictor's error. OracleImitator distills this ranking into a deployable policy by soft-target imitation. Across multimodal medical diagnosis and the AFABench benchmark, OracleImitator matches or outperforms existing AFA methods across the budget range, recovering 90% of the attainable accuracy gain at under a quarter of the acquisition cost. Because the teacher is an explicit algorithmic object rather than an implicit optimization target, we can also measure directly how much of its ranking is recoverable by a policy restricted to what is visible at deployment.
Updated: 2026-11-19 18:52:57
标题: 通过蒸馏预言机教师进行主动特征获取
摘要: 获取实例的全部特征通常成本高昂:一次测量可能带来金钱成本、时间延迟或隐私成本。主动特征获取(Active Feature Acquisition,AFA)通过学习一种策略来应对这一问题,该策略针对每个实例,在预算约束下决定获取哪些特征。现有的 AFA 方法通过优化自行构造的效用目标来训练策略,而不是从明确的教师模型中进行蒸馏。我们显式地构造了这一教师模型。在训练阶段,标签和未观测到的特征值均可用,二者共同以闭式形式确定教师模型:一个根据每个候选特征对下游预测器误差的影响对其进行排序的预言机。OracleImitator 通过软目标模仿,将这一排序蒸馏为可部署的策略。在多模态医疗诊断任务和 AFABench 基准测试中,OracleImitator 在各个预算范围内均达到或超过现有 AFA 方法的表现,以不足四分之一的获取成本恢复了可达到准确率增益的 90%。由于该教师模型是一个明确的算法对象,而非隐式的优化目标,我们还可以直接测量:受限于部署阶段可见信息的策略,能够恢复其排序信息的多少。
更新时间: 2026-11-19 18:52:57
领域: cs.LG,cs.AI
Capturing In-Context Learning Dynamics with Task Operators
In-context learning (ICL) enables language models to perform new tasks from demonstrations without weight updates. However, every ICL inference requires processing the full set of examples, resulting in inefficient deployments, and how ICL works mechanistically is not fully understood. Prior work compresses ICL into fixed activation vectors extracted from specific layers or positions, but these input-independent interventions fail on complex tasks where the output depends on fine-grained interactions with the input. By analyzing the ICL forward pass, we show that each attention head's output is an affine transformation of its context-masked counterpart, and that the parameters of this transformation are empirically stable across samples for a given task. Building on this, we introduce Task Operator (TO), which replays this transformation as an analytically derived update to the attention output projection. Across lexical, algorithmic, and reasoning tasks, TO achieves the best overall performance among prior methods and substantially narrows the gap between zero-shot inference and ICL. We further show that the extracted knowledge concentrates in a task-specific sparse circuit across layers and positions, and that averaging operators from disjoint demonstration batches enables effective many-shot scaling without expanding the context window. Our code is available at https://github.com/gzxiong/task_operator.
Updated: 2026-11-19 18:52:44
标题: 利用任务算子捕捉上下文学习动态
摘要: 上下文学习(ICL)使语言模型无需更新权重,仅通过示例即可执行新任务。然而,每次进行 ICL 推理都需要处理完整的示例集合,导致部署效率低下;与此同时,ICL 的机制原理也尚未得到充分理解。以往研究将 ICL 压缩为从特定层或位置提取的固定激活向量,但这类与输入无关的干预在复杂任务上表现不佳,因为此类任务的输出取决于输入之间的细粒度交互。通过分析 ICL 的前向传播过程,我们发现,每个注意力头的输出都是其上下文屏蔽对应输出的仿射变换,并且对于给定任务而言,该变换的参数在不同样本之间具有经验上的稳定性。在此基础上,我们提出任务算子(Task Operator,TO),将这一变换作为对注意力输出投影的解析推导更新进行重放。在词汇、算法和推理任务上,TO 的总体性能优于以往方法,并显著缩小了零样本推理与 ICL 之间的差距。我们进一步表明,提取出的知识集中在跨层和跨位置的任务特定稀疏回路中;此外,对来自互不相交的示例批次的算子进行平均,可以在不扩大上下文窗口的情况下实现有效的多样本扩展。我们的代码发布于:https://github.com/gzxiong/task_operator。
更新时间: 2026-11-19 18:52:44
领域: cs.CL,cs.AI,cs.LG
PGX: Physically Grounded Execution for Long-Horizon Humanoid Loco-Manipulation
Robotic vision-language-action (VLA) models can execute diverse individual manipulation skills, yet they still struggle with long-horizon loco-manipulation tasks, where temporal structure, skills, and precision are tightly coupled within a monolithic model. We propose Physically Grounded Execution (PGX), a framework that offloads temporal and precision control to two classical training-free components, allowing the VLA to focus on stage-specific skill dynamics. PGX decomposes long-horizon loco-manipulation into three layers: (i) a predicate-based state machine governs task progression, using physical predicates to gate phase transitions, trigger recovery, and coordinate navigation and waiting. Shared predicate semantics connect offline demonstration segmentation, online execution, and stage-wise evaluation; (ii) VLA skills operate within active manipulation phases, with flat or stage-trained models concentrating on task-relevant actions; and (iii) world-coordinate locking (WCL) maintains spatial consistency through base station keeping, object-relative positioning, and world-anchored contact targets. We demonstrate the effectiveness of PGX with extensive experiments conducted on three simulated tasks and one real-world task using a Unitree G1 humanoid robot for long-horizon loco-manipulation, showing improvements in stage progression and task success rates. Project page is available at: https://kl-research.github.io/pgx
Updated: 2026-11-19 18:52:18
标题: PGX:面向长时域人形机器人移动操作的物理基础执行
摘要: 机器人视觉-语言-动作(VLA)模型能够执行多种单独的操作技能,但在长时程移动操作任务中仍面临困难,因为在单一模型中,时间结构、技能与精确性彼此紧密耦合。我们提出了物理接地执行(Physically Grounded Execution,PGX)框架,将时间控制和精度控制交由两个无需训练的经典组件负责,使 VLA 能够专注于特定阶段的技能动态。PGX 将长时程移动操作分解为三个层次:(i)基于谓词的状态机负责控制任务进程,利用物理谓词来约束阶段转换、触发恢复机制,并协调导航与等待;共享的谓词语义将离线演示分段、在线执行和分阶段评估连接起来;(ii)VLA 技能在活跃的操作阶段内运行,使扁平模型或分阶段训练的模型专注于与任务相关的动作;(iii)世界坐标锁定(world-coordinate locking,WCL)通过基座定点保持、相对于物体的定位以及以世界坐标为锚定的接触目标来维持空间一致性。我们在三个仿真任务和一个真实世界任务上进行了大量实验,使用 Unitree G1 人形机器人执行长时程移动操作,结果表明,PGX 在阶段推进和任务成功率方面均有所提升。项目页面:https://kl-research.github.io/pgx
更新时间: 2026-11-19 18:52:18
领域: cs.RO,cs.AI
Realized versus Population Reliability: Anytime-Valid Self-Consistency Certification under Correlated Reasoning
Self-consistency certification treats repeated sampling from a language model as sequential evidence accumulation and stops when an anytime-valid e-process crosses a threshold, guaranteeing finite-sample Type I error control by Ville's inequality. Prior constructions assume sampled rollouts are conditionally independent. We show this assumption fails in practice: reasoning streams are positively correlated through shared reasoning prefixes or across-prompt heterogeneity, changing not merely certificate efficiency but the hypothesis certified. Modeling dependence via a per-unit latent state (the random-effects / intraclass-correlation structure) induces exchangeable, equi-correlated increments with correlation $ρ$. Correlation splits the single null into a realized null about the drawn belief and a population null about average model behavior, which coincide only when $ρ=0$. We show: (i) the standard betting e-process remains anytime-valid for the realized null, not the population null; (ii) read as a population-null test, a suitable mixture has asymptotic crossing probability at least $π=P(μ(Z)>0)$, potentially exceeding nominal $ε$; (iii) the within-unit mean's effective sample size saturates at $1/ρ$, so extra within-unit rollouts cannot restore population validity; and (iv) a prompt-level e-process restores population validity, with optimal allocation at one rollout per prompt under a pure rollout budget. Simulations and Claude Haiku 4.5 rollouts confirm this regime dependence: on GSM8K ($\hatρ=0.435$, $\hatθ=+0.96$) the gap is dormant, whereas on AIME ($\hatρ=0.480$, $\hatθ=-0.15$) the single-unit rule crosses on 24% of prompts at nominal $ε=0.05$, while the prompt-level procedure declines (0.00). This correctness result identifies which reliability claim an anytime-valid certificate actually supports under dependence.
Updated: 2026-11-19 18:47:51
标题: 实现的可靠性与总体可靠性:相关推理下随时有效的自洽性认证
摘要: 自洽性认证将从语言模型中进行重复采样视为序贯证据累积过程,并在任意时刻有效的 e-过程越过阈值时停止;依据 Ville 不等式,该方法能够保证有限样本下的第一类错误控制。以往的构造假设采样得到的推理轨迹在条件上相互独立。我们表明,这一假设在实践中并不成立:推理流会因共享的推理前缀或跨提示异质性而呈正相关,从而改变的不仅是认证效率,也包括所认证的假设。通过单位层面的潜在状态(即随机效应/组内相关结构)对依赖性进行建模,会得到相关系数为 ρ 的可交换、等相关增量。相关性将单一的零假设拆分为关于所抽取信念的实现零假设,以及关于模型平均行为的总体零假设;只有在 ρ=0 时,二者才一致。我们证明:(i)标准投注 e-过程对于实现零假设仍然具有任意时刻有效性,但对总体零假设则不然;(ii)若将其解读为总体零假设检验,适当的混合方法具有至少为 π=P(μ(Z)>0) 的渐近越界概率,该概率可能超过名义水平 ε;(iii)单位内均值的有效样本量会饱和于 1/ρ,因此增加单位内的推理轨迹数量无法恢复总体有效性;(iv)提示级 e-过程能够恢复总体有效性,而在纯推理轨迹预算下,最优分配是每个提示仅进行一次采样。模拟实验以及 Claude Haiku 4.5 的推理轨迹验证了这种情形依赖性:在 GSM8K 上(\hatρ=0.435,\hatθ=+0.96),这一差距尚未显现;而在 AIME 上(\hatρ=0.480,\hatθ=-0.15),在名义 ε=0.05 下,单单位规则会在 24% 的提示上越界,而提示级方法则不会越界(0.00)。这一正确性结果明确了在存在依赖性的情况下,任意时刻有效的认证实际上支持哪一种可靠性声明。
更新时间: 2026-11-19 18:47:51
领域: stat.ME,cs.AI,cs.LG
Rethinking Visual Attribution for Chest X-ray Reasoning in Large Vision Language Models
Large Vision Language Models (LVLMs) show promise in medical applications, but their inability to faithfully ground responses in visual evidence raises serious concerns about clinical trustworthiness. While visual attribution methods are widely used to explain LVLM predictions, whether these explanations actually reflect the visual evidence underlying the model's decision is largely unverified, since ground-truth annotations for internal model reasoning are typically unavailable. We address this question for chest X-ray (CXR) reasoning by developing a causal evaluation framework that retains only CXR-VQA samples for which the expert-annotated region is verified, via counterfactual editing, to be causally responsible for the model's prediction. Using this framework across 11 attribution methods, six open-source LVLMs, and two output modes (direct answer and step-by-step reasoning), we find that existing attribution methods often fail to identify the evidence used by LVLMs. To address this failure, we propose MedFocus, a concept-based attribution method that localizes clinically meaningful anatomical regions via unbalanced optimal transport and measures their causal effect on model outputs through targeted interventions. MedFocus produces spatial, concept-level, and token-level attributions and substantially outperforms prior methods, taking a step toward more trustworthy attribution for medical LVLMs. Our data and code are available at https://github.com/gzxiong/medfocus/.
Updated: 2026-11-19 18:47:04
标题: 重新思考大型视觉语言模型胸部X光推理的视觉归因
摘要: 大型视觉语言模型(LVLMs)在医疗应用中展现出良好前景,但其无法忠实地将回答建立在视觉证据之上的问题,引发了人们对其临床可信度的严重担忧。尽管视觉归因方法被广泛用于解释 LVLM 的预测,但这些解释是否确实反映了支撑模型决策的视觉证据,仍基本未经验证,因为通常无法获得关于模型内部推理过程的真实标注。针对胸部 X 光片(CXR)推理问题,我们构建了一个因果评估框架:通过反事实编辑,验证专家标注区域是否对模型预测具有因果作用,并仅保留经过验证的 CXR-VQA 样本。利用该框架,我们评估了 11 种归因方法、6 个开源 LVLM,以及两种输出模式(直接回答和分步推理),发现现有归因方法往往无法识别 LVLM 实际使用的证据。为解决这一问题,我们提出了 MedFocus,一种基于概念的归因方法,通过非平衡最优传输定位具有临床意义的解剖区域,并通过针对性干预衡量这些区域对模型输出的因果影响。MedFocus 可生成空间级、概念级和词元级归因,其性能显著优于以往方法,为实现更可信的医疗 LVLM 归因迈出了重要一步。我们的数据和代码已发布于:https://github.com/gzxiong/medfocus/。
更新时间: 2026-11-19 18:47:04
领域: cs.CV,cs.AI,cs.CL
Probing the "Conscious" Mind: Selective Access and Global Workspace in Vision-Language Models
Vision-language models (VLMs) integrate visual and textual information, but their outputs do not reveal internal concept representations. Global workspace theory (GWT) proposes that information is selected from parallel brain processes, integrated in a shared workspace, and made available to specialised processes. We introduce the Multimodal Concept Lens (MC-Lens), a multimodal Jacobian lens, to study these functions in VLM concept processing. Its vision encoder and language decoder lenses map intermediate states to a shared semantic space defined by the decoder's output vocabulary to compare concept accessibility across modalities. MC-Lens supports internal concept interventions to examine the role of accessed concepts in downstream computation. (i) Accessibility and selective access. Multimodal concept information is readable in intermediate states and selectively accessible as tasks require. We extend "readout carriers" from one name token to a token set to better capture and express concept information and support counterfactual experiments. (ii) Concepts in downstream computation. Counterfactual experiments show that accessed concept information participates in downstream computation and reasoning. (iii) Development of cross-modal alignment and selective access. We develop two J-space metrics tracking the development of cross-modal concept alignment more clearly than hidden state cosine in controlled VLM training. The experiment also shows that reliable selective access develops later than concept accessibility. (iv) Shared functions across models. Across VLM families and sizes, we find shared patterns of concept accessibility, query-dependent selectivity and cross-task intervention effects despite differences in internal organisation. These findings offer an experimental basis to study GWT in multimodal artificial systems and how it can guide cross-modal alignment improvements.
Updated: 2026-11-19 18:46:50
标题: 探究“意识”思维:视觉语言模型中的选择性访问与全局工作空间
摘要: 视觉—语言模型(VLM)整合视觉与文本信息,但其输出无法揭示内部概念表征。全局工作空间理论(GWT)提出,信息从并行的大脑过程中被选取,整合到一个共享工作空间中,并提供给专门化过程。我们提出多模态概念透镜(MC-Lens),一种多模态雅可比透镜,用于研究VLM概念处理中的这些功能。其视觉编码器透镜和语言解码器透镜将中间状态映射到由解码器输出词汇表定义的共享语义空间,从而比较不同模态之间的概念可及性。MC-Lens支持对内部概念进行干预,以考察被访问概念在下游计算中的作用。 (i)可及性与选择性访问。多模态概念信息可从中间状态中读取,并会根据任务需求被选择性地访问。我们将“读出载体”从单个名称词元扩展为词元集合,以更好地捕捉和表达概念信息,并支持反事实实验。 (ii)下游计算中的概念。反事实实验表明,被访问的概念信息参与了下游计算与推理。 (iii)跨模态对齐与选择性访问的发展。我们提出了两种J空间指标,用于追踪跨模态概念对齐的发展;在受控的VLM训练中,这些指标比隐藏状态余弦相似度能够更清晰地反映相关变化。实验还表明,可靠的选择性访问是在概念可及性之后才发展起来的。 (iv)不同模型之间的共享功能。在不同VLM系列和规模的模型中,尽管其内部组织存在差异,我们仍发现了概念可及性、依赖查询的选择性以及跨任务干预效应方面的共同模式。这些发现为在多模态人工系统中研究GWT提供了实验基础,也说明了GWT如何指导跨模态对齐的改进。
更新时间: 2026-11-19 18:46:50
领域: cs.AI,cs.CV,cs.LG
Verify the Verifier: Specification-Grounded LLM Cross-Checking for Bugs That Escape UVM Scoreboards
A passing UVM regression shows the design agrees with the reference model on what the scoreboard checks, not that it meets the specification. Bugs that pass every test yet violate the specification, termed scoreboard escapes, survive mature testbenches. We present Verify the Verifier, to our knowledge the first framework whose LLM-based Anomaly Cross-Checker examines a passing regression's traces against the specification. Of 564 bugs inserted into four OpenTitan IPs, 68 are candidate scoreboard escapes: non-equivalent, exercised by the tests, yet passing. The framework confirmed 41 as scoreboard escapes with assertions failing on the buggy design and proven on the original.
Updated: 2026-11-19 18:45:54
标题: 验证验证器:基于规范的 LLM 交叉检查,检测逃逸 UVM 记分板的错误
摘要: 一次通过的 UVM 回归测试表明,设计在记分板检查的内容上与参考模型一致,但并不意味着其满足规范。那些通过所有测试却违反规范的缺陷被称为记分板逃逸(scoreboard escapes),即使是成熟的测试平台也可能无法发现它们。我们提出了 Verify the Verifier,据我们所知,这是首个由基于大语言模型的异常交叉检查器构成的框架,用于根据规范检查一次通过的回归测试轨迹。在四个 OpenTitan IP 中植入的 564 个缺陷中,有 68 个属于候选记分板逃逸:它们与原设计不等价、被测试激活,却仍能通过测试。该框架最终确认其中 41 个为记分板逃逸:这些缺陷设计上的断言失败,而原始设计上的相应断言均得到证明。
更新时间: 2026-11-19 18:45:54
领域: cs.SE,cs.AI,cs.AR
ProtoDiffusion: Token-per-Layer Generative Modeling of Multi-Layer Images
Graphic designs are ordered compositions of RGBA layers whose separation enables selection, movement, and reuse. Existing layered models represent each layer with a full-canvas or region-sized spatial latent grid, so representation size grows with the cumulative spatial extent of the layers. We present ProtoDiffusion, a latent-diffusion framework built on ProtoVAE, a multi-layer variational autoencoder that encodes a design into one shared spatial prototype and one candidate vector per layer. Each candidate conditions a shared decoder to reconstruct its corresponding RGBA layer. For $N$ layers, the representation contains $HW+N$ tokens before backbone-specific packing, compared with $NHW$ for full-grid-per-layer representations. ProtoDiffusion jointly denoises the prototype and a fixed set of candidate slots, conditioned on an image or text, with bounding boxes as optional layout guidance. The model leaves unneeded slots empty and determines the number of layers and, in absence of boxes, their layout, requiring neither as input. The same architecture supports both image-to-design and text-to-design. ProtoVAE achieves high-fidelity reconstruction from its compact shared latent representation, reaching 40.43 dB PSNR on layer crops. On the LayerD evaluation split, image-to-design achieves RGB L1 scores of 0.040 with bounding boxes and 0.057 without, with box-guided alpha soft IoU (0.850) comparable to the strongest fine-tuned baseline (0.871). On merged images, text-to-design reaches 66.41 FID versus 86.84 for FLUX.2 [klein], achieves a 0.860 text-accuracy score, and runs $19.1\times$ faster than the same-backbone generation-then-decomposition cascade.
Updated: 2026-11-19 18:45:31
标题: ProtoDiffusion:多层图像的逐层令牌生成建模
摘要: 图形设计是由多个有序排列的 RGBA 图层组成的,这些图层彼此分离,从而支持选择、移动和复用。现有的分层模型使用覆盖完整画布或与区域大小相匹配的空间潜变量网格来表示每个图层,因此表示规模会随着各图层空间范围的累积而增长。我们提出 ProtoDiffusion,这是一种基于 ProtoVAE 的潜空间扩散框架。ProtoVAE 是一种多图层变分自编码器,可将设计编码为一个共享空间原型和每个图层对应的一个候选向量。每个候选向量通过调节共享解码器,重建其对应的 RGBA 图层。对于包含 N 个图层的设计,在针对具体骨干网络进行打包之前,该表示包含 HW+N 个令牌;相比之下,每图层一个完整网格的表示包含 NHW 个令牌。 ProtoDiffusion 在图像或文本条件下,对空间原型和固定数量的候选槽位进行联合去噪,并可选地使用边界框提供布局引导。模型会将不需要的槽位留空,并自动确定图层数量;在未提供边界框时,还会自动确定图层布局,无需将这两者作为输入。同一架构同时支持图像到设计和文本到设计。ProtoVAE 通过紧凑的共享潜在表示实现高保真重建,在图层裁剪区域上达到 40.43 dB 的 PSNR。在 LayerD 评测集上,图像到设计任务在提供边界框时的 RGB L1 误差为 0.040,不提供边界框时为 0.057;在边界框引导下,其 alpha 软 IoU 为 0.850,与最强的微调基线(0.871)相当。在合并图像上,文本到设计任务的 FID 达到 66.41,而 FLUX.2 [klein] 为 86.84;文本准确率得分达到 0.860,并且运行速度是采用相同骨干网络的“先生成、后分解”级联方法的 19.1 倍。
更新时间: 2026-11-19 18:45:31
领域: cs.AI
Vision-Language-Action Models: A Life-Cycle Survey of Design, Training and Deployment
Vision-language-action (VLA) models adapt web-pretrained vision-language models to output robot actions, so that web knowledge carries over to physical control. In under four years the field has grown from RT-2, the first VLA, to open models that fine-tune on a single consumer GPU and proprietary generalists that clean unseen homes. VLA research joins robotics, computer vision and language modelling, so this survey is written for researchers and practitioners from each of these fields. It reviews 89 works from December 2022 to October 2026, mainly on manipulation and navigation, plus humanoid control, world-action models and evaluation. Seven design axes follow a VLA's life cycle: model design (inputs and memory, architecture, action output, intermediate predictions), training (pretraining data, post-training) and deployment (real-time execution). We compare 22 models on these axes, with their training data, model size, inference speed and hardware. Three trends emerge. (i) Training data has broadened beyond teleoperated robot data (about 10,000 hours for $π_0$) to community-collected episodes and egocentric human video (20,000 hours for GR00T N1.7). (ii) Model sizes have split into two groups: most recent models have 3-7 billion parameters; a new group under one billion runs on consumer GPUs. (iii) Generalist VLAs handling both manipulation and navigation are emerging, such as UniVLA and Qwen-VLA. We also compare VLAs with world-action models, which predict future observations as well as actions, and review evidence that some VLAs with near-perfect benchmark scores fail after small scene changes. A practitioner's guide gives a default for each design decision, and a glossary supports readers new to the field.
Updated: 2026-11-19 18:44:47
标题: 视觉—语言—行动模型:设计、训练与部署的全生命周期综述
摘要: 视觉—语言—动作(VLA)模型将基于网络数据预训练的视觉—语言模型改造为输出机器人动作的模型,从而将网络知识迁移到物理控制中。在不到四年的时间里,该领域已从首个 VLA——RT-2——发展到能够在单张消费级 GPU 上进行微调的开放模型,以及能够清洁陌生家庭环境的专有通用模型。VLA 研究融合了机器人学、计算机视觉和语言建模,因此本综述面向来自这些领域的研究人员和从业者。本文回顾了 2022 年 12 月至 2026 年 10 月发表的 89 项研究,主要涉及操作与导航,同时涵盖人形机器人控制、世界—动作模型和评测。我们沿着 VLA 的生命周期提出七个设计维度:模型设计(输入与记忆、架构、动作输出、中间预测)、训练(预训练数据、后训练)以及部署(实时执行)。我们根据这些维度比较了 22 个模型,并介绍其训练数据、模型规模、推理速度和硬件配置。 我们观察到三个趋势。(一)训练数据已超越遥操作机器人数据的范畴(π₀ 使用了约 10,000 小时数据),扩展到社区收集的操作片段和以人为中心的视频(GR00T N1.7 使用了 20,000 小时数据)。(二)模型规模已分化为两类:大多数最新模型拥有 30 亿至 70 亿个参数;另一类新兴模型的参数量低于 10 亿,可在消费级 GPU 上运行。(三)能够同时处理操作和导航任务的通用 VLA 正在出现,例如 UniVLA 和 Qwen-VLA。我们还将 VLA 与世界—动作模型进行了比较;后者除预测动作外,还会预测未来观测结果。与此同时,我们回顾了相关证据:一些在基准测试中取得近乎满分成绩的 VLA,在场景发生细微变化后却会失效。面向实践者的指南为每项设计决策提供默认选择,术语表则帮助刚接触该领域的读者理解相关概念。
更新时间: 2026-11-19 18:44:47
领域: cs.RO,cs.AI,cs.ET,cs.LG
Represented but misread: Post-training changes how language models read out what they represent
Does post-training change what a language model represents, or how this representation is read out into an answer? We compared linear probes with the models' own answers, analyzed with signal detection theory, in six open-weight base models and their post-trained versions. For judgments of whether German texts were written by a human or an AI, probes and word n-gram classifiers separated the classes well, but the answers did not and often ordered the texts inversely. Post-training lowered the sensitivity of the answers on average ($Δd' = -0.34$ across model families; -0.29 across three prompts). It also changed the use of a stated base rate: Base models shifted their log-odds by less than the stated change in prior odds, most post-trained models by more. In two models with stage-wise checkpoints, the change occurred during supervised fine-tuning, model stitching implicated the early layers, and from mid-depth on internal states at positions after the text, not those of the text, transferred the change between checkpoints. Our corpora cannot be shared, so we add a case reproducible from public data, the truth of negated statements. Here, post-training acted in the opposite direction: Probes decoded truth at or near ceiling in every model, the answers of several base models did not use it, and post-training repaired them; by mid-depth the repair resided at the positions after the statement; below it, the representation of the statement contributed, strongly in one of four models. In a training study, adding 2,000 correctly labeled authorship judgments of news texts to otherwise identical fine-tuning data improved the answers on our newspaper and textbook corpora and inverted them on the chats, where they followed a news-trained probe of the base model. Post-training thus changed how a judgment is read out of what a model represents, and a small training signal can set its direction.
Updated: 2026-11-19 18:43:56
标题: 有表征却被误读:后训练改变了语言模型对其表征内容的读取方式
摘要: 后训练改变的是语言模型所表征的内容,还是将这种表征读出为答案的方式?我们在六个开放权重基础模型及其后训练版本中,将线性探针与模型自身的答案进行比较,并运用信号检测理论加以分析。对于判断德语文本是由人类还是人工智能撰写这一任务,探针和词 n-gram 分类器都能很好地区分两类文本,但模型给出的答案却无法做到,而且常常以相反的顺序排列这些文本。平均而言,后训练降低了答案的敏感性(跨模型系列的 Δd' = -0.34;跨三个提示词的 Δd' = -0.29)。后训练还改变了模型对给定基准率的使用方式:基础模型对数几率的偏移小于给定先验几率的变化,而大多数后训练模型的偏移则更大。在两个具有分阶段检查点的模型中,这一变化发生在监督微调期间;模型拼接实验表明,变化涉及较早的层;从中等深度开始,文本之后位置的内部状态,而非文本位置的内部状态,能够在不同检查点之间传递这一变化。由于我们的语料库无法共享,我们另外加入了一个可利用公开数据复现的案例,即判断被否定陈述的真值。在这一任务中,后训练产生了相反的作用:在每个模型中,探针都能以接近上限的准确度解码真值;若干基础模型的答案没有利用这一信息,而后训练修复了这一问题。到中等深度时,这种修复存在于陈述之后的位置;在更低层中,陈述的表征也有所贡献,并且在四个模型中的一个模型里贡献尤为显著。在一项训练研究中,我们将 2,000 条带有正确标签的新闻文本作者身份判断加入其他方面完全相同的微调数据中。结果显示,模型在我们的报纸和教科书语料库上的答案有所改善,而在聊天文本上则发生了反转;在聊天文本上,模型的答案遵循了基础模型中由新闻数据训练出的探针。因此,后训练改变了模型从其所表征的内容中读出判断的方式,而一个很小的训练信号就可以决定这种读出的方向。
更新时间: 2026-11-19 18:43:56
领域: cs.CL,cs.LG
Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA
Remark: This work is in submission at STOC'27 and thus the full manuscript has been publicly posted on the conference website since November 3rd, 2026. Inspired by the Codeword-Hash Structure problem recently introduced by Cakan (arXiV, 2026) to separate $\mathsf{QMA}$ from $\mathsf{QCIP}$, we introduce a new problem called Codeword-Hash pairs in Noise ($\mathsf{CHN}$) and prove that, in the query complexity model, it is in $\mathsf{QMA}$ but hard for the $\mathsf{QCMA}$ hierarchy $\mathsf{QCMAH} = \bigcup_{d\geq1}\mathsf{QCMA}^{\mathsf{QCMA}^{\cdots^{\mathsf{QCMA}}}}$, the classical-witness quantum-verifier analogue of $\mathsf{PH}=\bigcup_{d\ge1}\mathsf{NP}^{\mathsf{NP}^{\cdots^{\mathsf{NP}}}}$. Using this problem, we show that there exists a classical oracle ${O}$ such that $\mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O} =\mathsf{QCMAH}^{O} \subset \mathsf{QMA}^{O} \text{ but } \mathsf{QMA}^{O}\not\subseteq\mathsf{QCMAH}^{O},$ thus showing that quantum state or quantum proof advantage could exist even if classical computers can efficiently solve any problem that can be quantumly verified with a classical proof. Further, using our problem, we show that various quantum cryptographic primitives can exist even when $\mathsf{P} = \mathsf{QCMA}$ and thus neither quantum-computable one-way functions nor (verifiable) quantum computational advantage exist. In particular, relative to a classical oracle ${O}$ with $\mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O}=\mathsf{QCMAH}^{O}$, there exist pseudorandom states with classical keys and public-key encryption with copy-protected quantum decryption keys and classical public keys and ciphertexts, among other primitives, answering an open question of Kretschmer, Qian, and Tal (STOC 2025).
Updated: 2026-11-19 18:40:14
标题: QMA 与 QCMA 层级的经典预言机分离及 P = QCMA 时的量子密码学
摘要: 备注:本文目前正在投稿 STOC’27,因此自 2026 年 11 月 3 日起,完整手稿已公开发布在该会议网站上。 受 Cakan 最近提出的 Codeword-Hash Structure 问题(arXiv,2026)的启发,我们引入了一个称为噪声中的 Codeword-Hash 对(Codeword-Hash pairs in Noise,\(\mathsf{CHN}\))的新问题,并证明在查询复杂度模型中,该问题属于 \(\mathsf{QMA}\),但对于 \(\mathsf{QCMA}\) 层级 \(\mathsf{QCMAH}=\bigcup_{d\ge1}\mathsf{QCMA}^{\mathsf{QCMA}^{\cdots^{\mathsf{QCMA}}}}\) 是困难的;后者是 \(\mathsf{PH}=\bigcup_{d\ge1}\mathsf{NP}^{\mathsf{NP}^{\cdots^{\mathsf{NP}}}}\) 的经典见证量子验证器对应版本。 利用这一问题,我们证明存在一个经典预言机 \(O\),使得 \[ \mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O}=\mathsf{QCMAH}^{O}\subset \mathsf{QMA}^{O}, \] 但 \[ \mathsf{QMA}^{O}\not\subseteq\mathsf{QCMAH}^{O}, \] 从而表明:即使经典计算机能够高效解决任何可通过经典证明进行量子验证的问题,量子态或量子证明的优势仍然可能存在。 进一步地,利用该问题,我们证明即使在 \(\mathsf{P}=\mathsf{QCMA}\) 的情况下,多种量子密码学原语仍然可以存在,因此量子可计算的单向函数以及(可验证的)量子计算优势都不存在。特别地,相对于满足 \[ \mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O}=\mathsf{QCMAH}^{O} \] 的经典预言机 \(O\),仍然存在具有经典密钥的伪随机量子态,以及采用具备复制保护的量子解密密钥、经典公钥和经典密文的公钥加密方案等其他密码学原语,从而回答了 Kretschmer、Qian 和 Tal(STOC 2025)提出的一个开放问题。
更新时间: 2026-11-19 18:40:14
领域: quant-ph,cs.CR
RNAGenScape: Property-Guided, Optimized Generation of mRNA Sequences with Manifold Langevin Dynamics
Generating property-optimized mRNA sequences is central to applications such as vaccine design and protein replacement therapy, but remains challenging due to limited data, complex sequence-function relationships, and the narrow space of biologically viable sequences. Generative methods that drift away from the data manifold can yield sequences that fail to fold, translate poorly, or are otherwise nonfunctional. We present RNAGenScape, a property-guided manifold Langevin dynamics framework for mRNA sequence generation that operates on a learned manifold of real data. By performing iterative local optimization constrained to this manifold, RNAGenScape preserves favorable computational viability proxies, accesses reliable guidance, and discourages excursions into regions poorly supported by the training data. The framework integrates three components: (1) an autoencoder jointly trained with a property predictor to learn a property-organized latent manifold, (2) a denoising autoencoder that projects updates back onto the manifold, and (3) a property-guided Langevin dynamics procedure that performs optimization along the manifold. Across three real-world mRNA datasets spanning two orders of magnitude in size, RNAGenScape increases median oracle-predicted property gain by up to 267% and success rate by up to 31%, while maintaining good biological viability proxy measures and achieving competitive inference efficiency compared to existing generative approaches.
Updated: 2026-11-19 18:38:01
标题: RNAGenScape:基于性质引导的流形朗之万动力学优化生成 mRNA 序列
摘要: 生成性质优化的 mRNA 序列是疫苗设计和蛋白质替代疗法等应用的核心,但由于数据有限、序列与功能之间的关系复杂,以及具有生物学可行性的序列空间狭窄,这一任务仍然充满挑战。偏离数据流形的生成方法可能产生无法折叠、翻译效率低下或存在其他功能缺陷的序列。我们提出 RNAGenScape,一种性质引导的流形朗之万动力学框架,用于在真实数据所学习的流形上生成 mRNA 序列。通过在该流形约束下进行迭代局部优化,RNAGenScape 能够保留有利的计算可行性代理指标,获得可靠的引导,并抑制偏离训练数据支持不足区域的行为。该框架包含三个组件:(1)与性质预测器联合训练的自编码器,用于学习按性质组织的潜在流形;(2)将更新重新投影回流形的去噪自编码器;(3)沿流形执行优化的性质引导朗之万动力学过程。在三个真实世界的 mRNA 数据集上进行测试时,这些数据集的规模相差两个数量级,RNAGenScape 使由预言机预测的性质增益中位数最高提高 267%,成功率最高提高 31%,同时保持良好的生物学可行性代理指标,并且与现有生成方法相比实现了具有竞争力的推理效率。
更新时间: 2026-11-19 18:38:01
领域: q-bio.QM,cs.LG,q-bio.BM
Text-Aware, Vision-Blind: How Multimodal Image Editing Systems Handle Unsafe Inputs
Multimodal image generation systems have made rapid progress and increasingly emphasize content safety. However, their safety mechanisms tend to rely on a single modality and lack joint consideration of both visual content and text prompts, particularly in instruction-guided image editing, where the uploaded image may itself carry risk. We thus introduce EditSafetyBench, a benchmark that measures system-level safety awareness of advanced image editing systems, containing 5,940 image-instruction pairs, covering safe and unsafe images across 11 risk categories and three edit intents. We then probe the benchmark dataset on four systems, including Gemini, GPT, Qwen API, and Qwen Local. Based on our evaluation, we observe a systematic text-vision safety mismatch: Gemini and GPT refuse 87.1\% and 81.6\% cases containing unsafe-intent editing prompts, while only refusing 24.2\% and 22.4\% cases with both unsafe images and neutral instructions. At the category level, most risks are considered inconsistently by different systems, e.g., GPT allows 70.4\% editing attempts of unsafe political content while Gemini only allows 34.8\%. Notably, sexual content shows the strongest visual sensitivity, likely benefiting from mature NSFW identification works. Our findings highlight the need for safety guardrails that jointly reason over both visual and textual modalities in image editing systems.
Updated: 2026-11-19 18:36:19
标题: 文本感知、视觉盲区:多模态图像编辑系统如何处理不安全输入
摘要: 多模态图像生成系统近年来发展迅速,并日益重视内容安全。然而,其安全机制往往依赖单一模态,缺乏对视觉内容与文本提示词的联合考量,尤其是在指令引导的图像编辑场景中,用户上传的图像本身可能就具有风险。为此,我们提出了 EditSafetyBench,这是一个用于衡量先进图像编辑系统整体安全意识的基准,包含 5,940 个图像—指令对,涵盖 11 类风险和三种编辑意图下的安全与不安全图像。随后,我们在 Gemini、GPT、Qwen API 和 Qwen Local 四个系统上对该基准数据集进行了测试。评估结果显示,系统存在系统性的文本—视觉安全错配:对于包含不安全意图编辑提示词的案例,Gemini 和 GPT 分别拒绝了 87.1% 和 81.6%;而对于同时包含不安全图像和中性指令的案例,两者仅分别拒绝了 24.2% 和 22.4%。从类别层面来看,不同系统对大多数风险的判断并不一致。例如,对于不安全政治内容的编辑尝试,GPT 允许了 70.4%,而 Gemini 仅允许了 34.8%。值得注意的是,性内容表现出最强的视觉敏感性,这可能得益于已有较为成熟的 NSFW 内容识别研究。我们的研究结果表明,图像编辑系统亟需能够同时对视觉和文本模态进行联合推理的安全防护机制。
更新时间: 2026-11-19 18:36:19
领域: cs.CR,cs.CV,cs.LG
GEOHunter: Mapping a Generative Engine Optimization Network in the Wild
Generative engines synthesize retrieved web pages into answers, recommendations, and rankings. Generative engine optimization (GEO) services sell visibility in these answers by publishing promotional articles on user-generated-content (UGC) platforms for paying clients. Such promotion raises concerns in medical and financial domains, where misleading advice can cause harm. To study the severity of this problem, we measure one such paid-content operation across three major Chinese UGC platforms, uncovering 1,985 accounts associated with the network comprising 466,357 inferred promotional placements. We find that the network promotes products across diverse categories through a growing pool of accounts, conducting coordinated campaigns spanning months across multiple platforms while evolving its listicle content over time. Across nine generative engines from both the US and China, we find that 4.5% to 20% of retrievable cited pages are attributable to the network, depending on how strictly attribution is drawn. On eight of these engines, its clients are named in 52% of answers, against 68% for category leaders. Our work demonstrates the effectiveness of UGC GEO placement at influencing generative engine outcomes, and reveals content-level defenses as insufficient against coordinated UGC placements, where account-level and platform-level signals are necessary for proper defense.
Updated: 2026-11-19 18:33:42
标题: GEOHunter:绘制真实环境中的生成式引擎优化网络
摘要: 生成式引擎将检索到的网页综合成答案、推荐和排名。生成式引擎优化(GEO)服务通过在用户生成内容(UGC)平台上为付费客户发布推广文章,出售其在这些答案中的可见度。这类推广在医疗和金融领域引发了担忧,因为误导性建议可能造成危害。为研究这一问题的严重程度,我们对中国三大 UGC 平台上的一个付费内容运营网络进行了测量,发现与该网络相关联的 1,985 个账号,以及由此推断出的 466,357 条推广投放。我们发现,该网络通过不断扩大的账号池推广多种类别的产品,在多个平台上开展持续数月的协调行动,并随着时间推移不断调整其榜单式内容。在来自美国和中国的九个生成式引擎中,我们发现,根据归因标准的严格程度不同,可检索到的被引用页面中有 4.5% 至 20% 可归因于该网络。在其中八个引擎上,该网络客户在答案中的被点名率为 52%,而品类领先者的这一比例为 68%。我们的研究证明了 UGC GEO 投放影响生成式引擎结果的有效性,并揭示出,针对协调性 UGC 投放,仅依靠内容层面的防御措施并不充分;要实现有效防御,还需要结合账号层面和平台层面的信号。
更新时间: 2026-11-19 18:33:42
领域: cs.CR,cs.AI,cs.SI
Beyond Visual Fidelity: Benchmarking Super-Resolution Models for Large-Scale Remote Sensing Imagery via Downstream Task Integration
Super-resolution (SR) techniques have made major advances in reconstructing high-resolution images from low-resolution inputs. The increased resolution provides visual enhancement and utility for monitoring tasks. In particular, SR has been increasingly developed for satellite-based Earth observation, with applications in urban planning, agriculture, ecology, and disaster response. However, existing SR studies and benchmarks typically use fidelity metrics such as PSNR or SSIM, whereas the true utility of super-resolved images lies in supporting downstream tasks such as land cover classification, biomass estimation, and change detection. To bridge this gap, we introduce GeoSR-Bench, a downstream task-integrated SR benchmark dataset to evaluate SR models beyond fidelity metrics. GeoSR-Bench comprises spatially co-located, temporally aligned, and quality-controlled image pairs from about 36,000 locations across diverse land covers, spanning resolutions from 500m to 0.6m. To the best of our knowledge, GeoSR-Bench is the first SR benchmark that directly connects improved image resolution from SR models with downstream Earth monitoring tasks, including land cover segmentation, infrastructure mapping, and biophysical variable estimation. Using GeoSR-Bench, we benchmark GAN, transformer, neural operator, and diffusion-based SR models on perceptual quality and downstream task performance. We conduct experiments with 270 settings, covering 2 cross-platform SR tasks, 9 SR models, 3 downstream task models, and 5 downstream tasks for each SR task. The results show that improvements in traditional SR metrics often do not correlate with gains in task performance, and the correlations can be negative, indicating that these metrics provide limited guidance for selecting superior models for downstream tasks. This reveals the need to integrate downstream tasks into SR model development and evaluation.
Updated: 2026-11-19 18:30:28
标题: 超越视觉保真度:通过下游任务集成对大规模遥感影像超分辨率模型进行基准评测
摘要: 超分辨率(SR)技术在根据低分辨率输入重建高分辨率图像方面取得了重大进展。分辨率的提升能够增强图像的视觉效果和实用性。特别是,面向卫星地球观测的超分辨率技术得到了日益广泛的发展,并应用于城市规划、农业、生态学和灾害响应等领域。然而,现有的超分辨率研究和基准通常采用峰值信噪比(PSNR)或结构相似性指数(SSIM)等保真度指标,而超分辨率图像的真正价值在于支持土地覆盖分类、生物量估算和变化检测等下游任务。为弥合这一差距,我们提出了GeoSR-Bench,这是一个融合集成下游任务的超分辨率基准数据集,用于超越保真度指标评估超分辨率模型。GeoSR-Bench包含来自约36,000个位置的图像对,这些位置覆盖多种土地覆盖类型,图像在空间上配准、时间上对齐,并经过质量控制,分辨率范围从500米到0.6米。据我们所知,GeoSR-Bench是首个将超分辨率模型带来的图像分辨率提升与地球监测下游任务直接联系起来的超分辨率基准,涵盖土地覆盖分割、基础设施制图和生物物理变量估算等任务。借助GeoSR-Bench,我们从感知质量和下游任务性能两个方面,对基于生成对抗网络、Transformer、神经算子和扩散模型的超分辨率模型进行了基准评测。我们在270种设置下开展实验,涵盖2项跨平台超分辨率任务、9个超分辨率模型、3个下游任务模型,以及每项超分辨率任务对应的5个下游任务。结果表明,传统超分辨率指标的提升通常与任务性能的提升并不相关,二者之间的相关性甚至可能为负,这说明这些指标对于选择下游任务表现更优的模型所能提供的指导十分有限。这一发现表明,有必要将下游任务整合到超分辨率模型的开发与评估过程中。
更新时间: 2026-11-19 18:30:28
领域: cs.CV,cs.AI,cs.LG
Multi-institutional grading of Barrett's esophagus dysplasia without stain normalization using a pathology foundation model and multiple instance learning
Barrett's esophagus dysplasia grading suffers substantial inter-observer variability, particularly for low-grade dysplasia, complicating clinical decision-making. We conducted a retrospective multi-institutional diagnostic accuracy study of a foundation model-based deep learning system for dysplasia grading, using 969 H\&E-stained whole slide images from four institutions. Patch-level classifiers trained on expert annotations identified diagnostically relevant regions, followed by attribute-aware multiple instance learning for slide-level classification as non-dysplastic Barrett's esophagus (NDBE), low-grade dysplasia, or high-grade dysplasia. On a held-out test set (n = 130), macro-averaged AUC was 0.96 (95\% CI 0.93--0.98). For binary dysplasia detection, sensitivity was 98\% (80/82) and specificity 81\% (39/48), with a negative likelihood ratio of 0.030 and quadratic-weighted \kap{} of 0.83 against expert consensus. No high-grade dysplasia case was misclassified as NDBE. Performance was consistent across institutions without stain normalization, indicating that stain-robust foundation-model representations may remove the site-specific preprocessing that has constrained prior systems to institution-specific deployment.
Updated: 2026-11-19 18:27:59
标题: 使用病理学基础模型和多实例学习对未经染色标准化的巴雷特食管异型增生进行多机构分级
摘要: 巴雷特食管异型增生分级存在显著的观察者间差异,尤其是在低级别异型增生方面,从而增加了临床决策的复杂性。我们开展了一项回顾性、多机构诊断准确性研究,评估一种基于基础模型的深度学习系统对异型增生进行分级的性能,研究采用来自四家机构的969张经苏木精-伊红(H&E)染色的全切片图像。基于专家标注训练的图像块级分类器首先识别具有诊断意义的区域,随后采用属性感知的多实例学习进行切片级分类,将病例分为无异型增生的巴雷特食管(NDBE)、低级别异型增生或高级别异型增生。在留出的测试集(n = 130)上,宏平均AUC为0.96(95% CI:0.93–0.98)。对于二分类异型增生检测,敏感度为98%(80/82),特异度为81%(39/48),阴性似然比为0.030;与专家共识相比,二次加权κ值为0.83。没有一例高级别异型增生被误分类为NDBE。该系统在不同机构中的表现保持一致,且未进行染色标准化,表明具有染色稳健性的基础模型表征可能消除既往系统所需的机构特异性预处理,从而突破其只能在单一机构部署的限制。
更新时间: 2026-11-19 18:27:59
领域: cs.CV,cs.AI
MM-SystemOneBias: Evaluating Bias in Multimodal Jev-Style System One Decision Models
When multimodal decision models determine actions, moderation outcomes, or quality judgments, their reliability depends on preserving semantic decisions across presentation changes, ignoring irrelevant additions, and distinguishing information consistent with task evidence from information that conflicts with it. Existing evaluations study decision-interface biases and multimodal model behavior in separate settings, leaving no common protocol to compare multimodal decision models with their backbones on practical tasks. We introduce \textbf{MM-SystemOneBias}, which evaluates 13 models on 5,323 original instances from nine public datasets and 11 task scenarios using six paired interventions: option order, option label, external judgment, image--text description, irrelevant information, and rating scale. Across seven matched decision-model--backbone pairs, decision models are more stable under option-label, irrelevant-information, and rating-scale changes in all seven pairs; six pairs also show lower option-order flip rates. They incur smaller accuracy losses under incorrect external judgments in all seven pairs and conflicting descriptions in six. In six pairs, they gain less accuracy from correct external judgments and show less favorable accuracy changes under consistent descriptions. Among pairs with unchanged semantic decisions, mean absolute changes in answer probabilities range from 4.56 to 11.55 percentage points, revealing input effects that accuracy alone misses.
Updated: 2026-11-19 18:25:41
标题: MM-SystemOneBias:评估多模态 Jev 风格系统一决策模型中的偏见
摘要: 当多模态决策模型确定行动、审核结果或质量判断时,其可靠性取决于能否在呈现方式发生变化时保持语义决策的一致性,忽略无关信息,并区分与任务证据一致的信息和与之冲突的信息。现有评估分别研究决策界面偏差和多模态模型行为,缺乏一种共同协议来比较多模态决策模型及其骨干模型在实际任务中的表现。我们提出了 MM-SystemOneBias,在六种成对干预下,对来自九个公开数据集、涵盖11种任务场景的5,323个原始实例中的13个模型进行评估。这六种干预包括选项顺序、选项标签、外部判断、图像—文本描述、无关信息和评分量表。在七组匹配的决策模型—骨干模型对中,所有七组决策模型在选项标签、无关信息和评分量表变化下都表现出更高的稳定性;其中六组在选项顺序变化下也表现出更低的答案翻转率。在错误外部判断的影响下,全部七组决策模型的准确率损失都更小;在相互冲突的描述影响下,其中六组的准确率损失更小。在六组模型对中,决策模型从正确外部判断中获得的准确率提升较小,并且在与任务一致的描述影响下,准确率变化也更不利。在语义决策保持不变的模型对中,答案概率的平均绝对变化幅度为4.56至11.55个百分点,揭示了仅凭准确率无法捕捉的输入影响。
更新时间: 2026-11-19 18:25:41
领域: cs.AI
Replication of Agentic Security Events: Audit and Investigation (ROGUE-AI)
Agents based on large language models (LLMs) can now delete files and send payments on behalf of their users. News media reports routinely describe failures of these agents (e.g., Replit's coding agent deleting a production database), but a report often only says what went wrong and rarely (in)validates the incident or finds its root cause. Incident catalogs collect these reports, and benchmarks record whether agents fail, but neither replicates an incident nor tests the cause its report might identify. In this paper, we present ROGUE-AI (Replication of Agentic Security Events: Audit and Investigation), a multi-agent framework that closes the above gap and rebuilds each reported incident offline together with a matched control that lacks only the blamed cause, and runs agents on both. Our results suggest that ROGUE-AI is able to reproduce the reported harm in 89% of its 108 attempted replications. Agents built on five current GPT, Claude, Gemini and DeepSeek models made the reported mistake in 18% to 33% of runs, against at most 1% without the blamed cause. Of the 72 incidents with real-world harm, 62 had no underlying attacker, and in these, agents did what their task asked for but missed an ordinary hazard, such as a database shared with the live site. Replications without an attacker caused more harm than replications of prompt injection for all five models. Defenses against prompt injection look for injected instructions, but these replications contain none. Further, a warning after each tool output that names the hazard and its consequence lowered harm for all five models, whereas a note of the same length that does not mention the hazard left most of the harm in place. Built from real incidents, the ROGUE-AI replications form a reusable audit framework that vendors can rerun before each new release.
Updated: 2026-11-19 18:23:35
标题: 智能体安全事件复现:审计与调查(ROGUE-AI)
摘要: 基于大型语言模型(LLM)的智能体如今已经能够代表用户删除文件和发送款项。新闻媒体经常报道此类智能体的失误(例如,Replit 的编码智能体删除了生产数据库),但报道通常只说明发生了什么错误,很少验证或证伪该事件,也很少找出其根本原因。事件目录收集这些报道,基准测试记录智能体是否失败,但二者都不会复现事件,也不会检验报道可能指出的原因。在本文中,我们提出 ROGUE-AI(智能体安全事件复现:审计与调查),这是一种多智能体框架,旨在弥合上述缺口:它在线下重建每一起被报道的事件,同时构建一个仅缺少被归咎原因的匹配对照环境,并分别在两种环境中运行智能体。结果表明,在 108 次尝试复现中,ROGUE-AI 能够在 89% 的情况下重现报道中的危害。基于当前五种 GPT、Claude、Gemini 和 DeepSeek 模型构建的智能体,在 18% 至 33% 的运行中犯下了报道所述的错误,而在不存在被归咎原因时,这一比例最高不超过 1%。在造成现实世界危害的 72 起事件中,有 62 起并不存在潜在攻击者;在这些事件中,智能体完成了任务要求,却忽视了诸如数据库与线上生产站点共享这类常见风险。对于全部五种模型而言,没有攻击者的复现实验造成的危害都大于提示注入复现实验。针对提示注入的防御机制会寻找被注入的指令,但这些复现实验中并不存在任何此类指令。此外,在每次工具输出后显示一条指出风险及其后果的警告,能够降低全部五种模型造成的危害;而显示一条长度相同但未提及该风险的提示,则无法消除大部分危害。ROGUE-AI 基于真实事件构建,其复现实验构成了一个可重复使用的审计框架,供应商可以在每次发布新版本之前重新运行该框架。
更新时间: 2026-11-19 18:23:35
领域: cs.CR,cs.AI,cs.MA
The Geometry of Lies: Knowledge and Persona Directions for Detecting Deception in Large Language Models
Linear probes are the cheapest LLM lie detectors but often fail to transfer across kinds of lie. Label-free directions from honest and deceptive role-play are untested at 70B scale and on lies about knowledge, where a lie and an honest denial can be identical. We widen a published persona bank with roles that deny knowledge they have, plus honest counterparts. At each model's middle layer the resulting persona direction ranks lies across Liars' Bench better than single-dataset probes on three of its four models; it fails on Qwen, even when Qwen stays in role far more often. On Llama-3.3-70B-Instruct it beats directions from a random persona bank, but its gain over the published direction is within the range of random widenings. On lies about knowledge, persona directions mainly track a reply's wording: where lies and honest denials share their words, our three main contrasts stay inside the random-direction band on Llama and Qwen and reach only its edge on Gemma, though on Mistral one clears it. A knowledge direction contrasts questions the model can answer with ones nobody can, each followed by the same scripted denial. It separates lies from identical honest denials on two models and narrowly on a third, but not on the fourth; its other results partly depend on the benchmark's wording. On the Gender-Secret fine-tune it clears the band by a few hundredths on Llama and fails on Mistral. The sum of the two directions ranks lies better than a supervised probe at the same depth on all four models (on one, both near chance) but is level with the persona direction on Llama's average and behind that probe on held-out lies. More varied role-play questions do not help the persona direction on Liars' Bench.
Updated: 2026-11-19 18:20:01
标题: 谎言的几何学:用于检测大型语言模型欺骗行为的知识与人格方向
摘要: 线性探针是成本最低的大语言模型谎言检测器,但往往无法跨不同类型的谎言迁移。由诚实与欺骗式角色扮演得到的无标签方向,尚未在 700 亿参数规模以及关于知识的谎言上经过检验;在后者中,谎言与诚实的否认可能完全相同。我们扩展了一个已发表的人格库,加入了否认自己拥有某些知识的角色,以及与之对应的诚实角色。在每个模型的中间层,所得的人格方向在 Liars' Bench 上对谎言的排序优于单数据集探针,在其中四个模型中的三个上如此;在 Qwen 上则失败了,即使 Qwen 更经常保持角色设定。对于 Llama-3.3-70B-Instruct,它优于从随机人格库得到的方向,但相较于已发表方向的提升仍处于随机扩展的幅度范围内。对于关于知识的谎言,人格方向主要追踪回答的措辞:当谎言与诚实否认使用相同词语时,我们的三个主要对比在 Llama 和 Qwen 上均处于随机方向带之内,在 Gemma 上也只达到其边缘,不过在 Mistral 上有一个对比超出了该范围。知识方向对比模型能够回答的问题与任何人都无法回答的问题,并让两者随后都接受相同的脚本化否认。它在两个模型上区分了使用相同措辞的谎言与诚实否认,在第三个模型上也勉强做到了,但在第四个模型上失败;其余结果部分依赖于基准测试的措辞。在 Gender-Secret 微调数据集上,它在 Llama 上仅以几个百分点的幅度超过该范围,在 Mistral 上则失败。两个方向之和在四个模型上对谎言的排序都优于相同深度的监督式探针(其中一个模型上两者都接近随机水平),但在 Llama 的平均表现上仅与人格方向持平,在留出谎言上则落后于该探针。在 Liars' Bench 上,使用更多样化的角色扮演问题并不能改善人格方向的表现。
更新时间: 2026-11-19 18:20:01
领域: cs.AI
Automating the Expert Eye: A System-Agnostic Deep Learning Framework for Rare Event Discovery in Imbalanced Force Spectroscopy
Single-molecule force spectroscopy (SMFS) probes biomolecular mechanics at the single-molecule level, but high-throughput acquisition of force-extension curves creates a data processing bottleneck. Identifying rare specific unbinding events among thousands of noise-dominated traces still relies largely on manual visual inspection. Here, we present a deep learning workflow for the preliminary screening of severely imbalanced SMFS datasets. Using 2D image representations of force-extension curves without system-specific physical priors, we fine-tuned a modified ResNet18 architecture trained with focal loss and evaluated it on the mechanical unfolding pathways of the Ruminococcus champanellensis XMod-Doc/Coh complex. On a held-out test set with a 1.34% target prevalence (13 positive P_2 events among 970 curves), the model achieved 92.31% recall (12 of 13 events) and 91.95% specificity (880 of 957 negative traces), automatically discarding 90.82% of the dataset and reducing manual review from 970 to 89 flagged curves. We also integrated Gradient-weighted Class Activation Mapping (Grad-CAM) to provide a qualitative visual reference of the curve regions driving each prediction. The complete Python pipeline is released as open-source software with an executable Google Colab notebook, enabling reproducible SMFS screening without dedicated local GPU hardware.
Updated: 2026-11-19 18:18:25
标题: 自动化专家之眼:一种与系统无关的用于不平衡力谱学中稀有事件发现的深度学习框架
摘要: 单分子力谱(SMFS)在单分子水平上探测生物分子的力学性质,但力–伸长曲线的高通量采集造成了数据处理瓶颈。在数千条由噪声主导的轨迹中识别罕见的特异性解离事件,仍主要依赖人工目视检查。在此,我们提出了一种用于严重类别不平衡 SMFS 数据集初步筛选的深度学习工作流程。我们采用力–伸长曲线的二维图像表示,不引入依赖特定系统的物理先验,并对经过修改的 ResNet18 架构进行微调训练,使用聚焦损失函数;随后在 Ruminococcus champanellensis 的 XMod-Doc/Coh 复合物的机械展开路径上对其进行评估。在目标事件发生率为 1.34% 的独立测试集上(970 条曲线中包含 13 个阳性 P_2 事件),该模型达到了 92.31% 的召回率(检出 13 个事件中的 12 个)和 91.95% 的特异性(在 957 条阴性轨迹中正确识别 880 条),自动剔除了数据集中的 90.82%,并将人工复核数量从 970 条减少至 89 条标记曲线。我们还整合了基于梯度加权的类激活映射(Grad-CAM),为驱动每次预测的曲线区域提供定性可视化参考。完整的 Python 流程以开源软件形式发布,并附带可执行的 Google Colab 笔记本,使用户无需专用的本地 GPU 硬件即可开展可复现的 SMFS 筛选。
更新时间: 2026-11-19 18:18:25
领域: physics.app-ph,cs.LG
No Country for Old Privacy: The Evolving Challenges of Anonymity in Bitcoin
We present a longitudinal measurement study on the adoption of detectable, second-generation anonymisation protocols in the Bitcoin network, including CoinJoin, CoinSwap, CoinShuffle and Stealth Addresses. By implementing and refining a suite of heuristic filters, we identify over 5 million candidate CoinJoin and 23.3 million candidate CoinSwap transactions. Notably, the use of CoinShuffle was unexpectedly found to be closely aligned with the operation of coordinator-based CoinJoin services such as Wasabi and Whirlpool. Our analysis reveals consistently low adoption rates, with these protocols typically constituting less than 1% of network transactions, and a sharp decline in detectable usage following key regulatory events. Furthermore, we find no evidence of standardised Stealth Address adoption, indicating a failure to converge on a common privacy standard. This study provides a comprehensive picture of a niche ecosystem whose on-chain visibility has been largely suppressed, strongly suggesting the migration of privacy-seeking users to less transparent and less detectable methods.
Updated: 2026-11-19 18:17:41
标题: 再无隐私容身之地:比特币匿名性面临的不断演变的挑战
摘要: 我们对比特币网络中可检测的第二代匿名化协议的采用情况进行了纵向测量研究,包括 CoinJoin、CoinSwap、CoinShuffle 和隐形地址。通过实施并改进一套启发式过滤器,我们识别出超过 500 万笔候选 CoinJoin 交易和 2330 万笔候选 CoinSwap 交易。值得注意的是,我们意外发现,CoinShuffle 的使用与 Wasabi 和 Whirlpool 等基于协调者的 CoinJoin 服务的运作密切相关。我们的分析显示,这些协议的采用率始终较低,通常仅占网络交易的不到 1%;而在发生关键监管事件后,可检测到的使用量大幅下降。此外,我们没有发现采用标准化隐形地址的证据,这表明相关生态未能形成统一的隐私标准。本研究全面描绘了一个小众生态系统的状况:其链上可见性已在很大程度上受到抑制,这强烈表明寻求隐私的用户正在转向透明度更低、也更难被检测的方法。
更新时间: 2026-11-19 18:17:41
领域: cs.CR
AURA: AUdio-dRiven streaming Avatar
Current audio-driven video diffusion models can synthesize realistic talking-head videos but generally require dozens of diffusion denoising steps over multi-second video chunks, making them unsuitable for streaming applications such as voice assistants and virtual avatars, where low-latency and online causal generation are required properties. AURA generates video chunk by chunk with a rolling KV cache, requiring only the audio of the current chunk to start generating, rather than a multi-second audio look-ahead like bidirectional models. It comes in two sizes: AURA 1.3B streams 576p video in real time on a single GPU (20.7 fps for a 16 Hz playback rate), making it suited to interactive avatar applications, and AURA 5B streams 720p video at 9.7 fps. Our two-stage distillation pipeline first aligns the causal student with the teacher, by training it to match the teacher's trajectories with fewer diffusion steps and a chunk-wise sliding window causal attention mask, then applies Distribution Matching Distillation (DMD) with backward simulation to close the remaining quality gap. On standard talking-head benchmarks, AURA 1.3B runs 23x faster than its own bidirectional teacher and reaches a quality comparable to TalkVerse at a lower resolution, and AURA 5B matches its TalkVerse teacher at 720p while running 17x faster. To support reproducibility and further research on streaming avatar generation, we release the weights of both models along with a dataset of 30K synthetic videos and their precomputed teacher trajectories.
Updated: 2026-11-19 18:17:38
标题: AURA:音频驱动的流式化虚拟形象
摘要: 当前由音频驱动的视频扩散模型能够合成逼真的说话头像视频,但通常需要在数秒长的视频片段上执行数十次扩散去噪步骤,因此不适用于语音助手和虚拟化身等流式应用;在这些应用中,低延迟和在线因果生成是必备条件。AURA 借助滚动 KV 缓存逐块生成视频,只需当前视频块的音频即可开始生成,而不需要像双向模型那样预先获取数秒的音频。AURA 提供两个规模的版本:AURA 1.3B 可在单个 GPU 上实时生成 576p 视频(以 16 Hz 的播放速率运行时达到 20.7 fps),适用于交互式虚拟化身应用;AURA 5B 则以 9.7 fps 的速度生成 720p 视频。我们的两阶段蒸馏流程首先通过训练因果学生模型,在更少扩散步骤和按视频块划分的滑动窗口因果注意力掩码下匹配教师模型的生成轨迹,从而使其与教师模型对齐;随后采用结合反向模拟的分布匹配蒸馏(DMD),缩小剩余的质量差距。在标准说话头像基准测试中,AURA 1.3B 的运行速度比其自身的双向教师模型快 23 倍,并在较低分辨率下达到与 TalkVerse 相当的质量;AURA 5B 在 720p 分辨率下达到与其 TalkVerse 教师模型相当的质量,同时运行速度提升至 17 倍。为支持可复现性及流式虚拟化身生成领域的进一步研究,我们公开了两个模型的权重,以及包含 3 万个合成视频及其预计算教师轨迹的数据集。
更新时间: 2026-11-19 18:17:38
领域: cs.CV,cs.AI
LLM GerryMandering: Separating Interactions from Additive Effects in LLM Audits
Intersectional bias arises when a model treats people who hold several marginalised identities at once differently from what their separate identities would predict. Auditing such intersectional subgroups remains a challenge: their number grows quadratically, and there is no agreed baseline for what independent attributes would predict. Without such a baseline, many existing audits flag a subgroup when it exceeds each attribute alone, a condition that attributes acting independently already satisfy. We test this standard criterion on 150 synthetic datasets built with no interaction. With the shuffle null, it flags 66.1 false subgroups per dataset on average, and at least one in every dataset. When we plant interactions of known size into these datasets, a repaired null lets the criterion recover only 32% of them. We introduce ADDIS (Additive Intersectional Screen), which fits an additive model over all attributes, scores each subgroup by its Additive Residual Distance (ARD) from that model's prediction, and tests it against a Freedman-Lane null. On our synthetic benchmark, ADDIS flags 0.09 false subgroups per dataset and recovers 84% of the same planted interactions. We then build IndiPersona, 10,000 synthetic Indian personas with six identity attributes, and audit 13 open language models. The standard criterion flags 7.1% of the 738 tested subgroups on average; ADDIS flags 3.0%. Gender identity crossed with sexual orientation is the largest pairing in every model, and counterfactual personas confirm it and additionally reveal a caste x class interaction in all but one model that the observational test lacked the data to detect. Much of what audits report as intersectional bias can thus arise from independent single-attribute effects alone, yet a small core of interactions survives.
Updated: 2026-11-19 18:16:40
标题: LLM 操纵选区:在大语言模型审计中区分交互效应与加性效应
摘要: 交叉性偏差产生于:当一个人同时拥有多个边缘化身份时,模型对其的对待方式不同于根据这些身份分别推断出的结果。对这类交叉性子群体进行审计仍然是一项挑战:子群体数量呈二次增长,而且目前没有关于独立属性应产生何种预测结果的公认基线。缺乏这一基线时,许多现有审计会在某个子群体的表现超过各单一属性对应的表现时将其标记出来,而属性彼此独立时本身就会满足这一条件。 我们在150个不含交互作用的合成数据集上检验了这一标准判据。使用置换零假设时,该判据平均每个数据集标记出66.1个虚假子群体,并且每个数据集至少标记出一个。当我们向这些数据集中植入已知规模的交互作用时,经修正的零假设只能使该判据找回其中32%的交互作用。 我们提出ADDIS(Additive Intersectional Screen,加性交叉性筛查),它在所有属性上拟合加性模型,根据每个子群体相对于该模型预测值的加性残差距离(Additive Residual Distance,ARD)对其评分,并使用Freedman–Lane零假设对其进行检验。在我们的合成基准测试中,ADDIS平均每个数据集标记出0.09个虚假子群体,并找回84%的同类植入交互作用。 随后,我们构建了IndiPersona:包含10,000个合成印度人身份画像、具有六项身份属性的数据集,并对13个开放式语言模型进行审计。标准判据平均将738个受检子群体中的7.1%标记出来;ADDIS则标记出3.0%。在每个模型中,性别认同与性取向的交叉都是规模最大的属性组合;反事实身份画像证实了这一点,并进一步揭示出除一个模型外所有模型中都存在种姓与阶级之间的交互作用,而观察性测试因数据不足未能检测到这一交互作用。因此,审计报告中的许多交叉性偏差可能仅仅源于彼此独立的单属性效应,但仍有一小部分真正的交互作用能够经受检验。
更新时间: 2026-11-19 18:16:40
领域: cs.AI
Channel-Dependent State Space Model for Multivariate Time Series Forecasting
Multivariate time series forecasting (MTSF) is critical across many real-world domains. Existing deep learning approaches fall into two paradigms with distinct limitations: channel-independent (CI) methods ignore cross-variable dependencies and model only temporal dynamics, while channel-dependent (CD) methods consider both but typically rely on architectural compromises to mitigate overfitting and computational overhead. We therefore propose Chameleon, a CD state space model (SSM) that enables data-dependent, fine-grained interactions across variables while scaling linearly with the number of variables. By connecting selective SSMs with the Kalman filter, we adapt the latter's measurement-update formulation for cross-variable modeling while preserving the SSM backbone for robust temporal modeling. We further identify favorable inductive biases of GatedDeltaNet for time series, adapt it as our backbone, and improve generalization through additional techniques, including a previously unexplored stochastic perturbation of reversible instance normalization. On strongly dependent ODE and PEMS datasets, Chameleon achieves the best MSE and MAE across all settings, while its CI ablation and prior CD methods incur 61-178% higher MSE on average. Across 28 standard benchmark settings, Chameleon also achieves better MSE and MAE than each baseline in at least 27 and 22 cases, respectively. Training-time, FLOP, and peak-memory analyses on Traffic and ETT further demonstrate competitive efficiency and favorable scalability across different variable counts.
Updated: 2026-11-19 18:16:29
标题: 用于多变量时间序列预测的通道依赖状态空间模型
摘要: 多变量时间序列预测(MTSF)在许多现实应用领域中至关重要。现有的深度学习方法可分为两种具有不同局限性的范式:通道独立(CI)方法忽略变量之间的依赖关系,仅对时间动态进行建模;通道依赖(CD)方法则同时考虑两者,但通常依赖架构上的折中,以缓解过拟合和计算开销问题。为此,我们提出 Chameleon,一种通道依赖的状态空间模型(SSM),能够在变量之间实现依赖于数据的细粒度交互,同时将计算规模随变量数量线性扩展。通过将选择性状态空间模型与卡尔曼滤波器相连接,我们借鉴后者的测量更新形式进行跨变量建模,同时保留状态空间模型骨干,以实现稳健的时间建模。我们进一步发现,GatedDeltaNet 对时间序列具有良好的归纳偏置,并将其改造为我们的骨干网络;此外,我们通过包括一种此前尚未探索的可逆实例归一化随机扰动在内的额外技术,提升模型的泛化能力。在具有强依赖关系的 ODE 和 PEMS 数据集上,Chameleon 在所有设置下均取得了最佳的均方误差(MSE)和平均绝对误差(MAE);相比之下,其通道独立消融版本和以往的通道依赖方法的平均 MSE 高出 61%–178%。在 28 个标准基准设置中,Chameleon 的 MSE 和 MAE 分别至少在 27 个和 22 个设置中优于每个基线模型。在 Traffic 和 ETT 数据集上对训练时间、浮点运算次数(FLOP)及峰值内存的分析进一步表明,Chameleon 具有具有竞争力的效率,并且在不同变量数量下展现出良好的可扩展性。
更新时间: 2026-11-19 18:16:29
领域: cs.LG,cs.AI
PhoneWorld: From Real-App Trajectories to Dynamic and Verifiable Environments for Phone-Use Agents
Real applications provide the training setting closest to phone-agent deployment, but are difficult to reset, scale safely, and verify programmatically. Static screenshots and interaction trajectories preserve realistic evidence but cannot generate new experience. We introduce PhoneWorld, a trace-grounded framework that converts such evidence into runnable, resettable, and verifiable Android environments. PhoneWorld induces a usage-weighted interaction skeleton from observed pages, transitions, and state-changing operations; translates it into a behavior-grounded app specification; realizes the specification through an autonomous build--inspect--repair loop; and synthesizes executable tasks with programmatic verifiers. The resulting suite spans 34 consumer-facing apps across 16 domains and supports an audited online benchmark, verified trajectory generation, and online RL through common reset and verification interfaces. Evaluations with diverse general and open-source GUI agents show that PhoneWorld supports reliable end-to-end online interaction and exposes capabilities complementary to AndroidWorld. Controlled SFT experiments further show that PhoneWorld trajectories complement AndroidWorld supervision, transfer across online and offline benchmarks, and become more effective as data volume and app coverage increase. Under a matched RL budget, combining PhoneWorld mock-app rollouts with real-app rollouts improves performance over real-app RL alone on both real-phone tasks and AndroidWorld. Together, these results demonstrate that trace-grounded executable abstraction can bridge realistic mobile behavior and scalable agent learning, turning limited real-app evidence into a growing supply of controllable and verifiable environments for training and evaluation.
Updated: 2026-11-19 18:16:20
标题: PhoneWorld:从真实应用操作轨迹到面向手机使用智能体的动态可验证环境
摘要: 真实应用提供了最接近手机智能体部署场景的训练环境,但难以重置、安全扩展并以程序方式进行验证。静态截图和交互轨迹保留了真实的证据,却无法生成新的经验。我们提出 PhoneWorld,这是一种以轨迹为基础的框架,可将此类证据转化为可运行、可重置且可验证的 Android 环境。PhoneWorld 根据观测到的页面、转换和状态变更操作,生成按使用频率加权的交互骨架;将其转译为以行为为基础的应用规范;通过自主的“构建—检查—修复”循环实现该规范;并合成带有程序化验证器的可执行任务。最终形成的套件涵盖 16 个领域中的 34 款面向消费者的应用,并通过统一的重置和验证接口支持经过审计的在线基准测试、经验证的轨迹生成以及在线强化学习。对多种通用 GUI 智能体和开源 GUI 智能体的评估表明,PhoneWorld 支持可靠的端到端在线交互,并展现出与 AndroidWorld 互补的能力。受控的监督微调实验进一步表明,PhoneWorld 轨迹能够补充 AndroidWorld 的监督信号,在在线和离线基准之间实现迁移,并且随着数据量和应用覆盖范围的增加而变得更加有效。在匹配的强化学习预算下,将 PhoneWorld 模拟应用的交互展开与真实应用的交互展开相结合,相较于仅使用真实应用进行强化学习,在真实手机任务和 AndroidWorld 上均能获得更好的性能。总体而言,这些结果证明,以轨迹为基础的可执行抽象能够连接真实的移动行为与可扩展的智能体学习,将有限的真实应用证据转化为不断增长的、可控且可验证的环境资源,用于训练和评估。
更新时间: 2026-11-19 18:16:20
领域: cs.CL,cs.AI,cs.LG
MINTEval: Evaluating Memory under Multi-Target Interference in Long-Horizon Agent Systems
Real-world agents operate over long and evolving horizons, where information is repeatedly updated and may interfere across memories, requiring accurate recall and aggregated reasoning over multiple pieces of information. However, existing benchmarks focus on static, independent recall and fail to capture these dynamic interactions between evolving memories. In this paper, we study how current memory-augmented agents perform in realistic, interference-heavy, long-horizon settings across diverse domains and question types. We introduce MINTEval (Long-Horizon Memory under INTerference Evaluation), a benchmark featuring (1) long, highly interconnected contexts with frequently updated information that induces substantial interference, (2) diverse domains (state tracking, multi-turn dialogue, Wikipedia revisions, and GitHub commits), enabling evaluation of domain generalization, and (3) diverse question types that assess robustness to interference, including (i) single-target recall tasks requiring retrieval of a specific target from long contexts, and (ii) multi-target aggregation tasks requiring reasoning over multiple relevant pieces of information. Overall, MINTEval has 15.6k question-answering pairs over long-horizon contexts averaging 138.8k tokens and extending up to 1.8M tokens per instance. We evaluate 7 representative systems, including vanilla long-context LLMs, RAG, and memory-augmented agent frameworks. Across all systems, we observe consistently low performance (avg. 27.9% accuracy), especially on questions requiring aggregated reasoning over multiple pieces of evidence. Our analysis shows that performance is primarily limited by retrieval and memory construction. Furthermore, current memory systems struggle to recall and reason over earlier facts that are revised or interfered with by subsequent context, with accuracy degrading as the number of intervening updates increases.
Updated: 2026-11-19 18:16:11
标题: MINTEval:长时域智能体系统中多目标干扰下的记忆评估
摘要: 现实世界中的智能体运行在漫长且不断演化的时间跨度上,信息会被反复更新,并可能在不同记忆之间产生干扰,因此需要准确回忆信息,并对多个信息片段进行整合推理。然而,现有基准主要关注静态且相互独立的回忆任务,无法捕捉不断演化的记忆之间的动态交互。在本文中,我们研究了当前记忆增强型智能体在不同领域和问题类型下,面对真实、干扰密集且时间跨度很长的场景时的表现。我们提出了 MINTEval(Long-Horizon Memory under INTerference Evaluation,干扰条件下的长时程记忆评测),这是一个基准,包含:(1)信息频繁更新、相互高度关联且会造成显著干扰的长篇上下文;(2)多样化的领域,包括状态跟踪、多轮对话、维基百科修订和 GitHub 提交,从而能够评估领域泛化能力;(3)多样化的问题类型,用于评估模型对干扰的鲁棒性,包括:(i)单目标回忆任务,要求从长上下文中检索特定目标;(ii)多目标聚合任务,要求对多个相关信息片段进行推理。总体而言,MINTEval 包含 15,600 个问答对,基于长时程上下文构建,上下文平均长度为 138,800 个词元,单个实例最长可达 180 万个词元。我们评估了 7 种具有代表性的系统,包括原生长上下文大语言模型、检索增强生成系统以及记忆增强型智能体框架。我们发现,所有系统的表现都持续偏低,平均准确率仅为 27.9%,尤其是在需要对多个证据片段进行整合推理的问题上。分析表明,性能主要受检索和记忆构建能力的限制。此外,当前的记忆系统难以回忆和推理那些在较早阶段出现、但随后被后续上下文修订或干扰的事实;随着中间更新次数增加,准确率会逐渐下降。
更新时间: 2026-11-19 18:16:11
领域: cs.CL,cs.AI
Composable Driving Style for End-to-End Autonomous Driving
End-to-end driving policies can achieve strong task performance while offering limited control over their driving style. Driving style describes how a vehicle accelerates, brakes, and maintains distance. Policies trained without explicit preference conditioning lack a direct mechanism for adjusting these behaviors at inference. We propose YOUDrive, a vision--language--action planner for continuous and composable driving-style control. Each teacher's behavior is distilled into a task vector, a learned parameter update that induces a style direction in the planner's representation. These directions can be scaled and combined at inference without retraining the backbone. Conditioned on these directions, a flow-matching decoder models a multimodal trajectory distribution and generates kinematically feasible motion alternatives. We introduce the Style Alignment Score (SAS) to describe human-referenced kinematic behavior after safety and task gating. On NAVSIM navtest, a single coefficient monotonically controls assertiveness across six teacher-derived personas, while PDMS remains above 0.90 across the tested individual and blended configurations, reaching 0.954. Further analyses reveal systematic policy-specific kinematics after controlling for scene context, whereas the evaluated discrete style labels provide limited additional explanatory power. Code, checkpoints, and the metric will be released.
Updated: 2026-11-19 18:12:04
标题: 端到端自动驾驶的可组合驾驶风格
摘要: 端到端驾驶策略能够实现出色的任务性能,同时对其驾驶风格的控制能力有限。驾驶风格描述车辆如何加速、制动以及保持车距。未经过显式偏好条件控制训练的策略,在推理阶段缺乏直接调节这些行为的机制。我们提出 YOUDrive,一种用于连续且可组合驾驶风格控制的视觉—语言—动作规划器。每位教师的行为都被蒸馏为一个任务向量,即一种能够在规划器表征中诱导出风格方向的学习型参数更新。在推理阶段,无需重新训练骨干网络,即可对这些方向进行缩放和组合。在这些方向的条件控制下,流匹配解码器对多模态轨迹分布进行建模,并生成满足运动学约束的多种运动方案。我们提出风格对齐得分(Style Alignment Score,SAS),用于在经过安全性和任务门控后,描述与人类参照相符的运动学行为。在 NAVSIM navtest 上,单个系数能够在六种由教师行为衍生的人格风格之间单调控制驾驶进取性,同时在测试的单独配置和混合配置中,PDMS 始终保持在 0.90 以上,最高达到 0.954。进一步分析表明,在控制场景背景后,不同策略仍呈现出系统性的特定运动学特征,而所评估的离散风格标签只能提供有限的额外解释力。代码、检查点和该指标将公开发布。
更新时间: 2026-11-19 18:12:04
领域: cs.CV,cs.AI,cs.RO
Cost-Aware Agentic Feature Optimization System for Fleet-Scale Ranking Models
Large Web platforms operate large fleets of ranking models, each selecting features from a shared pool of tens of thousands. We present an end-to-end agentic system that optimizes features across the fleet under resource constraints shared across models and those set per model, such as feature pipeline cost and serving throughput (QPS), respectively. In this system, LLM agents propose hypotheses, and deterministic tools execute experiments and verify them. For each model, an LLM generates and shortlists cross features from a combinatorial candidate space, and all features are then ranked by several importance methods. Feature blending mixes these rankings into a single selection, using Pareto fronts across tasks for multi-task models. An LLM Researcher agent then tunes the feature selection in 10--25 asynchronous trials under resource caps, and a trimming step keeps the pipeline cost within budget. Across production models, the system improves normalized entropy by 0.31% on average within each model's budget, and the trimming step cuts pipeline cost by 2.3% with no regression beyond measurement noise. The optimized models were launched, and in online A/B tests they improved a primary online metric by 0.20%.
Updated: 2026-11-19 18:12:04
标题: 面向车队规模排序模型的成本感知型智能体特征优化系统
摘要: 大型 Web 平台通常运行着大量排序模型,每个模型都从包含数万种特征的共享池中选择特征。我们提出了一种端到端的智能体系统,在模型之间共享的资源约束以及模型级别设定的资源约束下,对整个模型集群中的特征进行优化;前者包括特征流水线成本,后者包括服务吞吐量(QPS)等。在该系统中,大语言模型智能体提出假设,而确定性工具负责执行实验并验证假设。对于每个模型,大语言模型从组合式候选空间中生成并筛选交叉特征,随后使用多种重要性方法对所有特征进行排序。特征融合将这些排序结果混合为一个统一的选择结果;对于多任务模型,则利用跨任务的帕累托前沿进行融合。随后,大语言模型研究员智能体在资源上限下,通过 10—25 次异步试验进一步调优特征选择,最后通过裁剪步骤将流水线成本控制在预算之内。在生产环境中的各个模型上,该系统在每个模型的预算范围内,平均将归一化熵提升了 0.31%;在没有超出测量噪声范围的性能回退的情况下,裁剪步骤将流水线成本降低了 2.3%。经过优化的模型已投入使用,并且在线 A/B 测试表明,其主要线上指标提升了 0.20%。
更新时间: 2026-11-19 18:12:04
领域: cs.IR,cs.AI,cs.LG
Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise
This paper establishes, to our knowledge, the first almost sure convergence rate and the first maximal concentration bound with sub-Weibull tails for general contractive stochastic approximation algorithms with Markovian noise. As a corollary, we also obtain convergence rates in $L^p$. Key to our successes is a novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing (instead of constant) length. Applications yield the first almost sure convergence rate for $Q$-learning without count-based learning rates and the first maximal concentration bound for off-policy temporal difference learning, both with Markovian samples.
Updated: 2026-11-19 18:10:56
标题: 马尔可夫噪声下随机逼近与强化学习的几乎必然收敛速率及集中性
摘要: 据我们所知,本文首次为带有马尔可夫噪声的一般收缩型随机逼近算法建立了几乎必然收敛速率,以及具有子 Weibull 尾部的首个最大浓度界。作为推论,我们还得到了 \(L^p\) 意义下的收敛速率。我们取得这些成果的关键,在于采用了一种新颖的随机逼近算法均值常微分方程离散化方法:使用长度逐渐减小而非固定长度的区间。应用该方法,我们首次获得了不依赖基于计数的学习率的 \(Q\)-learning 几乎必然收敛速率,以及带有马尔可夫样本的离策略时序差分学习的首个最大浓度界。
更新时间: 2026-11-19 18:10:56
领域: cs.LG,math.OC,stat.ML
The Montparnasse Algorithm for RNA Design
Inverse RNA Folding consists of finding a nucleotide sequence that folds into a predefined secondary structure. It is useful for synthetic biology, medicine, and nanotechnology. We propose Montparnasse, a Monte Carlo search framework based on Generalized Nested Rollout Policy Adaptation, augmented with a structural prior derived from the energy model, slow and long adaptation at level 1, a lexicographic multicriteria evaluation, a local repair of the pairs the predicted folding gets wrong, and a fleet of parallel workers coupled through a shared beam whose diversity is maintained on the faults the candidates make rather than on the candidates themselves. On the Eterna100 V1 benchmark, with both solvers folding through the same ViennaRNA 1.8.5 library under the Turner 1999 model, with 100 parallel workers and a budget of 30 minutes per puzzle, Montparnasse solves a median of 96 of the 100 puzzles against a median of 90 for DesiRNA, the previous state of the art, each figure taken over five passes. It is faster on 88 of the 90 puzzles that both solve, with a median solving time of 0.9 s against 5.6 s, and it solves 55 puzzles within the first second. The one puzzle no pass reaches is solved under the same model with a longer budget, so every Eterna100 V1 target is solved by Montparnasse.
Updated: 2026-11-19 18:10:48
标题: 用于RNA设计的蒙帕纳斯算法
摘要: RNA 逆折叠旨在寻找能够折叠成预定义二级结构的核苷酸序列。这项技术对合成生物学、医学和纳米技术具有重要意义。我们提出了 Montparnasse,这是一种基于广义嵌套式 rollout 策略自适应的蒙特卡洛搜索框架,并结合了源自能量模型的结构先验、在第 1 层进行缓慢且长期的自适应、词典序多准则评估、针对预测折叠错误配对的局部修复,以及由共享候选束连接的并行工作者集群;其中,候选束的多样性依据候选序列所产生的错误而非候选序列本身来维持。在 Eterna100 V1 基准测试中,两种求解器均使用相同的 ViennaRNA 1.8.5 库,并采用 Turner 1999 模型进行折叠;在使用 100 个并行工作者、每个谜题预算 30 分钟的条件下,Montparnasse 在五次运行中每次解决的谜题数量中位数为 96 个,而此前的最先进方法 DesiRNA 的中位数为 90 个。对于两者均能解决的 90 个谜题中的 88 个,Montparnasse 的速度更快:求解时间中位数为 0.9 秒,而 DesiRNA 为 5.6 秒;其中 55 个谜题可在第一秒内解决。唯一一个在五次运行中均未达到的谜题,在相同模型下通过延长时间预算得以解决,因此 Montparnasse 能够解决 Eterna100 V1 的全部目标。
更新时间: 2026-11-19 18:10:48
领域: q-bio.BM,cs.AI
GroundingPI: A Grounding Foundation Model towards Physical Intelligence with Visual Primitives
Precise grounding matters. It specifies which object is the target and where that object is, even in clutter and for tiny objects, and it has to be fast enough for closed-loop control. Yet vision-language-action (VLA) and world-action models (WAMs) take perception from general-purpose vision-language and video-generation backbones, which still fail in these settings. We introduce GroundingPI, a 4B grounding foundation model that generates points and boxes as quantized coordinates in a shared vocabulary. Training combines multimodal and spatial pretraining, supervised fine-tuning, and reinforcement learning with GRPO, using supervision from public datasets and dedicated data engines. Against 44 baselines across 34 grounding benchmarks spanning 11 perceptual capabilities, GroundingPI establishes a new state of the art, averaging 73.68%, above the larger GPT-6 Astra (71.54%). As a downstream visual backbone, GroundingPI improves performance on robotic manipulation and autonomous driving. Across RoboTwin 2.0 and RoboCasa-GR1, it outperforms all evaluated backbones in all four out-of-distribution settings, with relative gains of up to 24.8% over the strongest baseline. On RoboCasa-GR1, GroundingPI trained with 50% of the demonstrations outperforms those baselines trained with 75%. Its mean open-loop L2 error on nuScenes is 0.296 m. We systematically analyze GroundingPI's pretraining in scale and data composition. Grounding quality and downstream manipulation improve with pretraining scale, with generalization tracking perceptual gains most closely. Analyzing the data recipe across these 11 perceptual capabilities shows dense grounding's substantial benefits for both, and OCR's potential as a catalyst for perceptual learning. These results support grounding as a perceptual foundation, and dedicated perceptual pretraining as a promising direction for foundation models of physical intelligence.
Updated: 2026-11-19 18:08:27
标题: GroundingPI:面向具身智能、基于视觉基元的基础模型
摘要: 精准定位至关重要。它不仅要明确目标物体是哪一个,还要确定该物体所在的位置,即使面对杂乱场景和微小物体也应如此;同时,定位速度还必须足够快,以满足闭环控制的要求。然而,视觉-语言-动作(VLA)模型和世界-动作模型(WAM)依赖通用视觉-语言模型和视频生成骨干网络来完成感知,而这些模型在上述场景中仍然表现不佳。我们提出了 GroundingPI,这是一种 40 亿参数的定位基础模型,能够在共享词表中以量化坐标的形式生成点和边界框。其训练结合了多模态与空间预训练、有监督微调,以及使用 GRPO 的强化学习,并采用公开数据集和专门的数据引擎提供监督信号。 在涵盖 11 种感知能力的 34 个定位基准、与 44 个基线模型的比较中,GroundingPI 取得了新的最佳性能,平均得分为 73.68%,超过了规模更大的 GPT-6 Astra(71.54%)。作为下游视觉骨干网络,GroundingPI 提升了机器人操作和自动驾驶任务的性能。在 RoboTwin 2.0 和 RoboCasa-GR1 上,它在全部四种分布外设置中均优于所有参与评测的骨干网络,相较最强基线的相对提升最高达 24.8%。在 RoboCasa-GR1 上,仅使用 50% 示范数据训练的 GroundingPI,性能便超过了使用 75% 示范数据训练的基线模型。在 nuScenes 上,其平均开环 L2 误差为 0.296 米。 我们系统分析了 GroundingPI 预训练的规模和数据构成。随着预训练规模扩大,定位质量和下游操作性能均有所提升,其中泛化能力与感知性能的提升最为 closely 相关。对涵盖这 11 种感知能力的数据配方进行分析表明,密集定位对二者都具有显著益处,而 OCR 可能成为促进感知学习的催化因素。这些结果表明,定位可以作为感知基础,而专门的感知预训练则是构建物理智能基础模型的一条有前景的方向。
更新时间: 2026-11-19 18:08:27
领域: cs.CV,cs.AI,cs.LG,cs.RO
Backtracking Agent Applications Security Incidents
Agent applications are increasingly deployed, yet agent-specific attacks pose real threats to them. Upon a security incident, organizations backtrack to identify the CEP (compromise entry point), remediate the damage, and prevent its recurrence. The main artifacts available for backtracking are trajectory logs, which record agent functionalities, and source code; app(lication)-specific function call logs are often fairly limited. However, trajectory logs are at the agent functionality abstraction layer, while the CEP candidates are function calls at the app code execution layer. Due to this semantic gap, the analyst needs to manually inspect the relevant code for each CEP candidate to infer its corresponding agent functionality. In this work, we present Origin, a backtracking tool for the analyst to submit a small number of queries to identify CEPs that existing tools cannot provide. Our approach poses two challenges: (1) define the intermediate abstraction that captures the mapping relationships between the two semantic layers; (2) determine the region-to-variable mapping for constructing the cross-layer graph defined in the intermediate abstraction. Each region is a specific group of agent functionalities. Origin addresses the challenges by (1) the cross-layer dependency graph (CLDG) that connects region-inferred functions at the semantic level to the variables in the low-level taint propagation subgraph, plus the associated query language, and (2) the region inference algorithm. Case studies on five popular agent applications across eight attack incidents show that an analyst using Origin correctly identifies all the CEPs.
Updated: 2026-11-19 18:01:28
标题: 回溯代理应用安全事件
摘要: 代理应用正日益广泛地投入使用,但针对代理的攻击也对其构成了真实威胁。发生安全事件后,组织通常会回溯以确定入侵点(CEP),修复造成的损害,并防止事件再次发生。可用于回溯的主要工件是轨迹日志和源代码:轨迹日志记录代理的功能,而应用程序特定的函数调用日志往往相当有限。然而,轨迹日志处于代理功能抽象层,而CEP候选项则是应用程序代码执行层的函数调用。由于存在这种语义鸿沟,分析人员需要针对每个CEP候选项手动检查相关代码,以推断其对应的代理功能。 在本工作中,我们提出了Origin,一种回溯工具,使分析人员能够通过提交少量查询,识别现有工具无法提供的CEP。我们的方法面临两项挑战:(1)定义一种能够描述这两个语义层之间映射关系的中间抽象;(2)确定区域到变量的映射关系,以构建中间抽象所定义的跨层图。每个区域都是一组特定的代理功能。Origin通过以下方式应对这些挑战:(1)构建跨层依赖图(CLDG),在语义层将由区域推断出的函数与低层污点传播子图中的变量连接起来,并提供相应的查询语言;(2)设计区域推断算法。在针对五个流行代理应用和八起攻击事件开展的案例研究中,使用Origin的分析人员成功识别出了全部CEP。
更新时间: 2026-11-19 18:01:28
领域: cs.CR,cs.AI,cs.SE
Deterministic Temporal Embedding for Calcium Imaging Trace Extraction
Reliable extraction of calcium-dependent fluorescence traces in calcium imaging sequences requires identifying pixels whose fluorescence intensity reflects the same underlying cellular activity. We present a deterministic temporal embedding framework that maps pixel-wise fluorescence traces to a low-dimensional representation in which temporally coherent sources form spatially coherent regions. Starting from a fuzzy-neighborhood graph and spectral initialization, we optimize a class-balanced cross-entropy objective using exact sparse attraction and a deterministic particle-mesh decomposition of the dense repulsive interaction with sparse edge compensation, avoiding stochastic negative sampling. The resulting latent representation is spatially decoded into reliable source supports for trace extraction without imposing an explicit cellular shape prior. Experiments on synthetic and in vivo two-photon calcium imaging data demonstrate robust recovery of irregular and spatially touching sources together with efficient deterministic embedding optimization.
Updated: 2026-11-19 18:00:35
标题: 用于钙成像信号提取的确定性时间嵌入
摘要: 在钙成像序列中可靠地提取钙依赖性荧光轨迹,需要识别出其荧光强度反映相同潜在细胞活动的像素。我们提出了一种确定性时间嵌入框架,将逐像素荧光轨迹映射到低维表示空间,使时间上具有一致性的信号源形成空间上连贯的区域。该方法以模糊邻域图和谱初始化为起点,通过精确的稀疏吸引项以及结合稀疏边补偿的确定性粒子—网格分解,对稠密排斥相互作用进行优化,从而最小化类别均衡的交叉熵目标,并避免随机负采样。随后,利用空间解码将所得潜在表示转换为可靠的信号源支持区域,用于提取荧光轨迹,而无需施加显式的细胞形状先验。在合成数据和活体双光子钙成像数据上的实验表明,该方法能够稳健地恢复不规则且彼此空间接触的信号源,同时实现高效的确定性嵌入优化。
更新时间: 2026-11-19 18:00:35
领域: cs.CV,cs.LG,eess.IV
The Window Lever: Longer Observation Windows Outweigh the Observed Effects of Data, Capacity, and Architecture in Customer Behavior Forecasting
In our experiments on long-horizon customer-behavior forecasting, a longer observation window outweighed the observed effects of more data, more capacity and newer architectures. The window is the weeks of history a model sees before the week it forecasts from. Going from an 8- to a 16-week window adds a raw +0.070 to 0.107 log-space $R^2$ in every family at 1M. Matched test cohorts, which score the same customer-weeks at every window, show this raw comparison understates the gain in every family they cover. The direction holds on five public datasets, four spanning over a year (ridge and our transformer on all five). On our internal data, longer windows admit up to 10% more and colder training customers, which matching does not fix. Our design does not separate window length from calendar coverage, because every test anchor (the week a forecast is made from) falls in one eight-week band. On training-period anchors, the weekly ridge probe's gain persists outside the holiday season, keeping about 72% of it. We therefore report a robust positive association with longer windows and do not identify the magnitude of a calendar-independent history effect. Of four internally registered predictions, the only fully blind one failed. An activity-mixture model predicted +0.014 from 24 to 32 weeks; the weekly-aggregate probe returned -0.0004. For the sequence families, the other three levers are about an order of magnitude smaller, bounded and unresolved. Their observed effects are at most 0.006 between the nominal 1M and 10M tiers and 0.0052 among five sequence families at 16 weeks with clocks as built, both single-seed on the full test split, and 0.006 for capacity on three-seed means. These are observed intervals, not equivalence bounds. Our claim is the order-of-magnitude contrast between the window and those bounds. A team building on this class of data should start by lengthening the window.
Updated: 2026-11-19 18:00:11
标题: 窗口杠杆:在客户行为预测中,更长的观测窗口比数据、容量和架构的影响更为显著
摘要: 在我们关于长时段客户行为预测的实验中,更长的观测窗口所带来的影响超过了更多数据、更大模型容量和更新架构的影响。这里的窗口是指模型在预测某一周之前所能看到的历史记录周数。在 100 万规模下,将窗口从 8 周延长至 16 周,会使所有模型系列的对数空间 \(R^2\) 原始提升 0.070 至 0.107。采用匹配测试队列后,即在每个窗口下都对相同的客户—周样本进行评分,结果显示,在所覆盖的每个模型系列中,这种原始比较反而低估了窗口延长带来的收益。 这一趋势在五个公开数据集上均成立,其中四个数据集覆盖时间超过一年(岭回归模型和我们的 Transformer 模型在全部五个数据集上进行了测试)。在我们的内部数据中,更长的窗口最多能够纳入多 10% 的训练客户,而且这些客户的历史记录更少;匹配处理无法消除这一点。我们的设计无法将窗口长度与日历覆盖范围分离开来,因为每个测试锚点(即进行预测所依据的那一周)都落在同一个八周区间内。在训练期锚点上,按周进行的岭回归探针模型所获得的增益在节假日季之外仍然存在,保留了约 72% 的增益。因此,我们报告了窗口更长与性能提升之间稳健的正相关,但无法确定与日历因素无关的历史窗口效应的幅度。 我们预先在内部登记的四项预测中,唯一一项完全盲测的预测失败了。一个活动混合模型预测窗口从 24 周延长至 32 周将带来 +0.014 的提升;按周汇总的探针模型则得到 -0.0004。对于序列模型系列而言,另外三个因素的影响大约小一个数量级,且其范围有限、结论尚未确定。在名义上的 100 万和 1000 万规模之间,这些因素的观测影响至多为 0.006;在 16 周窗口、按现有设置使用时钟特征的五个序列模型系列之间,观测影响至多为 0.0052;在三个随机种子均值下,模型容量的影响为 0.006。这些是观测到的区间,而不是等效性界限。我们的主张是,窗口效应与这些界限之间存在一个数量级的差异。对于基于这类数据开展建模的团队,首先应当延长观测窗口。
更新时间: 2026-11-19 18:00:11
领域: cs.LG,cs.IR
Simple Private Noisy SGD is Minimax-Optimal under Population Strong Convexity
Stochastic gradient descent (SGD) is at the center of modern machine learning and is known to be statistically minimax-optimal in many regression settings, e.g., for convex Generalized Linear Models (GLMs). Yet, it is unknown whether its simplest differentially private Noisy SGD counterpart fulfills similar favorable guarantees even on strongly convex losses. We resolve this question affirmatively. We upper bound the parameter estimation error for a single pass of Noisy SGD with a fixed stepsize schedule and constant batch sizes on smooth and strongly convex Lipschitz losses over a compact convex domain under Renyi DP. Specialized to strongly convex GLMs, our error bounds match minimax lower bounds we derive based on the Score Attack framework. In particular, this provides the first minimax-optimal rate for Noisy SGD in private logistic regression, avoiding poly-logarithmic terms present in existing results. Our analysis is versatile as it relies on standard convex analysis and establishes the same rates in expectation and with high probability.
Updated: 2026-11-19 17:58:51
标题: 简单的私有噪声随机梯度下降在总体强凸性下达到了极小极大最优性
摘要: 随机梯度下降(SGD)是现代机器学习的核心方法,并且已知在许多回归场景中具有统计意义上的极小极大最优性,例如凸广义线性模型(GLM)。然而,即使对于强凸损失,最简单的差分隐私噪声随机梯度下降(Noisy SGD)是否也具备类似的优良保证,仍是一个未知问题。我们对此给出了肯定的回答。在 Rényi 差分隐私(RDP)框架下,针对紧致凸域上的光滑、强凸且 Lipschitz 连续的损失函数,我们对采用固定步长调度和恒定批量大小、进行单次遍历的 Noisy SGD 的参数估计误差给出了上界。具体到强凸广义线性模型时,我们的误差界与基于 Score Attack 框架推导出的极小极大下界相匹配。特别地,这为私有逻辑回归中的 Noisy SGD 首次提供了极小极大最优速率,同时避免了现有结果中的多对数项。我们的分析具有较强的通用性,因为它依赖于标准凸分析,并且在期望意义下和高概率意义下均得到了相同的速率。
更新时间: 2026-11-19 17:58:51
领域: math.ST,cs.LG,stat.ML
Hybrid Retrieval for Government Scheme Search in English and Marathi
Retrieving government schemes requires matching citizens' information needs to formal administrative descriptions, often across languages and terminology. We present a bilingual search system for Maharashtra government schemes and public services that combines BM25 retrieval with sentence-embedding similarity through equal-weight score fusion. The system indexes aligned English-Marathi scheme descriptions and supports multilingual, Marathi-focused, and translation-mediated semantic configurations. Evaluation on manually curated bilingual queries compares BM25, dense retrieval, and hybrid retrieval using IndicSBERT and MahaSBERT. BM25 provides a strong baseline with a mean reciprocal rank (MRR) of 0.864. Hybrid retrieval increases MRR to 0.872 with IndicSBERT and 0.879 with MahaSBERT, whereas the corresponding dense-only systems achieve 0.663 and 0.655. MahaSBERT-based fusion also increases precision from 0.781 to 0.808 while matching BM25 recall at 0.946. These results support the complementary use of lexical and semantic signals in this collection, while showing that improvements over a strong lexical baseline are modest and metric-dependent. The study provides an application-focused analysis of hybrid retrieval for bilingual public-service information access.
Updated: 2026-11-19 17:58:39
标题: 英马拉地语政府计划搜索的混合检索
摘要: 检索政府计划需要将公民的信息需求与正式的行政描述进行匹配,这一过程通常涉及不同语言和术语。我们提出了一个面向马哈拉施特拉邦政府计划和公共服务的双语搜索系统,该系统将 BM25 检索与句子嵌入相似度相结合,并通过等权重分数融合实现综合排序。系统对经过对齐的英语—马拉地语计划描述进行索引,并支持多语种、以马拉地语为重点以及基于翻译的语义配置。我们在人工整理的双语查询集上开展评估,使用 IndicSBERT 和 MahaSBERT,对 BM25、稠密检索和混合检索进行了比较。BM25 提供了较强的基线,其平均倒数排名(MRR)为 0.864。混合检索使使用 IndicSBERT 时的 MRR 提升至 0.872,使用 MahaSBERT 时提升至 0.879;相应的仅稠密检索系统的 MRR 分别为 0.663 和 0.655。基于 MahaSBERT 的融合还将精确率从 0.781 提高至 0.808,同时保持了与 BM25 相同的召回率 0.946。这些结果支持在该数据集上互补使用词汇信号和语义信号,同时表明,相较于强大的词汇检索基线,性能提升幅度有限且取决于所采用的评价指标。本研究针对双语公共服务信息获取,对混合检索进行了以应用为重点的分析。
更新时间: 2026-11-19 17:58:39
领域: cs.LG,cs.CL
GLiDE: A Fast, Calibrated Decision Model Distilled from Reasoning Teachers
Decision models enable fast, confidence-aware decisions by scoring candidate answers in a single forward pass, without generating text or intermediate reasoning. Yet reasoning can substantially improve decision quality, raising the question of whether its benefits can be retained without the cost of generating it. We investigate this question with \textbf{GLiDE}, a family of decision models spanning 0.4B to 27B parameters. Building on Qwen hybrid language models, GLiDE enables bidirectional interactions between the context, question, and candidate answers by removing causal masking from full-attention layers. To transfer reasoning capabilities into single-pass inference, we combine soft-target distillation from multiple teachers, including a reasoning model, with progressive post-training on diverse decision tasks. We further explore parameter-free recurrent depth to increase inference-time computation without generating tokens. Across five model sizes, GLiDE lies on the performance--parameter Pareto frontier of the Hugging Face \DI{}, with each model outperforming evaluated alternatives of equal or smaller size. \dmtwo{} (27B) achieves a hidden-set score of 71.52, with an expected calibration error of 2.0\% and a median latency of 92.9\,ms on a single GPU. Further checkpoint averaging and parameter-free recurrent depth yield GLiDE~27B, which reaches 73.37 with an expected calibration error of 2.1\%.
Updated: 2026-11-19 17:56:44
标题: GLiDE:从推理教师模型中蒸馏出的快速校准决策模型
摘要: 决策模型通过在单次前向传播中对候选答案进行评分,在不生成文本或中间推理过程的情况下,实现快速且具备置信度感知的决策。然而,推理能够显著提升决策质量,这引出了一个问题:能否在不承担生成推理过程成本的前提下保留其益处。我们使用 \textbf{GLiDE} 对这一问题展开研究。这是一系列参数规模从 0.4B 到 27B 的决策模型。 GLiDE 基于 Qwen 混合语言模型构建,通过移除全注意力层中的因果遮罩,使上下文、问题与候选答案之间能够进行双向交互。为了将推理能力迁移到单次前向推理中,我们结合了来自多位教师模型(包括推理模型)的软目标蒸馏,以及在多样化决策任务上的渐进式后训练。我们还进一步探索了无参数循环深度,以便在不生成词元的情况下增加推理时的计算量。 在五种模型规模上,GLiDE 均位于 Hugging Face \DI{} 的性能—参数量帕累托前沿上,其中每个模型的表现都超过了经过评测的同等或更小规模的替代模型。\dmtwo{}(27B)在隐藏测试集上取得了 71.52 的分数,预期校准误差为 2.0\%,在单个 GPU 上的中位延迟为 92.9\,ms。进一步进行检查点平均和无参数循环深度后,GLiDE~27B 的得分达到 73.37,预期校准误差为 2.1\%。
更新时间: 2026-11-19 17:56:44
领域: cs.AI,cs.CL
Visual Attribution Limits and Graded Provenance Auditing in Commercial Video-Generation APIs
Commercial video-generation APIs bill by model and tier, while intermediaries could substitute cheaper models, lower tiers, or cached clips. What can a delivered file establish about its origin? We combine measurements of passive attribution and cryptographic provenance into a graded audit. We test attribution probes and zero-shot detectors under re-encoding, downscaling, and frame-rate changes, and survey C2PA and GB 45438 metadata across 19 commercial endpoints. Only authenticated provenance supports accusations: tier contradictions or duplicate signed instances under fresh-generation contracts, excluding retries and idempotent returns. Unverifiable signed-endpoint deliveries trigger original-file demands under pass-through clauses; archive-reuse and delivery-parameter screens support review only. Six-model container and bitstream accuracy falls from 83.9% on raw files to 45.3% after uniform re-encoding, using different feature sets. Subsampling real references from 24 to 3 fps raises pooled D3 AUROC from 0.845 to 0.988. Only BytePlus authenticates tier claims under our pinned policy, including 187/187 audited deliveries across three Seedance tiers; tested remuxing and re-encoding leave processed Seedance files unverifiable. The audit identifies authenticated contradictions in 100/100 raw 720p signed tier-swap cases, with zero observed false flags on the tested honest pools.
Updated: 2026-11-19 17:56:06
标题: 商业视频生成 API 中的视觉归因局限与分级溯源审计
摘要: 商业视频生成 API 按模型和层级收费,而中间商可能用更便宜的模型、更低的层级或缓存片段替代。交付文件能够证明其来源的程度如何?我们将被动归因测量与加密溯源结合起来,构建了一套分级审计体系。我们在重新编码、降采样和帧率变化条件下测试归因探针与零样本检测器,并调查了 19 个商业端点中的 C2PA 和 GB 45438 元数据。只有经过认证的溯源信息才能支持指控:这包括在新生成合同下出现的层级矛盾或重复签名实例,但须排除重试和幂等返回。对于无法验证签名端点交付结果的情况,在直通条款下应要求提供原始文件;归档复用和交付参数筛查只能作为审查依据。使用不同特征集时,六模型容器与比特流识别准确率从原始文件上的 83.9% 降至统一重新编码后的 45.3%。将真实参考样本的帧率从 24 fps 降至 3 fps 后,汇总 D3 AUROC 从 0.845 提升至 0.988。在我们设定的固定策略下,只有 BytePlus 能够认证层级声明,其中包括对三个 Seedance 层级的 187/187 份交付结果进行审计;测试表明,重封装和重新编码会使处理后的 Seedance 文件无法验证。该审计在 100/100 个原始 720p 签名层级置换案例中识别出经过认证的矛盾,而在所测试的诚信样本池中未观察到任何误报。
更新时间: 2026-11-19 17:56:06
领域: cs.CR,cs.CV
GroundAnything: Reconciling Parallel Decoding with Precise Visual Grounding at Flash Speed
Autoregressive (AR) grounding models serialize spatial predictions, introducing sequential latency and imposing a causal order on output tokens. We view grounding as visual evidence extraction: objects, locations, and spatial relations are jointly constrained by the image and query, yet their dependencies do not imply an intrinsic left-to-right generation order. This distinction makes bidirectional diffusion a natural fit, allowing spatial hypotheses to emerge in parallel and be jointly refined through iterative denoising. We introduce GroundAnything, a 4B-parameter grounding foundation model that reconciles fast parallel decoding with precise localization through blockwise denoising. Training combines grounding pretraining from public datasets and dedicated data engines, direct AR-to-diffusion conversion with joint AR and diffusion objectives, supervised fine-tuning, and GRPO-based reinforcement post-training. Across 30 grounding benchmarks, our autoregressive variant, GroundAnything-VLM, establishes a new overall state of the art among similarly sized models at 72.42%, remaining competitive with GPT-6 Astra (71.35%). With entropy-guided decoding, GroundAnything also surpasses the prior state of the art at this scale, averaging 61.75% versus 53.32% for the fast MTP-based LocateAnything model. We further explore decoding strategies, showing that an optional self-speculative mode achieves a 4.51$\times$ speedup over the AR counterpart with a 0.74 percentage-point drop in COCO F1mIoU. Infrastructure experiments show that progressive inference optimizations translate parallel decoding into practical speedups. These gains support efficient visual grounding in latency-sensitive real-world systems.
Updated: 2026-11-19 17:55:07
标题: GroundAnything:以闪电般速度协调并行解码与精准视觉定位
摘要: 自回归(AR)定位模型将空间预测序列化,引入顺序延迟,并对输出词元施加因果顺序。我们将定位视为视觉证据提取:目标、位置和空间关系受到图像与查询的共同约束,但它们之间的依赖关系并不意味着存在内在的从左到右生成顺序。这一区别使双向扩散成为一种自然选择,因为它能够让空间假设并行生成,并通过迭代去噪进行联合优化。我们提出 GroundAnything,这是一种拥有 40 亿参数的定位基础模型,通过分块去噪,在快速并行解码与精确定位之间实现平衡。其训练过程结合了来自公开数据集和专用数据引擎的定位预训练、基于联合 AR 与扩散目标的直接 AR 到扩散转换、监督微调,以及基于 GRPO 的强化学习后训练。在 30 个定位基准测试中,我们的自回归变体 GroundAnything-VLM 以 72.42% 的成绩,在规模相近的模型中创下新的整体最先进水平,同时保持了与 GPT-6 Astra(71.35%)相当的竞争力。借助熵引导解码,GroundAnything 还超越了该规模模型此前的最先进水平,平均得分达到 61.75%,而采用快速 MTP 的 LocateAnything 模型为 53.32%。我们进一步探索了多种解码策略,结果表明,可选的自推测模式相较于 AR 对应版本实现了 4.51 倍加速,同时 COCO F1mIoU 仅下降 0.74 个百分点。基础设施实验表明,渐进式推理优化能够将并行解码转化为实际的速度提升。这些成果有助于在对延迟敏感的现实系统中实现高效的视觉定位。
更新时间: 2026-11-19 17:55:07
领域: cs.CV,cs.AI,cs.LG,cs.RO
Grid Cells as Spectral Successor Features: A Reusable Basis for Continual Reinforcement Learning
Continual reinforcement learning requires agents to adapt when the task changes while reusing what they know about the environment. Successor features separate dynamics from task-specific reward, but their effectiveness depends on the choice of base features. Taking the identification of entorhinal grid cells with eigenvectors of the successor representation as a design principle, we build this basis from eigenvectors of the transition matrix of a fixed reference policy. With such a basis, the successor features at a state-action pair are a linear combination of the base features at that same pair, which is not true in general, and the coefficients are known in closed form: each successor feature is its base feature multiplied by $θ_i = 1/(1-γλ_i)$, where $λ_i$ is its eigenvalue. The long-term return is thus predicted from the same features as the immediate reward, no successor-feature network or replay buffer is needed, and adapting to a new task reduces to a linear regression on the reward. The agent acts greedily on the action values of the reference policy, which is one step of policy improvement over it and suffices to reach a single goal. In a two-goal gridworld, with the uniform random walk as reference policy, whose eigenvectors are the low-frequency Laplacian eigenvectors, agents built this way maintain near-maximal return across every change of goal, whereas SimpleSF and DQN lose most of their return at each change.
Updated: 2026-11-19 17:54:04
标题: 作为谱继承特征的网格细胞:持续强化学习的可复用基底
摘要: 持续强化学习要求智能体在任务发生变化时进行适应,同时重新利用其对环境已有的知识。后继特征将环境动力学与任务特定的奖励分离开来,但其有效性取决于基础特征的选择。以将内嗅网格细胞识别为后继表示的特征向量这一设计原则为依据,我们利用固定参考策略的转移矩阵的特征向量构建这一基。采用这样的基后,状态—动作对处的后继特征可以表示为同一状态—动作对处基础特征的线性组合,而一般情况下并非如此;其系数还可以用闭式形式得到:每个后继特征都是其基础特征乘以 $θ_i = 1/(1-γλ_i)$,其中 $λ_i$ 是对应的特征值。因此,可以利用与即时奖励相同的特征预测长期回报,无需后继特征网络或经验回放缓冲区;适应新任务则简化为对奖励进行线性回归。智能体根据参考策略的动作价值贪心地采取行动,这相当于在参考策略之上进行一步策略改进,并足以到达单个目标。在一个包含两个目标的网格世界中,以均匀随机游走作为参考策略时,其特征向量即为低频拉普拉斯特征向量。采用这种方法构建的智能体在每次目标变化后都能保持接近最大值的回报,而 SimpleSF 和 DQN 在每次变化时都会损失大部分回报。
更新时间: 2026-11-19 17:54:04
领域: cs.LG
ROPE: Routed Origin Policy Enforcement against Indirect Prompt Injection
Tool-using LLM agents execute consequential operations on behalf of users. Because the LLM driving an agent processes trusted user instructions and untrusted content in the same context, agents are vulnerable to indirect prompt injection attacks that induce unintended actions by mixing malicious instructions into benign data. Defenses based on prompting or content detection are easily evaded by paraphrasing attacks, while system-level defenses that constrain tool calls using inferred user intent, or restrict which sources can supply values to sensitive tools, greatly compromise utility. We present ROPE (Routed Origin Policy Enforcement), a defense that greatly improves the utility-security tradeoff by leveraging system roots of trust to create and enforce per-task policies on sensitive tool parameters. Our key insight is that authentication and integrity protection provide a basis for identifying the source of content independently of instructions embedded in it. Before a task unfolds, an LLM router reads only trusted task input to set a provenance rule for each sensitive tool parameter, accounting for the nature of the task and the values and sources the user specified. As the agent works, an origin labeler records where each piece of content came from, using the user's request, platform metadata, and protected record fields as trust anchors. Before any sensitive tool executes, a deterministic verifier requires each of its origin-guarded values to match a value in a source its rule accepts. We show that ROPE provably guarantees parameter value provenance to sensitive tool calls and is immune to paraphrasing attacks. Against eleven defenses on AgentDojo and AgentDyn under static, adaptive, and long-horizon attacks, ROPE exhibits near-perfect security while compromising far less utility than the best baseline defenses. Code and data are available at https://github.com/xhOwenMa/ROPE.
Updated: 2026-11-19 17:52:15
标题: ROPE:针对间接提示注入的路由源策略执行
摘要: 使用工具的 LLM 智能体代表用户执行具有重要后果的操作。由于驱动智能体的 LLM 会在同一上下文中处理受信任的用户指令和不受信任的内容,智能体容易受到间接提示注入攻击:攻击者将恶意指令混入无害数据,从而诱导智能体执行非预期操作。基于提示或内容检测的防御很容易被改写攻击规避,而通过推断用户意图来约束工具调用,或限制哪些来源可以向敏感工具提供参数值的系统级防御,则会严重牺牲实用性。 我们提出 ROPE(Routed Origin Policy Enforcement,路由式来源策略执行),一种通过利用系统信任根,为敏感工具参数创建并执行逐任务策略,从而显著改善实用性与安全性权衡的防御机制。我们的核心洞见是:身份认证与完整性保护为识别内容来源提供了基础,并且这一识别过程独立于内容中嵌入的指令。在任务开始前,LLM 路由器仅读取受信任的任务输入,为每个敏感工具参数设定来源规则,同时考虑任务性质以及用户指定的值和来源。智能体工作时,来源标注器记录每条内容的来源,并将用户请求、平台元数据和受保护的记录字段作为信任锚点。在任何敏感工具执行前,确定性验证器都会要求其中每个受来源规则保护的值,必须与该规则所接受来源中的某个值相匹配。 我们证明,ROPE 能够为敏感工具调用提供可证明的参数值来源保证,并且不受改写攻击影响。在 AgentDojo 和 AgentDyn 上针对 11 种防御机制进行的静态、自适应和长时程攻击实验中,ROPE 展现出近乎完美的安全性,同时相比最佳基线防御对实用性的牺牲大幅降低。代码和数据见:https://github.com/xhOwenMa/ROPE】【。
更新时间: 2026-11-19 17:52:15
领域: cs.CR
Forecasting Patient Trajectories from the Electronic Health Records with Action-Conditioned World Models
We introduce a predictive world model for electronic health records (EHR) that represents patient histories as action conditioned latent trajectories. Rather than modeling clinical events solely through autoregressive token prediction, our framework explicitly separates patient states from observed clinical actions and learns their evolution through a state and action conditioned transition operator. At its core is a state dependent linearization predictor that propagates local changes in latent patient state, enabling time resolved prediction, multi step rollout, and action conditioned simulation. Empirically, we show that generated latent trajectories preserve downstream predictive signal, temporal structure, and subgroup level statistical relationships present in encoder derived representations. We further decode free running rollouts into the original clinical feature space and evaluate future clinical measurements against observed values using task matched forecasting baselines, demonstrating that the learned dynamics retain predictive information beyond latent space agreement. Across binary classification and time to event tasks, EHR WM achieves competitive, though task dependent, performance relative to substantially larger EHR foundation models while using a 30x smaller parameter footprint. Finally, perturbing observed action sequences produces corresponding changes in generated trajectories, demonstrating the action sensitivity of the learned dynamics. Together, these results support world modeling as a complementary framework for learning explicit, time indexed representations of patient evolution from longitudinal EHR.
Updated: 2026-11-19 17:49:16
标题: 利用动作条件世界模型从电子健康记录中预测患者病程轨迹
摘要: 我们提出了一种用于电子健康记录(EHR)的预测性世界模型,将患者病史表示为由行动条件化的潜在轨迹。不同于仅通过自回归式词元预测来建模临床事件,我们的框架明确区分患者状态与观测到的临床行动,并通过由状态和行动共同条件化的转移算子学习其演化过程。该模型的核心是一种依赖状态的线性化预测器,用于传播患者潜在状态的局部变化,从而实现分时预测、多步展开和行动条件化模拟。实证结果表明,生成的潜在轨迹保留了编码器生成的表示中所包含的下游预测信号、时间结构以及亚组层面的统计关系。我们进一步将自由运行的展开轨迹解码回原始临床特征空间,并使用与任务匹配的预测基线,将未来临床测量值与观测值进行评估,结果表明,所学习的动态过程不仅在潜在空间层面保持一致性,还保留了额外的预测信息。在二分类和事件发生时间任务中,EHR 世界模型仅使用规模小 30 倍的参数量,便取得了具有竞争力但依赖具体任务的性能,相较于规模显著更大的 EHR 基础模型表现可比。最后,对观测到的行动序列进行扰动会导致生成轨迹发生相应变化,证明了所学习动态过程对行动具有敏感性。总体而言,这些结果支持将世界建模作为一种互补框架,用于从纵向 EHR 中学习患者演化过程的显式、按时间索引的表示。
更新时间: 2026-11-19 17:49:16
领域: cs.LG
On Agentic Manipulation Policies
Recent work on robot manipulation has focused on specialist policies trained on demonstrations. We show that generalist AI models can control manipulators more reliably than specialist policies such as vision-language-action models (VLAs) and world-action models (WAMs). We systematically analyze agentic manipulation policies (AMPs), in which a generalist AI model commands the manipulator directly, adapting its actions as the task unfolds. We present AMP1, a reference harness that runs unchanged across single-arm, bimanual, and mobile manipulation. AMP1 achieves state-of-the-art results on the RoboLab-120 and CaP-Gym benchmarks, with no demonstrations or task-specific training. On RoboLab-120, AMP1 reaches an 85.6% success rate zero-shot, compared to 49.2% and 42.9% for leading VLA and WAM policies. The agent succeeds zero-shot in 104 of 108 real-world trials spanning twelve tasks and three robot instances, reducing failure rates by 20x and 15x relative to strong VLA and WAM baselines. The basic harness supplies no grasping, pushing, or placing skills; the agent develops its own strategies, such as searching for hidden objects, using objects as tools, and calibrating its cameras. With the addition of a persistent memory store, the agent can also learn from experience: an augmented harness with a memory representation that is carried across episodes lowers the failure rate on RoboDojo bimanual manipulation tasks by 4.6x relative to zero-shot deployment. Our analysis suggests that AMPs are substantially more general and robust than specialist manipulation policies, providing a promising foundation for robot manipulation. See https://apple-aiml-research.github.io/ml-amp/ for code and videos.
Updated: 2026-11-19 17:48:05
标题: 关于智能体操纵策略
摘要: 近期关于机器人操控的研究主要聚焦于基于示范训练的专用策略。我们发现,通用人工智能模型对机械臂的控制可靠性高于视觉-语言-动作模型(VLA)和世界-动作模型(WAM)等专用策略。我们系统分析了智能体式操控策略(AMP),即由通用人工智能模型直接指挥机械臂,并随着任务展开动态调整动作。我们提出了 AMP1,这是一套参考框架,可在单臂、双臂和移动操控场景中无需改动地运行。AMP1 在 RoboLab-120 和 CaP-Gym 基准测试中取得了当前最佳结果,且不需要示范数据或针对特定任务进行训练。在 RoboLab-120 上,AMP1 以零样本方式达到了 85.6% 的成功率,而领先的 VLA 和 WAM 策略分别为 49.2% 和 42.9%。在涵盖十二项任务和三台不同机器人实例的 108 次真实世界试验中,该智能体有 104 次以零样本方式成功,将失败率相较于强大的 VLA 和 WAM 基线分别降低了 20 倍和 15 倍。基础框架不提供抓取、推动或放置技能;智能体会自行形成策略,例如寻找隐藏物体、利用物体作为工具,以及校准自身摄像头。加入持久化记忆存储后,智能体还能够从经验中学习:一种在不同回合之间持续保留记忆表征的增强框架,使 RoboDojo 双臂操控任务的失败率相较于零样本部署降低了 4.6 倍。我们的分析表明,AMP 在通用性和鲁棒性方面显著优于专用操控策略,为机器人操控提供了一个富有前景的基础。代码和视频请参见:https://apple-aiml-research.github.io/ml-amp/】【。
更新时间: 2026-11-19 17:48:05
领域: cs.RO,cs.AI,cs.CV,cs.LG
FLUID: Flexible, Evidence-Grounded Situated Task Guidance
Real-time task guidance is inherently flexible: when an agent guides a user through a task, multiple responses and timings can be appropriate, and sometimes the best action is to remain silent. Existing benchmarks often miss this flexibility by treating synthesized dialogues as fixed targets for what to say and when to say it. We introduce FLUID (Flexible, Evidence-Grounded Situated Task Guidance), a unified framework for modeling, evaluating, and enabling flexible interaction in multimodal task guidance. Using naturally occurring human-human guidance from WTaG and HoloAssist, FLUID grounds interventions in their supporting evidence, necessity, and timing flexibility, and uses this representation both to evaluate flexible guidance and to build a real-time agent for task guidance. Our agent achieves the strongest overall balance of response correctness, intervention precision, timely guidance, and response latency among evaluated systems, while still leaving room for improvement in avoiding speech overlap. Together, FLUID moves situated task guidance beyond rigid reference matching toward more natural and adaptive human-AI interaction. Project page: https://fluid-guidance.github.io.
Updated: 2026-11-19 17:45:07
标题: FLUID:灵活且以证据为基础的情境化任务指导
摘要: 实时任务指导本质上具有灵活性:当智能体引导用户完成任务时,可能存在多种合适的回应和时机,有时最好的行动甚至是保持沉默。现有基准通常将合成对话视为“该说什么”以及“何时说”的固定目标,因此往往忽略了这种灵活性。我们提出 FLUID(Flexible, Evidence-Grounded Situated Task Guidance,灵活的、基于证据的情境任务指导),这是一个用于对多模态任务指导中的灵活交互进行建模、评估和实现的统一框架。利用 WTaG 和 HoloAssist 中自然发生的人际指导数据,FLUID 根据干预所依据的证据、必要性和时机灵活性,对干预进行明确建模,并同时利用这一表示来评估灵活的指导方式,以及构建实时任务指导智能体。在所评估的系统中,我们的智能体在回应正确性、干预精确度、指导及时性和回应延迟之间取得了最强的总体平衡,但在避免语音重叠方面仍有改进空间。总体而言,FLUID 将情境任务指导从僵化的参考匹配推进到了更加自然、自适应的人机交互。项目主页:https://fluid-guidance.github.io。
更新时间: 2026-11-19 17:45:07
领域: cs.AI
Gravitational Duals from Equations of State II: Large Hierarchies and False Vacua
We investigate the reconstruction of holographic duals for strongly coupled quantum field theories in regimes characterized by large hierarchies and the presence of false vacua. Within the gauge/gravity duality, these features translate into non-trivial thermodynamic behaviour and exotic renormalization group flows, including skipping flows between non-adjacent fixed points. Building on previous work based on Physics-Informed Neural Networks (PINNs), we extend the holographic inverse problem of reconstructing the bulk scalar potential from boundary thermodynamic data into this new regime. This setting presents a variety of conceptual and numerical challenges, such as near-degenerate states, large hierarchies of energy scales, and regions of the potential that are not directly probed by the input data. We develop a set of methodological advances that overcome these obstacles, thereby improving the established PINNs-based methodology and extending it to new physical regimes of interest that were previously out of reach. Applying the developed framework, we demonstrate accurate reconstruction of scalar potentials deep into the false vacuum regime, achieving robust agreement with the physical features of the underlying thermodynamics despite significant numerical stiffness. Our results extend the bridge between holography and machine learning, and suggest that data-driven approaches can provide new insights into the structure of strongly coupled systems.
Updated: 2026-11-19 17:40:17
标题: 状态方程的引力对偶 II:大层级与假真空
摘要: 我们研究了在具有大尺度层级结构和假真空的强耦合量子场论体系中,全息对偶的重构问题。在规范/引力对偶中,这些特征表现为非平凡的热力学行为和奇异的重整化群流,包括在非相邻不动点之间发生的跳跃流。基于此前利用物理信息神经网络(PINNs)开展的研究,我们将从边界热力学数据重构体标量势的全息逆问题拓展到这一新领域。该情形带来了诸多概念和数值上的挑战,例如近简并态、大尺度的能量层级,以及输入数据无法直接探测的势函数区域。我们发展了一系列方法学改进,克服了这些障碍,从而改进了既有的基于 PINNs 的方法,并将其拓展到此前无法触及的、具有重要研究价值的新物理区域。应用所发展的框架,我们展示了如何深入假真空区域准确重构标量势;尽管存在显著的数值刚性,重构结果仍与底层热力学的物理特征稳健一致。我们的结果拓展了全息学与机器学习之间的联系,并表明数据驱动的方法能够为强耦合体系的结构提供新的洞见。
更新时间: 2026-11-19 17:40:17
领域: hep-th,astro-ph.CO,cs.AI,cs.LG,gr-qc
Anticipating Future Build Results with BuildPredictor
Continuous Integration (CI) is a popular programming practice for the seamless integration of code changes into the code base. Using CI, developers benefit from automated assembling and testing of the code after each commit. However, while the frequent integration and building supports developers, it also comes at the high costs of wasting time and resources for minimal changes. In this work, we investigate the potential of reducing the drawbacks by anticipating the build outcome using machine learning techniques. In particular, we propose a random forest model with various features such as changes to the source and build code, and changes to the complexity of the code. We observe that our model shows a good performance in an intra-project and holistic setting yielding a median MCC of 0.82 and 0.86, respectively. We also found that the most important features of our model concern the historical build result information. Additionally, we investigated the development of the performance of our model over time and found that our model can quickly arrive at its peak performance. In an additional experiment, we removed the hard-to-interpret historical build information features and found that our model still yields decent performance while improving the interpretability of it. Summarizing, our model can help to avoid unnecessary build runs by anticipating the build result and thus, save resources.
Updated: 2026-11-19 17:35:44
标题: 使用构建预测器预判未来的构建结果
摘要: 持续集成(CI)是一种流行的编程实践,旨在将代码变更无缝集成到代码库中。借助 CI,开发人员可以在每次提交后自动编译和测试代码。然而,频繁的集成与构建虽然为开发人员提供了支持,但对于微小的变更而言,也会带来时间和资源的高昂浪费。 在本研究中,我们探讨了利用机器学习技术预测构建结果,从而降低这些弊端的可能性。具体而言,我们提出了一种随机森林模型,使用多种特征,包括源代码和构建代码的变更,以及代码复杂度的变化。 我们观察到,在项目内和整体两种设置下,该模型均表现良好,其中位马修斯相关系数(MCC)分别达到 0.82 和 0.86。我们还发现,模型中最重要的特征涉及历史构建结果信息。此外,我们研究了模型性能随时间的发展情况,发现模型能够迅速达到其最佳性能。 在另一项实验中,我们移除了难以解释的历史构建信息特征,发现模型仍能取得较好的性能,同时提高了可解释性。总而言之,我们的模型能够通过预测构建结果,帮助避免不必要的构建运行,从而节省资源。
更新时间: 2026-11-19 17:35:44
领域: cs.SE,cs.LG
A new algorithmic approach for finding flat minima: critically damped Polyak stepsizes
We present a new adaptive stepsize rule that biases gradient descent toward flatter minima in both theory and practice, and establish the first uniform-in-time guarantees for both sharpness and loss reduction for a broad class of locally quadratic objectives. Our critically damped Polyak (CDP) stepsizes multiply the classical Polyak rule by $4$ and a mild damping factor. The factor $4$ is critical in that it produces equioscillations around the manifold of minimizers $\mathcal{M}$ to leading order. Damping provably drives convergence to $\mathcal{M}$. CDP thus operates at the edge of stability by adapting its stepsizes to local curvature. Once the loss is small, its projected iterates follow gradient descent on $\log{λ_1(\nabla^2 \mathcal{L})}$ along $\mathcal{M}$ to leading order, paralleling the flatness bias of normalized gradient descent (Arora et al., 2022). Unlike normalized gradient descent, CDP step lengths shrink with the distance to $\mathcal{M}$, enabling convergence to an interpolating solution that locally minimizes sharpness at finite learning rate. We establish our theory for a broad class of non-negative losses with locally quadratic Morse-Bott structure near $\mathcal{M}$, capturing regular interpolation regimes in smooth overparameterized neural networks. Empirically, CDP stepsizes produce a flattening effect similar to that of Sharpness-Aware Minimization (SAM, Foret et al., 2021), reducing sharpness even in settings beyond our theory, including nonlinear teacher-student networks and fine-tuning of pre-trained LLMs.
Updated: 2026-11-19 17:35:37
标题: 寻找平坦极小值的新算法方法:临界阻尼的波利亚克步长
摘要: 我们提出了一种新的自适应步长规则,在理论和实践中都能引导梯度下降趋向更平坦的极小值,并针对一大类局部二次目标,首次建立了关于尖锐度和损失下降的全时间一致性保证。我们的临界阻尼 Polyak(CDP)步长将经典 Polyak 规则乘以 4 以及一个温和的阻尼因子。因子 4 至关重要,因为它在一阶近似下会在极小值流形 \(\mathcal{M}\) 周围产生等幅振荡。我们证明,阻尼会推动算法收敛到 \(\mathcal{M}\)。因此,CDP 通过根据局部曲率自适应地调整步长,在稳定性边界上运行。当损失较小时,其投影迭代点沿着 \(\mathcal{M}\) 运动,并在一阶近似下遵循对 \(\log{\lambda_1(\nabla^2 \mathcal{L})}\) 的梯度下降,这与归一化梯度下降的平坦性偏置相呼应(Arora 等,2022)。不同于归一化梯度下降,CDP 的步长会随着到 \(\mathcal{M}\) 的距离缩小,从而能够收敛到一个插值解;在有限学习率下,该解局部地最小化尖锐度。我们针对一大类在 \(\mathcal{M}\) 附近具有局部二次 Morse-Bott 结构的非负损失建立了理论,从而涵盖光滑过参数化神经网络中的常规插值情形。实验上,CDP 步长产生了类似于尖锐度感知最小化(SAM,Foret 等,2021)的平坦化效果,即使在超出我们理论范围的情形下也能降低尖锐度,包括非线性教师—学生网络以及预训练大语言模型的微调。
更新时间: 2026-11-19 17:35:37
领域: cs.LG,cs.AI,math.OC
Extensions of Robbins-Siegmund Theorem with Applications in Reinforcement Learning
The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and reinforcement learning (RL). However, its original form has a significant limitation as it requires the zero-order term to be summable. In many important RL applications, this summable condition, however, cannot be met. This limitation motivates us to extend the Robbins-Siegmund theorem for almost supermartingales where the zero-order term is not summable, but only square-summable. In particular, we introduce a novel and mild assumption on the increments of the stochastic processes. This together with the square-summable condition enables an almost sure convergence to a bounded set. Additionally, we further provide almost sure convergence rates, high probability concentration bounds, and $L^p$ convergence rates. We then apply the new results to stochastic approximation and RL. Notably, we obtain the first almost sure convergence rate, the first high probability concentration bound, and the first $L^p$ convergence rate for $Q$-learning with linear function approximation.
Updated: 2026-11-19 17:33:55
标题: Robbins-Siegmund定理的推广及其在强化学习中的应用
摘要: Robbins-Siegmund 定理确立了几乎超鞅随机过程的收敛性,是分析随机逼近和强化学习(RL)中随机迭代算法最常用的方法之一。然而,其原始形式存在一个显著局限,即要求零阶项可求和。但在许多重要的强化学习应用中,这一可求和条件无法满足。该局限促使我们扩展 Robbins-Siegmund 定理,以处理零阶项不可求和但仅平方可和的几乎超鞅。具体而言,我们针对随机过程的增量提出了一个新颖且较为宽松的假设。该假设结合平方可和条件,可保证随机过程几乎处处收敛到一个有界集合。此外,我们进一步给出了几乎处处收敛速率、高概率集中界以及 \(L^p\) 收敛速率。随后,我们将这些新结果应用于随机逼近和强化学习。值得注意的是,对于采用线性函数逼近的 Q-learning,我们获得了首个几乎处处收敛速率、首个高概率集中界以及首个 \(L^p\) 收敛速率。
更新时间: 2026-11-19 17:33:55
领域: cs.LG,math.OC
STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization
Linear attention replaces growing KV caches with fixed-size recurrent states, yet these persistent states can become a substantial memory bottleneck under concurrent serving. Directly quantizing recurrent states to low precision often leads to severe accuracy degradation, as quantization errors propagate through successive state updates. We discover that the impact of these errors depends on two complementary dimensions: temporally, errors in long-lived memory can persist across many decoding steps; spatially, errors in different key rows affect model outputs differently, while state magnitudes vary substantially along both rows and columns. Motivated by these observations, we propose STEPQuant, a spatial-temporal post-training quantization framework for Delta-rule recurrent states. STEPQuant allocates precision according to error magnitude and memory lifetime, and jointly fits key-row and value-column scales based on state distributions and key-row impact on output error. Experiments on Qwen3.8-27B and Kimi-Linear-48B-A3B-Instruct across both long- and short-generation benchmarks show that STEPQuant closely matches FP32-state accuracy under a nominal 6-bit budget and outperforms uniform INT8 in its 4-bit configuration. Integrated into SGLang with optimized GPU kernels, 6-bit STEPQuant achieves over 5x recurrent-state compression and reduces total serving memory by up to 68.7%. Our code is available at https://github.com/Dreamer-Toby/STEPQuant.
Updated: 2026-11-19 17:27:00
标题: STEPQuant:增量规则循环状态量化中误差何时及何处重要
摘要: 线性注意力以固定大小的循环状态取代不断增长的 KV 缓存,但在并发服务场景下,这些持久化状态可能成为显著的内存瓶颈。直接将循环状态量化为低精度通常会导致严重的精度下降,因为量化误差会在连续的状态更新过程中逐步传播。我们发现,这些误差的影响取决于两个互补维度:在时间维度上,存活时间较长的记忆中的误差可能跨越许多解码步骤持续存在;在空间维度上,不同键行中的误差对模型输出的影响各不相同,同时状态幅值在行和列两个方向上都存在显著差异。基于这些观察,我们提出了 STEPQuant,一种面向 Delta 规则循环状态的时空后训练量化框架。STEPQuant 根据误差幅值和记忆存续时间分配精度,并基于状态分布以及键行对输出误差的影响,联合拟合键行和数值列的缩放因子。在 Qwen3.8-27B 和 Kimi-Linear-48B-A3B-Instruct 上,针对长生成和短生成基准的实验表明,在名义 6 比特预算下,STEPQuant 的精度接近 FP32 状态,并且其 4 比特配置优于统一 INT8。将其集成到带有优化 GPU 内核的 SGLang 中后,6 比特 STEPQuant 可实现超过 5 倍的循环状态压缩,并将总体服务内存最多降低 68.7%。我们的代码已发布于 https://github.com/Dreamer-Toby/STEPQuant。
更新时间: 2026-11-19 17:27:00
领域: cs.CL,cs.AI,cs.LG
Monte Carlo Pass Search for Setpieces
Set pieces produce about a third of non-penalty expected goals (xG), yet they are usually evaluated by what happened next. We present Monte Carlo Pass Search (MCPS) for set pieces, which treats a corner or a lofted free kick as a distribution over plausible executions and plausible futures instead of a single realised event. From the pre-kick state, MCPS proposes counterfactual deliveries and counterfactual set-ups (where the attackers stand at the kick), plays each out many times in a world model (3D ball physics, a generative model of all 22 players, the keeper's come-or-stay decision and a Player-to-Touch model) and scores every future with a value model. On 249 deliveries from 30 Serie A 2025/26 matches, with every model applied only to matches it never saw, the best available delivery is worth 0.0085 xG more than the one kicked (+28 %), mainly because it reaches an attacker before the keeper. Searching where the attackers stand as well adds +0.0027 xG with the observed ball and +0.0033 on top of the best ball; designing their runs too adds +0.0007 more. We show how to keep such a search honest, and estimate how much more data each component needs before a club could rely on it.
Updated: 2026-11-19 17:26:38
标题: 用于定式的蒙特卡洛通搜索
摘要: 定位球贡献了非点球预期进球(xG)的约三分之一,但人们通常只根据随后发生的情况来评估它们。我们提出了用于定位球的蒙特卡洛传球搜索(Monte Carlo Pass Search,MCPS):它将角球或吊传任意球视为一组可能的执行方式及其可能后果的分布,而不是单一的实际事件。基于开球前状态,MCPS提出反事实传球和反事实站位方案(即进攻球员在开球时所处的位置),并在世界模型中对每种方案进行多次推演。该世界模型包括三维球体物理、涵盖全部22名球员的生成模型、守门员选择出击或留守的决策模型,以及球员触球模型;随后利用价值模型为每种可能的后续结果评分。 在来自30场2025/26赛季意甲比赛的249次传球中,并且每个模型都只应用于其从未见过的比赛,表现最佳的可用传球比实际踢出的传球高出0.0085 xG(+28%),主要原因是它能让球在守门员之前到达进攻球员。进一步搜索进攻球员的站位,在使用实际传球时可额外增加0.0027 xG,在最佳传球基础上可再增加0.0033 xG;连同进攻球员的跑动路线一并设计,还能再增加0.0007 xG。我们展示了如何确保这类搜索保持可靠,并估算了各组成部分在俱乐部能够依赖这项技术之前还需要多少数据。
更新时间: 2026-11-19 17:26:38
领域: cs.AI
A Bayesian latent class reinforcement learning framework to capture adaptive, feedback-driven travel behaviour
Many travel decisions involve a degree of experience formation, where individuals learn their preferences over time. At the same time, there is extensive scope for heterogeneity across individual travellers, both in their underlying preferences and in how these evolve. The present paper puts forward a Latent Class Reinforcement Learning (LCRL) model that allows analysts to capture both of these phenomena. We apply the model to a driving simulator dataset and estimate the parameters through Variational Bayes. We identify three distinct classes of individuals that differ markedly in how they adapt their preferences: the first displays context-dependent preferences with context-specific exploitative tendencies; the second follows a persistent exploitative strategy regardless of context; and the third engages in an exploratory strategy combined with context-specific preferences.
Updated: 2026-11-19 17:25:53
标题: 一种用于捕捉适应性反馈驱动出行行为的贝叶斯潜在类别强化学习框架
摘要: 许多旅行决策都涉及一定程度的经验形成,即个体会随着时间推移逐渐了解自己的偏好。与此同时,不同旅行者之间存在广泛的异质性,这种异质性既体现在他们的基本偏好上,也体现在偏好的演变方式上。本文提出一种潜在类别强化学习(LCRL)模型,使分析人员能够同时刻画这两种现象。我们将该模型应用于驾驶模拟器数据集,并通过变分贝叶斯方法估计模型参数。研究识别出三类存在显著差异的个体,他们在偏好适应方式上各不相同:第一类表现出依赖情境的偏好,并具有情境特定的利用倾向;第二类无论情境如何,始终采取持续性的利用策略;第三类则采取探索策略,同时表现出情境特定的偏好。
更新时间: 2026-11-19 17:25:53
领域: cs.LG,econ.EM,stat.ML
Neural Conditional Gaussian Model: Efficient Data Assimilation with Sequential Uncertainty Quantification for Nonlinear Dynamics
Data assimilation (DA) in partially observed nonlinear systems requires repeated estimation of both hidden states and their uncertainty. Conventional nonlinear filtering can be computationally expensive and often relies on an explicit dynamical model. In this paper, we develop the Neural Conditional Gaussian Model (Neural CGM), a data-driven dynamical model that maps unobserved physical states into a learned latent space, where the dynamics of the latent states follow a conditional Gaussian structure. This structure allows closed-form DA updates in the latent space, while nonlinear encoder-decoder mappings retain the flexibility needed to represent complex dynamics in physical space. A key feature of Neural CGM is its treatment of uncertainty in DA. The latent posterior mean and covariance are mapped to the physical variables through a Gaussian decoder that combines local moment propagation with learned nonlinear corrections. The resulting physical-space posterior statistics depend on the sequentially updated latent distribution rather than on a separate post-processing estimate. The same statistics enter a Gaussian negative log-likelihood during training, so both the posterior mean and uncertainty affect the learned model. Because Neural CGM learns the dynamical model itself, it can also be used for state forecasting and simulation without explicit knowledge of the governing equations. Numerical experiments on benchmark nonlinear dynamical systems show accurate state estimation and forecasting while substantially reducing online assimilation cost relative to conventional nonlinear DA methods. Neural CGM is therefore suited to repeated state estimation, uncertainty quantification, and prediction from partial observations.
Updated: 2026-11-19 17:25:51
标题: 神经条件高斯模型:通过序贯不确定性量化实现非线性动力学的高效数据同化
摘要: 部分观测非线性系统中的数据同化(DA)需要反复估计隐藏状态及其不确定性。传统非线性滤波计算成本高昂,并且通常依赖显式的动力学模型。本文提出神经条件高斯模型(Neural Conditional Gaussian Model,Neural CGM),这是一种数据驱动的动力学模型,可将未观测的物理状态映射到学习得到的潜在空间中,在该空间内,潜在状态的动力学遵循条件高斯结构。该结构能够在潜在空间中进行闭式数据同化更新,同时,非线性编码器—解码器映射保留了在物理空间中表示复杂动力学所需的灵活性。Neural CGM 的一个关键特征是其对数据同化中不确定性的处理方式。潜在后验均值和协方差通过结合局部矩传播与学习得到的非线性修正项的高斯解码器映射到物理变量。由此得到的物理空间后验统计量取决于按序更新的潜在分布,而不是依赖单独的后处理估计。在训练过程中,相同的统计量被用于高斯负对数似然,因此后验均值和不确定性都会影响所学习的模型。由于 Neural CGM 能够直接学习动力学模型,因此即使不知道控制方程,也可用于状态预测和模拟。在基准非线性动力学系统上的数值实验表明,与传统非线性数据同化方法相比,该模型在显著降低在线同化成本的同时,能够实现准确的状态估计与预测。因此,Neural CGM 适用于基于部分观测进行反复状态估计、不确定性量化和预测。
更新时间: 2026-11-19 17:25:51
领域: cs.LG,math.DS
Bayesian optimization on amortized search space
In real-world black-box optimization problems, a mechanistic simulator is often available that approximately predicts the behavior of the system as a function of the parameters being optimized. Here, we show how an amortized inverse map of such a simulator can be used in Bayesian optimization to restrict the search space while using a Gaussian process kernel that is aware of the original problem geometry. This allows for efficiently leveraging the low intrinsic dimensionality of the optimization problem. We characterize its approximation bias and information gain, and derive an intrinsic-dimension-dependent regret rate under additional geometric and Gaussian Process assumptions. We illustrate the method with an application to drug dosing personalization in Parkinson's disease. We use, as a simulator, a pharmacokinetic/pharmacodynamic (PK/PD) model of a drug, a mechanistic model calibrated on population data with quantified parameter uncertainty. A dosing neural network is trained offline against the model, amortizing the map from patient PK/PD parameters to the regimen predicted to be optimal, and online Bayesian optimization then searches over this learned, low-dimensional representation rather than over raw dosages. Numerical simulations demonstrate the improved performance of our method in this application, as well as under simulator misspecification.
Updated: 2026-11-19 17:22:39
标题: 摊销搜索空间上的贝叶斯优化
摘要: 在现实世界的黑箱优化问题中,通常可以获得一个机制模拟器,用于近似预测系统行为随待优化参数变化的规律。本文展示了如何利用此类模拟器的摊销逆映射,在贝叶斯优化中限制搜索空间,同时使用能够感知原始问题几何结构的高斯过程核。这使得我们能够高效利用优化问题的低内在维度。我们刻画了该方法的近似偏差与信息增益,并在额外的几何假设和高斯过程假设下,推导出一个依赖于内在维度的遗憾率。我们将该方法应用于帕金森病的个体化药物剂量设计。具体而言,我们使用一个药代动力学/药效动力学(PK/PD)药物模型作为模拟器;该机制模型基于群体数据进行校准,并对参数不确定性进行了量化。我们针对该模型离线训练一个给药神经网络,将从患者PK/PD参数到预测最优给药方案的映射进行摊销;随后,在线贝叶斯优化在这一学习得到的低维表示空间中进行搜索,而不是直接在原始剂量空间中搜索。数值模拟表明,在该应用场景以及模拟器存在设定偏差的情况下,我们的方法均能取得更好的性能。
更新时间: 2026-11-19 17:22:39
领域: stat.ML,cs.LG
Chameleon: Dynamic Format Adapter for Efficient Diffusion
Post-training quantization (PTQ) is the standard way to run modern diffusion models on memory-constrained accelerators, yet every existing diffusion PTQ scheme fixes the $\mathit{number\ format}$ in advance and only tunes the scale, zero point, or per-layer bit-width. At a fixed bit-width the best format depends on the distribution being encoded, and that distribution differs across weight channels, across layers, and along the diffusion timestep, where activation distributions slide from heavy-tailed and noise-dominated to tightly clustered and structured. We propose Chameleon, a PTQ framework that holds the bit-width fixed and treats the format itself as a discrete variable, chosen per weight channel and per activation layer, optionally refined per timestep bucket. Activation formats come from {INT8, FP8 E4M3, FP8 E5M2, MXFP8, MXINT8}, selected ahead of time from two cheap statistics (empirical kurtosis and the closed-form diffusion SNR) and stored in a lookup table; weight formats come from {INT8, MXINT8} at 8 bits or {INT4, NF4, FP4 E2M1, MXINT4, MXFP4} at 4 bits, selected offline by reconstruction error. An architectural fork adapts the same selection layer to multi-step UNets, single-step distilled models, and Diffusion Transformers. Most of the gain comes from the per-layer choice; the timestep refinement helps mainly at 6-bit activations. Across SDXL, SDXL-Turbo, and PixArt-$α$ on COCO-2014, Chameleon achieves the best FID in all six backbone $\times$ bit-width settings, with CLIP within 0.24 of the FP16 reference and the best of all quantized methods at $W_{4}A_{8}$. On PixArt-$α$, a real mixed-format kernel runs 1.09$\times$ faster than FP16 end-to-end with 3$\times$ smaller weights.
Updated: 2026-11-19 17:20:50
标题: 变色龙:用于高效扩散的动态格式适配器
摘要: 训练后量化(PTQ)是让现代扩散模型在内存受限加速器上运行的标准方法,但现有的扩散模型 PTQ 方案都预先固定了数值格式,只调节缩放因子、零点或逐层位宽。在位宽固定时,最佳格式取决于待编码分布,而该分布会因权重通道、网络层以及扩散时间步的不同而变化:激活分布会沿扩散过程从重尾且受噪声主导,逐渐转变为高度集中且具有结构性。我们提出 Chameleon,一种 PTQ 框架,在固定位宽的同时,将格式本身视为离散变量,并针对每个权重通道和每个激活层分别选择格式,还可进一步按时间步区间进行细化。激活格式来自 {INT8、FP8 E4M3、FP8 E5M2、MXFP8、MXINT8},根据两个廉价统计量——经验峰度和闭式扩散信噪比(SNR)——预先选择,并存储在查找表中;权重格式在 8 bit 下从 {INT8、MXINT8} 中选择,在 4 bit 下从 {INT4、NF4、FP4 E2M1、MXINT4、MXFP4} 中选择,依据重构误差离线确定。我们还设计了架构分支,使同一选择层能够适配多步 UNet、单步蒸馏模型和扩散 Transformer。大部分收益来自逐层格式选择;时间步细化主要在 6 bit 激活下发挥作用。在 COCO-2014 上的 SDXL、SDXL-Turbo 和 PixArt-$\alpha$ 实验中,Chameleon 在全部六种骨干网络与位宽组合下都取得了最佳 FID;其 CLIP 指标与 FP16 基准的差距不超过 0.24,并在 $W_{4}A_{8}$ 配置下优于所有量化方法。在 PixArt-$\alpha$ 上,实际的混合格式内核端到端运行速度比 FP16 快 1.09 倍,同时权重大小缩小至原来的三分之一。
更新时间: 2026-11-19 17:20:50
领域: cs.LG,cs.AI,cs.CV
A CPU Inside an LLM: Zero-Gradient Compilation of Exact Circuits into Pretrained Weights
Pretrained language models (LMs) remain unreliable on exact multi-digit arithmetic without gradient fine-tuning or external tool interpreters. We introduce closed-form, zero-gradient circuit-grafting primitives that compile deterministic computation directly into pretrained LM weights using zero training examples and zero runtime hooks, while bounding per-layer normalization drift and preserving natural-language (NL) competence. Our construction combines three analytical mechanisms: (1) two-layer Mellin-GLU quadrature over bias-free SwiGLU/GeGLU layers, turning unknown per-token RMSNorm scaling into translation along a log-spaced gate grid ($>250\times$ dynamic range) with IEEE 754 error bounds; (2) cross-token scale cancellation via signed Chebyshev Indefinite-RoPE self-sink attention and memoryless SiLU-antisymmetric GatedDeltaNet shifts; and (3) axis-aligned width extension ($d \to d+K$) with $\sqrt{d/(d+K)}$ norm compensation, Base-1000 canonical BPE emission, and differential $(+254,-256)$ tied unembeddings. An automated 5-stage compiler synthesizes 4-8 digit signed $\{+,-,\times\}$ circuits in constant $\mathsf{TC}^0$ depth alongside 3-literal Boolean (100%, $N=1{,}728$; plus 42-layer Gemma 4 E4B audits) and 5-bit Majority/Parity (100%) circuits. On 6-digit arithmetic ($N=1{,}200$, BF16), IBM Granite 4.2 3B (1.07M-1.33M active non-zeros, $\le 0.036\%$) and Alibaba Qwen 3.5 4B (2.25M-2.39M non-zeros, $\le 0.057\%$) reach 99.17% and 100.00% ALU-prefix accuracy (100% with an FP32 sidecar) and 98%-100% mid-sentence resumption, outperforming 12.8K-sample LoRA (42.2% / 61.7%, 0% inline continuation). A factorized block-sparse sidecar holds A100 memory at 7.89 / 10.65 GiB (4.60 / 8.14 GiB under INT8/INT4 + FP32 sidecar) while passing all 14/14 pre-registered $>2$K-token Tango splits ($N=4{,}392$; 0/11,134 OOD triggers).
Updated: 2026-11-19 17:18:38
标题: 大语言模型中的一颗 CPU:将精确电路零梯度编译进预训练权重
摘要: 预训练语言模型(LM)在不进行梯度微调或使用外部工具解释器的情况下,对于精确的多位数算术仍然不可靠。我们提出了一组闭式、零梯度的电路嫁接原语,在使用零个训练样本和零个运行时钩子的条件下,将确定性计算直接编译进预训练语言模型的权重中,同时限制每层归一化漂移,并保留自然语言(NL)能力。我们的构造结合了三种分析机制:(1)在无偏置的 SwiGLU/GeGLU 层上进行两层 Mellin-GLU 求积,将未知的逐 token RMSNorm 缩放转换为沿对数间隔门控网格的平移(动态范围超过 250 倍),并给出 IEEE 754 误差界;(2)通过带符号的 Chebyshev 不定 RoPE 自汇聚注意力,以及无记忆 SiLU-反对称 GatedDeltaNet 偏移,实现跨 token 的尺度消除;(3)进行轴对齐的宽度扩展($d \to d+K$),配合 $\sqrt{d/(d+K)}$ 范数补偿、Base-1000 规范化 BPE 输出,以及差分式($+254,-256$)绑定输出嵌入。 一个自动化的五阶段编译器能够综合生成 4 至 8 位有符号 $\{+,-,\times\}$ 电路,其深度为常数 $\mathsf{TC}^0$;同时还可生成三文字句布尔电路(100%,$N=1{,}728$;另有 42 层 Gemma 4 E4B 审计)以及 5 位 Majority/Parity 电路(100%)。在六位数算术测试中($N=1{,}200$,BF16),IBM Granite 4.2 3B(107 万至 133 万个活跃非零参数,占比不超过 $0.036\%$)和阿里巴巴 Qwen 3.5 4B(225 万至 239 万个非零参数,占比不超过 $0.057\%$)的 ALU 前缀准确率分别达到 99.17% 和 100.00%(配合 FP32 旁路模块时均为 100%),句中恢复率达到 98% 至 100%,优于使用 12.8K 个样本进行 LoRA 微调的结果(42.2% / 61.7%,行内续写为 0%)。一个因子化块稀疏旁路模块将 A100 显存占用控制在 7.89 / 10.65 GiB(采用 INT8/INT4 加 FP32 旁路模块时为 4.60 / 8.14 GiB),同时通过了全部 14/14 个预注册的超过 2K token 的 Tango 划分($N=4{,}392$;OOD 触发次数为 0/11,134)。
更新时间: 2026-11-19 17:18:38
领域: cs.AI
Scaling classical hardware for accurate real-time quantum error correction
Fault-tolerant quantum computation requires a classical decoder fast enough to process syndrome measurements at the rate at which they are generated, and to return its decisions with low latency. This is most demanding for superconducting processors, whose fast syndrome cycles force a trade-off between decoding speed and accuracy. Decoders fast enough to keep up sacrifice accuracy, which must be compensated for with larger codes and thus additional physical qubits. Here we introduce Rapids, a streaming neural decoder that is both fast and accurate. We achieve this by co-designing the decoder with a field-programmable gate array (FPGA): the network is built from operations that map cheaply onto the device and trained in its integer arithmetic. For the distance-19 surface code, Rapids decodes each round of syndromes in under a microsecond on a single FPGA, fast enough for superconducting processors, and returns its decisions with the low latency that fault-tolerant algorithms require. Its logical error rate is 240 times lower than that of existing real-time hardware decoders. The same design extends to the color code and the [[144,12,12]] bivariate-bicycle code, on which our decoder is 16 times more accurate than the real-time Relay decoder. We further show that the decoder scales: spread over several FPGAs or hardened into custom silicon, it becomes faster, more accurate, or able to decode larger codes. Classical hardware thus becomes a further resource, alongside qubits, that can be scaled to improve fault-tolerant quantum computers.
Updated: 2026-11-19 17:16:21
标题: 扩展经典硬件,实现准确的实时量子纠错
摘要: 容错量子计算需要一种经典解码器,其处理综合测量的速度足以跟上综合征生成的速率,并以低延迟返回判决结果。对于超导处理器而言,这一要求最为严苛,因为其快速的综合征循环迫使人们在解码速度与准确性之间进行权衡。速度足以跟上的解码器往往会牺牲准确性,而这又必须通过采用更大规模的编码来弥补,从而需要额外的物理量子比特。在此,我们介绍了 Rapids,一种兼具高速与高准确性的流式神经解码器。我们通过将解码器与现场可编程门阵列(FPGA)协同设计来实现这一点:该网络由能够低成本映射到器件上的运算构成,并使用器件的整数算术进行训练。对于距离为 19 的表面码,Rapids 在单个 FPGA 上可在不到 1 微秒内完成每轮综合征的解码,速度足以满足超导处理器的要求,并以容错算法所需的低延迟返回判决结果。其逻辑错误率比现有实时硬件解码器低 240 倍。同样的设计还可扩展到色码和 [[144,12,12]] 双变量自行车码;在后者上,我们的解码器准确性比实时 Relay 解码器高 16 倍。我们进一步展示了解码器的可扩展性:将其分布在多个 FPGA 上,或固化为定制硅芯片后,它可以实现更高速度、更高准确性,或解码更大规模的编码。因此,经典硬件可以与量子比特一样,成为一种能够扩展以改进容错量子计算机的资源。
更新时间: 2026-11-19 17:16:21
领域: quant-ph,cs.AR,cs.LG
Mind2Act World: A Diagnostic Benchmark for Embodied Mind, Physical Action, and Mind-Action Composition in Robotic Manipulation
Embodied intelligence aims to let robots perform complex physical tasks with human-like adaptability and reliability, which requires three complementary capabilities: history-based cognitive reasoning, precise and timely physical execution, and the composition of reasoning and execution through environmental feedback. Yet existing benchmarks either evaluate reasoning and execution within the same tasks or assess them separately without their composition, so they reveal little about whether a failure comes from reasoning, execution, or their composition. We introduce Mind2Act World, a diagnostic benchmark of 30 simulated manipulation tasks from five real-world application domains. Each task has three difficulty levels and two scene settings (Clean and Random), yielding 180 configurations. The tasks form three views: Mind tests decisions based on past observations, Act tests precise and timely execution, and Mind2Act combines both in closed-loop tasks where action outcomes guide later decisions. Comparing the three views shows whether a system lacks a capability or fails to compose capabilities it already has. A diagnosis harness further attributes the failed episodes of three representative systems to Mind, Act, or their composition and summarizes each system in a profile card. Our evaluation of multimodal agents, vision-language-action models (VLAs), and world-action models (WAMs) shows that competence in a single view does not carry over to Mind2Act tasks. Even the strongest agent succeeds in 52.7% of Mind and 39.0% of Act episodes but in only 12.0% of Mind2Act episodes. The strongest agent retains task state but struggles with sustained contact, whereas end-to-end policies execute practiced motions but retain little task state. These findings point to composing reasoning and execution through environmental feedback as the main open problem.
Updated: 2026-11-19 17:15:38
标题: Mind2Act世界:用于诊断机器人操作中具身心智、物理动作与心智—动作组合能力的基准测试
摘要: 具身智能旨在使机器人能够以类似人类的适应性和可靠性执行复杂的物理任务,这需要三种相互补充的能力:基于历史信息的认知推理、精准且及时的物理执行,以及通过环境反馈将推理与执行结合起来。然而,现有基准要么在同一任务中同时评估推理和执行,要么将二者分开评估而不考察其组合,因此很难揭示失败究竟源于推理、执行,还是二者的组合。我们提出了 Mind2Act World,这是一个诊断性基准,包含来自五个现实世界应用领域的 30 个模拟操作任务。每项任务设有三个难度等级和两种场景设置(Clean 和 Random),共形成 180 种配置。这些任务构成三个视角:Mind 根据过去的观测测试决策能力;Act 测试精准且及时的执行能力;Mind2Act 则将二者结合到闭环任务中,在这类任务里,动作结果会引导后续决策。比较这三个视角,可以判断系统是缺乏某项能力,还是无法将已有能力组合起来。我们还设计了一个诊断工具,将三个代表性系统失败的回合归因于 Mind、Act 或二者的组合,并为每个系统生成能力概况卡片。对多模态智能体、视觉-语言-动作模型(VLA)和世界-动作模型(WAM)的评估表明,在单一视角下具备的能力并不能迁移到 Mind2Act 任务中。即使是表现最强的智能体,在 Mind 和 Act 回合中的成功率分别达到 52.7% 和 39.0%,但在 Mind2Act 回合中的成功率仅为 12.0%。表现最强的智能体能够保持任务状态,但在持续接触方面存在困难;而端到端策略能够执行经过训练的动作,却几乎无法保持任务状态。这些发现表明,通过环境反馈将推理与执行结合起来,是当前最主要的开放问题。
更新时间: 2026-11-19 17:15:38
领域: cs.RO,cs.AI,cs.CV
Stop Removing Stopwords: How an Inherited Preprocessing Default Distorts Legal Text-as-Data
Empirical legal scholarship increasingly treats judicial text as data, and much of it still runs on sparse, interpretable pipelines -- TF-IDF features and linear classifiers -- because the textual feature is often the object of study rather than a means to prediction. Yet these pipelines inherit preprocessing defaults from mid-century information retrieval that were never validated against classification accuracy. The most entrenched of these is stopword removal. This study introduces an exhaustive single word ablation that measures the effect of a preprocessing step directly against the downstream objective, and applies it to stopword removal as the hardest case to dislodge. Matching Supreme Court Database labels to Caselaw Access Project opinion texts, the study examines two binary tasks that bracket F1 headroom, ideological direction (no-removal baseline F1 ~0.68) and constitutional versus non-constitutional law type (~0.92), across 7,668 and 7,001 opinions. For each task, the ablation removes each of about 18,500 candidate words in turn, and a task-specific stoplist is built from the measurements. Common generic stoplists fall below the no-removal baseline in all twelve held-out tests. The task-specific stoplists move held-out F1 by +0.0023 (95% CI [-0.0124, +0.0170]) on ideology and by +0.0001 ([-0.0082, +0.0085]) on law type. Neither task shows a detectable benefit from removal, and supplemental analysis finds that word-level statistics predict removal effects poorly, because true removal effects differ by less than the measurement can register, leaving little to predict. The method generalizes to any inherited preprocessing default; the result is a caution specific to interpretable legal text-as-data, where a step that reshapes which features a model sees can distort the doctrinal and ideological signal the research is meant to recover. The burden of proof sits with removal.
Updated: 2026-11-19 17:15:14
标题: 停止移除停用词:继承性预处理默认设置如何扭曲法律文本数据分析
摘要: 实证法律研究日益将司法文本视为数据,而其中相当一部分研究仍依赖稀疏且可解释的处理流程——TF-IDF 特征和线性分类器——因为文本特征本身往往就是研究对象,而不仅仅是用于预测的手段。然而,这些处理流程继承了20世纪中叶信息检索领域的预处理默认设置,而这些设置从未针对分类准确率进行验证。其中最根深蒂固的做法是去除停用词。本研究提出一种穷举式单词消融方法,直接以下游目标衡量某一预处理步骤的影响,并将其应用于最难被质疑的停用词去除。研究将最高法院数据库的标签与 Caselaw Access Project 的判决文本相匹配,考察两个涵盖不同 F1 提升空间的二分类任务:意识形态方向(不去除停用词的基线 F1 约为0.68)以及宪法性与非宪法性法律类型(约为0.92),分别涉及7,668份和7,001份判决。对于每项任务,消融实验依次去除约18,500个候选词中的每一个,并根据测量结果建立任务特定的停用词表。在全部12项留出测试中,常见的通用停用词表表现均低于不去除停用词的基线。任务特定的停用词表使意识形态任务的留出 F1 变化为+0.0023(95%置信区间为[-0.0124,+0.0170]),使法律类型任务的留出 F1 变化为+0.0001([-0.0082,+0.0085])。两个任务都未显示出去除停用词能够带来可检测的收益;补充分析还发现,词语层面的统计数据很难预测去除某个词所产生的影响,因为实际的去除效果差异小于测量所能识别的范围,因而几乎没有可供预测的内容。该方法可推广至任何继承而来的预处理默认设置;这一结果对于强调可解释性的法律文本数据研究具有警示意义:某一处理步骤一旦改变模型所接触的特征,就可能扭曲研究原本意图还原的 doctrinal 和意识形态信号。证明去除步骤合理的责任在于主张去除的一方。
更新时间: 2026-11-19 17:15:14
领域: cs.CL,cs.CY,cs.IR,cs.LG
Should Belgians Install an Advanced Energy Management System in Their Electrified Dwelling ?
As dwellings electrify and more complex electricity pricing spreads in Belgium, the question arises: What are the potential benefits of installing an advanced energy management systems in an electrified Belgian dwelling ? To answer this question, we simulate 500 representative Belgian dwellings in which fossil systems are replaced by controllable electric technologies: space heating via air-to-air heat pumps, domestic hot water via electric boilers, and private transport via electric vehicles with home chargers. Photovoltaic systems are assigned according to current adoption rates. We evaluate two advanced energy management systems (EMS): model predictive control (MPC) and TreeC, a machine learning method using decision trees to model the EMS strategy. These are compared to a rule-based controller (RBC) that mimics default operation and an MPC with perfect forecasts (MPC P) as an upper bound. Performance for these EMSs is assessed for 2023 under a real contract with hourly prices and a monthly peak tariff. Average annual savings versus RBC are 82.5 EUR, 116.6 EUR, and 177.4 EUR for TreeC, MPC, and MPC P, respectively. All EMSs deliver similar thermal comfort (26-31 Kh). MPC saves more, while TreeC achieves higher EV charge completion (93.3% vs 88.8% for MPC, with a max charge of 95%) and a smoother aggregate load across the 500 dwellings. Savings remain modest relative to EMS purchase (280-680 EUR) and subscription (0-360 EUR/year) costs which is not favourable towards widespread adoption. The data and code to reproduce this study are available at https://github.com/EVERGi/should_belgians_install_advanced_ems_paper.
Updated: 2026-11-19 17:14:13
标题: 比利时人是否应在其电气化住宅中安装先进的能源管理系统?
摘要: 随着住宅电气化以及比利时更复杂电价机制的推广,一个问题随之出现:在采用电气化设备的比利时住宅中,安装先进能源管理系统可能带来哪些潜在收益? 为回答这一问题,我们模拟了500套具有代表性的比利时住宅。在这些住宅中,化石能源系统被可控的电气化技术所取代:采用空气—空气热泵供暖,采用电热水器供应生活热水,并通过配备家庭充电器的电动汽车满足私人交通需求。光伏系统则依据当前的普及率进行配置。 我们评估了两种先进能源管理系统(EMS):模型预测控制(MPC),以及TreeC——一种利用决策树对能源管理系统策略进行建模的机器学习方法。我们将它们与基于规则的控制器(RBC)进行比较,后者模拟默认运行方式;同时还将其与采用完美预测的MPC(MPC P)进行比较,后者作为性能上限。在实际电价合同下,我们评估了这些能源管理系统在2023年的表现,该合同采用小时电价和月度峰值电费。 与RBC相比,TreeC、MPC和MPC P的年均节省金额分别为82.5欧元、116.6欧元和177.4欧元。所有能源管理系统都能提供相近的热舒适度(26—31 Kh)。MPC的节省金额更高,而TreeC的电动汽车充电完成率更高(93.3%,相比之下MPC为88.8%,最高充电完成率为95%),并且在500套住宅的总体层面上实现了更加平滑的负荷曲线。与能源管理系统的购买成本(280—680欧元)和订阅费用(每年0—360欧元)相比,节省金额仍然有限,因此不利于其大规模普及。 用于复现本研究的数据和代码可从以下网址获取:https://github.com/EVERGi/should_belgians_install_advanced_ems_paper。
更新时间: 2026-11-19 17:14:13
领域: eess.SY,cs.LG
The sublevel Flood bifiltration: towards scalable 2-parameter persistent homology
Multiparameter persistent homology is a rapidly developing branch of topological data analysis that improves the robustness of single-parameter persistent homology to outliers, while still capturing the metric characteristics of the data. However, a notable limitation is its lack of scalability. In this paper, we introduce a novel approach for efficiently computing 2-parameter persistent homology on large point sets. Our work extends the Flood filtration, originally developed for single-parameter persistence. Our construction, called the sublevel Flood bifiltration, offers a scalable approximation of the sublevel offset bifiltration. We show that it benefits from theoretical stability properties and describe how to compute it efficiently. We demonstrate the performance of our approach in classification tasks on low-dimensional synthetic datasets, where density awareness is critical, as well as on real-world time series datasets.
Updated: 2026-11-19 17:14:07
标题: 次水平洪水双滤子:迈向可扩展的二维参数持久同调
摘要: 多参数持久同调是拓扑数据分析中一个迅速发展的分支。与单参数持久同调相比,它在保留数据度量特征的同时,提高了对离群点的鲁棒性。然而,其一个显著局限是缺乏可扩展性。本文提出了一种在大型点集上高效计算二参数持久同调的新方法。我们的工作扩展了最初为单参数持久性而开发的 Flood 过滤。我们构造的对象称为次水平 Flood 双过滤,它为次水平偏移双过滤提供了一种可扩展的近似。我们证明了该方法具有理论稳定性,并介绍了如何高效地计算它。我们在低维合成数据集的分类任务中展示了该方法的性能,其中密度感知至关重要;此外,还在真实世界的时间序列数据集上进行了验证。
更新时间: 2026-11-19 17:14:07
领域: math.AT,cs.CG,cs.LG
Learning to Defer under Expert Drift
The learning to defer (L2D) framework enables safety in machine learning and AI systems by allocating difficult or critical decisions to a human expert. However, most prior work on L2D assumes fixed expert reliability, overlooking temporal fluctuations in human performance due to factors such as fatigue and cognitive biases. Humans commonly exhibit such substantial, systematic performance shifts across a wide range of domains, from high-stakes settings such as radiology, aviation, and judicial decision-making, to everyday tasks such as crowdsourced image annotation. We propose Expert-Drift-Adapted Learning-to-Defer (EDA-L2D), a novel expert-aware L2D framework that explicitly models these temporal shifts by conditioning the deferral head on recent histories of expert outcomes via a sequence model. This history-aware approach enables adaptive deferral policies that anticipate reliability fluctuations and better allocate decisions between human and machine over time. We provide comprehensive experiments across three diverse tasks -- image classification, medical diagnosis, and hate speech detection -- including generalization analyses under realistic deferral conditions and irregular shifts in expert reliability. Our results show that EDA-L2D adapts more effectively than prior L2D methods to diverse temporal patterns of expert reliability, resulting in improved system performance and more effective deferral decisions. Code is available at https://github.com/ZiyaoMou/L2D-Expert-Drift.
Updated: 2026-11-19 17:13:58
标题: 在专家漂移下学习延迟决策
摘要: 学习以延迟决策(Learning to Defer,L2D)框架通过将困难或关键的决策分配给人类专家,使机器学习和人工智能系统更加安全。然而,大多数以往的 L2D 研究都假设专家的可靠性是固定的,忽视了疲劳、认知偏差等因素导致的人类表现随时间发生的波动。在从放射学、航空和司法决策等高风险领域,到众包图像标注等日常任务的广泛场景中,人类往往都会表现出此类显著且系统性的能力变化。我们提出了专家漂移适应型学习以延迟决策(Expert-Drift-Adapted Learning-to-Defer,EDA-L2D),这是一种新颖的专家感知型 L2D 框架,通过序列模型利用专家近期结果的历史记录对延迟决策头进行条件化建模,从而显式刻画这些随时间发生的变化。这种具备历史感知能力的方法能够制定自适应的延迟决策策略,预测专家可靠性的波动,并随着时间推移更有效地在人类与机器之间分配决策。我们在三项多样化任务上开展了全面实验——图像分类、医学诊断和仇恨言论检测——其中包括在现实延迟决策条件下,以及专家可靠性发生不规则变化时的泛化分析。结果表明,与以往的 L2D 方法相比,EDA-L2D 能够更有效地适应专家可靠性的各种时间模式,从而提升系统性能,并做出更有效的延迟决策。代码地址:https://github.com/ZiyaoMou/L2D-Expert-Drift。
更新时间: 2026-11-19 17:13:58
领域: cs.LG
SST-Guard: Detecting and Characterizing Server-Side Google Analytics in the Wild
As web browsers increasingly implement anti-tracking features, the web tracking ecosystem has been shifting from the client-side to the server-side. Instead of sending requests directly to the tracker's endpoint, server-side tracking (SST) sends tracking requests to publisher-controlled or intermediary endpoints that then forward the information to trackers from the server-side. As a result, client-side tracking protections are becoming fragile because direct client-to-tracker requests may no longer be observed. In this paper, we investigate the server-side Google Analytics (sGA), the most widely deployed third-party tracking service on the web today. We present SST-GUARD, a multi-modal browser-based approach for detecting sGA. The key insight behind SST-GUARD is that common sGA deployments change the standard Google Analytics endpoints, but still leave semantic artifacts of data collection by Google Analytics in the browser, including identifiers, event metadata, cookies, and JavaScript state. SST-GUARD detects these artifacts using value-templates, which use regular expressions to match semantic value patterns across multiple modalities: network requests, cookies, and the window object, providing robustness against obfuscation of one modality. We validate SST-GUARD on Tranco top-10k websites, detecting 4.0% (401) sGA domains with over 93.0% accuracy across three modalities, with network request classifier demonstrating the highest accuracy (99.8%). Additionally, SST-GUARD identifies atleast 43.2% more websites that integrate sGA as compared to prior approaches. Deploying SST-GUARD at scale, we detect sGA on 6,314 of Tranco top-150K websites. Our analysis shows that many sGA deployments use first-party subdomains, direct A/AAAA records, custom paths, or encoded payloads that circumvent existing defenses. We reported our findings to the authors of EasyPrivacy, who have integrated them.
Updated: 2026-11-19 17:13:04
标题: SST-Guard:野外环境中服务端 Google Analytics 的检测与特征分析
摘要: 随着网页浏览器日益实现反跟踪功能,网页跟踪生态系统正逐渐从客户端转向服务器端。服务器端跟踪(SST)不再直接向跟踪器端点发送请求,而是将跟踪请求发送到由发布者控制或由中间方提供的端点,再由这些端点从服务器端将信息转发给跟踪器。因此,客户端跟踪防护正变得脆弱,因为客户端直接向跟踪器发出的请求可能已无法被观察到。本文研究了服务器端 Google Analytics(sGA),这是目前网页上部署最广泛的第三方跟踪服务。我们提出了 SST-GUARD,一种基于浏览器的多模态 sGA 检测方法。SST-GUARD 的关键洞见在于,常见的 sGA 部署会改变标准的 Google Analytics 端点,但仍会在浏览器中留下 Google Analytics 数据收集的语义痕迹,包括标识符、事件元数据、Cookie 和 JavaScript 状态。SST-GUARD 使用值模板检测这些痕迹。值模板利用正则表达式,在多种模态中匹配语义值模式,包括网络请求、Cookie 和 window 对象,从而能够在某一种模态被混淆时保持稳健性。我们在 Tranco 排名前 1 万的网站上验证了 SST-GUARD:在三种模态下,以超过 93.0% 的准确率检测出 4.0%(401 个)的 sGA 域名,其中网络请求分类器的准确率最高,达到 99.8%。此外,与先前方法相比,SST-GUARD 识别出的集成 sGA 的网站数量至少多出 43.2%。在大规模部署 SST-GUARD 后,我们在 Tranco 排名前 15 万的网站中,有 6,314 个检测到 sGA。分析表明,许多 sGA 部署使用第一方子域名、直接的 A/AAAA 记录、自定义路径或编码后的载荷,从而绕过现有防御机制。我们已将这些发现报告给 EasyPrivacy 的作者,他们已将其纳入其中。
更新时间: 2026-11-19 17:13:04
领域: cs.CR,cs.CY
Asuka-FM: A System-Architectural Co-Design Framework for Efficient Text-to-Image Pretraining on Consumer Hardware
Frontier text-to-image (T2I) foundation models predominantly rely on multi-billion parameter Diffusion Transformers (DiTs) pretrained across massive compute clusters, creating an accessibility barrier for academic laboratories. When training DiTs from scratch on single consumer GPUs (e.g., an NVIDIA RTX 4090 with 24\,GB VRAM), practitioners encounter three primary bottlenecks: quadratic attention sequence costs, Just-In-Time (JIT) compilation graph breaks induced by variable aspect-ratio bucketing, and an autoencoder throughput wall where frozen Variational Autoencoder (VAE) operations dominate step latency. In this work, we introduce \textbf{Asuka-FM}, an end-to-end system and architectural framework demonstrating that competitive dual-stream DiTs ($\sim$206M parameters) can be pretrained from scratch on a single consumer GPU in $\sim$160 GPU hours for under \$55. Asuka-FM integrates four core designs: (i) an AdaLN-free dual-stream DiT backbone reducing parameter count; (ii) structured sequence sparsification via Sparse-Dense Residual Fusion (SPRINT) to cut attention FLOPs by over 50\%; (iii) continuous aspect-normalized Rotary Position Embeddings (RoPE) coupled with shifted square crop training, guaranteeing static tensor shapes while unlocking zero-shot virtual camera control; and (iv) a pixel adaptation phase utilizing a lightweight (10M parameter) Patch Detailer Head operating under velocity regression ($v$-prediction). Evaluated on open-domain benchmarks without benchmark-specific fine-tuning, Asuka-FM achieves GenEval 0.588 / DPG 78.96 scores at 256px and GenEval 0.609 / DPG 78.51 scores at 512px, setting a new Pareto-optimal efficiency standard for democratic foundation modeling.
Updated: 2026-11-19 17:12:34
标题: Asuka-FM:面向消费级硬件高效文本到图像预训练的系统架构协同设计框架
摘要: 前沿的文本到图像(T2I)基础模型主要依赖拥有数十亿参数的扩散 Transformer(DiT),并在大规模计算集群上进行预训练,这为学术实验室带来了难以逾越的使用门槛。在单张消费级 GPU(例如配备 24 GB 显存的 NVIDIA RTX 4090)上从头训练 DiT 时,实践者会遇到三个主要瓶颈:二次增长的注意力序列开销、可变宽高比分桶所引发的即时(JIT)编译图中断,以及自编码器吞吐瓶颈——冻结的变分自编码器(VAE)操作占据了每个训练步的大部分延迟。 在本研究中,我们提出了 Asuka-FM,这是一个端到端系统与架构框架,证明了具有竞争力的双流 DiT(约 2.06 亿参数)能够在单张消费级 GPU 上从头预训练完成,耗时约 160 个 GPU 小时,成本低于 55 美元。Asuka-FM 集成了四项核心设计:(i)采用无 AdaLN 的双流 DiT 主干网络,以减少参数量;(ii)通过稀疏—稠密残差融合(SPRINT)实现结构化序列稀疏化,使注意力 FLOPs 降低超过 50%;(iii)将连续的宽高比归一化旋转位置嵌入(RoPE)与平移方形裁剪训练相结合,在保证张量形状静态不变的同时,实现零样本虚拟相机控制;(iv)利用一个轻量级的图像块细节增强头进行像素适配阶段,该模块包含 1000 万参数,并采用速度回归(v-prediction)。 在未针对特定基准进行微调的开放域基准测试中,Asuka-FM 在 256 像素分辨率下取得了 GenEval 0.588 和 DPG 78.96 的得分,在 512 像素分辨率下取得了 GenEval 0.609 和 DPG 78.51 的得分,树立了面向普惠型基础模型研究的新型帕累托最优效率标准。
更新时间: 2026-11-19 17:12:34
领域: cs.CV,cs.AI
Synthetic Neurosymbolic Task Generation with Controlled Constraint Complexity
We introduce NeSySy, a synthetic generator for neurosymbolic learning tasks that jointly produces logical constraints and consistent datasets. Unlike existing benchmarks, NeSySy provides fine-grained control over key properties such as constraint structure, tightness, input dependence, and data generation and alignment strategies. In particular, it allows the use of rich constraints over infinite domains, and uses solvers to ensure that the constraints are meaningful and that generated samples satisfy the constraints. We design NeSySy to support both learning with declarative constraints and learning from distant supervision. Across a range of constraint families, we provide evidence that its parameters induce systematic and largely independent effects on task difficulty. Using NeSySy, we study constraint-aware learning methods, identifying regimes where explicit constraint enforcement is beneficial and where expressive unconstrained models can instead learn constraint structure directly from data. Our results establish NeSySy as a controlled testbed for analysing the interaction between learning and logical structure. NeSySy is built around a pipeline that incorporates solvers. Satisfiability checkers (CNFgen and Z3) generate and certify constraints. Constrained optimizers (RC2 for MaxSAT, Z3 for OMT) compute optimal repairs that guarantee every generated sample is consistent.
Updated: 2026-11-19 17:07:34
标题: 具有可控约束复杂度的神经符号任务合成生成
摘要: 我们介绍了 NeSySy,这是一种用于神经符号学习任务的合成生成器,能够联合生成逻辑约束和相一致的数据集。不同于现有基准,NeSySy 可对约束结构、紧致性、输入依赖性以及数据生成与对齐策略等关键属性进行细粒度控制。特别是,它支持在无限域上使用丰富的约束,并利用求解器确保约束具有实际意义,且生成的样本满足这些约束。 我们设计 NeSySy 以支持带声明式约束的学习和基于远程监督的学习。在一系列约束族上,我们提供了证据表明,其参数会对任务难度产生系统性且大体相互独立的影响。利用 NeSySy,我们研究了约束感知学习方法,确定了显式约束执行有益的情形,以及具有表达能力的无约束模型能够直接从数据中学习约束结构的情形。我们的结果表明,NeSySy 是一个可控的测试平台,可用于分析学习与逻辑结构之间的相互作用。 NeSySy 围绕一个整合求解器的流程构建。可满足性检查器(CNFgen 和 Z3)负责生成并验证约束。受约束优化器(用于 MaxSAT 的 RC2 和用于 OMT 的 Z3)计算最优修复,从而保证每个生成的样本都与约束相一致。
更新时间: 2026-11-19 17:07:34
领域: cs.LG,cs.AI,cs.LO,cs.NE,cs.SC
Exact Bayesian layers via characteristic functions
Bayesian neural networks provide principled uncertainty estimates, but training them with Monte Carlo sampling can be expensive. Sampling-free variational inference algorithms make training Bayesian neural networks feasible, but existing approaches assume a Gaussian output distribution, which can be inaccurate in applied problems. Here, we introduce CF-Prop, an uncertainty propagation method that uses characteristic functions to compute the exact output distribution of a Bayesian ReLU layer, without any sampling, even in non-Gaussian settings. Because CF-Prop propagates characteristic functions, the evidence lower bound---the objective of variational training---can be computed in closed form for a broad class of likelihoods, including the Gaussian, Poisson, and Gamma. This allows to implement an efficient resulting variational inference algorithm, CF-VI. On CIFAR-100, CF-VI achieves the lowest calibration error of any tested method, improving on the next best method by about 35%. On a heavy-tailed insurance claim dataset, CF-VI accurately captures tail uncertainty that is severely underestimated by both other sampling-free methods and Monte Carlo methods.
Updated: 2026-11-19 17:04:30
标题: 通过特征函数实现的精确贝叶斯层
摘要: 贝叶斯神经网络能够提供具有理论依据的不确定性估计,但使用蒙特卡洛采样训练这类网络的计算成本可能很高。无需采样的变分推断算法使训练贝叶斯神经网络成为可能,但现有方法假设输出分布为高斯分布,而在实际应用问题中,这一假设可能并不准确。为此,我们提出 CF-Prop:一种利用特征函数进行不确定性传播的方法,无需任何采样,即可计算贝叶斯 ReLU 层的精确输出分布,即使在非高斯情形下也能实现。由于 CF-Prop 传播的是特征函数,因此对于包括高斯分布、泊松分布和伽马分布在内的广泛似然函数类别,证据下界——变分训练的目标函数——都可以以闭式形式计算。由此可以实现一种高效的变分推断算法 CF-VI。在 CIFAR-100 上,CF-VI 在所有测试方法中取得了最低的校准误差,比次优方法降低了约 35%。在一个具有重尾特征的保险理赔数据集上,CF-VI 能够准确捕捉尾部不确定性,而其他无需采样的方法和蒙特卡洛方法都严重低估了这种不确定性。
更新时间: 2026-11-19 17:04:30
领域: stat.ML,cs.LG,stat.CO
ScenarioForge: Resource-Grounded Generation and Execution Validation of Cyber Exercises
Cyber-range and capture-the-flag scenario construction remains labor-intensive because authors must coordinate infrastructure, vulnerable services, attack paths, artifacts, and success conditions. LLMs can propose detailed exercises, but plausible descriptions do not guarantee deployable software or verifiable objectives. We present ScenarioForge, which turns high-level requirements into resource-grounded topologies, services, traffic, segmentation, and challenge chains, then instantiates and validates them in the Common Open Research Emulator (CORE). The ScenarioForge Execution Dataset contains 226 materialized scenarios covering 294 Vulhub images and all 85 custom-built challenge-resource generators developed with our AI-assisted scaffolding. All 226 passed construction, preview, sequencing, deployment, strict runtime validation, and live artifact checks; their 867 steps, each an individually verifiable challenge objective, comprise 457 vulnerability-backed and 410 generated-resource-backed instances. In a separate 50-prompt matched benchmark, ScenarioForge+Qwen3.8 and ScenarioForge+GPT5.6 each achieved 50/50 (100%) topology/build success and 160/160 intent fields; direct frontier generation reached 41/50 builds and 147/160 fields only with the full cumulative scaffold: structure, vocabulary, policy, and container-image guidance. The test still omitted ScenarioForge's downstream challenge-resource generation, dependency/flag sequencing, deployment, and live validation. The artifacts support operationally rich, reproducible exercises for training and evaluation.
Updated: 2026-11-19 17:04:14
标题: ScenarioForge:基于资源的网络演练生成与执行验证
摘要: 网络靶场与夺旗赛场景的构建仍然十分耗费人力,因为作者必须协调基础设施、易受攻击的服务、攻击路径、工件以及成功条件。大型语言模型能够提出详细的练习方案,但看似合理的描述并不能保证软件可部署或目标可验证。我们提出了 ScenarioForge,它将高层需求转换为以资源为依据的拓扑、服务、流量、分段和挑战链,随后在通用开放研究仿真器(Common Open Research Emulator,CORE)中实例化并验证这些内容。ScenarioForge 执行数据集包含 226 个已具体化的场景,覆盖 294 个 Vulhub 镜像,以及我们借助人工智能辅助脚手架开发的全部 85 个定制挑战资源生成器。全部 226 个场景均通过了构建、预览、排序、部署、严格运行时验证和实时工件检查;其中的 867 个步骤均为可单独验证的挑战目标,包括 457 个由漏洞支撑的实例和 410 个由生成资源支撑的实例。在另一项包含 50 个提示词的匹配基准测试中,ScenarioForge+Qwen3.8 和 ScenarioForge+GPT5.6 均实现了 50/50(100%)的拓扑与构建成功率,并完成了 160/160 个意图字段;只有在使用完整的累积脚手架——包括结构、词汇、策略和容器镜像指导——的情况下,直接使用前沿模型生成的结果才达到 41/50 的构建成功率和 147/160 个字段。该测试仍未涵盖 ScenarioForge 后续的挑战资源生成、依赖关系与标志位排序、部署以及实时验证。相关工件支持构建内容丰富、可复现的实战练习,用于培训与评估。
更新时间: 2026-11-19 17:04:14
领域: cs.CR,cs.AI
Seer: Guiding Small Deep-Research Agents with Shared Decision Models
Deep-research agents repeatedly decide what to search, read, and verify, often using large cloud-hosted language models for action proposal. However, privacy and local control motivate running agents on users' devices, where limited memory and compute favor smaller models and complicate on-device training. Yet inference-time guidance faces three obstacles: exploring alternatives through real execution adds tool calls, prompted self-evaluation is bounded by the agent's judgment, and model-specific guidance risks repeated adaptation costs. We introduce Seer, an inference-time framework providing local guidance that separates the agent's action proposal from learned consequence prediction and value estimation. From a shared corpus of real research trajectories, we train two models: a tool-response simulator on observed call--response pairs and a value estimator on histories labeled with discounted terminal correctness. The simulator and estimator are trained offline and reused across agents without further training. Moreover, Seer executes only the selected action and adds only real tool responses to the committed history, avoiding tool calls on discarded candidates at additional inference cost. Across multiple deep-research benchmarks, Seer substantially improves agent performance for different language models. For instance, GAIA accuracy rises from 13.6% to 41.7% for Qwen3.5-4B and from 22.3% to 50.5% for Qwen3.5-9B. Furthermore, our analyses suggest that broader candidate coverage can compensate for imperfect simulation, while prediction and scoring errors limit the benefits of wider imagined search. These findings highlight the potential of reusable models for prediction and evaluation to strengthen small research agents through extra local computation without the real execution of the discarded candidates.
Updated: 2026-11-19 17:03:24
标题: Seer:用共享决策模型引导小型深度研究智能体
摘要: 深度研究智能体会反复决定要搜索、阅读和验证哪些内容,通常利用云端部署的大型语言模型来提出行动方案。然而,隐私和本地控制的需求促使人们将智能体运行在用户设备上;在这种环境下,有限的内存和计算资源更适合使用较小的模型,也使设备端训练变得更加复杂。尽管如此,推理时引导仍面临三个障碍:通过实际执行来探索替代方案会增加工具调用次数;基于提示的自我评估受限于智能体自身的判断能力;而针对特定模型的引导又可能带来反复适配的成本。 我们提出了 Seer,一种推理时框架,能够提供本地引导,并将智能体的行动提议与学习得到的后果预测和价值估计分离开来。我们从真实研究轨迹构成的共享语料库中训练了两个模型:一个基于观测到的调用—响应对训练工具响应模拟器,另一个基于带有折扣终止正确性标签的历史记录训练价值估计器。模拟器和估计器均离线训练,并可由不同智能体复用,无需进一步训练。此外,Seer 只执行最终选定的行动,并仅将真实工具响应添加到已提交的历史记录中,从而避免对被舍弃的候选方案进行工具调用,同时不会产生额外的推理成本。 在多个深度研究基准上,Seer 显著提升了不同语言模型驱动的智能体性能。例如,Qwen3.5-4B 的 GAIA 准确率从 13.6% 提升至 41.7%,Qwen3.5-9B 的准确率则从 22.3% 提升至 50.5%。此外,我们的分析表明,更广泛的候选方案覆盖能够弥补模拟不完善的问题,而预测误差和评分误差会限制扩大想象搜索所带来的收益。这些发现凸显了可复用的预测与评估模型的潜力:无需实际执行被舍弃的候选方案,仅通过增加本地计算,就能增强小型研究智能体的能力。
更新时间: 2026-11-19 17:03:24
领域: cs.AI
Reasoning-Trace Analysis Using Large Language Models for Interpretable Q-Matrix Construction
Large language models (LLMs) can generate Q-matrices for diagnostic classification models that approximate expert specifications, but evaluations have focused on the final matrices, leaving the basis of individual item-attribute assignments unexamined. This opacity limits the responsible use of AI in measurement. We propose Reasoning-Trace Analysis (RTA), a framework in which an LLM generates attribute-labeled reasoning steps through chain-of-thought (CoT) prompting and these steps are analyzed to reconstruct, compare, and inspect each assignment. RTA is intended to supplement expert review and empirical validation. In a simulation study with perturbed fraction subtraction items, four LLMs recovered the required attributes and withheld attributes the items did not require. In an empirical study with 11 fraction subtraction items, responses from 536 examinees, four LLMs, up to three temperatures, and 100 replications per condition, CoT-derived Q-matrices overlapped substantially with the reference Q-matrix (mean overlap .809) but less than directly generated Q-matrices (.877), and they varied more across replications. Inspection of the traces linked disagreements to item-type coding, labeling rules, and how operations were expressed as steps. Q-matrices with similar overlap differed in fit to examinee responses. RTA provides inspectable evidence that matrix-level agreement and fit do not.
Updated: 2026-11-19 17:03:16
标题: 利用大型语言模型进行推理轨迹分析以构建可解释的 Q 矩阵
摘要: 大型语言模型(LLM)能够为诊断分类模型生成近似专家设定的 Q 矩阵,但现有评估主要关注最终矩阵,而未考察各题目—属性分配的依据。这种不透明性限制了人工智能在测量中的负责任使用。我们提出推理轨迹分析(Reasoning-Trace Analysis,RTA)框架:通过思维链(CoT)提示,让 LLM 生成带有属性标签的推理步骤,并对这些步骤进行分析,以重构、比较和审查每一项分配。RTA 旨在补充专家审查和实证验证。在一项包含经过扰动的分数减法题目的模拟研究中,四个 LLM 均识别出了所需属性,并排除了题目不需要的属性。在一项实证研究中,我们使用了 11 道分数减法题、536 名被试的作答数据、四个 LLM、最多三种温度设置,以及每种条件下 100 次重复实验。由思维链生成的 Q 矩阵与参考 Q 矩阵有较大重叠(平均重叠度为 .809),但低于直接生成的 Q 矩阵(.877),且不同重复实验之间的变异更大。对推理轨迹的考察表明,分歧与题目类型编码、标注规则以及如何将运算表达为步骤有关。重叠度相近的 Q 矩阵在拟合被试作答数据方面可能存在差异。RTA 提供了矩阵层面的一致性和拟合度无法提供的、可供审查的证据。
更新时间: 2026-11-19 17:03:16
领域: cs.AI
Awaken-HI: Scaling Humanoid Intelligence with Whole-Body Human Experience
A central goal of humanoid robotics is for robots to perform the everyday work people do in homes and workplaces. Existing egocentric video datasets cover many of these activities but provide little synchronized whole-body motion data for learning loco-manipulation at scale. We build Awaken-Human, which pairs approximately 50,000 hours of egocentric stereo video with synchronized whole-body human motion and covers more than 100 skills. Building on this, we also introduce Awaken-HI (Humanoid Intelligence), a vision-language-action model for humanoid loco-manipulation that jointly predicts original human motion and retargeted robot actions through a shared action expert. We show that loco-manipulation skills transfer more effectively from people to humanoids when human trajectories directly supervise the shared action expert. Increasing human pretraining data reduces held-out robot action prediction error according to an empirical scaling law and raises the mean success rate on downstream real-robot tasks. After full-corpus pretraining and T800 adaptation, Awaken-HI achieves a mean success rate of 93.75% across eight individual tasks and outperforms GR00T N1.7 and $π_{0.5}$ in both individual and long-horizon evaluations. The same policy generalizes to objects unseen during robot post-training and to new pairings of familiar objects and destinations.
Updated: 2026-11-19 17:03:03
标题: Awaken-HI:利用全身人类经验扩展人形智能
摘要: 人形机器人学的核心目标之一,是让机器人能够在人们的家庭和工作场所执行日常工作。现有的第一视角视频数据集涵盖了许多此类活动,但所提供的同步全身运动数据十分有限,难以大规模学习移动操作技能。我们构建了 Awaken-Human,将约 50,000 小时的第一视角立体视频与同步的全身人体运动配对,并涵盖 100 多项技能。在此基础上,我们还提出了 Awaken-HI(Humanoid Intelligence,人形智能),这是一种面向人形机器人移动操作的视觉—语言—动作模型,通过共享动作专家联合预测原始人体运动和重定向后的机器人动作。我们表明,当人体轨迹直接监督共享动作专家时,移动操作技能能够更有效地从人类迁移到人形机器人。根据经验缩放定律,增加人体预训练数据可以降低留出的机器人动作预测误差,并提高下游真实机器人任务的平均成功率。在完成全语料预训练和 T800 适配后,Awaken-HI 在八项独立任务中的平均成功率达到 93.75%,并且在独立任务和长时程评估中均优于 GR00T N1.7 和 $π_{0.5}$。同一策略还能泛化到机器人后训练阶段未见过的物体,以及熟悉物体与目标位置的新组合。
更新时间: 2026-11-19 17:03:03
领域: cs.RO,cs.AI,cs.CV
FEA solver integration of a composite World Model with a Spiking Neural Network memory Block for computationally efficient modelling of defects and variabilities
Each fibre-reinforced composite structure has a unique material architecture. The manufacturing methods used and the presence of defects lead to local variations which require material-scale models that can resolve the response in real time at every location in the structure. Concurrent multi-scale schemes provide this capability, but at a prohibitive computational cost for large structures as the number of integration points and time increments scales with size. Surrogates have been studied extensively as replacements for material-scale models to mitigate these computational limitations. A surrogate must represent an arbitrary local architecture including defects, track the irreversible material state over an unknown number of increments, remain stable when driven recursively by its own predictions, and fit within the memory available at every integration point. Here, a Composites World Model based on a Multi-Modal Spiking Transformer architecture is designed to meet these requirements. The proposed architecture combines a material encoder, a Spiking Neural Network memory block that tracks the long-term internal state of the material, and transformer blocks that learn the short-term applied strain state. The system is trained in three stages: material architecture encoding, base training on short time windows, and recursive fine-tuning with scheduled sampling to suppress cumulative error drift. The trained model is disassembled at inference and coupled to a non-linear FE solver, enabling structural scale simulation of composites containing embedded defects. Benchmarks against experimental results for IM7/8552 laminates under tension, compression and transverse shear, for pristine and wrinkled composites, show that the SNN memory block successfully tracks the material internal state and results in prediction errors between 0.4% and 4.8%.
Updated: 2026-11-19 17:02:29
标题: 复合世界模型与脉冲神经网络记忆模块的有限元分析求解器集成:用于高计算效率地模拟缺陷与变异
摘要: 每种纤维增强复合材料结构都具有独特的材料架构。所采用的制造方法以及缺陷的存在会导致局部差异,因此需要材料尺度模型在结构的每个位置实时解析其响应。并发多尺度方案能够实现这一能力,但由于积分点数量和时间增量数量随结构尺寸增加而增加,其计算成本对于大型结构而言高得难以接受。为缓解这些计算限制,代理模型作为材料尺度模型的替代方案已得到广泛研究。代理模型必须能够表征包括缺陷在内的任意局部架构,在未知数量的增量下跟踪不可逆的材料状态,在由自身预测结果递归驱动时保持稳定,并且满足每个积分点可用的内存限制。本文提出了一种基于多模态脉冲变换器架构的复合材料世界模型,以满足上述要求。所提出的架构结合了材料编码器、用于跟踪材料长期内部状态的脉冲神经网络记忆模块,以及用于学习短期施加应变状态的变换器模块。该系统分三个阶段进行训练:材料架构编码、基于短时间窗口的基础训练,以及采用计划采样进行递归微调,以抑制累积误差漂移。在推理阶段,训练好的模型被拆分,并与非线性有限元求解器耦合,从而能够对含有嵌入式缺陷的复合材料进行结构尺度模拟。针对无缺陷和含褶皱复合材料,在拉伸、压缩和横向剪切载荷下对IM7/8552层合板的实验结果进行基准验证表明,SNN记忆模块能够成功跟踪材料内部状态,预测误差介于0.4%和4.8%之间。
更新时间: 2026-11-19 17:02:29
领域: cs.LG
ZeroVLN: Learning to Navigate without Supervised Fine-Tuning of the VLM Brain
Representative vision-language navigation (VLN) methods typically couple a vision-language model (VLM) brain with a learnable action head and fine-tune the VLM brain on navigation-domain data to predict geometric goals. However, such adaptation can substantially alter base VLM weights and degrade general visual capabilities. We introduce ZeroVLN, a slow-fast navigation framework that achieves effective navigation with zero navigation-domain SFT of the VLM brain. Rather than teaching the brain to predict geometric goals, we equip it with a semantic tool-calling interface for conveying movement decisions to an action expert in natural language. We first adapt the action expert to carry out these movement requests, then jointly improve the brain's movement decisions and the action expert's continuous execution through closed-loop reinforcement learning (RL). Trained on the same navigation episodes, ZeroVLN substantially outperforms representative SFT-based hierarchical VLN methods on standard VLN-CE (continuous environments) benchmarks, while inducing only minor changes to the brain's weights and largely preserving its general capabilities. To our knowledge, ZeroVLN is the first slow-fast VLN framework with zero navigation-domain SFT of the VLM brain, and the first to jointly optimize its slow and fast policies through closed-loop agentic RL in VLN-CE.
Updated: 2026-11-19 17:01:00
标题: ZeroVLN:无需对视觉语言模型大脑进行监督微调的导航学习
摘要: 代表性的视觉—语言导航(VLN)方法通常将视觉—语言模型(VLM)大脑与一个可学习的动作头相结合,并在导航领域数据上对 VLM 大脑进行微调,以预测几何目标。然而,这种适应过程可能会显著改变基础 VLM 的权重,并削弱其通用视觉能力。我们提出了 ZeroVLN,一种无需对 VLM 大脑进行导航领域监督微调(SFT)即可实现有效导航的慢—快导航框架。我们不再教导大脑预测几何目标,而是为其配备一个语义工具调用接口,使其能够通过自然语言向动作专家传达运动决策。我们首先使动作专家适应并执行这些运动请求,随后通过闭环强化学习(RL)共同改进大脑的运动决策能力和动作专家的连续执行能力。在相同的导航轨迹上进行训练后,ZeroVLN 在标准 VLN-CE(连续环境)基准测试中显著优于具有代表性的基于 SFT 的分层 VLN 方法,同时仅导致大脑权重发生微小变化,并在很大程度上保留其通用能力。据我们所知,ZeroVLN 是首个无需对 VLM 大脑进行导航领域 SFT 的慢—快 VLN 框架,也是首个在 VLN-CE 中通过闭环智能体强化学习共同优化其慢策略和快策略的方法。
更新时间: 2026-11-19 17:01:00
领域: cs.AI
Sequential Anytime Valid Tests for Efficient Inference-Time Alignment
Inference-time alignment methods, such as Best-of-N (BoN), improve language model outputs by generating multiple candidates per prompt and selecting among them using a reward model. Much of this cost is wasted: a fixed budget is applied to every prompt, although the computation required by prompts varies widely. Adaptive methods halt once sampled answers appear settled, but their thresholds are tuned heuristics with no statistical control over early-stopping errors. We instead seek an anytime-valid stopping rule that takes an error tolerance $α$ as input and halts only once an answer is certified to hold a majority ($θ_a > 1/2$) under the generator's distribution. We aggregate candidates by final answer with a reward-weighted self-consistency (RWSC) score and treat stopping as a sequential test over the resulting clusters. Applying Wald's sequential probability ratio test to these clusters yields SPRT-RWSC, which performs well empirically, but its guarantee fails because the leading answer shifts during sampling, and the run is continuously monitored. Our main contribution, e-RWSC, replaces Wald's test with a betting supermartingale (an e-process) for every answer the policy produces, bounding the probability of ever certifying a non-dominant answer by $α$, uniformly over time and across all answers. The RWSC scores drive the bets, so they affect only how quickly a dominant answer $a^\star$ is certified, not validity; certification takes $O(\log(1/α)/d_{\mathrm{KL}}(θ_{a^\star}\|1/2))$ samples. Experiments across several language models, datasets, and reward models confirm the predicted $1/d_{\mathrm{KL}}$ scaling of cost and show that accuracy improves over baselines at substantially lower token cost.
Updated: 2026-11-19 17:00:42
标题: 用于高效推理时对齐的序贯任意时有效检验
摘要: 推理时对齐方法(例如 Best-of-N,BoN)通过针对每个提示生成多个候选答案,并利用奖励模型在其中进行选择,从而提升语言模型的输出质量。然而,这一过程中的大量成本被浪费了:尽管不同提示所需的计算量差异很大,固定的预算却被应用于每个提示。自适应方法会在采样答案看起来趋于稳定时停止,但其阈值依赖经过调节的启发式规则,无法对提前停止所产生的错误提供统计控制。我们转而寻求一种任时有效的停止规则:该规则以误差容忍度 α 作为输入,并且仅在能够证明某个答案在生成器分布下占据多数(θ_a > 1/2)时才停止。我们使用奖励加权自洽性(RWSC)分数,按照最终答案对候选结果进行聚合,并将停止过程视为对所得答案簇进行的序贯检验。将 Wald 序贯概率比检验应用于这些答案簇后,可得到 SPRT-RWSC。该方法在经验上表现良好,但其保证无法成立,因为领先答案会在采样过程中发生变化,且整个运行过程会被持续监控。我们的主要贡献 e-RWSC,则为策略生成的每个答案分别使用投注超鞅(即 e-process)替代 Wald 检验,从而将曾经错误认证某个非主导答案的概率控制在 α 以内,并且这一保证在所有时间点以及所有答案上均一致成立。RWSC 分数用于驱动投注,因此它们只会影响主导答案 a* 被认证的速度,而不会影响方法的有效性;认证所需的样本数为 O(log(1/α)/d_KL(θ_{a*}‖1/2))。在多个语言模型、数据集和奖励模型上的实验验证了成本随 1/d_KL 变化的理论预测,并表明,与基线方法相比,该方法能够以显著更低的词元成本提升准确率。
更新时间: 2026-11-19 17:00:42
领域: cs.LG
How to Effectively Manage the Energy in Residential Systems: Development and Comparison of Methods
The transition from fossil fuels presents significant challenges in energy management. To ensure a sustainable energy future, it is crucial to reduce energy consumption when possible and to synchronize electricity consumption and storage with the production from sources with low greenhouse gas emissions. This thesis explores a variety of energy management methods used to manage batteries, heat pumps, and other energy-related systems. The thesis presents three simulation cases alongside one real-world experiment to compare energy management done through simple rules, optimization, and machine learning methods. Furthermore, this thesis introduces TreeC, a novel machine learning-based method that learns understandable yet efficient energy management strategies, applicable to many cases. The three key contributions of this thesis can be summarized as follows: 1) The developed TreeC method demonstrates competitive performance compared to a variety of energy management approaches, such as model predictive control and reinforcement learning, across a diverse set of energy management problems. The understandability of TreeC's energy management strategies greatly improves the transparency and trustworthiness of machine learning-based energy management. 2) The real-world experiment highlights the need to validate energy management methods on actual hardware and not solely on simulations. Both TreeC and model predictive control performed worse than in simulations, due to, respectively, insufficiently representative training data and the real-time input data not being reliable enough. 3) Energy management algorithms reduce costs in electrified Belgian dwellings, particularly in poorly insulated dwellings, electric vehicle chargers, and photovoltaic installations. However, on average, these cost savings do not yet outweigh the current costs and effort required to implement such algorithms.
Updated: 2026-11-19 16:59:58
标题: 如何有效管理住宅系统中的能源:方法的开发与比较
摘要: 从化石燃料过渡到其他能源形式给能源管理带来了重大挑战。为了确保能源的可持续未来,尽可能降低能源消耗,并使电力消费和储能与低温室气体排放能源的生产相协调至关重要。本论文探讨了用于管理电池、热泵及其他能源相关系统的多种能源管理方法。论文通过三个仿真案例和一项真实世界实验,对比了采用简单规则、优化方法和机器学习方法进行能源管理的效果。此外,本论文还介绍了一种新颖的基于机器学习的方法TreeC,该方法能够学习易于理解且高效的能源管理策略,并适用于多种场景。 本论文的三项主要贡献可概括如下:1)所开发的TreeC方法在一系列多样化的能源管理问题中展现出具有竞争力的性能,其表现可与模型预测控制和强化学习等多种能源管理方法相媲美。TreeC能源管理策略的可理解性显著提升了基于机器学习的能源管理的透明度和可信度。2)真实世界实验凸显了在实际硬件上验证能源管理方法的必要性,而不能仅依赖仿真。TreeC和模型预测控制的表现均逊于仿真结果,前者是由于训练数据的代表性不足,后者则是因为实时输入数据不够可靠。3)能源管理算法能够降低比利时电气化住宅的成本,尤其适用于隔热性能较差的住宅、电动汽车充电器和光伏设施。然而,总体而言,目前这些成本节约尚不足以抵消实施此类算法所需的现有成本和投入。
更新时间: 2026-11-19 16:59:58
领域: eess.SY,cs.LG,cs.NE
The Dichotomy Between Pattern Recognition and Step-by-Step Reasoning
We argue that pattern recognition and step-by-step reasoning are two ends of a spectrum. A large language model (LLM) learns to reason step-by-step when data is structured such that the next token depends on a small amount of preceding context. Inference in LLMs resembles pattern recognition when the next token depends on a large amount of preceding context. If the next token depends on only the $c$ most recent tokens, reasoning traces are paths on a de Bruijn graph whose nodes are $c$-length contexts and edges are next-token transitions between contexts. The set of reasoning traces of a task forms a directed acyclic subgraph of the de Bruijn graph. An LLM that has learned all edges of this subgraph can compose them to solve longer, unseen tasks, i.e., it reasons step-by-step. We prove that the number of edges is vanishingly small compared to the number of reasoning traces. We also prove and show empirically that the number of training samples a transformer needs is a linear in the number of edges, so learning to reason step-by-step is sample efficient. We can induce de Bruijn structure in any task by maintaining a ``state'' that makes future reasoning independent of the past. The frequency of states in the reasoning trace determines $c$. We show, by fine-tuning Qwen2.5-1.5B-Instruct to solve equations and answer questions about stories, that frequent states (small $c$) result in higher accuracy but greater fragility to perturbations at test time. LLMs trained with a large $c$ are only as good as models that perform pattern recognition without reasoning. A moderate density of states balances accuracy and robustness. Real-world data has de Bruijn structure: Qwen3-14B and Qwen3-32B retain over 75\% of their accuracy on GSM8K, MATH-500 and GPQA-Diamond when attention is restricted to a sliding window less than 15\% as long as the full reasoning trace.
Updated: 2026-11-19 16:59:46
标题: 模式识别与逐步推理之间的二分性
摘要: 我们认为,模式识别与逐步推理是一个连续谱的两端。当数据的组织方式使得下一个词元仅依赖于少量前文时,大型语言模型(LLM)会学会逐步推理;而当下一个词元依赖于大量前文时,LLM中的推理则类似于模式识别。若下一个词元仅依赖于最近的 \(c\) 个词元,那么推理轨迹就是一张德布鲁因图上的路径:图中的节点是长度为 \(c\) 的上下文,边则表示上下文之间由下一个词元引起的转移。一个任务的推理轨迹集合构成德布鲁因图的一个有向无环子图。已经学习该子图全部边的LLM能够将这些边组合起来,以解决更长且未见过的任务,即进行逐步推理。我们证明,与推理轨迹的数量相比,边的数量小得可以忽略不计。我们还证明并通过实验证实,Transformer所需的训练样本数量与边的数量呈线性关系,因此,学习逐步推理具有较高的样本效率。通过维护一个使未来推理与过去无关的“状态”,我们可以在任何任务中诱导出德布鲁因结构。状态在推理轨迹中的出现频率决定了 \(c\) 的大小。我们通过微调Qwen2.5-1.5B-Instruct来解方程和回答有关故事的问题,发现频繁出现的状态(较小的 \(c\))能够带来更高的准确率,但在测试时对扰动也更加脆弱。使用较大 \(c\) 训练的LLM,其表现并不优于不进行推理而仅执行模式识别的模型。适中的状态密度能够在准确率与稳健性之间取得平衡。现实世界的数据具有德布鲁因结构:当注意力被限制在一个滑动窗口内,且该窗口长度不到完整推理轨迹长度的15%时,Qwen3-14B和Qwen3-32B在GSM8K、MATH-500和GPQA-Diamond上的准确率仍能保持在75%以上。
更新时间: 2026-11-19 16:59:46
领域: cs.LG,cond-mat.dis-nn
Statistical Inference with Ill-Conditioned Random Weight Neural Network Sieves
Random weight neural networks (RWNNs) are shallow networks whose hidden-layer parameters are randomly generated and then kept fixed, while only the output coefficients are estimated. Conditional on the sampled parameters, RWNN regression is a linear sieve problem with random approximation space. We show that such random sieves cannot remain uniformly well-conditioned as their dimension grows. For parametrized feature families satisfying polynomial covering and Lipschitz conditions, the eigenvalues of the population covariance matrix are proven to have polynomial upper bounds determined by the covering geometry of the parameter space, leading to a vanishing smallest eigenvalue. We develop approximation, estimation, and inference theory that explicitly treats the ill-conditioning. Under a $β$-Hölder source condition, we obtain both faster-than-Monte-Carlo $L^2$ approximation rates and new $L^\infty$ approximation bounds based on stratified sampling. We then derive improved consistency guarantees for ridge-regularized least squares driven by ridge effective dimension, spectral, and leverage-based stability conditions. For inference, we establish asymptotic linearity and Gaussian limits for linear functional directions while allowing the smallest eigenvalue of the population covariance matrix to vanish. Nondegeneracy is directional: we characterize it with a ridge-normalized Rayleigh quotient and extend it to smooth functionals via Riesz representation. Consistency of ridge-adjusted variance estimators is proved, yielding feasible studentized inference. Numerical experiments illustrate the deterioration of random-feature conditioning and the finite-sample behavior of the resulting estimation and inference procedures.
Updated: 2026-11-19 16:59:34
标题: 使用病态随机权重神经网络筛进行统计推断
摘要: 随机权重神经网络(RWNNs)是浅层网络,其隐藏层参数随机生成后保持固定,仅估计输出系数。在给定所抽取参数的条件下,RWNN 回归是一个具有随机逼近空间的线性筛选问题。我们证明,随着维数增加,这类随机筛选空间不可能始终保持一致良态。对于满足多项式覆盖条件和 Lipschitz 条件的参数化特征族,我们证明总体协方差矩阵的特征值具有由参数空间覆盖几何决定的多项式上界,从而导致最小特征值趋于零。我们建立了明确处理病态性的逼近、估计与推断理论。在 β-Hölder 源条件下,我们获得了快于蒙特卡洛速度的 L² 逼近率,以及基于分层抽样的新的 L∞ 逼近界。随后,我们基于岭有效维数、谱稳定性条件和杠杆率稳定性条件,推导出岭正则化最小二乘估计的改进一致性保证。对于推断问题,在允许总体协方差矩阵最小特征值趋于零的情况下,我们针对线性泛函方向建立了渐近线性表示和高斯极限。非退化性具有方向性:我们用岭归一化的 Rayleigh 商对其进行刻画,并通过 Riesz 表示将其推广到光滑泛函。我们证明了岭调整方差估计量的一致性,从而得到可行的学生化推断。数值实验展示了随机特征条件性的恶化,以及所得估计与推断程序在有限样本下的表现。
更新时间: 2026-11-19 16:59:34
领域: stat.ME,cs.LG,econ.EM,stat.ML
Déjà Cue: Localizing States in Object Histories via Vocabulary-Relative Coordinates
Object tracking preserves identity through visual changes, but cannot tell when an object is whole, cut, or peeled. We study state-moment retrieval: locating when a tracked object exhibits each state in a supplied set of descriptions. However, absolute image--text similarity can favor shared object semantics, obscuring the distinctions needed to localize individual states. Our insight is that the alternatives themselves provide a reference for measuring state evidence. We introduce Déjà Cue, a training-free framework that centers description embeddings on a state-balanced vocabulary mean, producing query directions that compare each state against its alternatives. Using frozen vision--language encoders, Déjà Cue calibrates frame scores and retrieves intervals at multiple durations within contiguous visible runs. We construct MS-VOST by annotating 620 object histories with 2,465 states. With the encoder and temporal search fixed, Déjà Cue improves all three localization metrics over absolute scoring across eight encoder configurations, raising Top-1 temporal IoU by 0.42--1.14 percentage points. These gains persist across four text constructions, and candidate-ranking analysis shows that the vocabulary reference brings relevant intervals forward within the same search space. These results establish the supplied state vocabulary as an object-specific reference for localizing semantic states from frozen visual representations.
Updated: 2026-11-19 16:57:24
标题: 似曾相识的线索:通过相对于词汇表的坐标定位对象历史中的状态
摘要: 目标跟踪能够在视觉变化中保持目标的身份,但无法判断目标何时处于完整、切开或剥皮等状态。我们研究状态时刻检索问题:定位被跟踪目标呈现给定描述集合中每种状态的时刻。然而,绝对图像—文本相似度可能偏向目标共享的语义,从而掩盖定位单个状态所需的差异。我们的核心洞见是,候选描述本身可以作为衡量状态证据的参照。为此,我们提出 Déjà Cue,一种无需训练的框架:以状态均衡的词汇均值为中心调整描述嵌入,生成将每种状态与其替代项进行比较的查询方向。借助冻结的视觉—语言编码器,Déjà Cue 对帧得分进行校准,并在连续可见片段内以多种时长检索时间区间。我们通过标注 620 条目标历史记录中的 2,465 个状态,构建了 MS-VOST 数据集。在固定编码器和时间搜索设置的情况下,Déjà Cue 在八种编码器配置下的三项定位指标均优于绝对得分方法,使 Top-1 时间交并比提升 0.42—1.14 个百分点。这些增益在四种文本构造方式下均得以保持;候选排序分析表明,在相同搜索空间内,词汇参照能够将相关区间提前。上述结果证明,给定的状态词汇可以作为特定目标的参照,用于从冻结的视觉表征中定位语义状态。
更新时间: 2026-11-19 16:57:24
领域: cs.CV,cs.LG,cs.MM
Flow Matching from Non-Gaussian Sources: A Theory of Efficient Sampling
Flow matching is a versatile framework for generative modeling that transports a source distribution to a target data distribution. A key advantage is its flexibility in the choice of source distribution, such as heavy-tailed and multimodal sources. Yet finite-step sampling guarantees for non-Gaussian sources remain limited. We establish a nonasymptotic convergence theory for Euler discretization of flow matching with linear interpolation. Suppose the source distribution on $\mathbb{R}^d$ has an everywhere positive, continuously differentiable density, finite total variance $\mathsf{TotVar}_{\mathsf{base}}$, and an $L$-Lipschitz score. Using the population velocity field and a suitable time grid, this sampler achieves total variation error at most $\varepsilon$ in $\widetilde{O}(Ld\mathsf{TotVar}_{\mathsf{base}}/\varepsilon)$ iterations, provided the target distribution satisfies a mild second-moment condition. These assumptions cover, among many examples, source distributions such as multivariate Student's $t$ distributions with more than two degrees of freedom and finite Gaussian mixtures with shared covariance, while accommodating target distributions with neither a smooth density nor bounded support.
Updated: 2026-11-19 16:54:03
标题: 来自非高斯源的流匹配:高效采样理论
摘要: 流匹配是生成建模的一种通用框架,其将源分布输运至目标数据分布。其一项关键优势在于源分布的选择具有灵活性,例如可以采用重尾分布和多峰分布。然而,对于非高斯源分布,有限步采样的理论保证仍然有限。我们建立了在线性插值下流匹配欧拉离散化的非渐近收敛理论。假设定义在 $\mathbb{R}^d$ 上的源分布具有处处为正且连续可微的密度、有限的总方差 $\mathsf{TotVar}_{\mathsf{base}}$,以及一个具有 $L$-Lipschitz 性质的得分函数。使用总体速度场和适当的时间网格,该采样器在迭代 $\widetilde{O}(Ld\mathsf{TotVar}_{\mathsf{base}}/\varepsilon)$ 次后,可实现至多为 $\varepsilon$ 的总变差误差,前提是目标分布满足一个温和的二阶矩条件。这些假设涵盖了许多源分布实例,包括自由度大于二的多元 Student-$t$ 分布以及具有共享协方差矩阵的有限高斯混合分布,同时也允许目标分布既不具有光滑密度,也不具有有界支集。
更新时间: 2026-11-19 16:54:03
领域: stat.ML,cs.AI,cs.IT,cs.LG
Balance of Benchmarks: Evidence Retention and Multiplicity-Aware Model Comparison
Benchmark aggregation requires decisions about how much evidence to use and how much influence each benchmark receives. Curated suites control influence through selection, which can exclude informative observations. A broader pool can retain those observations. With equal weighting, repeated or closely related benchmarks gain influence as their number grows. We introduce Balance of Benchmarks (BoB) to retain eligible observations and control their influence separately. We fit benchmark-specific response curves to place different difficulty ranges on a shared ability scale and use description similarity to downweight benchmarks in crowded neighborhoods. We test retention and density weighting in separate interventions on WildScores, a sparse collection of 148 developer-reported benchmarks, using 14 Artificial Analysis benchmarks as a controlled reference. With the model population fixed and entire source-lineage families held out, suite expansion improves held-out prediction under BoB and equal-weight equating on both WildScores and BIG-bench. Under substantial reporting overlap, density weighting improves robustness to multiplicity. Complete re-listings yield smaller mean rank displacement under BoB (0.63 versus 1.95 for equal-weight equating), with benefits also in paraphrased re-listings and supported affine fits. The benefit can reverse if models report different benchmarks, because a single weight per column gives models that report only part of a group less than its intended share. We therefore compute each model's weights from the benchmarks it reports. This rule removes the reversal in controlled re-listings and keeps held-out prediction close to that of equal weighting. These comparisons separate evidence retention, benchmark influence, and reporting coverage and show why repeated entries need to be handled per model.
Updated: 2026-11-19 16:51:40
标题: 基准的平衡:证据保留与兼顾多重性的模型比较
摘要: 基准聚合需要决定应使用多少证据,以及每个基准应获得多大影响力。精选基准套件通过筛选来控制影响力,但这可能排除有信息价值的观测。更大的候选池则可以保留这些观测。在等权重下,随着重复或高度相关的基准数量增加,它们获得的影响力也会随之增大。我们提出“基准平衡”(Balance of Benchmarks,BoB)方法,在保留符合条件的观测的同时,分别控制其影响力。我们为每个基准拟合专属响应曲线,将不同难度范围置于统一的能力尺度上,并利用描述相似度,对处于拥挤邻域中的基准降低权重。 我们在 WildScores 上通过相互独立的干预,分别检验观测保留和密度加权的效果。WildScores 是一个由开发者报告的 148 个基准组成的稀疏集合;我们使用 Artificial Analysis 的 14 个基准作为受控参照。在固定模型群体并完整留出整个来源谱系家族的情况下,无论在 WildScores 还是 BIG-bench 上,扩展基准套件都能在 BoB 和等权重等化下提升对留出数据的预测效果。在报告内容存在大量重叠时,密度加权能够增强对基准重复性的稳健性。完整重新列出基准时,BoB 导致的平均排名位移更小(0.63,而等权重等化为 1.95);在释义式重新列出以及采用受支持的仿射拟合时,也能观察到类似收益。 如果不同模型报告的基准不同,这一收益可能反转,因为为每一列设置单一权重,会使只报告某个基准组部分内容的模型获得低于其预期份额的权重。因此,我们根据每个模型实际报告的基准来计算其权重。这一规则消除了受控重新列出情形中的反转,同时使留出预测结果保持接近等权重方法。上述比较区分了证据保留、基准影响力和报告覆盖范围,并表明重复条目需要针对每个模型分别处理。
更新时间: 2026-11-19 16:51:40
领域: cs.AI,cs.CL,cs.LG
Privacy-Utility Tradeoffs with Quantum Local Differential Privacy
When sensitive information is encoded in data, it is important to ensure the privacy of information when attempting to learn useful information from the data. There is a natural tradeoff whereby increasing privacy requirements may decrease the utility of a learning protocol. In the quantum setting of differential privacy, such tradeoffs between privacy and utility have so far remained largely unexplored. In this work, we study optimal privacy-utility tradeoffs for both generic and application-specific utility metrics when privacy is quantified by $(\varepsilon,δ)$-quantum local differential privacy. In the generic setting, we focus on optimizing fidelity and trace distance between the original state and the privatized state. We show that the depolarizing mechanism achieves the optimal utility for given privacy requirements. We then study the specific application of learning the expectation of an observable with respect to an input state when only given access to privatized states. We derive a lower bound on the number of samples of privatized data required to achieve a fixed accuracy guarantee with high probability. To prove this result, we employ existing lower bounds on private quantum hypothesis testing, thus showcasing the first operational use of them. We also devise private mechanisms that achieve optimal sample complexity with respect to the privacy parameters and accuracy parameters, demonstrating that utility can be significantly improved for specific tasks in contrast to the generic setting. In addition, we show that the number of samples required to privately learn observable expectation values scales as $Θ((\varepsilon β)^{-2})$, where $\varepsilon \in (0,1)$ is the privacy parameter and $β$ is the accuracy tolerance. We conclude by initiating the study of private classical shadows, which promise useful applications for private learning tasks.
Updated: 2026-11-19 16:50:43
标题: 量子局部差分隐私中的隐私—效用权衡
摘要: 当敏感信息被编码在数据中时,在尝试从数据中学习有用信息的同时确保信息隐私至关重要。隐私要求的提高可能会降低学习协议效用,这构成了一种自然的权衡。在量子差分隐私的背景下,隐私与效用之间的这种权衡迄今在很大程度上尚未得到探索。本文研究了在隐私性由$(\varepsilon,\delta)$量子局部差分隐私量化时,针对通用效用指标和特定应用效用指标的最优隐私—效用权衡。在通用情形下,我们重点优化原始态与隐私化态之间的保真度和迹距离。我们证明,对于给定的隐私要求,去极化机制能够实现最优效用。随后,我们研究这样一个具体应用:当只能访问隐私化后的量子态时,学习输入态下某个可观测量的期望值。我们推导出一个下界,说明要以高概率达到固定的精度保证,所需隐私化数据样本的数量至少是多少。为证明这一结果,我们采用了关于私有量子假设检验的已有下界,从而展示了这些下界的首次操作性应用。我们还设计了能够在隐私参数和精度参数方面达到最优样本复杂度的私有机制,表明与通用情形相比,对于特定任务,效用可以得到显著提升。此外,我们证明,私有学习可观测量期望值所需的样本数量按$\Theta((\varepsilon\beta)^{-2})$的阶增长,其中$\varepsilon\in(0,1)$为隐私参数,$\beta$为精度容忍度。最后,我们初步开展了私有经典阴影的研究,该方法有望在私有学习任务中得到有用的应用。
更新时间: 2026-11-19 16:50:43
领域: quant-ph,cs.CR,cs.IT,cs.LG
Democratizing Cross-Project Knowledge for Transforming Water Governance and Climate Resilience: an Agentic AI Ecosystem
EU-funded projects produce extensive evidence in the form of deliverables, reports, and case studies. However, this knowledge is typically scattered across projects and document structures, making it difficult to locate relevant, contextual information when making decisions. This paper introduces an Agentic AI Ecosystem that consolidates heterogeneous project documentation into a domain-aware knowledge base and provides adaptive access through an agentic Retrieval-Augmented Generation pipeline. Documents from three EU-funded projects (IMPETUS, NATALIE, and InnWater) are reconstructed into hierarchical section trees and indexed with structured metadata. Retrieval is supported by two domain-specific embedding models fine-tuned on domain data (water and climate). On top of this knowledge base, a ReAct-style controller iteratively orchestrates retrieval actions by allocating retrieval budget across domain collections and accumulating evidence until a stopping criterion is met. In a retrieval benchmark over the corpus, the proposed approach improves Mean Reciprocal Rank by 26.7% (relative) compared to a single-domain embedding baseline, indicating more consistent retrieval of relevant evidence to support cross-project knowledge synthesis and climate-resilient decision-making.
Updated: 2026-11-19 16:49:04
标题: 让跨项目知识民主化:以智能体人工智能生态系统转型水治理与气候韧性
摘要: 欧盟资助项目通过成果文件、报告和案例研究产生了大量证据。然而,这些知识通常分散在不同项目及其文档结构中,导致决策时难以定位相关且具有上下文的信息。本文介绍了一种智能体式人工智能生态系统,将异构项目文档整合到领域感知知识库中,并通过智能体式检索增强生成流程提供自适应访问。来自三个欧盟资助项目(IMPETUS、NATALIE 和 InnWater)的文档被重构为层级化章节树,并以结构化元数据进行索引。检索由两个基于领域数据微调的领域专用嵌入模型提供支持,分别面向水资源和气候领域。在此知识库之上,一个 ReAct 风格的控制器通过在不同领域集合之间分配检索预算,迭代编排检索操作,并持续累积证据,直至满足停止标准。在该语料库上的检索基准测试中,与单领域嵌入基线相比,所提出的方法将平均倒数排名提高了 26.7%(相对值),表明其能够更加稳定地检索相关证据,从而支持跨项目知识综合和气候韧性决策。
更新时间: 2026-11-19 16:49:04
领域: cs.IR,cs.AI,cs.CL
Simulation-pretrained autoencoders versus PCA for compressing multimode fibre transmission matrices
Multimode optical fibres can image through a thin, flexible probe once their transmission matrix (TM) has been measured, but a TM is large and must be re-measured whenever the fibre moves. A compact model of feasible TMs would make storing and re-estimating them cheaper, so we ask how compactly TMs can be represented, and from how few measured TMs. Here we benchmark a permutation-equivariant autoencoder, pretrained on simulated fibres and adapted to measured TMs, against principal component analysis (PCA). At 62x compression, adapting the pretrained autoencoder with just two measured TMs reconstructs the TM of a 50um fibre well enough to focus light at 98% of the ideal enhancement, and it stays accurate when the TMs are shifted by 25 pixels or zoomed by 10%, which quickly degrades a linear basis. It is not, however, a better compressor: PCA is about ten times more accurate when fitted on all 163 real TMs (1.1% against 11.9% error on held-out TMs) and is already more accurate from ten. The autoencoder's value is as a prior when few or no real TMs exist: with none it reaches 29% error, against 91% for PCA fitted on the same simulation. Transfer to a different fibre is only partial. The most important extension, not yet tested, is to recover pixel-basis TMs from fewer measurements than a full TM, which would turn the pretrained prior from a compressor into a measurement-saving tool.
Updated: 2026-11-19 16:45:05
标题: 仿真预训练自编码器与主成分分析在多模光纤传输矩阵压缩方面的比较
摘要: 多模光纤在测量其传输矩阵(TM)后,可以通过纤细且柔性的探头进行成像;但传输矩阵规模庞大,而且每当光纤发生移动时都必须重新测量。若能建立一种紧凑的传输矩阵模型,就可以降低存储和重新估计传输矩阵的成本。因此,我们探讨传输矩阵能够以多高的压缩程度表示,以及最少需要多少个已测量的传输矩阵。本文将一种在模拟光纤数据上预训练、并在已测量传输矩阵上进行适配的置换等变自编码器,与主成分分析(PCA)进行了比较。在压缩至原大小的1/62时,仅使用两个已测量的传输矩阵对预训练自编码器进行适配,就能够较好地重建一根50微米光纤的传输矩阵,使聚焦光强达到理想增强值的98%;当传输矩阵发生25个像素的平移或10%的缩放时,该模型仍能保持准确,而线性基底的性能会迅速下降。然而,它并不是更优的压缩器:在全部163个真实传输矩阵上进行拟合时,PCA的准确度约高出十倍(在留出的传输矩阵上,误差分别为1.1%和11.9%),并且从使用10个传输矩阵开始,PCA就已经更加准确。自编码器的价值在于:当只有很少或没有真实传输矩阵时,它可以充当先验。在完全没有真实传输矩阵的情况下,其误差达到29%,而在相同模拟数据上拟合的PCA误差为91%。将模型迁移到不同光纤上的效果仅为部分有效。尚未进行、但最重要的扩展是:从少于完整传输矩阵所需的测量次数中恢复像素基底下的传输矩阵;这将使预训练先验从一种压缩器转变为节省测量次数的工具。
更新时间: 2026-11-19 16:45:05
领域: physics.optics,cs.LG
How Large Language Models Misrepresent American Climate Opinions
Large language models are increasingly used to simulate public opinion, standing in for survey respondents as "silicon samples." Whether they faithfully represent U.S. climate opinion, particularly at the intersections of race, gender, and ideology, remains largely untested. We prompted six large language models with the profiles of 978 respondents to a nationally representative U.S. climate opinion survey and compared the generated responses with those respondents' own answers across 20 questions. The models compress the diversity of American climate opinion, pulling predictions toward the population mean: less-concerned groups are predicted as more concerned, more-concerned groups as less, and the variance of predicted responses falls, on average, 29% below that of human responses. The compression is intersectional. The models apply one gender assumption, predicting women as more pro-climate than men in every racial group. The assumption matches the direction of the human pattern for White, Hispanic, and Other Americans and runs the wrong way for Black Americans. We claim the direction of that difference rather than its size, since it rests on small cells at the ideological extreme. An audit of gender alone would report that the models understate the gender gap, and would miss that the error changes direction by race, which is what single-variable audits cannot detect. What is at stake is not accuracy alone but representation: whose views a synthetic sample renders legible.
Updated: 2026-11-19 16:42:14
标题: 大型语言模型如何误述美国民众对气候问题的看法
摘要: 大型语言模型越来越多地被用于模拟公众舆论,作为调查受访者的替代者,即所谓的“硅样本”。然而,它们能否忠实代表美国公众对气候问题的看法,尤其是在种族、性别与意识形态交叉的情境下,仍基本未经检验。我们向六个大型语言模型提供了某项具有全国代表性的美国气候观点调查中978名受访者的个人特征资料,并将模型生成的回答与这些受访者在20个问题上的真实回答进行了比较。模型压缩了美国气候观点的多样性,将预测结果拉向总体平均值:对气候问题较不担忧的群体被预测得更为担忧,而较为担忧的群体则被预测得不那么担忧;平均而言,预测回答的方差比人类回答低29%。这种压缩具有交叉性。模型采用了单一的性别假设,在每个种族群体中都预测女性比男性更支持气候行动。对于白人、西班牙裔和其他族裔美国人,这一假设与人类回答所呈现的差异方向一致;但对于黑人美国人,则与实际方向相反。我们主张的只是这种差异的方向,而非其大小,因为这一结论基于意识形态极端群体中的小样本单元。仅审查性别因素会得出模型低估性别差距的结论,却会忽略该误差随种族而改变方向,而这正是单变量审查无法发现的。问题不仅在于准确性,更在于代表性:合成样本究竟让谁的观点变得可见、可理解。
更新时间: 2026-11-19 16:42:14
领域: cs.CY,cs.AI
A Complete Geometric Message-Passing Architecture for Point Clouds
Three-dimensional point clouds are a fundamental data modality, and a large family of machine learning architectures has been developed to respect their natural symmetries to rigid motions and permutations. A principled way to compare these architectures, which vary widely in complexity and cost, is through their expressive power. That is, an architecture is complete if it can distinguish any two inputs not related by the symmetries it respects. Simple distance-based message-passing networks are known to be incomplete, and while there exist complete alternatives, they typically rely on computationally intensive mechanisms like high-order representations of the rotation group or higher-order Weisfeiler-Leman-type tests. In this work, we devise a novel, simple, equivariant message-passing architecture for point clouds, and prove that it is complete. We complement our theoretical result with experiments showing that our architecture separates challenging point clouds that distance-based message passing provably cannot distinguish. Our results suggest that high-order equivariant features may not be necessary to enhance the expressivity of point cloud architectures, and can help settle completeness for other equivariant architectures for which such results are currently unknown. We give initial evidence for this by proving completeness of a slightly modified version of SEGNN.
Updated: 2026-11-19 16:40:26
标题: 一种完整的点云几何消息传递架构
摘要: 三维点云是一种基础的数据模态,研究人员已开发出大量机器学习架构,以遵循其对于刚性运动和平移置换的天然对称性。一种有原则地比较这些复杂度和成本差异很大的架构的方法,是考察它们的表达能力。也就是说,如果一个架构能够区分任意两个不受其所遵循对称性关联的输入,则称该架构是完备的。已知简单的基于距离的消息传递网络并不完备;尽管存在完备的替代方案,但它们通常依赖计算成本高昂的机制,例如旋转群的高阶表示或更高阶的 Weisfeiler-Leman 类型测试。 在本工作中,我们为点云设计了一种新颖、简单且等变的消息传递架构,并证明了该架构是完备的。我们通过实验补充了理论结果,表明该架构能够区分一些基于距离的消息传递网络经证明无法区分的挑战性点云。我们的结果表明,增强点云架构的表达能力可能并不需要高阶等变特征,并且有助于确定其他目前尚无此类结果的等变架构的完备性。作为初步证据,我们证明了略作修改的 SEGNN 版本具有完备性。
更新时间: 2026-11-19 16:40:26
领域: cs.LG
Evidence from a Multi-Regime Causal Discovery Benchmark: UCMT Algorithms, Comparative Performance, and Controlled Ablation Studies
We present an internal, pre-registered evaluation of the UCMT causal discovery algorithm family alongside established alternatives across heterogeneous benchmark regimes, complemented by a separately pre-registered, controlled study of UCMT v2 Global components. The contribution is both empirical and methodological: a family-stratified comparison of three actively developed algorithm configurations and targeted evidence about which internal stages affect their outcomes. In the main benchmark, UCMT v2 Global has higher directed F1 than NOTEARS and DAGMA in selected real, semi-synthetic and Gaussian-network comparisons at the paired-run level, while trailing leading permutation-search methods in other settings. The BOSS-based UCMT v4 produces a CSuite-specific directed-F1 improvement over BOSS (mean paired difference +0.279; pair-level Holm p < 0.001), but the dataset-level adjusted result is not significant (p = 0.188). In a separate fixed-skeleton ablation, UCMT v2 Global exceeds an adapted R^2-SortnRegress orientation baseline on standardized iSCM data (directed F1 0.537 vs 0.468, dataset-level Holm p = 0.031); absolute orientation accuracy is 0.563 and there is no established broad advantage over RESIT, ANM or DirectLiNGAM. Controlled ablations show that sparsity and BIC-based refinement materially affect some outcomes, whereas the examined arbitration and automatic regime-selection mechanisms do not yield confirmed general improvements. We report performance shortcomings, multiple-testing correction, runtime costs, evaluation limitations and reproducibility checks. The results support UCMT as an implemented and empirically investigated algorithm family, not a claim of overall superiority, independent validation or demonstrated commercial impact.
Updated: 2026-11-19 16:40:16
标题: 来自多状态因果发现基准的证据:UCMT算法、比较性能与受控消融研究
摘要: 我们对 UCMT 因果发现算法系列及其在多种异质基准设定下的成熟替代方法进行了内部预注册评估,并对 UCMT v2 Global 的各组成部分开展了另一项单独预注册的受控研究。本文的贡献兼具实证性与方法论意义:一方面,对三个正在积极开发的算法配置进行了按系列分层的比较;另一方面,针对哪些内部阶段会影响其结果提供了有针对性的证据。在主要基准测试中,在成对运行层面,UCMT v2 Global 在部分真实数据、半合成数据和高斯网络比较中取得了高于 NOTEARS 和 DAGMA 的有向 F1 分数,但在其他设定下落后于领先的置换搜索方法。基于 BOSS 的 UCMT v4 相较于 BOSS,在 CSuite 特定任务中实现了有向 F1 的提升(成对平均差异为 +0.279;成对层面的 Holm 校正 p < 0.001),但在数据集层面的校正结果并不显著(p = 0.188)。在另一项固定骨架消融实验中,UCMT v2 Global 在标准化 iSCM 数据上优于经过适配的 R^2-SortnRegress 定向基线(有向 F1 分别为 0.537 和 0.468;数据集层面的 Holm 校正 p = 0.031);其绝对定向准确率为 0.563,且相较于 RESIT、ANM 或 DirectLiNGAM,并未显示出已确立的广泛优势。受控消融实验表明,稀疏性和基于 BIC 的细化会实质性影响部分结果,而所考察的仲裁机制和自动制度选择机制并未带来经确认的普遍改进。我们报告了性能不足、多重检验校正、运行时间成本、评估局限性以及可复现性检查。结果支持将 UCMT 视为一个已经实现并接受实证研究的算法系列,但并不构成其总体优越性、独立验证或已证实商业影响的主张。
更新时间: 2026-11-19 16:40:16
领域: cs.LG
TriAxialKV: Toward Extreme Low-Precision KV-Cache Quantization for Agentic Inference Tasks
Agentic workloads have emerged as a major workload for LLM inference. They differ significantly from chat-only workloads, requiring long-context processing, the ability to handle multimodal inputs, and structured multi-turn interactions with tool calling capabilities. As a result, their context exhibits structure that can carry different importance along three key axes: temporal recency to the current turn, modality such as text or image tokens, and semantic role such as user queries, tool calls, observations, or reasoning. These axes capture distinct token behaviors and lead to different sensitivities to KV-cache compression. However, existing KV-cache quantization methods are typically homogeneous or exploit only heterogeneity on a single dimension, such as temporal proximity or modality, overlooking the interactions among them. To this end, we introduce TriAxialKV, a novel mixed-precision KV-cache quantization scheme that assigns each token a triaxial tag, calibrates per-tag sensitivity, and allocates INT2/INT4 bit-widths under a fixed memory budget. We implement TriAxialKV as an end-to-end serving system, comprising calibration, mixed-precision quantization and memory management, and custom fused Triton decode kernels. When using Qwen3-VL-32B-Thinking as a computer-use agent operating the OSWorld, TriAxialKV matches the accuracy of SGLang with BF16 KV cache while supporting 4.5$\times$ KV cache capacity and achieving 30% higher end-to-end throughput, when running on real GPU systems.
Updated: 2026-11-19 16:40:02
标题: TriAxialKV:面向智能体推理任务的极低精度 KV 缓存量化
摘要: 智能体工作负载已成为大语言模型推理中的主要工作负载之一。它们与仅支持聊天的工作负载存在显著差异,需要处理长上下文、应对多模态输入,并支持具备工具调用能力的结构化多轮交互。因此,其上下文呈现出一定的结构性,并可沿三个关键轴体现不同的重要性:相对于当前轮次的时间新近性、文本或图像标记等模态,以及用户查询、工具调用、观察结果或推理等语义角色。这些轴刻画了不同的标记行为,并导致其对 KV 缓存压缩表现出不同的敏感性。然而,现有的 KV 缓存量化方法通常采用同质化策略,或仅利用单一维度上的异质性(例如时间接近性或模态),忽略了不同维度之间的交互作用。 为此,我们提出 TriAxialKV,一种新型混合精度 KV 缓存量化方案。该方案为每个标记分配三轴标签,校准每类标签的敏感性,并在固定内存预算下分配 INT2/INT4 位宽。我们将 TriAxialKV 实现为一个端到端服务系统,包含校准、混合精度量化与内存管理,以及定制的融合 Triton 解码内核。在使用 Qwen3-VL-32B-Thinking 作为运行于 OSWorld 上的计算机使用智能体时,TriAxialKV 在真实 GPU 系统上运行,能够达到采用 BF16 KV 缓存的 SGLang 的准确率,同时将 KV 缓存容量提升至 4.5 倍,并使端到端吞吐量提高 30%。
更新时间: 2026-11-19 16:40:02
领域: cs.LG
Two Principles for Autoregressive Language Modeling
We investigate the functional differentiation learned by RoPE Transformers to derive principles for autoregressive language modeling. We introduce two intervention-based metrics: RoPE Frequency Importance Score (RFIS) measures how removing a frequency contribution changes a head's full attention distribution, and RoPE Positional Dependence (RPD) isolates the effect of rotary modulation. In Qwen3 and Llama3.1, these metrics distinguish retrieval from positional modeling, while individual heads can exhibit both functions. A mid-low-frequency Global Positional Band (GPBand) separates their frequency dependencies and tracks the training sequence length in controlled experiments, suggesting that global positional fitting can hinder zero-shot length extrapolation. These findings motivate two principles. (1) Functional Organization: retrieval and positional functions should be assigned separately and mixed within layers with layer-specific allocation; and (2) Positional Dependence: positional modeling should operate only locally, while global access should rely on position-independent retrieval. Matched pretraining from scratch and targeted architectural ablations at 380M and 1.4B parameters support both principles and highlight the importance of mechanism choice in realizing each function. Together, these findings suggest a promising route toward architectural innovation grounded in the functional requirements of autoregressive language modeling.
Updated: 2026-11-19 16:38:36
标题: 自回归语言建模的两个原则
摘要: 我们研究了 RoPE Transformer 所学习到的功能分化,以推导自回归语言建模的相关原则。我们提出了两种基于干预的度量指标:RoPE 频率重要性得分(RFIS)用于衡量移除某一频率成分后,某个注意力头的完整注意力分布发生了多大变化;RoPE 位置依赖性(RPD)则用于分离旋转调制所产生的影响。在 Qwen3 和 Llama3.1 中,这些指标能够区分信息检索与位置建模,而单个注意力头可能同时表现出这两种功能。一个中低频的全局位置频带(GPBand)能够区分二者的频率依赖关系,并在受控实验中追踪训练序列长度,这表明全局位置拟合可能会阻碍零样本长度外推。 这些发现促成了两项原则。(1)功能组织原则:检索功能与位置功能应当分别分配,并在不同层中以具有层特异性的方式进行混合;(2)位置依赖原则:位置建模应仅在局部范围内运行,而全局访问则应依赖与位置无关的信息检索。在 3.8 亿和 14 亿参数规模下,从头开始进行的匹配预训练实验以及针对性的架构消融实验均支持这两项原则,并凸显了机制选择对于实现各项功能的重要性。总体而言,这些发现为基于自回归语言建模功能需求开展架构创新提供了一条有前景的路径。
更新时间: 2026-11-19 16:38:36
领域: cs.LG
Random coloured digraphs defined by a Markov logic network
A Markov Logic Network (MLN) $M$ is a probabilistic relational model used in Statistical Relational Artificial Intelligence for defining a probability distribution $P_D^M$ on the set $W_D$ of possible worlds with domain $D$ for an arbitrary finite domain $D$. An MLN consists of first-order formulas, which we call soft constraints, with associated weights which are nonnegative real numbers. The behaviour of the probability distribution, including the effect of the weights, on different domain sizes is poorly understood. We approach the problem in a systematic way by studying sequences $(P_n^M(ψ) : n = 1, 2, 3, \ldots)$ where $ψ$ is a first-order sentence and $P_n^M(ψ)$ is the probability that $ψ$ holds in $W_D$ where $D = [n] := \{1, \ldots, n\}$. We consider a first-order language that can express a property $P(x)$ and relation $R(x, y)$ and show that all of the following cases can be realized for an MLN $M$ such that each of its soft constraints is a boolean combination of $P(x)$, $P(y)$ and $R(x, y)$ in which both $x$ and $y$ appears: For every first-order sentence $ψ$, $P_n^M(ψ)$ converges to 0 or 1 as $n\to\infty$. For every first-order sentence $ψ$, $P_n^M(ψ)$ converges as $n\to\infty$ but not necessarily to 0 or 1. There is a first-order sentence $ψ$ such that $P_n^M(ψ)$ does not converge as $n\to\infty$. In fact, all three cases can be realized even after fixing the soft constraints and, for any $\varepsilon > 0$, by varying their weights by less than $\varepsilon$. We also show that, given any MLN as described above, we can efficiently determine which case it belongs to by inspecting the MLN. Then we show that if the weights are scaled by $1/n$ then we end up in case~(1) no matter how the weights are chosen.
Updated: 2026-11-19 16:36:24
标题: 由马尔可夫逻辑网络定义的随机彩色有向图
摘要: 马尔可夫逻辑网络(MLN)\(M\) 是统计关系人工智能中使用的一种概率关系模型,用于在任意有限域 \(D\) 上的可能世界集合 \(W_D\) 上定义概率分布 \(P_D^M\)。一个 MLN 由一阶公式组成,我们称之为软约束;每个软约束都带有一个非负实数权重。对于不同的域大小,概率分布的行为(包括权重的影响)目前尚未得到充分理解。我们通过系统地研究序列 \((P_n^M(\psi) : n = 1, 2, 3, \ldots)\) 来处理这一问题,其中 \(\psi\) 是一个一阶句子,\(P_n^M(\psi)\) 表示当 \(D = [n] := \{1, \ldots, n\}\) 时,\(\psi\) 在 \(W_D\) 中成立的概率。我们考虑一种能够表达性质 \(P(x)\) 和关系 \(R(x, y)\) 的一阶语言,并证明:对于某个 MLN \(M\),若其每个软约束都是 \(P(x)\)、\(P(y)\) 和 \(R(x, y)\) 的布尔组合,且其中同时出现 \(x\) 和 \(y\),则以下所有情形都可以实现: 对于每个一阶句子 \(\psi\),当 \(n\to\infty\) 时,\(P_n^M(\psi)\) 收敛到 0 或 1。 对于每个一阶句子 \(\psi\),当 \(n\to\infty\) 时,\(P_n^M(\psi)\) 都收敛,但不一定收敛到 0 或 1。 存在一个一阶句子 \(\psi\),使得当 \(n\to\infty\) 时,\(P_n^M(\psi)\) 不收敛。 事实上,即使固定软约束,对于任意 \(\varepsilon>0\),通过将其权重改变小于 \(\varepsilon\),也可以实现上述全部三种情形。我们还证明,对于任意上述形式的 MLN,只需检查该 MLN,便可以高效地确定它属于哪一种情形。最后我们证明,如果将权重缩放为 \(1/n\),那么无论如何选择权重,最终都会落入情形(1)。
更新时间: 2026-11-19 16:36:24
领域: math.LO,cs.AI
From Benchmarks to the Bench: Preference, Correspondence and Selectivity in Bidirectional Drug-Target Screening
Identifying active molecules for known targets and potential targets for existing drugs is central to drug discovery and repurposing. Drug-target interaction (DTI) models can rank vast numbers of drug-target pairs, but limited experimental capacity restricts testing to a small number of candidates. We compared the bidirectional recommendations of 13 released systems across 711 molecular structures of FDA-approved drugs and 614 human proteins. For the same target or drug, pairs of models produced completely disjoint Top-10 molecule and protein lists in 77.8% and 70.1% of comparisons, respectively. Even where recommendations overlapped, agreement between some systems largely reflected recurring preferences for the same candidates. Published inhibition measurements for 79 molecules and 65 kinases revealed that some systems enriched active candidates, yet their hit yields changed little when recommendations were matched to different drugs or targets, whereas other systems lost substantially more hits. Some of the former systems also rarely ranked both molecules and kinases correctly when two drugs favoured different kinases. We further retrained the same architecture on the same data, with the training objective fixed and random seeds varied. Despite similar test performance, mean pairwise Top-10 overlap on a separate screening catalogue was about two candidates. Our study moves DTI model evaluation beyond benchmark performance to assess whether model predictions can guide meaningful experimental decisions in drug discovery and target identification.
Updated: 2026-11-19 16:34:29
标题: 从基准测试到实验台:双向药物—靶标筛选中的偏好性、对应性与选择性
摘要: 识别已知靶点的活性分子以及现有药物的潜在靶点,是药物发现与药物再利用的核心环节。药物—靶点相互作用(DTI)模型能够对数量庞大的药物—靶点配对进行排序,但受实验能力有限的制约,实际只能测试少量候选项。我们比较了13个已发布系统基于711种FDA批准药物的分子结构和614种人类蛋白质所作的双向推荐。在相同靶点或药物的情况下,模型两两比较时,分子和蛋白质Top-10列表完全不重叠的比例分别为77.8%和70.1%。即使推荐结果存在重叠,部分系统之间的一致性也主要反映了它们反复偏好相同候选项这一现象。已发表的79种分子与65种激酶的抑制测量结果显示,一些系统能够富集活性候选项;然而,当将推荐结果匹配到不同药物或靶点时,它们的命中率变化很小,而另一些系统的命中数则大幅下降。当两种药物分别偏好不同激酶时,前一类系统中的一些系统也很少能同时正确排列分子和激酶。我们进一步在相同数据上重新训练了相同架构的模型,固定训练目标,仅改变随机种子。尽管测试性能相近,但在一个独立的筛选目录上,两两比较的Top-10平均重叠数约为2个候选项。本研究将DTI模型的评估从基准性能拓展到评估模型预测能否为药物发现和靶点识别中的实质性实验决策提供指导。
更新时间: 2026-11-19 16:34:29
领域: cs.LG
Storing the Gemma 4 K=V Cache Once: Exact Global-KV Memory Savings in a Paged Serving Engine with Unchanged Attention Kernels
In the global attention layers of Gemma 4 31B, the value is the normalized key projection, and the key is the value scaled by a fixed weight, with rotary position encoding on one quarter of its dimensions. The Gemma 4 report states that this design reduces the global KV cache by up to 37.5%, but the open serving engines that we checked still store a full key and a full value: 1,024 values per KV head and token. We store one 640-value row instead, exact in real arithmetic, and an unchanged paged attention kernel reads it through two overlapping strided views as its key cache and its value cache. In a vLLM prototype with the 16-bit 31B model, the outputs are bit-identical to an emulation of the same arithmetic on the stock cache, 2 of 432 final answers differ from the stock engine (within its run-to-run noise), and the steady decode KV memory per request falls by a factor of 1.34 to 1.40 at 32K to 64K tokens. On a prefill/decode pair of two A100 GPUs with NIXL transfer and CPU offload, a decode engine with a full 15 GiB pool ran 1.38 times the stock decode tokens per step for 16K-token prompts (repeated to 0.06%) and 1.24 times for 8K-token prompts; a model of the vLLM block pool predicted both ratios to within 1% (the engine was 0.7% to 0.9% higher) and matched the change between them. The eager decode throughput rose by 1.30 and 1.11 times, and on this path the compact engine gave the same output tokens as the emulation for 8 prompts at batch 1. The run-time prototype makes an eager step 4% to 9% slower at equal batch, and the method does not yet stack with an 8-bit KV cache at the default scale.
Updated: 2026-11-19 16:34:27
标题: 只存储一次 Gemma 4 的 K=V 缓存:在注意力内核不变的分页式服务引擎中实现精确的全局 KV 内存节省
摘要: 在 Gemma 4 31B 的全局注意力层中,值是经过归一化的键投影,而键则是按固定权重缩放后的值,并在其四分之一维度上施加旋转位置编码。Gemma 4 报告称,这种设计最多可将全局 KV 缓存减少 37.5%;但我们检查过的开源推理引擎仍然存储完整的键和值:每个 KV 头、每个 token 存储 1,024 个值。相反,我们只存储一行包含 640 个值的数据;在实数运算中,这种表示是精确的,而未经修改的分页注意力内核通过两个相互重叠的跨步视图,将其分别作为键缓存和值缓存读取。在使用 16 位 31B 模型的 vLLM 原型中,输出与基于标准缓存对相同运算进行仿真的结果逐位一致;与标准引擎相比,432 个最终答案中有 2 个不同,但差异处于其运行间噪声范围内。在 32K 至 64K token 的序列长度下,每个请求的稳定解码 KV 内存降低至原来的约 1/1.34 至 1/1.40。 在一对配备 NIXL 传输和 CPU 卸载的 A100 GPU 上进行预填充/解码测试时,对于 16K token 的提示词(重复误差为 0.06%),配备完整 15 GiB 内存池的解码引擎每步处理的解码 token 数是标准解码引擎的 1.38 倍;对于 8K token 的提示词,这一比例为 1.24 倍。基于 vLLM block 池建立的模型对这两个比例的预测误差均在 1% 以内(实际引擎结果高出 0.7% 至 0.9%),并且准确复现了二者之间的变化。即时解码吞吐量分别提升至原来的 1.30 倍和 1.11 倍;在这一路径上,对于 batch size 为 1 的 8 个提示词,紧凑型引擎生成的输出 token 与仿真结果一致。运行时原型在相同 batch size 下会使单个即时步骤变慢 4% 至 9%,并且在默认规模下,该方法目前还无法与 8 位 KV 缓存叠加使用。
更新时间: 2026-11-19 16:34:27
领域: cs.LG,cs.CL,cs.DC
World Models Favor Learned Priors over Visual Evidence
World models are increasingly used to simulate physical interactions, but training a separate model for each environment limits scalability. Cross-environment prediction requires identifying the current physical rule, which appearance alone may not reveal. We therefore study visual calibration: using object motion and interactions in a short video as direct evidence to infer the current rule and predict motion under that rule from a different initial state. However, differences in data availability across physical conditions can yield a long-tailed training distribution, biasing models toward common rules even when evidence supports rare ones. To study this challenge, we introduce TailWorld, which evaluates the transfer of demonstrated rules across initial states while independently controlling training imbalance and calibration informativeness. The benchmark compares predictions with two reference futures from the same prediction initial state, one following the demonstrated rule and the other a common rule, to measure prediction bias toward common dynamics. We further propose Rule Inference for Transfer (RIFT), which learns how different rules affect object motion, infers the current rule from calibration interactions, and applies it to prediction from a new initial state. RIFT explicitly controls the influence of training frequency on rule inference, allowing sufficiently informative observational evidence to support rare rules. Experiments on TailWorld show that RIFT improves prediction accuracy and physical consistency across varying training imbalances and distribution shifts, with gains in predicting rare dynamics.
Updated: 2026-11-19 16:33:02
标题: 世界模型更偏好学习到的先验而非视觉证据
摘要: 世界模型正越来越多地用于模拟物理交互,但为每个环境分别训练模型会限制其可扩展性。跨环境预测需要识别当前的物理规则,而仅凭外观可能无法揭示这一规则。因此,我们研究视觉校准问题:利用短视频中的物体运动与交互作为直接证据,推断当前规则,并根据该规则预测从不同初始状态出发的运动。然而,不同物理条件下的数据可获得性差异可能导致长尾训练分布,使模型偏向常见规则,即使证据支持罕见规则也是如此。为研究这一挑战,我们提出 TailWorld,用于评估在不同初始状态之间迁移所示规则的能力,同时独立控制训练不平衡程度与校准信息量。该基准将预测结果与来自同一预测初始状态的两种参考未来进行比较:一种遵循所示规则,另一种遵循常见规则,以衡量预测偏向常见动力学的程度。我们进一步提出规则迁移推理(Rule Inference for Transfer,RIFT)方法,学习不同规则如何影响物体运动,从校准交互中推断当前规则,并将其应用于从新初始状态出发的预测。RIFT 显式控制训练频率对规则推断的影响,使信息充分的观测证据能够支持罕见规则。在 TailWorld 上的实验表明,在不同程度的训练不平衡与分布偏移下,RIFT 均能提升预测准确性和物理一致性,并在预测罕见动力学方面取得更大收益。
更新时间: 2026-11-19 16:33:02
领域: cs.AI
Compact set-valued deep ensembling in multi-class classification
This paper tackles visible challenges in deep ensemble learning, where deep neural networks serve as ensemble members: training and storage burdens, and robustness of cautious (set-valued) predictions targeting multiple utilities, which may involve reward-sensitivity. To mitigate the training and storage burdens, we propose to employ compact ensembles, such as Bayesian Neural Networks and Convolutional Neural Networks with the Monte-Carlo dropout prediction option, to produce probabilistic predictions. For each query instance, these probabilistic predictions are then used to define a representative distribution optimizing some statistical distance. The representative distribution is then employed to define the Bayes-optimal prediction (BOP) of any utility. To address the potential unrobustness of singleton prediction making, we propose a family of set-utilities satisfying some desirable properties and whose set-valued BOPs can be found efficiently. Empirical evidence is then given to illustrate the potential (dis)advantages of the proposed ensemble learning framework.
Updated: 2026-11-19 16:32:10
标题: 多类别分类中的紧致集值深度集成
摘要: 本文针对深度集成学习中的显著挑战展开研究,其中深度神经网络充当集成成员,具体包括训练与存储负担,以及面向多种效用、可能涉及对奖励敏感性的谨慎型(集合值)预测的稳健性问题。为减轻训练与存储负担,我们提出采用紧凑型集成模型,例如贝叶斯神经网络,以及支持蒙特卡洛 dropout 预测的卷积神经网络,以生成概率预测。对于每个查询实例,利用这些概率预测来定义一个优化某种统计距离的代表性分布。随后,利用该代表性分布定义任意效用下的贝叶斯最优预测(BOP)。为应对单值预测可能缺乏稳健性的问题,我们提出了一类满足若干理想性质的集合效用,并且能够高效求得其集合值贝叶斯最优预测。最后,通过实验证据展示所提出集成学习框架的潜在优势与不足。
更新时间: 2026-11-19 16:32:10
领域: cs.LG
HiSA: Sparsifying the Hidden Dimension of RoPE Attention in LLMs
Attention in large language models (LLMs) scores every query against every key with a full dot product. We investigate whether this dot product must be computed completely for attention to be effective. We propose Hidden Sparse Attention (HiSA), which keeps the query and key projections intact but only computes a partial dot product, following a static, parameter-free rule set by the token positions: attention becomes sparse in the hidden (feature) dimension, an axis much less explored than token sparsity, rather than over tokens as in almost all sparse attention methods. Based on the structure of rotary position embeddings (RoPE), we decompose keys and queries into parts which can be omitted when computing attention. By training LLMs from scratch with HiSA, we find that this partial dot product does not hurt but improves performance compared with the complete product while computing only about a third of the query-key products. During inference HiSA improves decoding speed and shrinks memory footprint. We also extend HiSA to FlashAttention-3 kernels for training and inference. Finally, we motivate our approach by showing that dense attention learns to suppress the attention score parts that HiSA drops. Code is available at https://github.com/ambroise-b/hisa.
Updated: 2026-11-19 16:31:46
标题: HiSA:稀疏化大语言模型中 RoPE 注意力的隐藏维度
摘要: 大型语言模型(LLM)中的注意力机制会通过完整的点积,为每个查询与每个键计算匹配分数。我们研究了:为了使注意力机制有效,是否必须完整计算这一点积。我们提出了隐式稀疏注意力(Hidden Sparse Attention,HiSA),保留查询和键的完整投影,但依据由词元位置设定的静态、无参数规则,仅计算部分点积:注意力因此在隐藏(特征)维度上变得稀疏。这一维度相比词元稀疏性受到的探索少得多,而几乎所有稀疏注意力方法都是在词元维度上实现稀疏化。基于旋转位置嵌入(RoPE)的结构,我们将键和查询分解为若干部分,其中一些部分在计算注意力时可以省略。通过从头开始使用 HiSA 训练大型语言模型,我们发现,与完整点积相比,这种部分点积不仅不会损害性能,反而能够提升性能,同时只需计算约三分之一的查询—键乘积。在推理过程中,HiSA 可提高解码速度并缩减内存占用。我们还将 HiSA 扩展到用于训练和推理的 FlashAttention-3 内核。最后,我们通过证明稠密注意力会学习抑制 HiSA 所省略的注意力分数部分,为这一方法提供了动机。代码可在 https://github.com/ambroise-b/hisa 获取。
更新时间: 2026-11-19 16:31:46
领域: cs.LG,cs.CL
Topology-Driven Anti-Entanglement Control for Soft Robots
In the field of precision manufacturing in complex constrained environments, the role of soft robots is increasingly prominent, and the realization of anti-winding control based on multi-intelligent body reinforcement learning has become a research hotspot. One of the core problems at present is to coordinate multiple robots to complete the unwinding operation in a highly constrained environment. The existing distributed training framework faces some observability challenges in high-density barrier and unstable environments, resulting in poor learning results. This paper proposes a topology-driven Multi-Agent Reinforcement Learning (TD-MARL) framework to coordinate multi-robot systems to avoid entanglement. Specifically, the critical network adopts centralized learning, so that each intelligent body can perceive the strategies of other intelligent bodies by sharing the topological state, thus alleviating the training instability caused by complex interactions; eliminating the demand for communication resources between robots through distributed execution, Upgrade system reliability; the integrated topological security layer uses topological invariants to accurately assess and mitigate the risk of entanglement to avoid the strategy from falling into local difficulties. Finally, the full simulation experiments carried out in the real simulation environment show that the method is better than the current advanced deep reinforcement learning (DRL) method in terms of convergence and anti-winding effect.
Updated: 2026-11-19 16:30:54
标题: 拓扑驱动的软体机器人反缠绕控制
摘要: 在复杂受限环境下的精密制造领域,软体机器人发挥着日益重要的作用,基于多智能体强化学习实现防缠绕控制已成为研究热点。目前的核心问题之一,是如何协调多台机器人在高度受限的环境中完成解缠绕操作。现有的分布式训练框架在高密度障碍物和不稳定环境中面临一定的可观测性挑战,导致学习效果不佳。本文提出了一种拓扑驱动的多智能体强化学习(TD-MARL)框架,用于协调多机器人系统以避免缠绕。具体而言,关键网络采用集中式学习,使每个智能体能够通过共享拓扑状态感知其他智能体的策略,从而缓解复杂交互所导致的训练不稳定问题;通过分布式执行消除机器人之间对通信资源的需求,提高系统可靠性;集成的拓扑安全层利用拓扑不变量准确评估并降低缠绕风险,避免策略陷入局部困境。最后,在真实仿真环境中开展的完整仿真实验表明,与当前先进的深度强化学习(DRL)方法相比,该方法在收敛性和防缠绕效果方面表现更优。
更新时间: 2026-11-19 16:30:54
领域: cs.RO,cs.AI
How Much Should an Agent Remember? Deployment Lessons from Self-Distilled Memory for LLM Agents
LLM agents on long-horizon tasks fail in recurring, procedural ways. They mis-paginate an API, resolve the wrong entity, or answer when no answer was asked. We built a pipeline that lets an agent learn from its own history. It first mines short \emph{lessons} from the agent's own trajectories, one to three per episode. It then consolidates those lessons into a smaller set of \emph{guidelines}, where each guideline records how many lessons it merged. At inference the agent receives either all guidelines or a selected subset. The pipeline ships in the open-source altk-evolve library and is deployed in IBM's CUGA agent and watsonx Orchestrate platform. We report what we learned building, measuring, and productizing it. Our primary instrument is the AppWorld benchmark, across models spanning 40--92\% baseline task completion. The central finding is that the right amount of memory is a property of the model, not the memory. A strong model keeps improving as guidelines are added. DeepSeek-V3.2 gains +9.5 points of task completion and +16.1 points of scenario completion with its full 191-guideline set. A weak model gains less from the same full set than from a small selected subset. gpt-oss-120b starts at 39.9\% task completion. It reaches 51.2\% with all 199 of its guidelines but 55.4\% (mean of two runs) with a selected subset of about 29. Around that result we report what went wrong: a high-support guideline that backfired, provenance silently dropped during consolidation, a swallowed API error that failed every task while producing a plausible log, and a baseline confound that nearly produced a misleading comparison with a prior method. We distill these into recommendations for teams deploying agent memory.
Updated: 2026-11-19 16:29:16
标题: 智能体应该记住多少?从面向大语言模型智能体的自蒸馏记忆部署中汲取的经验教训
摘要: 长时程任务中的大语言模型代理会以反复出现且具有程序性的方式失败:它们可能错误地对 API 进行分页、解析出错误的实体,或者在并未被要求回答时给出答案。我们构建了一条流水线,使代理能够从自身的历史记录中学习。首先,流水线从代理自身的轨迹中挖掘简短的“经验教训”,每个回合提取一至三条。随后,它将这些经验教训整合为数量更少的“指导原则”,并记录每条指导原则合并了多少条经验教训。在推理时,代理可以接收全部指导原则,也可以接收经过选择的子集。该流水线已随开源的 altk-evolve 库发布,并部署于 IBM 的 CUGA 代理和 watsonx Orchestrate 平台中。我们报告了在构建、测量和产品化这一系统过程中获得的经验。我们的主要评测工具是 AppWorld 基准,涵盖基线任务完成率为 40% 至 92% 的多种模型。 核心发现是:合适的记忆量取决于模型,而不是记忆本身。强模型会随着添加指导原则而持续改进。使用完整的 191 条指导原则集合时,DeepSeek-V3.2 的任务完成率提高了 9.5 个百分点,场景完成率提高了 16.1 个百分点。弱模型从同样的完整集合中获得的收益,反而小于从一个规模较小的精选子集中获得的收益。gpt-oss-120b 的初始任务完成率为 39.9%。使用其全部 199 条指导原则后,完成率达到 51.2%;而使用约 29 条指导原则组成的精选子集后,完成率达到 55.4%(两次运行的平均值)。 围绕这一结果,我们还报告了系统中出现的问题:一条支持度很高的指导原则产生了反效果;整合过程中来源信息被悄然丢失;一个被吞掉的 API 错误导致所有任务失败,却生成了看似合理的日志;以及一个基线混淆因素差点使我们与先前方法的比较产生误导。我们将这些经验提炼为面向部署代理记忆系统团队的建议。
更新时间: 2026-11-19 16:29:16
领域: cs.AI
Learning from Context: Leave-One-Out Prediction in Jump Diffusions
Continuous diffusion models generate discrete data through stochastic dynamics in an embedding space. We consider jump diffusions that additionally reset coordinates to embeddings of categorical values. A coordinate's own corrupted state can make prediction easy, potentially reducing the pressure to learn dependencies between coordinates. We study leave-one-out (LOO) prediction, in which each coordinate is predicted from the corrupted states of the other coordinates. We show that, under stated assumptions, jump diffusions with complete coordinate resets and state-independent clocks preserve the prescribed marginals when reset destinations use exact LOO probabilities and the drift uses the full endpoint posterior. We further show that this drift can be constructed from LOO probabilities by analytic likelihood completion without additional network evaluations. We evaluate unrestricted, LOO, and completed predictions on Text8 and LM1B text generation and ZINC250k molecular graph generation. LOO-based variants improve key generation metrics over matched unrestricted controls on all three datasets. Controlled interventions assess reliance on local inputs and context, and we analyze the effect of analytic likelihood completion.
Updated: 2026-11-19 16:28:58
标题: 从上下文中学习:跳跃扩散中的留一法预测
摘要: 连续扩散模型通过嵌入空间中的随机动力学生成离散数据。我们研究了跳跃扩散模型,该模型还会将坐标重置为类别值对应的嵌入。某个坐标自身受到扰动后的状态可能使预测变得容易,从而潜在地减弱模型学习坐标之间依赖关系的压力。我们研究了留一法(LOO)预测,即根据其他坐标受到扰动后的状态来预测每个坐标。我们证明,在所述假设下,当重置目标使用精确的留一概率、漂移项使用完整的终点后验,并且坐标完全重置、时钟与状态无关时,跳跃扩散模型能够保持给定的边缘分布。我们进一步证明,可以通过解析似然补全,从留一概率构造该漂移项,而无需额外的网络评估。我们在 Text8 和 LM1B 文本生成任务以及 ZINC250k 分子图生成任务上评估了不受限预测、留一预测和补全预测。在三个数据集上,基于留一法的变体相较于匹配的不受限基线,在关键生成指标上均有所提升。我们通过受控干预评估模型对局部输入和上下文的依赖,并分析解析似然补全的影响。
更新时间: 2026-11-19 16:28:58
领域: cs.LG
Beam Model Technical Report
Beam is a sparse Mixture-of-Experts (MoE) model with 501.3B total parameters and 23.4B active parameters, specifically built and optimized for coding, reasoning, and agentic workloads. Beam delivers frontier level reasoning, while requiring 3-4x less inference compute than many models of its class. Pretrained on 23.8T diverse, curated, high-quality tokens, Beam features a 1M-token context window achieved through a novel two-stage midtraining phase, built on verifiable, correctness-anchored data. Post-training leveraged a large-scale, fully asynchronous reinforcement learning (RL) campaign across 10.5K GB300 GPUs, generating over 100M rollouts over 4 weeks of training. We believe this is one of the largest scale RL runs conducted by any open lab to date. Across our evaluation suite, capabilities continued to improve as we increased RL compute, with no sign of a plateau. Supported by deep hardware-model co-design, FP8/NVFP4 quantization, and a 1.93B-parameter speculative decoding drafter (DFlash 2), Beam maximizes serving throughput with efficient, flexible deployment. Averaged across conversation turns and harm categories, Beam refuses or pivots on 88.9% of harmful requests while complying with 81.5% of harmless requests, achieving the highest refusal/pivot rate on harmful requests among open-weight models on the Pareto frontier.
Updated: 2026-11-19 16:28:23
标题: 梁模型技术报告
摘要: Beam 是一种稀疏混合专家(MoE)模型,总参数量为 5013 亿,激活参数量为 234 亿,专为编程、推理和智能体工作负载而构建并优化。Beam 提供前沿水平的推理能力,同时所需的推理计算量比同类许多模型低 3 至 4 倍。该模型在 23.8 万亿个多样化、经过筛选的高质量词元上完成预训练,并通过一种新颖的两阶段中期训练流程实现了 100 万词元的上下文窗口;这一流程建立在可验证、以正确性为核心的数据之上。后训练阶段利用了大规模、完全异步的强化学习(RL)训练,在 1.05 万块 GB300 GPU 上开展,在为期 4 周的训练中生成了超过 1 亿次 rollout。我们认为,这是迄今为止任何开放实验室开展的规模最大的强化学习训练之一。在我们的整套评测中,随着强化学习计算量的增加,各项能力持续提升,尚未显现出达到平台期的迹象。在深度硬件—模型协同设计、FP8/NVFP4 量化以及一个拥有 19.3 亿参数的推测解码草稿模型(DFlash 2)的支持下,Beam 通过高效而灵活的部署,最大限度地提升了服务吞吐量。按对话轮次和有害类别取平均,Beam 会拒绝或转向处理 88.9% 的有害请求,同时遵从 81.5% 的无害请求;在开放权重模型中,Beam 在帕累托前沿上对有害请求的拒绝/转向率最高。
更新时间: 2026-11-19 16:28:23
领域: cs.CL,cs.AI
Mamba Flow Matching Neural Processes: Linear-Time Inference for Irregularly Observed Spatial Fields
Interpolating a spatial field, such as daily maximum temperature, from sparse, irregularly located observations recurs across the environmental and health sciences. Standard Gaussian-process kriging refits hyperparameters and solves an $O(N^3)$ system for every new field. When many related fields are observed, such as daily maps from one sensor network, neural processes (NPs) instead learn the interpolation map from past fields and predict a new field in one forward pass. Joint-predictive variants, which sample whole fields rather than independent per-location values, typically use self-attention over context and query points, costing $O(K^2)$ in the combined point count $K$ and limiting practical use to a few thousand points. State-space models offer a linear-time alternative, but a direct state-space adaptation compresses the context into one hidden state before reading queries, reducing what the decoder sees. We propose MambaFlowNP, a linear-compute joint-predictive NP trained with conditional flow matching. A multi-directional Mamba-2 scan reads context and query tokens in one shared sequence, so each query's velocity is read from its own scan position rather than a compressed context summary, and because queries only read the scan state, predictions are consistent across query sets. MambaFlowNP is competitive with the strongest attention-based joint-predictive baselines on synthetic Matérn Gaussian-process benchmarks, and on regional to continental-scale NOAA temperature interpolation it attains the lowest RMSE and CRPS and near-nominal coverage on every tier, while running 114--784$\times$ faster than the strongest joint-predictive baseline. A single forward pass scales to $10^6$ points on one NVIDIA L40S GPU in under a second. This makes joint prediction feasible for continental-scale, irregularly sampled sensor networks; predictive quality is evaluated up to $K=5{,}580$.
Updated: 2026-11-19 16:25:45
标题: Mamba流匹配神经过程:非规则观测空间场的线性时间推断
摘要: 在环境科学和健康科学中,根据稀疏且位置不规则的观测值插值空间场(例如每日最高气温)是反复出现的问题。标准的高斯过程克里金法每预测一个新的空间场,都需要重新拟合超参数并求解一个复杂度为 \(O(N^3)\) 的方程组。当观测到许多相关空间场时(例如来自同一传感器网络的每日地图),神经过程(NP)则从过去的空间场中学习插值映射,并通过一次前向传播预测新的空间场。联合预测变体对整个空间场进行采样,而不是对每个位置独立取值;这类方法通常在上下文点和查询点上使用自注意力机制,其计算成本随点的总数 \(K\) 呈 \(O(K^2)\) 增长,从而限制了其在实际中应用于几千个点以内。状态空间模型提供了一种线性时间的替代方案,但直接进行状态空间改造会在读取查询点之前将上下文压缩为一个隐藏状态,减少解码器能够获取的信息。 我们提出了 MambaFlowNP,这是一种采用条件流匹配训练、具有线性计算复杂度的联合预测神经过程。多方向 Mamba-2 扫描器在一个共享序列中读取上下文标记和查询标记,因此每个查询点的速度都从其自身的扫描位置读取,而不是从压缩后的上下文摘要中读取;由于查询点只读取扫描状态,预测结果在不同查询点集合之间保持一致。在合成 Matérn 高斯过程基准测试中,MambaFlowNP 的性能可与最强的基于注意力机制的联合预测基线相媲美;在区域尺度至大陆尺度的 NOAA 气温插值任务中,它在每个尺度层级上都取得了最低的 RMSE 和 CRPS,并实现了接近名义水平的覆盖率,同时运行速度比最强的联合预测基线快 114—784 倍。在单块 NVIDIA L40S GPU 上,单次前向传播可在不到一秒内扩展至 \(10^6\) 个点。这使得对大陆尺度、不规则采样的传感器网络进行联合预测成为可能;预测质量评估的点数最高达到 \(K=5{,}580\)。
更新时间: 2026-11-19 16:25:45
领域: cs.LG
When Suspicion Adds Up: A Stochastic Framework for Optimizing Honeypot-Based Insider-Threat Detection
Insider threats pose security risks when employees or other trusted users misuse their access to organizational systems. Detecting these threats is difficult because harmful activity can resemble routine behavior. Honeypots, or decoy resources monitored for suspicious interactions, can provide evidence of potentially malicious activity. We develop a decision framework that models evidence accumulation through honeypot interactions using a continuous-time Markov chain and jointly selects honeypot counts and monitoring horizons to minimize expected losses from malicious activity and false detections. For thresholds of two and three interactions, we derive closed-form true- and false-detection probabilities and expected detection times conditional on detection within the monitoring horizon. We characterize boundary cases and establish stochastic-ordering results. Our numerical results highlight the value of the proposed framework across different settings.
Updated: 2026-11-19 16:24:07
标题: 当怀疑累积:优化基于蜜罐的内部威胁检测的随机框架
摘要: 当员工或其他受信任用户滥用其对组织系统的访问权限时,内部威胁会带来安全风险。由于有害活动可能与常规行为相似,因此检测此类威胁十分困难。蜜罐,即对可疑交互进行监控的诱饵资源,能够为潜在恶意活动提供证据。我们构建了一个决策框架,利用连续时间马尔可夫链对通过蜜罐交互累积证据的过程进行建模,并联合选择蜜罐数量和监控时长,以最小化恶意活动与误检测所造成的期望损失。针对交互次数阈值为两次和三次的情形,我们推导出真实检测概率和误检测概率的闭式表达式,以及在监控时限内检测到威胁条件下的期望检测时间。我们刻画了边界情形,并建立了随机序关系结果。数值结果表明,在不同场景下,所提出的框架均具有重要价值。
更新时间: 2026-11-19 16:24:07
领域: math.OC,cs.CR
TRCF: Temporal-Reference Complementary Forecasting for Irregular Multivariate Time Series
Irregular multivariate time series forecasting supports healthcare monitoring, environmental analysis, and activity recognition. Channel-independent (CI) approaches capture each variable's temporal patterns but do not explicitly use observations from other variables. Channel-dependent (CD) modeling exploits relationships among variables, yet asynchronous measurements make these relationships difficult to learn. Incorporating cross-variable information while preserving each variable's irregular history therefore remains a key challenge. We propose Temporal-Reference Complementary Forecasting (TRCF), a framework that augments a compact CI forecaster with a complementary CD branch. ANCHOR aggregates observed values and timestamps at shared temporal locations, retaining observation support to form compact CI features. BRIDGE constructs complementary features through history completion. It first estimates each variable's historical values from its own observations, then uses differences between other variables' observed and estimated values at nearby times to correct missing entries. The completed history preserves observed values and is encoded to supply context alongside the direct CI representation. Finally, the two representations are fused, combined with the query-time embedding, and passed to a shallow multilayer perceptron for forecasting. Experiments on four real-world datasets show that TRCF achieves the lowest mean squared error and mean absolute error in the main benchmark comparison, while reducing measured peak inference memory by 17.28% to 87.98% relative to APN.
Updated: 2026-11-19 16:24:00
标题: TRCF:面向不规则多变量时间序列的时间参考互补预测
摘要: 不规则多变量时间序列预测支持医疗监测、环境分析和活动识别。通道独立(CI)方法能够捕捉每个变量的时间模式,但不会显式利用其他变量的观测结果。通道依赖(CD)建模利用变量之间的关系,然而异步测量使这些关系难以学习。因此,在保留每个变量不规则历史信息的同时融入跨变量信息,仍然是一项关键挑战。 我们提出了时间参考互补预测(TRCF)框架,通过互补的通道依赖分支增强紧凑的通道独立预测器。ANCHOR在共享时间位置聚合观测值和时间戳,保留观测支持信息,以形成紧凑的通道独立特征。BRIDGE通过历史补全构建互补特征。它首先根据每个变量自身的观测结果估计其历史值,然后利用其他变量在邻近时间的观测值与估计值之间的差异,对缺失项进行修正。补全后的历史信息保留了观测值,并经过编码后与直接的通道独立表示一起提供上下文信息。最后,两个表示经过融合,并与查询时间嵌入相结合,输入浅层多层感知器进行预测。 在四个真实世界数据集上的实验表明,在主要基准比较中,TRCF取得了最低的均方误差和平均绝对误差;与APN相比,其测得的推理峰值内存降低了17.28%至87.98%。
更新时间: 2026-11-19 16:24:00
领域: cs.LG
Perfumer: A Large Language Model-based Agentic Framework Accelerating Structural Relaxation and Electronic Band Prediction for First-Principle Calculation
First-principles structural relaxation and band calculations require substantial computation and expertise. Here we present Perfumer, a large language model-based agentic framework that couples Quantum ESPRESSO with two predictive models. Across tested structures, pre-relaxation with Perfumer-relax model followed by QE refinement yielded a 2.75-fold overall speedup over QE alone. Perfumer-band model combines a periodic graph neural network with a latent Hermitian spectral head returns 12 band energies at any requested wavevector, preserving reciprocal lattice periodicity and time-reversal symmetry without constructing Hamiltonian. Trained on 125,153 self-curated band structures, Perfumer-band model reaches a median per-material mean absolute error of 0.157 eV on 2,607 test materials, including lanthanide, actinide and magnetic compounds, from held-out composition families spanning 85 elements, taking about 97 ms per material on two consumer CPU cores. The agent turns natural-language requests into relaxation-to-band workflows, from a single uploaded structure to automatically constructed new candidates and returns predicted properties.
Updated: 2026-11-19 16:23:33
标题: Perfumer:一种基于大语言模型的智能体框架,用于加速第一性原理计算中的结构弛豫与电子能带预测
摘要: 第一性原理结构弛豫和能带计算需要大量计算资源与专业知识。我们在此提出 Perfumer,这是一种基于大语言模型的智能体框架,将 Quantum ESPRESSO 与两个预测模型相结合。在测试结构中,先使用 Perfumer-relax 模型进行预弛豫,再由 QE 进行精修,相较于单独使用 QE,整体速度提升了 2.75 倍。Perfumer-band 模型将周期图神经网络与潜在厄米谱头相结合,可在任意指定波矢处返回 12 个能带能量;该模型无需构建哈密顿量,同时保持倒易晶格的周期性和时间反演对称性。该模型基于自行整理的 125,153 个能带结构进行训练,在由 85 种元素组成、按化学组成族划分且未参与训练的测试集中,涵盖镧系、锕系和磁性化合物的 2,607 种测试材料,其每种材料平均绝对误差的中位数达到 0.157 eV;在两颗消费级 CPU 核心上,每种材料的计算时间约为 97 毫秒。该智能体能够将自然语言请求转化为从结构弛豫到能带计算的工作流程:既可从单个上传的结构开始,也可自动构建新的候选材料,并返回预测性质。
更新时间: 2026-11-19 16:23:33
领域: cond-mat.mtrl-sci,cs.LG
How to make a moral agent: sentimentalism and rationalism as lenses on AI
Can AI systems be moral agents? That is, can they undertake actions that can be correctly assessed as morally right or wrong? There is no settled normative criterion of moral agency that applies neatly outside paradigm human cases. Because of the difficulties with a normative account, we instead propose a research program to explore descriptive moral agency. Most basically, we ask, what are the capabilities we humans possess that underlie our moral agency? To do so, we draw on historical scholarship in philosophy and moral psychology to isolate candidate capabilities. Then we suggest refining candidate capabilities so that they are testable in the context of AI systems. Finally, we offer specific empirical recommendations to test AI systems, especially large language models (LLMs), for those refined capabilities. Our approach offers several benefits. Firstly, it may demonstrate whether the behaviors of AI systems are aligned, or in a broad sense desirable. Secondly, the debate may inform policy questions (e.g., what models should be deployed in which contexts?). Thirdly, our approach may complement engineering and design efforts: when capabilities can be precisely characterized, they can inform the development of models. Fourthly, applying our moral reasoning concepts in the new context of AI systems should improve our understanding of those concepts.
Updated: 2026-11-19 16:20:29
标题: 如何塑造道德主体:作为审视人工智能的情感主义与理性主义视角
摘要: 人工智能系统能够成为道德行动者吗?也就是说,它们能否实施一些行动,而这些行动可以被恰当地评判为道德上正确或错误?目前尚不存在一种既定的规范性标准,能够恰当地适用于典型人类案例之外的道德行动者。鉴于规范性理论面临诸多困难,我们转而提出一项研究计划,以探讨描述性的道德行动能力。最根本的问题是:我们人类拥有哪些构成道德行动能力基础的能力?为此,我们借鉴哲学和道德心理学领域的历史研究,筛选出可能的候选能力。随后,我们建议对这些候选能力加以完善,使其能够在人工智能系统的语境中接受检验。最后,我们提出具体的实证建议,以检验人工智能系统,尤其是大型语言模型(LLM),是否具备这些经过完善的能力。我们的方法具有多方面的益处。首先,它可能揭示人工智能系统的行为是否与相关目标保持一致,或在广义上是否符合期望。其次,这场讨论可能为政策问题提供参考,例如应在哪些情境中部署哪些模型。第三,我们的方法可以补充工程和设计方面的努力:当相关能力能够被精确刻画时,它们便可以为模型开发提供指导。第四,将我们的道德推理概念应用于人工智能系统这一新情境,应有助于增进我们对这些概念本身的理解。
更新时间: 2026-11-19 16:20:29
领域: cs.AI,cs.CL
Context as a Resource
Managing concurrent tasks across separate agent sessions quickly exhausts human attention, motivating always-on personal agents behind a single continuous interface. Yet when every context shares identical frozen backbone weights, funneling interleaved dialogues and external events into one linear session induces cross-topic constraint bleed and head-of-line stalling. Conversely, router-ticket hierarchies incur lossy prose handoffs, heavy routing overhead, and blind merges - collapsing true-conflict repository merges to a 33.3% three-run mean despite high isolated branch passes. Rather than scheduling anthropomorphic roles, we introduce ClonAct, a routerless architecture that virtualizes context blocks directly through a pluggable single-pass non-generative Context MMU, in-place Context Cells, a footprint-aware Synaptic Bus with an isolated trial merge gate, and a wave-flushed Shared Trunk. Across three programmatic multi-stream benchmarks and three model families, our portable trial merge gate lifts true-conflict merges to 63.3%, while ClonAct's routerless virtualization attains this ceiling with 45.9% fewer prompt tokens and prevents compact-model router collapse. Under continuous surge streams, ClonAct matches top completion (95.0%) with the lowest median wait and zero timed-out status checks.
Updated: 2026-11-19 16:19:56
标题: 语境作为一种资源
摘要: 在不同代理会话之间管理并发任务会迅速耗尽人的注意力,因此人们需要始终在线、通过单一连续界面运行的个人代理。然而,当每个上下文共享完全相同且冻结的骨干网络权重时,将交错的对话与外部事件汇入一个线性会话,会导致跨主题约束相互渗透以及队头阻塞。相较之下,路由器—工单层级结构会产生有损的文本交接、沉重的路由开销和盲目合并;尽管各隔离分支的通过率较高,其真实冲突的代码仓库合并率在三次运行中的平均值仍降至33.3%。 我们不再调度拟人化角色,而是提出ClonAct:一种无路由器架构。该架构通过可插拔的单遍非生成式上下文MMU、原位Context Cell、具备隔离试验合并门的感知占用Synaptic Bus,以及采用波次刷新的Shared Trunk,直接对上下文块进行虚拟化。在三个程序化多流基准和三个模型系列上,我们的便携式试验合并门将真实冲突合并率提升至63.3%;与此同时,ClonAct的无路由器虚拟化以少45.9%的提示词令牌数达到这一上限,并避免了紧凑型模型中的路由器崩溃。在持续涌入的高峰流量下,ClonAct以最低的中位等待时间和零次状态检查超时,实现了与最佳完成率相当的95.0%完成率。
更新时间: 2026-11-19 16:19:56
领域: cs.AI
DeepQuest: From Knowledge Gaps to Scientific Discovery in Alzheimer's Disease
Automating experiments does not necessarily advance scientific understanding. Research agents must identify meaningful knowledge gaps, determine what available data can resolve, and assess whether their findings advance existing knowledge. We introduce DeepQuest, a knowledge-gap-driven AI scientist framework for Alzheimer's disease research. DeepQuest transforms unresolved questions from domain reviews into traceable, testable hypotheses and prioritizes them through data feasibility screening and groupwise Elo ranking. It couples iterative experimentation with two-level auditing that separates experimental reliability from knowledge contribution relative to two frozen literature corpora. On OASIS-3, DeepQuest produces 42 feasible hypotheses and outperforms the strongest baselines in 14 of 15 evaluator-dimension comparisons across three language-model reviewers. The full framework achieves an audit-assessed scientific finding rate of 95.24%, outperforming both general-purpose executors and domain-specific research agents. This scientific finding rate remains stable across literature corpora and evaluator model families. Representative findings concern neuropsychiatric symptoms and dementia risk, longitudinal amyloid spatial stability, and neocortical tau-associated clinical impairment, with key associations supported in independent ADNI and AIBL cohorts. These results show how aligning knowledge gaps, data feasibility, and evidence auditing can turn automated research into traceable, evidence-supported scientific discovery. Our source code is available at https://anonymous.4open.science/r/DeepQuest-3066/
Updated: 2026-11-19 16:18:26
标题: DeepQuest:从知识空白到阿尔茨海默病科学发现
摘要: 自动化实验并不一定能够推动科学理解。科研智能体必须识别具有意义的知识空白,确定现有数据能够解决哪些问题,并评估其研究发现是否推进了已有知识。我们提出了 DeepQuest,一种面向知识空白驱动的阿尔茨海默病研究人工智能科学家框架。DeepQuest 将领域综述中的未解决问题转化为可追溯、可检验的假设,并通过数据可行性筛选和分组 Elo 排名对其进行优先级排序。该框架将迭代式实验与双层审计相结合:一层评估实验可靠性,另一层则参照两个冻结的文献语料库,评估研究结果对知识的贡献。在 OASIS-3 数据集上,DeepQuest 生成了 42 个可行假设,并在三名语言模型评审者的 15 项评估维度比较中的 14 项上超过最强基线方法。完整框架经审计评估的科学发现率达到 95.24%,优于通用型执行器和领域专用研究智能体。该科学发现率在不同文献语料库和评估模型系列之间均保持稳定。具有代表性的发现涉及神经精神症状与痴呆风险、纵向淀粉样蛋白空间稳定性,以及新皮质 tau 相关的临床损害;其中的关键关联得到了独立 ADNI 和 AIBL 队列的支持。这些结果表明,将知识空白、数据可行性与证据审计相结合,能够把自动化研究转化为可追溯、由证据支持的科学发现。我们的源代码已发布于 https://anonymous.4open.science/r/DeepQuest-3066/
更新时间: 2026-11-19 16:18:26
领域: cs.AI
Training LLMs to Follow Reasoning Instructions with Minimal Edits
Large language models increasingly rely on extended reasoning traces, yet the training signals used to shape this behavior remain coarse. Supervised fine-tuning on full trajectories forces the model to imitate an entire demonstration, overconstraining its output distribution, while trajectory-level reinforcement learning provides only weak credit assignment, rewarding or penalizing whole completions without identifying where they succeed or fail. We propose edit-based training, a general framework for learning from a model's own trajectories via localized textual corrections. Given a sampled completion, an editor identifies the first point of failure under a specified criterion and proposes a minimal replacement span. The model is then supervised only on these edited spans. By design, this concentrates supervision where the model's reasoning first breaks down and aims to preserve its existing reasoning patterns elsewhere. The method applies both offline and online, with the latter continually adapting supervision to the model's evolving failure modes. We instantiate this approach on reasoning instruction following with Qwen3-32B on the ReasonIF benchmark. Compared to full-trajectory imitation and trajectory-level reinforcement learning baselines, edit-based training substantially improves compliance with the reasoning instruction while largely preserving the model's skills on untargeted tasks. These results suggest that localized correction is an effective complement to these approaches for shaping how LLMs reason.
Updated: 2026-11-19 16:18:25
标题: 通过最小编辑训练大语言模型遵循推理指令
摘要: 大型语言模型越来越依赖长篇推理过程,但用于塑造这种行为的训练信号仍然较为粗糙。对完整轨迹进行监督微调会迫使模型模仿整个示例,从而过度约束其输出分布;而轨迹级强化学习只能提供较弱的信用分配,在奖励或惩罚完整生成结果的同时,无法指出模型具体在哪些地方成功或失败。我们提出了基于编辑的训练方法,这是一种通过局部文本修正,从模型自身生成的轨迹中学习的通用框架。给定一段采样生成的文本,编辑器会根据指定标准识别第一个出错点,并提出一个最小替换片段。随后,模型仅针对这些编辑后的片段接受监督。通过这种设计,监督信号会集中在模型推理首次出现崩溃的位置,同时力图保留模型在其他位置已有的推理模式。该方法既适用于离线训练,也适用于在线训练;后者能够持续根据模型不断变化的失败模式调整监督信号。我们在 ReasonIF 基准上使用 Qwen3-32B,将这一方法应用于推理指令遵循任务。与完整轨迹模仿和轨迹级强化学习基线相比,基于编辑的训练显著提升了模型遵循推理指令的能力,同时基本保留了模型在未针对任务上的技能。这些结果表明,局部修正能够有效补充现有方法,用于塑造大语言模型的推理方式。
更新时间: 2026-11-19 16:18:25
领域: cs.AI
Sirius-Tiamat: How Small Can a One-Pass Decision Encoder Get Before Its Decisions Change?
A one-pass decision encoder reads a text, a question and several named options, and returns a probability for each option in a single forward pass. We ask how far Laya, a 421M-parameter encoder of this kind, can be compressed before its decisions change. We count decisions that differ from Laya's own full-precision (fp32) answer, and track calibration (how well confidence matches accuracy, measured by expected calibration error, ECE), on 1,221 synthetic items with the training schemas, 273 with an unseen schema, and 800 out-of-family questions from ARC, MMLU and HellaSwag. Layer pruning of a related model family is known; we add flips, calibration, held-out data and retraining. bf16 changes 0.2% of in-family decisions but 2.2% out of family; 6-bit grouped rounding 1.3% and 5.9%; deleting 6 layers 0.9% and 9.1%, while ECE rises from 5.9% to 39.2%. One fitted temperature, needing no labels, restores it to 3.6%. One scale per tensor fails below six bits, and CPU dynamic int8 changes 30% of decisions, nearly all through one layer. Total variation tracks flips for rounding but not for deletion, and an early exit saves layers over a static cut only if its confidence gate is first recalibrated. Distilling a 16-layer student cuts its in-family flips from 44% to 9% (45% out of family). At equal stored size, rounding flips fewer decisions than deletion. Data are synthetic and LLM-labelled, for one architecture.
Updated: 2026-11-19 16:17:13
标题: 天狼星—提亚马特:单遍决策编码器在决策发生改变前能做到多小?
摘要: 单遍决策编码器读取一段文本、一个问题和若干个带名称的选项,并在一次前向传播中为每个选项返回一个概率。我们考察了这类编码器 Laya(拥有 4.21 亿参数)在其决策发生变化之前可以被压缩到何种程度。我们统计与 Laya 自身全精度(fp32)答案不同的决策数量,并在包含 1,221 个采用训练阶段模式的合成题目、273 个采用未见过模式的题目,以及来自 ARC、MMLU 和 HellaSwag 的 800 个分布外问题上,跟踪其校准情况(即置信度与准确率的匹配程度,以预期校准误差 ECE 衡量)。相关模型家族的层剪枝已有研究;我们进一步加入了决策翻转、校准、留出数据和再训练方面的分析。bf16 使分布内决策改变了 0.2%,但使分布外决策改变了 2.2%;6 位分组舍入分别导致 1.3% 和 5.9% 的决策改变;删除 6 层则分别导致 0.9% 和 9.1% 的决策改变,同时 ECE 从 5.9% 上升到 39.2%。使用一个无需标签的拟合温度参数后,ECE 可恢复到 3.6%。每个张量使用一个缩放因子的方案在低于 6 位时失效,而 CPU 动态 int8 会改变 30% 的决策,其中几乎全部变化都通过某一层产生。总变差能够追踪舍入造成的决策翻转,但无法追踪删除层造成的翻转;只有在首先重新校准其置信度门控后,提前退出才能比静态截断节省更多层。将一个 16 层学生模型进行蒸馏后,其分布内决策翻转率从 44% 降至 9%(分布外为 45%)。在存储大小相同的情况下,舍入造成的决策翻转少于删除层。数据为合成数据,并由大型语言模型标注,且仅针对一种架构。
更新时间: 2026-11-19 16:17:13
领域: cs.AI
Anytime-Valid Conformal Risk Control
Prediction sets provide a means of quantifying the uncertainty in predictive tasks. Using held out calibration data, conformal prediction and risk control can produce prediction sets that exhibit statistically valid error control in a computationally efficient manner. However, in the standard formulations, the error is only controlled on average over many possible calibration datasets of fixed size. In this paper, we extend the control to remain valid with high probability over a cumulatively growing calibration dataset at any time point. We derive such guarantees using quantile-based arguments and illustrate the applicability of the proposed framework to settings involving distribution shift. We further show that our guarantees are asymptotically tight, in the sense that the risks converge to the target level from below, and that the rate of our correction cannot be improved. Finally, we demonstrate the practical performance of our methods through both simulations and real-world numerical examples.
Updated: 2026-11-19 16:16:15
标题: 任意时刻有效的保形风险控制
摘要: 预测集合为量化预测任务中不确定性提供了一种手段。利用留出的校准数据,保形预测和风险控制能够以计算高效的方式生成具有统计有效误差控制的预测集合。然而,在标准形式下,误差仅在许多可能的、大小固定的校准数据集上取平均时得到控制。本文将这种控制扩展为:对于随时间累积增长的校准数据集,在任意时间点以高概率保持有效。我们利用基于分位数的论证推导出此类保证,并说明所提出框架在涉及分布偏移的场景中的适用性。我们进一步证明,这些保证是渐近紧的,即风险从下方收敛至目标水平,并且我们的校正速率无法得到改进。最后,我们通过模拟实验和真实世界的数值示例展示了所提出方法的实际性能。
更新时间: 2026-11-19 16:16:15
领域: stat.ML,cs.LG
One Framework to Diagnose Them All: A Stratified Benchmark for Bengali LLM Hallucination
Hallucination research in low-resource languages fragments easily: each newly named failure mode prompts its own dataset, spending scarce annotators on incomparable resources. We argue for consolidation and test it at community scale. Alikbachan is a Bengali hallucination-detection benchmark stratified along three crossed axes: a human-validated cultural-distance band, six task types, and a five-family, 32-mode hallucination taxonomy. It comprises a harvested 2,516-item test set (Phase 1) and a quota-constructed, gold-labeled 5,000-item set (Phase 2). The stratification is diagnostic. Four zero-shot LLM judges vary by over 30 macro-F1 points across strata, and the item-level predictions of 99 Phase-1 and 32 Phase-2 competition systems reproduce the profile: discourse-level omission defeats judges and most teams alike, whereas only a minority over-flag negative controls. The judges' verdict probabilities rank items well (ROC-AUC 0.74-0.95) but are overconfident (ECE 0.04-0.29). An open competition on Alikbachan drew 222 teams and 3,566 submissions, and a single-prompt 32B judge reaches the 57th percentile. Of the 25 teams in both phases, 24 regress on Phase 2 (mean $-17.6$ points) while every zero-shot judge improves, and Phase-1 rank barely predicts Phase-2 rank (Spearman $ρ=0.35$), so a Phase-1 leaderboard alone would have crowned a different winner.
Updated: 2026-11-19 16:15:38
标题: 一套诊断框架,全面检测:孟加拉语大语言模型幻觉的分层基准测试
摘要: 低资源语言中的幻觉研究很容易陷入碎片化:每提出一种新的失败模式,就为其创建一个独立数据集,使本已稀缺的标注资源被投入到彼此不可比较的资源中。我们主张进行整合,并在社区规模上对这一主张加以检验。Alikbachan 是一个孟加拉语幻觉检测基准,沿着三个交叉维度进行分层:经人工验证的文化距离区间、六种任务类型,以及由五个家族、32 种模式构成的幻觉分类体系。该基准包括一个通过采集构建的 2,516 条测试集(第一阶段),以及一个按配额构建并经过金标准标注的 5,000 条数据集(第二阶段)。这种分层具有诊断作用。四个零样本大语言模型评判器在不同分层之间的宏平均 F1 差异超过 30 个百分点;99 个第一阶段和 32 个第二阶段参赛系统的逐条预测也重现了这一特征:话语层面的遗漏同样击败了评判器和大多数参赛团队,而只有少数系统会对负向对照样本过度标记。评判器的判定概率能够较好地对样本进行排序(ROC-AUC 为 0.74—0.95),但存在过度自信问题(ECE 为 0.04—0.29)。Alikbachan 举办的一项开放竞赛吸引了 222 支队伍,提交次数达到 3,566 次;一个采用单提示词的 32B 评判器取得了第 57 百分位的成绩。在两个阶段均参赛的 25 支队伍中,有 24 支在第二阶段退步(平均下降 17.6 分),而所有零样本评判器均有所提升;第一阶段排名对第二阶段排名的预测能力也很弱(Spearman ρ=0.35),因此仅凭第一阶段排行榜将会选出另一位冠军。
更新时间: 2026-11-19 16:15:38
领域: cs.CL,cs.AI
ClosureBench: A Benchmark for Reasoning under Closure Assumptions
AI agents built on large language models (LLMs) often answer questions from incomplete records. Missing information might be interpreted as unknown or false, depending on the completeness of the source. Current evaluations fail to distinguish these two aspects, as they are usually interwoven with other reasoning demands. We present ClosureBench, a benchmark that tests whether LLMs follow the stated rules for dealing with missing information. Every base scenario is tested under OWA, CWA, and LCWA, and only the treatment of missing information changes between variants. ClosureBench provides a verified base benchmark as well as agent extensions for action choice, source scope, and updates. A model is considered correct on a base scenario only if it provides correct answers in all of its closure variants. Across 960 instances, overall accuracy can mask substantial closure mistakes. Models achieve overall accuracy from 71.18% to 99.86% across replicated runs, but their core switch accuracy, measured on the scenarios whose gold label actually changes with the contract, varies between 18.23% and 99.31%. Large discrepancies emerge under LCWA. For example, some agents choose unknown despite the prompt indicating that missing information should be treated as false. Our findings demonstrate that evaluations of AI agents should not only measure whether agents can reason over existing facts but also whether they use the appropriate assumption when information is absent.
Updated: 2026-11-19 16:15:04
标题: ClosureBench:闭包假设下推理基准
摘要: 基于大型语言模型(LLM)的人工智能代理经常需要根据不完整的记录回答问题。根据信息来源的完整程度,缺失信息可能被解释为未知,也可能被解释为虚假。现有评估无法区分这两个方面,因为它们通常与其他推理要求交织在一起。我们提出了 ClosureBench,这是一个用于测试大型语言模型是否遵循既定缺失信息处理规则的基准。每个基础场景都分别在开放世界假设(OWA)、封闭世界假设(CWA)和局部封闭世界假设(LCWA)下进行测试,各变体之间仅改变对缺失信息的处理方式。ClosureBench 提供了经过验证的基础基准,以及针对行动选择、信息来源范围和信息更新的代理扩展。只有当模型在某个基础场景的所有闭包变体中都给出正确答案时,才认为其在该基础场景上回答正确。 在 960 个实例中,总体准确率可能掩盖大量闭包处理错误。在重复运行中,各模型的总体准确率介于 71.18% 和 99.86% 之间;但其核心切换准确率——即在真实标签确实会随规则约定改变的场景上测得的准确率——则介于 18.23% 和 99.31% 之间。在 LCWA 下出现了显著差异。例如,一些代理在提示明确说明应将缺失信息视为虚假的情况下,仍然选择“未知”。我们的研究结果表明,对人工智能代理的评估不应只衡量代理是否能够基于已有事实进行推理,还应衡量其在信息缺失时是否采用了恰当的假设。
更新时间: 2026-11-19 16:15:04
领域: cs.AI
Online Temporal Rotations for 2 Bit KV-Cache Quantization in Video Diffusion Transformers
Video diffusion transformers reuse key--value (KV) caches across denoising steps, which quickly becomes a bottleneck for long video generation. We find that quantizing temporally distant cache vectors leads to a large range and high quantization error, but that nearby video tokens in the KV-cache share a persistent pattern per channel. These patterns also vary across videos, motivating rotations that are adapted to each video's unique cache. We propose Temporal Rotation Quantization (TRQ), a method that rotates frames in the cache that are adjacent in time before quantization. For each block of temporally adjacent cache vectors, TRQ fits an orthogonal transform that maps the block's per-channel means to a vector that is close to a constant across channels. To keep the quantization format lightweight, we parameterize this rotation as a tree of $2 \times 2$ planar rotations, each stored with only two bits, followed by a fixed Hadamard transform shared across all blocks. The rotations are fit without gradients or changes to model weights, and we prove that a simple greedy fit is globally optimal for our 'mean-flattening' objective. The transforms are fit online for each new video, and we release fused Triton kernels to make this process efficient at inference. At 2-bit precision and matched compression, TRQ improves VBench subject consistency over the state-of-the-art method QVG from 90.38 to 92.02 on LongCat-Video-13B and from 86.33 to 87.61 on HY-WorldPlay-8B, as well as improving other metrics.
Updated: 2026-11-19 16:14:13
标题: 视频扩散 Transformer 中用于 2 位 KV 缓存量化的在线时序旋转
摘要: 视频扩散 Transformer 会在去噪步骤之间复用键值(KV)缓存,而对于长视频生成,这很快会成为瓶颈。我们发现,对时间上相距较远的缓存向量进行量化会导致较大的数值范围和较高的量化误差;但视频中时间上相邻的 token 在 KV 缓存中会按通道共享一种持久性模式。这些模式还会因视频而异,因此需要针对每个视频独特缓存进行自适应旋转。我们提出时间旋转量化(Temporal Rotation Quantization,TRQ),一种在量化前对缓存中时间上相邻的帧进行旋转的方法。对于每个由时间上相邻的缓存向量组成的块,TRQ 拟合一个正交变换,将该块各通道的均值映射为一个在各通道间近似恒定的向量。为使量化格式保持轻量,我们将该旋转参数化为由一系列 2×2 平面旋转构成的树,每个旋转仅用两比特存储,之后再应用一个在所有块之间共享的固定 Hadamard 变换。旋转的拟合过程无需梯度,也无需修改模型权重;同时,我们证明,对于“均值展平”目标,简单的贪心拟合在全局上是最优的。对于每个新视频,这些变换都会在线拟合;我们还发布了融合的 Triton 内核,以提高推理阶段这一过程的效率。在 2 比特精度和相同压缩率下,TRQ 将 LongCat-Video-13B 上 VBench 的主体一致性从当前最先进方法 QVG 的 90.38 提升至 92.02,将 HY-WorldPlay-8B 上的该指标从 86.33 提升至 87.61,同时也改善了其他指标。
更新时间: 2026-11-19 16:14:13
领域: cs.CV,cs.AI
Robust LLM Evaluation with Boundedly Bad Judges: A Constrained Maximum Likelihood Approach
Evaluating language models at scale often involves reconciling costly, but reliable, labels (e.g., from human raters) with cheap, but noisy, proxy labels (e.g., from LLM-as-a-judge autoraters). This paper proposes constrained maximum likelihood estimation (CMLE), a likelihood-based approach to large language model (LLM) evaluation that explicitly models the error in the proxy labels via their true-positive and false-positive rates, subject to data-driven constraints. Functionally, these constraints act as an adaptive regularization that restricts the feasible judge error rates, particularly when the available number of reliable labels is limited. In contrast to asymptotically unbiased estimators (such as those based on prediction-powered inference), this formulation accepts a controlled bias under misspecified constraints in exchange for variance reduction relative to various baselines including unconstrained maximum likelihood estimation (UMLE); we characterize this bias--variance tradeoff analytically under point constraints. We identify the regimes in which CMLE outperforms UMLE and prediction-powered baselines in mean squared error. We further extend the framework to heterogeneous settings using a stratified variant involving stratum-specific constraints based on judge confidence. Empirically, on synthetic and real-world LLM evaluation tasks, CMLE achieves up to roughly 9\% lower mean squared error (MSE) than non-stratified baselines, and its stratified variant (SCMLE) achieves up to roughly 30\% lower MSE than the strongest baseline considered, with the largest gains in low-label regimes.
Updated: 2026-11-19 16:14:08
标题: 采用有界劣质评判器的稳健大语言模型评估:一种约束最大似然方法
摘要: 大规模评估语言模型通常需要协调成本高但可靠的标签(例如由人工评审者提供的标签)与成本低但存在噪声的代理标签(例如由“以大语言模型作为裁判”的自动评估器生成的标签)。本文提出约束最大似然估计(CMLE),这是一种基于似然的大语言模型(LLM)评估方法,通过真实阳性率和假阳性率显式建模代理标签中的误差,并使其满足数据驱动的约束。从功能上看,这些约束充当自适应正则化,限制评估器误差率的可行范围,尤其是在可获得的可靠标签数量有限时。不同于渐近无偏估计器(例如基于预测增强推断的方法),该方法在约束设定错误时接受可控偏差,以换取相较于包括无约束最大似然估计(UMLE)在内的多种基线方法的方差降低;我们在点约束条件下对这种偏差—方差权衡进行了解析刻画。我们确定了CMLE在均方误差方面优于UMLE和基于预测增强的基线方法的适用情形。进一步地,我们将该框架扩展到异质场景,提出一种分层变体,该方法利用基于评估器置信度的分层特定约束。在合成和真实世界的大语言模型评估任务中,CMLE的均方误差(MSE)最高可比非分层基线降低约9%,而其分层变体(SCMLE)的MSE最高可比所考察的最强基线降低约30%,且在低标签数量场景下收益最大。
更新时间: 2026-11-19 16:14:08
领域: cs.CL,cs.AI
OceanCoder: A Verification-Guided Large Language Model for Automated Simulation Modelling in Ocean Engineering
Numerical simulation is important in ocean engineering, but model construction requires expert knowledge. Large language models support automated modelling, but code syntax and successful execution alone do not establish whether generated models and results meet engineering requirements. We present OceanCoder, a Qwen3-8B-based large language model for automated simulation modelling in ocean engineering. To address specialised programming requirements and scarce training data, we develop an extensible data construction pipeline producing 12,000 verified supervised fine-tuning (SFT) examples across 12 engineering task categories. A three-layer verification framework checks model inputs against engineering parameters and task constraints, verifies completion of required simulation analyses, and assesses the engineering plausibility of computed outputs. Its outcomes provide graded rewards for group relative policy optimisation (GRPO), guiding the model towards engineering task completion. We also construct the first benchmark for automated modelling in ocean engineering, covering out-of-distribution tasks and real-world engineering cases. Experiments and ablation studies demonstrate the effectiveness of the data pipeline, verification framework and reward design. OceanCoder outperforms both base models and the closed-source comparison, with Pass@1 increasing from 0% for the base model to 46.77% after SFT and 51.43% after GRPO. These results support engineering verification as a training signal for automated simulation modelling.
Updated: 2026-11-19 16:13:20
标题: OceanCoder:一种用于海洋工程自动化仿真建模的验证引导型大型语言模型
摘要: 数值模拟在海洋工程中十分重要,但模型构建需要专业知识。大语言模型能够支持自动化建模,但代码语法正确且成功执行,并不能单独证明所生成的模型和结果满足工程要求。我们提出了 OceanCoder,这是一种基于 Qwen3-8B、面向海洋工程自动化仿真建模的大语言模型。针对专业编程需求和训练数据稀缺问题,我们开发了一套可扩展的数据构建流程,生成了涵盖 12 类工程任务的 12,000 个经验证监督微调(SFT)样本。三层验证框架首先检查模型输入是否符合工程参数和任务约束,其次验证是否完成规定的仿真分析,最后评估计算输出的工程合理性。该框架产生的结果为群组相对策略优化(GRPO)提供分级奖励,引导模型完成工程任务。我们还构建了首个面向海洋工程自动化建模的基准,涵盖分布外任务和实际工程案例。实验和消融研究表明,所提出的数据流程、验证框架和奖励设计均有效。OceanCoder 的表现优于基础模型和闭源对比模型,其 Pass@1 从基础模型的 0% 提升至 SFT 后的 46.77%,并在 GRPO 后进一步提升至 51.43%。这些结果表明,工程验证可以作为自动化仿真建模的训练信号。
更新时间: 2026-11-19 16:13:20
领域: cs.LG,cs.SE
Rigel-Ladon: An Option-Count Law for a One-Pass Decision Encoder, Tested on Held-Out Option Counts and Held-Out Schemas
Laya is a small neural network that reads a text, a question and K written options, and returns one probability per option in a single pass. We ask how its accuracy falls as K grows from 2 to 35 and whether that can be predicted. We score nested option sets (every K-option question contains the smaller ones) on four question pools, for the released model (Base) and our fine-tune (FT), and score every item against each single rival. FT trained on one 12-option topic question (in-family); a 12-option HR (department-routing) question is out-of-family. Logit accuracy (the log of correct over incorrect answers) is linear in log(K-1) with slope 0.68 to 0.88. Fitted on K up to 6, the law predicts K=7 to 12 within 0.6 points and K up to 24 within 1.2 (a log-linear rule: 1.6 and 6.7). Taking the slope from the topic question and measuring only two-option accuracy on HR predicts its other K within 0.3 points (FT) and 0.7 (Base). On a 35-label pool of five schemas the law fails (5 to 11 points). Independence of irrelevant alternatives is rejected: the gold-versus-rival log-odds shifts by +0.24 to +2.07 nats per doubling of K, yet pairwise answers reproduce K-way accuracy within 4.7 points. Order averaging (averaging over several orderings of the options), shortlists, a temperature law and calibrated prediction sets did not transfer (FT's 90% sets cover 84% on HR). 2 of 10 predictions made in advance held. Caveats: one model family and LLM-labelled synthetic text.
Updated: 2026-11-19 16:12:55
标题: Rigel-Ladon:一种单遍决策编码器的选项计数定律——在留出的选项计数和留出的模式上进行测试
摘要: Laya 是一种小型神经网络,它读取一段文本、一个问题和 K 个文字选项,并在一次前向处理中为每个选项返回一个概率。我们考察当 K 从 2 增加到 35 时,其准确率如何下降,以及这种下降是否可以被预测。我们在四个问题池上对嵌套的选项集合进行评分(每个 K 选项问题都包含较小规模的选项集合),分别评估发布模型(Base)和我们的微调模型(FT),并针对每个单独的竞争选项对每道题进行评分。FT 使用一道包含 12 个选项的主题问题进行训练(同领域);另一道包含 12 个选项的人力资源问题(部门路由)则属于跨领域测试。对数准确率(正确答案相对于错误答案的对数)与 log(K−1) 呈线性关系,斜率为 0.68 至 0.88。在 K 不超过 6 的数据上拟合后,该规律对 K=7 至 12 的预测误差不超过 0.6 个百分点,对 K 不超过 24 的预测误差不超过 1.2 个百分点(相比之下,采用对数线性规则时误差分别为 1.6 和 6.7 个百分点)。取主题问题的斜率,并仅测量 HR 问题上的二选一准确率,可以预测其其他 K 值下的表现;FT 的误差不超过 0.3 个百分点,Base 的误差不超过 0.7 个百分点。在由五种模式构成的 35 个标签的问题池上,该规律失效,误差达到 5 至 11 个百分点。无关选项独立性假设遭到拒绝:每当 K 翻倍时,正确答案相对于竞争选项的对数几率会偏移 +0.24 至 +2.07 纳特;然而,成对答案仍能在 4.7 个百分点以内复现 K 路选择的准确率。选项顺序平均(对选项的多种排列分别进行预测后取平均)、候选短名单、温度规律以及经过校准的预测集合均未能迁移成功(FT 的 90% 预测集合在 HR 上的覆盖率为 84%)。预先做出的 10 项预测中有 2 项得到验证。注意事项:仅考察了一个模型系列,且使用了由大语言模型标注的合成文本。
更新时间: 2026-11-19 16:12:55
领域: cs.AI
Conformal Selection for Hierarchical Streaming Data
Many real-world tasks involve making sequential decisions about whether to select candidates before their responses of interest are revealed. In this work, we address the online selection problem in the context of hierarchical data, where candidates arrive sequentially from different populations. This extends existing online conformal selection frameworks beyond the standard i.i.d./exchangeable data assumption. The primary challenge lies in constructing valid statistics for each candidate sequentially under the hierarchical data structure. To this end, we first develop Online Hierarchical Selection (OHS), a distribution-free method that enables principled candidate selection for hierarchical data streams. Specifically, we introduce methods to construct rank-based e-values for both between-group and within-group samples, and apply averaged e-values to the online e-BH procedure. We then develop OHS with feedback (OHSF), which boosts the power of OHS by leveraging potential response feedback. Theoretically, the proposed methods achieve false discovery rate control under mild hierarchical exchangeability and data arrival assumptions at any time. We also generalize methods to broader settings, such as data with covariate shift and selection under effect-related responses. Extensive experiments on both simulated and real-world datasets demonstrate the effectiveness of the proposed methods.
Updated: 2026-11-19 16:10:32
标题: 层级流式数据的保形选择
摘要: 许多现实世界中的任务都涉及序贯决策,即在获得候选对象的相关响应之前,决定是否选择这些候选对象。本文在层级数据背景下研究在线选择问题,其中候选对象依次从不同总体中到达。这一研究将现有的在线保形选择框架拓展到标准独立同分布/可交换数据假设之外。其主要挑战在于,如何在层级数据结构下为每个候选对象依次构造有效统计量。为此,我们首先提出在线层级选择方法(Online Hierarchical Selection,OHS),这是一种无分布假设的方法,能够对层级数据流中的候选对象进行有理论依据的选择。具体而言,我们提出了分别针对组间样本和组内样本构造基于秩的 e 值的方法,并将平均 e 值应用于在线 e-BH 程序。随后,我们进一步提出带反馈的在线层级选择方法(OHS with feedback,OHSF),通过利用潜在的响应反馈来提升 OHS 的检验效能。从理论上看,在温和的层级可交换性和数据到达假设下,所提出的方法能够在任意时刻控制假发现率。我们还将这些方法推广到更广泛的情形,例如存在协变量偏移的数据,以及基于与效应相关的响应进行选择的情形。在模拟数据集和真实世界数据集上的大量实验表明,所提出的方法是有效的。
更新时间: 2026-11-19 16:10:32
领域: stat.ML,cs.LG
Sparse corruption in low-rank matrix inference: the PCA benchmark
Principal Component Analysis (PCA) is a standard tool for extracting a low-rank signal from noisy observations. It is known that when applying PCA to a rank-one signal corrupted by a dense, homogeneous noise, in the large matrix size limit, the BBP transition occurs, where the emergence of an outlying eigenvalue and the alignment of the corresponding eigenvector occur at the same critical signal strength. Here we study the case of sparse noise corruption. The noise matrix is modelled as the adjacency matrix of a weighted undirected graph with finite average connectivity. Using the replica method, we analytically compute the typical top eigenvalue, the top eigenvector component density, and the overlap with the signal, through recursive distributional equations solved by population dynamics. We identify two signal-strength transitions as functions of graph connectivity: $θ_{\rm crit}$, marking signal recovery by the top eigenvector and generalising the BBP transition, and $θ_{\rm b}$, where the signal-related eigenvalue detaches from the bulk. For noise with nonzero mean, these transitions need not coincide because of a structural sparse-graph outlier, leading to a discontinuous transition in the overlap with the top eigenvector. For a Random Regular degree distribution, we obtain exact closed-form expressions for both thresholds, the signal eigenvalue and the squared overlap, and show that the same formulas also predict the overlap of the signal with the second eigenvector in the intermediate regime $θ_{\rm b}<θ\leq θ_{\rm crit}$. For a Poissonian degree distribution, an approximate closure of the recursions yields fast and accurate predictions in the recovery phase that agree with exact results from population dynamics. We also recover dense-noise results in the large-connectivity limit, and validate the theory by numerical diagonalisation of large matrices.
Updated: 2026-11-19 16:09:32
标题: 低秩矩阵推断中的稀疏污染:PCA 基准测试
摘要: 主成分分析(PCA)是从噪声观测中提取低秩信号的标准工具。众所周知,当对受到稠密均匀噪声污染的秩一信号应用 PCA 时,在矩阵维度趋于无穷大的极限下会发生 BBP 转变:离群特征值的出现以及相应特征向量与信号的对齐,均发生在同一个临界信号强度处。本文研究稀疏噪声污染的情形。噪声矩阵被建模为一个具有有限平均连接度的带权无向图的邻接矩阵。利用复制方法,我们通过对种群动力学求解递归分布方程,解析计算了典型的最大特征值、最大特征向量分量的密度,以及其与信号的重叠度。我们确定了随图连接度变化的两个信号强度转变点:θ₍crit₎,表示最大特征向量开始恢复信号,并推广了 BBP 转变;以及 θ_b,表示与信号相关的特征值从特征值主体中分离出来。对于均值非零的噪声,由于稀疏图的结构性离群特征值,这两个转变点不一定重合,从而导致最大特征向量与信号的重叠度发生不连续转变。对于随机正则度分布,我们得到了两个阈值、信号特征值以及平方重叠度的精确闭式表达式,并证明在中间区域 θ_b<θ≤θ₍crit₎ 内,相同公式也能预测信号与第二特征向量的重叠度。对于泊松度分布,对递推关系进行近似闭合后,可以在恢复相中快速且准确地给出预测结果,并且与种群动力学得到的精确结果一致。在大连接度极限下,我们还恢复了稠密噪声的结果,并通过对大规模矩阵进行数值对角化验证了该理论。
更新时间: 2026-11-19 16:09:32
领域: stat.ML,cond-mat.dis-nn,cond-mat.stat-mech,cs.LG
Predicting Surface Displacement Fields of Laser Powder Bed Fusion Parts Using STL-Derived Graphs and Part-Level Descriptors
Predicting part distortion before fabrication remains challenging in laser powder bed fusion (LPBF), while thermomechanical simulation is computationally expensive for repeated design evaluations. This study presents a two-branch graph attention network (GAT) to predict three-dimensional surface displacement directly from STL-derived graphs. The first branch learns geometric relationships among connected vertices of a densified STL surface mesh, while the second incorporates 12 part-level descriptors of mass distribution, build-plate contact, overhang, size, and shape. Displacement labels from ANSYS Additive Print simulations are mapped onto STL vertices using Gaussian-kernel weighted averaging. Evaluated on 117 parts using five-fold cross-validation split by part, the model achieves an R^2 of 0.946 and a mean absolute error of 0.0178 mm for displacement magnitude. Relative to a node-wise multilayer perceptron, GAT improves R^2 from 0.913 to 0.946; for build-direction displacement, R^2 increases from 0.903 to 0.939. GAT also outperforms GraphSAGE (R^2 = 0.936) and a graph convolutional network (R^2 = 0.934) across all five folds. Ablation experiments show that removing mass-distribution descriptors reduces magnitude R^2 to 0.900, while removing build-plate contact and overhang descriptors reduces it to 0.920. These results demonstrate the value of combining local mesh connectivity with global geometric descriptors to predict LPBF distortion, enabling faster design iteration and earlier identification of distortion-prone geometries.
Updated: 2026-11-19 16:07:29
标题: 利用从 STL 文件提取的图结构和零件级描述符预测激光粉末床熔融零件的表面位移场
摘要: 在制造之前预测零件变形仍然是激光粉末床熔融(LPBF)中的一项挑战,而热力学模拟在反复进行设计评估时计算成本高昂。本研究提出了一种双分支图注意力网络(GAT),用于直接根据STL派生图预测三维表面位移。第一分支学习致密化STL表面网格中相连顶点之间的几何关系;第二分支则引入12个零件级描述符,涵盖质量分布、与构建板的接触、悬垂、尺寸和形状等特征。通过高斯核加权平均,将ANSYS Additive Print模拟得到的位移标签映射到STL顶点上。在由117个零件组成的数据集上进行按零件划分的五折交叉验证,结果表明,该模型对位移幅值的决定系数(R²)达到0.946,平均绝对误差为0.0178毫米。与逐节点多层感知机相比,GAT将R²从0.913提高至0.946;对于构建方向位移,R²则从0.903提高至0.939。在全部五个折次中,GAT的性能也优于GraphSAGE(R² = 0.936)和图卷积网络(R² = 0.934)。消融实验显示,移除质量分布描述符后,位移幅值的R²降至0.900;移除构建板接触和悬垂描述符后,R²降至0.920。这些结果表明,将局部网格连接关系与全局几何描述符相结合,有助于预测LPBF变形,从而实现更快速的设计迭代,并更早识别易发生变形的几何结构。
更新时间: 2026-11-19 16:07:29
领域: cs.LG
Tokengeist: Multi-Turn Attribution Tracing in Agentic Conversations
When a model answers after several turns of dialogue and tool use, an overseer needs to know which earlier turns and intermediate steps it rests on. Attribution is the natural primitive for answering this, but existing context attribution methods process the full transcript in a single pass: they recover surface-level dependencies while missing the layered structure of multi-turn traces, in which an assistant turn is itself a derived artifact that condenses or transforms earlier context. We introduce multi-turn context attribution (MTCA): given a target span in a model response, the task of tracing attribution backward across turns to identify not only which prior turns were directly relevant, but also how those turns themselves depended on earlier context. We propose Tokengeist, an attribution-method-agnostic and scalable framework that recovers full dependency paths by casting attribution as a recursive traversal of a directed acyclic graph over conversation turns. We will release MTCABench, a benchmark of 3,970 target spans across 685 multi-turn conversations, annotated with gold provenance graphs reaching depths of up to 17, across four dependency types. Across four open-weight models, flat attribution methods fail to recover multi-hop dependencies, with source recall improving from 11-38% under flat attribution to 82-94% under Tokengeist. Our results reveal a systematic failure mode of single-pass attribution, which we term provenance collapse, where attribution terminates at the nearest assistant restatement instead of the originating event.
Updated: 2026-11-19 16:06:35
标题: Tokengeist:智能体对话中的多轮归因追踪
摘要: 当模型经过多轮对话和工具调用后生成回答时,监督者需要知道该回答所依据的早期轮次和中间步骤。归因是回答这一问题的自然基础,但现有的上下文归因方法会将完整对话记录作为单一过程处理:它们能够恢复表层依赖,却忽略了多轮轨迹的层级结构;在这种结构中,助手的一轮回复本身就是一种派生产物,用于压缩或转换更早的上下文。我们提出多轮上下文归因(MTCA):给定模型回复中的一个目标片段,任务是跨轮次向后追踪其归因关系,不仅要识别哪些先前轮次与之直接相关,还要确定这些轮次本身如何依赖更早的上下文。我们提出 Tokengeist,这是一个与归因方法无关且具有可扩展性的框架,通过将归因建模为对跨对话轮次有向无环图的递归遍历,恢复完整的依赖路径。我们将发布 MTCABench,这是一个包含 685 段多轮对话、共计 3,970 个目标片段的基准数据集;其中标注了金标准溯源图,图的深度最高可达 17,涵盖四种依赖类型。在四个开放权重模型上的实验表明,扁平归因方法无法恢复多跳依赖;在 Tokengeist 下,来源召回率从扁平归因时的 11%—38% 提升至 82%—94%。我们的结果揭示了单遍归因的一种系统性失败模式,我们称之为溯源坍缩:归因会在最近的助手复述处终止,而不是追溯至最初发生的事件。
更新时间: 2026-11-19 16:06:35
领域: cs.AI,cs.CL
A Control-Theoretic Approximation to Predictive Coding Dynamics
Backpropagation remains the dominant method for training deep neural networks, but its reliance on non-local computations has motivated the search for biologically plausible alternatives. Two prominent frameworks, predictive coding (PC) and deep feedback control (DFC), offer distinct approaches to local learning, yet their relationship remains unclear. Here, we show that DFC arises as a local approximation to predictive coding dynamics near fixed points, with exact equivalence in shallow linear networks and systematic deviations arising with depth, nonlinearity, and distance from equilibrium. We characterize how this approximation, which we call Approx PC, deviates from PC in its activity dynamics, and show that these deviations can be mitigated by relinearizing the feedback controller and approaching the output target through a sequence of intermediate nudges. In networks trained on MNIST and FashionMNIST, Approx PC reaches task performance comparable to PC trained with the same nudges, and weights learned with it transfer directly to PC inference. Our results unify energy-based and control-theoretic perspectives on learning and open the door to applying tools from control theory to the training of predictive coding networks.
Updated: 2026-11-19 16:04:50
标题: 预测编码动力学的控制理论近似
摘要: 反向传播仍然是训练深度神经网络的主流方法,但其对非局部计算的依赖促使人们寻找具有生物学合理性的替代方案。预测编码(PC)和深度反馈控制(DFC)是两种重要的框架,分别提出了不同的局部学习方法,但二者之间的关系仍不明确。在这里,我们表明,DFC是在固定点附近对预测编码动力学进行局部近似后得到的结果;在浅层线性网络中,二者完全等价,而随着网络深度增加、非线性增强以及偏离平衡状态的程度加大,二者会系统性地产生偏差。我们刻画了这种被称为近似预测编码(Approx PC)的近似方法在活动动力学方面与PC的偏离,并表明,通过对反馈控制器重新线性化,以及通过一系列中间 nudges 逐步接近输出目标,可以减轻这些偏差。在MNIST和FashionMNIST上训练的网络中,使用与PC相同的 nudges 进行训练时,Approx PC能够达到与PC相当的任务性能;此外,利用Approx PC学习到的权重可以直接迁移到PC推理中。我们的研究统一了学习的基于能量和控制理论两种视角,并为将控制理论工具应用于预测编码网络的训练开辟了道路。
更新时间: 2026-11-19 16:04:50
领域: cs.LG,cs.AI,q-bio.NC
C-LiTE: A Lightweight Foundation Model for Cellular feature learning in Histopathology
Characterising individual cells is fundamental to computational pathology, as cellular morphology informs tasks such as tumour grading, mitotic assessment and immune profiling. However, most pathology foundation models are trained on tissue patches and capture cellular features only implicitly, while existing cell-level models are either restricted to specific cell populations or rely on computationally expensive architectures with hundreds of millions of parameters. Applying ViTs directly to small cellular crops also presents an architectural challenge: upsampling increases computational cost without adding morphological information and may introduce interpolation artefacts. To address these limitations, we introduce C-LiTE, a lightweight foundation model for cellular representation learning in H&E-stained histopathology, with only 22 million parameters. C-LiTE employs a native-resolution tokenisation strategy tailored to cellular inputs, processing 64 x 64 px cell-centred crops using a 4 x 4 patch embedding to produce a 16 x 16 token grid without image upsampling. To transfer visual knowledge from large-scale pre-training, we adapt the patch embedding weights of a pre-trained ViT-5-S using a pseudoinverse-based transformation, enabling weight initialisation at the finer patch resolution. We further assemble a pre-training dataset of 60 million cell-centred crops from TCGA, balanced across 19 cancer types and 16 tissue types. To our knowledge, this represents the largest public dataset for self-supervised pre-training on H&E images at the cellular level. We evaluate C-LiTE on seven public datasets spanning mitotic figure recognition, nucleus and cell-type classification, and immune cell phenotyping. Under frozen-feature evaluation, C-LiTE achieves a mean macro-F1 of 0.670, approaching CytoFormer (0.682) with approximately 30x fewer parameters.
Updated: 2026-11-19 16:03:54
标题: C-LiTE:用于组织病理学细胞特征学习的轻量级基础模型
摘要: 表征单个细胞是计算病理学的基础,因为细胞形态能够为肿瘤分级、有丝分裂评估和免疫谱分析等任务提供信息。然而,大多数病理学基础模型都基于组织图像块进行训练,仅以隐式方式捕捉细胞特征;现有的细胞级模型则要么局限于特定细胞群体,要么依赖包含数亿参数、计算成本高昂的架构。将视觉 Transformer(ViT)直接应用于较小的细胞裁剪图像也带来了架构上的挑战:上采样会增加计算成本,却不会增添形态学信息,并且可能引入插值伪影。 为了解决这些局限,我们提出了 C-LiTE,这是一种面向苏木精-伊红(H&E)染色组织病理学细胞表征学习的轻量级基础模型,仅包含 2200 万个参数。C-LiTE 采用针对细胞输入设计的原生分辨率标记化策略,处理尺寸为 64 × 64 像素、以细胞为中心的裁剪图像,并通过 4 × 4 的图像块嵌入生成 16 × 16 的标记网格,无需对图像进行上采样。为了迁移大规模预训练所获得的视觉知识,我们利用基于伪逆的变换调整预训练 ViT-5-S 的图像块嵌入权重,从而能够在更精细的图像块分辨率下进行权重初始化。 此外,我们从 TCGA 中整理了一个包含 6000 万个以细胞为中心的裁剪图像的预训练数据集,并在 19 种癌症类型和 16 种组织类型之间进行平衡。据我们所知,这是目前最大的公开细胞级 H&E 图像自监督预训练数据集。我们在七个公开数据集上评估了 C-LiTE,这些数据集涵盖有丝分裂图像识别、细胞核与细胞类型分类以及免疫细胞表型分析。在冻结特征评估中,C-LiTE 的平均宏 F1 值达到 0.670,接近 CytoFormer 的 0.682,而参数量约减少了 30 倍。
更新时间: 2026-11-19 16:03:54
领域: cs.CV,cs.AI
Actor-Predictor Architecture for Reinforcement Learning with Formal Specification Objectives
One fundamental challenge in reinforcement learning (RL) is enforcing temporal safety constraints, such as satisfying formal specifications. Existing methods often transform logic formulas into automata for state augmentation and reward shaping. However, this approach assumes that automaton construction is both feasible and tractable, which limits its applicability to small specifications and linear temporal logic (LTL). This paper proposes Actor-Predictor, a framework that learns a surrogate representation of logic progress without explicitly constructing an automaton. The predictor continuously estimates whether a partial trajectory will satisfy the formal specification in a later step, and its learned features are provided as auxiliary inputs to the actor, which is then optimized using GRPO and RWR. We show theoretically that, under sufficient predictive accuracy, the learned representation is equivalent to the automaton state. Experiments on grid world and robotic tasks in Isaac Lab demonstrate that Actor-Predictor outperforms automaton-based baselines on LTL-constrained tasks. It also performs well on non-regular formal specifications, such as $(a^n b^n)$, for which finite-automaton-based approaches are not applicable.
Updated: 2026-11-19 16:03:02
标题: 用于具有形式化规约目标的强化学习的行动者—预测器架构
摘要: 强化学习(RL)面临的一项根本性挑战,是如何满足时间安全约束,例如满足形式化规范。现有方法通常将逻辑公式转换为自动机,用于状态扩展和奖励塑形。然而,这种方法假设自动机构造既可行又具有可处理性,从而限制了其在小型规范和线性时序逻辑(LTL)之外的应用。本文提出了 Actor-Predictor 框架,在不显式构造自动机的情况下学习逻辑进展的替代表示。预测器持续估计一条部分轨迹在后续步骤中是否会满足形式化规范,并将其学习到的特征作为辅助输入提供给 actor,随后使用 GRPO 和 RWR 对 actor 进行优化。我们从理论上证明,在预测精度足够高的情况下,所学习的表示与自动机状态等价。在网格世界和 Isaac Lab 中机器人任务上的实验表明,在受 LTL 约束的任务中,Actor-Predictor 的表现优于基于自动机的基线方法。对于非正规形式化规范,例如 $(a^n b^n)$,它同样表现良好;对于这类规范,基于有限自动机的方法并不适用。
更新时间: 2026-11-19 16:03:02
领域: cs.AI
VESTA: Visual Exploration with Statistical Tool Agents
Fitting quantitative models to data is a central step in scientific workflows, yet it remains one of the least automated. Recent agent-based systems leverage language and vision-language models (VLMs) to propose statistical models, but these systems struggle on challenging modeling tasks. To address these limitations, we introduce VESTA (Visual Exploration with Statistical Tool Agents), a framework that equips VLMs with a dynamically growing toolkit to guide model refinement through data transformations, hypothesis-driven visualizations, and statistical tests. Unlike prior systems that rely on iterative critique alone, VESTA explores data before and during refinement by selecting or creating reusable diagnostic tools. We evaluate VESTA using three toolkit configurations: no tools, static expert-written tools, and dynamic model-written tools. To support this evaluation, we introduce DAWN (Dataset for Automated Workflows and Numerical Modeling), a benchmark targeting distribution fitting and time series modeling with varying difficulty tiers that culminates in real-world astronomy tasks including modeling initial mass functions and gravitational-wave chirp signals. VESTA's dynamic tool creation outperforms prior agentic pipelines for statistical analysis and visual tool creation, with the largest gains on complex and domain-specific tasks. Against strong agentic coding harnesses (Claude Code, Codex, and OpenCode), VESTA is better on all time series tasks and on complex distribution fitting tasks, though the harnesses achieve better fits on simpler distributions. Further, dynamically generated tools are substantially more sophisticated than those produced by existing visual tool-creation systems, covering more diagnostic categories per function and strongly preferring visual outputs that the VESTA VLM critic can reason over directly.
Updated: 2026-11-19 16:02:04
标题: VESTA:借助统计工具代理进行可视化探索
摘要: 将定量模型拟合到数据是科学工作流程中的核心步骤,但它仍然是自动化程度最低的环节之一。近期的智能体系统利用语言模型和视觉语言模型(VLM)提出统计模型,但在具有挑战性的建模任务上仍表现不佳。为解决这些局限性,我们提出 VESTA(Visual Exploration with Statistical Tool Agents,统计工具智能体视觉探索)框架,为 VLM 配备一个动态扩展的工具包,通过数据变换、基于假设的可视化和统计检验来指导模型改进。不同于仅依赖迭代式批评的既有系统,VESTA 在模型改进之前及过程中探索数据,通过选择或创建可复用的诊断工具来辅助建模。 我们使用三种工具包配置对 VESTA 进行评估:无工具、由专家编写的静态工具,以及由模型编写的动态工具。为支持这一评估,我们提出 DAWN(Dataset for Automated Workflows and Numerical Modeling,自动化工作流与数值建模数据集)基准。该基准面向分布拟合和时间序列建模,设置了不同难度等级,并最终包含真实世界的天文学任务,例如初始质量函数和引力波啁啾信号的建模。 VESTA 的动态工具创建能力在统计分析和可视化工具创建方面均优于以往的智能体流程,在复杂任务和特定领域任务上取得的提升最大。与强大的智能体编程工具框架(Claude Code、Codex 和 OpenCode)相比,VESTA 在所有时间序列任务以及复杂分布拟合任务上表现更好,尽管这些工具框架在较简单的分布上能够获得更优的拟合效果。此外,动态生成的工具比现有视觉工具创建系统生成的工具复杂得多:每个函数涵盖更多诊断类别,并且明显更倾向于生成 VESTA 的 VLM 批评器能够直接进行推理的视觉输出。
更新时间: 2026-11-19 16:02:04
领域: cs.AI,cs.CL,cs.CV,cs.LG,stat.CO
Client Exits - A Way to Increase LLM Transparency on the Client Side
Textual recommendations generated by large language models (LLMs) can be difficult to inspect. This paper introduces \emph{Client Exits}, a lightweight mechanism for enriching LLM responses while separating semantic intent from client-specific presentation. The model inserts predefined, machine-interpretable markers into its output, and the receiving client decides whether and how to realize the corresponding enrichments. This allows supplementary information to be presented as graphics, text, speech, or other modalities without prescribing a concrete interface. We implement a prototype combining a finetuned Qwen model with a modified LibreChat client. Using the Question--Option--Criteria (QOC) approach including three XML-based client exits. We evaluate two QOC-oriented model variants trained on essentially the same examples, with client-exit annotations added for one variant. Across 100 test questions, the client-exit model includes all three markers in every response. An LLM judge, informed about the mechanism without being instructed to favor it, prefers this model's answers in 66\% of the comparisons. These results demonstrate successful marker generation on the evaluated test set and support the feasibility of client-controlled enrichment.
Updated: 2026-11-19 15:58:09
标题: 客户端退出机制——提升大语言模型客户端透明度的一种途径
摘要: 大型语言模型(LLM)生成的文本建议可能难以检查。本文提出了“客户端出口”(Client Exits)这一轻量级机制,用于丰富 LLM 的响应,同时将语义意图与面向特定客户端的呈现方式分离。模型会在输出中插入预定义的、机器可解释的标记,而接收客户端则决定是否以及如何实现相应的增强内容。这样,补充信息便可以图形、文本、语音或其他模态呈现,而无需规定具体的界面。我们实现了一个原型系统,将微调后的 Qwen 模型与修改版 LibreChat 客户端相结合。该系统采用包含三个基于 XML 的客户端出口的“问题—选项—标准”(QOC)方法。我们评估了两个面向 QOC 的模型变体,它们基于基本相同的示例进行训练,其中一个变体额外加入了客户端出口标注。在 100 个测试问题中,加入客户端出口的模型在每个响应中都包含了全部三个标记。一名了解该机制但未被要求偏向该机制的 LLM 评审者,在 66% 的比较中更偏好该模型生成的答案。这些结果表明,在所评估的测试集上,模型能够成功生成标记,并支持由客户端控制增强内容这一方案的可行性。
更新时间: 2026-11-19 15:58:09
领域: cs.AI
What Matters for Cross-Modal Alignment
The Platonic Representation Hypothesis posits that models trained on different modalities converge toward a shared representation. Related work aligns frozen image and text encoders on natural images without paired data. We test zero-pair alignment on five datasets across four modalities: natural images, environmental audio, chest radiographs, and 3D computed tomography (CT). It succeeds only on COCO and fails on the other four. We analyze the failures and find that alignment must first locate the subspace where the modalities co-vary and then orient the mapping within it. Consistent with previous studies, medical imaging is the hardest case: its shared subspace carries the smallest fraction of the variance. When this fraction is small, alignment needs image-text pairs, and random-matrix theory predicts how many pairs are needed. These findings motivate LightAlign: a few pairs let a ridge regression between two frozen encoders locate and orient the mapping simultaneously, and a classifier fitted only on report text then predicts findings from the mapped images. On 3D CT, LightAlign surpasses models trained end to end on image-report pairs without finding-level labels: with only 200 pairs, LightAlign outperforms CT-CLIP on CT-RATE (0.754 vs. 0.733 AUROC), and with only 100 CT-RATE pairs, it does so on RAD-ChestCT, an out-of-distribution dataset from a different hospital. On CheXpert, it reaches 0.862 mean AUROC with only about 5% as many pairs as models trained on MIMIC-CXR.
Updated: 2026-11-19 15:56:34
标题: 跨模态对齐的关键因素
摘要: 柏拉图表征假说认为,在不同模态上训练的模型会趋向于形成一种共享表征。相关研究在没有配对数据的情况下,将冻结的图像编码器和文本编码器对齐到自然图像上。我们在涵盖四种模态的五个数据集上测试了无配对对齐:自然图像、环境音频、胸部X光片和三维计算机断层扫描(CT)。该方法仅在 COCO 上成功,在其余四个数据集上均失败。我们分析了失败原因,发现对齐必须先定位模态共同变化所在的子空间,然后在该子空间内确定映射方向。与先前研究一致,医学影像是最困难的情况:其共享子空间所承载的方差比例最小。当这一比例较小时,对齐需要图像—文本配对数据,而随机矩阵理论可以预测所需的配对数量。这些发现促成了 LightAlign:少量配对数据即可通过两个冻结编码器之间的岭回归,同时定位并确定映射;随后,仅使用报告文本训练的分类器便可根据映射后的图像预测影像学发现。在三维 CT 上,LightAlign 超越了那些在图像—报告配对数据上端到端训练、但不使用发现级标签的模型:仅使用 200 对数据时,LightAlign 在 CT-RATE 上的表现优于 CT-CLIP(AUROC 为 0.754,对比 0.733);仅使用 100 对 CT-RATE 数据时,在来自另一家医院的分布外数据集 RAD-ChestCT 上也取得了更好的表现。在 CheXpert 上,它仅使用 MIMIC-CXR 训练模型约 5% 的配对数据,就达到了 0.862 的平均 AUROC。
更新时间: 2026-11-19 15:56:34
领域: cs.CV,cs.AI
Scalable fault vulnerability analysis for ReRAM-based process-in-memory CNN accelerators
Resistive random-access memory (ReRAM)-based processing-in-memory (PIM) accelerators offer a highly efficient platform for parallel matrix-vector multiplications (VMM) in neural networks, leveraging analog computation, high density, low leakage, and non-volatility. However, their susceptibility to permanent faults, such as stuck-at-high (\textit{SaH}) and stuck-at-low (\textit{SaL}) resistance states, permanently corrupts the convolutional neural networks (CNNs) weights mapped onto ReRAM cell conductance values, thereby degrading inference accuracy and leading to system unreliability in safety-critical applications. Fault injection is a commonly used technique to assess the vulnerability of neural networks by systematically injecting faults into individual parameters and measuring the resulting accuracy degradation. Although this method is accurate, it is prohibitively time-consuming and computationally expensive, especially for large-scale CNNs. In this paper, we propose a fast, scalable, and analytical framework to quantify the fault vulnerability of convolutional neural networks deployed on ReRAM-based PIM accelerators. This method quantifies vulnerability at different granularities, including weights, kernels, and layers, without the need for exhaustive simulation, enabling the design of fault-tolerant accelerators for edge and safety-critical applications. The comparison between the results of the proposed vulnerability score (VS) metrics with performance metric of CNNs captured with fault injection simulations confirms the effectiveness of our proposed method. Unlike exhaustive fault injection, which requires days or weeks, whereas the proposed approach achieves a speedup of about $10^4\times-10^5\times$, enabling fast and accurate vulnerability analysis for large-scale CNNs within only a few minutes or hours.
Updated: 2026-11-19 15:55:47
标题: 面向基于ReRAM的存内处理卷积神经网络加速器的可扩展故障脆弱性分析
摘要: 基于电阻式随机存取存储器(ReRAM)的存内处理(PIM)加速器利用模拟计算、高密度、低漏电和非易失性等优势,为神经网络中的并行矩阵-向量乘法(VMM)提供了高效平台。然而,该类加速器容易受到永久性故障的影响,例如高阻态卡死(SaH)和低阻态卡死(SaL)故障。这些故障会永久破坏映射到ReRAM单元电导值上的卷积神经网络(CNN)权重,从而降低推理精度,并导致安全关键应用中的系统可靠性下降。故障注入是一种常用技术,通过有系统地向各个参数注入故障并测量由此产生的精度下降,来评估神经网络的脆弱性。尽管该方法具有较高的准确性,但其耗时和计算成本极高,尤其是在面对大规模CNN时。本文提出了一种快速、可扩展且具备解析性的框架,用于量化部署在基于ReRAM的PIM加速器上的卷积神经网络的故障脆弱性。该方法无需进行穷举式仿真,即可在不同粒度上量化脆弱性,包括权重、卷积核和层,从而支持面向边缘及安全关键应用的容错加速器设计。将所提出的脆弱性评分(VS)指标结果与通过故障注入仿真获得的CNN性能指标进行比较,验证了所提方法的有效性。与需要数天或数周的穷举式故障注入相比,所提出的方法可实现约$10^4\times-10^5\times$的加速,使得对大规模CNN进行快速且准确的脆弱性分析成为可能,且仅需几分钟或几小时。
更新时间: 2026-11-19 15:55:47
领域: cs.AR,cs.LG
A Tensor-Algebraic No-Go Theorem for High-Dimensional Photonic Greenberger--Horne--Zeilinger States Discovered with AlphaProof Nexus
Photonic GHZ states generated with probabilistic pair sources can be described by edge-coloured, complex-weighted graphs. In this representation, conditioning on an event with one photon in every detector turns the output amplitudes into coherent sums over perfect matchings, and generating an \(N\)-photon \(D\)-dimensional GHZ state is equivalent to constructing a monochromatic quantum graph. Here, we prove that no complex-weighted monochromatic quantum graph exists for any even \(N\ge4\) when \(D\ge N\). The proof, discovered through AI-assisted formal proof search in Lean using AlphaProof Nexus, constructs a weighted sum \(\mathcal F\) of amplitudes whose coefficients factor vertex by vertex. Summing over the colours at one fixed vertex reduces the problem to an \((N-1)\times N\) matrix of effective edge weights. For the graph amplitudes \(ω\) and GHZ target \(Δ\), the row--column imbalance yields \(\mathcal F(ω)=0\) but \(\mathcal F(Δ)\neq0\), contradicting the required equality \(ω=Δ\). Finally, we give a physical interpretation of the AI-discovered mathematical proof.
Updated: 2026-11-19 15:51:44
标题: 由 AlphaProof Nexus 发现的高维光子格林伯格–霍恩–蔡林格态的张量代数不可行性定理
摘要: 利用概率性成对光子源生成的光子 GHZ 态,可以用边着色、复权图来描述。在这一表示中,对每个探测器恰好探测到一个光子的事件进行条件化,会将输出振幅转化为完美匹配上的相干求和;而生成一个 \(N\) 光子、\(D\) 维的 GHZ 态,则等价于构造一个单色量子图。本文证明,当 \(N\ge4\) 为偶数且 \(D\ge N\) 时,不存在复权单色量子图。该证明是在使用 AlphaProof Nexus 通过人工智能辅助的 Lean 形式化证明搜索中发现的:构造了一个振幅加权和 \(\mathcal F\),其系数按顶点逐点分解。对某个固定顶点的颜色求和,会将问题化为一个由有效边权组成的 \((N-1)\times N\) 矩阵。对于图振幅 \(ω\) 和 GHZ 目标态 \(Δ\),行列不平衡导致 \(\mathcal F(ω)=0\),但 \(\mathcal F(Δ)\neq0\),这与所要求的等式 \(ω=Δ\) 矛盾。最后,我们给出了这一由人工智能发现的数学证明的物理解释。
更新时间: 2026-11-19 15:51:44
领域: quant-ph,cs.AI,math.CO
DailySafe: Benchmarking Dynamic Safety Awareness in Everyday Multi-Turn Multimodal Interactions
As multimodal large language models (MLLMs) become increasingly integrated into everyday life, their ability to provide safe and reliable assistance in realistic daily activities remains insufficiently explored. Existing safety benchmarks primarily focus on isolated harmful requests or adversarial scenarios, overlooking the safety risks that may arise as ordinary tasks unfold. In practice, users pursue legitimate goals through multi-turn, multimodal interactions, where seemingly benign requests may become safety-critical when considered alongside earlier actions and visual observations. This calls for Dynamic Safety Awareness, the ability to track evolving task conditions, recognize implicit contextual risks, and provide safe and helpful assistance. To systematically evaluate this capability, we introduce DailySafe, a benchmark comprising 195 naturalistic multi-turn, multi-image interactions across 10 everyday domains and 42 task categories. Grounded in authentic user dialogue topics and documented safety knowledge, DailySafe captures realistic scenarios where safety-critical evidence is progressively revealed across conversational turns and visual observations. Using case-specific safety annotations, DailySafe assesses whether MLLMs can recognize and appropriately address evolving risks while supporting users' legitimate goals, bringing multimodal safety evaluation closer to real-world everyday AI assistance. DailySafe is publicly available at: https://github.com/XuankunRong/DailySafe.
Updated: 2026-11-19 15:51:12
标题: DailySafe:日常多轮多模态交互中的动态安全意识基准测试
摘要: 随着多模态大语言模型(MLLM)日益融入日常生活,其在真实日常活动中提供安全、可靠协助的能力仍未得到充分探索。现有安全基准主要聚焦于孤立的有害请求或对抗性场景,忽视了普通任务逐步展开过程中可能产生的安全风险。在实际使用中,用户通过多轮、多模态交互来实现正当目标;如果结合此前的操作和视觉观察,一些看似无害的请求可能会演变为关乎安全的情境。这要求模型具备动态安全意识,即能够跟踪不断变化的任务条件,识别隐含的上下文风险,并提供安全且有帮助的协助。 为系统评估这一能力,我们提出了 DailySafe 基准。该基准涵盖 10 个日常领域和 42 类任务,由 195 组自然的多轮、多图像交互组成。DailySafe 以真实用户对话主题和有据可查的安全知识为基础,刻画了这样一类现实场景:关乎安全的关键证据会随着对话轮次和视觉观察逐步显现。借助针对具体案例的安全标注,DailySafe 评估 MLLM 是否能够在支持用户正当目标的同时,识别并恰当应对不断变化的风险,从而推动多模态安全评估更加贴近日常 AI 助手的真实应用场景。DailySafe 已公开发布于:https://github.com/XuankunRong/DailySafe】【。
更新时间: 2026-11-19 15:51:12
领域: cs.CR
SKILL.PNG: Learning Agent Skills in Pixel Space
AI agents are commonly specialized for new tasks and domains using skills, i.e. natural language instructions placed in their context. However, the discrete nature of textual skills prevents continuous optimization. Gradient-based approaches such as finetuning, on the other hand, are typically model-specific, preventing skill transfer across different agents. Since many agents today are built on vision-language models (VLMs), we can address these limitations by introducing Skill.png: a method for obtaining skill-like image inputs whose pixels are optimized with gradient descent through the vision encoder of a frozen VLM. Image skills are compatible with any VLM, and a single image can be optimized jointly for an ensemble of models. We show that Skill.png significantly outperforms state-of-the-art textual skills optimized using frontier LLMs in 9 of 16 settings (across 4 VLMs and 4 benchmarks) while requiring only 64 to 256 image tokens instead of roughly 900 to 2000 text tokens at inference time. Hybrid skills, i.e. text and image skills jointly optimized, further improve agent performance. Moreover, an image optimized with an ensemble of VLMs can successfully transfer across the models in the ensemble. Skill.png thus presents the first agent skill that can be optimized with gradient descent while retaining transfer benefits of text skills. Our code is available at: https://github.com/omseeth/skill.png
Updated: 2026-11-19 15:51:03
标题: SKILL.PNG:在像素空间中学习智能体技能
摘要: 人工智能代理通常通过技能来针对新任务和新领域进行专门化,即将自然语言指令置于其上下文中。然而,文本技能的离散特性阻碍了连续优化。另一方面,微调等基于梯度的方法通常针对特定模型,从而无法在不同代理之间迁移技能。鉴于如今许多代理都基于视觉语言模型(VLM),我们通过引入 Skill.png 来解决这些局限性:这是一种获取类似技能的图像输入的方法,其像素通过冻结的 VLM 的视觉编码器,使用梯度下降进行优化。图像技能与任何 VLM 兼容,并且可以针对一组模型对单张图像进行联合优化。我们表明,在 16 种设置中的 9 种设置下(涵盖 4 个 VLM 和 4 个基准),Skill.png 的表现显著优于使用前沿大语言模型优化的最先进文本技能;同时,在推理时仅需 64 至 256 个图像词元,而不是约 900 至 2000 个文本词元。混合技能,即联合优化的文本技能与图像技能,能够进一步提升代理性能。此外,使用一组 VLM 优化的图像,还可以成功迁移到该模型集成中的各个模型。由此,Skill.png 提出了首个能够通过梯度下降进行优化、同时保留文本技能迁移优势的代理技能。我们的代码地址为:https://github.com/omseeth/skill.png
更新时间: 2026-11-19 15:51:03
领域: cs.LG,cs.CV
A human-in-the-loop Bayesian optimization framework for constraint-aware bioprocess development
We present Pareto Front Guided Sampling (PFGS), a human-in-the-loop (HiL) Bayesian Optimization (BO) framework that reformulates surrogate-model predictions as a multi-objective optimization problem, allowing domain knowledge to beadded intuitively to any BO problem. PFGS addresses constrained optimization by treating the posterior probability of constraint satisfaction as an explicit Pareto objective, and robust optimization via a Monte Carlo estimate of expected lower-confidence performance under input perturbations, capturing likely degradation. The multi-dimensional Pareto front makes trade-offs between predicted performance, model uncertainty, constraint satisfaction, and robustness visible through pairwise two-dimensional projections on an interactive dashboard, allowing selection criteria to be refined as the model and objectives evolve. The framework is showcased on a eight-dimensional in-silico fed-batch Chinese Hamster Ovary cell culture case study. We showed improved performance over BO when the expert has perfect domain knowledge; however, PFGS is not designed to outperform BO, but rather to present a HiL acquisition function framework.
Updated: 2026-11-19 15:49:28
标题: 一种人在回路中的约束感知型生物工艺开发贝叶斯优化框架
摘要: 我们提出了帕累托前沿引导采样(Pareto Front Guided Sampling,PFGS),这是一种人在回路(human-in-the-loop,HiL)贝叶斯优化(Bayesian Optimization,BO)框架。该框架将代理模型的预测结果重新表述为一个多目标优化问题,从而能够以直观的方式将领域知识融入任何贝叶斯优化问题中。PFGS通过将约束满足的后验概率作为一个明确的帕累托目标来处理约束优化问题;同时,通过蒙特卡洛方法估计输入扰动下预期的低置信度性能,实现鲁棒优化并捕捉可能出现的性能下降。多维帕累托前沿通过交互式仪表板中的成对二维投影,使预测性能、模型不确定性、约束满足度和鲁棒性之间的权衡变得直观可见,从而允许随着模型和目标的变化不断改进选择标准。我们在一个八维的计算机模拟中国仓鼠卵巢细胞培养补料分批过程案例研究中展示了该框架。结果表明,当专家具备完备的领域知识时,PFGS的性能优于BO;然而,PFGS的设计目标并非超越BO,而是提供一个人在回路采集函数框架。
更新时间: 2026-11-19 15:49:28
领域: cs.LG,cs.HC,stat.ML
Who Moved My $Z$ Boson? Revealing Resonance Features Inside a Neural Network
Methods used in mechanistic interpretability have revealed human-aligned concepts inside language and image models. In this paper, we search for physics concepts inside a neural a generative collider physics model trained on real LHC data (ShellFlow). We discover features inside ShellFlow that represent resonances, such as the $Z$, $J/ψ$, and $Υ$. The network was never told which muons come from a resonance, it was only trained to generate the kinematics of the final-state particles. We use these features to alter aspects of the $Z$ boson: we change its mass between $\sim80$ and $105$ GeV, and removing such a feature from the neural network produces a broader $Z$ peak. In both cases the rest of the invariant mass spectrum remains mostly unchanged. The feature was built from the gradients of the neural network, and its selectivity was built using pattern recognition methods. A generative particle physics model trained on unlabeled data can be modified internally to change a physical quantity.
Updated: 2026-11-19 15:48:04
标题: 是谁移动了我的 $Z$ 玻色子?揭示神经网络内部的共振特征
摘要: 机制可解释性研究中使用的方法,已经在语言模型和图像模型内部揭示出与人类认知一致的概念。在本文中,我们在一个基于真实大型强子对撞机(LHC)数据训练的神经生成对撞机物理模型(ShellFlow)中寻找物理学概念。我们发现,ShellFlow 内部存在表示共振态的特征,例如 \(Z\)、\(J/\psi\) 和 \(\Upsilon\)。网络从未被告知哪些缪子来自某个共振态,它仅接受训练以生成末态粒子的运动学信息。我们利用这些特征改变 \(Z\) 玻色子的某些性质:将其质量在约 \(80\) 至 \(105\) GeV 之间改变;从神经网络中移除这一特征,则会使 \(Z\) 峰变宽。在这两种情况下,不变质量谱的其余部分基本保持不变。该特征是根据神经网络的梯度构建的,而其选择性则通过模式识别方法建立。一个在无标签数据上训练的生成式粒子物理模型,可以在内部进行修改,从而改变某个物理量。
更新时间: 2026-11-19 15:48:04
领域: hep-ph,cs.LG,hep-ex,physics.data-an
Towards Better Exploration in Sequential Test-Time Scaling
Test-time scaling improves language model reasoning by spending additional compute at inference. However, both classes of existing methods often fail to continue improving over long timescales. Parallel methods repeatedly sample independent answers from the model, scaling poorly on problems the model is unlikely to solve in a single attempt. In contrast, sequential methods build on previous answers to access new ideas, yet so far have not been shown to reach answers beyond those found by parallel scaling. First, we show that sequential scaling often stops improving because it becomes prematurely trapped in an attractor: a set of answers that prevents exploration of different answers once entered. Across 27 combinations of scaling methods, models, and benchmarks, we find that 53.8% of sequential scaling trajectories enter an attractor within four iterations. Second, we show that a simple model-mixing intervention helps escape attractors. This reduces the attractor hit rate by 21.2 percentage points on average, expands solution coverage beyond a compute-matched parallel baseline, and improves accuracy of recursive self-aggregation by at least 2.2 percentage points. Our results motivate refocusing long-horizon test-time scaling from parallel methods to sequential methods that improve previous answers.
Updated: 2026-11-19 15:47:44
标题: 迈向更优的序列式测试时扩展探索
摘要: 测试时扩展通过在推理阶段投入额外计算量来提升语言模型的推理能力。然而,现有两类方法往往都无法在较长时间尺度上持续改进。并行方法反复从模型中独立采样答案,因此在模型不太可能一次性解决的问题上扩展性较差。相比之下,序列方法基于先前的答案进行构建,从而获取新的思路;但迄今为止,尚无证据表明其能够得到超越并行扩展所发现答案的结果。 首先,我们表明,序列扩展之所以常常停止改进,是因为它会过早陷入某个吸引子:一组答案一旦进入其中,便会阻碍对不同答案的探索。在扩展方法、模型和基准测试的27种组合中,我们发现,53.8%的序列扩展轨迹会在四次迭代内进入吸引子。其次,我们表明,一种简单的模型混合干预有助于逃离吸引子。该方法平均将吸引子命中率降低21.2个百分点,使解决方案覆盖范围超越计算量匹配的并行基线,并使递归式自聚合的准确率至少提升2.2个百分点。我们的结果表明,应将长时程测试时扩展的重点从并行方法转向能够改进先前答案的序列方法。
更新时间: 2026-11-19 15:47:44
领域: cs.LG
Twice-Told Critiques: Claim-Level Homogenization of Peer Review in the LLM Era
Peer review relies on several readers finding different problems. We measure critique overlap in conference and journal reviews. At ICLR, measured overlap rose from 12.0% in 2026 to 21.3% in 2027, in reviews from the same stage of the review process, with year-on-year rises at NeurIPS, ICML and the F1000 and PLOS journals. A third ICLR review of a paper added 5.46 new problems to the other two in 2027, against 6.12 in 2026. We apply MELD, a detector of LLM-generated text, to all reviews. Within a paper, two reviews that MELD flags overlap more than two unflagged reviews: by 3.0 points at ICLR in 2024-2025, by 4.5 points in 2026-2027, and by 5.4 points across five journal sources. These results provide evidence that LLM-flagged reviews of one paper are less distinct from each other than unflagged reviews, and suggest that the diversity of critiques among reviews of a single paper is falling.
Updated: 2026-11-19 15:45:51
标题: 二次转述的批评:大语言模型时代同行评审的主张层级同质化
摘要: 同行评审依赖于多位读者发现不同的问题。我们测量了会议和期刊评审中的批评重叠程度。在 ICLR 中,在评审流程同一阶段的评审之间,测得的重叠率从 2026 年的 12.0% 上升到 2027 年的 21.3%;NeurIPS、ICML 以及 F1000 和 PLOS 期刊的评审中也出现了同比上升。2027 年,对一篇论文进行的第三次 ICLR 评审,相比前两次评审新增了 5.46 个问题,而 2026 年这一数字为 6.12 个。我们将一种用于检测大语言模型生成文本的检测器 MELD 应用于所有评审。在同一篇论文内,MELD 标记为疑似由大语言模型生成的两份评审,其重叠程度高于两份未被标记的评审:在 2024—2025 年的 ICLR 中高出 3.0 个百分点,在 2026—2027 年高出 4.5 个百分点,在五个期刊来源中高出 5.4 个百分点。这些结果表明,同一篇论文中被大语言模型检测器标记的评审彼此之间的差异小于未被标记的评审,并暗示单篇论文各份评审之间批评意见的多样性正在下降。
更新时间: 2026-11-19 15:45:51
领域: cs.CL,cs.AI,cs.DL
What If Chain-of-Thought Is Not Enough?
Reasoning capabilities in large language models have evolved from prompting-based methods to internalized model behaviors. In this paper, we investigate whether the internal thinking model of an LLM can be deliberately changed and whether such a change is beneficial. Instead of relying on Chain-of-Thought, we train models to follow Question--Option--Criteria (QOC), a structured decision process that decomposes a task into explicit questions, competing options, and evaluation criteria. We present a three-generation development pipeline that ranges from a basic QOC decision core to richer answer synthesis and statistically enriched QOC reasoning. We then evaluate the resulting models with respect to both internal consistency and output quality. Across the reported experiments, QOC-based fine-tuning improves answer quality relative to non-fine-tuned base models and yields particularly strong gains once models are large enough to execute the underlying QOC computations reliably. The results suggest that the internal thinking model of an LLM is trainable and that structured alternatives to Chain-of-Thought can provide a promising path toward more reliable, interpretable, and task-adapted decision support.
Updated: 2026-11-19 15:43:51
标题: 如果思维链还不够呢?
摘要: 大型语言模型的推理能力已经从基于提示的方法发展为模型内部化的行为。在本文中,我们探究:是否能够有意改变大语言模型的内部思维模型,以及这种改变是否有益。我们不依赖思维链,而是训练模型遵循“问题—选项—标准”(Question–Option–Criteria,QOC)这一结构化决策过程,将任务分解为明确的问题、相互竞争的选项以及评估标准。我们提出了一个包含三代模型的开发流程,其发展范围从基础的 QOC 决策核心,到更丰富的答案综合,再到融入统计信息的 QOC 推理。随后,我们从内部一致性和输出质量两个方面对所得模型进行评估。在所报告的各项实验中,与未经微调的基础模型相比,基于 QOC 的微调能够提升答案质量;当模型规模足够大、能够可靠地执行底层 QOC 计算后,性能提升尤为显著。结果表明,大语言模型的内部思维模型是可以训练的,而相较于思维链,结构化的替代方案有望为实现更可靠、更具可解释性且更适应任务的决策支持提供一条可行路径。
更新时间: 2026-11-19 15:43:51
领域: cs.CL,cs.AI
Federated Physics-Informed Thermal Field Prediction Across Unseen Geometries in Distributed Additive Manufacturing
In additive manufacturing (AM), each change in part geometry requires a new thermal simulation, which makes design evaluation over many candidates costly. Geometry-aware models reduce this cost by predicting thermal fields on unseen parts with a single learned model, but they assume that diverse geometries are available centrally. This assumption is restrictive when each manufacturing site holds only a limited set of proprietary part designs that it cannot share. We propose Fed-PIGANO, a federated framework that trains physics-informed geometry-aware neural operator (PI-GANO) models at individual sites and aggregates their geometry encoders and prediction networks without sharing part geometries. We evaluate the framework on a 2D steady-state thermal benchmark for metal AM, with geometries from five polygonal families distributed across three sites under four scenarios that range from identical to strongly different family compositions. Over seven replications, Fed-PIGANO achieves mean relative L2 errors of 1.83% to 2.04% across all 12 scenario-site cases, compared with up to 20.46% for local-only training, and consistently yields lower PDE residuals. Its prediction accuracy is comparable to that of a centralized model trained on the pooled geometries of all sites. These results demonstrate that federated learning lets manufacturing sites benefit from each other's geometries without sharing them, enabling rapid thermal prediction on new part designs for tasks such as shape optimization, inverse design, and uncertainty quantification.
Updated: 2026-11-19 15:39:12
标题: 分布式增材制造中跨未见几何结构的联邦物理信息热场预测
摘要: 在增材制造(AM)中,零件几何形状的每次变化都需要重新进行热模拟,这使得对大量候选方案进行设计评估的成本十分高昂。几何感知模型通过使用单一的学习模型预测未见过的零件上的热场,可以降低这一成本;但这类模型假设能够集中获取多样化的几何形状。当每个制造地点仅拥有数量有限且无法共享的专有零件设计时,这一假设便具有局限性。我们提出了 Fed-PIGANO,这是一种联邦学习框架,可在各个站点训练物理信息几何感知神经算子(PI-GANO)模型,并在不共享零件几何形状的情况下,对其几何编码器和预测网络进行聚合。我们在一个面向金属增材制造的二维稳态热学基准上评估了该框架。该基准包含来自五个多边形族的几何形状,这些几何形状被分配至三个站点,并设置了四种场景,其站点间几何族组成从完全相同到高度不同不等。在七次重复实验中,Fed-PIGANO 在全部12个“场景—站点”案例中的平均相对 L2 误差为1.83%至2.04%,而仅使用本地数据训练时的误差最高可达20.46%;同时,Fed-PIGANO 始终取得更低的偏微分方程残差。其预测精度与使用所有站点汇总几何形状训练的集中式模型相当。这些结果表明,联邦学习能够让制造站点在不共享几何形状的情况下相互利用彼此的几何信息,从而实现对新零件设计的快速热预测,并支持形状优化、逆向设计和不确定性量化等任务。
更新时间: 2026-11-19 15:39:12
领域: cs.LG
A Statistical Framework for Training Data Auditing of Large Language Models
Training-data auditing asks whether data of interest were used to train a large language model (LLM), a question central to privacy auditing, copyright protection, and benchmark-contamination detection. These concerns are particularly relevant to the use of copyrighted books and scientific papers in pre-training, as well as synthetic text and medical question-answer records in fine-tuning. In practice, training membership signals may be concentrated in only a few passages of a long document, making it important to aggregate evidence within each document without diluting these localized signals. Beyond individual documents, auditing a target collection requires an overall assessment based on the document-level evidence. In this paper, we propose a unified statistical framework for document-level membership inference, target-collection global auditing, and suspicious-subset identification. We integrate complementary chunk-level membership evidence with Cauchy combination to construct document scores for document-level membership inference. The document scores and their calibrated p-values further enable an overall assessment of training-data collection use and the identification of suspicious documents through multiple testing. Under the stated exchangeability conditions, we establish finite-sample validity of document-level p-values, type-I error control for global auditing, and false discovery rate control for subset identification. Case studies on BookTection, Pile-arXiv, Cosmopedia, and HealthCareMagic demonstrate the effectiveness and reliability of the proposed framework in auditing pre-training and fine-tuning data.
Updated: 2026-11-19 15:34:44
标题: 大语言模型训练数据审计的统计框架
摘要: 训练数据审计旨在判断所关注的数据是否被用于训练大型语言模型(LLM),这是隐私审计、版权保护和基准污染检测中的核心问题。这些问题与在预训练中使用受版权保护的书籍和科学论文,以及在微调中使用合成文本和医疗问答记录尤其相关。在实践中,训练成员身份信号可能仅集中于长文档中的少数几个段落,因此,如何在不稀释这些局部信号的情况下汇总每个文档内的证据至关重要。除单个文档外,对目标数据集进行审计还需要基于文档级证据作出总体评估。本文提出了一个统一的统计框架,用于文档级成员推断、目标数据集的全局审计以及可疑子集识别。我们利用柯西组合方法整合互补的块级成员证据,从而构建用于文档级成员推断的文档得分。文档得分及其校准后的 p 值进一步支持对训练数据集使用情况的总体评估,并通过多重检验识别可疑文档。在所述可交换性条件下,我们建立了文档级 p 值的有限样本有效性、全局审计中的第一类错误控制,以及子集识别中的错误发现率控制。在 BookTection、Pile-arXiv、Cosmopedia 和 HealthCareMagic 上开展的案例研究表明,所提出的框架在审计预训练数据和微调数据方面具有有效性与可靠性。
更新时间: 2026-11-19 15:34:44
领域: stat.ML,cs.LG,stat.AP
Digitization of Analogue Gauges using Computer Vision
Analogue gauges remain prevalent in manufacturing industries for measuring physical quantities, yet manual monitoring by operators introduces human error and operational inefficiency. This research developed and evaluated an automated gauge reading system using computer vision and deep learning techniques. Three hybrid approaches were implemented and compared: OpenCV with Scikit-Image (traditional computer vision), OpenCV with ResNet18, and OpenCV with VGG19 (deep learning approaches). A comprehensive dataset of 1,848 pressure gauge images (0-10 BAR range) was curated through web scraping, synthetic generation, and augmentation techniques. The experimental results demonstrate that ResNet18 significantly outperforms the alternatives, achieving an accuracy of 97.3%, compared to VGG19's 64.4% and Scikit-Image's 63.8%. The study validates the effectiveness of residual learning architectures for industrial gauge digitization, providing a robust foundation for Industry 5.0 automation applications.
Updated: 2026-11-19 15:33:49
标题: 利用计算机视觉实现模拟仪表数字化
摘要: 模拟仪表在制造业中仍被广泛用于测量物理量,但由操作人员进行人工监测容易引入人为错误并降低运行效率。本研究利用计算机视觉和深度学习技术,开发并评估了一套自动仪表读数系统。研究实施并比较了三种混合方法:OpenCV 与 Scikit-Image(传统计算机视觉)、OpenCV 与 ResNet18,以及 OpenCV 与 VGG19(深度学习方法)。研究通过网络爬取、合成生成和数据增强技术,构建了一个包含1,848张压力表图像的综合数据集,压力范围为0至10 BAR。实验结果表明,ResNet18的性能显著优于其他方法,准确率达到97.3%,而VGG19和Scikit-Image的准确率分别为64.4%和63.8%。本研究验证了残差学习架构在工业仪表数字化中的有效性,为面向工业5.0的自动化应用提供了坚实基础。
更新时间: 2026-11-19 15:33:49
领域: cs.CV,cs.AI
Similarity-based OSF Logic for Flexible SPARQL Query Answering
We present an updated version of fosf, a reasoner for fuzzy order-sorted feature (OSF) logic, with support for flexible SPARQL query answering over RDF knowledge graphs. Fuzzy OSF logic is a knowledge representation and reasoning language where feature symbols denote functions and sort symbols denote fuzzy sets. Sorts are organized in a fuzzy subsumption relation that extends to OSF terms, record-like structures representing classes of entities. The unification algorithm for these structures provides a calculus of fuzzy type subsumption. The latest release of fosf introduces support for similarity-based reasoning by extending the OSF language with a similarity relation among sorts, alongside a translation engine for compiling OSF terms into standard SPARQL. Queries expressed as OSF terms undergo fuzzy ontology-aware rewriting prior to translation. This process incorporates an OSF theory of sort definitions, feature domain and range declarations, and fuzzy subsumption and similarity relations through fuzzy OSF constraint normalization. This rewriting enables flexible query answering by returning approximate solutions, allowing queries that would otherwise be inconsistent with the underlying ontology to yield relevant results.
Updated: 2026-11-19 15:33:21
标题: 基于相似性的 OSF 逻辑:灵活的 SPARQL 查询应答
摘要: 我们介绍了 fosf 的更新版本。fosf 是一种面向模糊有序分类特征(OSF)逻辑的推理器,支持对 RDF 知识图谱进行灵活的 SPARQL 查询回答。模糊 OSF 逻辑是一种知识表示与推理语言,其中,特征符号表示函数,分类符号表示模糊集合。分类通过模糊包含关系组织起来,该关系还扩展到 OSF 项上;OSF 项是一种类似记录的数据结构,用于表示实体类。这些结构的合一算法提供了模糊类型包含的演算。最新版本的 fosf 通过在 OSF 语言中引入分类之间的相似关系,并配备将 OSF 项编译为标准 SPARQL 的翻译引擎,实现了基于相似性的推理。以 OSF 项表示的查询在翻译之前,会先经过模糊本体感知的重写。该过程通过模糊 OSF 约束规范化,纳入了分类定义理论、特征的定义域与值域声明,以及模糊包含关系和相似关系。通过这种重写,可以实现灵活的查询回答,返回近似解,使得原本会与底层本体不一致的查询也能够产生相关结果。
更新时间: 2026-11-19 15:33:21
领域: cs.AI,cs.DB,cs.LO
From Fragmentation to Fusion: A Survey and Roadmap for Omnimodal Embeddings
Embedding models underpin virtually every modern AI system, from search engines to recommendation systems. Despite shared mathematical foundations, research on embedding models remains fragmented by modality: the communities develop largely in isolation, seldom exchanging insights. We argue that this fragmentation obscures a deeper convergence. Driven by contrastive learning, Transformer architectures, and a granularity shift, embedding research across modalities is converging toward a common set of principles, even as modality-specific challenges remain underexplored. To reason across this convergence without conflating it, we propose a framework of three progressively harder capabilities: coverage, comparability, and compositionality. Three paths toward unification satisfy these in turn: transformation broadens coverage, alignment enables comparability, and joint embedding, the terminus we advocate, aims at compositionality. This position paper traces the resulting evolution, providing the first unified, cross-cutting treatment of omnimodal embedding research.
Updated: 2026-11-19 15:31:52
标题: 从碎片化到融合:全模态嵌入的综述与路线图
摘要: 嵌入模型支撑着几乎所有现代人工智能系统,从搜索引擎到推荐系统无不如此。尽管它们具有共同的数学基础,嵌入模型研究却仍因模态而彼此割裂:各研究群体大多独立发展,很少交流和借鉴彼此的洞见。我们认为,这种割裂掩盖了更深层次的趋同。在对比学习、Transformer 架构以及粒度转变的推动下,跨模态的嵌入研究正逐渐趋向一套共同原则,尽管各模态特有的挑战仍未得到充分探索。为在不将这种趋同混为一谈的前提下进行跨领域思考,我们提出一个由三种难度逐步提升的能力构成的框架:覆盖性、可比性和组合性。实现统一的三条路径依次满足这些能力:变换拓展覆盖范围,对齐实现可比性,而联合嵌入——也是我们所倡导的终点——旨在实现组合性。本文以立场论文的形式梳理了由此产生的演进历程,首次对全模态嵌入研究进行了统一且跨领域的系统论述。
更新时间: 2026-11-19 15:31:52
领域: cs.CL,cs.AI
SkillBridge: Cost-Aware Diagnosis and Repair of Cross-OS Compatibility Defects in Agent Skills
LLM agents increasingly reuse executable capabilities through skills, but a skill that works on one OS may fail on another because OS assumptions are spread across guide text, scripts, metadata, install contracts, and local entrypoints. Diagnosing such failures by running every skill on every OS is expensive: many executions spend model tokens, runner time, and review effort before revealing whether the failure is truly OS-related. We present SkillBridge, a contract-based workflow with three stages: static analysis, dynamic validation, and repair. SkillBridge first screens 3,270 skill-target-OS cases, covering 1,090 skills across Linux, macOS, and Windows, to find OS-sensitive contract evidence. It then runs dynamic tasks and root-cause review on selected cases to confirm whether a failure is caused by an OS assumption, and repairs the contract field that caused the failure, such as guide text, package scripts, dependencies, or platform declarations. Repair raises the reviewer-judged target-task pass rate from 30.6% to 38.4%, a gain of 7.8 percentage points. A retrospective Linux/macOS budget analysis further shows the efficiency effect: SkillBridge reaches 38 confirmed OS issues with 185 dynamic validations, where uniform random selection would require about 865 validations in expectation.
Updated: 2026-11-19 15:30:28
标题: SkillBridge:面向智能体技能跨操作系统兼容性缺陷的成本感知诊断与修复
摘要: 大型语言模型(LLM)智能体越来越多地通过技能复用可执行能力,但一个在某种操作系统上有效的技能,可能会因操作系统假设分散在指南文本、脚本、元数据、安装契约和本地入口点中,而在另一种操作系统上失效。通过在每种操作系统上运行每个技能来诊断此类故障成本高昂:许多执行会在揭示故障是否确实与操作系统相关之前,就消耗模型令牌、运行器时间和审查工作量。我们提出了 SkillBridge,这是一种包含三个阶段的基于契约的工作流:静态分析、动态验证和修复。首先,SkillBridge 对 3,270 个“技能—目标操作系统”案例进行筛查,覆盖 Linux、macOS 和 Windows 上的 1,090 个技能,以发现与操作系统相关的契约证据。随后,它对选定案例运行动态任务并进行根因审查,以确认故障是否由操作系统假设导致,并修复引发故障的契约字段,例如指南文本、软件包脚本、依赖项或平台声明。修复后,经审查者评定的目标任务通过率从 30.6% 提升至 38.4%,增加了 7.8 个百分点。对 Linux/macOS 的回顾性预算分析进一步显示了其效率效果:SkillBridge 通过 185 次动态验证发现了 38 个已确认的操作系统问题,而均匀随机选择预计需要约 865 次验证。
更新时间: 2026-11-19 15:30:28
领域: cs.SE,cs.AI
Agent^2 RL-Bench: Can LLM Agents Engineer Agentic RL Post-Training?
We introduce Agent^2 RL-Bench, a compact diagnostic benchmark for evaluating agentic RL post-training, which tests whether LLM agents can autonomously design, implement, debug, and execute post-training pipelines that improve foundation models. RL post-training increasingly drives model alignment and specialization, yet existing benchmarks are largely static, rewarding supervised fine-tuning or script generation without assessing an agent's ability to close an interactive RL loop. Agent^2 RL-Bench provides a unified agent-facing interface: each run starts from an isolated workspace containing a base model, task data, instructions, and a grading API, and agents must iterate within a fixed budget by training models and submitting artifacts for evaluation. The benchmark spans six tasks across three levels, from static rule-based training to judge-based optimization and closed-loop online RL with trajectory collection. Two diagnostic skills, namely runtime recording and post-hoc summarization, enable structured analysis of agent behavior, facilitating smooth and effective iteration of the benchmark's evaluation framework. Across five agent systems and six driver LLMs, agents show intelligent behavior but clear limitations: one RL-oriented run improves ALFWorld from 4.85 to 93.28 via SFT warm-up and GRPO with online rollouts, yet DeepSearchQA remains difficult, most successful routes rely on supervised pipelines, and interactive outcomes show large differences across agent stacks. Overall, Agent2 RL-Bench shows that current agents can sometimes engineer online RL, but stable agent-driven RL post-training remains rare under fixed budgets. It also demonstrates that our benchmark provides a strong and effective evaluation framework for future research in this direction. Code is available at https://github.com/microsoft/RD-Agent.
Updated: 2026-11-19 15:29:28
标题: Agent² RL-Bench:大型语言模型智能体能否进行智能体强化学习后训练工程?
摘要: 我们提出 Agent^2 RL-Bench,这是一个用于评估智能体式强化学习后训练的紧凑型诊断基准,旨在测试大语言模型智能体能否自主设计、实现、调试并执行后训练流程,从而提升基础模型的性能。强化学习后训练正日益推动模型对齐与专业化发展,然而现有基准大多是静态的,主要奖励监督微调或脚本生成,却未能评估智能体闭合交互式强化学习循环的能力。Agent^2 RL-Bench 提供了统一的面向智能体的接口:每次运行都从一个隔离工作区开始,其中包含基础模型、任务数据、指令和评分 API;智能体必须在固定预算内反复迭代,通过训练模型并提交产物接受评估。该基准涵盖三个层级的六项任务,范围从静态的基于规则的训练,到基于评判器的优化,再到包含轨迹收集的闭环在线强化学习。两项诊断技能,即运行时记录和事后总结,支持对智能体行为进行结构化分析,从而促进基准评估框架的顺畅迭代与有效改进。在五个智能体系统和六个驱动大语言模型上的实验表明,智能体展现出一定的智能行为,但仍存在明显局限:其中一次面向强化学习的运行通过监督微调预热和结合在线 rollout 的 GRPO,将 ALFWorld 的得分从 4.85 提升至 93.28;然而,DeepSearchQA 仍然难以解决,大多数成功路径依赖监督式流程,而且交互式结果在不同智能体技术栈之间存在显著差异。总体而言,Agent^2 RL-Bench 表明,当前智能体有时能够完成在线强化学习工程,但在固定预算下,由智能体驱动的稳定强化学习后训练仍较为罕见。该基准还证明,我们的评估框架能够为这一方向的未来研究提供有力且有效的支持。代码见:https://github.com/microsoft/RD-Agent。
更新时间: 2026-11-19 15:29:28
领域: cs.AI
STAGE: Spatio-Temporal Augmented Graph Expansion for Weakly Supervised Cross-Tweet Event Causality Discovery
Causal relations in disaster-related social media of- ten span independent posts, making cross-tweet causal discovery difficult to supervise and model at scale. We propose STAGE, a framework that separates scalable cross-tweet weak-supervision construction from spatio-temporal relational learning over event occurrences. Starting from local causal seeds, STAGE retrieves semantically related event occurrences across tweets and uses a causal scorer to construct weakly labeled cross-tweet pairs. These pairs supervise a multi-head Graph Attention Network over semantically enriched event representations and a spatio- temporal context graph. We evaluate STAGE on California Wildfire and Hurricane Harvey using human-gold cross-tweet test sets and 15 baselines. Compared with local-only supervision, the constructed cross-tweet supervision improves STAGE AUPRC by 0.340 on Wildfire and 0.107 on Hurricane. STAGE achieves in-domain AUROC of 0.885 on Wildfire and 0.710 on Hurricane. Cross-disaster experiments reveal asymmetric transfer, highlighting sensitivity to dataset-specific spatio-temporal shifts. These results demonstrate the value of scalable cross-tweet supervision combined with relational event modeling for causal learning across fragmented disaster reports.
Updated: 2026-11-19 15:28:46
标题: STAGE:用于弱监督跨推文事件因果关系发现的时空增强图扩展
摘要: 灾害相关社交媒体中的因果关系往往跨越彼此独立的帖子,使得跨推文因果发现难以进行大规模监督和建模。我们提出 STAGE,一种将可扩展的跨推文弱监督构建与针对事件发生的时空关系学习相分离的框架。STAGE 从局部因果种子出发,检索不同推文中语义相关的事件发生实例,并利用因果评分器构建带有弱标签的跨推文事件对。这些事件对用于监督一个多头图注意力网络,该网络作用于语义增强的事件表示和时空上下文图。我们在加利福尼亚野火和哈维飓风数据集上,使用人工标注的跨推文测试集和 15 个基线方法对 STAGE 进行评估。与仅使用局部监督相比,所构建的跨推文监督使 STAGE 在野火数据集上的 AUPRC 提升了 0.340,在飓风数据集上提升了 0.107。STAGE 在野火和飓风数据集上的域内 AUROC 分别达到 0.885 和 0.710。跨灾害实验显示出不对称迁移现象,凸显了模型对特定数据集时空分布变化的敏感性。这些结果表明,将可扩展的跨推文监督与事件关系建模相结合,对于从碎片化的灾害报告中开展因果学习具有重要价值。
更新时间: 2026-11-19 15:28:46
领域: cs.CL,cs.AI
The Stability Gap in Continual Reinforcement Learning
Continual reinforcement learning (CRL) aims to enable agents to adapt to changing tasks while preserving previously acquired capabilities. Evaluation often relies on final aggregate metrics that can hide temporary performance degradation during adaptation. This work introduces a simple CRL benchmark that varies observation representations while preserving environment dynamics and rewards, supporting proof-of-concept demonstrations, inexpensive experimentation, and easily reproducible sanity checks. Using this benchmark, we demonstrate the stability gap in CRL: a substantial drop in prior-task performance after the introduction of new tasks, followed by partial or complete recovery. This pattern occurs despite the agent having complete access to past tasks.
Updated: 2026-11-19 15:26:41
标题: 持续强化学习中的稳定性鸿沟
摘要: 持续强化学习(CRL)旨在使智能体能够适应不断变化的任务,同时保留先前获得的能力。评估通常依赖最终的综合指标,而这些指标可能掩盖适应过程中暂时性的性能下降。本文提出了一种简单的持续强化学习基准,在保持环境动力学和奖励不变的同时改变观测表示,从而支持概念验证演示、低成本实验以及易于复现的合理性检查。借助该基准,我们展示了持续强化学习中的稳定性差距:引入新任务后,智能体在先前任务上的性能显著下降,随后出现部分或完全恢复。尽管智能体始终能够完全访问过去的任务,这种模式仍然会发生。
更新时间: 2026-11-19 15:26:41
领域: cs.LG,cs.AI
TwinLab-Bench: Evaluating AI Scientists in Agentic Twins of Real Labs
AI agents are increasingly expected to act as AI scientists, which requires three increasingly open abilities: carrying out a given computational workflow correctly, choosing the next measurements from a given design space, and designing their own experiments. Existing benchmarks mainly evaluate the first two abilities, in a terminal or in a closed loop that selects from predefined candidates. Evaluating the third ability requires reliably executing an experiment that an agent designs, with readings grounded in a real laboratory. We introduce TwinLab-Bench, which evaluates AI scientists on self-designed experiments in 52 tasks from laboratories in the physical sciences, the life sciences, and engineering. The benchmark supports more than 100 experimental action types, and the agent's report is scored by comparison with a hidden answer taken from real laboratory records. Each task has its own TwinLab agent, an agent that serves as the environment and executes the experiments that the tested agent designs, reading the raw materials of the laboratory and calling calculators that are built from its records. Compared with a language model that sees only the task description, the TwinLab agent almost eliminates readings that deviate from the real records and inconsistent answers to a repeated request, and closed-book probes control for answers recalled from memory. We find that these tasks remain hard for frontier models: the strongest, Claude Fable 5.2, averages a score of only 45.0, and we conduct an empirical study of where it fails.
Updated: 2026-11-19 15:25:34
标题: TwinLab-Bench:评估人工智能科学家在真实实验室智能体孪生体中的表现
摘要: 人们越来越期望人工智能代理能够充当人工智能科学家,这要求它们具备三种开放程度逐步提高的能力:正确执行给定的计算工作流程、从给定的设计空间中选择下一步测量,以及自行设计实验。现有基准主要评估前两种能力,通常是在终端中进行,或在闭环环境中从预先定义的候选方案中进行选择。评估第三种能力,则需要可靠地执行由代理自行设计的实验,并且实验读数应以真实实验室为依据。 我们推出了 TwinLab-Bench,用于评估人工智能科学家在自行设计实验方面的能力。该基准包含来自物理科学、生命科学和工程学实验室的 52 项任务,支持 100 多种实验操作类型;代理的报告将与取自真实实验室记录的隐藏答案进行比较评分。每项任务都有一个专属的 TwinLab 代理,它充当环境,执行受测代理所设计的实验,读取实验室的原始材料,并调用根据实验记录构建的计算器。 与只能看到任务描述的语言模型相比,TwinLab 代理几乎消除了偏离真实记录的读数以及对重复请求给出不一致答案的情况;此外,闭卷测试可用于排除代理凭记忆回忆答案的影响。我们发现,这些任务对于前沿模型而言仍然十分困难:表现最强的模型 Claude Fable 5.2 平均得分也只有 45.0 分。我们还对该模型失败的原因进行了实证研究。
更新时间: 2026-11-19 15:25:34
领域: cs.AI,cs.CL,cs.LG
PhysScope: Agentic Multimodal Physics Reasoning with Grounded Visual Memory
Vision-language models (VLMs) can correctly interpret physics diagrams yet apply constraints outside the states or conditions in which they hold, causing premise errors to propagate through subsequent calculations. We introduce PhysScope, an inference-time visual harness that supports self-correction of these scope mismatches without updating model weights. PhysScope enables the model to link physical scopes directly to its visual observations and explicitly constructs derived views to support reasoning. The harness imposes explicit constraints on state distinctions, conditions, and physical scopes during model reasoning, and checks agent-proposed revisions against sources and scopes. Accepted revisions invalidate registered dependents, thereby maintaining scope-aware working memory. On PhysAlign, PhysScope achieves higher solving scores than direct solving across all six evaluated VLMs. With Gemini-3.8-flash, it outperforms Canvas-CoT by 9.34 percentage points and substantially improves solving accuracy on the out-of-distribution (OOD) PhysUniBench benchmark. Ablation studies support explicit scope management and dependency maintenance as design principles for multimodal physics reasoning agents.
Updated: 2026-11-19 15:24:25
标题: PhysScope:具备基于视觉实证记忆的智能体式多模态物理推理
摘要: 视觉语言模型(VLM)能够正确解读物理图示,却可能将约束条件错误地应用于其成立范围之外的状态或条件,导致前提错误在后续计算中不断传播。我们提出 PhysScope,这是一种推理时视觉辅助框架,无需更新模型权重即可支持对这类适用范围错配进行自我纠正。PhysScope 使模型能够将物理适用范围直接与其视觉观测建立联系,并显式构建派生视图以支持推理。该框架在模型推理过程中对状态区分、条件和物理适用范围施加明确约束,并将智能体提出的修订与其来源及适用范围进行核验。被接受的修订会使已登记的依赖项失效,从而维护具备范围意识的工作记忆。在 PhysAlign 上,PhysScope 在评测的六个视觉语言模型中均取得了高于直接求解的得分。使用 Gemini-3.8-flash 时,其性能比 Canvas-CoT 高出 9.34 个百分点,并显著提升了分布外(OOD)PhysUniBench 基准上的求解准确率。消融实验支持将显式范围管理和依赖关系维护作为多模态物理推理智能体的设计原则。
更新时间: 2026-11-19 15:24:25
领域: cs.AI
FastRoverVLA: Fast Vision-Language-Action Execution for Off-Road Autonomous Driving
Off-road vision-language-action (VLA) models generate scene-conditioned plans, but frequent trajectory updates can repeatedly invoke expensive multimodal inference. Reusing a prediction reduces this demand while leaving its commands exposed to changes in vehicle motion. FastRoverVLA addresses this mismatch by decoupling visual plan generation from motion-conditioned execution. Its training-free interface maintains decoded plans between visual predictions. A speed-curvature action buffer is aligned with measured motion at each update, integrated into a local trajectory, and advanced by consuming the current action. The corrected remainder is written back to the buffer, preserving motion corrections across successive updates. A bounded refresh rule normalizes speed and curvature variations within a newly decoded plan and assigns a short or long reuse budget according to the resulting plan-roughness score. The interface requires neither backbone features nor an additional learned driving policy. Over a 3 s horizon, independent real-request evaluation achieves average displacement error (ADE) and final displacement error (FDE) of 0.328/0.596 m on ORAD-3D and 0.266/0.526 m on RELLIS-3D, reducing FDE by 18.0% and 36.7% at request rates of 6.0% and 4.8%, respectively. These runs retain lower errors across four backbones and both datasets and reduce Qwen3-VL request-processing cost by factors of 16.6 and 20.8 under serial replay, while mechanism and motion-only controls identify persistent state correction as the main source of the observed accuracy benefit. The source code and evaluation materials are publicly available at https://github.com/ADEPT-ORG/FastRoverVLA.
Updated: 2026-11-19 15:23:14
标题: FastRoverVLA:面向越野自动驾驶的快速视觉-语言-动作执行
摘要: 越野视觉-语言-动作(VLA)模型能够生成场景条件化规划,但频繁更新轨迹会反复调用昂贵的多模态推理。复用预测结果可以降低这一需求,但其指令也会受到车辆运动变化的影响。FastRoverVLA 通过将视觉规划生成与运动条件执行解耦,解决了这一不匹配问题。其无需训练的接口在视觉预测之间保留已解码的规划。速度—曲率动作缓冲区在每次更新时与测得的运动状态对齐,并整合为局部轨迹;随后通过执行当前动作使缓冲区向前推进。修正后的剩余轨迹被写回缓冲区,从而在连续更新之间保留运动修正效果。有界刷新规则对新解码规划中的速度和曲率变化进行归一化,并根据得到的规划粗糙度评分分配短期或长期复用预算。该接口既不需要骨干网络特征,也不需要额外训练的驾驶策略。 在 3 秒预测时域内,独立真实请求评估显示,FastRoverVLA 在 ORAD-3D 上取得 0.328/0.596 米的平均位移误差(ADE)和最终位移误差(FDE),在 RELLIS-3D 上取得 0.266/0.526 米的 ADE/FDE;在请求率分别为 6.0% 和 4.8% 时,FDE 分别降低了 18.0% 和 36.7%。在四种骨干网络和两个数据集上,这些实验均保持了更低的误差;在串行回放设置下,Qwen3-VL 的请求处理成本分别降低至原来的 1/16.6 和 1/20.8。同时,机制对照实验和纯运动控制实验表明,持续的状态修正是所观察到的精度提升的主要来源。源代码和评估材料已公开发布于 https://github.com/ADEPT-ORG/FastRoverVLA。
更新时间: 2026-11-19 15:23:14
领域: cs.RO,cs.AI
Variational analysis of determinantal varieties
Determinantal varieties---the sets of bounded-rank matrices or tensors---have attracted growing interest in low-rank optimization. The tangent cone to low-rank sets is widely studied and underpins a range of geometric methods. The second-order geometry, which encodes curvature information, is more intricate. In this work, we develop a unified framework to derive explicit formulas for both first- and second-order tangent sets to various low-rank sets, including low-rank matrices, tensors, symmetric matrices, and positive semidefinite matrices. The framework also accommodates the intersection of a low-rank set and another set satisfying some assumptions, thereby yielding a tangent intersection rule. Through the lens of tangent sets, we establish a necessary and sufficient condition under which a nonsmooth problem and its smooth parameterization share equivalent second-order stationary points. As applications, we exploit tangent sets to characterize optimality conditions for low-rank optimization and prove that verifying second-order optimality is NP-hard. Moreover, for low-rank semidefinite programs, the Burer--Monteiro parameterization maps fourth-order stationary points of the parameterized problem to second-order stationary points of the original problem. In a separate line of analysis, we investigate variational geometry of the graph of the normal cone to matrix varieties, deriving the explicit Bouligand tangent cone, Fréchet and Mordukhovich normal cones to the graph. These results are further applied to develop optimality conditions for low-rank bilevel programs.
Updated: 2026-11-19 15:16:20
标题: 行列式簇的变分分析
摘要: 行列式簇——即秩有界的矩阵或张量所构成的集合——在低秩优化中日益受到关注。低秩集合的切锥得到了广泛研究,并支撑着一系列几何方法。编码曲率信息的二阶几何则更加复杂。在本文中,我们建立了一个统一框架,用于推导各种低秩集合的一阶和二阶切集的显式公式,包括低秩矩阵、张量、对称矩阵和半正定矩阵。该框架还适用于低秩集合与满足一定假设的另一集合的交集,从而得到切交规则。通过切集的视角,我们建立了一个充要条件,用以刻画非光滑问题与其光滑参数化是否具有等价的二阶驻点。作为应用,我们利用切集刻画低秩优化的最优性条件,并证明验证二阶最优性是 NP-困难的。此外,对于低秩半定规划,Burer–Monteiro 参数化能够将参数化问题的四阶驻点映射为原问题的二阶驻点。在另一条分析主线上,我们研究了矩阵簇上法锥图的变分几何,推导出该图的显式 Bouligand 切锥、Fréchet 法锥和 Mordukhovich 法锥。进一步地,我们将这些结果应用于建立低秩双层规划的最优性条件。
更新时间: 2026-11-19 15:16:20
领域: math.OC,cs.AI,cs.LG
Evaluating LIM Trading Agents: A Critical Review of Backtesting Validity and Reporting Practices
Large language models (LLMs) are increasingly used in investment research, and many studies report promising historical returns. However, such results are only credible if researchers can demonstrate that the model used only information available at the time, account for how strategies and configurations were selected, and explain how reported returns were generated. We identify six common threats to validity in LLM investment evaluations and apply them to 18 published studies. Across 108 assessments, we find substantial gaps in reporting. No paper fully addresses information timing, model-memory exposure, universe selection, trading costs, or configuration-selection bias. Only four studies provide minimum evidence that results hold across multiple market periods. Our analysis reveals that commonly used safeguards often address different problems than researchers assume. For example, using dated inputs does not guarantee that a pretrained model lacked knowledge of future events, and repeated experimental runs do not correct for strategy-selection bias. We therefore propose an evaluation protocol for future LLM investment research. Rather than judging whether LLMs can generate profits, our study examines whether existing evidence is sufficient to support such claims. We conclude that current reporting practices are generally insufficient for that purpose.
Updated: 2026-11-19 15:10:15
标题: 评估LIM交易代理:对回测有效性与报告规范的批判性审视
摘要: 大型语言模型(LLM)正日益被用于投资研究,许多研究也报告了颇具前景的历史收益。然而,只有当研究人员能够证明模型仅使用了当时可获得的信息,说明策略和配置是如何被选择的,并解释所报告收益是如何产生的,这类结果才具有可信度。我们确定了评估 LLM 投资能力时常见的六类有效性威胁,并将其应用于 18 项已发表的研究。在 108 项评估中,我们发现报告方面存在明显缺口。没有一篇论文完整处理信息时点、模型记忆暴露、投资范围选择、交易成本或配置选择偏差问题。只有四项研究提供了最低限度的证据,表明其结果在多个市场时期内仍然成立。 我们的分析表明,常用的防范措施往往解决的是与研究人员所设想不同的问题。例如,使用带日期的输入,并不能保证预训练模型没有掌握未来事件的信息;重复进行实验也无法纠正策略选择偏差。因此,我们为未来的 LLM 投资研究提出了一套评估方案。我们的研究并不判断 LLM 是否能够创造利润,而是考察现有证据是否足以支持此类主张。我们 conclue,目前的报告实践总体上不足以达到这一目的。
更新时间: 2026-11-19 15:10:15
领域: cs.CR
Mixing Regularization for Average-Reward $Q$-Learning and $Q$-Planning
The average-reward setting for reinforcement learning is challenging because, without discounting, the span-contraction of the Bellman operator depends on the mixing properties of the underlying Markov dynamics. Whereas existing work typically assumes contraction, for instance through environment mixing, we study regularization toward a given reward-agnostic, $m$-step mixing policy to control the mixing properties of the learned policy. Our central mixing lemma quantifies how the reference policy's mixing properties transfer to the resulting learned policies. In particular, a single regularizer-dependent quantity simultaneously controls the contraction of the regularized Bellman operator and the exploration of the resulting policies. A second regularizer-dependent quantity controls the bias introduced by regularization, revealing a trade-off between convergence speed and approximation accuracy. Building on this result, we establish finite-time guarantees for regularized $Q$-iteration, synchronous and single-trajectory $Q$-learning, and $Q$-planning. Under one-step mixing, our bounds for approximating the regularized fixed point match the classical model-query bound for relative value iteration and, up to logarithmic factors, an existing sample-complexity bound for synchronous $Q$-learning. We also establish finite-time guarantees under multi-step mixing. For $Q$-planning, we characterize how the planning horizon trades off boundary bias against sample complexity. Finally, we present numerical studies validating the analysis: (i) knowledge of a strong mixing policy improves convergence and exploration, with larger benefits under more severe bottlenecks; and (ii) the observed rankings of $α$-divergence regularizers by bias and convergence speed are consistent with our theoretical analysis.
Updated: 2026-11-19 15:09:50
标题: 平均奖励 Q 学习与 Q 规划的混合正则化
摘要: 强化学习中的平均回报设定颇具挑战性,因为在不使用折扣的情况下,贝尔曼算子的区间收缩性取决于底层马尔可夫动力学的混合性质。现有研究通常假设算子具有收缩性,例如假设环境具有混合性;与此不同,我们研究朝向一个给定的、与奖励无关的 \(m\) 步混合策略进行正则化,以控制所学习策略的混合性质。我们的核心混合引理量化了参考策略的混合性质如何传递给最终学习得到的策略。特别地,一个依赖于正则化器的量同时控制正则化贝尔曼算子的收缩性以及最终策略的探索能力。另一个依赖于正则化器的量控制正则化所引入的偏差,从而揭示了收敛速度与逼近精度之间的权衡。 基于这一结果,我们为正则化 \(Q\) 迭代、同步 \(Q\) 学习、单轨迹 \(Q\) 学习以及 \(Q\) 规划建立了有限时间保证。在一步混合条件下,我们对正则化不动点的逼近界与相对价值迭代的经典模型查询界相匹配,并且除对数因子外,与已有的同步 \(Q\) 学习样本复杂度界相匹配。我们还在多步混合条件下建立了有限时间保证。对于 \(Q\) 规划,我们刻画了规划时域如何在边界偏差与样本复杂度之间进行权衡。 最后,我们通过数值实验验证了理论分析:(i)掌握一个强混合策略能够改善收敛性与探索能力,并且在瓶颈越严重时收益越大;(ii)不同 \(\alpha\)-散度正则化器在偏差和收敛速度方面的实测排序与我们的理论分析一致。
更新时间: 2026-11-19 15:09:50
领域: cs.LG,cs.AI,math.OC,stat.ML
Physics-Informed Feature Representations and Pretrained Tabular Foundation Models for Generalizable Melt Pool Geometry Prediction
Developing generalizable, data-efficient machine learning (ML) models for advanced manufacturing remains challenging because experimental datasets are limited and process-property relationships vary across materials and operating conditions. In laser powder bed fusion (LPBF), melt pool width, depth, and melting mode (conduction, transition, or keyhole) govern process stability and defect formation. Conventional ML models typically use dimensional process parameters, which represent laser-material interactions only implicitly and may limit cross-material transfer. This study evaluates whether two physics-informed dimensionless features, normalized enthalpy and Peclet number, combining laser processing conditions with material thermophysical properties, improve melt pool prediction over raw process parameters. We systematically benchmark seven models: four classical ML methods (Gaussian process, support vector machine, random forest, and XGBoost) and three pretrained tabular foundation models (TabPFN, TabDPT, and TabICLv2). Experiments span 316L stainless steel, IN625, IN718, and combined-material datasets, covering regression of melt pool width and depth and classification of melting modes. Dimensionless features yield comparable or superior predictive performance in most settings, with the largest gains in cross-material depth prediction (R^2 = 0.96). Tabular foundation models generally achieve stronger classification performance than classical baselines, particularly for multi-material datasets. These findings indicate that combining physically meaningful dimensionless representations with pretrained tabular models can improve data-efficient melt pool modeling and support more transferable process-window identification in LPBF.
Updated: 2026-11-19 15:09:41
标题: 面向可泛化熔池几何形状预测的物理信息特征表示与预训练表格基础模型
摘要: 开发具有良好泛化能力且数据高效的机器学习(ML)模型以用于先进制造仍然面临挑战,因为实验数据集有限,并且工艺—性能关系会随材料和操作条件的变化而改变。在激光粉末床熔融(LPBF)中,熔池宽度、深度以及熔化模式(传导、过渡或匙孔)决定了工艺稳定性和缺陷形成。传统机器学习模型通常采用有量纲的工艺参数,这些参数只能隐式表征激光—材料相互作用,并可能限制跨材料迁移能力。本研究评估了两种融合激光加工条件与材料热物性、具有物理信息的无量纲特征——归一化焓和佩克莱数——能否较原始工艺参数更好地提升熔池预测性能。我们系统地对七种模型进行了基准测试:四种经典机器学习方法(高斯过程、支持向量机、随机森林和 XGBoost)以及三种预训练表格基础模型(TabPFN、TabDPT 和 TabICLv2)。实验涵盖 316L 不锈钢、IN625、IN718 及其组合材料数据集,包括熔池宽度和深度回归以及熔化模式分类。无量纲特征在大多数场景下取得了相当或更优的预测性能,其中跨材料深度预测的提升最为显著(R² = 0.96)。总体而言,表格基础模型的分类性能优于经典基线模型,尤其是在多材料数据集上。这些研究结果表明,将具有物理意义的无量纲表征与预训练表格模型相结合,可以提升数据高效的熔池建模能力,并支持在 LPBF 中实现更具迁移性的工艺窗口识别。
更新时间: 2026-11-19 15:09:41
领域: cs.AI,cs.LG
Why Trust Your Agent? Empirical Security Gains from TRiSM-Guided Agentic Workflows in Healthcare
Agent-based AI has enabled the automation of tasks by exposing application tools and resources to large language models (LLMs). However, to improve scope and accuracy, agents are often given access rights that exceed those of ordinary users, introducing significant security risks and potential regulatory breaches. This paper applies the AI Trust, Risk, and Security Management (TRiSM) framework to a medical report-generation application to demonstrate how an insecure baseline workflow can be transformed into a security-conscious agentic workflow. Both designs were evaluated with five LLMs (Claude Haiku 4.5, GPT-4.1-nano, GPT-4.1-mini, GPT-5.4-mini and Gemini 2.5 Flash) across 800 report generations and 500 attack trials covering RAG poisoning, data-field injection and client-side network injection. The redesign reduced attack success from 31% to 10% for RAG poisoning and from 42% to 25% for data-field injection (McNemar p < 0.001 for both), removed network injection by construction, and raised report accuracy from 72.5% to 86.5%. In an exploratory post-hoc grouping by attack goal, success against attacks aimed outside the report task, such as data disclosure and tool abuse, fell from 21.7% to 2.5% and no patient record was disclosed under the redesign. Attacks altering the reported Covid-19 diagnosis remained effective, accounting for 32 of the 35 successful attacks against the redesign. Least-privilege architecture limits what an injection can reach, but not whether a model follows injected content within its task, so clinical outputs need verification independent of the LLM. No model resisted all three attack vectors, so model selection cannot substitute for secure workflow design.
Updated: 2026-11-19 15:07:25
标题: 为什么要信任你的智能体?TRiSM 指导的医疗保健智能体工作流带来的实证安全性提升
摘要: 基于智能体的人工智能通过向大语言模型(LLM)开放应用工具和资源,实现了任务自动化。然而,为了扩大任务范围并提高准确性,智能体通常会被授予超出普通用户权限的访问权,从而引入重大的安全风险和潜在的监管违规问题。本文将人工智能信任、风险与安全管理(TRiSM)框架应用于一款医疗报告生成应用,展示如何将不安全的基线工作流转变为注重安全性的智能体工作流。研究使用五种大语言模型(Claude Haiku 4.5、GPT-4.1-nano、GPT-4.1-mini、GPT-5.4-mini 和 Gemini 2.5 Flash),在生成800份报告和进行500次攻击测试的条件下,对两种设计进行了评估;攻击涵盖检索增强生成(RAG)投毒、数据字段注入和客户端网络注入。重新设计后,RAG投毒的攻击成功率从31%降至10%,数据字段注入的攻击成功率从42%降至25%(两者的McNemar检验均为 p < 0.001),通过架构设计彻底消除了网络注入,并将报告准确率从72.5%提高至86.5%。在探索性事后分析中,研究按攻击目标对攻击进行分组:针对报告任务之外目标的攻击(如数据泄露和工具滥用)成功率从21.7%降至2.5%,且在重新设计的工作流下没有泄露任何患者记录。篡改报告中新冠病毒疾病诊断结果的攻击仍然有效,占针对重新设计方案的35次成功攻击中的32次。最小权限架构限制了注入内容能够触及的范围,但无法限制模型是否会在其任务范围内遵循注入内容,因此临床输出需要由独立于大语言模型的机制进行验证。没有任何模型能够抵御全部三种攻击向量,因此模型选择不能替代安全的工作流设计。
更新时间: 2026-11-19 15:07:25
领域: cs.CR,cs.AI
The Real Cost of Context: Predicting Compute Time and Energy Consumption in LLM Prefill and Decode Phases
The integration of Large Language Models (LLMs) into agentic architectures has substantially increased token consumption, raising concerns about their energy footprint. Yet, estimating the energy consumption of proprietary API-based models remains challenging, and existing approaches focus primarily on generated output tokens while overlooking the impact of the large input contexts characteristic of agentic workflows. To address this gap, we systematically profile compute time and energy consumption across a wide range of prefill (input) and decode (output) token lengths. Using generalized linear models, we show that decode compute time and energy scale linearly with output length, whereas prefill compute time and energy exhibit both linear and quadratic scaling with input length. These findings demonstrate that input context becomes a relevant factor for large-context workloads. Furthermore, we show that compute time serves as a reliable proxy for energy consumption when direct energy measurements are unavailable. Our mapping framework enables precise energy estimation and supports more sustainable deployment decisions for agentic AI.
Updated: 2026-11-19 15:07:18
标题: 上下文的真实成本:预测大语言模型预填充与解码阶段的计算时间和能耗
摘要: 将大型语言模型(LLM)集成到智能体架构中显著增加了令牌消耗,引发了人们对其能源足迹的担忧。然而,估算基于专有 API 的模型的能耗仍然具有挑战性,现有方法主要关注生成的输出令牌,却忽视了智能体工作流中大规模输入上下文所带来的影响。为弥补这一空白,我们针对广泛的预填充(输入)和解码(输出)令牌长度,系统地分析了计算时间与能耗。利用广义线性模型,我们表明,解码计算时间和能耗随输出长度呈线性增长,而预填充计算时间和能耗则随输入长度呈现线性和二次增长。这些发现表明,对于大上下文工作负载,输入上下文已成为一个重要因素。此外,我们还表明,在无法直接测量能耗时,计算时间可以作为能耗的可靠代理指标。我们的映射框架能够实现精确的能耗估算,并为智能体人工智能的可持续部署决策提供支持。
更新时间: 2026-11-19 15:07:18
领域: cs.AI
Time Series Structure Learning with Local Causal Parent Discovery
Learning and inference on time series can pose significant statistical challenges, including autocorrelated observations, distribution shift over time, and the curse of dimensionality. These challenges complicate the practical application of causal discovery algorithms, which already suffer from high computational and sample complexity in the general case. To mitigate these issues, this work introduces Iterative Temporal Parent Discovery (ITPD): a sound and complete constraint-based procedure for causal structure learning on multivariate time series with causal nonstationarity. ITPD takes a local-to-global learning approach that discovers the global graph by sequentially discovering the parent set for each variable. ITPD exploits temporal structural priors, graph partitioning, and the local Markov condition to swap higher-order conditional independence tests for lower-order alternatives. With an exact oracle, ITPD performed the least number of tests and used the smallest average conditioning set sizes relative to baselines. In benchmarking simulations, ITPD sat on the Pareto frontier with respect to F1 and wall-clock time and was faster than baselines on large graphs ($\geq$ 1000 nodes). For graphs with 2000 nodes, ITPD ran $2.3\times$, $9.1\times$, and $40.9\times$ faster than iterative IAMB, DF-PC, and PCMCI, respectively.
Updated: 2026-11-19 15:06:06
标题: 通过局部因果父节点发现进行时间序列结构学习
摘要: 时间序列上的学习与推断可能面临重大的统计挑战,包括观测值的自相关、随时间发生的分布偏移以及维度灾难。这些挑战使因果发现算法的实际应用更加复杂,而因果发现算法在一般情况下本已具有较高的计算复杂度和样本复杂度。为缓解这些问题,本文提出了迭代式时间父节点发现(Iterative Temporal Parent Discovery,ITPD):一种用于具有因果非平稳性的多元时间序列因果结构学习的可靠且完备的基于约束的过程。ITPD采用由局部到整体的学习方法,通过依次发现每个变量的父节点集来确定全局图。ITPD利用时间结构先验、图划分和局部马尔可夫条件,将高阶条件独立性检验替换为低阶替代方案。在使用精确预言机时,相较于基线方法,ITPD执行的检验次数最少,且平均条件集规模最小。在基准模拟中,就F1值和实际运行时间而言,ITPD位于帕累托前沿;在大规模图(节点数≥1000)上,其速度快于基线方法。对于包含2000个节点的图,ITPD的运行速度分别比迭代式IAMB、DF-PC和PCMCI快2.3倍、9.1倍和40.9倍。
更新时间: 2026-11-19 15:06:06
领域: cs.LG,stat.ML
Attention Head Specialization: Phase Transitions in Sample Complexity
Attention heads specialize into distinct functions during training, often emerging in stages together with sharp changes in model behavior. While this phenomenon has mostly been studied as a function of training time, we ask how head specialization depends on the amount of available training data. Empirically, we find that heads specialized to syntactic relations in BERT emerge as the dataset size increases. We then study this phenomenon in a solvable high-dimensional model of multi-head attention and establish that, in this model, head specialization is a genuine phase transition in sample complexity, corresponding to a non-analyticity in the test error and other observables. Depending on data structure and regularization, specialization can follow uninformative head differentiation or occur through a cascade of phase transitions that progressively recover weaker latent features, providing a statistical form of simplicity bias. Finally, we relate these statistical transitions to the stagewise emergence of specialized heads during online learning, disentangling statistical from dynamical origins of head specialization.
Updated: 2026-11-19 15:02:51
标题: 注意力头专化:样本复杂度中的相变
摘要: 注意力头在训练过程中会专化为各具不同功能的模块,这一过程通常分阶段出现,并伴随着模型行为的显著变化。尽管以往对这一现象的研究主要将其视为训练时间的函数,我们则探讨注意力头的专化如何依赖于可用训练数据的数量。通过实证研究,我们发现,随着数据集规模增大,BERT 中专用于句法关系的注意力头会逐渐出现。随后,我们在一个可解析的高维多头注意力模型中研究这一现象,并证明在该模型中,注意力头专化确实是样本复杂度中的一种相变,对应于测试误差及其他可观测量的非解析性。根据数据结构和正则化方式的不同,专化可能表现为无信息的注意力头分化,也可能通过一系列相变发生,逐步恢复较弱的潜在特征,从而呈现出一种统计意义上的简洁性偏置。最后,我们将这些统计相变与在线学习过程中专化注意力头的分阶段出现联系起来,从而区分注意力头专化的统计起源与动力学起源。
更新时间: 2026-11-19 15:02:51
领域: cs.LG,cond-mat.dis-nn,stat.ML
Sightline: Calibrated Data-Flow Summaries for LLM-Integrated Applications
Programs increasingly call large language models (LLMs), filling prompt placeholders with program values and consuming the output. Such a call crosses the boundary between natural language and programming language (NL/PL). To follow data across it, an analysis needs a data-flow summary of which placeholders the output uses, but no code describes what the model does. Analyses of these LLM-integrated applications therefore taint every output with every input, creating spurious flows, or ask a second model to label each call, which is costly. We prove, and mechanize in Lean 4, that a placeholder flows to the output of a transformer, to first order, only through the attention that reads it (no reading, no flow), and that a faint reading or sensitivity cannot certify that a placeholder does not flow. Unlike reading, the log-probability gradients and Fisher signals of existing methods vanish on confident outputs, and single-span removal fails on duplicated content. Our tool, Sightline, reads a recorded call in one forward pass, learns from labels which reads are uses, and calibrates the pruning to miss at most a chosen fraction $α$ of true flows, on average over call sites, when deployment is exchangeable with calibration. On 2,103 unseen repository families and four models, Sightline is the most accurate summary against the seven closest methods and a hidden-state probe. Calibrated at $α$ = 1%, it misses about 1% of true flows and prunes 43.9-65.6% of spurious flows, 1.6 to 2.6 times as many as the best baseline, and still 43.8-60.1% when calibrated on another collection. Through an open surrogate, it reads models treated as closed about as accurately as they read themselves, without their labels. In the information-flow control of an LLM agent, it removes about half of the labels from inputs that do not flow.
Updated: 2026-11-19 15:00:25
标题: Sightline:面向集成大语言模型应用的校准数据流摘要
摘要: 程序越来越多地调用大型语言模型(LLM),将程序值填入提示词占位符,并使用模型输出。此类调用跨越了自然语言与编程语言(NL/PL)之间的边界。为了追踪数据流,分析需要总结输出使用了哪些占位符的数据流信息,但没有任何代码描述模型的行为。因此,对这些集成了 LLM 的应用进行分析时,要么将每个输入都视为会污染每个输出,从而产生虚假的数据流;要么请求第二个模型为每次调用进行标注,但这样成本很高。 我们证明了这一点,并在 Lean 4 中将其形式化:对于一个变换器而言,一阶近似下,占位符只有通过读取该占位符的注意力机制,才会流向输出(不读取,就不会产生数据流);而微弱的读取或敏感性则无法证明某个占位符不会流向输出。与读取行为不同,现有方法中的对数概率梯度和 Fisher 信号在模型对输出充满信心时会消失,而删除单个文本片段的方法在内容重复时会失效。 我们的工具 Sightline 只需一次前向传播即可读取一条已记录的调用,从标注中学习哪些读取属于实际使用,并对剪枝过程进行校准:当部署环境与校准环境可交换时,以调用点为平均对象,它最多漏掉所选比例 α 的真实数据流。在 2,103 个未见过的代码仓库系列和四个模型上,与七种最接近的方法及一种隐藏状态探针相比,Sightline 给出了最准确的总结。将 α 校准为 1% 后,它漏掉约 1% 的真实数据流,并剪除 43.9%—65.6% 的虚假数据流,是最佳基线方法的 1.6 至 2.6 倍;即使在另一组数据集上进行校准,仍能剪除 43.8%—60.1% 的虚假数据流。借助一个开放的替代模型,它无需获得目标模型的标注,就能以与目标模型自我读取大致相当的准确度,读取那些被视为闭源的模型。在一个 LLM 智能体的信息流控制系统中,它移除了输入中约一半原本不会流出的标注。
更新时间: 2026-11-19 15:00:25
领域: cs.PL,cs.AI
Learning Multinomial Logits in $O(n \log n)$ time
A Multinomial Logit (MNL) model is composed of a finite universe of items $[n]=\{1,\dots,n\}$, each assigned a positive weight. A query specifies an admissible subset---called a slate---and the model chooses one item from that slate with probability proportional to its weight. This query model is also known as the Plackett--Luce model or conditional sampling oracle in the literature. Although MNLs have been studied extensively, a basic computational question remains open: given query access to slates, how efficiently can we learn weights so that, for every slate, the induced choice distribution is within total variation distance $\varepsilon$ of the ground truth? This question is central to MNL learning and has direct implications for modern recommender system interfaces. We provide both adaptive and non-adaptive algorithms for this task. Our first adaptive algorithm makes $O(\frac{n\log n}{\varepsilon^2})$ queries and learns every choice distribution in total variation distance $\varepsilon$. We also provide a second adaptive algorithm that with $O(\frac{n \log n}{\varepsilon^3})$ queries provides a stronger guarantee: each choice distribution is approximated to a multiplicative $1\pm\varepsilon$ error (except for subsets of mass smaller than $\varepsilon$). We complement these algorithms with lower bounds of $Ω(\frac{n\log n}{\varepsilon^2})$ for total variation distance and $Ω(\frac{n \log n}{\varepsilon^3})$ for the multiplicative error guarantee, showing the optimality of our adaptive algorithms. Our non-adaptive algorithm makes $O\left(\frac{n^{2}}{\varepsilon^{3}}\log n \log\frac{n}{\varepsilon}\right)$ queries to obtain guarantees under the multiplicative error notion. We complement this result with an $Ω(\frac{n^2 \log n}{\varepsilon^2})$ lower bound for any non-adaptive algorithm, showing that our algorithm is almost tight in $n$ (within a $\log n$ factor).
Updated: 2026-11-19 14:59:54
标题: 在 $O(n \log n)$ 时间内学习多项式对数模型
摘要: 多项式逻辑斯蒂(MNL)模型由一个有限的项目全集 $[n]=\{1,\dots,n\}$ 构成,其中每个项目都被赋予一个正权重。一次查询指定一个允许的子集——称为一个候选集合(slate),模型以与项目权重成比例的概率从该候选集合中选择一个项目。在相关文献中,这种查询模型也被称为 Plackett–Luce 模型或条件采样预言机。尽管 MNL 模型已得到广泛研究,但一个基本的计算问题仍悬而未决:给定对候选集合的查询访问,如何高效地学习这些权重,使得对于每个候选集合,所诱导的选择分布与真实分布之间的全变差距离不超过 $\varepsilon$?这一问题是 MNL 学习的核心,并且直接关系到现代推荐系统的界面设计。 我们为这一任务提供了自适应和非自适应算法。我们的第一个自适应算法使用 $O(\frac{n\log n}{\varepsilon^2})$ 次查询,并能够使每个候选集合上的选择分布达到全变差距离 $\varepsilon$ 的精度。我们还提供了第二个自适应算法,使用 $O(\frac{n \log n}{\varepsilon^3})$ 次查询,并给出更强的保证:每个选择分布都能以乘法误差 $1\pm\varepsilon$ 得到近似(质量小于 $\varepsilon$ 的子集除外)。此外,我们分别证明了全变差距离下的 $Ω(\frac{n\log n}{\varepsilon^2})$ 下界,以及乘法误差保证下的 $Ω(\frac{n \log n}{\varepsilon^3})$ 下界,从而表明我们的自适应算法是最优的。 我们的非自适应算法使用 $O\left(\frac{n^{2}}{\varepsilon^{3}}\log n \log\frac{n}{\varepsilon}\right)$ 次查询,并在乘法误差意义下获得相应保证。我们还证明了任意非自适应算法都需要至少 $Ω(\frac{n^2 \log n}{\varepsilon^2})$ 次查询,这表明我们的算法关于 $n$ 几乎是紧的(仅相差一个 $\log n$ 因子)。
更新时间: 2026-11-19 14:59:54
领域: cs.DS,cs.LG,math.ST,stat.ML
How many sorted projections determine any n points in k dimensions?
Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$. A multiset $X$ of $n$ points of $\mathbb{R}^k$ projects to the $m$ multisets of numbers $\{\{x\cdot d_j : x\in X\}\}$, or equivalently to the $m$ sorted lists of these numbers. How many directions are needed for these projections to determine every multiset of $n$ points? Two simple bounds are known in every dimension: more than $(k-1)\log_2 n$ directions are always needed, and $(k-1)n+1$ directions in general position always suffice. In the plane much more is known: Matousek, Privetivy and Skovron showed that almost every choice of $O(\log n \log\log n)$ directions suffices. Whether anything similar holds in higher dimensions was left open by Dym, Wellershoff, Tsoukanis, Levy and Balan. We observe that two lemmas of Hair and Sahai, proved for list recovery of random linear codes, answer that question, and by tightening their argument we show that in every dimension almost every choice of $(4k-2)\ln(2n)\ln(k\log_2 2n)+k+1$ directions suffices. For $k\le 10$ this beats the linear bound once $n$ is larger than about 100: for example, 144 directions suffice for multisets of 1000 points in the plane, and an exact computation lowers this to 133. Letting some of the random blocks in their argument fail removes a factor $\log k$: almost every choice of $O(k\log n\log\log n)$ directions suffices, uniformly in $k$ and $n$. We also show that $2k-1$ directions never determine three points, so that the logarithmic lower bound is not tight; that every $m$ directions in the plane fail on some pair of multisets of size $O(1.65^m)$, improving the bound $O(1.80^m)$ of Matousek, Privetivy and Skovron; and that for each $k$, $m$ and $n$, either almost every choice of $m$ directions works or almost none does.
Updated: 2026-11-19 14:56:56
标题: 确定 \(k\) 维空间中任意 \(n\) 个点需要多少个排序投影?
摘要: 设 \(d_1,\dots,d_m\) 是 \(\mathbb{R}^k\) 中的方向,其中 \(k\ge 2\)。\(\mathbb{R}^k\) 中含有 \(n\) 个点的多重集 \(X\) 在这些方向上的投影为 \(m\) 个数的多重集 \(\{\{x\cdot d_j:x\in X\}\}\),等价地,也可表示为这些数所组成的 \(m\) 个有序列表。需要多少个方向,才能使这些投影确定任意一个含有 \(n\) 个点的多重集? 在每个维数中,已知有两个简单的界:方向数总是必须多于 \((k-1)\log_2 n\),而处于一般位置的 \((k-1)n+1\) 个方向总是足够的。在平面中,人们已知的结果要丰富得多:Matousek、Privetivy 和 Skovron 证明,几乎任意选择 \(O(\log n\log\log n)\) 个方向都足够。Dym、Wellershoff、Tsoukanis、Levy 和 Balan 曾提出,在更高维度中是否也存在类似结论。我们注意到,Hair 和 Sahai 为随机线性码的列表恢复所证明的两个引理回答了这一问题;通过改进他们的论证,我们证明在任意维数中,几乎任意选择 \[ (4k-2)\ln(2n)\ln(k\log_2 2n)+k+1 \] 个方向都足够。对于 \(k\le 10\),当 \(n\) 大于约 100 时,这一结果优于线性界;例如,144 个方向足以确定平面中含有 1000 个点的多重集,而精确计算可将这一数目降至 133。若允许其论证中的某些随机块失效,则可以去掉一个 \(\log k\) 因子:几乎任意选择 \(O(k\log n\log\log n)\) 个方向都足够,并且这一结论对 \(k\) 和 \(n\) 是一致的。 我们还证明,任意 \(2k-1\) 个方向都无法确定三个点,因此上述对数下界并不紧;平面中的任意 \(m\) 个方向都会在某一对大小为 \(O(1.65^m)\) 的多重集上失效,从而改进了 Matousek、Privetivy 和 Skovron 给出的 \(O(1.80^m)\) 界;此外,对于每个 \(k\)、\(m\) 和 \(n\),要么几乎任意选择 \(m\) 个方向都有效,要么几乎任意选择都无效。
更新时间: 2026-11-19 14:56:56
领域: math.CO,cs.DM,cs.IT,cs.LG
OpenTME: An Open Dataset of AI-powered H&E Tumor Microenvironment Profiles from TCGA
The tumor microenvironment (TME) plays a central role in cancer progression, treatment response, and patient outcomes, yet large-scale, consistent, and quantitative TME characterization from routine hematoxylin and eosin (H&E)-stained histopathology remains scarce. We introduce OpenTME, an open-access dataset of pre-computed TME profiles derived from 5,268 H&E-stained whole-slide images across ten cancer types (bladder, breast, colorectal, head and neck, liver, lung, ovarian, pancreatic, prostate, and stomach cancer) from The Cancer Genome Atlas (TCGA). All outputs were generated using HETA (H&E Tissue Analysis), an AI-powered application built on the Atlas family of pathology foundation models, which performs tissue quality control, tissue segmentation, cell detection and classification, tumor zone and tertiary lymphoid structure (TLS) detection, and spatial neighborhood analysis, yielding over 20,000 quantitative readouts per slide at cell-level resolution, including curated features such as tumor-infiltrating lymphocytes, tumor mitotic index, or mature TLS counts. OpenTME is available for non-commercial academic research on Hugging Face. We will continue to expand OpenTME over time and anticipate it will serve as a resource for biomarker discovery, spatial biology research, and the development of computational methods for TME analysis.
Updated: 2026-11-19 14:52:15
标题: OpenTME:来自TCGA的AI驱动H&E肿瘤微环境图谱开放数据集
摘要: 肿瘤微环境(TME)在癌症进展、治疗反应和患者结局中发挥着核心作用。然而,基于常规苏木精-伊红(H&E)染色组织病理学切片,对TME进行大规模、一致且定量的表征仍十分有限。我们介绍了OpenTME,这是一个开放获取的数据集,收录了来自癌症基因组图谱(TCGA)的10种癌症类型(膀胱癌、乳腺癌、结直肠癌、头颈部癌、肝癌、肺癌、卵巢癌、胰腺癌、前列腺癌和胃癌)共5,268张H&E染色全切片图像所生成的预计算TME特征谱。所有输出均由HETA(H&E组织分析)生成。HETA是一款基于Atlas系列病理学基础模型构建的人工智能应用,可执行组织质量控制、组织分割、细胞检测与分类、肿瘤区域和三级淋巴结构(TLS)检测,以及空间邻域分析;在细胞层面分辨率下,每张切片可生成超过20,000项定量读数,其中包括肿瘤浸润淋巴细胞、肿瘤有丝分裂指数和成熟TLS数量等精选特征。OpenTME已在Hugging Face上开放,供非商业学术研究使用。我们将持续扩展OpenTME,并预计其将成为生物标志物发现、空间生物学研究以及TME分析计算方法开发的重要资源。
更新时间: 2026-11-19 14:52:15
领域: cs.CV,cs.AI,cs.LG,q-bio.QM
REACT: Representational Early Analysis and Control of Chain-of-Thought Trajectories
Chain-of-thought (CoT) generation offers an opportunity to intervene before a reasoning model completes its answer. How does the safety effect of a single activation edit vary across early reasoning states, and what factors govern that variation? We study this question with REACT, a conditional activation intervention that learns a safety direction from paired safe and unsafe trajectories and applies it once to an early CoT hidden state. The model weights remain frozen, and all subsequent tokens are generated without further edits. To study timing, we train directions separately at each of the first five CoT positions and evaluate ungated edits with full post-edit regeneration. Across three DeepSeek-R1 distilled models, site-specific edits concentrate safety gains in the opening CoT tokens. Norm-matched controls on DeepSeek-R1-Distill-Llama-8B (8B) disentangle two factors behind this curve: holding an effective direction and edit budget fixed still yields much larger early ($t_1$-$t_5$) than later ($t_6$-$t_8$) gains, whereas the near-zero site-specific $t_3$ gain reflects higher optimisation variance despite rising risk-probe AUROC. Forced prefixes shift the high-gain region with the opening context, and a four-arm intervention shows that ~98% of the net gain at $t_2$ propagates through the changed next token. On the same 8B model, REACT raises the rate of fully safe CoT-answer outputs on StrongREJECT-273 from 29.06% to 82.05%, while keeping benign refusal and usefulness near baseline. An anonymized implementation is available at https://anonymous.4open.science/r/REACT_official2-333B.
Updated: 2026-11-19 14:49:43
标题: REACT:思维链轨迹的表征早期分析与控制
摘要: 思维链(CoT)生成提供了在推理模型完成回答之前进行干预的机会。单次激活编辑的安全效应在早期不同推理状态之间如何变化?哪些因素决定了这种变化?我们使用 REACT 研究这一问题:REACT 是一种条件激活干预方法,它从成对的安全与不安全轨迹中学习安全方向,并将该方向单次应用于早期 CoT 隐状态。模型权重保持冻结,后续所有词元均在不进行进一步编辑的情况下生成。为研究时机因素,我们分别在前五个 CoT 位置训练方向,并在编辑后完整重新生成的条件下评估不加门控的编辑效果。在三个 DeepSeek-R1 蒸馏模型上,针对特定位置的编辑将安全性提升集中在 CoT 开头的词元中。针对 DeepSeek-R1-Distill-Llama-8B(8B)模型进行的范数匹配控制实验区分了造成这一曲线的两个因素:即使保持有效方向和编辑预算不变,早期位置($t_1$–$t_5$)带来的提升仍远大于后期位置($t_6$–$t_8$);而针对特定位置的 $t_3$ 位置几乎为零的提升,则反映了更高的优化方差,尽管风险探针 AUROC 持续上升。强制前缀会使高增益区域随开头上下文发生偏移;一项包含四个干预组的实验表明,$t_2$ 位置约 98% 的净增益是通过改变后的下一个词元传递的。在同一 8B 模型上,REACT 将 StrongREJECT-273 上完全安全的 CoT—答案输出比例从 29.06% 提升至 82.05%,同时使对良性请求的拒答率和有用性基本维持在基线水平。匿名实现见:https://anonymous.4open.science/r/REACT_official2-333B】【。
更新时间: 2026-11-19 14:49:43
领域: cs.LG,cs.AI,cs.CL
Learn, Freeze, and Transfer an Activation Function Across Architectures
Transfer learning typically reuses knowledge acquired by a source network through its learned weights. We investigate whether a learned activation function can also be transferred and remain useful in networks trained from scratch. We study this complementary form of transfer through a learn-freeze-transfer protocol, in which the activation is optimized jointly with a source network in a single training run, and is then frozen and reused in target networks trained from scratch. A pointwise activation with globally shared parameters is independent of layer dimensions and can therefore be incorporated into networks of different architectures trained from scratch. We instantiate this protocol with FAct, a five-parameter activation represented by a two-harmonic truncated Fourier series, initialized from a Fourier approximation of GELU and learned in a Vision Transformer (ViT) on ImageNet-1K. When reused in a ViT of the same architecture trained from scratch on ImageNet-1K, the frozen activation (Frozen FAct) improves top-1 accuracy by 1.46 percentage points over GELU. Across four smaller target architectures (standard ViT, Swin Transformer, linear-attention ViT, and MLP-Mixer) and four image-classification datasets, it achieves the highest mean accuracy among eleven activation functions in 15 of 16 settings under a common training configuration, with improvements of up to 1.71 percentage points over the best conventional activation. When the learning rate and weight decay are tuned separately for each activation under the same search budget, Frozen FAct still ranks first in 11 of the 16 settings, second in four, and fourth in one. These results provide empirical evidence that a learned activation function can retain its usefulness when transferred across vision architectures, independently of the weights with which it was learned.
Updated: 2026-11-19 14:44:43
标题: 学习、冻结并跨架构迁移激活函数
摘要: 迁移学习通常通过复用源网络所获得的知识来实现,这些知识体现在其学习到的权重中。我们研究了学习得到的激活函数是否也能够被迁移,并在从头训练的网络中继续发挥作用。我们通过一种“学习—冻结—迁移”协议研究这种互补形式的迁移:在一次训练过程中,将激活函数与源网络联合优化;随后冻结该激活函数,并将其复用于从头训练的目标网络。具有全局共享参数的逐点激活函数不依赖于层的维度,因此可以被整合到不同架构的从头训练网络中。 我们使用 FAct 实例化了这一协议。FAct 是一种包含五个参数的激活函数,由一个双谐波截断傅里叶级数表示;其参数初始化自 GELU 的傅里叶近似,并在 ImageNet-1K 上的视觉 Transformer(ViT)中进行学习。当将其复用于在 ImageNet-1K 上从头训练的同架构 ViT 时,冻结后的激活函数(Frozen FAct)相比 GELU 将 top-1 准确率提高了 1.46 个百分点。在四种规模更小的目标架构(标准 ViT、Swin Transformer、线性注意力 ViT 和 MLP-Mixer)以及四个图像分类数据集上,在采用统一训练配置的情况下,Frozen FAct 在 16 种设置中的 15 种取得了 11 种激活函数中的最高平均准确率,相比最佳传统激活函数最高提升 1.71 个百分点。当在相同搜索预算下针对每种激活函数分别调节学习率和权重衰减时,Frozen FAct 仍在 16 种设置中的 11 种排名第一、4 种排名第二、1 种排名第四。这些结果为以下观点提供了实验证据:学习得到的激活函数在跨视觉架构迁移时能够保持其有效性,并且不依赖于学习该激活函数时所使用的权重。
更新时间: 2026-11-19 14:44:43
领域: cs.LG,cs.CV
Backbone Matters: Benchmarking Encoder-Decoder Networks for Semantic Segmentation of Driving Scenes on BDD100K
Semantic segmentation gives an autonomous vehicle a dense, pixel-level description of its surroundings and is a core part of scene understanding. Most segmentation networks consist of an encoder (the backbone) and a decoder, yet the backbone is often chosen without a systematic comparison. This work studies this choice on the BDD100K driving dataset. Four widely used decoders (U-Net, FPN, LinkNet and PSPNet) are combined with 13 backbones from six families (ResNet, VGG, DenseNet, Inception, MobileNet and EfficientNet), and all 52 models are trained with one common protocol. The best model, an FPN decoder with an EfficientNet-B4 backbone, reaches 62.6% mean intersection over union (mIoU), 89.8% accuracy and a loss of 0.092. Only two of the 52 models, both FPN with EfficientNet, exceed the 56.9% mIoU reported with the BDD100K benchmark. The effect of the backbone depends strongly on the decoder: the same EfficientNet-B4 gives 42.6% mIoU with PSPNet but 62.6% with FPN, and the gap between the best and the worst backbone ranges from 12.0 points (U-Net) to 42.5 points (FPN). The results and the scope of this study are discussed.
Updated: 2026-11-19 14:39:40
标题: 骨干网络至关重要:在 BDD100K 上对用于驾驶场景语义分割的编码器–解码器网络进行基准测试
摘要: 语义分割能够为自动驾驶车辆提供对周围环境的密集、像素级描述,是场景理解的核心组成部分。大多数分割网络由编码器(骨干网络)和解码器组成,但骨干网络的选择通常缺乏系统性比较。本文在 BDD100K 驾驶数据集上研究了这一选择。研究将四种广泛使用的解码器(U-Net、FPN、LinkNet 和 PSPNet)分别与来自六个网络家族(ResNet、VGG、DenseNet、Inception、MobileNet 和 EfficientNet)的 13 种骨干网络组合,并采用统一的训练方案对全部 52 个模型进行训练。表现最佳的模型采用 FPN 解码器和 EfficientNet-B4 骨干网络,达到 62.6% 的平均交并比(mIoU)、89.8% 的准确率,损失为 0.092。在 52 个模型中,只有两个模型超过了 BDD100K 基准报告的 56.9% mIoU,这两个模型均采用 FPN 解码器和 EfficientNet 骨干网络。骨干网络的效果高度依赖于解码器:同一个 EfficientNet-B4 与 PSPNet 结合时的 mIoU 为 42.6%,而与 FPN 结合时则达到 62.6%;最佳骨干网络与最差骨干网络之间的差距,从 U-Net 的 12.0 个百分点到 FPN 的 42.5 个百分点不等。本文还讨论了研究结果及其适用范围。
更新时间: 2026-11-19 14:39:40
领域: cs.CV,cs.LG
Invertible Transport Between Sample-Only Distributions via Projected Characteristic Functions
Many useful latent distributions can be sampled but do not have a tractable density. Such distributions may be represented by empirical collections of real-world observations or generated by scientific simulators and black-box generative models. These sample-only priors cannot be used directly in likelihood-based normalizing flows, which require evaluating the prior density. We propose Projected Characteristic-Function matching (PCF), a density-free framework for learning an invertible map between a data distribution and a prior specified only through samples. Our method aligns distributions using projected empirical characteristic functions, eliminating the need for density estimation, adversarial training, or paired observations. To address the non-uniqueness of the transport map, we introduce an optional transport regularizer that selects lower-displacement transformations while preserving endpoint alignment. We benchmark PCF on controlled transports, sample-efficiency studies, and high-dimensional alignment tasks. PCF matches the accuracy of kernel MMD on the controlled benchmark and on raw-pixel MNIST--USPS at a cost linear in the batch size, and it is more sample-efficient, achieving lower endpoint error than MMD in 13 of 15 paired runs across library sizes. By avoiding pairwise kernel evaluation, it reduces discrepancy memory by 29.8% and trains at batch sizes where kernel MMD exceeds GPU memory. These results show that PCF provides accurate and efficient invertible transport, particularly in sample- and memory-limited settings.
Updated: 2026-11-19 14:36:58
标题: 通过投影特征函数实现仅样本分布之间的可逆传输
摘要: 许多有用的潜在分布可以进行采样,但无法得到易于处理的密度。这类分布可以由现实世界观测数据的经验集合表示,也可以由科学模拟器和黑盒生成模型生成。这些仅能通过样本获得的先验无法直接用于基于似然的归一化流,因为后者要求能够计算先验密度。我们提出投影特征函数匹配(Projected Characteristic-Function matching,PCF),这是一种无需密度的框架,用于学习数据分布与仅由样本指定的先验之间的可逆映射。 我们的方法利用投影经验特征函数对齐分布,从而无需进行密度估计、对抗训练或配对观测。为解决传输映射的非唯一性问题,我们引入了一种可选的传输正则项,在保持端点对齐的同时,选择位移较小的变换。 我们在受控传输、样本效率研究和高维对齐任务上对 PCF 进行了评测。在受控基准以及原始像素 MNIST--USPS 任务中,PCF 达到了与核 MMD 相当的准确率,其计算成本随批大小线性增长;同时,它具有更高的样本效率:在不同样本库规模的 15 次配对实验中,有 13 次的端点误差低于 MMD。由于避免了成对核函数计算,它将差异度计算所需的内存减少了 29.8%,并且能够以核 MMD 超出 GPU 内存限制的批大小进行训练。这些结果表明,PCF 能够实现准确且高效的可逆传输,尤其适用于样本和内存受限的场景。
更新时间: 2026-11-19 14:36:58
领域: cs.LG,cs.CV
Reward misalignment as an opportunity for materials discovery
Reward misalignment is usually regarded as a failure of artificial intelligence. In materials discovery with generative AI models, however, disagreement between predefined rewards and expert judgment may reveal materials that the rewards overlook. We investigate this possibility using electronic flat bands as a prime example. Experts mostly agree with a numerical bandwidth score, but their disagreements are systematic and cannot be explained by an estimated 5% rate of mistaken labels. We learn the experts' preferences from pairwise comparisons and use them to guide a crystal diffusion model. The learned preferences and numerical score agree on the flattest bands but diverge elsewhere. For example, the preferences favor KCo2As2 and CoGa, reported compounds with partially flat bands that the score would discard. The framework also extends to synthesizability and phonon properties. Our findings suggest that reward misalignment can expose opportunities for materials discovery beyond what fixed rewards are designed to find.
Updated: 2026-11-19 14:36:15
标题: 奖励失配:材料发现的机遇
摘要: 奖励不一致通常被视为人工智能的失败。然而,在利用生成式人工智能模型进行材料发现时,预先设定的奖励与专家判断之间的分歧,可能揭示出奖励机制所忽略的材料。我们以电子平带为主要例子,研究了这种可能性。专家总体上认同数值带宽评分,但他们之间的分歧具有系统性,无法用约5%的标签错误率来解释。我们通过成对比较学习专家的偏好,并利用这些偏好引导晶体扩散模型。对于最平坦的能带,学习到的偏好与数值评分一致,但在其他方面则出现分歧。例如,专家偏好KCo2As2和CoGa——这些已报道的化合物具有部分平坦能带,却会被该评分机制舍弃。该框架还可扩展至可合成性和声子性质。我们的研究结果表明,奖励不一致能够揭示出超越固定奖励机制预设目标的材料发现机会。
更新时间: 2026-11-19 14:36:15
领域: cond-mat.mtrl-sci,cs.LG
Thermodynamically Consistent Neural Networks for a Universal Fluid Gibbs Free Energy Equation of State
Over the past three centuries, many thermodynamics researchers have worked to develop fluid equations of state with both high accuracy and broad applicability, proposing various theoretical frameworks and models. Building on these efforts, this study uses Gibbs free energy as the starting point and introduces thermodynamically consistent neural networks to construct a fluid equation of state based on Gibbs free energy (GEoS). This approach establishes a novel machine learning framework that provides a unified representation of fluid states. GEoS performs well on the vapor- and liquid-phase density test sets, with average absolute relative deviations (AARDs) of 5.25% and 3.96%, respectively. It outperforms conventional volume-translated cubic equations of state and existing machine learning models, demonstrating its effectiveness. Further analysis using the UMAP dimensionality reduction method shows that most molecules in the test set belong to extrapolation systems, confirming the strong generalization ability of the model. Finally, the test results show that the PC-SAFT equation fitted using GEoS maintains high predictive accuracy, providing a reliable basis for its practical application in industry.
Updated: 2026-11-19 14:35:31
标题: 用于通用流体吉布斯自由能状态方程的热力学一致神经网络
摘要: 过去三个世纪以来,众多热力学研究人员一直致力于开发兼具高精度和广泛适用性的流体状态方程,并提出了各种理论框架和模型。在这些研究的基础上,本研究以吉布斯自由能为出发点,引入热力学一致性神经网络,构建了一种基于吉布斯自由能的流体状态方程(GEoS)。该方法建立了一个新颖的机器学习框架,为流体状态提供统一表征。GEoS在气相和液相密度测试集上均表现良好,平均绝对相对偏差(AARD)分别为5.25%和3.96%。与传统的体积平移立方型状态方程和现有机器学习模型相比,GEoS表现出更优性能,证明了其有效性。进一步利用UMAP降维方法进行分析发现,测试集中的大多数分子属于外推体系,证实了该模型具有较强的泛化能力。最后,测试结果表明,利用GEoS拟合得到的PC-SAFT状态方程仍保持较高的预测精度,为其在工业中的实际应用提供了可靠基础。
更新时间: 2026-11-19 14:35:31
领域: cs.LG
SPARK: Adaptive Parametric Knowledge Participation for Faithful Retrieval-Augmented Generation
Retrieval-augmented generation (RAG) enhances the faithfulness of large language models (LLMs) by incorporating external knowledge into the generation process. However, conflicts between retrieved context and parametric knowledge can cause LLMs to rely on inconsistent internal knowledge, hindering their ability to faithfully leverage retrieved evidence. Existing approaches mitigate this issue by editing parametric knowledge to resolve such conflicts. However, locating and modifying knowledge encoded in model parameters is challenging and may inadvertently compromise the backbone LLM's capabilities. In this paper, we introduce SPARK, a novel framework that formulates parametric knowledge control as a latent participation policy learning problem, enabling LLMs to adaptively regulate the contribution of parametric knowledge during generation. Specifically, SPARK introduces a lightweight participation policy that dynamically modulates the contribution of FFN-mediated parametric knowledge while keeping the backbone LLM frozen. The participation policy is optimized with a faithfulness-oriented reward, enabling fine-grained control over parametric knowledge participation during generation. Extensive experiments on six datasets validate the effectiveness of SPARK, which introduces and optimizes only 0.01\% additional trainable parameters while keeping the backbone LLM fully frozen, thereby preserving its general capabilities and achieving more faithful generation than competitive baselines. All datasets and code are available at https://github.com/OpenBMB/SPARK.
Updated: 2026-11-19 14:34:03
标题: SPARK:面向忠实检索增强生成的自适应参数化知识参与
摘要: 检索增强生成(RAG)通过将外部知识融入生成过程,提升了大型语言模型(LLM)的事实忠实性。然而,检索到的上下文与参数化知识之间的冲突可能导致大型语言模型依赖不一致的内部知识,从而阻碍其忠实利用检索证据。现有方法通过编辑参数化知识来解决此类冲突,但定位和修改模型参数中编码的知识颇具挑战,并且可能无意中损害基础大型语言模型的能力。 本文提出 SPARK,一种新颖的框架,将参数化知识控制形式化为潜在参与策略学习问题,使大型语言模型能够在生成过程中自适应地调节参数化知识的贡献。具体而言,SPARK 引入了一种轻量级参与策略,在保持基础大型语言模型冻结的同时,动态调节由前馈神经网络(FFN)介导的参数化知识的贡献。该参与策略通过面向忠实性的奖励进行优化,从而实现对生成过程中参数化知识参与程度的细粒度控制。 在六个数据集上的大量实验验证了 SPARK 的有效性。该方法仅引入并优化了额外 0.01% 的可训练参数,同时保持基础大型语言模型完全冻结,从而保留其通用能力,并较具竞争力的基线方法实现更忠实的生成。所有数据集和代码均可在 https://github.com/OpenBMB/SPARK 获取。
更新时间: 2026-11-19 14:34:03
领域: cs.CL,cs.AI
Why Sub-4-Bit Vision CNNs Collapse and Where Mixed-Precision Recovery Stops
Deep vision models operating in resource-constrained environments depend heavily on low-bit quantization, yet compressing weights below 4 bits frequently induces catastrophic accuracy collapse. While mixed-precision recovery strategies aim to rescue accuracy by selectively retaining high-precision parameters, the fundamental mechanics of where and why these models collapse remain poorly understood. In this study, we systematically analyze the anatomy of quantization collapse across standard Vision CNNs (including ResNet and EfficientNet backbones) evaluated on the full 50,000-image ImageNet-1k validation set. First, we map the exact progression of degradation, demonstrating that collapse is highly non-linear and concentrated in late-stage pointwise projections and depthwise layers. Second, we introduce a structured, multi-step recovery waterfall that evaluates selective integer precision (INT4/INT8) and selective floating-point scales. We show that keeping less than 5% of critical layer activations in 8-bit precision recovers up to 92% of the accuracy lost during aggressive sub-4-bit compression. Finally, we bridge the hardware reality gap by evaluating deployment performance on standard ARM and x86 CPU architectures. We show that while low-bit quantization reduces memory storage requirements, standard runtime software bit-unpacking introduces a 1.48x to 21.5x execution slowdown depending on batch size, highlighting a critical trade-off between model footprint and actual edge throughput. Our findings provide a practical blueprint for navigating the limits of sub-4-bit deployment without sacrificing hardware performance.
Updated: 2026-11-19 14:30:24
标题: 为什么低于 4 位的视觉卷积神经网络会崩溃,以及混合精度恢复止于何处
摘要: 在资源受限环境中运行的深度视觉模型高度依赖低比特量化,但将权重压缩至低于 4 比特通常会导致准确率灾难性崩溃。尽管混合精度恢复策略试图通过有选择地保留高精度参数来挽救准确率,但这些模型究竟在何处以及为何发生崩溃,其基本机制仍缺乏充分理解。本研究针对标准视觉卷积神经网络(包括以 ResNet 和 EfficientNet 为骨干网络的模型),在完整的 50,000 张 ImageNet-1k 验证集上,系统分析了量化崩溃的内部特征。首先,我们刻画了性能退化的具体演变过程,证明崩溃具有高度非线性的特点,并主要集中于网络后期的逐点投影层和深度可分离卷积层。其次,我们提出了一种结构化的多步骤恢复瀑布流程,用于评估选择性整数精度(INT4/INT8)和选择性浮点缩放因子的效果。结果表明,仅将关键层中少于 5% 的激活值保留为 8 比特精度,即可恢复激进的低于 4 比特压缩所损失准确率的最高 92%。最后,我们通过在标准 ARM 和 x86 CPU 架构上评估部署性能,弥合了理论与硬件现实之间的差距。我们发现,尽管低比特量化能够降低模型存储需求,但标准运行时软件中的比特解包操作会导致执行速度下降 1.48 倍至 21.5 倍,具体取决于批量大小,凸显了模型占用空间与实际边缘设备吞吐量之间的关键权衡。我们的研究为在不牺牲硬件性能的前提下探索低于 4 比特部署的极限提供了实用路线图。
更新时间: 2026-11-19 14:30:24
领域: cs.AI,cs.CV,cs.LG
RegionAgent: Two-Stage Preference Optimization for Regional Image Restoration
Images under non-uniform coupled degradations require diverse restoration capabilities for different degraded regions. Existing methods employ globally uniform operations, potentially overlooking regional differences and causing incomplete restoration or even damage to image content. Moreover, a degraded region may require successive restoration actions, and earlier actions may alter residual degradation characteristics or introduce artifacts, potentially hindering subsequent restoration. To address these challenges, we propose RegionAgent, an adaptive restoration framework that trains a Vision-Language Model (VLM) through two-stage preference learning to generate a region-specific restoration action at each iteration. Specifically, we first train the VLM to select an action suited to the current region through step-level Direct Preference Optimization (DPO), using preferences derived from immediate restoration feedback to supervise only the differing component in each action pair. To account for the effects of current actions on subsequent restoration, we then apply trajectory-level DPO, using preferences derived from complete trajectory scores to supervise the sole differing action in each trajectory pair. Furthermore, as conventional image-pair datasets do not directly provide preferences over regional restoration decisions, we construct a regional restoration preference dataset comprising 10K action pairs and 20K trajectory pairs for two-stage VLM training. Experiments across multiple datasets demonstrate strong restoration performance under both mixed and single degradations. Ablation studies further validate the effectiveness of two-stage preference learning in improving restoration quality.
Updated: 2026-11-19 14:29:56
标题: RegionAgent:面向区域图像修复的两阶段偏好优化
摘要: 非均匀耦合退化图像需要针对不同退化区域具备多样化的修复能力。现有方法采用全局统一的操作,可能忽视区域差异,导致修复不完整,甚至损害图像内容。此外,一个退化区域可能需要连续执行多次修复操作,而较早的操作可能改变残余退化的特征或引入伪影,从而妨碍后续修复。为应对这些挑战,我们提出了 RegionAgent,一种自适应修复框架,通过两阶段偏好学习训练视觉语言模型(VLM),使其在每次迭代中生成针对特定区域的修复操作。具体而言,我们首先通过步骤级直接偏好优化(DPO)训练 VLM,利用从即时修复反馈中获得的偏好来监督每对操作中唯一不同的组成部分,使模型选择适合当前区域的操作。为考虑当前操作对后续修复的影响,我们进一步采用轨迹级 DPO,利用从完整轨迹得分中获得的偏好来监督每对轨迹中唯一不同的操作。此外,由于传统图像对数据集无法直接提供关于区域修复决策的偏好信息,我们构建了一个区域修复偏好数据集,其中包含 1 万对操作和 2 万对轨迹,用于两阶段 VLM 训练。在多个数据集上的实验表明,该方法在混合退化和单一退化场景下均展现出优异的修复性能。消融实验进一步验证了两阶段偏好学习在提升修复质量方面的有效性。
更新时间: 2026-11-19 14:29:56
领域: cs.CV,cs.AI
Where Global Context and Weight Sharing Work in Compact Vision Backbones
Compact convolutional backbones such as EfficientNet achieve strong parameter efficiency through local depthwise separable convolutions, yet two structural questions remain central to hybrid design: where does global self-attention improve recognition over pure convolution, and can repeated blocks share weights without losing representational capacity? We investigate both questions on ImageNet-1k (50,000-image validation) using controlled EfficientNet-B0 experiments. First, we show that wrapping a classification backbone in multi-scale feature pyramids (BiFPN) fails to outperform a plain MBConv trunk (69.99% - 71.81% vs. 72.86% plain B0) until paired with stage attention (73.15%). In contrast, keeping the MBConv trunk intact and inserting lightweight zero-gated residual self-attention adapters at stages P3 (28x28 windowed), P4 (14x14 global), and P5 (7x7 global) reaches 74.02% standalone and outperforms a bit-for-bit matched plain-B0 control by +0.954 percentage points (73.88% vs. 72.92%) across an 88-epoch stateless replay schedule, with learned attention amplitude rising monotonically with semantic depth (27.2% at P3 -> 45.4% at P4 -> 66.3% at P5). Second, we evaluate recurrent weight sharing across repeated MBConv blocks with pass-specific BatchNorm statistics (+1,536 parameters per pass). While post-hoc kernel averaging degrades accuracy to 17.03% and single-template stage tying (-27.6% parameters) plateaus at 66.10%, alternating two shared block templates ([B1, A, B, A]) in Stage 6 cuts total model parameters by 10.9% (582K weights) and recovers by +10.82 points in a single epoch to 70.92% (-1.84 points vs. unshared control).
Updated: 2026-11-19 14:28:24
标题: 全局上下文与权重共享在紧凑型视觉骨干网络中的作用 天天彩票app
摘要: 紧凑型卷积骨干网络(如 EfficientNet)通过局部深度可分离卷积实现了较高的参数效率,但混合架构设计仍面临两个核心结构性问题:相较于纯卷积网络,全局自注意力应在何处提升识别性能;以及在不损失表征能力的情况下,重复模块能否共享权重?我们在 ImageNet-1k(50,000 张图像的验证集)上,通过受控的 EfficientNet-B0 实验对这两个问题进行了研究。 首先,我们表明,将分类骨干网络封装在多尺度特征金字塔(BiFPN)中,在结合阶段注意力之前,无法超越普通的 MBConv 主干网络(69.99%–71.81%,而普通 B0 为 72.86%);结合阶段注意力后,准确率达到 73.15%。相比之下,在保持 MBConv 主干网络完整不变的情况下,于 P3(28×28 窗口化)、P4(14×14 全局)和 P5(7×7 全局)阶段插入轻量级、零门控的残差自注意力适配器,其独立准确率达到 74.02%;在一个持续 88 个 epoch 的无状态重放训练方案中,相较于逐位匹配的普通 B0 对照模型,性能提升了 0.954 个百分点(73.88% 对 72.92%)。此外,学习到的注意力幅度随语义深度单调增加:P3 为 27.2%,P4 为 45.4%,P5 为 66.3%。 其次,我们评估了重复 MBConv 模块之间的循环式权重共享,并为每次传递使用特定的批归一化统计量(每次传递增加 1,536 个参数)。事后进行卷积核平均会使准确率降至 17.03%;而采用单模板的阶段级权重绑定(参数量减少 27.6%)后,准确率停留在 66.10%。在 Stage 6 中交替使用两个共享模块模板([B1, A, B, A]),可将模型总参数量减少 10.9%(减少至 582K 个权重),并在单个 epoch 内恢复 10.82 个百分点,使准确率达到 70.92%(比不共享权重的对照模型低 1.84 个百分点)。
更新时间: 2026-11-19 14:28:24
领域: cs.CV,cs.AI,cs.LG
Context--Answer Metamodels: Forecasting LLM Activations Before the First Answer Token
Under stochastic decoding, a single context can elicit many different answers from a language model. Characterizing this variation typically requires many expensive autoregressive rollouts, each revealing only one realization. We ask whether the activations produced while reading the context can directly forecast the model's rollout activations. We train context--answer metamodels that map a context activation sequence to point or distribution forecasts of mean-pooled answer activations. We find that (i) the four metamodel families we study forecast mean-pooled answer activations with high fidelity, and the distribution metamodels also capture rollout variability; (ii) performance improves as the training set grows to 500,000 prompts, and the metamodels generalize zero-shot to out-of-domain datasets; (iii) their forecasts retain behavior-predictive signal; and (iv) context activations from Qwen2.5 predict mean-pooled answer activations from Qwen3.5 and Gemma 4, suggesting that activation forecasts can transfer across models. Together, these results suggest that context activation traces can support scalable forecasts of behaviors in LLM answers before the first answer token is generated.
Updated: 2026-11-19 14:26:49
标题: 上下文—回答元模型:在第一个回答词元生成之前预测大语言模型的激活状态
摘要: 在随机解码下,同一上下文可以使语言模型生成许多不同的答案。刻画这种差异通常需要进行大量成本高昂的自回归 rollout,而每次 rollout 只能揭示一种结果。我们探讨了这样一个问题:模型在读取上下文时产生的激活,能否直接预测其 rollout 过程中的激活?我们训练了上下文—答案元模型,将上下文激活序列映射为答案激活均值池化结果的点预测或分布预测。我们发现:(i)所研究的四类元模型都能高保真地预测答案激活的均值池化结果,分布元模型还能够捕捉 rollout 的变异性;(ii)随着训练集规模扩大至 500,000 个提示词,模型性能不断提升,并且这些元模型能够零样本泛化至域外数据集;(iii)其预测结果保留了可用于预测行为的信息;(iv)Qwen2.5 的上下文激活能够预测 Qwen3.5 和 Gemma 4 的答案激活均值池化结果,这表明激活预测可以跨模型迁移。总体而言,这些结果表明,在生成第一个答案词元之前,上下文激活轨迹即可支持对大语言模型答案行为进行可扩展的预测。
更新时间: 2026-11-19 14:26:49
领域: cs.LG,cs.AI
Products of Distinguisher Hulls
The distinguisher hull of two distributions is the convex hull of the pairs of acceptance probabilities of tests in a specified class. We study its behavior under independent products for size-bounded Boolean circuits. We derive a geometric consequence of Dwork and Tankala's supersimulator theorem (FOCS 2026), giving a substantially different proof of approximate product containment for distinguisher hulls. In particular, our construction uses nonadaptive sampling in place of adaptive score corrections.
Updated: 2026-11-19 14:19:39
标题: 区分器外壳的乘积
摘要: 两个分布的区分器包络是指指定测试类中各项测试的接受概率对所构成的凸包。我们研究了在规模受限布尔电路下,该包络在独立乘积运算中的表现。我们从 Dwork 和 Tankala 的超模拟器定理(FOCS 2026)推导出一个几何学上的结论,并据此为区分器包络的近似乘积包含性给出了一个截然不同的证明。特别是,我们的构造采用非自适应采样,而非自适应的得分修正。
更新时间: 2026-11-19 14:19:39
领域: cs.CC,cs.CR
Multidimensional Reconciliation in Continuous-Variable QKD: Review, Coding Schemes, and Open-Source Simulation
Continuous-variable quantum key distribution (CV-QKD) requires highly efficient reconciliation techniques to operate at low signal-to-noise ratios and long distances. Multidimensional reconciliation addresses this challenge by transforming the physical Gaussian quantum channel into a virtual binary-input additive white Gaussian noise (BIAWGN) channel, enabling the use of modern errorcorrecting codes. In this work, we review the principles of multidimensional reconciliation, with a particular focus on high-dimensional constructions beyond the algebraic dimensions 1, 2, 4, 8. We describe the construction of the virtual channel, discuss practical coding schemes for reverse reconciliation, and analyse their integration with linear error-correcting codes. We also present an opensource simulation framework, HDirac, implementing multidimensional reconciliation for arbitrary dimensions, and use it to evaluate state-of-the-art LDPC codes. The results highlight key trade-offs between dimension, reconciliation efficiency, and frame error rate, providing practical guidance for CV-QKD system design.
Updated: 2026-11-19 14:07:59
标题: 连续变量量子密钥分发中的多维协调:综述、编码方案与开源仿真
摘要: 连续变量量子密钥分发(CV-QKD)需要高效的协调技术,才能在低信噪比和远距离条件下运行。多维协调通过将物理高斯量子信道转换为虚拟二进制输入加性高斯白噪声(BIAWGN)信道,应对了这一挑战,从而能够使用现代纠错码。在本工作中,我们回顾了多维协调的基本原理,重点关注超越代数维度 1、2、4、8 的高维构造。我们介绍了虚拟信道的构造方法,讨论了适用于逆向协调的实用编码方案,并分析了这些方案与线性纠错码的结合。我们还展示了一个开源仿真框架 HDirac,该框架能够针对任意维度实现多维协调,并利用它评估当前先进的 LDPC 码。结果揭示了维度、协调效率和帧错误率之间的关键权衡,为连续变量量子密钥分发系统的设计提供了实用指导。
更新时间: 2026-11-19 14:07:59
领域: cs.IT,cs.CR,quant-ph
SCARVA: Interpretable Agentic Reasoning in Software Supply-Chain Analysis
Complex applications may inherit security vulnerabilities from their dependencies, though a vulnerable dependency does not necessarily endanger the application. Existing tools flag dependencies associated with public vulnerabilities, and more advanced ones analyze the call graph to assess whether the vulnerable code is reachable. However, these approaches are limited to specific programming languages and ecosystems. LLM agents are promising candidates for this task, yet they hallucinate, take shortcuts, and reward hack. As these behaviors are opaque, the agents' conclusions may not be trusted. We present SCARVA a framework designed to produce interpretable reports. SCARVA combines advanced agent reasoning with an evidence-collection methodology that assesses the agent's analysis and improves its trustworthiness. Specifically, the ANALYST performs a software security assessment while SCARVA records every tool call, file access, and web request. Then, one or more independent JUDGE agents inspect the ANALYST's result and produce an evidence-backed report. We evaluate SCARVA on 54 manually curated cases, balanced across exploitable, non-exploitable, and vulnerability-free projects, using both open-weight and frontier models. The best ANALYST model, Qwen 3.8, reaches 82% balanced accuracy and surpasses the evaluated proprietary models. Human annotation validates the JUDGE findings: Claude Opus 5.5 performs best, agreeing with annotators in 94% of claim checks. Finally, we discuss the most common failure modes of agents on supply-chain vulnerability assessment.
Updated: 2026-11-19 13:52:24
标题: SCARVA:软件供应链分析中的可解释智能体推理
摘要: 复杂应用可能会从其依赖项中继承安全漏洞,但存在漏洞的依赖项并不一定会危及应用程序。现有工具会标记与公开漏洞相关的依赖项,而更先进的工具则会分析调用图,以评估易受攻击的代码是否可达。然而,这些方法仅适用于特定的编程语言和生态系统。LLM 代理是完成这项任务的有希望的候选方案,但它们会产生幻觉、走捷径并进行奖励投机。由于这些行为缺乏透明度,代理得出的结论可能无法被信任。 我们提出了 SCARVA,这是一种旨在生成可解释报告的框架。SCARVA 将先进的代理推理与证据收集方法相结合,用于评估代理的分析并提升其可信度。具体而言,ANALYST 负责执行软件安全评估,而 SCARVA 会记录每一次工具调用、文件访问和网络请求。随后,一个或多个独立的 JUDGE 代理会检查 ANALYST 的结果,并生成一份有证据支持的报告。我们在 54 个经过人工整理的案例上评估了 SCARVA,这些案例均衡涵盖可利用、不可利用和不存在漏洞的项目,并同时使用开放权重模型和前沿模型。表现最佳的 ANALYST 模型 Qwen 3.8 达到了 82% 的平衡准确率,超过了参与评估的专有模型。人工标注验证了 JUDGE 的发现:Claude Opus 5.5 表现最佳,在 94% 的断言核查中与标注人员达成一致。最后,我们讨论了代理在供应链漏洞评估中最常见的失败模式。
更新时间: 2026-11-19 13:52:24
领域: cs.CR
ChronoPatch: Black-Box Energy-Latency Attacks on Vision-Language Models
Vision-language models (VLMs) are increasingly deployed as generative inference services, where autoregressive decoding makes response length a key determinant of latency and computational cost. This creates an availability risk: adversarial visual inputs can prolong generation and increase serving overhead. Existing energy-latency attacks typically rely on gradients, logits, or token-level feedback, leaving open whether such risks persist when an attacker observes only the final response. We present ChronoPatch, a black-box attack that induces prolonged VLM generation requiring only the final response. It discovers visual delay anchors through response-length-guided evolutionary search, then minimizes perturbation magnitude through subspace-calibrated decision-based optimization. Across four open-source VLMs, ChronoPatch increases inference latency by 47.86%--293.34% and GPU energy consumption by 41.44%--249.70% under a 5% spatial budget. It also induces more repetitive outputs, as reflected by increased n-gram repetition ratios. On three commercial VLM APIs, ChronoPatch increases response length by 37.6%--81.5% and client-observed latency by 1.82x--2.29x under query budgets of 500 per API. These results reveal a generation-based availability risk that persists under final-response-only access and motivate generation-aware safeguards for deployed generative AI services.
Updated: 2026-11-19 13:45:20
标题: ChronoPatch:针对视觉语言模型的黑盒能耗—延迟攻击
摘要: 视觉语言模型(VLM)正日益被部署为生成式推理服务,其中,自回归解码使响应长度成为决定延迟和计算成本的关键因素。这带来了一种可用性风险:对抗性视觉输入可能延长生成过程并增加服务开销。现有的能耗—延迟攻击通常依赖梯度、logit 或令牌级反馈,因此,当攻击者只能观察最终响应时,此类风险是否依然存在仍有待研究。 我们提出 ChronoPatch,一种仅需最终响应即可诱导 VLM 延长生成过程的黑盒攻击方法。该方法通过响应长度引导的进化搜索发现视觉延迟锚点,然后利用子空间校准的基于决策的优化来最小化扰动幅度。在四种开源 VLM 上,在 5% 的空间预算下,ChronoPatch 将推理延迟提高了 47.86%—293.34%,并将 GPU 能耗提高了 41.44%—249.70%。此外,该方法还会诱导生成更加重复的输出,这体现在 n-gram 重复率的上升上。 在三种商业 VLM API 上,在每个 API 500 次查询的预算下,ChronoPatch 将响应长度增加了 37.6%—81.5%,并将客户端观测到的延迟提升至原来的 1.82—2.29 倍。这些结果揭示了一种即使在仅能访问最终响应的情况下仍然存在的、基于生成过程的可用性风险,并促使人们为已部署的生成式人工智能服务制定面向生成过程的防护措施。
更新时间: 2026-11-19 13:45:20
领域: cs.CR,cs.AI
Causal Overtaking in Fair Transaction Ordering
Fair transaction ordering protocols aim to mitigate front-running using replica-local arrival orders, but prior work often assumes a single submission origin for each responsive transaction. We identify causal overtaking, in which corrupted replicas observe a target and submit identical signed copies of a responsive transaction through multiple client entries. The copies' first arrivals at different replicas can collectively provide ordering support that no individual path achieves, allowing the response to execute before its target. We formalize a class of receipt-order protocols, including Themis, characterize the timing and network conditions under which the attack is feasible, and show that delayed gossip does not rule it out. We further prove that, under our network model, histories requiring opposite transaction orders can produce identical receipt evidence. Thus, receipt-only mechanisms cannot always preserve earlier-submission priority while preventing responsive overtaking. We propose a mitigation and analyze its assumptions and limitations. Finally, we evaluate the attack and mitigation on Themis through simulations driven by AWS and WonderProxy latency measurements.
Updated: 2026-11-19 13:33:48
标题: 公平交易排序中的因果超车
摘要: 公平交易排序协议旨在利用副本本地的到达顺序来缓解抢跑攻击,但以往研究通常假设每个响应交易只有一个提交来源。我们发现了一种因果超越攻击:被攻陷的副本观察到目标交易后,通过多个客户端入口提交响应交易的相同签名副本。这些副本在不同副本处的首次到达,可能共同提供单条路径无法实现的排序支持,从而使响应交易在目标交易之前执行。我们形式化了一类收据排序协议(包括 Themis),刻画攻击可行所需的时序与网络条件,并证明延迟式传播并不能排除该攻击。进一步地,我们证明,在所采用的网络模型下,要求相反交易顺序的历史可能产生完全相同的收据证据。因此,仅依赖收据的机制无法始终在防止响应交易超越目标交易的同时,维护较早提交者的优先权。我们提出了一种缓解措施,并分析其假设与局限性。最后,我们通过由 AWS 和 WonderProxy 延迟测量数据驱动的模拟,在 Themis 上评估了该攻击及缓解措施。
更新时间: 2026-11-19 13:33:48
领域: cs.CR
Phantom of the Masquerade: Graph Neural Network-Based Detection of Masquerade Attacks in Controller Area Networks
The lack of built-in security in controller area networks (CANs) exposes modern vehicles and industrial systems to masquerade attacks that can compromise safety and reliability. These attacks inject malicious messages that mimic legitimate communication patterns, making them difficult to detect using existing intrusion detection systems (IDS). Prior graph-based IDS approaches often rely on shallow embeddings that decouple representation learning from classification, which may limit their ability to fully exploit structural and signal-level information. In this paper, we propose PhantoMasq, a graph neural network (GNN)-based framework for detecting masquerade attacks in CAN systems. PhantoMasq models CAN traffic as message sequence graphs enriched with lightweight statistical features derived from signal behavior, enabling joint learning of structural dependencies and temporal characteristics. The detection task is formulated as a graph-level classification problem and solved using graph convolutional networks (GCNs). We evaluate PhantoMasq on the ROAD dataset under a protocol that prevents overlapping windows from spanning training and test data. Across five masquerade attack types, PhantoMasq achieves mean AUC-ROC between 0.831 and 0.999, with performance depending on the transmission rate of the targeted identifier and the magnitude of the induced signal deviation. Against a state-of-the-art graph-embedding baseline evaluated on the same sliding-window configurations, PhantoMasq achieves higher AUC-ROC on all five attack types, by 0.13 to 0.36, and is less sensitive to window configuration. Window-processing latency ranges from 2.33 to 5.94 ms per window on CPU, corresponding to a throughput of 168 to 429 windows per second. We make our implementation and experimental artifacts available to support reproducibility.
Updated: 2026-11-19 13:30:46
标题: 伪装的幽灵:基于图神经网络的控制器局域网伪装攻击检测
摘要: 控制器局域网(CAN)缺乏内置安全机制,使现代车辆和工业系统容易遭受伪装攻击,从而危及系统的安全性与可靠性。这类攻击会注入模仿合法通信模式的恶意消息,因此使用现有入侵检测系统(IDS)难以检测。以往基于图的入侵检测方法通常依赖浅层嵌入,将表示学习与分类过程相互割裂,这可能限制其对结构信息和信号层面信息的充分利用。 本文提出了 PhantoMasq,一种基于图神经网络(GNN)的 CAN 系统伪装攻击检测框架。PhantoMasq 将 CAN 流量建模为消息序列图,并结合根据信号行为提取的轻量级统计特征,从而实现对结构依赖关系和时间特征的联合学习。该检测任务被表述为图级分类问题,并通过图卷积网络(GCN)加以解决。 我们在 ROAD 数据集上对 PhantoMasq 进行了评估,采用的实验协议可防止重叠窗口同时跨越训练数据和测试数据。在五种伪装攻击类型中,PhantoMasq 的平均 AUC-ROC 达到 0.831 至 0.999,具体性能取决于目标标识符的传输速率以及所诱导信号偏差的幅度。与在相同滑动窗口配置下评估的最先进图嵌入基线方法相比,PhantoMasq 在全部五种攻击类型上的 AUC-ROC 均更高,提升幅度为 0.13 至 0.36,并且对窗口配置的敏感性更低。在 CPU 上,单个窗口的处理延迟为 2.33 至 5.94 毫秒,对应的吞吐量为每秒 168 至 429 个窗口。我们公开了实现代码和实验材料,以支持研究结果的复现。
更新时间: 2026-11-19 13:30:46
领域: cs.CR,cs.LG
Triosecuris: Formally Verified Protection Against Speculative Control-Flow Hijacking
This paper introduces Triosecuris, a formally verified defense against Spectre BTB, RSB, and PHT that combines CET-style hardware-assisted control-flow integrity with compiler-inserted speculative load hardening (SLH). Triosecuris is based on the novel observation that in the presence of CET-style protection, we can precisely detect BTB misspeculation for indirect calls and RSB misspeculation for returns and set the SLH misspeculation flag. We formalize Triosecuris as a transformation in Rocq and provide a machine-checked proof that it achieves relative security: any transformed program running with speculation leaks no more than what the source program leaks without speculation. This strong security guarantee applies to arbitrary programs, even those not following the cryptographic constant-time programming discipline.
Updated: 2026-11-19 13:26:28
标题: Triosecuris:经形式化验证的防护机制,抵御推测性控制流劫持
摘要: 本文介绍了 Triosecuris,这是一种经过形式化验证的 Spectre BTB、RSB 和 PHT 防御方案,将类似 CET 的硬件辅助控制流完整性与编译器插入的推测性加载加固(SLH)相结合。Triosecuris 基于一项新颖的观察:在采用类似 CET 的保护时,我们可以精确检测间接调用中的 BTB 错误推测和返回中的 RSB 错误推测,并设置 SLH 错误推测标志。我们在 Rocq 中将 Triosecuris 形式化为一种变换,并提供机器检查的证明,表明它实现了相对安全性:任何经过变换的程序在推测执行环境下运行时,其泄漏的信息不会多于源程序在无推测执行环境下泄漏的信息。这一强安全性保证适用于任意程序,即使这些程序不遵循密码学常数时间编程规范。
更新时间: 2026-11-19 13:26:28
领域: cs.CR,cs.PL
When Do Rankings Beat Signs? Gradient Direction Recovery under Even Nuisance
Can ranking a batch of antipodal query pairs recover a gradient direction with fewer evaluations than using within-pair signs alone? We study fixed-center recovery in $d$ dimensions for a linear signal plus an unknown differentiable even nuisance, counting function evaluations and feedback rounds separately. Shared pair offsets create an information hierarchy: Mirror retains within-pair signs, Reverse couples reversed cross-pair orders to cancel offsets, and Full enforces all ranking inequalities. Relative shell variation is the nuisance range over the query sphere normalized by the linear-signal scale. When it is at most $c\varepsilon/\sqrt{d}$, Reverse localizes every consistent direction to angular accuracy $\varepsilon$ using $\widetilde{O}(d+\sqrt{d/\varepsilon})$ evaluations in one round at fixed confidence, without a variation bound supplied to the decoder. This matches a lower bound up to logarithmic factors, versus the $Θ(d/\varepsilon)$ one-round sign-only minimax cost on the same class. Over well-conditioned positive-definite quadratics with no common relative-curvature bound, the $R$-round minimax cost is instead $Θ(dR(\varepsilon^{-1/R}-1))$, even with cumulative rankings. We extend validity beyond exact evenness under supplied error bounds. Matched-endpoint experiments certify information beyond signs and short cycles. On two ridge tasks under joint evaluation and round caps, short-cycle recovery attains lower terminal mean gaps than the tested batch-capable controls. An additional optimization benefit from fitting the complete ranking remains unestablished.
Updated: 2026-11-19 13:01:08
标题: 排序何时优于符号?偶数型干扰下的梯度方向恢复
摘要: 将一批对跖查询对进行排序,是否能够以少于仅使用对内符号的函数评估次数恢复梯度方向?我们研究 $d$ 维空间中的固定中心恢复问题,针对线性信号加未知可微偶函数的情形,分别计算函数评估次数和反馈轮数。共享的成对偏移产生了一个信息层级:Mirror 保留对内符号,Reverse 将反转的跨对排序耦合起来以抵消偏移,而 Full 则强制满足所有排序不等式。相对壳层变化量定义为查询球面上的干扰项范围与线性信号尺度之比。当该变化量至多为 $c\varepsilon/\sqrt{d}$ 时,在固定置信度下,Reverse 可在一轮中使用 $\widetilde{O}(d+\sqrt{d/\varepsilon})$ 次评估,将所有一致方向定位到角度精度 $\varepsilon$;解码器无需获得变化量上界。这一结果与下界仅相差对数因子;相比之下,在同一类别上一轮仅使用符号的极小极大成本为 $Θ(d/\varepsilon)$。对于没有共同相对曲率界的条件良好的正定二次函数,即使使用累积排序,$R$ 轮极小极大成本仍为 $Θ(dR(\varepsilon^{-1/R}-1))$。在给定误差界的情况下,我们将有效性扩展到不完全偶对称的情形。匹配端点实验验证了超出符号所包含的信息以及短环所提供的信息。在两个岭回归任务中,在函数评估次数和轮数均受限的条件下,短环恢复相比所测试的可批处理控制方法取得了更低的最终平均间隙。通过拟合完整排序而获得的额外优化收益,尚未得到证实。
更新时间: 2026-11-19 13:01:08
领域: cs.LG
Reference-Free Humanoid Skateboarding via Termination-Shaped Reinforcement Learning
Humanoid locomotion research has advanced rapidly on walking and running, but \emph {object-mediated} locomotion, in which a robot must coordinate its body with a passive external object, remains difficult. One challenging task is skateboarding, which requires simultaneous interaction with the ground and a passive but movable platform to achieve forward motion. Current methods for tackling skateboarding with humanoid robots either require human demonstrations or utilise analytic steering models that require system identification. In this paper, we introduce a deep reinforcement learning framework that does not rely on prior data such as demonstrations and enables robots such as the K1 humanoid to learn to skateboard using model-free learning. The method combines task rewards with exploit-blocking terminations. We introduce a number of constraints restricting behaviours such as losing the planted board foot, standing with both feet on the board, excessive twisting, separation from the board, and unstable board motion. Their changing prevalence during training produces an implicit progression from stance control towards sustained robot--board locomotion.
Updated: 2026-11-19 12:59:43
标题: 通过终止塑形强化学习实现无参考人形机器人滑板运动
摘要: 人形机器人运动研究在行走和跑步方面取得了快速进展,但“物体介导的”运动仍然十分困难。在这类运动中,机器人必须使自身身体与一个被动的外部物体协调配合。滑滑板就是一项具有挑战性的任务,它要求机器人同时与地面以及一个被动但可移动的平台进行交互,从而实现向前运动。目前,利用人形机器人完成滑滑板的方法要么需要人类示范,要么采用需要进行系统辨识的解析转向模型。 本文提出了一种深度强化学习框架,不依赖示范等先验数据,使 K1 等人形机器人能够通过无模型学习掌握滑滑板。该方法将任务奖励与防止投机行为的终止条件相结合。我们引入了多项约束,以限制机器人出现以下行为:失去踩在滑板上的支撑脚、双脚站在滑板上、过度扭转、与滑板分离,以及导致滑板运动不稳定。训练过程中,这些行为出现频率的变化形成了一种隐式的学习进程,使机器人从支撑姿态控制逐步过渡到持续的机器人—滑板协同运动。
更新时间: 2026-11-19 12:59:43
领域: cs.RO,cs.LG
Studying AI Act Mentions: A first look at the impact of the European Union's AI regulation on Hugging Face
The European Union's Artificial Intelligence Act (AI Act) entered into force in August 2024, and its obligations apply in stages. Obligations for providers of general-purpose AI models have applied since August 2025, and transparency rules since August 2026. These obligations affect developers who share and deploy models and applications on public platforms such as Hugging Face (HF), the largest platform for distributing AI artifacts. However, little is known about how practitioners respond to the regulation in practice. To address this gap, we conducted an empirical study of explicit references to the AI Act on HF. We collected over five million records, including repository cards, discussions, and commits from Models, Datasets, and Spaces, and identified over 1,500 records that explicitly mention the Act. Two coders manually labeled these records using a primarily closed coding approach, and we analyzed the resulting categories per source. We find that explicit references to the AI Act remain rare across all repository types. Repository cards mainly contain claims of compliance and responsibility, like ensuring compliance or assigning responsibility to downstream users, and some claim that the Act does not apply because the model is not a general-purpose AI model. Discussions are used to report alleged violations of the Act, while commits mainly update artifacts that support compliance. Overall, compliance statements focus on who is responsible rather than how compliance is achieved. We believe that this calls for direct platform support, e.g., automated checks and documentation templates, as well as clearer guidance on the scope of the AI Act.
Updated: 2026-11-19 12:57:53
标题: 研究对《人工智能法案》提及情况:初探欧盟人工智能法规对 Hugging Face 的影响
摘要: 欧盟《人工智能法案》(AI Act)于2024年8月生效,其义务分阶段适用。针对通用人工智能模型提供者的义务自2025年8月起适用,透明度规则则自2026年8月起适用。这些义务影响着在 Hugging Face(HF)等公共平台上分享和部署模型及应用程序的开发者。Hugging Face 是分发人工智能相关资源的最大平台。然而,目前人们对从业者在实践中如何应对该法规知之甚少。为弥补这一空白,我们对 HF 上明确提及《人工智能法案》的内容开展了实证研究。我们收集了来自 Models、Datasets 和 Spaces 的超过500万条记录,包括仓库卡片、讨论和提交记录,并识别出超过1,500条明确提及该法案的记录。两名编码员采用以封闭式编码为主的方法,对这些记录进行了人工标注;随后,我们按来源分析了所得类别。我们发现,在所有类型的仓库中,明确提及《人工智能法案》的情况仍然很少。仓库卡片主要包含合规与责任方面的声明,例如确保合规或将责任分配给下游用户;其中一些还声称,由于相关模型并非通用人工智能模型,该法案不适用。讨论区被用于报告涉嫌违反该法案的行为,而提交记录主要用于更新支持合规的相关资源。总体而言,合规声明关注的是谁应当负责,而不是如何实现合规。我们认为,这需要平台提供直接支持,例如自动化检查和文档模板,同时也需要更明确地说明《人工智能法案》的适用范围。
更新时间: 2026-11-19 12:57:53
领域: cs.AI
Ensemble Logic
Ensemble Logic (EL) is a family of modal logics whose modal parameters are terms with quantified variables. We interpret formulas over metric monoids, that is, commutative monoids equipped with translation-invariant metrics. Displacement evaluates a formula at a translated point, while bounded existence and bounded universality evaluate it at some or every point of a window of prescribed length. Quantification over points and lengths allows the same variable to occur in the parameters of several operators. This provides a common framework for temporal and spatial reasoning in discrete, dense and multi-dimensional settings. Our main result establishes a sharp undecidability boundary for satisfiability over the natural numbers: satisfiability is undecidable already for formulas $\exists N\,\exists n\,Ψ$ in which $Ψ$ is built from the letters of a fixed alphabet by conjunction, disjunction, displacement and bounded universality. We prove this by a reduction from Post's Correspondence Problem. We also present results, in part from companion work, that place this theorem in the general theory of EL. These include an atomic-displacement normal form for covariant windows and composition laws for discrete and dense time. The discrete logic admits an embedding of linear temporal logic, defines the accepting runs of every Büchi automaton, and has a sound equational calculus. For the rational logic, we show that every fixed formula can be evaluated in polynomial time on interval models in which atomic propositions are interpreted by finite unions of intervals. Finally, we represent timed words over positions and real time and compare two window geometries; with rectangular windows, two shared lengths yield undecidability on finite timed words.
Updated: 2026-11-19 12:53:29
标题: 集成逻辑
摘要: 集成逻辑(Ensemble Logic,EL)是一类模态逻辑,其模态参数是带有量化变量的项。我们在度量幺半群上解释公式,即在交换幺半群上配备平移不变的度量。位移算子在平移后的点上对公式求值,而有界存在和有界全称则在给定长度的窗口中的某个点或每个点上对公式求值。对点和长度进行量化,使同一个变量可以出现在多个算子的参数中。这为离散、稠密和多维环境下的时间推理与空间推理提供了一个统一框架。 我们的主要结果确立了在自然数上的可满足性问题的精确不可判定边界:对于形如 $\exists N\,\exists n\,Ψ$ 的公式,可满足性已经是不可判定的,其中 $Ψ$ 由固定字母表中的命题字母通过合取、析取、位移和有界全称构造而成。我们通过从波斯特对应问题的归约证明了这一点。 我们还给出了一些结果,其中部分来自配套工作,这些结果将该定理置于 EL 的一般理论之中。其中包括协变窗口的原子位移正规形,以及离散时间和稠密时间下的复合律。离散逻辑可以嵌入线性时序逻辑,能够定义每个 Büchi 自动机的接受运行,并且具有可靠的等式演算。对于有理数逻辑,我们证明:在原子命题由有限个区间并解释的区间模型上,任意固定公式都可以在多项式时间内求值。 最后,我们用位置和实时间表示定时词,并比较两种窗口几何结构;对于矩形窗口,仅使用两个共享长度,就能在有限定时词上得到不可判定性。
更新时间: 2026-11-19 12:53:29
领域: cs.LO,cs.AI,cs.FL
The Missing Complement: State-Conditioned Minimal Sufficient Evidence for Coding Agents
Retrieval assembles repository context by ranking passages for relevance to the current query. A coding agent halfway through an issue has already read much of what such a ranker returns. Relevance is scored per passage, but sufficiency belongs to the set: independently scored passages can fill the budget with support for one requirement while another goes unmet. We formulate state-conditioned minimal sufficient evidence recovery: given a captured agent state, recover a compact evidence combination supplying what its next decision still lacks. SERBench measures this on 500 held-out states from 45 repositories, recording what the agent has seen, crediting only sets that satisfy every annotated evidence requirement of the current decision, and separating set recovery from candidate discovery. MSS-Complement treats acquisition as set construction, not ranking. Three semantic calls propose a jointly sufficient set, search for what it lacks, and return 4-8 intact source units within 6,144 tokens. One configuration, fixed on calibration data, recovers a complete set for 73.0% of those states at five items and 80.6% at eight, against 61.4% and 72.4% for Qwen3 embedding with reranking. A matched control ranking by similarity alone recovers fewer complete sets, placing the margin over it in the set-level policy, not the computation. The lead persists from frozen repository source with no gold-derived pool. On AMA-Bench it answers from a 76.2% smaller answer prompt, with accuracy 2.08 points above that benchmark's own memory agent. Removing one required group from a complete set costs repair-localization precision under two executors. Retrieval for agents is better posed as recovering what a decision lacks than re-ranking what an issue resembles.
Updated: 2026-11-19 12:47:39
标题: 缺失的补充:面向编码代理的状态条件最小充分证据
摘要: 检索通过对与当前查询相关的段落进行排序来组装代码库上下文。一个正在处理问题、进展到一半的编码代理,往往已经读过此类排序器返回的大部分内容。相关性按段落评分,但充分性属于集合:独立评分的段落可能耗尽预算,却只为某一项要求提供支持,而另一项要求仍未得到满足。我们提出状态条件下的最小充分证据恢复问题:给定捕获的代理状态,恢复一个紧凑的证据组合,以补足其下一步决策仍然缺失的信息。SERBench 在来自45个代码库的500个留出状态上对此进行测量,记录代理已经看过的内容,仅认可满足当前决策所有标注证据要求的集合,并将集合恢复与候选发现分开评估。MSS-Complement 将获取过程视为集合构建,而非排序。三个语义调用分别提出一个联合充分的集合、搜索其缺失内容,并在6144个词元以内返回4至8个完整的源代码单元。在校准数据上固定的一种配置中,对于这些状态,在选取5个条目时可为73.0%的状态恢复完整集合,在选取8个条目时可达80.6%;相比之下,使用重排序的 Qwen3 嵌入模型对应的比例为61.4%和72.4%。通过仅按相似度进行排序的匹配对照实验恢复的完整集合更少,这表明其优势来自集合层面的策略,而非计算量。即使使用未经过修改的代码库源文件、且不提供从标准答案派生的候选池,这一领先优势仍然存在。在 AMA-Bench 上,它使用小76.2%的答案提示词进行回答,准确率比该基准自身的记忆代理高出2.08个百分点。从完整集合中移除一个必需组,会导致两个执行器下的修复定位精度下降。对于代理而言,检索更适合被表述为恢复决策所缺失的内容,而不是重新排序与问题相似的内容。
更新时间: 2026-11-19 12:47:39
领域: cs.IR,cs.AI,cs.CL
Fixing the Twin, Not the Detector: Sim-to-Real Roadside LiDAR Detection from Digital-Twin Data
Roadside LiDAR detectors are expensive to train on real labels, and digital twins promise to replace these labels, but a detector trained on a twin meets a different sensor, different objects and different annotation conventions on the real site. We describe the pipeline that placed first in the LUMPI track of the UrbanTwin Sim2Real LiDAR Challenge (IEEE BigData 2026 Cup, 0.5541 combined score) and fifth on its V2X-Real track (0.8102). Every detector is a CenterPoint model trained only on synthetic data, on a single 8 GB laptop GPU. Most of the gain came from correcting differences between the twin and the real site rather than from the detector. We align the twin's coordinates, point density and box convention with the test sensor, generate the pedestrians and riders that the twins lack, plus street clutter as unlabeled negatives, and rebuild twin objects at real size and real point density. A non-learned resampling to the per-cell point density of unlabeled real frames lifts LUMPI realism from 0.589 to 0.947, against 0.949 between real frames. Label-free post-processing then exploits what a fixed roadside sensor guarantees: static structures recur in every frame, and real objects have characteristic point statistics. Reporting the validation and test gain of each component side by side, we find that corrections of systematic sim-to-real differences transfer to the test set, typically keeping a quarter to three quarters of their validation gain, while choices that fit the few objects of a validation set do not.
Updated: 2026-11-19 12:45:33
标题: 修复孪生体,而非探测器:基于数字孪生数据的从仿真到真实的路侧激光雷达检测
摘要: 路侧激光雷达检测器在真实标注数据上训练成本高昂,而数字孪生有望取代这些标注;然而,在孪生环境上训练的检测器面对真实场地时,会遇到不同的传感器、不同的物体以及不同的标注规范。我们介绍了在 UrbanTwin Sim2Real LiDAR Challenge(IEEE BigData 2026 Cup)LUMPI赛道中获得第一名(综合得分0.5541)、并在其V2X-Real赛道中获得第五名(0.8102)的完整流程。所有检测器均为仅使用合成数据训练的CenterPoint模型,训练仅在一块8 GB显存的笔记本电脑GPU上完成。大部分性能提升并非来自检测器本身,而是来自对孪生环境与真实场地之间差异的修正。我们将孪生环境的坐标、点密度和边界框规范与测试传感器对齐,生成孪生环境中缺失的行人和骑行者,并加入作为未标注负样本的街道杂波,同时按照真实尺寸和真实点密度重建孪生对象。将点云以非学习方式重采样至未标注真实帧的逐单元点密度后,LUMPI的真实感得分由0.589提升至0.947,而真实帧之间的得分为0.949。随后,利用无标签后处理机制,进一步挖掘固定路侧传感器所带来的特性:静态结构会在每一帧中重复出现,而真实物体具有特征性的点统计特征。通过并列报告每个组件在验证集和测试集上的增益,我们发现,对系统性仿真到真实差异的修正能够迁移到测试集,通常可保留其验证集增益的四分之一至四分之三;相比之下,那些针对验证集少量物体进行拟合的选择则无法实现这种迁移。
更新时间: 2026-11-19 12:45:33
领域: cs.CV,cs.LG
A General Harness for Protein Foundation Model Fitness Prediction
Accurate fitness prediction is central to protein engineering and understanding sequence-function relationships. With advances in deep learning, protein foundation models (PFMs) have become widely used for this task. Recent analyses, however, show that these models share preferences reflecting their training corpora, while unreliable inputs can further distort fitness predictions. Family-specific evolutionary evidence and structural context can help address these limitations by providing complementary constraints on model scores, motivating VenusREM-Harness (VRH), a general, model-agnostic, training-free Retrieval-Enhanced Mutation harness. It fuses frozen model scores with multiple sequence alignment (MSA) evidence according to model uncertainty, then applies gated background correction and score shrinkage based on structural confidence and solvent exposure. Across 1,211 assays and 3.1 million measured variants from ProteinGym, VenusMutHub, and the newly curated viral benchmark VenusViroHub, all 71 configurations improve Spearman correlation on all 3 benchmarks by 0.073 on average, with broad gains across 5 metrics. Extended analyses relate retrieval gains to model-MSA preference differences, assess domain-level gains and immune-escape cases, and quantify computational speedups. Built with VRH, VenusREM2 is the first to rank highest in all function, taxon, MSA-depth, and mutation-depth categories, with a ProteinGym Average Spearman of 0.556, 0.038 above the prior best.
Updated: 2026-11-19 12:44:46
标题: 用于蛋白质基础模型适应性预测的通用框架
摘要: 准确预测适应度对于蛋白质工程以及理解序列—功能关系至关重要。随着深度学习的发展,蛋白质基础模型(PFM)已被广泛用于这一任务。然而,近期分析表明,这些模型具有反映其训练语料偏好的共同倾向,而不可靠的输入还会进一步扭曲适应度预测。家族特异性的进化证据和结构背景能够通过为模型评分提供互补约束来缓解这些局限,由此促成了 VenusREM-Harness(VRH)的提出——一种通用、与模型无关且无需训练的检索增强突变框架。该框架依据模型不确定性,将冻结模型的评分与多序列比对(MSA)证据融合;随后根据结构置信度和溶剂暴露程度,应用门控式背景校正和评分收缩。在来自 ProteinGym、VenusMutHub 以及新近整理的病毒基准数据集 VenusViroHub 的 1,211 项测定和 310 万个实测变体上,全部 71 种配置在 3 个基准上均提升了 Spearman 相关性,平均提升 0.073,并且在 5 项指标上均取得广泛增益。扩展分析将检索带来的增益与模型—MSA 偏好差异联系起来,评估了结构域层面的增益和免疫逃逸案例,并量化了计算速度的提升。基于 VRH 构建的 VenusREM2 首次在所有功能、分类单元、MSA 深度和突变深度类别中均排名最高,其 ProteinGym 平均 Spearman 相关系数达到 0.556,比此前最佳结果高出 0.038。
更新时间: 2026-11-19 12:44:46
领域: cs.AI,q-bio.QM
SEOYUN: Refusal-Inducing Exam Documents for AI-Glasses Pipelines
Camera-equipped glasses can convert an examination page into a query to a vision-language model (VLM). Device detection addresses possession; a complementary question is whether an examination document can reduce the usefulness of an unauthorized capture. We present SEOYUN, an application-specific framework for refusal-inducing exam documents, with optical and encoder-level interventions as extensions. We use reverse jailbreaking to describe the direction of the objective: inducing abstention rather than bypassing refusal. Refusal induction and defensive visual prompt injection already have precedents; our contribution is a threat model, analytical limits, and an evaluation protocol for examination use. We distinguish refusal from correct-answer leakage, show why removing an added dummy option is not itself a reduction in the original answer space, and derive a sampling comparison under explicitly stated camera assumptions. The protocol separates digital, simulated, and physical inputs and requires held-out evaluation after subject-specific selection. A local CSAT candidate corpus and rendering harness have been prepared, but this version reports no model-performance measurements, physical validation, or human-subject results. Accordingly, SEOYUN is a research framework, not a validated defense or a basis for allegations against individuals.
Updated: 2026-11-19 12:43:31
标题: SEOYUN:用于智能眼镜处理流程的诱导拒答考试文档
摘要: 配备摄像头的眼镜可以将试卷页面转换为发给视觉语言模型(VLM)的查询。设备检测解决的是是否持有设备这一问题;与之互补的问题是,考试文档能否降低未经授权拍摄内容的有效性。我们提出 SEOYUN,这是一种面向特定应用、用于诱导拒答的考试文档框架,并将光学层面和编码器层面的干预作为扩展。我们用“反向越狱”来描述这一目标方向:诱导模型弃答,而不是绕过拒答。拒答诱导和防御性视觉提示注入已有先例;我们的贡献在于提出威胁模型、分析其局限,并制定适用于考试场景的评估协议。我们区分拒答与正确答案泄露,说明移除一个新增的虚拟选项本身并不会缩小原有答案空间,并在明确陈述摄像头假设的前提下推导采样比较方法。该协议将数字输入、模拟输入和物理输入分开,并要求在按科目进行选择后,使用留出的数据进行评估。我们已经准备了一个本地 CSAT 候选语料库和渲染测试工具,但本版本未报告任何模型性能测量、物理验证或人体受试者结果。因此,SEOYUN 是一个研究框架,而非经过验证的防御方案,也不能作为指控个人的依据。
更新时间: 2026-11-19 12:43:31
领域: cs.AI
The Delayed Societal Cost of Unfairness
Fair machine learning typically evaluates the societal costs of a decision policy -- the loss incurred by the decision-maker (DM) and the unfair distribution of costs among demographic groups of decision-subjects (DS) -- on static data, where reducing one often comes at the expense of the other. Yet decisions change the populations on which they act, and prior work has shown that fairness interventions designed on static data may fail to benefit, or even harm, the disadvantaged group over time. We investigate a complementary question: When can a policy that is Pareto-optimal on pre-deployment data be outperformed by a fairer policy once each is evaluated on the population it induces, reducing costs for one stakeholder without increasing them for the other? In a setting where qualification scores evolve in response to binary decisions and their outcomes, we show that under Rawlsian fairness, which never lowers any group's acceptance rate, placing sufficiently high weight on fairness reduces societal costs whenever accepting disadvantaged DS at the DM's break-even point leaves them in a state less costly to the DM than rejecting them. Under egalitarian fairness, which may lower the advantaged group's acceptance rate, this additionally requires the reduction in DM loss on the disadvantaged group to outweigh the increase on the advantaged group. Under both fairness notions, however, when DM loss is accuracy-based, improvements in the post-deployment population may arise from declining DS qualification, revealing that gains for the DM do not necessarily translate into better outcomes for DS. Our results show that policy-induced population dynamics can overturn apparent performance-fairness trade-offs, allowing fairer policies to reduce the delayed societal costs of decision-making.
Updated: 2026-11-19 12:39:43
标题: 不公平的延迟社会成本
摘要: 公平机器学习通常在静态数据上评估决策政策所造成的社会成本——即决策者(DM)承担的损失,以及决策对象(DS)各人口群体之间不公平的成本分配——而降低其中一项往往会以牺牲另一项为代价。然而,决策会改变其所作用的人群,已有研究表明,基于静态数据设计的公平干预措施,随着时间推移可能无法使弱势群体受益,甚至可能对其造成伤害。我们探讨一个互补性问题:当分别在各项政策所诱导的人群上进行评估时,一个在部署前数据上帕累托最优的政策,何时会被一个更公平的政策超越,从而在不增加一方利益相关者成本的情况下,降低另一方的成本?在一个资格评分会根据二元决策及其结果动态变化的情境中,我们表明,在罗尔斯式公平标准下——该标准从不降低任何群体的接受率——只要对公平赋予足够高的权重,并且在决策者的盈亏平衡点接受弱势决策对象会使其处于对决策者而言比拒绝更低成本的状态,社会成本就会降低。在平等主义公平标准下——该标准可能降低优势群体的接受率——还需要满足一个额外条件:弱势群体决策者损失的减少幅度必须超过优势群体损失的增加幅度。然而,在这两种公平标准下,当决策者的损失以准确性为基础时,部署后的群体状况得到改善可能源于决策对象资格水平的下降,这表明决策者收益并不一定会转化为决策对象更好的结果。我们的研究结果表明,政策诱导的人群动态可能颠覆表面上的性能—公平权衡,使更公平的政策能够降低决策所产生的延迟社会成本。
更新时间: 2026-11-19 12:39:43
领域: cs.LG
Serialization Tax in Shared-Latent Exchangeable Decisions
Accurate item probabilities can produce inaccurate group-level decisions. A system may score each item separately, yet act on whether enough hidden items succeed: show a slate, defer a panel decision, or inspect a batch. When items share an uncertain latent state, independent marginalization preserves means but removes dependence from the aggregate posterior. We call this error the serialization tax. For binary items sharing one success rate, classical convex-order comparisons give a more dispersed exact count law than any independent completion with the same total mean. We quantify variance and total-variation gaps, derive threshold separation under margin conditions, and connect posterior approximation to decision regret. Separate results cover non-binary outcomes, heterogeneous items, and sufficient posterior resolution. TaxScore identifies large hidden blocks with unresolved uncertainty near a decision boundary for routing to richer posterior heads. On pre-specified, hidden-target-free MovieLens 1M/10M audits, existing shared-latent heads improve high-score negative log-likelihood (NLL)/utility from 0.673/0.696 to 0.629/0.723 and from 0.670/0.691 to 0.639/0.715. Routing gives 0.006--0.012 full-population utility gains, with matched controls identifying their sources. Our code is available at https://github.com/SiminChang/Serialization-Tax-in-Shared-Latent-Exchangeable-Decisions.
Updated: 2026-11-19 12:39:21
标题: 共享潜变量可交换决策中的序列化税
摘要: 准确的项目概率也可能导致不准确的群体层面决策。系统可以分别评估每个项目,却依据是否有足够多的隐藏项目成功来采取行动:展示一个候选列表、推迟小组决策,或检查一批项目。当项目共享一个不确定的潜在状态时,独立边际化能够保留均值,却会从聚合后验中消除依赖关系。我们将这一误差称为“序列化税”。对于共享同一个成功率的二元项目,经典的凸序比较表明,与具有相同总均值的任何独立补全相比,精确计数分布更加分散。我们量化了方差差距和总变差差距,在间隔条件下推导了阈值分离结果,并将后验近似与决策遗憾联系起来。我们还分别给出了适用于非二元结果、异质项目以及充足后验分辨率的结果。TaxScore 能够识别在决策边界附近存在尚未解析的不确定性且包含大规模隐藏区块的情形,并将其路由至更丰富的后验预测头。在预先指定、无需隐藏目标的 MovieLens 1M/10M 审计中,现有的共享潜变量预测头将高分样本的负对数似然(NLL)/效用分别从 0.673/0.696 提升至 0.629/0.723,以及从 0.670/0.691 提升至 0.639/0.715。路由机制使全体样本的效用提高了 0.006--0.012,匹配的对照实验则确定了这些提升的来源。我们的代码可在 https://github.com/SiminChang/Serialization-Tax-in-Shared-Latent-Exchangeable-Decisions 获取。
更新时间: 2026-11-19 12:39:21
领域: cs.AI
ForeSeek: Foresight-Driven Reasoning for Long-Form Video Understanding
Long-form video understanding, as a fundamental yet crucial vision task, is being revolutionized by multimodal large language model (MLLM)-based video agents. However, the retrieval-driven nature inherent to these agents creates a significant bottleneck, forcing them to reactively fetch clips based on local saliency without a global temporal plan. To address this, we present ForeSeek, a foresight-driven video agent that transforms long-video reasoning from reactive retrieval into predictive exploration. Rather than blindly probing the timeline, ForeSeek forms visually grounded expectations over unseen temporal regions, verifies them through targeted observations, and continuously refines its search based on emerging evidence, where failed expectations serve as informative signals for principled backtracking. Furthermore, we develop a two-stage training framework that equips MLLMs with foresight-guided reasoning and efficient decision making. Extensive experiments on five long-video benchmarks demonstrate that ForeSeek consistently improves the efficiency--accuracy trade-off of long-video reasoning, achieving competitive or superior accuracy while observing $2.5$--$4.4\times$ fewer frames than the strongest search-based agent. Code is available at https://github.com/harry0021/ForeSeek
Updated: 2026-11-19 12:37:52
标题: ForeSeek:面向长视频理解的前瞻性推理
摘要: 长视频理解作为一项基础且至关重要的视觉任务,正被基于多模态大语言模型(MLLM)的视觉代理彻底改变。然而,这类代理固有的检索驱动特性造成了显著瓶颈:它们缺乏全局时间规划,只能依据局部显著性被动地获取视频片段。为此,我们提出 ForeSeek,一种由前瞻性驱动的视频代理,将长视频推理从被动检索转变为预测式探索。ForeSeek 不再盲目地探查时间线,而是针对尚未观察的时间区域形成具有视觉依据的预期,通过有针对性的观测对其进行验证,并根据不断出现的证据持续优化搜索;其中,未能实现的预期可作为有价值的信号,支持有原则的回溯。此外,我们设计了一个两阶段训练框架,使多模态大语言模型具备前瞻性引导的推理能力和高效的决策能力。在五个长视频基准上的广泛实验表明,ForeSeek 始终能够改善长视频推理中的效率—准确率权衡:在仅观察强搜索型代理所需帧数的 $1/2.5$—$1/4.4$ 的情况下,仍能达到具有竞争力或更高的准确率。代码见:https://github.com/harry0021/ForeSeek
更新时间: 2026-11-19 12:37:52
领域: cs.AI
Classical Energies Learn to Reason 1,000x Faster than Looped Models
Looped models have emerged as a prominent paradigm for reasoning, with successes on simple reasoning puzzles such as Sudoku-Extreme and Maze-Unique. However, these models can be unstable, slow to train, and use many parameters and FLOPs to solve simple puzzles. Descent on an energy not only mitigates these issues but also offers advantages: built-in early stopping, compute that adapts to problem difficulty, fast training without differentiating through a solver, and interpretable weights that learn the constraints of the puzzle. Here we demonstrate this with a learned version of Hopfield & Tank's energy from the 80s, which we term CRAM, solves 99.996% of Sudoku-Extreme and 100% of Maze-Unique test puzzles after 42 ms and 132 ms of training on one GPU, at least 1,000x faster than looped models on these tasks. CRAM also matches baseline looped models at their highest accuracy on Sudoku-Extreme using at least 282x fewer inference FLOPs. Our work suggests two things. First, that energies are an extremely promising direction for training reasoning from data. Second, a caution against using trivially solvable benchmarks like Sudoku and Maze to test the scalability of looped reasoning techniques.
Updated: 2026-11-19 12:37:09
标题: 经典能量模型学会推理的速度比循环模型快1000倍
摘要: 循环模型已成为推理领域的一种重要范式,并在数独极限版(Sudoku-Extreme)和迷宫唯一解(Maze-Unique)等简单推理谜题上取得了成功。然而,这些模型可能不稳定、训练速度慢,而且需要大量参数和浮点运算才能解决简单谜题。基于能量函数进行下降不仅能够缓解这些问题,还具有以下优势:内置的提前停止机制、能够根据问题难度自适应计算量、无需对求解器进行求导即可快速训练,以及可解释的权重,这些权重能够学习谜题的约束条件。在此,我们展示了这一方法的效果:基于20世纪80年代Hopfield和Tank提出的能量函数学习得到的一个版本(我们称之为CRAM),在单个GPU上经过42毫秒和132毫秒的训练后,分别解决了数独极限版测试题的99.996%和迷宫唯一解测试题的100%,在这些任务上至少比循环模型快1,000倍。在数独极限版上,CRAM还以至少少282倍的推理浮点运算量,达到了基线循环模型的最高准确率。我们的工作提出了两点启示。第一,能量函数是从数据中训练推理能力的一个极具潜力的方向。第二,在使用数独和迷宫这类可以轻易求解的基准测试来评估循环推理技术的可扩展性时,应当保持谨慎。
更新时间: 2026-11-19 12:37:09
领域: cs.AI,cs.LG
Detecting Formation-Preserving GNSS Spoofing of UAV Swarms through Transmitter Parallax in Pseudorange and Doppler
Swarms of unmanned aerial vehicles (UAVs) detect Global Navigation Satellite System (GNSS) spoofing by checking the drones' reported positions against their known formation. Formation-preserving spoofing evades this check: in GNSS-WASP, one transmitter per satellite, a few kilometres away, shifts the whole swarm while keeping its formation. We show that such an attack still leaves a trace below the position level. Because the transmitters are close, each drone sees them under a slightly different angle, and this parallax bends the signal arrival times across a 90 m swarm by 20-40 cm for a transmitter at 5 km, whatever delays the attacker applies. We propose a likelihood ratio test that reads this trace from the pseudoranges and Doppler every drone already measures, with all clocks and attacker delays unknown and no extra antennas. In simulations with real GPS and Galileo orbits and white receiver noise, 16 drones detect GNSS-WASP at 5 km in 13-60% of 10 s windows in straight flight and in every window during a formation turn with a precise Doppler receiver, where the countermeasure proposed with GNSS-WASP detects at most 5%. The same test also catches single-transmitter and ground-array spoofing.
Updated: 2026-11-19 12:35:04
标题: 通过伪距与多普勒中的发射机视差检测保持编队的无人机集群 GNSS 欺骗攻击
摘要: 无人机集群通过将无人机报告的位置与其已知编队进行比对,检测全球导航卫星系统(GNSS)欺骗。保持编队的欺骗攻击可以规避这种检查:在 GNSS-WASP 中,每颗卫星对应一个发射机,发射机位于数公里之外,在保持整个集群编队不变的同时使其整体发生位移。我们表明,这种攻击在位置层面以下仍会留下痕迹。由于发射机距离较近,每架无人机观测到它们的角度会略有不同,这种视差会使信号到达时间在一个 90 米宽的集群内产生 20–40 厘米的弯曲(对于距离 5 千米的发射机而言),无论攻击者施加何种延迟都无法消除。我们提出了一种似然比检验,利用每架无人机本已测量的伪距和多普勒信息读取这一痕迹;该方法无需已知各时钟和攻击者延迟,也不需要额外天线。在采用真实 GPS 和伽利略卫星轨道以及白噪声接收机噪声的仿真中,16 架无人机在直线飞行时,能够在 10 秒时间窗中的 13%–60% 窗口内检测出距离 5 千米的 GNSS-WASP 攻击;在编队转弯过程中,使用精确多普勒接收机时则能在每个时间窗内检测到攻击,而 GNSS-WASP 提出的反制措施最多只能检测到 5%。同一检验还能够识别单发射机欺骗和地面阵列欺骗。
更新时间: 2026-11-19 12:35:04
领域: cs.CR,eess.SP
FrontierReplay: Split-Free Exact Prefix Caching for Hybrid Language Models
Hybrid language models combine self-attention with recurrent layers whose in-place state updates restrict prefix reuse to exact saved positions. Saving states on a coarse grid wastes reusable prefixes, whereas existing fine-grained exact caches must cut the prefill forward pass at each mid-prompt checkpoint, adding scheduler steps that outweigh the reuse gains under load. We observe that across multi-turn chat, agent loops, document question answering, and tree search, prefix reuse almost always ends at structural boundaries predictable in advance, such as turn ends and known branch points. We present FrontierReplay, a prefix caching system that materializes exact checkpoints at these boundaries without cutting the prefill. While the forward pass runs uncut, FrontierReplay logs a short window of recurrent-layer inputs and invokes a cross-layer, state-only replay kernel to build the target state 6-37x cheaper per token than full recomputation without host synchronization. A frontier-aware retention policy prioritizes active anchors and proven branches while lending dead checkpoint slots to the attention KV cache. Across diverse hybrid architectures, model scales, and workloads, FrontierReplay delivers clear gains over existing exact caches, lowering median time to first token (TTFT) by 16-89% (up to 8.9x), raising 80% service-level objective (SLO) capacity by up to 1.73x, and improving goodput by up to 4.26x (3.67x at larger scales). Compared with approximate replay methods, FrontierReplay delivers up to 1.54x higher goodput while preserving exact task accuracy, avoiding the up to 17% accuracy drop suffered by approximation on long contexts.
Updated: 2026-11-19 12:34:25
标题: FrontierReplay:适用于混合语言模型的无分割精确前缀缓存
摘要: 混合语言模型将自注意力与循环层相结合,而循环层的原地状态更新使前缀复用受限于已精确保存的位置。粗粒度网格上的状态保存会浪费可复用的前缀;现有的细粒度精确缓存则必须在每个提示中途检查点处切断预填充前向计算,增加的调度步骤在高负载下会抵消复用带来的收益。 我们观察到,在多轮对话、智能体循环、文档问答和树搜索中,前缀复用几乎总是在可预先预测的结构边界处结束,例如轮次结束位置和已知分支点。为此,我们提出 FrontierReplay,一种前缀缓存系统,能够在这些边界处生成精确检查点,而无需切断预填充过程。在前向计算不间断运行的同时,FrontierReplay 记录循环层输入的一个短窗口,并调用跨层、仅处理状态的重放内核来构建目标状态;与完整重新计算相比,该方法每个 token 的成本降低了 6 至 37 倍,且无需与主机同步。面向前沿的保留策略优先保留活跃锚点和已验证分支,同时将无效检查点所占的槽位借给注意力 KV 缓存。 在多种混合架构、模型规模和工作负载上,FrontierReplay 相较现有精确缓存均取得了显著提升:将首 token 时间(TTFT)的中位数降低 16% 至 89%(最高提升至 8.9 倍),使达到 80% 服务级目标(SLO)的容量最高提升 1.73 倍,并将有效吞吐量最高提升 4.26 倍(在更大规模下提升 3.67 倍)。与近似重放方法相比,FrontierReplay 在保持任务精度完全不变的同时,有效吞吐量最高提升 1.54 倍,避免了近似方法在长上下文中造成的最高 17% 的精度下降。
更新时间: 2026-11-19 12:34:25
领域: cs.LG
Does the Workspace Do the Work? A Causal Protocol for Verifying Global-Workspace Computation in a Language Model
Global Workspace Theory (GWT), a leading theory of consciousness, holds that information becomes conscious when it is broadcast to specialized processes that use it. Building a workspace into a network does not reveal what the trained network computes with it: a module that reports an answer may have combined a broadcast message with its own knowledge, or merely forwarded an answer computed elsewhere, and task accuracy and ablation cannot tell these apart. We introduce a causal protocol that identifies who computes when modules communicate. Its central test transplants a message from another input, chosen so that ignoring, relaying and recombining it predict three different answers. On networks built to relay or to recombine, the test assigns the right computation in every case. Among trained workspace models it finds all three outcomes: one leaves its broadcast nearly unused, and of two models that differ only in their training data, one relays and the other recombines. In AFGW, a language model whose modules communicate only through a learned workspace, a transplanted message yields the answer that recombination predicts in 97% of cases, and its content acts by redirecting what the receiver retrieves from its own memory. The tests carry over to other communication designs and to a known interface of a pretrained Transformer, turning GWT's central claim into a testable property of trained models.
Updated: 2026-11-19 12:33:35
标题: 工作空间是否在发挥作用?验证语言模型中全局工作空间计算的因果协议
摘要: 全球工作空间理论(Global Workspace Theory,GWT)是意识研究领域的主流理论之一。该理论认为,当信息被广播给会使用它的专门化处理过程时,这些信息便会成为有意识的。将工作空间构建到网络中,并不能揭示经过训练的网络利用工作空间计算了什么:一个报告答案的模块可能将广播消息与自身知识结合起来,也可能只是转发在其他地方计算出的答案,而任务准确率和消融实验无法区分这两种情况。 我们提出了一种因果协议,用于确定模块在通信过程中由谁执行计算。其核心测试是从另一个输入中移植一条消息,并选择该消息,使得忽略、转发和重新组合这条消息分别会预测出三个不同的答案。在专门构建为转发或重新组合消息的网络上,该测试在每种情况下都能判定出正确的计算方式。在经过训练的工作空间模型中,该测试发现了全部三种结果:其中一个模型几乎不使用其广播内容;另外两个模型仅在训练数据上有所不同,其中一个转发消息,另一个则重新组合消息。 在 AFGW 中——这是一个模块之间仅通过学习到的工作空间进行通信的语言模型——移植一条消息后,97% 的情况下得到的答案符合重新组合机制的预测;而且,消息的内容通过重新引导接收者从自身记忆中提取的信息来发挥作用。这些测试同样适用于其他通信设计以及预训练 Transformer 的一个已知接口,从而将 GWT 的核心主张转化为经过训练的模型中可检验的性质。
更新时间: 2026-11-19 12:33:35
领域: cs.LG,cs.AI,q-bio.NC
When Agents Play Differently: Localizing Human--Agent Behavioral Divergence with Conditional Distributional Testing
Evaluating whether artificial agents behave like humans requires comparing not just average outcomes but entire behavioral distributions across diverse contexts. We propose a stratified framework that computes nonparametric discrepancy statistics within contextual cells, and discovers subgroup rules identifying where agent behavior departs from human play. We show that session-level metrics dominated by win/loss outcomes offer little signal beyond mean comparisons, whereas process-level metrics such as move efficiency reveal genuine behavioral differences. Applied to a commercial match-3 game, it uncovers patterns invisible to aggregate metrics: a playtesting bot is diverging substantially from humans in certain game modes, while showing no detectable divergence in others. We release our implementation as open source to support reproducibility and adoption.
Updated: 2026-11-19 12:29:35
标题: 当智能体行为不同时:利用条件分布检验定位人类与智能体的行为差异
摘要: 评估人工智能体的行为是否类似人类,不仅需要比较平均结果,还需要比较其在多种情境下的完整行为分布。我们提出了一种分层框架,在各个情境单元内计算非参数差异统计量,并发现能够识别智能体行为偏离人类游戏方式情形的子群体规则。我们表明,以胜负结果为主导的会话级指标,除均值比较之外几乎无法提供更多信息;而移动效率等过程级指标则能揭示真实的行为差异。将该框架应用于一款商业三消游戏后,我们发现了汇总指标无法捕捉的模式:一个游戏测试机器人在某些游戏模式下与人类存在显著偏离,而在其他模式下则未检测到明显偏离。我们将实现代码开源,以支持可复现性和推广应用。
更新时间: 2026-11-19 12:29:35
领域: cs.AI
System-One RSI: Building Muscle Memory for Interactive Agents through Guided Practice
Reasoning models provide strong multimodal task understanding but struggle with sub-second control because deliberation increases decision latency. Fast decision models can meet the response window, yet prompting and few-shot examples do not readily provide the fine-grained experience required by a new task. Inspired by coached motor learning, this paper presents System-One Recursive Self-Improvement (System-One RSI), which couples two loops. The high-frequency online inner loop is an Observe, Orient, Decide, Act (OODA) cycle: a decision model maps each visual observation and task question to structured judgments, and a decision tree converts them into timed actions without invoking a reasoning model. The offline outer loop is a recursive improvement cycle carried out by a team of reasoning agents. The team revises the decision-model prompt and decision tree, captures interaction records, derives supervision from those records, and trains or deploys updated model parameters. The improved system then returns to the environment and generates the experience for the next round, consolidating learned distinctions as external muscle memory. The framework operates with a small number of real episodes, without expert demonstrations, environment modification, sandboxing, or parallel simulation. Experiments in Snake, Zenless Zone Zero, and Black Myth: Wukong use a 27B decision model. Mean Snake score increases from 1.30 to 7.35. In an evaluated scenario of Zenless Zone Zero, median completion time decreases by 8.4%. In an evaluated combat scenario of Black Myth: Wukong, the evasive policy achieves 11 times the mean survival time of a stationary reference, while the offensive policy win rate rises from 0% to 66.7% across the evaluated configurations.
Updated: 2026-11-19 12:27:36
标题: System-One RSI:通过引导式练习为交互式智能体建立肌肉记忆
摘要: 推理模型具备强大的多模态任务理解能力,但由于深思熟虑会增加决策延迟,因此难以胜任亚秒级控制。快速决策模型能够满足响应时间窗口,但仅靠提示词和少量示例,难以为新任务提供所需的细粒度经验。受教练式运动学习启发,本文提出系统一递归自我改进(System-One Recursive Self-Improvement,System-One RSI),将两个循环结合起来。高频在线内循环采用观察、定位、决策、行动(Observe, Orient, Decide, Act,OODA)流程:决策模型将每次视觉观测和任务问题映射为结构化判断,决策树则在无需调用推理模型的情况下,将这些判断转换为具有时间安排的动作。离线外循环由推理智能体团队执行递归改进流程。该团队修订决策模型提示词和决策树,记录交互过程,从这些记录中提取监督信号,并训练或部署更新后的模型参数。改进后的系统随后返回环境,生成下一轮所需的经验,将学到的区分能力固化为外部肌肉记忆。该框架只需少量真实交互回合即可运行,无需专家示范、修改环境、沙盒或并行模拟。在《贪吃蛇》、 《绝区零》和《黑神话:悟空》上的实验均采用27B决策模型。《贪吃蛇》的平均得分从1.30提升至7.35。在《绝区零》的一项评估场景中,完成时间中位数降低了8.4%。在《黑神话:悟空》的一项评估战斗场景中,闪避策略的平均存活时间达到静止参考策略的11倍,而在所评估的各项配置中,进攻策略的获胜率从0%提升至66.7%。
更新时间: 2026-11-19 12:27:36
领域: cs.AI
Mechanistic Interpretability Needs Philosophy
Mechanistic interpretability (MI) aims to explain how trained neural networks work by uncovering their underlying mechanisms. As the field grows in influence, it is increasingly important to examine not just models themselves, but the assumptions, concepts and explanatory strategies implicit in MI research. We argue that mechanistic interpretability needs philosophy as an ongoing partner in clarifying its concepts, refining its methods, and navigating the epistemic and ethical complexities of interpreting AI systems. There is significant unrealised potential for progress in MI to be gained through deeper engagement with philosophers and philosophical frameworks. Taking three open problems from the MI literature as examples, this paper illustrates the value philosophy can add to MI research, and outlines a path toward deeper interdisciplinary dialogue.
Updated: 2026-11-19 12:26:25
标题: 机械可解释性需要哲学
摘要: 机制可解释性(MI)旨在通过揭示训练好的神经网络所蕴含的机制,解释其工作方式。随着该领域影响力不断扩大,审视的不应只是模型本身,还应包括机制可解释性研究中隐含的假设、概念和解释策略。我们认为,机制可解释性需要哲学作为持续的合作伙伴,以澄清其概念、完善其方法,并应对解释人工智能系统时所涉及的认识论与伦理复杂性。通过更深入地与哲学家及哲学框架开展交流,机制可解释性仍有巨大的、尚未实现的进步潜力。本文以机制可解释性文献中的三个开放问题为例,阐明哲学能够为机制可解释性研究带来的价值,并勾勒出深化跨学科对话的路径。
更新时间: 2026-11-19 12:26:25
领域: cs.CL,cs.AI
AI agents can redesign engineering parts with more than a thousand CAD parameters and nonlinear simulations
Simulation-driven design of real engineering components has to meet three conditions at once. It runs on few solves, since a nonlinear finite-element simulation of a 3D part takes hours; its design space has many values, the hundreds to thousands of values of the part's CAD model; and a better design often needs a redesign, coordinated changes of the part's proportions rather than local polishing of its surface. Automated optimisers meet at most two of these conditions. Classical optimisers, Bayesian or derivative-free, need a person to cut the design down to a few parameters, and on all the values they need far more solves; industrial shape optimisers move every surface node of the mesh in one solve per cycle, but only in small steps that polish rather than redesign. We ask whether a general-purpose large language model (LLM) can meet all three by joining what it knows with what the simulation shows. GPT-6 Astra edits a magnesium stent through a CAD geometry parametrisation of about 1,650 values, with a budget of 15 simulations; every proposal is built in CAD, meshed and simulated with large-deformation plasticity and contact, and the LLM reads the full results of every solve. Within that budget it lowered the objective, a high percentile of the strains in the stent's bends, by 32%; on the same budget, the industrial shape optimiser Tosca improved the original design by a tenth and then stopped improving. An earlier GPT-6 Astra design, 25% lower in the same objective, was checked in an independent, higher-fidelity model of the full deployment with crimping and damage: it was 14% less strained than the original after the full chain, and its most damaged spot began to fail later and carried 63% less damage at full expansion. LLMs can thus join their learned knowledge with simulation data to adjust more than a thousand design values and reach valid designs with real improvements.
Updated: 2026-11-19 12:21:21
标题: 人工智能代理能够重新设计具有一千多个 CAD 参数的工程零部件,并进行非线性仿真
摘要: 由模拟驱动的真实工程部件设计必须同时满足三个条件。由于三维部件的非线性有限元模拟需要数小时,设计过程只能进行少量求解;其设计空间包含大量变量,即部件 CAD 模型中的数百至数千个参数;而更优设计往往需要重新设计,即协调调整部件的比例,而不是对其表面进行局部打磨。自动优化器至多只能满足其中两个条件。无论是经典优化器、贝叶斯优化器还是无导数优化器,都需要人工将设计简化为少数参数;而对于这些参数,它们仍需要进行远多于上述数量的求解。工业形状优化器则在每个循环中通过一次求解移动网格的所有表面节点,但步幅很小,只能进行局部修饰,而非重新设计。我们探讨了通用大语言模型(LLM)能否将其已掌握的知识与模拟结果结合起来,同时满足这三个条件。GPT-6 Astra 通过包含约1650个参数的 CAD 几何参数化模型对镁制支架进行编辑,模拟预算为15次;每个方案都在 CAD 中构建、划分网格,并采用大变形塑性与接触模型进行模拟,且大语言模型会读取每次求解的完整结果。在这一预算内,它将目标函数——支架弯曲部位应变的高分位数——降低了32%;在相同预算下,工业形状优化器 Tosca 仅将原始设计改善了十分之一,随后便不再取得进一步改进。GPT-6 Astra 早期生成的一个设计在相同目标函数上降低了25%,随后在一个独立的高保真模型中进行了验证;该模型模拟了包含压缩和损伤在内的完整展开过程。经过完整流程后,该设计的应变比原始设计低14%,其损伤最严重部位开始失效的时间更晚,并且在完全展开时所承受的损伤减少了63%。因此,大语言模型能够将其学习到的知识与模拟数据结合起来,调整一千多个设计参数,并获得具有实际改进效果的有效设计。
更新时间: 2026-11-19 12:21:21
领域: cs.AI
Reinforcing Few-Step Diffusion Models via Shadow Posterior Matching
Few-step diffusion models are widely deployed for their efficiency. However, reinforcing them with black-box rewards, as is routine for multi-step models, faces two structural challenges. First, a few-step generator is a sampler rather than a score model, so its velocity is not the forward velocity of the generated distribution. Second, it must be anchored to the undistilled teacher, which shares no transitions with it. Existing few-step RL methods handle the latter with a marginal KL to the teacher, but each pays for the former in its reward credit. We propose Shadow Posterior Matching (SPM), which renoises generated samples into shadow inputs and obtains the credit from their shadow posterior. From the KL-regularized reward objective, we derive a regression loss that turns reward values into a reward direction while anchoring the generator's outputs to the teacher and aligning the shadow inputs with the deployed inputs. Applied to 4-step generators, SPM achieves higher rewards with less reward hacking than prior few-step RL methods.
Updated: 2026-11-19 12:18:49
标题: 通过影子后验匹配强化少步扩散模型
摘要: 少步扩散模型因其高效率而得到广泛应用。然而,像对多步模型那样使用黑盒奖励强化少步扩散模型,会面临两个结构性挑战。首先,少步生成器是采样器而非得分模型,因此其速度并不是所生成分布的正向速度。其次,它必须以未经蒸馏的教师模型为锚点,而教师模型与其不共享任何转移过程。现有的少步强化学习方法通过对教师模型施加边际 KL 散度来处理后一个问题,但都必须在奖励归因方面为前一个问题付出代价。我们提出影子后验匹配(Shadow Posterior Matching,SPM)方法:将生成样本重新加噪为影子输入,并从其影子后验中获取奖励归因。基于 KL 正则化的奖励目标,我们推导出一种回归损失,将奖励值转化为奖励方向,同时把生成器的输出锚定到教师模型,并使影子输入与部署时的输入保持一致。在四步生成器上的应用表明,与现有少步强化学习方法相比,SPM 在减少奖励投机的同时获得了更高的奖励。
更新时间: 2026-11-19 12:18:49
领域: cs.LG
Releasing the Inner Jev: A Simple Recipe for Open Decision Models
LLM-based decision-making systems, also called System One models, have recently gained popularity, most notably through Jev (Almeida, 2026). Given a typed input state, a question, and a set of options, they return a calibrated probability for each option in a single forward pass, without text generation. We show that open instruction-tuned LLMs can achieve performance comparable to Jev without any additional training, by reading out answers from letters (A, B, C, etc.) in the model's output logits at the last token position. Next, we propose a simple supervised LoRA fine-tuning recipe that can improve their performance further. We evaluate four instruction-tuned LLMs: Gemma 4 31B, Gemma 4 12B, Qwen3.6-27B, and Qwen3.5-4B. Furthermore, we introduce OpenDecisions, a novel 2,352-question validation dataset designed to reflect the task composition of JevBench (JevBench maintainers, 2026) and which computes a Capability score based on accuracy and calibration. Without fine-tuning, Gemma 4 31B scores 79.6 on OpenDecisions, compared to Jev's 80.1. After fine-tuning, it scores 89.0, outperforming Jev by 8.9 Capability points and on par with the strongest open decision model we evaluated. The same recipe improves the three other models by 7.8 to 15.7 points. On a suite of public decision datasets, our models achieve accuracy and calibration comparable to Jev. Our results show that open LLMs already possess System One capabilities, and with simple fine-tuning they outperform Jev on a wide range of decision tasks. We release our models, training and serving code, OpenDecisions, and DecisionBank, our training dataset consisting of 261,561 decisions.
Updated: 2026-11-19 12:16:23
标题: 释放内在的 Jev:开放式决策模型的简单配方
摘要: 基于大语言模型的决策系统,也称为系统一模型,近年来逐渐受到关注,其中最具代表性的例子是 Jev(Almeida,2026)。给定一个类型化的输入状态、一个问题和一组选项,这类系统能够在一次前向传播中为每个选项返回经过校准的概率,而无需生成文本。我们发现,开放的指令微调大语言模型无需任何额外训练,仅通过读取模型在最后一个词元位置输出 logits 中对应字母(A、B、C 等)的答案,就能达到与 Jev 相当的性能。随后,我们提出了一种简单的有监督 LoRA 微调方案,可进一步提升其性能。 我们评估了四个经过指令微调的大语言模型:Gemma 4 31B、Gemma 4 12B、Qwen3.6-27B 和 Qwen3.5-4B。此外,我们还推出了 OpenDecisions,这是一个包含 2,352 个问题的新型验证数据集,旨在反映 JevBench 的任务构成(JevBench 维护者,2026),并基于准确率和校准度计算能力得分。在未经微调的情况下,Gemma 4 31B 在 OpenDecisions 上取得 79.6 分,而 Jev 为 80.1 分。微调后,其得分提升至 89.0 分,比 Jev 高出 8.9 个能力分,并与我们评估的最强开放决策模型不相上下。同一方案使另外三个模型分别提升了 7.8 至 15.7 分。在一组公开决策数据集上,我们的模型在准确率和校准度方面均达到与 Jev 相当的水平。 我们的结果表明,开放的大语言模型已经具备系统一能力;通过简单的微调,它们能够在广泛的决策任务上超越 Jev。我们将公开发布模型、训练与服务代码、OpenDecisions,以及 DecisionBank——一个包含 261,561 个决策的训练数据集。
更新时间: 2026-11-19 12:16:23
领域: cs.AI
Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees
On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget $B$ must therefore decide how many distinct training states $n$ to use and how many shots $S$ to spend on each. We study this trade-off for binary quantum classifiers whose measurement operator $M$ is learned from the training data and evaluated with fresh measurement outcomes. We prove a distribution-free generalization bound for bounded, $L$-Lipschitz losses with a sample term of order $\sqrt{d/n}$ and a shot term of order $\sqrt{(\log n)/S}$; under $B=nS$ the two terms move in opposite directions. Minimizing a closed-form surrogate of the bound gives the allocation rule $n^* = 2\sqrt{2dB/\log(4B/δ)}$, $S^* = B/n^*$, whose bound value is within 0.1% of the exact numerical minimum on all budgets we evaluate, and a worst-case rate of $B^{-1/4}$. PennyLane simulations with 2- and 4-qubit variational circuits on nine synthetic benchmarks show that the empirical gap stays below the bound in all configurations, although the bound is vacuous at the simulated budgets and becomes non-vacuous only for larger budgets (e.g., $B \gtrsim 5000$ for $d=4$). For a loss that is concave in the score, the empirical gap is U-shaped under a fixed budget and the measured shot contribution matches its analytical value; for the absolute loss, shot noise is unbiased and no shot-limited regime appears. The rule can be used to plan finite-shot evaluations before an experiment is run.
Updated: 2026-11-19 12:14:05
标题: 具有有限次测量泛化保证的量子学习中的测量预算分配
摘要: 在近期量子硬件上,估计一个 Born 概率需要重复执行电路。因此,一个测量预算固定为 $B$ 的量子学习实验必须决定使用多少个不同的训练态 $n$,以及在每个训练态上分配多少次测量 $S$。我们研究了二元量子分类器中的这一权衡,其中测量算符 $M$ 由训练数据学习得到,并使用新的测量结果进行评估。我们证明了一个适用于有界、$L$-Lipschitz 损失的分布无关泛化界,其中样本项的阶为 $\sqrt{d/n}$,测量次数项的阶为 $\sqrt{(\log n)/S}$;在 $B=nS$ 的条件下,这两项随分配方式呈相反方向变化。最小化该界的一个闭式替代形式,可得到分配规则 $n^* = 2\sqrt{2dB/\log(4B/δ)}$、$S^* = B/n^*$。在我们评估的所有预算下,该规则对应的界值与精确数值最小值相差不超过 0.1%,并且其最坏情况收敛速率为 $B^{-1/4}$。使用 PennyLane 对 2 比特和 4 比特变分电路在九个合成基准上的模拟表明,在所有配置中,经验差距都低于该界,尽管在模拟预算下该界是平凡的,只有在更大的预算下才变得非平凡(例如,对于 $d=4$,当 $B \gtrsim 5000$ 时)。对于关于得分呈凹性的损失,在固定预算下,经验差距呈 U 形,测得的测量次数贡献与其解析值相符;对于绝对值损失,测量噪声是无偏的,因此不会出现受测量次数限制的区域。该规则可用于在实验运行前规划有限测量次数下的评估方案。
更新时间: 2026-11-19 12:14:05
领域: cs.AI
From AI Surrogate to Engineering Tool: Toward Production Use of Fiber-Orientation Prediction in Crash CAE
Crash simulations of glass-fiber-reinforced plastic parts are highly sensitive to the fiber-orientation field supplied to the material model. In conventional workflows, that field comes from resin-flow analysis, which requires molding-specialist support and takes about 25 hours of work per part. We previously proposed a surrogate model that addresses this bottleneck by predicting the orientation field in about 3 minutes. This paper reports the implementation, validation, and operational design that turned the model into an engineering tool for Honda design workflows. We present staged validation from 2D plates to production parts, evaluation against a predefined engineering angular-error criterion, and the expert review that approved design use in March 2025; the system has since been transferred to the crash-safety group and is in initial, limited use in directed fracture-prediction scenarios. The developed system combines injection-gate setting support for cases in which gates are unknown (90% gate-count accuracy, mean position error 11% of flow length), voxelization, surrogate inference, automatic mapping to the crash CAE model, and report generation in a single GUI. The complete orientation-preparation workflow takes about 0.1 hours, a 99.6% reduction from the conventional 25-hour flow-analysis route, and can be run directly by crash CAE engineers without molding-specialist support. As evidence of practical impact, component-level crash analysis using the predicted orientation field reduced the absolute peak-force error from 19.0% with an isotropic baseline to 11.4%, while confining predicted fracture to the test-observed region. The deployment lesson is that a surrogate model alone is not enough for practical adoption: gate-setting support, automatic data conversion, and shareable reporting are what make the model usable as a design tool.
Updated: 2026-11-19 12:12:45
标题: 从人工智能代理模型到工程工具:迈向纤维取向预测在碰撞 CAE 中的生产应用
摘要: 玻璃纤维增强塑料零件的碰撞仿真对输入材料模型的纤维取向场高度敏感。在传统工作流程中,该取向场来自树脂流动分析,而这需要成型专业人员的支持,并且每个零件约需25小时的工作量。我们此前提出了一种替代模型,通过预测取向场,将这一瓶颈缩短至约3分钟。本文介绍了将该模型转化为适用于本田设计流程的工程工具所开展的实施、验证与运行设计工作。我们展示了从二维平板到量产零件的分阶段验证、基于预先设定的工程角度误差标准开展的评估,以及专家评审过程;该工具于2025年3月获准用于设计,此后已移交碰撞安全部门,并开始在指定的断裂预测场景中进行初步、有限的应用。 所开发的系统将未知浇口情况下的注射浇口设定支持、体素化、替代模型推理、向碰撞CAE模型的自动映射以及报告生成集成在同一个图形用户界面中。其中,浇口数量预测准确率为90%,浇口位置平均误差为流动长度的11%。完整的取向准备流程约需0.1小时,相较传统的25小时流动分析流程减少了99.6%的时间,并且碰撞CAE工程师无需成型专业人员支持即可直接运行。作为实际应用效果的证据,使用预测取向场进行零件级碰撞分析时,峰值力绝对误差由各向同性基准模型的19.0%降至11.4%,同时预测断裂被限制在试验观测区域内。部署经验表明,仅有替代模型并不足以实现实际应用:浇口设定支持、数据自动转换以及可共享的报告功能,才是使该模型成为可用设计工具的关键。
更新时间: 2026-11-19 12:12:45
领域: cs.AI
Policy Improvement-Guided Replay for Continual Reinforcement Learning
Continual reinforcement learning (CRL) requires models to acquire new capabilities while retaining performance on previous tasks. A stability-oriented perspective common in conventional continual learning emphasizes knowledge preservation and interference mitigation. Complementing this perspective, we revisit CRL for vision-language models through policy improvement, a fundamental principle of RL, to preserve acquired performance gains. Using the performance difference lemma, we characterize historical performance changes through the current policy's expected advantages on historical task distributions, motivating replay of historical prompts with the current policy. To allocate limited replay memory, we propose Contrastive Likelihood Replay (CoLiR), which contrasts likelihood gains on correct responses from the final task policy with likelihood reductions on incorrect responses from the initial policy. Our analysis links correct-response likelihood gains to reference-policy advantages under an idealized KL-regularized optimal update and provides an endogenous-reward interpretation for general policy updates. CoLiR estimates scores from finite training rollouts and cached log-likelihoods, selects prompts at task boundaries, and replays them uniformly during subsequent training, with KL regularization restricted to replayed prompts. Memory construction only requires a small amount of additional cross-policy scoring but no additional response generation. Across three Qwen3-VL model sizes on MRCL, CoLiR achieves the highest mean final accuracy and mean task accuracy among the compared methods while maintaining competitive new-task performance.
Updated: 2026-11-19 12:12:19
标题: 策略改进引导的持续强化学习回放
摘要: 持续强化学习(CRL)要求模型在获得新能力的同时,保持在先前任务上的性能。传统持续学习中常见的稳定性导向视角强调知识保持与干扰缓解。作为对这一视角的补充,我们基于强化学习的基本原则——策略改进——重新审视视觉语言模型的持续强化学习,以保持已获得的性能提升。借助性能差异引理,我们通过当前策略在历史任务分布上的期望优势刻画历史性能变化,从而促使我们使用当前策略重放历史提示。为分配有限的重放内存,我们提出对比似然重放(Contrastive Likelihood Replay,CoLiR):将最终任务策略对正确响应的似然增益,与初始策略对错误响应的似然降低进行对比。我们的分析将正确响应的似然增益与理想化 KL 正则最优更新下相对于参考策略的优势联系起来,并为一般策略更新提供内生奖励解释。CoLiR 根据有限的训练轨迹和缓存的对数似然估计分数,在任务边界处选择提示,并在后续训练期间均匀重放这些提示,同时仅对重放提示施加 KL 正则。内存构建只需少量额外的跨策略评分,无需额外生成响应。在 MRCL 上对三种规模的 Qwen3-VL 模型进行实验时,与所比较的方法相比,CoLiR 在保持具有竞争力的新任务性能的同时,取得了最高的最终平均准确率和任务平均准确率。
更新时间: 2026-11-19 12:12:19
领域: cs.LG,cs.AI,cs.CL
Seeing Beyond the Obvious: Complementary Semantic Guidance for Salient Single-Positive Multi-Label Learning
Salient Single-Positive Multi-Label Learning (SalSPML) assigns each image its most salient positive label, leaving other classes unlabeled. Existing methods construct class-level Salient Prototypes from observed positives to guide the recognition of unobserved classes. However, since salient annotations favor visually prominent instances, these prototypes may not fully capture the visual diversity of hidden positives, resulting in insufficient positive supervision. To address this limitation, we propose CoST, a Coverage-guided Complementary Soft-Target Refinement framework that supplements Salient Prototypes with complementary class-semantic information. Specifically, CoST identifies semantically relevant candidates from unknown classes by leveraging task-learned category information and image-text semantic correspondence. The selected candidates are then aggregated into class-wise Coverage Prototypes to complement the semantic representations provided by Salient Prototypes. Furthermore, we introduce a ranking-based selective refinement strategy that identifies classes receiving stronger semantic support from Coverage Prototypes and selectively enhances their soft targets while preserving the base soft targets for the rest. Experiments on multiple benchmarks demonstrate the effectiveness of CoST, with strong performance gains over existing baselines.
Updated: 2026-11-19 12:09:21
标题: 看见显而易见之外:用于显著性单正多标签学习的互补语义引导
摘要: 显著单正多标签学习(SalSPML)为每幅图像分配其最显著的正标签,而将其他类别保留为未标注。现有方法利用观测到的正标签构建类别级显著原型,以引导对未观测类别的识别。然而,由于显著性标注倾向于选择视觉上更突出实例,这些原型可能无法充分捕捉隐藏正样本的视觉多样性,从而导致正向监督不足。为解决这一局限,我们提出了CoST,即覆盖率引导的互补软目标细化框架,通过补充互补的类别语义信息来增强显著原型。具体而言,CoST利用任务学习到的类别信息以及图像—文本语义对应关系,从未知类别中识别语义相关候选样本。随后,将选定的候选样本聚合为类别级覆盖原型,以补充显著原型所提供的语义表征。此外,我们引入了一种基于排序的选择性细化策略,用于识别获得覆盖原型更强语义支持的类别,并有选择地增强这些类别的软目标,同时保留其余类别的基础软目标。在多个基准数据集上的实验表明,CoST具有良好的有效性,相较于现有基线方法取得了显著的性能提升。
更新时间: 2026-11-19 12:09:21
领域: cs.LG
Law at the Speed of AI: Critical Legal Infrastructure for the Machine Age: Autonomy Under Law Architecture (AULA)
The global deployment of autonomous AI agents within and across organisations exceeds the governance infrastructure available to constrain it. Agent communication and authentication protocols, principally the Model Context Protocol and the Agent2Agent Protocol, are maturing quickly, but maturity at the protocol layer does not produce legal legibility at the governance layer. Runtime enforcement written by the deploying organisation fixes the resources an AI agent can reach, not the authority under which it acts. Legal legibility is the capacity of a legal system to recognise, interpret and regulate activity by mapping it onto legal personhood, property, rights and liabilities. Existing (analogue) legal infrastructure cannot supply it for autonomous deployment. The resulting deficit is bidirectional. It concerns the attribution of liability when an AI agent causes harm, and the allocation of rights, including data and economic rights, generated by agentic activity and by the AI agent itself as a source of value and form of property. This paper characterises that deficit as the legal attribution gap, a material and unaddressed risk to economies, organisations and citizens that is magnified in cross-organisational multi-agent deployment. The paper describes the Autonomy Under Law Architecture (AULA), in which AI systems and data assets are registered as legal objects anchored to one or more identified legal persons, governed by cryptographically tethered smart legal instruments and evaluated at runtime. Each smart legal instrument can carry a legal context clause, through which the legislation, regulation and judicial decisions in force at the time of the act are given practical and legal effect in that evaluation. Infrastructure of this kind is a precondition for the continued function of any legal, property and economic system with both human and autonomous machine stakeholders.
Updated: 2026-11-19 12:09:19
标题: 人工智能时代的法律速度:机器时代的关键法律基础设施:法律下自主性架构(AULA)
摘要: 自治型人工智能代理在组织内部及组织之间的全球部署规模,已经超出可用于约束其运行的治理基础设施能力。代理通信与身份验证协议,尤其是模型上下文协议(Model Context Protocol)和代理对代理协议(Agent2Agent Protocol),正在迅速成熟;但协议层面的成熟并不会在治理层面产生法律上的可识别性。由部署组织编写的运行时执行机制,规定了人工智能代理能够访问哪些资源,却没有规定其以何种权力行事。 法律可识别性,是指法律体系通过将人工智能代理的活动映射到法律人格、财产、权利与责任之上,来识别、解释并规制这些活动的能力。现有的(模拟时代的)法律基础设施无法为自治部署提供这种能力。由此产生的缺口具有双向性:一方面,它涉及人工智能代理造成损害时责任的归属;另一方面,它涉及权利的分配,包括由代理活动产生的数据权利和经济权利,以及人工智能代理本身作为价值来源和财产形式所产生的权利。 本文将这一缺口界定为“法律归属鸿沟”(legal attribution gap)。在跨组织的多代理部署中,这一鸿沟被进一步放大,构成了对经济体、组织和公民具有实质性且尚未得到解决的风险。本文介绍“法律下的自治架构”(Autonomy Under Law Architecture,AULA):在该架构中,人工智能系统和数据资产被登记为法律客体,并锚定于一个或多个已识别的法律主体;这些系统和资产由通过密码学绑定的智能法律工具进行治理,并在运行时接受评估。每一项智能法律工具都可以包含法律语境条款,使行为发生时有效的法律、法规和司法裁判在评估过程中获得实际效力和法律效力。对于任何同时包含人类和自治机器利益相关者的法律、财产与经济体系而言,此类基础设施都是其持续运行的前提。
更新时间: 2026-11-19 12:09:19
领域: cs.CE,cs.AI,cs.ET,cs.MA
Safe Subgame Resolving in Multiplayer Games
Poker and other games with hidden information are too large to solve in one pass. Strong systems compute a complete blueprint strategy offline and refine it in real time inside the reached subgame. In 2p0s games, a safety theorem guarantees that subgame resolving never increases how much an adversary can gain by exploiting the resolved strategy relative to the blueprint strategy. With three or more players acting independently, no such guarantee exists yet, and heuristic resolving can increase the profile's best-response gap. We prove the first conditional safety theorem for uncorrelated multiplayer subgame resolving, a post-hoc certificate for any delivered update. The best-response gap of the resolved profile exceeds that of the blueprint by at most four terms. Two concern the resolver: the subgame value the blueprint promised without realizing ($A_i^{S}$) and the resolver's subgame solve error ($\varepsilon_i$). The other two are the opponents' best-response gains inside the subgame over their promised values ($\sum_q M_{q}$) and a structural tax ($Θ$), which measures how much the players' total utility can change. The tax is zero in constant-sum games, including every rake-free poker variant. Constructions attain each term with equality. On three-player Leduc poker and on Kuhn poker with up to six players, resolving without a certificate raises the gap beyond a small tolerance in 12% to 100% of the updates. The certificate flags every such update and accepts 41% (Kuhn) and 86% (Leduc) of the standard resolving updates. A resolver that keeps the blueprint whenever the certificate exceeds the tolerance delivers no harmful update. The certificate needs only one best-response pass per opponent inside the subgame, so real-time multiplayer solvers that refine a blueprint can attach it as a safety check. Code is available at https://github.com/lbn187/MultiPlayerSolver
Updated: 2026-11-19 12:04:23
标题: 多人游戏中的安全子博弈求解
摘要: 扑克及其他具有隐藏信息的博弈规模过大,无法一次性求解。强大的系统会在离线阶段计算完整的蓝图策略,并在实时阶段于实际进入的子博弈中对其进行细化。在双人零和博弈中,一项安全性定理保证:相较于蓝图策略,子博弈求解不会增加对手通过剥削已求解策略所能获得的收益。然而,当三名或更多玩家独立行动时,迄今尚不存在这样的保证,启发式求解可能会扩大策略组合的最佳响应差距。 我们证明了关于无关联多人子博弈求解的首个条件安全性定理,为任何已交付的更新提供事后证明。求解后策略组合的最佳响应差距至多比蓝图策略增加四项之和。其中两项与求解器有关:蓝图在未实现的情况下所承诺的子博弈价值($A_i^{S}$),以及求解器的子博弈求解误差($\varepsilon_i$)。另外两项是对手在子博弈中相对于其承诺价值所获得的最佳响应增益($\sum_q M_{q}$),以及结构性代价($Θ$),后者衡量所有玩家的总效用可能发生的变化幅度。在常和博弈中,包括所有无抽水的扑克变体,该代价为零。我们构造了使每一项都能取等的实例。 在三人勒杜克扑克以及最多六人参与的库恩扑克中,不带证明的子博弈求解会使最佳响应差距超过一个较小容差,发生在12%至100%的更新中。该证明能够标记出所有此类更新,并接受标准子博弈求解更新中的41%(库恩扑克)和86%(勒杜克扑克)。一种在证明超过容差时保留蓝图策略的求解器,不会交付任何有害更新。该证明在子博弈中对每位对手只需进行一次最佳响应遍历,因此,细化蓝图策略的实时多人求解器可以将其作为安全检查附加使用。代码见:https://github.com/lbn187/MultiPlayerSolver
更新时间: 2026-11-19 12:04:23
领域: cs.GT,cs.AI
Multi-View Transformer with Geometry-Guided Multi-Modal ControlNet for 3D Virtual Try-On
Editing a 3D Gaussian Splatting (3DGS) capture of a person so that they wear a new garment requires every rendered view to agree on the same garment details. Existing 3D virtual try-on (VTON) pipelines, however, edit training views largely independently and fuse them with hand-designed heuristics such as manually chosen reference views and fixed attention-blending weights. The resulting inconsistencies are baked into the 3D representation and surface as texture drift, blurred prints, and implausible geometry in novel views. We present GS-VTON-MVT, a three-stage framework that combines implicit and explicit 3D reasoning for consistent 3DGS try-on. (i) A multi-view inpainting transformer jointly edits a set of training views with full cross-view self-attention, so that cross-view correspondence is learned rather than imposed. (ii) A geometry-guided multi-modal ControlNet conditions the diffusion editor on the garment image together with depth and surface normals rendered from the current 3DGS state, supplying explicit structure where visual evidence is weakest. (iii) A pose-adaptive persona-aware attention replaces the fixed blending weight between current-view and reference-view features with weights derived from camera-pose proximity. On the 3D-VTONBench benchmark, GS-VTON-MVT improves FID, KID, LPIPS-based cross-view consistency, and user preference over general-purpose 3D editors and prior 3D try-on methods.
Updated: 2026-11-19 12:03:04
标题: 用于三维虚拟试穿的几何引导多模态 ControlNet 多视图 Transformer
摘要: 编辑一个人的三维高斯泼溅(3D Gaussian Splatting,3DGS)捕获结果,使其穿上新服装,需要确保每个渲染视图中的服装细节保持一致。然而,现有的三维虚拟试衣(VTON)流程通常相互独立地编辑训练视图,并通过手工设计的启发式方法将其融合,例如手动选择参考视图和设置固定的注意力混合权重。由此产生的不一致会被固化到三维表示中,并在新视图中表现为纹理漂移、图案模糊以及不合理的几何结构。我们提出 GS-VTON-MVT,一种结合隐式与显式三维推理、实现一致性三维GS试衣的三阶段框架。(i)多视图修复变换器通过完整的跨视图自注意力机制联合编辑一组训练视图,使跨视图对应关系能够被学习,而非依赖人为设定。(ii)几何引导的多模态 ControlNet 将服装图像,以及从当前三维GS状态渲染得到的深度和表面法线作为条件输入扩散编辑器,在视觉证据最薄弱的区域提供显式结构信息。(iii)姿态自适应的身份感知注意力机制以基于相机姿态接近程度计算的权重,取代当前视图特征与参考视图特征之间固定的混合权重。在 3D-VTONBench 基准测试中,相较于通用三维编辑器和以往的三维试衣方法,GS-VTON-MVT 在 FID、KID、基于 LPIPS 的跨视图一致性以及用户偏好方面均取得了更好的表现。
更新时间: 2026-11-19 12:03:04
领域: cs.CV,cs.AI
Energy estimates of open-weight large language models across stated food weights: a dose-response evaluation
We tested whether energy estimates of open-weight large language models (LLMs) scale proportionally with an exactly stated food weight, and whether computing energy density times weight removes the error. Under a prespecified protocol, seven open-weight LLMs estimated the energy of 168 randomly drawn foods from the USDA Food and Nutrient Database for Dietary Studies at nine stated weights, from 0.25 to 4 times the default amount. The primary outcome was the elasticity of the estimate with respect to weight (1: proportional scaling). A two-step estimate multiplied each model's own stated energy density by the weight in code. All seven models compressed their estimates, with elasticities from 0.548 to 0.979 (every 95% CI below 1); four compressed severely (0.548 to 0.709). These four overestimated a quarter of the default amount by 47% to 130% and underestimated four times it by 20% to 34%. Supplying the density restored near-proportional scaling in three of the four, and the two-step estimate cut the typical error factor at these extremes from 1.47-2.43 to 1.20-1.38. Compression persisted at full precision and grew in five of seven models under a plain question. The models hold the energy densities needed for proportional scaling and answer near a typical serving, reproducing the flat-slope syndrome of dietary recall. Accuracy at usual portions does not reveal it. Food-logging tools should compute the energy of weighed entries as density times weight, and evaluations should test fixed foods across stated weights.
Updated: 2026-11-19 12:00:23
标题: 开放权重大语言模型在不同指定食物重量下的能耗估算:剂量-反应评估
摘要: 我们检验了开放权重大型语言模型(LLM)的能量估计是否会随明确给定的食物重量按比例变化,以及用能量密度乘以重量进行计算是否能够消除误差。在预先制定的方案下,七个开放权重LLM针对美国农业部《膳食研究中的食品与营养数据库》随机抽取的168种食物,在九种指定重量下估计其能量,这些重量为默认重量的0.25至4倍。主要结局指标是估计值相对于重量的弹性(按比例变化时为1)。两步法则是在代码中将每个模型自行给出的能量密度乘以重量。七个模型的估计值均出现压缩,弹性介于0.548至0.979之间(所有95%置信区间均低于1);其中四个模型的压缩尤为严重(0.548至0.709)。对于默认重量的四分之一,这四个模型高估了47%至130%;对于默认重量的四倍,则低估了20%至34%。提供能量密度后,四个模型中的三个恢复了近似按比例的缩放;在这些极端重量下,两步法将典型误差倍数从1.47至2.43降至1.20至1.38。即使在使用完整精度时,估计压缩仍然存在;在采用普通提问方式时,七个模型中有五个的压缩程度进一步加剧。这些模型掌握了实现按比例缩放所需的能量密度,但会针对接近典型份量的情况作答,从而再现了膳食回顾中的“平坦斜率综合征”。在通常份量下的准确性并不能揭示这一问题。食物记录工具应将称重食物条目的能量计算为能量密度乘以重量,评估时也应在固定食物的不同指定重量下进行测试。
更新时间: 2026-11-19 12:00:23
领域: cs.CL,cs.AI
KernelOPT: Dispatch-Aware Agentic Search for GPU Kernel Optimization
Deep learning inference and training performance depends critically on GPU kernel efficiency. Modern compilers such as PyTorch Inductor automatically generate GPU kernels from high-level model code, but frequently underperform expert-written implementations by wide margins. Recent LLM-assisted optimizers explore these opportunities through kernel generation and refinement; yet translating isolated kernel improvements into model-level gains remains a challenge. We present KernelOPT, a profiling-guided multi-agent system for GPU kernel optimization. It inspects generated Triton kernels and external library calls in compiler artifacts to guide synthesis and refinement, then assembles and evaluates the resulting model. Four stages of validation combine execution checks, multi-seed numerical comparison, model-level checking with a float64 fallback and end-to-end performance gating ($γ{=}1.03$). The system supports PyTorch nn.Modules, standalone Triton kernels, and Helion kernels. It is evaluated on all 250 KernelBench problems on NVIDIA H200 which includes 100 single-operator problems (Level1), 100 composite operators (Level2), and 50 model architectures (Level3). KernelOPT achieves geometric mean speedups over torch.compile of 1.40$\times$, 1.15$\times$ and 1.07$\times$ respectively across L1, L2 and L3. Among problems exceeding 1.03$\times$ speedup, the geomeans are 2.54$\times$ (36 L1), 1.84$\times$ (23 L2), and 1.37$\times$ (11 L3). These gains include arithmetic-precision changes and task-specific algebraic simplifications under the evaluated numerical tolerances. The evaluation also reveals discrepancies between isolated kernel improvements and end-to-end performance, motivating model-level measurement alongside kernel-level optimization. Code is available at https://github.com/TorchedHat/KernelOPT.
Updated: 2026-11-19 11:59:44
标题: KernelOPT:面向调度的 GPU 内核优化智能体搜索
摘要: 深度学习的推理和训练性能在很大程度上取决于 GPU 内核的效率。PyTorch Inductor 等现代编译器能够从高层模型代码自动生成 GPU 内核,但其性能通常远逊于专家手写的实现。近期由大语言模型辅助的优化器通过内核生成与优化探索了这些机会;然而,如何将孤立的内核改进转化为模型级性能提升,仍然是一项挑战。 我们提出了 KernelOPT,一个由性能分析指导的多智能体 GPU 内核优化系统。它检查编译器产物中生成的 Triton 内核和外部库调用,以指导内核合成与优化,随后组装并评估生成的模型。四个验证阶段结合了执行检查、多随机种子数值比较、带有 float64 回退机制的模型级检查,以及端到端性能门控($γ{=}1.03$)。该系统支持 PyTorch nn.Modules、独立的 Triton 内核以及 Helion 内核。 我们在 NVIDIA H200 上对 KernelBench 的全部 250 个问题进行了评估,其中包括 100 个单算子问题(Level1)、100 个复合算子问题(Level2)以及 50 个模型架构问题(Level3)。在 L1、L2 和 L3 上,KernelOPT 相对于 torch.compile 分别取得了 1.40 倍、1.15 倍和 1.07 倍的几何平均加速比。在加速比超过 1.03 倍的问题中,几何平均加速比分别为 2.54 倍(36 个 L1 问题)、1.84 倍(23 个 L2 问题)和 1.37 倍(11 个 L3 问题)。 这些性能提升包括算术精度调整,以及在所评估数值容差范围内针对具体任务进行的代数化简。评估还揭示了孤立内核改进与端到端性能之间存在差异,说明在进行内核级优化的同时,有必要开展模型级测量。代码可访问:https://github.com/TorchedHat/KernelOPT。
更新时间: 2026-11-19 11:59:44
领域: cs.DC,cs.AI,cs.LG
Periodic and Harmonic Periodic RoPE for Length Extrapolation in LLMs
The ability to process long contexts is crucial for large language models (LLMs) to perform long-horizon tasks. Rotary position embedding (RoPE) gives every token a new rotation angle, so a model eventually meets angles it never saw in training, i.e., position exhaustion. We propose Periodic RoPE (P-RoPE), a positional encoding mechanism that operates in conjunction with sliding window attention. It repeats the first sliding-window-size \(W\) angles of the RoPE table, so the model needs only \(W\) distinct angles. P-RoPE works but introduces a wrap error at the window boundary. We further propose Harmonic Periodic RoPE (HP-RoPE), which removes the error by choosing frequencies that complete whole turns in \(W\) tokens. We compare models that share the same architecture, data, and schedule and differ only in the window-layer position encoding: standard RoPE, P-RoPE, and HP-RoPE. The results show that P-RoPE and HP-RoPE keep perplexity nearly flat from the training length \(768\) to \(16\)k, while RoPE, NTK, and YaRN rise. In a format-free Passkey test at \(16\)k, they remain at \(99\)--\(100\%\), against \(11\)--\(37\%\) for those RoPE interpolations. The code is available at \href{https://github.com/Cominder/miniwin}{https://github.com/Cominder/miniwin}.
Updated: 2026-11-19 11:59:30
标题: 用于大语言模型长度外推的周期性与谐波周期性旋转位置编码
摘要: 处理长上下文的能力对于大型语言模型(LLM)执行长时程任务至关重要。旋转位置嵌入(RoPE)会为每个词元赋予一个新的旋转角度,因此模型最终会遇到训练过程中从未见过的角度,即位置耗尽问题。我们提出了周期性 RoPE(P-RoPE),这是一种与滑动窗口注意力协同工作的位置编码机制。它重复使用 RoPE 表中最初的、长度为滑动窗口大小 \(W\) 的角度,因此模型只需处理 \(W\) 个不同的角度。P-RoPE 虽然有效,但会在窗口边界处引入回绕误差。为此,我们进一步提出了谐波周期性 RoPE(HP-RoPE),通过选择在 \(W\) 个词元内完成整数圈旋转的频率来消除该误差。我们比较了架构、数据和训练计划均相同、仅窗口层位置编码不同的模型:标准 RoPE、P-RoPE 和 HP-RoPE。结果表明,从训练长度 \(768\) 到 \(16\)k,P-RoPE 和 HP-RoPE 的困惑度几乎保持平稳,而 RoPE、NTK 和 YaRN 的困惑度则不断上升。在 \(16\)k 长度的无格式密钥测试中,P-RoPE 和 HP-RoPE 的准确率仍保持在 \(99\)--\(100\%\),而采用这些 RoPE 插值方法的模型仅为 \(11\)--\(37\%\)。代码可从 \href{https://github.com/Cominder/miniwin}{https://github.com/Cominder/miniwin} 获取。
更新时间: 2026-11-19 11:59:30
领域: cs.CL,cs.AI
Optimal algorithmic complexity of inference in quantum kernel methods
Quantum kernel methods are among the leading candidates for achieving quantum advantage in supervised learning. A key bottleneck is the cost of inference: evaluating a trained model on new data requires estimating a weighted sum $\sum_{i=1}^N α_i k(x,x_i)$ of $N$ kernel values to additive precision $\varepsilon$, where $α$ is the vector of trained coefficients. The standard approach estimates each term independently via sampling, yielding a query complexity of $O(N\lVertα\rVert_2^2/\varepsilon^2)$. In this work, we identify two independent axes for improvement: (1) How individual kernel values are estimated (sampling versus quantum amplitude estimation), and (2) how the sum is approximated (term-by-term versus via a single observable), and systematically analyze all combinations thereof. The query-optimal combination, encoding the full inference sum as the expectation value of a single observable and applying quantum amplitude estimation, achieves a query complexity of $O(\lVertα\rVert_1/\varepsilon)$, removing the dependence on $N$ from the query count and yielding a quadratic improvement in both $\lVertα\rVert_1$ and $\varepsilon$. We prove a matching lower bound of $Ω(\lVertα\rVert_1/\varepsilon)$, establishing query-optimality of our approach up to logarithmic factors. Beyond query complexity, we also analyze how these improvements translate into gate costs and show that the query-optimal strategy is not always optimal in practice from the perspective of gate complexity. Our results provide both a query-optimal algorithm and a practically optimal choice of strategy depending on hardware capabilities, along with a complete landscape of intermediate methods to guide practitioners. All algorithms require only amplitude estimation as a subroutine and are thus natural candidates for early-fault-tolerant implementations.
Updated: 2026-11-19 11:54:45
标题: 量子核方法中推断的最优算法复杂度
摘要: 量子核方法是实现监督学习量子优势的主要候选方法之一。一个关键瓶颈在于推理成本:在新数据上评估训练好的模型,需要以加性精度 ε 估计 N 个核函数值的加权和 ∑_{i=1}^N α_i k(x,x_i),其中 α 是训练得到的系数向量。标准方法通过采样独立估计每一项,其查询复杂度为 O(N∥α∥₂²/ε²)。在本工作中,我们确定了两个相互独立的改进维度:(1)如何估计单个核函数值(采样或量子振幅估计);(2)如何近似该求和(逐项计算或通过单个可观测量计算),并系统分析了这两种维度的所有组合。查询最优的组合是:将完整的推理求和编码为单个可观测量的期望值,并应用量子振幅估计,由此达到 O(∥α∥₁/ε) 的查询复杂度,消除了查询次数对 N 的依赖,并使 ∥α∥₁ 和 ε 相关的复杂度均获得二次改进。我们证明了相匹配的 Ω(∥α∥₁/ε) 下界,从而确立了我们的方法在对数因子意义下的查询最优性。除查询复杂度外,我们还分析了这些改进如何转化为门操作成本,并表明,从门复杂度角度看,查询最优策略在实践中并不总是最优。我们的研究既提供了一种查询最优算法,也根据硬件能力给出了实践中最优的策略选择,并完整呈现了各种中间方法的性能图景,为实际应用提供指导。所有算法仅需将振幅估计作为子程序,因此自然适合在早期容错量子计算设备上实现。
更新时间: 2026-11-19 11:54:45
领域: quant-ph,cs.LG
The Depth of a Prediction: Where Language Models Resolve a Word Predicts Human Reading Time
Surprisal from a language model's final layer predicts how long people read a word, yet the model computes its prediction across many layers. We read each word's prediction at every layer with the tuned lens and summarize this layerwise surprisal trajectory by its resolution depth, the depth around which its change is centered. On eight English eye-tracking and self-paced reading corpora (81,957 words) and ten GPT-2, OPT and Pythia models, words that a model resolves later, and the words after them, are read more slowly than equally surprising words. Resolution depth improves held-out prediction beyond final-layer surprisal, entropy and the best single layer by 0.26 millinats per word (pooled p = 0.001), about a third of entropy's gain, and each model family gains, GPT-2 and Pythia through one corpus each. The net gain varies between corpora (random-effects mean 0.07, p = 0.37); against layer-shuffled depth, which adds as many coefficients, it is positive in seven of eight corpora (random-effects mean 0.23, p = 0.016), and untrained networks show no gain under the logit lens. Pooled over corpora, the effect holds with corrected word probabilities and beyond first-to-last-layer divergences, and a whole-trajectory functional regression adds no significant information beyond resolution depth.
Updated: 2026-11-19 11:53:48
标题: 预测的深度:语言模型解析一个词的位置能够预测人类阅读时间
摘要: 语言模型最终层的意外度能够预测人们阅读一个词所需的时间,但模型会跨越许多层计算其预测结果。我们使用调谐透镜读取每个词在各层的预测,并以其分辨率深度概括这一逐层意外度轨迹,即其变化集中所在的大致深度。在八个英语眼动追踪和自定步调阅读语料库(81,957个词)以及十个GPT-2、OPT和Pythia模型上,相较于意外度相同但模型更早解析的词,模型更晚解析的词及其后续词的阅读速度更慢。分辨率深度在留出集上的预测效果优于最终层意外度、熵和表现最佳的单层,每词提高0.26毫纳特(合并分析p = 0.001),约为熵所带来增益的三分之一;每个模型家族均有所提升,其中GPT-2和Pythia各自在一个语料库中获得提升。净增益因语料库而异(随机效应均值为0.07,p = 0.37);与层级打乱后的深度相比——后者增加了同样数量的系数——八个语料库中有七个显示正增益(随机效应均值为0.23,p = 0.016),而在未训练网络中,使用对数几率透镜时未观察到增益。将各语料库合并后,在校正词概率以及控制从第一层到最后一层的差异后,该效应仍然存在;此外,基于完整轨迹的函数回归在分辨率深度之外未能提供显著的额外信息。
更新时间: 2026-11-19 11:53:48
领域: cs.CL,cs.LG
Power Setpoint Tracking for Large-Scale EV Charging: Transformer-Constrained Charging Policy Learning with Self-Tuning Constraint Prices
In power setpoint tracking (PST), an operator follows a purchased charging profile without overloading shared transformers or undercharging vehicles. PST is cast as a constrained Markov decision process that minimizes tracking error subject to overload and mean user-satisfaction constraints. Transformer-Constrained Charging Policy Learning (TC-CPL) extends soft actor-critic with proportional-integral Lagrange-multiplier updates from measured violations, a residual on the incumbent dispatcher that is warm-started from its demonstrations, and a transformer-aware encoder shared by all ports. It observes no departure times or states of charge. Simulations (five seeds, 100 paired days) compare it with the incumbent, Round-Robin. On a 600-port, 122-substation district, raw overload falls from 3.59 to 0.0017 kWh/day (overloaded seed-days from 77% to 0.4%), and absolute tracking error falls by 27%. Delivered energy rises by 16%, and satisfaction rises from 0.959 to 0.989. On a 42-kW transformer with household load, overload falls from 1.86 to 0.0014 kWh/day and satisfaction rises from 0.974 to 0.985, but absolute tracking error is 22% higher. Against hand-set fixed multipliers, self-tuning is statistically indistinguishable on the district. On the single transformer, it raises satisfaction by 0.011 at similar overload, but a short sweep found a better-serving fixed pair. The overload multipliers stay below their cap.
Updated: 2026-11-19 11:51:56
标题: 大规模电动汽车充电的功率设定点跟踪:具有自调节约束价格的变压器约束充电策略学习
摘要: 在功率设定点跟踪(PST)中,运营商需遵循已购入的充电功率曲线,同时避免共享变压器过载或车辆充电不足。PST被建模为一个受约束的马尔可夫决策过程,在满足过载约束和用户平均满意度约束的条件下最小化跟踪误差。变压器约束充电策略学习(TC-CPL)在软演员—评论家算法的基础上进行了扩展:利用根据测得的违规情况进行比例—积分式拉格朗日乘子更新,引入在现有调度器基础上构建、并通过其示范数据进行热启动的残差模块,以及一个由所有充电端口共享的变压器感知编码器。该方法不观测离站时间或荷电状态。通过五个随机种子和100个配对日进行仿真,并将其与现有的轮询调度器进行比较。在一个拥有600个充电端口和122座变电站的区域中,原始过载量从每天3.59千瓦时降至0.0017千瓦时(发生过载的种子—天比例从77%降至0.4%),绝对跟踪误差降低了27%。输送电量增加了16%,满意度则从0.959提高到0.989。在一台接有住户负载的42千瓦变压器上,过载量从每天1.86千瓦时降至0.0014千瓦时,满意度从0.974提高到0.985,但绝对跟踪误差增加了22%。与人工设定的固定乘子相比,在区域级测试中,自调节方法在统计上没有显著差异。在单台变压器测试中,其在过载水平相近的情况下使满意度提高了0.011,但一次简短的参数扫描发现,有一组固定参数能够提供更好的服务。过载乘子始终低于其上限。
更新时间: 2026-11-19 11:51:56
领域: cs.LG,eess.SY
FedE2E: One-Shot Federated Learning for End-to-End Autonomous Driving with Closed-Loop Evaluation
Federated learning enables collaborative model training without sharing datasets. However, existing federated learning methods for autonomous driving typically require multi-round communication and lack closed-loop evaluation, while one-shot methods mainly focus on perception tasks. To address these limitations, we propose \method, a one-shot federated learning method for end-to-end autonomous driving. It comprises multi-client calibration, anchor-based feature alignment, and token-wise consensus distillation to distill knowledge from heterogeneous models. Closed-loop evaluation on Bench2Drive demonstrates the effectiveness of \method in both one-shot and multi-round federated learning. In the one-shot setting, it achieves a Driving Score of 55.85, which is 4.07 points higher than prior work. In the multi-round setting, it reaches 60.35 after five communication rounds, the best performance among all compared methods under the same number of communication rounds.
Updated: 2026-11-19 11:51:49
标题: FedE2E:通过闭环评估实现端到端自动驾驶的一次性联邦学习
摘要: 联邦学习能够在不共享数据集的情况下实现协作式模型训练。然而,现有用于自动驾驶的联邦学习方法通常需要多轮通信,且缺乏闭环评估;而单轮方法主要聚焦于感知任务。为解决这些局限,我们提出了 \method,一种面向端到端自动驾驶的单轮联邦学习方法。该方法包括多客户端校准、基于锚点的特征对齐以及逐词元共识蒸馏,用于从异构模型中提取知识。在 Bench2Drive 上进行的闭环评估表明,\method 在单轮和多轮联邦学习中均表现出有效性。在单轮设置下,其驾驶得分达到 55.85,比现有方法高出 4.07 分。在多轮设置下,经过五轮通信后,其驾驶得分达到 60.35,在相同通信轮数下的所有对比方法中取得了最佳性能。
更新时间: 2026-11-19 11:51:49
领域: cs.AI,stat.ML
Survival of the fittest Cox model: Pivotal variable selection for time-to-event data
We revisit Cox's proportional hazards model to improve variable selection in survival analysis. A square-root transformation of the partial likelihood renders the selection of the regularization parameter asymptotically pivotal: the baseline hazard and the censoring rate cancel exactly, and the way censoring is spread over time only enters through a bounded correction of order $1/\log n$. Using martingale residuals, we compute this penalty level by Monte Carlo without reordering the design matrix. The resulting criterion borrows from information criteria such as BIC and from penalized regression methods such as the lasso, taking the best of both. On simulated and real data, our method substantially improves upon state-of-the-art approaches used daily.
Updated: 2026-11-19 11:44:09
标题: 适者生存Cox模型:时间-事件数据中的关键变量选择
摘要: 我们重新审视了 Cox 比例风险模型,以改进生存分析中的变量选择。对偏似然进行平方根变换后,正则化参数的选择在渐近意义下变得与具体情形无关:基准风险函数和删失率恰好相互抵消,而删失随时间的分布方式仅通过一个阶为 \(1/\log n\) 的有界修正项产生影响。利用鞅残差,我们无需重新排列设计矩阵,即可通过蒙特卡洛方法计算这一惩罚水平。由此得到的准则同时借鉴了 BIC 等信息准则和套索等惩罚回归方法,兼具二者的优点。在模拟数据和真实数据上,我们的方法都显著优于目前日常使用的先进方法。
更新时间: 2026-11-19 11:44:09
领域: stat.ML,cs.LG,math.ST
Web search in Latin America: language models use less local and diverse news than search engines
AI platforms are becoming a major gateway to news and current events. This shift risks amplifying existing geographical biases that favour narratives from wealthier countries over those from the Global South. This is particularly relevant in Latin America, which accounts for the largest share of AI usage in the Global South. We examine how information about Latin America changes when users shift from conventional search engines to LLM-based search. We construct a dataset of 1,901 current events across nine Latin American countries, craft realistic queries, and submit them to three search engines and four language models. We vary query language and user location to represent local, diaspora, tourist, and foreign user scenarios. Across 49,207 requests and 8,834 unique domains, language models return a less diverse set of news sources than search engines. Across user types, the share of domestic news returned by language models is inconsistent. For local users, while search engines already return only 41.3\% local news, language models return a further 3.6 to 11.6 percentage points less. Taken together, our findings suggest that LLM-based search can reproduce and, in some settings, amplify geographical hierarchies in the reach and visibility of news sources. We release an open dataset to support multilingual and geographically diverse evaluation of LLM-based search, and highlight implications for more equitable information systems design.
Updated: 2026-11-19 11:43:22
标题: 拉丁美洲的网络搜索:语言模型使用的本地及多样化新闻少于搜索引擎
摘要: 人工智能平台正日益成为获取新闻和时事信息的重要入口。这一转变可能加剧现有的地域偏见,使来自富裕国家的叙事获得更多关注,而全球南方的叙事则相对受忽视。这一点对拉丁美洲尤其重要,因为该地区在全球南方人工智能使用量中占比最高。我们考察了当用户从传统搜索引擎转向基于大语言模型的搜索时,有关拉丁美洲的信息会如何发生变化。我们构建了一个涵盖九个拉丁美洲国家、包含1901起时事事件的数据集,设计了贴近现实的查询,并将其提交给三个搜索引擎和四个语言模型。我们改变查询语言和用户所在地,以呈现本地用户、海外侨民、游客和外国用户等情境。在49,207次请求和8,834个不同域名中,语言模型返回的新闻来源集合比搜索引擎的多样性更低。不同用户类型之间,语言模型返回的国内新闻占比并不一致。对于本地用户而言,尽管搜索引擎返回的本地新闻本已仅占41.3%,语言模型返回的比例还进一步低了3.6至11.6个百分点。总体而言,我们的研究结果表明,基于大语言模型的搜索可能会再现、并在某些情境下加剧新闻来源在传播范围和可见性方面的地域层级结构。我们发布了一个开放数据集,以支持对基于大语言模型的搜索开展多语言、地理多样化的评估,并强调其对设计更加公平的信息系统所具有的意义。
更新时间: 2026-11-19 11:43:22
领域: cs.CL,cs.AI,cs.CY
GaussTrans: A Gaussian Interface Framework for Multi-Layer Refractive Transport
We investigate surface modeling of multi-transparent interfaces to achieve accurate light transmission. The interplay of errors in geometric structure, light paths, and observation results during the reconstruction of transparent media with a high number of layers makes this a challenging problem. Some existing techniques address the reconstruction of transparent scenes by reducing the number of layers or simplifying light paths; however, this limits their direct applicability to high-order transparent scenes. We propose GaussTrans, a compact framework for light transport in high-order transparent scenes, consisting of three components: Gaussian-Field Hybrid Surfaces, Transport-Coupled Refinement, and Primitive-Guided Implicit Intersection. Gaussian-Field Hybrid Surfaces use a hybrid approach combining Gauss surfaces and fields to reconstruct different interfaces. Transport-Coupled Refinement reduces coupling errors by evaluating the entire light path. Primitive-Guided Implicit Intersection combines primitive support regions to reduce errors in the intersection of interfaces and rays. In experiments on datasets such as RefRef, GaussTrans achieves significantly higher accuracy with relatively low spatial storage requirements.
Updated: 2026-11-19 11:37:41
标题: GaussTrans:一种用于多层折射传输的高斯界面框架
摘要: 我们研究多重透明界面的表面建模,以实现精确的光线传输。在重建具有大量层次的透明介质时,几何结构、光线路径与观测结果之间的误差相互作用,使这一问题极具挑战性。一些现有技术通过减少层数或简化光线路径来重建透明场景,但这限制了它们直接应用于高阶透明场景。我们提出 GaussTrans,这是一种面向高阶透明场景光传输的紧凑框架,由三个部分组成:高斯—场混合表面、传输耦合细化和基元引导的隐式相交。高斯—场混合表面采用结合高斯表面与高斯场的混合方法,以重建不同的界面。传输耦合细化通过评估完整光线路径来减少耦合误差。基元引导的隐式相交结合基元支持区域,以减少界面与光线相交时的误差。在 RefRef 等数据集上的实验表明,GaussTrans 在空间存储需求相对较低的情况下实现了显著更高的精度。
更新时间: 2026-11-19 11:37:41
领域: cs.AI
Agnostic Smoothed Online Regression with Adversarial Responses
We study smoothed online prediction with bounded adversarial responses. This widely studied framework bridges i.i.d. sampling and adversarial covariate selection through a smoothness parameter $\textsf{C}_{\textsf{cov}}$, which bounds conditional covariate densities relative to a fixed, unknown base measure. We propose Hedge-Cover, an information-theoretic algorithm that achieves sublinear regret $\widetilde{O}(\sqrt{\text{Pdim}(\mathcal{F}) \textsf{C}_{\textsf{cov}} T})$ for function classes with bounded pseudo-dimension. The algorithm aggregates a carefully constructed family of experts using Hedge, with a prior that links regret to the number of disagreements between a consistent selector and a target function. We bound this number by exploiting covariate smoothness. This answers an open problem posed in \cite{blanchard2025agnostic} on the minimax optimal adaptive regret of the smoothed online regression problem. We establish a matching lower bound for the class of linear predictors. The main intricacy of the lower bound lies in explicitly constructing a challenging sequential covariate distribution supported on mutually orthogonal hyperplanes. This construction may be of independent technical interest. Finally, we revisit the well-specified setting and quantify the effect of response noise. For conditionally $ν^2$-subGaussian responses, we extend the existing lower bound under realizable responses by showing that the minimax expected regret is $Ω((1\vee ν)\sqrt{(\textsf{C}_{\textsf{cov}}-1)dT})$ for a function class of VC dimension $d$. A corresponding upper bound for ERM matches this dependence on $ν$.
Updated: 2026-11-19 11:34:51
标题: 具有鲁棒性的平滑在线回归与对抗性响应
摘要: 我们研究具有有界对抗性响应的平滑在线预测问题。这一广泛研究的框架通过平滑参数 \(\textsf{C}_{\textsf{cov}}\) 连接了独立同分布采样与对抗性协变量选择;该参数用于界定条件协变量密度相对于某个固定但未知的基准测度的大小。我们提出了信息论算法 Hedge-Cover:对于伪维有界的函数类,该算法能够实现次线性遗憾 \(\widetilde{O}(\sqrt{\text{Pdim}(\mathcal{F}) \textsf{C}_{\textsf{cov}} T})\)。该算法利用 Hedge 聚合一个经过精心构造的专家族,并采用一种先验,将遗憾与一致选择器和目标函数之间的不一致数量联系起来。我们通过利用协变量的平滑性来界定这一数量。这解决了 \cite{blanchard2025agnostic} 中提出的关于平滑在线回归问题极小极大最优自适应遗憾的开放问题。对于线性预测器类,我们建立了匹配的下界。该下界的主要难点在于显式构造一个具有挑战性的序列协变量分布,使其支撑集位于相互正交的超平面上。这一构造本身可能具有独立的技术价值。最后,我们重新考察了模型设定正确的情形,并量化响应噪声的影响。对于条件上为 \(ν^2\)-次高斯的响应,我们通过证明:对于 VC 维为 \(d\) 的函数类,极小极大期望遗憾为 \(Ω((1\vee ν)\sqrt{(\textsf{C}_{\textsf{cov}}-1)dT})\),从而扩展了可实现响应情形下已有的下界。相应的经验风险最小化(ERM)上界与关于 \(ν\) 的这一依赖关系相匹配。
更新时间: 2026-11-19 11:34:51
领域: stat.ML,cs.LG,math.ST
Security of Deep Reinforcement Learning for Autonomous Driving: A Survey
Reinforcement learning (RL) enables agents to learn optimal behaviors through interaction with their environment and has been increasingly deployed in safety-critical applications, including autonomous driving. Despite its promise, RL is susceptible to attacks designed either to compromise policy learning or to induce erroneous decisions by trained agents. Although the literature on RL security has grown rapidly and several surveys exist, existing categorizations often fall short in guiding the selection of appropriate defenses for specific systems. In this work, we present a comprehensive survey of 86 recent studies on RL security, addressing these limitations by systematically categorizing attacks and defenses according to defined threat models and single- versus multi-agent settings. Furthermore, we examine the relevance and applicability of state-of-the-art attacks and defense mechanisms within the context of autonomous driving, providing insights to inform the design of robust RL systems.
Updated: 2026-11-19 11:32:46
标题: 自动驾驶深度强化学习的安全性:综述
摘要: 强化学习(RL)使智能体能够通过与环境交互来学习最优行为,并已日益应用于包括自动驾驶在内的安全关键型领域。尽管强化学习前景广阔,但它容易受到多种攻击:攻击者或试图破坏策略学习过程,或诱导已训练的智能体做出错误决策。尽管关于强化学习安全性的研究近年来快速增长,且已有多篇综述,但现有分类方式往往难以指导针对特定系统选择适当的防御措施。本文对近期86项强化学习安全研究进行了全面综述,通过依据明确的威胁模型以及单智能体和多智能体场景,对攻击与防御进行系统分类,从而弥补上述不足。此外,我们还考察了当前最先进的攻击方法和防御机制在自动驾驶背景下的相关性与适用性,为设计稳健的强化学习系统提供参考。
更新时间: 2026-11-19 11:32:46
领域: cs.LG,cs.RO
Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization
Large Language Models (LLMs) have achieved widespread adoption because of their strong reasoning and query-response capabilities. However, deploying them in embedded and edge computing environments remains challenging because of strict latency, memory, and energy constraints. Their large parameter counts and computational demands hinder efficient execution on resource-constrained platforms. Although model pruning has emerged as a viable solution for reducing scale while preserving performance, jointly optimizing layers, attention heads, and Multi-Layer Perceptron (MLP) dimensions remains highly complex. Exhaustively exploring this combined design space is computationally expensive and often leads to local optima or unstable configurations. To address these limitations, we propose a hardware-aware, multi-objective structured pruning framework. The proposed two-stage method explicitly targets latency and model size for efficient deployment on edge devices. In the coarse-grained stage, multi-objective depth pruning removes entire attention and MLP blocks to reduce computational load and memory usage. In the subsequent fine-grained stage, Parallel Bayesian Optimization (PBO) searches for the optimal layer-wise pruning ratios for pruning under latency constraints, while importance-based strategies rank the specific components to be pruned within each layer's allocated budget. Experimental results show that our approach reduces model complexity with minimal impact on commonsense reasoning tasks and zero-shot performance. Our method achieves a favorable trade-off among accuracy, latency, and model size, making it suitable for edge deployment. Across multiple LLMs at 37.5% and 50% pruning ratios, the proposed approach achieves better performance on commonsense reasoning tasks than existing methods while significantly reducing inference cost.
Updated: 2026-11-19 11:31:48
标题: 面向延迟与模型规模优化的大语言模型多目标结构化剪枝
摘要: 大型语言模型(LLM)凭借强大的推理能力和问答能力,已得到广泛应用。然而,由于嵌入式和边缘计算环境对延迟、内存和能耗有着严格限制,将其部署于这些环境中仍然面临挑战。模型庞大的参数量和高昂的计算需求阻碍了其在资源受限平台上的高效运行。尽管模型剪枝已成为一种在保持性能的同时缩小模型规模的可行方案,但对层、注意力头以及多层感知机(MLP)维度进行联合优化仍然十分复杂。对这一组合设计空间进行穷举搜索不仅计算开销巨大,还容易陷入局部最优或产生不稳定的配置。 为解决这些局限性,我们提出了一种面向硬件的多目标结构化剪枝框架。该两阶段方法显式地以延迟和模型大小为优化目标,从而实现模型在边缘设备上的高效部署。在粗粒度阶段,多目标深度剪枝移除完整的注意力模块和 MLP 模块,以降低计算负载和内存占用。在随后的细粒度阶段,并行贝叶斯优化(PBO)在延迟约束下搜索各层最优的剪枝比例,同时利用基于重要性的策略,对每一层在既定预算内需要剪除的具体组件进行排序。实验结果表明,我们的方法能够以极小的常识推理任务和零样本性能损失降低模型复杂度。该方法在准确率、延迟和模型大小之间实现了良好权衡,适用于边缘部署。在多个大型语言模型上,当剪枝比例为 37.5% 和 50% 时,所提出的方法在常识推理任务上的性能优于现有方法,同时显著降低了推理成本。
更新时间: 2026-11-19 11:31:48
领域: cs.AI,cs.CL
BlockJack: Cross-Tenant Redirection Fault Attacks on Paged KV Cache Address Translation in LLM Serving
Large language model (LLM) serving frameworks accelerate inference by retaining previously computed states in a key-value (KV) cache. Paged serving frameworks such as vLLM organize this cache through block tables analogous to OS page tables, which map each request's logical KV blocks to physical KV blocks, forming a software-managed address translation layer. Although fault attacks such as Rowhammer have exploited OS page tables to redirect memory accesses, prior fault attacks on LLMs have largely targeted the data plane, i.e., model weights or KV-cache contents, leaving KV-cache mapping unexplored. We present BlockJack (i.e., Block Hijack), the first KV cache address-translation fault attack in LLM inference. By corrupting block-table entries, BlockJack redirects a request's KV cache reads to blocks assigned to another tenant's request without modifying model parameters, prompts, or cached KV states. It achieves both confidentiality violation (victim information appears in attacker responses) and integrity violation (attacker-supplied context steers victim answers). We study paged KV cache mappings in vLLM and formally characterize when redirect targets are predictable. Across seven models spanning the Qwen, Llama, Gemma, and Phi families, a faulted mapping exposes victim context. For the integrity attack, we examine how topic proximity, intra-topic divergence, and model behavior shape redirected responses. On a 248-scene medical benchmark, the integrity attack causes up to 41.1% of responses to recommend less urgent care, while still appearing consistent with the victim's question. We demonstrate physical feasibility of BlockJack with Rowhammer and subsequently evaluate assignment validation as a defense. Following responsible disclosure, vLLM and Sonar confirmed the vulnerability and proposed patches that we reviewed and validated.
Updated: 2026-11-19 11:31:29
标题: BlockJack:针对大语言模型服务中分页式 KV 缓存地址转换的跨租户重定向故障攻击
摘要: 大语言模型(LLM)服务框架通过保留先前计算得到的状态于键值(KV)缓存中来加速推理。诸如 vLLM 这样的分页服务框架借鉴操作系统页表的设计,通过块表组织该缓存,将每个请求的逻辑 KV 块映射到物理 KV 块,从而形成一层由软件管理的地址转换层。尽管 Rowhammer 等故障攻击已经利用操作系统页表来重定向内存访问,但以往针对 LLM 的故障攻击主要集中于数据平面,即模型权重或 KV 缓存内容,而对 KV 缓存映射的攻击尚未得到研究。 我们提出了 BlockJack(即 Block Hijack),这是首个针对 LLM 推理中 KV 缓存地址转换的故障攻击。BlockJack 通过破坏块表条目,将一个请求的 KV 缓存读取重定向到分配给另一租户请求的块,而无需修改模型参数、提示词或已缓存的 KV 状态。该攻击同时实现了机密性破坏(受害者信息出现在攻击者的响应中)和完整性破坏(攻击者提供的上下文引导受害者生成特定答案)。我们研究了 vLLM 中分页 KV 缓存的映射机制,并从形式上刻画了重定向目标何时具有可预测性。在涵盖 Qwen、Llama、Gemma 和 Phi 系列的七个模型中,一次映射故障即可暴露受害者上下文。针对完整性攻击,我们考察了主题接近度、主题内差异以及模型行为如何影响重定向后的响应。在包含 248 个场景的医疗基准测试中,完整性攻击最多导致 41.1% 的响应建议采取紧迫性较低的医疗护理,同时其内容仍看似与受害者的问题一致。我们通过 Rowhammer 展示了 BlockJack 在物理层面的可行性,并进一步评估了将分配进行验证作为防御措施的效果。在负责任地披露该问题后,vLLM 和 Sonar 均确认了这一漏洞,并提出了我们审查和验证过的修复补丁。
更新时间: 2026-11-19 11:31:29
领域: cs.CR
Can Computation from Earlier Problems Help LLMs Solve New Ones?
Large language models often solve independent problems in the same conversation. Can computation from earlier problems help them solve new ones? Preliminary experiments show that retained history can raise or lower later-turn accuracy, even within the same domain. To trace this effect, we hold each problem fixed and vary its preceding history. The resulting changes in the model's internal states contain a recurring, problem-dependent component. To improve reasoning with retained history, we introduce STAIR (Stale-Token Attention for Inter-query Reuse). It captures attention keys and values from earlier response generation in a read-only bank. STAIR learns to reflect current query vectors to redirect attention over this bank during prompt processing. The backbone and stored entries remain fixed; only 12,288 parameters are trained. Across three Qwen models and four reasoning benchmarks, STAIR improves average later-turn accuracy by up to 11.67 percentage points over the unmodified model with history. The math-trained Qwen3.5-9B controller also improves code generation on HumanEval+ without further training.
Updated: 2026-11-19 11:31:27
标题: 先前问题中的计算能否帮助大语言模型解决新问题?
摘要: 大语言模型经常在同一段对话中解决相互独立的问题。此前问题中的计算结果能否帮助它们解决新问题?初步实验表明,即使在同一领域内,保留的历史信息也可能提高或降低模型后续轮次的准确率。为追踪这一影响,我们固定每个问题,仅改变其前置历史。由此产生的模型内部状态变化包含一种反复出现且依赖于具体问题的成分。为利用保留的历史信息改进推理,我们提出 STAIR(Stale-Token Attention for Inter-query Reuse,陈旧令牌注意力的跨查询复用)。该方法将此前生成响应时的注意力键和值提取出来,存入一个只读库中。STAIR 学习将当前查询向量映射到该库上,以便在提示处理过程中重新定向注意力。骨干模型和存储条目保持不变;仅训练 12,288 个参数。在三个 Qwen 模型和四个推理基准上,与带历史信息的未经修改模型相比,STAIR 将后续轮次的平均准确率最高提升了 11.67 个百分点。经过数学训练的 Qwen3.5-9B 控制器在无需进一步训练的情况下,也能提升 HumanEval+ 上的代码生成效果。
更新时间: 2026-11-19 11:31:27
领域: cs.AI,cs.CL,cs.LG
Gradient Boosting with Kolmogorov-Arnold Units for Interpretable Regression beyond Pairwise Interactions
Interpretable models for tabular regression, such as the explainable boosting machine (EBM), restrict a prediction to main effects and pairwise interactions so that every part of it can be plotted. When the target depends on three or more inputs jointly, this restriction costs accuracy, and a black-box model with post hoc explanations becomes the usual fallback. Here we present MJBoost, a gradient boosting method whose weak learner is a single Kolmogorov-Arnold unit $g(\sum_p φ_p(x_p))$ with penalized spline inner and outer functions. Each unit is fitted in closed form by alternating penalized least squares, starting from principal Hessian directions of the residual, and categorical and missing inputs enter the units directly. Because a unit depends on each input only through one inner function, the fitted model has an exact functional ANOVA decomposition into main effects, pair effects and a higher-order remainder, which one-dimensional convolutions compute. On synthetic targets of interaction order three to six, the test error of MJBoost is up to 13 times lower than that of EBM, and its decomposition recovers the true variance share of every order to within 0.04. On the 35 regression tasks of the OpenML-CTR23 benchmark, it has a lower test RMSE than EBM on 21 tasks and a higher one on 2 (geometric-mean RMSE -29.1%). On these tasks the main and pair effects of the fitted model explain a median 0.992 of its variance, so the model reads as plots where the data allow, and the decomposition measures the higher-order part where they do not. With Newton steps the same algorithm classifies: on 32 binary tasks of OpenML-CC18 its test log-loss is on par with that of EBM, and on 11 multiclass tasks its mean log-loss is lower than that of EBM on 8 and than that of tuned LightGBM on 7.
Updated: 2026-11-19 11:29:45
标题: 利用科尔莫哥洛夫–阿诺德单元的梯度提升:实现超越两两交互的可解释回归
摘要: 适用于表格回归的可解释模型(如可解释提升机,EBM)将预测限制为主效应和成对交互效应,从而使预测的每个部分都可以绘制出来。当目标变量依赖于三个或更多输入变量的联合关系时,这种限制会牺牲准确性,而带有事后解释的黑箱模型便通常成为备选方案。本文提出 MJBoost,这是一种梯度提升方法,其弱学习器是单个 Kolmogorov-Arnold 单元 \(g(\sum_p φ_p(x_p))\),其中的内部函数和外部函数均采用带惩罚项的样条函数。每个单元通过交替进行带惩罚项的最小二乘拟合以闭式求解,并从残差的主 Hessian 方向开始;类别型输入和缺失输入可直接进入这些单元。由于一个单元对每个输入的依赖仅通过一个内部函数实现,拟合后的模型具有精确的函数方差分析分解,包括主效应、成对效应和高阶余项,其中一维卷积可用于计算这些组成部分。在交互阶数为三至六阶的合成目标上,MJBoost 的测试误差最多比 EBM 低 13 倍,并且其分解能够将每个阶数的真实方差占比恢复到误差不超过 0.04 的范围内。在 OpenML-CTR23 基准的 35 个回归任务上,MJBoost 在 21 个任务中的测试 RMSE 低于 EBM,仅在 2 个任务中高于 EBM(几何平均 RMSE 为 -29.1%)。在这些任务中,拟合模型的主效应和成对效应所解释的方差中位数为 0.992,因此在数据允许的情况下,模型可以通过图形直观呈现;在数据不允许的情况下,该分解则能够衡量高阶部分。采用牛顿步后,同一算法类别也可用于分类:在 OpenML-CC18 的 32 个二分类任务上,其测试对数损失与 EBM 相当;在 11 个多分类任务上,其平均对数损失在 8 个任务中低于 EBM,在 7 个任务中低于经过调优的 LightGBM。
更新时间: 2026-11-19 11:29:45
领域: cs.LG
DTS: Delta-Based Tile Scoring for Efficient Long-Context Sparse Attention
Large language models (LLMs) increasingly need to process long documents and codebases, making long-context attention a major prefill bottleneck. Block sparse attention reduces computation by skipping unimportant blocks of the attention matrix, but scoring blocks accurately can itself be expensive. We propose Delta-Based Tile Scoring (DTS), a training-free, content-adaptive tile scoring method for sparse block attention. DTS selects query and key anchors according to local vector changes, using fewer representatives in redundant regions while retaining more detail in heterogeneous regions. To accelerate anchor selection, parallel delta packing partitions the query and key sequences into tile-aligned chunks and performs bounded local scans over these chunks concurrently. The selected tiles are then computed using the original query, key, and value vectors. On LLaMA-3.1-8B-Instruct, DTS keeps average RULER and LongBench scores within 0.10 percentage points of full attention, with RULER evaluated up to 128K tokens. At 128K tokens, DTS reduces measured scoring-pipeline latency by 38% compared with XAttention. On four NVIDIA H100 GPUs, it achieves a 3.3$\times$ prefill speedup over a PyTorch full-attention baseline using FlashAttention-2 at 512K tokens.
Updated: 2026-11-19 11:23:22
标题: DTS:基于增量的分块评分方法,实现高效的长上下文稀疏注意力
摘要: 大型语言模型(LLM)日益需要处理长文档和大型代码库,使长上下文注意力成为预填充阶段的主要瓶颈。块稀疏注意力通过跳过注意力矩阵中不重要的块来减少计算量,但准确评估这些块本身可能代价高昂。我们提出了基于增量的瓦片评分方法(Delta-Based Tile Scoring,DTS),这是一种无需训练、能够适应内容的稀疏块注意力瓦片评分方法。DTS 根据局部向量变化选择查询锚点和键锚点:在冗余区域使用较少的代表向量,同时在异质区域保留更多细节。为加速锚点选择,增量并行打包将查询序列和键序列划分为与瓦片对齐的块,并在这些块上并发执行有界局部扫描。随后,使用原始的查询、键和值向量计算所选瓦片。 在 LLaMA-3.1-8B-Instruct 上,DTS 的 RULER 和 LongBench 平均得分与完整注意力的差距保持在 0.10 个百分点以内,其中 RULER 的评估长度最高达到 128K 个词元。在 128K 个词元下,与 XAttention 相比,DTS 将测得的评分流水线延迟降低了 38%。在四块 NVIDIA H100 GPU 上,处理 512K 个词元时,相较于使用 FlashAttention-2 的 PyTorch 完整注意力基线,DTS 实现了 3.3 倍的预填充加速。
更新时间: 2026-11-19 11:23:22
领域: cs.LG
Hellinger Decision Trees for Density Ratio Estimation: Finite-Sample Guarantees
Density ratios play a central role in two-sample comparison, distribution-shift adaptation, and generative-model evaluation. However, estimating a density ratio through separate estimation of the underlying densities can be unnecessarily challenging. In this paper, we develop a direct approach to the log density ratio estimation by minimizing a balanced Hellinger risk over additive ensembles of axis-aligned decision trees, trained using Newton boosting. We establish finite-sample guarantees for the estimator produced by the algorithm and derive an explicit convergence rate. Under suitable tail and Hölder smoothness conditions, together with an additional assumption on the progress made at each boosting iteration, our rate matches, up to logarithmic factors, the classical minimax-optimal $ \mathscr{L}^{2} $ rate for function estimation. A key technical contribution is an optimization analysis that exploits the special exponential structure of the Hellinger risk. In particular, we show that the decrease in the second-order Taylor approximation (which is computable) of the empirical risk controls the actual decrease in that risk, yielding a direct optimization guarantee for the boosting algorithm. This allows us to establish statistical convergence guarantees for the algorithm's output without relying on an idealized empirical-risk minimizer. Experiments on synthetic data corroborate the predicted convergence behavior, while experiments on public datasets demonstrate the practical effectiveness of the proposed estimator.
Updated: 2026-11-19 11:23:10
标题: 用于密度比估计的赫林格决策树:有限样本保证
摘要: 密度比在双样本比较、分布偏移适应和生成模型评估中发挥着核心作用。然而,通过分别估计底层密度来估计密度比,可能会带来不必要的挑战。本文提出了一种直接估计对数密度比的方法:在由轴对齐决策树构成的加性集成模型上,最小化平衡的 Hellinger 风险,并使用牛顿提升进行训练。我们为该算法产生的估计量建立了有限样本保证,并推导出明确的收敛速率。在适当的尾部条件和 Hölder 光滑性条件下,再结合关于每次提升迭代所取得进展的额外假设,我们的速率与经典的函数估计 minimax 最优 $\mathscr{L}^{2}$ 速率仅相差对数因子。本文的一项关键技术贡献是对优化过程的分析,该分析利用了 Hellinger 风险的特殊指数结构。具体而言,我们证明,经验风险的二阶泰勒近似(可计算)的下降量能够控制该风险的实际下降量,从而为提升算法提供直接的优化保证。这使我们能够在不依赖理想化经验风险最小化器的情况下,为算法输出建立统计收敛保证。在合成数据上的实验验证了所预测的收敛行为,而在公开数据集上的实验则展示了所提出估计量的实际有效性。
更新时间: 2026-11-19 11:23:10
领域: stat.ML,cs.LG
TELEVAL: A Benchmark Designed for Spoken Language Models in Chinese Interactive Scenarios
Spoken Language Models (SLMs) are expected to support natural spoken interaction beyond task completion. Existing benchmarks assess a range of semantic tasks and conversational capabilities. However, high task scores do not necessarily imply reliable and appropriate spoken interaction. To address this gap, we introduce TELEVAL, a large-scale benchmark focused on Chinese spoken interaction. It evaluates responses to spoken inputs without additional task-specific prompts or predefined answer options. TELEVAL covers two complementary aspects: (1) Reliable Content Fulfillment, which measures semantic accuracy under diverse acoustic and linguistic conditions, and (2) Interactional Appropriateness, which assesses conversational naturalness and appropriate adaptation to auditory cues. Experiments reveal limitations in both aspects. Strong results on factual question-answering datasets do not consistently extend to locally relevant knowledge or challenging speech conditions, such as Chinese cultural questions and dialectal speech. Models also struggle to adapt their responses to auditory cues, even in cases where they explicitly recognize them. We further document a recurring failure pattern, termed the "Caption Trap", in which some responses describe a perceived auditory cue instead of addressing the user's conversational needs. Overall, the evaluated SLMs struggle to deliver consistently accurate and conversationally appropriate responses. TELEVAL provides a diagnostic framework for evaluating both content reliability and conversational adaptation.
Updated: 2026-11-19 11:22:31
标题: TELEVAL:面向中文交互场景语音语言模型的基准测试
摘要: 语音语言模型(SLM)应当能够支持超越任务完成的自然口语交互。现有基准涵盖一系列语义任务和对话能力。然而,较高的任务得分并不一定意味着模型能够进行可靠且恰当的口语交互。为弥补这一缺口,我们推出了 TELEVAL,这是一个专注于中文口语交互的大规模基准。该基准在不提供额外任务专用提示或预设答案选项的情况下,评估模型对语音输入的响应。TELEVAL涵盖两个互补方面:(1)可靠的内容完成度,用于衡量模型在多样声学和语言条件下的语义准确性;(2)交互恰当性,用于评估对话的自然度以及对听觉线索的适当适应能力。实验揭示了模型在这两个方面均存在局限。模型在事实性问答数据集上的出色表现,无法稳定迁移到与本地相关的知识或具有挑战性的语音条件,例如中国文化问题和方言语音。即使模型能够明确识别听觉线索,也往往难以据此调整回应。我们进一步记录了一种反复出现的失败模式,称为“字幕陷阱”(Caption Trap):模型将回应用于描述所感知到的听觉线索,而不是回应用户在对话中的实际需求。总体而言,经过评估的语音语言模型难以持续提供准确且符合对话情境的回应。TELEVAL为评估内容可靠性和对话适应能力提供了一个诊断框架。
更新时间: 2026-11-19 11:22:31
领域: cs.CL,cs.AI,cs.SD,eess.AS
ArrivalBench: Agent-Generated Data Pipelines Are Correct Once and Wrong Under Time
Benchmarks for agent-generated data work grade a pipeline by running it once against a fixed snapshot. ArrivalBench instead re-executes the pipeline an agent leaves behind under adversarial but replayable delivery schedules (late, duplicated, out-of-order and retried records) and requires its final state to equal a batch recomputation of the complete log. Because the oracle recomputes rather than classifies, a wrong table and a crash are distinct verdicts: a crash is visible to monitoring a team already runs, and a wrong table is not. On 40 tasks we built, our reimplementation of single-execution grading certifies 86-100% of the pipelines eleven models produce; re-executing the same artifacts finds 7.0-79.2% of the certified ones silently wrong. The gap is not produced by the repair loop: within the same model and task, pipelines repaired against the snapshot test fail replay about as often as those that passed it first time. In every model, idempotency hazards fail more often than ordering hazards. Separating a wrong answer from a crash also changes how interventions read: a hazard warning cuts one model's silent failure from 48.2% to 10.5% while raising its crash rate from 9.0% to 37.0%, so all-in failure moves only from 51.0% to 44.0%. All eleven arms were independently re-run, and rates moved by at most 5.9 points.
Updated: 2026-11-19 11:19:39
标题: ArrivalBench:智能体生成的数据管道一次正确,却在时间变化下出错
摘要: 针对智能体生成数据工作的基准测试,通常通过让数据处理流水线在固定快照上运行一次来进行评估。ArrivalBench 则会在具有对抗性但可重放的交付计划下,重新执行智能体留下的流水线,其中包括延迟、重复、乱序和重试的记录,并要求其最终状态与对完整日志进行批量重算的结果一致。由于判定标准是重新计算而非分类,错误的表和程序崩溃属于不同的判定结果:团队已经运行的监控能够发现崩溃,却无法发现错误的表。 在我们构建的 40 个任务上,对单次执行评估的复现表明,11 个模型生成的流水线中有 86%—100% 能通过认证;而对相同产物重新执行后发现,其中 7.0%—79.2% 虽已通过认证,实际上却会在无提示的情况下产生错误。这个差距并非由修复循环造成:在同一模型和同一任务内,针对快照测试进行修复的流水线,其重放失败率与首次运行即通过快照测试的流水线大致相同。在每个模型中,幂等性隐患导致的失败都比排序隐患更为常见。 将错误结果与崩溃区分开来,也会改变对干预措施的解读:一项隐患警告使某个模型的无提示失败率从 48.2% 降至 10.5%,但同时使其崩溃率从 9.0% 升至 37.0%,因此总体失败率仅从 51.0% 降至 44.0%。11 个实验组均经过独立重跑,结果比例的变化最多为 5.9 个百分点。
更新时间: 2026-11-19 11:19:39
领域: cs.LG,cs.DB
TabPFN: One Model to Rule Them All?
Hollmann et al. (Nature 637 (2025) 319-326) recently introduced TabPFN, a transformer-based deep learning model for regression and classification on tabular data, which they claim "outperforms all previous methods on datasets with up to 10,000 samples by a wide margin, using substantially less training time." Furthermore, they have called TabPFN a "foundation model" for tabular data, as it can support "data generation, density estimation, learning reusable embeddings and fine-tuning". In this paper, we provide a tailored explanation of how TabPFN works for a statistics audience, by emphasizing its interpretation as approximate Bayesian inference. We then explore the significance of TabPFN to the field of statistics: We show that an out-of-the-box application of TabPFN can sometimes outperform specialized state-of-the-art methods for semi-supervised parameter estimation, prediction under covariate shift, and heterogeneous treatment effect estimation. As a partial explanation for the predictive effectiveness of TabPFN, we show that it can simultaneously adapt to both nonparametric structure and parametric structure, for instance, sometimes outperforming LASSO even when assumptions are correctly specified. All experiments can be reproduced using the code provided at https://github.com/qinglong-tian/tabpfn_study (https://github.com/qinglong-tian/tabpfn_study).
Updated: 2026-11-19 11:19:00
标题: TabPFN:一个模型统治一切?
摘要: Hollmann 等人(《自然》637(2025):319–326)最近推出了 TabPFN,这是一种基于 Transformer 的深度学习模型,用于表格数据上的回归与分类。他们声称,该模型“在样本量不超过 10,000 的数据集上,以显著优势超越了此前的所有方法,同时所需训练时间大幅减少”。此外,他们还将 TabPFN 称为表格数据领域的“基础模型”,因为它能够支持“数据生成、密度估计、学习可复用的嵌入以及微调”。 在本文中,我们面向统计学读者,对 TabPFN 的工作原理进行了专门阐释,重点强调将其理解为近似贝叶斯推断。随后,我们探讨 TabPFN 对统计学领域的重要意义:我们表明,直接应用 TabPFN,有时能够在半监督参数估计、协变量偏移下的预测以及异质性处理效应估计方面,超越专门设计的最先进方法。作为解释 TabPFN 预测有效性的一部分,我们表明它能够同时适应非参数结构与参数结构;例如,即使模型假设被正确指定,它有时仍能超越 LASSO。所有实验均可使用以下网址提供的代码复现:https://github.com/qinglong-tian/tabpfn_study(https://github.com/qinglong-tian/tabpfn_study)。
更新时间: 2026-11-19 11:19:00
领域: cs.LG,stat.ME,stat.ML
Question, Then Affirm: Restoring Commitment Does Not Restore Refusal
We find that safeguards for image generation can be bypassed without changing what a message says. A sign stating a harmful proposition is blocked, but the same proposition phrased as a question and followed by a check mark is generated, even though the resulting image endorses the original claim. On a 300-case challenge set, gpt-image-2 returns images for 43.3% of question-affirmation requests versus 16.3% of direct statements, with 41.3% versus 15.3% of cases yielding images that endorse the original proposition. We define this as Deferred Semantic Commitment (DSC): commitment is withdrawn by the question and restored by a separate element, while safety behavior follows only the withdrawal. To investigate why, we study an open-weight language model and find that re-endorsement only partially reverses the refusal-related change introduced by questioning. These findings reveal a mismatch between recovered meaning and refusal behavior, motivating safeguards that assess the completed message rather than its individual elements.
Updated: 2026-11-19 11:10:57
标题: 先提问,再肯定:恢复承诺并不会恢复拒绝能力
摘要: 我们发现,无需改变消息所表达的内容,即可绕过图像生成的安全防护。带有有害命题的标语会被拦截,但将同一命题改写为疑问句并在其后加上一个对勾后,系统却会生成图像,尽管生成的图像实际上认可了原始主张。在一个包含300个案例的挑战集上,gpt-image-2对“疑问句—肯定符号”请求的图像返回率为43.3%,而对直接陈述的返回率为16.3%;其中,分别有41.3%和15.3%的案例生成了认可原始命题的图像。我们将这一现象定义为“延迟语义承诺”(Deferred Semantic Commitment,DSC):疑问句撤回了承诺,而另一个独立元素又恢复了承诺,但安全行为只遵循了前者的撤回。为探究其原因,我们研究了一个开放权重语言模型,发现重新肯定仅能部分逆转提问所引入的、与拒答相关的变化。这些发现揭示了恢复后的语义与拒答行为之间存在不匹配,说明安全防护应评估完整的消息,而不是分别评估其中的各个元素。
更新时间: 2026-11-19 11:10:57
领域: cs.CR
Optimizer-dependent training dynamics converge to the same one-third optimal data scaling
Neural scaling, in which loss falls as a power law with training, is central to large language models, and one recent proposal is that a $1/3$ exponent emerges from learning peaked distributions. That account describes SGD, but models in practice are trained with adaptive optimizers. Here we separate two exponents the $1/3$ account does not distinguish: how fast the loss falls with training steps along a single run, and how fast the optimally tuned loss falls with dataset size $D$. We show that the first, a dynamic exponent, is optimizer-specific while the second, an optimal data exponent, converges to $1/3$ across optimizers. In an online teacher-student model we decompose the loss into norm growth (radial) and alignment toward the teacher direction (tangential), each decaying as a power law with dynamic exponents $α_{r}$ and $α_{t}$. Under SGD, both are close to $1/3$, so the data exponent is also $1/3$ across different learning rates. Under Adam the two separate: $α_{r} \simeq 0.48$ but $α_{t} \simeq 0.08$. Since the total loss is minimized when these two parts are balanced, the optimal learning rate is optimizer-dependent: $D$-independent for SGD but falls with $D$ for Adam. Yet tuned to that optimum, the loss returns to $D^{-1/3}$ for both. A stochastic-dynamics analysis explains why: the optimizers can trade decay speed between the two channels, but they all fall on a single dynamic exponent relation, $2α_{r}+ α_{t} = 1$, which fixes the optimal data exponent at $1/3$. Across seven optimizers, including Muon, the measured exponents are consistent with this relation, and the optimal-loss envelopes agree with $D^{-1/3}$ across them. The optimizer sets how fast a model learns per step; tuned optimally, it changes the prefactor but not the rate at which loss falls per sample.
Updated: 2026-11-19 11:10:06
标题: 依赖优化器的训练动态收敛于相同的三分之一最优数据缩放规律
摘要: 神经网络缩放律指的是损失随着训练进行按幂律下降,这一现象是大语言模型的核心特征之一。近期有一种观点认为,在学习尖峰分布时会出现 \(1/3\) 的指数。该理论描述的是随机梯度下降(SGD),但实际模型通常使用自适应优化器进行训练。本文区分了 \(1/3\) 理论未加区分的两个指数:单次训练过程中损失随训练步数下降的速度,以及经过最优调参后损失随数据集大小 \(D\) 下降的速度。我们表明,第一个指数即动态指数取决于优化器,而第二个指数即最优数据指数则会在不同优化器下趋近于 \(1/3\)。 在一个在线教师—学生模型中,我们将损失分解为范数增长(径向分量)和朝向教师方向的对齐(切向分量),二者分别以动态指数 \(\alpha_r\) 和 \(\alpha_t\) 按幂律衰减。在 SGD 下,这两个指数都接近 \(1/3\),因此对于不同学习率,数据指数也均为 \(1/3\)。在 Adam 下,两者发生分离:\(\alpha_r \simeq 0.48\),而 \(\alpha_t \simeq 0.08\)。由于总损失在这两个部分达到平衡时最小,最优学习率取决于优化器:对于 SGD,它与 \(D\) 无关;而对于 Adam,它会随 \(D\) 的增大而下降。然而,在调至该最优值后,两种优化器的损失都重新呈现 \(D^{-1/3}\) 的缩放关系。 随机动力学分析解释了这一现象:优化器可以在两个通道之间调配衰减速度,但它们都满足同一个动态指数关系 \(2\alpha_r+\alpha_t=1\),从而将最优数据指数固定为 \(1/3\)。在包括 Muon 在内的七种优化器中,测得的指数均与这一关系一致,并且它们的最优损失包络都符合 \(D^{-1/3}\) 的缩放律。优化器决定模型每一步学习的速度;在进行最优调参后,它会改变前因子,但不会改变损失随样本数量下降的速率。
更新时间: 2026-11-19 11:10:06
领域: cs.LG
Fast-JEPA: Advancing the Success-Latency Frontier for Latent World Models
Latent world models predict the outcomes of action sequences, but comparing candidate plans through recursive rollout remains expensive at test time. We introduce Fast-JEPA, a latent world model planning framework that advances the success-latency Pareto frontier of predictive search. Fast-JEPA reorganizes predictive computation to support effective action-sequence search at low planning cost. It constructs a goal-directed plan to guide search and directly predicts the outcomes of complete candidates for efficient comparison, avoiding recursive state rollout during refinement. Across PushT, Reacher, Cube, and TwoRoom, Fast-JEPA achieves 96.50% average success rate with 2.41x faster planning than INTACT. Search-budget sweeps show that its competitive success and low latency extend across candidate counts and refinement depths. We further introduce DynaGoal, a benchmark for evaluating world-model planning under dynamic out-of-distribution conditions, execution deadlines, and controlled response delays. Fast-JEPA achieves average success rates of 73.83% on DynaGoal-Shift and 87.67% on DynaGoal-Deadline, demonstrating the practical value of low-latency predictive planning under changing control conditions and execution-time constraints. Our code is available at https://github.com/Sofilyzia/Fast-JEPA.
Updated: 2026-11-19 11:09:58
标题: Fast-JEPA:推进潜在世界模型的成功率—延迟前沿
摘要: 潜在世界模型能够预测动作序列的结果,但在测试时通过递归展开比较候选计划仍然代价高昂。我们提出 Fast-JEPA,这是一种潜在世界模型规划框架,推动了预测式搜索在成功率—延迟帕累托前沿上的发展。Fast-JEPA 重新组织预测计算,以较低的规划成本实现有效的动作序列搜索。该方法构建目标导向的计划以引导搜索,并直接预测完整候选计划的结果,从而高效比较候选方案,避免在细化过程中进行递归状态展开。在 PushT、Reacher、Cube 和 TwoRoom 任务中,Fast-JEPA 的平均成功率达到 96.50%,规划速度比 INTACT 快 2.41 倍。搜索预算测试表明,在不同候选数量和细化深度下,该方法均能保持具有竞争力的成功率和较低的延迟。我们进一步提出 DynaGoal 基准,用于评估世界模型在动态分布外条件、执行截止期限和受控响应延迟下的规划能力。Fast-JEPA 在 DynaGoal-Shift 和 DynaGoal-Deadline 上分别取得 73.83% 和 87.67% 的平均成功率,表明在控制条件变化和执行时间受限的情况下,低延迟预测式规划具有实际应用价值。我们的代码已发布于 https://github.com/Sofilyzia/Fast-JEPA。
更新时间: 2026-11-19 11:09:58
领域: cs.RO,cs.AI
ROAM-GRPO: Enforcing Reasoning Diversity in GRPO via Routed Off-mode Approach Mining
Supervised fine-tuning (SFT) paired with Reinforcement Learning with Verifiable Rewards (RLVR) has become the dominant recipe for post-training LLMs on complex reasoning tasks, but has been shown to collapse the policy into a low-diversity mode. Repeated LLM outputs are nearly identical, and pass@k accuracy converges or degrades as a result. We propose ROAM-GRPO (Routed Off-mode Approach Mining for GRPO), an augmentation to the GRPO algorithm which incentivizes exploration of distinct reasoning strategies and aims to increase output creativity during evaluation. ROAM-GRPO detects well-solved problems during training and transfers them to an "off-mode" track. The model is prompted to produce distinct solution strategies to such problems, which are verified for logical validity and distinctness by an LLM judge and subsequently self-distilled into the policy. Training Qwen3.5-2b on a 1,000-problem subset of the MATH lvl5 dataset, ROAM-GRPO implementation increases peak pass@16 by 4.7% and correct embedding cosine distance by approximately 1.5-2x on a difficult evaluation set.
Updated: 2026-11-19 11:09:34
标题: ROAM-GRPO:通过路由式离线方法挖掘强化GRPO中的推理多样性
摘要: 监督微调(SFT)与可验证奖励强化学习(RLVR)相结合,已成为针对复杂推理任务进行大语言模型后训练的主流方案,但已有研究表明,这种方法会使策略坍缩到低多样性模式。大语言模型生成的重复输出几乎完全相同,导致 pass@k 准确率趋于收敛甚至下降。我们提出 ROAM-GRPO(面向 GRPO 的路由式偏离模式方法挖掘),这是对 GRPO 算法的一种增强方法,旨在激励模型探索不同的推理策略,并在评估过程中提高输出的创造性。ROAM-GRPO 会检测训练期间已成功解决的问题,并将其转移至“偏离模式”轨道。模型被要求针对这些问题生成不同的解题策略,随后由大语言模型评审器验证其逻辑有效性与差异性,并通过自蒸馏将其融入策略。在 MATH lvl5 数据集的一个包含 1,000 道题目的子集上训练 Qwen3.5-2b 后,ROAM-GRPO 的实现使峰值 pass@16 提高了 4.7%,并使困难评估集上正确解答之间的嵌入余弦距离提高了约 1.5 至 2 倍。
更新时间: 2026-11-19 11:09:34
领域: cs.AI
Best-of-Depth: Learning Exploratory Dynamics in Looped Transformers
Looped Transformers extend inference-time computation through repeated latent-state updates, but final-depth training does not directly encourage useful intermediate alternatives. We introduce Best-of-Depth (BoD), which trains a recurrent trajectory as a candidate set by minimizing prediction loss across depths. Different valid targets can be matched at different depths without architectural changes or depth-specific labels. An exact-match analysis connects this objective to solution coverage. On N-Queens completion and graph coloring, BoD improves coverage over final-depth and intermediate-supervision objectives. N-Queens coverage reaches 91.03%, versus 45.75% for final-depth training. Further experiments show discovery beyond the training depth and recovery of solutions withheld from teacher pools on familiar inputs. Fine-tuning a pretrained looped language model with BoD yields higher pooled code-generation success than final-depth training when programs are generated separately at evaluated fixed depths. These results support training recurrent computation for solution discovery along its trajectory.
Updated: 2026-11-19 11:07:52
标题: 深度优选:学习循环式 Transformer 中的探索性动态奠定
摘要: 循环 Transformer 通过反复更新潜在状态来扩展推理时的计算量,但仅在最终深度进行训练,并不能直接促使模型学习有用的中间候选解。我们提出 Best-of-Depth(BoD)方法,通过在不同深度上最小化预测损失,将循环轨迹训练为候选解集合。不同的有效目标可以在不同深度与模型匹配,无需改变架构,也无需深度特定的标签。精确匹配分析将这一目标与解的覆盖率联系起来。在 N 皇后问题补全和图着色任务上,BoD 的覆盖率优于最终深度训练和中间监督目标。N 皇后问题的覆盖率达到 91.03%,而最终深度训练仅为 45.75%。进一步实验表明,模型能够发现超出训练深度的新解,并在熟悉的输入上恢复教师候选池中被刻意隐去的解。对预训练循环语言模型进行 BoD 微调后,在评估所设定的固定深度上分别生成程序时,其代码生成成功率的汇总结果高于最终深度训练。这些结果支持通过训练循环计算,使模型能够沿着其轨迹发现解。
更新时间: 2026-11-19 11:07:52
领域: cs.LG,cs.AI
A Lightweight Hybrid Approach for Milling Force Reconstruction from Internal Machine Signals
Data-driven monitoring based on milling force can enable advanced manufacturing services including process optimization and condition monitoring. However, industrial implementation is often hindered by costly and intrusive hardware and large training data requirements. This paper therefore presents a hybrid approach using machine-internal signals and machining metadata to enable force-based monitoring on brownfield machines without additional sensors. Commonly available machine signals have relatively low sampling rates and cannot directly represent high-frequency milling-force variations, especially at higher spindle speeds. Instead of learning the complete force signal, which would increase model complexity, data requirements, and overfitting risk, a supervised machine-learning model predicts only the average milling force from selected machine-signal features and machining parameters. This low-frequency estimation parameterizes a static milling force model that reconstructs the force behavior over one spindle revolution. Although the static model does not reproduce all dynamic effects, it captures the force distribution, load levels, and angular regions of highest tool engagement. The approach is evaluated on one milling machine across varying process parameters, engagement conditions, cutting tools, and two workpiece materials. Dynamometer measurements are required only for development and validation. Ridge regression achieves an $R^2$ of $0.984$ and $0.991$ for average-force prediction on the test data ($\bar{F}_x$ and $\bar{F}_y$). The reconstructed force behavior over one spindle revolution achieves an $R^2$ of $0.962$ and $0.982$ ($F_x$ and $F_y$) compared with the reconstruction based on measured force features. The method provides a cost and computationally efficient basis for process monitoring, tool condition assessment, and process optimization on existing machines.
Updated: 2026-11-19 11:06:07
标题: 一种基于机床内部信号的轻量级铣削力重构混合方法
摘要: 基于铣削力的数据驱动监测能够支持过程优化和状态监测等先进制造服务。然而,昂贵且具有侵入性的硬件以及对大量训练数据的需求,往往阻碍了其在工业中的实施。因此,本文提出了一种混合方法,利用机器内部信号和加工元数据,使无需额外传感器的力基础监测能够应用于既有设备。常用的机床信号采样率相对较低,无法直接表征高频铣削力变化,尤其是在较高主轴转速下。本文不对完整力信号进行学习,因为这会增加模型复杂度和数据需求,并提高过拟合风险,而是采用监督式机器学习模型,根据选定的机床信号特征和加工参数,仅预测平均铣削力。该低频估计值用于参数化静态铣削力模型,从而重构一个主轴旋转周期内的力行为。尽管静态模型无法再现所有动态效应,但能够捕捉力的分布、载荷水平以及刀具啮合程度最高的角度区域。该方法在一台铣床上进行了评估,测试范围涵盖不同的工艺参数、啮合条件、切削刀具以及两种工件材料。测力计仅用于方法开发和验证。在测试数据上,岭回归对平均力($\bar{F}_x$ 和 $\bar{F}_y$)的预测分别取得了0.984和0.991的$R^2$值。与基于实测力特征的重构结果相比,重构的一个主轴旋转周期内的力行为($F_x$ 和 $F_y$)分别取得了0.962和0.982的$R^2$值。该方法为现有机床上的过程监测、刀具状态评估和过程优化提供了一种成本低且计算高效的基础。
更新时间: 2026-11-19 11:06:07
领域: cs.LG
Towards Embodied Air-Ground Cooperative Object Search: Benchmark, Dataset and Agentic Method
Air-Ground Object Search (AGOS) in urban environments is a challenging embodied task, which requires an Unmanned Aerial Vehicle (UAV) and an Unmanned Ground Vehicle (UGV) to jointly search for and verify a specified target vehicle from multi-view visual references. To study this underexplored problem, we introduce AGOS-Bench, the first dedicated benchmark for evaluating whether general-purpose Vision-Language Models (VLMs) can integrate aerial discoveries and ground-level verification through UAV-UGV cooperation. We further provide AGOS-Dataset as the companion resource of exemplary trajectories constructed by an automatic pipeline. It consists of 7.7k episodes for searching objects of diverse categories and attributes, spanning three difficulty levels. To address the AGOS task, we propose AGOS-Agent, a training-free and tool-augmented approach. The agentic method relieves VLMs from complex and dynamic coordination via a deliberate search-handoff-verify cooperation protocol, only demanding VLMs for scene understanding and decision-making. Extensive experiments on nine VLMs show that AGOS-Agent improves overall success rate for eight of the nine evaluated backbones while reducing decision steps for all nine. On the hard split, the SR and SPL of Gemini-3.6-Flash increase from 8.6% to 55.7% and from 7.6% to 44.0%, respectively.
Updated: 2026-11-19 11:05:40
标题: 迈向具身空地协同目标搜索:基准、数据集与智能体方法
摘要: 城市环境中的空地目标搜索(Air-Ground Object Search,AGOS)是一项具有挑战性的具身任务,要求无人机(UAV)与无人地面车(UGV)协同搜索目标,并根据多视角视觉参考对指定车辆进行验证。为研究这一尚未得到充分探索的问题,我们提出了 AGOS-Bench,这是首个专门用于评估通用视觉语言模型(VLM)能否通过无人机—无人地面车协作,整合空中发现与地面验证能力的基准。我们进一步提供了 AGOS-Dataset,作为配套资源,其中包含通过自动化流程构建的示例轨迹。该数据集包含 7.7 千个回合,涵盖不同类别和属性的目标搜索任务,并分为三个难度等级。 为解决 AGOS 任务,我们提出了 AGOS-Agent,一种无需训练且工具增强的方法。该智能体方法通过审慎设计的“搜索—交接—验证”协作协议,减轻了视觉语言模型进行复杂动态协调的负担,仅要求视觉语言模型完成场景理解与决策。针对九种视觉语言模型的大量实验表明,AGOS-Agent 在九个评估骨干模型中的八个上提升了总体成功率,同时减少了全部九个模型的决策步数。在困难划分上,Gemini-3.6-Flash 的成功率(SR)和成功路径长度加权指标(SPL)分别从 8.6% 提升至 55.7%,以及从 7.6% 提升至 44.0%。
更新时间: 2026-11-19 11:05:40
领域: cs.CV,cs.AI
Predictive Self-Supervised Learning Provably Identifies Stochastic Signals under Nuisance
Self-supervised learning (SSL) by predicting in latent space, without generating the input data itself, learns highly abstract, useful representations. Intuitively, this success is often attributed to its ability to discard nuisance information that is irrelevant to prediction. However, this poses a conundrum: both stochastic variation in a prediction-relevant latent signal and true nuisance make observations partly unpredictable; how could they be distinguished? Surprisingly, we prove that common SSL methods can achieve exactly this, by implicitly instantiating a latent-variable model with stochastic dynamics and observation-private nuisance. We trace their ability to recover the stochastic signal to two complementary principles: Predictive mutual information maximization ensures that representations retain the information needed for prediction, while latent distribution matching constrains how this information is encoded, thereby making the retained signal identifiable. We confirm this identifiability result in simulations for Gaussian predictors, which recover the true signal up to an affine transformation even in dynamic, nuisance-laden environments.
Updated: 2026-11-19 11:04:27
标题: 预测性自监督学习能够可靠地识别干扰因素下的随机信号
摘要: 通过在潜在空间中进行预测,而不生成输入数据本身,自监督学习(SSL)能够学习高度抽象且有用的表征。直观而言,这种成功通常被归因于其能够丢弃与预测无关的干扰信息。然而,这也带来了一个难题:预测相关潜在信号中的随机变化与真正的干扰因素都会使观测结果具有部分不可预测性;那么,如何区分二者?令人惊讶的是,我们证明,常见的 SSL 方法能够恰恰做到这一点,其方式是隐式地构建一个具有随机动态和观测专属干扰因素的潜变量模型。我们将其恢复随机信号的能力追溯到两个互补原则:预测互信息最大化确保表征保留预测所需的信息,而潜在分布匹配则约束这些信息的编码方式,从而使所保留的信号具有可辨识性。我们在高斯预测器的模拟实验中验证了这一可辨识性结果:即使在具有动态性且充满干扰因素的环境中,模型也能将真实信号恢复到一个仿射变换的程度。
更新时间: 2026-11-19 11:04:27
领域: cs.LG,cs.AI
LIFT: Latent Flow Matching for Probabilistic Cell Fate Dynamics with Single Cell Snapshots
Lineage tracing links cell states through clonal ancestry, but does not generally identify unique source-descendant pairings. Learning from such data therefore requires a model of conditional outcomes, rather than only the terminal population distribution. We introduce LIFT, a latent flow framework for probabilistic cell-state generation from lineage-informed couplings. Variational inference encodes alternative outcomes in a latent space, while a conditional prior enables sampling from the initial state alone. A Mean Flow decoder predicts future cell state directly, requiring one decoder evaluation per sampling, which makes it convenient to predict cell fate through large scale Monte-Carlo sampling. This construction combines a representation of one-to-many relationships with efficient sampling and an analysis of conditional prediction error. Experiments on synthetic and real datasets demonstrate LIFT's ability to recover both population distribution and cell fate probabilities.
Updated: 2026-11-19 11:04:01
标题: LIFT:基于潜在流匹配和单细胞快照的概率性细胞命运动力学
摘要: 谱系追踪通过克隆祖先关系将细胞状态联系起来,但通常无法确定唯一的起始细胞—后代细胞配对。因此,从这类数据中进行学习需要建立条件结果模型,而不仅仅是终末细胞群体分布模型。我们提出 LIFT,一种基于潜在流的框架,用于从谱系信息引导的耦合关系中对细胞状态进行概率生成。变分推断将不同的可能结果编码到潜在空间中,而条件先验则支持仅根据初始状态进行采样。Mean Flow 解码器直接预测未来细胞状态,每次采样只需进行一次解码器评估,因此适合通过大规模蒙特卡洛采样预测细胞命运。该方法结合了对一对多关系的表示能力、高效采样以及对条件预测误差的分析。对合成数据集和真实数据集的实验表明,LIFT 能够恢复群体分布和细胞命运概率。
更新时间: 2026-11-19 11:04:01
领域: cs.LG
Many Solutions, One Answer: Search Order Shapes the Default Solutions of Language Models
When a constraint puzzle has several correct answers, language models tend to give the same one.We study four open-weight models from three families on symbolic puzzles and multi-solution ZebraLogic variants with exactly known solution sets.Repeated samples concentrate on one default solution far beyond uniform sampling, and different models often share it.Yet models usually produce even rarely sampled solutions when added clues uniquely identify them.On held-out symbolic puzzles, we compare visiting entities in name order with visiting those with the fewest initial candidates first. Both searches try values in the stated order. Where their pre-specified predictions differ, the latter matches a larger share of responses in all four models, by 26 to 40 percentage points.Reversing the stated value order or specifying a search order shifts responses towards the solution that the new order favours, on both testbeds. Randomising the presentation or supplying a random search order raises breadth (the effective share of solutions in use) by 26 to 42 percentage points on the symbolic task and 11 to 26 on ZebraLogic. The largest observed validity losses are 3 and 4 percentage points, respectively. Randomised presentation broadens answers more than a random-choice instruction in each of the three main models.
Updated: 2026-11-19 11:03:58
标题: 解法众多,答案唯一:搜索顺序塑造语言模型的默认解答
摘要: 当一个约束谜题有多个正确答案时,语言模型往往会给出同一个答案。我们在符号谜题和具有多个解的 ZebraLogic 变体上,研究了来自三个系列的四个开放权重模型;这些任务的正确解集合均已精确确定。重复采样会使输出极度集中于某一个默认解,远超均匀采样所能达到的程度,而且不同模型往往会共享这一默认解。然而,当加入的线索能够唯一确定某个解时,模型通常仍能生成那些采样频率很低的解。 在留出的符号谜题上,我们比较了两种搜索方式:按名称顺序访问实体,以及优先访问初始候选项最少的实体。两种搜索方式都按题目给出的顺序尝试取值。在两种搜索方式预先预测结果不同的情况下,后者在四个模型中都能与更大比例的回答相匹配,优势为26至40个百分点。 颠倒题目中给出的取值顺序,或指定一种搜索顺序,都会使回答倾向于该新顺序所偏好的解;这一现象在两个测试集上都成立。随机化题目呈现顺序,或提供随机搜索顺序,会提高答案广度,即实际使用中的解所占比例:在符号任务上提高26至42个百分点,在 ZebraLogic 上提高11至26个百分点。观察到的最大有效性损失分别为3个百分点和4个百分点。在三个主要模型中,随机化题目呈现顺序比要求模型随机选择更能拓宽答案范围。
更新时间: 2026-11-19 11:03:58
领域: cs.CL,cs.AI
Gradient Regularized Newton Boosting Trees with Global Convergence
Gradient Boosting Decision Trees (GBDTs) dominate tabular machine learning, with modern implementations like XGBoost, LightGBM, and CatBoost being based on Newton boosting: a second-order descent step in the space of decision trees. Despite its empirical success, the global convergence of Newton boosting is poorly understood compared to first-order boosting. In this paper, we introduce Restricted Newton Descent, a framework for convex optimization with Newton's method on Hilbert spaces with inexact iterates, based on the concepts of cosine angle and weak gradient edge. Within this framework, we recover Newton boosting with GBDTs and classical finite-dimensional theory as special cases. We first prove that vanilla Newton boosting achieves a linear rate of convergence for smooth, strongly convex losses that satisfy a Hessian-dominance condition. To handle general convex losses with Lipschitz Hessians, we extend a recent gradient regularized Newton scheme to the restricted weak learner setting, establishing the first global $\mathcal{O}(\frac{1}{k^2})$ convergence rate for second-order GBDTs. This scheme minimally modifies the classical algorithm by introducing an adaptive $\ell_2$-regularization term proportional to the square root of the gradient norm at each iteration. In numerical experiments, we show that this scheme converges while vanilla Newton boosting may diverge.
Updated: 2026-11-19 11:03:18
标题: 具有全局收敛性的梯度正则化牛顿提升树
摘要: 梯度提升决策树(GBDT)主导着表格数据机器学习领域,XGBoost、LightGBM 和 CatBoost 等现代实现均基于牛顿提升:即在决策树空间中执行二阶下降步骤。尽管牛顿提升在实践中取得了成功,但与一阶提升相比,其全局收敛性仍缺乏充分理解。本文提出受限牛顿下降框架,用于在希尔伯特空间中采用带有非精确迭代的牛顿方法进行凸优化;该框架建立在余弦角和弱梯度边缘的概念之上。在此框架下,我们将基于 GBDT 的牛顿提升和经典有限维理论分别作为特殊情形纳入其中。首先,我们证明,对于满足 Hessian 支配条件的光滑强凸损失函数,普通牛顿提升能够以线性速率收敛。为处理 Hessian 具有 Lipschitz 连续性的任意凸损失函数,我们将一种近期提出的梯度正则化牛顿方法扩展到受限弱学习器设置中,从而为二阶 GBDT 建立了首个全局 $\mathcal{O}(\frac{1}{k^2})$ 收敛速率。该方法仅需对经典算法进行最小改动:在每次迭代中引入一个自适应的 $\ell_2$ 正则化项,其系数与梯度范数的平方根成正比。在数值实验中,我们表明该方法能够收敛,而普通牛顿提升可能会发散。
更新时间: 2026-11-19 11:03:18
领域: stat.ML,cs.LG,math.OC
Validation-driven Deployment of LLM Inference Platforms for Agentic Workloads
Enterprises are moving agentic workloads from closed APIs to their own open-weight model deployments. For this reason, lifecycle-wide validation, from small-scale testing through sizing and pre-production to production, becomes all the more important. Typically, rollouts are evaluated with ad hoc tools whose accuracy is rarely checked. We present an end-to-end evaluation pipeline for agentic LLM serving and empirically ground the design choices that connect its stages. Our experiments show that replaying captured traces reproduces the per-session load of the original agent sessions: at the 95th percentile replay stays within 1.18x of the recorded input tokens while live re-runs reach 4.98x, so a small set of recorded sessions yields a repeatable per-session token load. A code-coverage analysis of vLLM further shows that the evaluated live, replayed, and synthetic workloads are complementary in this configuration: each exercises Python serving paths not reached in the measured runs of the others. In a case study rolling out four large mixture-of-experts (MoE) models on llm-d, experiments show that the target models reached about half the optimal concurrency, and correspondingly about 60% of the throughput, on captured workloads compared with public traces. We open-source the relevant tools and release a trace dataset.
Updated: 2026-11-19 10:54:57
标题: 面向智能体工作负载的基于验证的 LLM 推理平台部署
摘要: 企业正将智能体工作负载从封闭式 API 迁移到自行部署的开放权重模型。因此,从小规模测试、规模评估和预生产到生产环境的全生命周期验证变得更加重要。通常,部署过程使用临时工具进行评估,而这些工具的准确性很少得到检验。我们提出了一套端到端的智能体大语言模型服务评估流水线,并通过实证研究验证了连接各阶段的设计选择。实验表明,重放捕获的轨迹能够复现原始智能体会话的单会话负载:在第 95 百分位处,重放产生的输入令牌数保持在记录值的 1.18 倍以内,而实时重新运行则达到 4.98 倍;因此,只需少量记录会话,即可获得可重复的单会话令牌负载。对 vLLM 进行的代码覆盖率分析进一步表明,在这一配置下,所评估的实时、重放和合成工作负载具有互补性:每种工作负载都会执行其他工作负载在测量运行中未触及的 Python 服务路径。在一项使用 llm-d 部署四个大型混合专家(MoE)模型的案例研究中,实验表明,与公开轨迹相比,目标模型在捕获的工作负载上达到的最优并发度约为前者的一半,相应吞吐量约为前者的 60%。我们已将相关工具开源,并发布了一个轨迹数据集。
更新时间: 2026-11-19 10:54:57
领域: cs.AI
From Cases to Criteria: Reusing Evaluation Knowledge for Task-Specific Rubric Generation
Query-specific rubrics make LLM evaluation more fine-grained and transparent, and generating high-quality rubrics requires both identifying the target query's evaluation scope and specifying concrete checks. Historical rubrics provide reusable evaluation experiences, yet existing approaches reuse either complete query-rubric cases or aggregated criteria and dimensions without explicitly connecting recurring evaluation requirements to their criterion-level evidence and source-query context. This can preserve irrelevant task details or lose the broader evaluation structure. In this paper, we introduce RubricDuo, which organizes historical query-rubric pairs into a Rubric Knowledge Graph linking evaluation dimensions, shared concepts, local concepts, criteria, and queries, where reusable evaluation requirements across queries are abstracted by shared concepts. Given a target query, RubricDuo first combines concepts relevant to the target query with retrieved historical cases to draft a rubric with broad coverage. It then revisits each draft criterion, retrieves concept-linked historical criteria and their source queries, and adapts applicable evidence to refine the criterion. Experiments on RubricBench and HealthBench demonstrate that RubricDuo achieves the overall best performance among the evaluated automatic methods in both alignment with human-authored rubrics and downstream LLM judging.
Updated: 2026-11-19 10:52:50
标题: 从案例到标准:复用评估知识生成特定任务的评分量规
摘要: 面向查询的评估量规能够使大语言模型评估更加细致且透明,而生成高质量量规既需要识别目标查询的评估范围,也需要明确具体的检查项。历史量规提供了可复用的评估经验,但现有方法要么复用完整的查询—量规案例,要么复用聚合后的标准和维度,却没有明确将反复出现的评估要求与其标准层面的证据及来源查询语境联系起来。这可能导致保留无关的任务细节,或丢失更广泛的评估结构。 本文提出 RubricDuo,将历史查询—量规对组织成一个量规知识图谱,连接评估维度、共享概念、局部概念、标准和查询,其中通过共享概念对跨查询可复用的评估要求进行抽象。给定一个目标查询,RubricDuo 首先将与目标查询相关的概念同检索到的历史案例相结合,起草一份覆盖面广的量规。随后,它重新审视每一条起草的标准,检索与概念关联的历史标准及其来源查询,并调整适用的证据以完善该标准。在 RubricBench 和 HealthBench 上的实验表明,在所评估的自动化方法中,无论是在与人工编写量规的一致性方面,还是在下游大语言模型评判方面,RubricDuo 均取得了总体最佳性能。
更新时间: 2026-11-19 10:52:50
领域: cs.AI
Verifiable Logic in Medical LLMs: A Critical Review of Agentic Clinical Reasoning Optimization and Neuro-Symbolic Grounding
Clinical large language models are usually judged by whether the final answer is right. Yet a model can reach a fluent, plausible output through invalid reasoning that static benchmarks do not detect, and confident hallucination, causally invalid inference, and spurious demographic shortcuts can pass conventional evaluation. This critical review covers four paradigms in turn: how clinical hallucination arises and why static metrics miss it; the agentic hallucination cascade, in which multi-agent and tool-augmented systems propagate and amplify early reasoning errors; process reward modeling as step-level supervision; and neuro-symbolic grounding, in which formal logic engines, ontology reasoners, and knowledge graphs place verifiable constraints on neural output. Within their encoded domains, systems with symbolic veto layers offer guarantees that hold relative to their encoded knowledge, and they report large gains on the safety measures they use. These results come from single studies, mostly in simulated or small-sample settings, and are not directly comparable with neural baselines. Process reward models remain bounded by the statistics of their training data. We propose a conceptual framework that maps each agentic failure mode to a symbolic intervention point, and we argue that clinical AI safety depends substantially on system architecture. Because current regulation emphasizes performance and does not require verification of reasoning steps, we argue that responsible certification should also audit reasoning trajectories alongside accuracy on static benchmarks.
Updated: 2026-11-19 10:49:23
标题: 医疗大语言模型中的可验证逻辑:对智能体式临床推理优化与神经符号落地的批判性综述
摘要: 临床大语言模型通常依据最终答案是否正确来评判。然而,模型可能通过无效推理生成流畅且貌似合理的输出,而静态基准测试无法发现这类问题;自信的幻觉、因果上无效的推断以及虚假的人口统计学捷径,也可能通过传统评估。本批判性综述依次讨论四种范式:临床幻觉如何产生,以及静态指标为何无法发现它;智能体式幻觉级联,即多智能体和工具增强系统如何传播并放大早期推理错误;作为步骤级监督的过程奖励建模;以及神经符号 grounding,在这一范式中,形式逻辑引擎、本体推理器和知识图谱为神经网络输出施加可验证的约束。在其所编码的领域内,配备符号否决层的系统能够提供相对于其编码知识成立的保证,并且在所采用的安全性指标上取得了显著提升。这些结果来自单项研究,且大多基于模拟环境或小样本设置,无法与神经网络基线直接比较。过程奖励模型仍受其训练数据统计特征的限制。我们提出了一个概念框架,将每种智能体失败模式映射到一个符号干预点,并认为临床人工智能的安全性在很大程度上取决于系统架构。由于当前监管侧重于性能,且不要求对推理步骤进行验证,我们主张,负责任的认证还应在评估静态基准准确性的同时,审查推理轨迹。
更新时间: 2026-11-19 10:49:23
领域: cs.CL,cs.AI,cs.CY,cs.LG
The Price of an Explanation: What Demanding Verifiable Artifacts Costs, and What It Buys Back
Generative models produce many candidate solutions but provide no intrinsic signal by which to rank them. One mitigation is to demand a \emph{verifiable artifact}: a program that can be executed against the available evidence. A common concern is that requiring executable verification incurs costs in both solution quality and computational budget. We measure these two costs on the $120$-task ARC-AGI-2 evaluation set. Demanding a verifiable artifact from an LLM reduced the score from $93$ to $68$ of $120$ tasks ($77\%$ to $57\%$). Of those $25$ tasks, $21$ were reached by no program-producing configuration we ran, at any budget, by sampling or by search; yet for $27$ of the $28$ tasks that only the answer-only arm solved, some program arm held a program that reproduced every demonstration and still failed the test. The bottleneck is obtaining an explanation that \emph{generalizes}, not finding one. A short evolutionary search over two already-sampled programs, at no additional model cost, beats best-of-$2$ sampled code by $9.2 \pm 1.4$ tasks, and over a single sampled program beats $1$-shot sampling by $9.9 \pm 1.3$. Moreover, because a program can be checked against the training examples, any program-producing protocol can terminate early once a task is explained: under the same stopping rule, best-of-$n$ sampling declines up to $38\%$ of its budget and the evolved arm up to $49\%$, whereas an answer-only baseline cannot terminate early. Applying the same methodology to decoder synthesis for quantum error correction yields interpretable decoders evaluated against a certified panel of published decoders on held-out exam shots.
Updated: 2026-11-19 10:48:00
标题: 解释的代价:要求提供可验证产物的成本,以及它所换回的价值
摘要: 生成模型能够产生大量候选解,但并不提供用于对这些候选解进行排序的内在信号。一种缓解方法是要求提供“可验证的产物”:一种能够根据现有证据执行的程序。一个常见担忧是,要求进行可执行验证会同时牺牲解答质量和计算预算。我们在包含 120 个任务的 ARC-AGI-2 评测集上衡量了这两种成本。要求大语言模型提供可验证产物后,得分从 120 个任务中的 93 个降至 68 个(从 77% 降至 57%)。在这 25 个任务中,有 21 个任务无论采用何种预算、通过采样还是搜索,我们运行的任何程序生成配置都未能解决;然而,在仅由只提交答案的方案解决的 28 个任务中,有 27 个任务至少存在一个程序方案持有能够复现所有示例、却仍未能通过测试的程序。瓶颈在于获得能够泛化的解释,而不是找到一个解释。对两个已经采样得到的程序进行短时进化搜索,在不增加模型成本的情况下,比从采样代码中选取最佳的两个程序多解决了 9.2 ± 1.4 个任务;相较于单个采样程序,则比一次采样多解决了 9.9 ± 1.3 个任务。此外,由于程序可以针对训练示例进行检查,任何生成程序的协议都可以在任务得到解释后提前终止:在相同的停止规则下,最佳 n 次采样方案最多可减少其预算的 38%,进化方案最多可减少 49%,而只提交答案的基线无法提前终止。将同样的方法应用于量子纠错中的解码器合成后,我们得到可解释的解码器,并在由已发表解码器组成的、经过认证的测试面板上,使用留出的测试样本对其进行评估。
更新时间: 2026-11-19 10:48:00
领域: cs.AI,cs.LG,cs.NE
One Schedule Does Not Fit All: Adaptive Inference Schedules for Diffusion Language Models
Diffusion language models typically use a fixed denoising schedule across workloads. We show that the cheapest schedule that preserves quality depends on the task, model, and sampler. We propose Task-Calibrated Denoising Allocation (TCDA), a deployment rule with an explicit error guarantee. Given candidate samplers, paired calibration data, a utility tolerance, and guardrails against degeneration, TCDA uses simultaneous one-sided bootstrap bounds to certify which candidates meet both the utility and guardrail criteria. It deploys the cheapest certified candidate or falls back to the full schedule. The probability of deploying an infeasible schedule is asymptotically at most alpha. Candidates include early prefix decoding, state-reusing continuation, reduced time grids, and confidence-threshold decoding. Across seven datasets and two model families, TCDA certifies reductions in denoiser evaluations by factors of 3.4 on XSum and 2.0 on WMT14 for ELF-B; 8.0 on WMT14 and 4.1 on GSM8K for LLaDA-8B; and 1.33 on OpenWebText for both ELF-M and ELF-L. A validation protocol fixed before generation confirmed every selection on fresh seeds. Across 500 calibration splits, false certification remained below 2% in every setting at a nominal level of 5%. Certified schedules vary across tasks and model scales. Trajectory measurements suggest that when decoded tokens commit is more informative for schedule selection than the remaining latent discretization error. We also find that the ELF reference sampler draws its time grid at random, so reproducible schedule comparisons for unconditional generation require fixing the grid.
Updated: 2026-11-19 10:47:26
标题: 一种调度方案并不适用于所有情况:扩散语言模型的自适应推理调度方案
摘要: 扩散语言模型通常在不同工作负载之间采用固定的去噪调度。我们表明,在保持质量的前提下,成本最低的调度取决于任务、模型和采样器。我们提出任务校准去噪分配方法(Task-Calibrated Denoising Allocation,TCDA),这是一种带有明确误差保证的部署规则。给定候选采样器、成对的校准数据、效用容忍度以及防止退化的防护条件,TCDA 使用同时进行的单侧自助法界限,认证哪些候选方案同时满足效用和防护条件。它部署通过认证且成本最低的候选方案;如果没有符合条件的方案,则退回完整调度。部署不可行调度的概率在渐近意义下至多为 alpha。候选方案包括提前前缀解码、复用状态的连续解码、缩减时间网格以及基于置信度阈值的解码。 在七个数据集和两类模型上,TCDA 认证了去噪器评估次数的减少:对于 ELF-B,在 XSum 上减少了 3.4 倍,在 WMT14 上减少了 2.0 倍;对于 LLaDA-8B,在 WMT14 上减少了 8.0 倍,在 GSM8K 上减少了 4.1 倍;对于 ELF-M 和 ELF-L,在 OpenWebText 上均减少了 1.33 倍。在生成前预先固定的验证协议中,使用新的随机种子确认了每一次选择。在 500 个校准划分中,在名义水平为 5% 的情况下,所有设置中的错误认证率均低于 2%。经过认证的调度方案会随任务和模型规模而变化。轨迹测量表明,相较于剩余的潜在离散化误差,已解码词元何时确定下来这一信息对调度选择更具指示性。我们还发现,ELF 参考采样器会随机抽取其时间网格,因此,对于无条件生成,要实现可复现的调度比较,必须固定该时间网格。
更新时间: 2026-11-19 10:47:26
领域: cs.AI,cs.CL,cs.LG
Explainable AI for Solar PV Power Forecasting: From Model Selection to Trustworthy, Reproducible Deployment
Machine learning (ML) is now a standard tool for forecasting the output of solar photovoltaic (PV) plants, yet published accuracy figures are often hard to compare and harder to trust. Many studies validate with random splits, report no reference forecast, and present feature attributions without saying what they can and cannot show. This paper reviews the main families of ML methods for PV power forecasting and resource assessment, from tree ensembles to deep and foundation models, and sets out a reproducible workflow that combines automated model search with explainable AI. The workflow is then tested on an openly available dataset: a 16.32 kWp plant in Porto, Portugal, forecast one day ahead from a 4 km numerical weather prediction grid. Over a full test year, the best models reach a normalised root mean square error (nRMSE) of 11.6% of installed capacity, about half the error of smart persistence. The choice of input features changed accuracy far more than the choice among strong algorithms, and shuffled cross-validation was mildly optimistic. After conformal calibration, the nominal 80% prediction intervals covered 81.7% of observations, against 64.5% before. SHAP rankings stayed stable when the model was retrained on different periods but shifted when correlated inputs were removed, so attributions should be read as properties of a model rather than of the plant. The paper closes with practical lessons and open problems, including deployment on edge hardware and the effect of a changing climate.
Updated: 2026-11-19 10:46:52
标题: 用于太阳能光伏功率预测的可解释人工智能:从模型选择到可信、可复现的部署
摘要: 机器学习(ML)如今已成为预测太阳能光伏(PV)电站输出功率的标准工具,但已发表的精度指标往往难以比较,也难以令人信服。许多研究采用随机划分进行验证,不报告基准预测结果,并展示特征归因,却不说明这些归因能够或不能够揭示什么。本文综述了用于光伏功率预测和资源评估的主要机器学习方法类别,从树集成模型到深度模型和基础模型,并提出了一套将自动化模型搜索与可解释人工智能相结合的可复现工作流程。随后,本文在一个公开数据集上对该工作流程进行了测试:该数据集来自葡萄牙波尔图的一座16.32 kWp光伏电站,利用4 km数值天气预报网格数据进行提前一天的预测。在完整的一年测试期内,最佳模型的归一化均方根误差(nRMSE)达到装机容量的11.6%,约为智能持久性方法误差的一半。输入特征的选择对精度的影响远大于强算法之间的选择,而随机打乱的交叉验证结果略显乐观。经过保序校准后,名义覆盖率为80%的预测区间覆盖了81.7%的观测值,而校准前仅覆盖64.5%。当模型在不同时间段的数据上重新训练时,SHAP特征排序保持稳定;但移除相关输入后,排序发生了变化。因此,特征归因应被理解为模型的属性,而非光伏电站本身的属性。文章最后总结了实践经验和有待解决的问题,包括在边缘硬件上的部署以及气候变化的影响。
更新时间: 2026-11-19 10:46:52
领域: cs.AI
Meta-RTL: Evolving Agent Harnesses for RTL Optimization
Large language models enable agents to optimize RTL using EDA feedback, yet their executable search procedures remain largely hand- engineered. We present Meta-RTL, an EDA-grounded framework that evolves RTL optimization harnesses from a minimal loop while keeping the optimization model, EDA flow, and per-design budgets fixed. Compared with Dr. RTL, Meta-RTL* reduces aggregate WNS/TNS violations by 7.8%/11.0% across 20 development designs, with area reductions on 70% of them. Without further evolution, Meta-RTL* transfers to 10 unseen IC-RTL designs, reducing aggregate WNS/TNS violations by 20.5%/14.0% and total synthesized area by 12.6%. We further characterize three search mechanisms in the evolved harness and assess their contributions through ablations and a case study.
Updated: 2026-11-19 10:44:19
标题: Meta-RTL:用于 RTL 优化的智能体框架演进
摘要: 大型语言模型使智能体能够利用 EDA 反馈优化 RTL,但其可执行的搜索过程仍主要依赖人工设计。我们提出 Meta-RTL,这是一个以 EDA 为基础的框架,能够从最小化循环出发演化 RTL 优化工具,同时保持优化模型、EDA 流程以及每个设计的预算不变。与 Dr. RTL 相比,Meta-RTL* 在 20 个开发设计上使 WNS/TNS 违规总量分别减少 7.8%/11.0%,其中 70% 的设计实现了面积缩减。在无需进一步演化的情况下,Meta-RTL* 迁移至 10 个未见过的 IC-RTL 设计,使 WNS/TNS 违规总量分别减少 20.5%/14.0%,并使综合总面积减少 12.6%。此外,我们进一步分析了演化后工具中的三种搜索机制,并通过消融实验和案例研究评估了它们各自的贡献。
更新时间: 2026-11-19 10:44:19
领域: cs.AI,cs.AR
Gradients for Interventions and Activation Values for Detection: Targeted Feature Learning in Language Models
Model-internal features can be studied through both their ability to identify a specified concept and their causal effect when manipulated, e.g., through steering or weight editing. A prominent approach to feature learning is Sparse Autoencoders (SAEs), which learn broad feature dictionaries whose relation to particular concepts is typically identified post hoc. However, many interpretability questions are instead hypothesis-driven and concern a concept specified in advance. We study this setting as targeted feature learning, where a single feature is constructed for such a predefined concept. We present a controlled comparison across three model signals (activation values, activation gradients, and parameter gradients) and two estimators (contrastive mean and a learned one-dimensional encoder-decoder), yielding six targeted methods, with CAA and GRADIEND as existing instances and four new methods covering the remaining combinations. We compare these methods against pretrained SAEs across 15 tasks and ten language models, evaluating both detection and causal intervention. Across models, the strongest detection performance is achieved by contrastive activation value methods, whereas the strongest intervention performance is achieved by gradient signals, most strongly with a contrastive mean. Notably, within the contrastive mean family, activation gradients substantially improve intervention over activation values without requiring parameter space interventions. Overall, our results show that targeted feature quality depends jointly on the model signal and estimator, with detection and intervention capturing complementary properties.
Updated: 2026-11-19 10:43:27
标题: 用于干预的梯度与用于检测的激活值:语言模型中的目标特征学习
摘要: 模型内部特征可以通过两种方式进行研究:一是考察其识别特定概念的能力,二是考察对其进行操纵时产生的因果效应,例如通过引导或权重编辑来操纵。稀疏自编码器(SAE)是特征学习的一种重要方法,它们学习涵盖范围广泛的特征字典,而这些特征与特定概念之间的关系通常是在事后确定的。然而,许多可解释性问题是由假设驱动的,关注的是预先指定的概念。我们将这种设定称为定向特征学习,即针对预定义概念构造单个特征。 我们针对三种模型信号(激活值、激活梯度和参数梯度)与两种估计器(对比均值和学习得到的一维编码器—解码器)进行了受控比较,由此得到六种定向方法。其中,CAA 和 GRADIEND 是已有方法,另外四种方法则涵盖了其余组合。我们在 15 项任务和 10 个语言模型上,将这些方法与预训练的 SAE 进行比较,同时评估它们的检测能力和因果干预能力。总体而言,在不同模型中,最强的检测性能来自基于对比激活值的方法,而最强的干预性能来自基于梯度的信号,其中以对比均值的表现最为突出。值得注意的是,在对比均值方法这一系列中,激活梯度相较于激活值能够显著提升干预效果,同时无需进行参数空间干预。总体来看,我们的结果表明,定向特征的质量取决于模型信号和估计器的共同作用,而检测与干预反映了相互补充的属性。
更新时间: 2026-11-19 10:43:27
领域: cs.CL,cs.LG
Characterizing High Bandwidth Flash for LLM Serving
Large language model (LLM) serving requires substantial memory to store model weights and KV caches. Agentic workloads compound this pressure through repeated interactions over growing contexts, making it important to retain KV cache for reuse. High-bandwidth flash (HBF) offers a way to expand accelerator memory capacity for LLM serving, but its access costs and limited write endurance complicate its use. We evaluate HBF for high-throughput agentic serving across system design and scheduling choices to understand when additional capacity improves serving performance and energy efficiency. We introduce an HBM-HBF-host hierarchical storage system and buffered cache-aware scheduling, and use trace-driven simulations to analyze their effects on performance, energy consumption, and HBF write lifetime. Across the evaluated workloads, the fastest HBF-augmented systems reduce completion time by 21.1-86.9% relative to HBM-only systems. Modeled energy savings reach 62.4%, with benefits depending on the workload and weight placement. Buffered cache-aware scheduling extends estimated HBF write lifetime from 0.99 to 13.63 years in the evaluated configuration. These results demonstrate the importance of coordinating data placement and scheduling in serving LLM with HBF, positioning HBF as an actively utilized lower-level memory tier rather than passive storage.
Updated: 2026-11-19 10:42:16
标题: 高带宽闪存的特性及其在大语言模型服务中的应用
摘要: 大型语言模型(LLM)服务需要大量内存来存储模型权重和 KV 缓存。智能体工作负载通过在不断增长的上下文中进行重复交互,进一步加剧了这一压力,因此保留 KV 缓存以便重复利用变得十分重要。高带宽闪存(HBF)为扩展 LLM 服务的加速器内存容量提供了一种途径,但其访问成本和有限的写入耐久性使其应用变得复杂。我们从系统设计和调度策略两个方面评估 HBF 在高吞吐量智能体服务中的应用,以了解额外容量在何种情况下能够提升服务性能和能源效率。我们提出了一种 HBM-HBF-主机分层存储系统和一种具备缓存感知能力的缓冲调度策略,并利用基于跟踪的仿真分析它们对性能、能耗和 HBF 写入寿命的影响。在所评估的工作负载中,采用 HBF 的最快系统相较于仅使用 HBM 的系统,将完成时间缩短了 21.1% 至 86.9%。建模结果显示,能源节省最高可达 62.4%,但具体收益取决于工作负载和权重放置方式。在所评估的配置中,具备缓存感知能力的缓冲调度策略将预计的 HBF 写入寿命从 0.99 年延长至 13.63 年。这些结果表明,在使用 HBF 提供 LLM 服务时,协调数据放置与调度至关重要,并使 HBF 成为一种被主动利用的较低层级内存,而非被动存储设备。
更新时间: 2026-11-19 10:42:16
领域: cs.LG,cs.AR,cs.DC
Arbitrary-Accuracy Neural Approximation with Optimal Neuron Count and Optimal Bit Complexity
We study the minimum number of hidden neurons required for arbitrary-accuracy approximation of continuous functions on $[0,1]^d$ and the associated encoding complexity. For $d\geq 2$, we construct two fixed, explicitly defined activation functions and, for each, a closed-form network with two hidden layers of widths $d$ and $1$ that achieves arbitrary accuracy in the uniform norm. We prove that $d+1$ is the exact minimum total number of hidden neurons among standard feedforward networks with locally integrable activations and affine outputs. We further give a simpler construction using a single elementary activation that combines the floor and exponential functions. This construction requires three hidden layers of widths $d$, $1$, and $2$. If a skip connection is allowed, widths $d$, $1$, and $1$ suffice. For a bounded $α$-Hölder class with $α\in(0,1]$, the networks with the digit-extraction activation and with the elementary activation require $O(\varepsilon^{-d/α}\log(1/\varepsilon))$ bits, matching the metric-entropy lower bound up to a logarithmic factor. The other $(d,1)$ network, which stores differences of neighboring values along a spanning tree, needs only $Θ(\varepsilon^{-d/α})$ bits and is optimal in both neuron count and bit complexity.
Updated: 2026-11-19 10:41:21
标题: 具有最优神经元数量和最优比特复杂度的任意精度神经近似
摘要: 我们研究了在 $[0,1]^d$ 上以任意精度逼近连续函数所需的最少隐藏神经元数量及相关编码复杂度。对于 $d\geq 2$,我们构造了两个固定且明确定义的激活函数;对于每个激活函数,我们都给出了一个具有两个隐藏层、宽度分别为 $d$ 和 $1$ 的闭式网络,并证明其能够在一致范数下达到任意精度。我们证明,在采用局部可积激活函数和仿射输出的标准前馈网络中,隐藏神经元总数的精确最小值为 $d+1$。此外,我们还给出了一种使用单个初等激活函数的更简单构造,该激活函数结合了取整函数和指数函数。该构造需要三个隐藏层,宽度分别为 $d$、$1$ 和 $2$。如果允许使用跳跃连接,则宽度为 $d$、$1$ 和 $1$ 即可。对于 $α\in(0,1]$ 的有界 $α$-Hölder 类,采用数字提取激活函数和初等激活函数的网络所需的比特数为 $O(\varepsilon^{-d/α}\log(1/\varepsilon))$,与度量熵下界相比仅相差一个对数因子。另一种 $(d,1)$ 网络沿生成树存储相邻取值之差,只需 $Θ(\varepsilon^{-d/α})$ 个比特,并且在神经元数量和比特复杂度两个方面都是最优的。
更新时间: 2026-11-19 10:41:21
领域: cs.LG,cs.NE,stat.ML
Trustworthy Geospatial AI Workflows: Reproducible Maritime Analytics and Forecasting on Open-Source AIS Data
Publicly available geospatial data provide increasing opportuni- ties for data-driven maritime analytics and predictive modelling. However, their availability does not necessarily imply that the underlying observations are equally suitable for downstream AI applications. Properties of the data source and observation pro- cess, including provenance, reporting regularity, spatial coverage, observation density, and missingness, can affect how geospatial data are interpreted, processed, and ultimately used by predictive models. At the same time, trustworthy geospatial AI requires ana- lytical workflows in which these processing decisions can be made explicit and reproduced. This paper presents a reproducible mar- itime geospatial AI workflow built around damast, an open-source data-processing and machine-learning library developed at Simula Research Laboratory. Using AIS observations from multiple public data providers as a case study, we demonstrate metadata-aware validation, reusable processing pipelines, maritime trajectory con- struction, and reproducible machine-learning experimentation. The predictive stage is model-agnostic and is instantiated in this study using a Transformer-based vessel-trajectory forecasting model. Building on these implemented capabilities, we further outline an envisioned extension toward trustworthiness-aware geospatial AI. The extension introduces explicit characterization of source- and data-level properties and their relationship with downstream model performance. This distinguishes capabilities demonstrated in the current workflow from trustworthiness-oriented components identified for future development. Overall, the study demonstrates how reproducible open-source infrastructure can provide a practi- cal foundation for developing more transparent and trustworthy geospatial AI workflows.
Updated: 2026-11-19 10:39:00
标题: 可信地理空间人工智能工作流:基于开源船舶自动识别系统数据的可复现海事分析与预测
摘要: 公开可用的地理空间数据为数据驱动的海事分析和预测建模提供了日益增多的机会。然而,数据的可获得性并不意味着其底层观测同样适用于后续的人工智能应用。数据源和观测过程的特征,包括数据来源、报告规律性、空间覆盖范围、观测密度和缺失情况,都会影响地理空间数据的解读、处理方式以及最终在预测模型中的使用。同时,可信赖的地理空间人工智能需要分析工作流程,使这些处理决策能够被明确说明并加以复现。本文介绍了一种可复现的海事地理空间人工智能工作流程,该流程以 damast 为基础。damast 是由 Simula 研究实验室开发的开源数据处理与机器学习库。本文以多个公共数据提供商的 AIS 观测数据为案例,展示了元数据感知的数据验证、可复用的处理管道、海事轨迹构建以及可复现的机器学习实验。预测阶段与具体模型无关,本文采用基于 Transformer 的船舶轨迹预测模型加以实现。在这些已实现功能的基础上,本文进一步概述了向可信赖性感知地理空间人工智能扩展的设想。该扩展将对数据源层面和数据层面的属性进行明确刻画,并分析这些属性与下游模型性能之间的关系。由此,可以区分当前工作流程中已经展示的功能与面向可信赖性的、为未来开发所确定的组件。总体而言,本研究表明,可复现的开源基础设施能够为开发更加透明、可信赖的地理空间人工智能工作流程提供实用基础。
更新时间: 2026-11-19 10:39:00
领域: cs.AI
MultiWorldBench: Do Independently Controlled Views Describe One Shared World?
Multiplayer world models must ensure that independently controlled views remain consistent with a single shared and persistent world. We introduce MultiWorldBench, a diagnostic Minecraft benchmark comprising 495 case configurations across seven task suites and ten capabilities, including independent control, cross-view motion, shared-state synchronization, persistence, structural reasoning, concurrent interaction, and delayed revisit. Using Engine GT as a reference, we evaluate two multiplayer world models, Solaris (MP) and Gamma-World, together with a single-player generation variant, Solaris (SP). Among the generated systems, Gamma-World achieves the highest ten-capability average at 21.39, followed by Solaris (MP) at 20.88 and Solaris (SP) at 10.06, while Engine GT reaches 91.69. Gamma-World performs better on several control, shared-state, and revisit capabilities, whereas Solaris (MP) leads in cross-view motion and race-condition consistency. Nevertheless, all generated systems score at most 8.00 on state persistence and 1.33 on structural consistency, and none succeeds in spatial reasoning or building-identity preservation. Human pairwise evaluation yields the same overall system ranking and shows strong alignment with the automatic evaluation, with a mean dimension-level Spearman correlation of 0.95. These results show that current multiplayer world models still exhibit a substantial gap relative to Engine GT in maintaining a coherent shared world.
Updated: 2026-11-19 10:37:34
标题: MultiWorldBench:独立控制的视角是否描述同一个共享世界?
摘要: 多人世界模型必须确保由不同主体独立控制的视角,与同一个共享且持久存在的世界保持一致。我们提出了 MultiWorldBench,这是一个用于诊断的《Minecraft》基准,包含七个任务套件、十项能力下的495种案例配置,涵盖独立控制、跨视角运动、共享状态同步、持久性、结构推理、并发交互和延迟重访等能力。我们以 Engine GT 为参照,对两个多人世界模型 Solaris(MP)和 Gamma-World,以及一个单人生成变体 Solaris(SP)进行评估。在生成系统中,Gamma-World 的十项能力平均得分最高,为21.39;其次是 Solaris(MP),得分为20.88;Solaris(SP)得分为10.06;而 Engine GT 达到91.69。Gamma-World 在多项控制、共享状态和重访能力上表现更好,而 Solaris(MP)在跨视角运动和竞态条件一致性方面领先。然而,所有生成系统在状态持久性上的得分最高仅为8.00,在结构一致性上的得分最高仅为1.33,并且没有任何系统能够成功完成空间推理或保持建筑身份。这些结果表明,相较于 Engine GT,当前的多人世界模型在维护连贯的共享世界方面仍存在 substantial 的差距。人的成对评估得出了相同的总体系统排名,并显示出与自动评估的高度一致性,维度层面的平均 Spearman 相关系数为0.95。这些结果表明,相较于 Engine GT,当前的多人世界模型在维护连贯的共享世界方面仍存在 substantial 的差距。
更新时间: 2026-11-19 10:37:34
领域: cs.AI,cs.CV
Evolving Decoding Algorithms for Quantum Error Correction
Quantum computation entails robustness engineering: a noisy quantum state is measured continuously, and a classical algorithm (the decoder) must infer corrections that reliably remove the noise, fast enough to keep up. We write several published belief-propagation (BP) decoders for quantum low-density parity-check (qLDPC) codes in a Domain-Specific Language (DSL), and search over it with grammatical evolution. Written in the language, the published decoders show their parameters in plain view, allowing us to re-parameterise BP+OSD (ordered statistics decoding) and BP+LSD (localized statistics decoding) decoders with damping, before any search, making each 17.1--41.0$\times$ faster at a higher error rate, and BP+OSD-0 about 103 faster than the ldpc package's version tuned on the [[72,12,6]] bivariate-bicycle code. Evolution over the language finds decoders that improve the time-error front. One makes 23% fewer logical errors than BP+OSD-0 with damping at 0.64$\times$ its time, and decoders evolved from random code are more accurate than ldpc's tuned BP+OSD-0 at 1/31 of its time or less. Frozen at one operating point, the two fastest evolved decoders generalize well across noise levels, code sizes and round counts, staying at the time-error front. Ultimately, we demonstrate that capturing expert knowledge within a DSL creates a powerful intermediate layer---one that effectively bridges human intuition and machine-driven optimization to unlock highly efficient quantum error correction.
Updated: 2026-11-19 10:36:21
标题: 量子纠错的演进式解码算法
摘要: 量子计算需要进行稳健性工程:量子噪声态会被持续测量,而经典算法(即解码器)必须推断出能够可靠消除噪声的修正,并且速度要足够快以跟上这一过程。我们使用领域特定语言(DSL)编写了多种已发表的量子低密度奇偶校验(qLDPC)码置信传播(BP)解码器,并通过语法进化在其中进行搜索。以该语言编写后,这些已发表的解码器的参数一目了然,使我们能够在搜索之前,通过加入阻尼对 BP+OSD(有序统计解码)和 BP+LSD(局部统计解码)解码器重新参数化,使其在更高错误率下分别实现 17.1—41.0 倍的加速;其中,BP+OSD-0 的速度约为 ldpc 软件包中针对 [[72,12,6]] 双变量自行车码调优版本的 103 倍。通过在该语言上进行进化搜索,我们找到了能够改善时间—错误率前沿的解码器。其中一种解码器在仅用时 0.64 倍的情况下,比带阻尼的 BP+OSD-0 少产生 23% 的逻辑错误;而从随机代码出发进化得到的解码器,其准确率高于 ldpc 软件包中调优后的 BP+OSD-0,同时所需时间不超过后者的 1/31。在单一运行点冻结参数后,两个速度最快的进化解码器能够很好地泛化到不同噪声水平、代码规模和轮数,并始终处于时间—错误率前沿。最终,我们证明,将专家知识融入领域特定语言,可以构建一个强大的中间层——它能够有效连接人类直觉与机器驱动的优化,从而实现高效的量子纠错。
更新时间: 2026-11-19 10:36:21
领域: quant-ph,cs.AI,cs.MA,cs.NE
Coherent belief and opinion propagation produces more echo chambers: corrected version
The occurrence of echo chambers is a well-known phenomenon in social networks. Echo chambers are groups of agents satisfying three properties: homogeneity, i.e., sharing the same opinion, segregation, i.e., listening primarily to agents of the same group, and reinforcement, i.e., increasing opinion similarity over time. Opinion dynamics models have been used to explain how echo chambers occur through agents updating their opinions. However, social network users also exchange beliefs supporting their opinions. Here, we aim at identifying the effect of propagating beliefs together with opinions on the formation of echo chambers. For that purpose, we complement an existing opinion dynamics model with classical belief merge operations. Beliefs and opinions are also maintained coherent guided by values that agents share. We introduce measures, applying to either beliefs and opinions, to identify echo chambers based on the three properties. This model is used to simulate opinion and belief propagation with varying initial conditions and agent tolerance for different opinions/beliefs. Results confirm the occurrence of echo chambers observed in previous opinion dynamics studies in a different setting and with a stricter measure. They also demonstrate the occurrence of echo chambers with belief propagation. Finally, they show that connecting opinions to beliefs and maintaining their coherence increases the number of belief echo chambers, but that they involve a reduced number of agents.
Updated: 2026-11-19 10:35:26
标题: 连贯信念与观点传播会产生更多回音室:修订版
摘要: 回音室的出现是社交网络中的一种众所周知的现象。回音室是满足以下三个特征的群体:同质性,即持有相同观点;隔离性,即主要听取同一群体成员的意见;以及强化性,即观点相似性随时间推移而增加。观点动态模型被用于解释个体如何通过更新观点形成回音室。然而,社交网络用户也会交流支持其观点的信念。在本文中,我们旨在确定观点与信念共同传播对回音室形成的影响。为此,我们在现有观点动态模型的基础上,引入经典的信念合并操作。信念和观点还在个体共同持有的价值观引导下保持一致。我们提出了适用于信念和观点的度量方法,根据上述三个特征识别回音室。利用该模型,我们在不同初始条件以及个体对不同观点和信念的容忍度下,模拟观点与信念的传播。结果证实,在不同环境和更严格的度量标准下,仍会出现先前观点动态研究中观察到的回音室现象。结果还表明,信念传播同样会形成回音室。最后,结果显示,将观点与信念联系起来并保持二者一致,会增加信念回音室的数量,但这些回音室所涉及的个体数量会减少。
更新时间: 2026-11-19 10:35:26
领域: cs.AI,cs.MA
On the trajectories of the ID algorithm
The ID algorithm decides whether an interventional distribution can be computed from observational data and, when it can, returns a formula in which products, ratios and summations of conditional probabilities are nested inside one another. We study these formulas by following the trajectories of the calls of the algorithm, each of which ends with a tail (an alternation of lines 7 and 2) and an exit, and we derive two main results. First, line~4 and the exit lines fix the single outer summation of the output, while the tail forms everything inside it, both the inner summations and the ratios. Second, a ratio keeps a summation in its denominator only when a repetition of the tail is entangled, and a test of ancestry in the original graph decides, before any formula is computed, whether a topological order can be chosen so as to avoid it. We also derive a bound on the nesting depth of the output, and show a simple ``dimensional'' count that every output has to satisfy. Together, these results constrain the form of an ID output and guide its implementation and simplification.
Updated: 2026-11-19 10:34:30
标题: 论ID算法的轨迹
摘要: ID 算法用于判断一个干预分布能否由观测数据计算得到;如果可以,它会返回一个公式,其中条件概率的乘积、比值和求和彼此嵌套。我们通过追踪算法调用的轨迹来研究这些公式:每次调用都以一个尾部(第 7 行和第 2 行的交替执行)和一个退出过程结束,并由此得到两个主要结果。首先,第 4 行和退出行决定了输出公式最外层的单次求和,而尾部则构成其中的全部内容,包括内层求和和比值。其次,只有当尾部的重复彼此交织时,比值的分母中才会保留求和;并且,通过检验原图中的祖先关系,可以在计算任何公式之前判断是否能够选择一种拓扑序来避免这种情况。我们还推导出了输出嵌套深度的一个界,并展示了一种简单的“维数”计数方法,说明每个输出都必须满足该计数。总体而言,这些结果限制了 ID 输出的形式,并为其实现与化简提供了指导。
更新时间: 2026-11-19 10:34:30
领域: stat.ME,cs.AI,math.PR
Parameter-Efficient Adaptation of Self-supervised Vision Backbones Survives Distribution Shift in Radar Micro-Doppler HAR
Micro-Doppler radar enables contactless, privacy-preserving human activity recognition (HAR), but deployment robustness remains underexplored. We compared full fine-tuning, frozen probing, and parameter-efficient fine-tuning (PEFT) using subject-disjoint in-distribution cross-validation and few-shot cross-age, cross-orientation, and cross-dataset transfer. Full fine-tuning suffered negative cross-dataset transfer, while frozen features under-adapted on cross-orientation. Only PEFT avoided both failures. We paired DINOv3 with all-layer principal-singular-direction adaptation (PiSSA), to our knowledge the first application of a self-supervised image foundation backbone to radar micro-Doppler HAR. DINOv3-PiSSA ranked first among PEFT methods in every evaluated setting. Under our protocol, its Small variant matched the in-distribution accuracy of the prior Base-size PEFT state of the art using 4.5x fewer total parameters, with only 3% trainable. It surpassed a size-matched variant of that baseline in every evaluated setting, with transfer gains increasing with shift severity: 2.1, 6.6, and 8.9 percentage points, respectively. Ablations attributed improvements to both pretraining and adapter recipe, with the pretraining contributing most under compound shift. Code and protocol are available at https://github.com/KeryanChelouche/udoppler-ssl.
Updated: 2026-11-19 10:31:22
标题: 自监督视觉骨干网络的参数高效适应在雷达微多普勒人体活动识别的分布偏移下依然有效
摘要: 微多普勒雷达能够在非接触且保护隐私的前提下实现人体活动识别(HAR),但其部署鲁棒性仍缺乏充分研究。我们采用受试者不重叠的分布内交叉验证,以及跨年龄、跨方向和跨数据集的小样本迁移,对比了全量微调、冻结探测和参数高效微调(PEFT)三种方法。全量微调在跨数据集迁移中出现负迁移,而冻结特征在跨方向场景下适应不足。只有 PEFT 同时避免了这两种失败。我们将 DINOv3 与全层主奇异方向适配(PiSSA)相结合;据我们所知,这是自监督图像基础模型骨干网络首次应用于雷达微多普勒人体活动识别。DINOv3-PiSSA 在所有评估设置下均位居 PEFT 方法之首。在我们的实验协议下,其 Small 版本仅使用前期 PEFT 最佳水平 Base 规模模型总参数量的四分之一左右(少 4.5 倍),且仅有 3% 的参数可训练,却达到了相同的分布内准确率。与参数规模匹配的基线变体相比,它在所有评估设置下均表现更优,并且随着分布偏移严重程度增加,迁移性能增益也随之扩大,分别达到 2.1、6.6 和 8.9 个百分点。消融实验表明,性能提升源于预训练和适配器方案两方面,其中在复合偏移条件下,预训练的贡献最大。代码和实验协议已发布于:https://github.com/KeryanChelouche/udoppler-ssl。
更新时间: 2026-11-19 10:31:22
领域: cs.LG
One Latent, Many Tokens: Jointly Learning Compressed Embeddings for Efficient Language Diffusion
Most continuous diffusion language models process one latent position per token at each sampling step, making generation expensive. Two-stage methods lower the cost by reducing the latent length, but they fix the compressed embedding space before training the diffusion model. Embeddings from the fixed space can be difficult to model with diffusion and decode reliably into tokens, which limits generation quality after compression. To address this problem, we introduce JPEG-DLM (Joint-embedding Prediction for Efficient Generation with Diffusion Language Model), which jointly trains a compressor, a flow matching model and a decoding module. With joint-embedding prediction, JPEG-DLM learns compressed embeddings that are more structured, easier to model with diffusion and reliably decodable into tokens.JPEG-DLM achieves the highest throughput among recent diffusion and flow models on LM1B and OWT, with a Gen-PPL lower than most of them. At a compression rate of 0.5 on OWT, it reaches a Gen-PPL of 34.52 and approximately 2.3 times ELF's throughput. These results suggest that jointly learning compressed embeddings offers a promising path toward efficient diffusion language modeling.Code is available at https://github.com/infiniteYuanyl/JPEG-DLM.
Updated: 2026-11-19 10:31:11
标题: 一个潜变量,多个词元:联合学习用于高效语言扩散的压缩嵌入
摘要: 大多数连续扩散语言模型在每个采样步骤中为每个词元处理一个潜在位置,因此生成成本较高。两阶段方法通过缩短潜在序列长度来降低成本,但它们会在训练扩散模型之前固定压缩嵌入空间。来自固定空间的嵌入可能难以通过扩散进行建模,也难以可靠地解码为词元,从而限制压缩后的生成质量。为解决这一问题,我们提出 JPEG-DLM(基于联合嵌入预测的扩散语言模型高效生成方法),联合训练压缩器、流匹配模型和解码模块。通过联合嵌入预测,JPEG-DLM 学习到的压缩嵌入具有更好的结构,更易于通过扩散进行建模,并且能够可靠地解码为词元。JPEG-DLM 在 LM1B 和 OWT 上的吞吐量超过近期的扩散模型和流模型,达到最高水平,同时其 Gen-PPL 低于其中大多数模型。在 OWT 上以 0.5 的压缩率运行时,其 Gen-PPL 达到 34.52,吞吐量约为 ELF 的 2.3 倍。这些结果表明,联合学习压缩嵌入为实现高效的扩散语言建模提供了一条有前景的路径。代码发布于 https://github.com/infiniteYuanyl/JPEG-DLM。
更新时间: 2026-11-19 10:31:11
领域: cs.AI
FlowMap-OPD: On-Policy Distillation for Few-Step Flow-Map Generators
Few-step flow-map generators, such as MeanFlow and consistency models, sample in a few long-range jumps. On-policy distillation (OPD) trains a student on states drawn from its own sampler, but existing methods compare teacher and student through the local stochastic transitions of a multi-step sampler, which a flow-map student never deploys. We present FlowMap-OPD, the first systematic study of OPD for flow-map students. It separates state collection from supervision: the student collects states with its native few-step sampler, while the teacher supervises the flow map, velocities induced from it, or the instantaneous velocity linked to the map by a separately weighted consistency penalty. We find that instantaneous-velocity supervision with a small consistency weight, our chosen form, transfers the teacher's gains best, whereas supervising the deployed map, although the natural choice, transfers them worst when teacher and student start from different pretrained models. This gives a counter-intuitive rule: \emph{sample with the flow map, learn the velocity}. As a further benefit, this form applies to any teacher that defines a velocity, including multi-step ones, and to students initialized from multi-step models. On FLUX and SD3.5, a single few-step student consolidates three specialist teachers within 300 updates, matches or exceeds each on its own benchmark (e.g., OCR 0.883 versus 0.850 on FLUX), and outperforms both multi-reward reinforcement learning and LoRA merging.
Updated: 2026-11-19 10:30:16
标题: FlowMap-OPD:用于少步流映射生成器的在策略蒸馏
摘要: 少步流映射生成器(如 MeanFlow 和一致性模型)通过少量的长距离跳跃进行采样。在线策略蒸馏(OPD)在从自身采样器抽取的状态上训练学生模型,但现有方法通过多步采样器的局部随机转移来比较教师模型与学生模型,而流映射学生模型在实际部署时并不会使用这种转移。我们提出 FlowMap-OPD,这是首项针对流映射学生模型开展的系统性 OPD 研究。该方法将状态收集与监督分离:学生模型使用其原生的少步采样器收集状态,而教师模型则监督流映射、由流映射诱导的速度,或通过单独加权的一致性惩罚来监督与该映射对应的瞬时速度。我们发现,采用较小一致性权重的瞬时速度监督——也是我们最终选择的形式——最能传递教师模型的增益;相比之下,监督实际部署的映射虽然是自然选择,但当教师模型与学生模型从不同的预训练模型初始化时,其增益传递效果最差。这带来一条反直觉的规则:“使用流映射采样,学习速度。”此外,这种形式适用于任何能够定义速度的教师模型,包括多步教师模型,也适用于从多步模型初始化的学生模型。在 FLUX 和 SD3.5 上,一个少步学生模型在 300 次更新内即可整合三个专长教师模型的能力,在每个教师模型对应的基准测试上均达到或超过其表现(例如,在 FLUX 上 OCR 得分为 0.883,而教师模型为 0.850),并且优于多奖励强化学习和 LoRA 融合。
更新时间: 2026-11-19 10:30:16
领域: cs.CV,cs.LG
2D Gum-Net: Unsupervised Dense Elastic Image Registration via Symmetric Correlation and Spectral Pooling
Dense non-rigid registration, the recovery of a pixel-wise deformation field that warps one image into geometric agreement with another, is fundamental across medical imaging, structural biology, and correspondence estimation, yet learning-based approaches face a severe bottleneck: ground-truth deformation fields are notoriously difficult to obtain for real data. We present 2D Gum-Net, an end-to-end architecture that predicts dense elastic deformation fields fully unsupervised. We transfer the Geometric Unsupervised Matching Network (Gum-Net), originally developed for 3D subtomogram alignment in cryo-electron tomography, to 2D elastic registration: all three modules are redesigned in 2D, and the rigid transformation head is replaced by a Dense Spatial Transformer that regresses a sparse control-point grid, lifted to a full-resolution field $Φ$ by bicubic interpolation. Downsampling uses DCT spectral pooling, implemented as frozen-basis matrix multiplications ($\approx 50\times$ GPU speedup), preserving the fine, quasi-periodic structure that max and average pooling destroy. We evaluate on contact-based fingerprints, a challenging testbed for this task: locally self-similar ridge patterns make correspondence maximally ambiguous, skin pressed against a sensor generates authentic large-displacement elastic distortion, and minutiae act as precise landmarks through which an independent matcher externally verifies the topological correctness of predicted fields. Trained purely on synthetic impressions and evaluated zero-shot on real benchmarks, our method improves structural correlation by up to 15.7% on FVC2004 and raises genuine match scores under an independent matcher while leaving imposter scores essentially unchanged. This suggests that the predicted deformations restore true structure without fabricating correspondences.
Updated: 2026-11-19 10:26:57
标题: 二维 Gum-Net:通过对称相关与谱池化实现无监督稠密弹性图像配准
摘要: 稠密非刚性配准,即恢复一种逐像素的形变场,将一幅图像变形为与另一幅图像在几何上相一致,在医学成像、结构生物学和对应关系估计等领域都具有基础性作用。然而,基于学习的方法面临一个严重瓶颈:对于真实数据,真实形变场极难获得。我们提出了 2D Gum-Net,这是一种端到端架构,能够在完全无监督的情况下预测稠密弹性形变场。我们将最初为冷冻电子断层成像中的三维子断层对齐而开发的几何无监督匹配网络(Geometric Unsupervised Matching Network,Gum-Net)迁移到二维弹性配准任务中:三个模块均重新设计为二维版本,并以稠密空间变换器取代刚性变换头,通过回归稀疏控制点网格,再利用双三次插值将其提升为全分辨率形变场 $Φ$。下采样采用离散余弦变换(DCT)频谱池化,并通过冻结基矩阵乘法实现,在 GPU 上可获得约 50 倍的加速,同时保留最大池化和平均池化会破坏的精细准周期结构。我们在基于接触的指纹图像上对该方法进行评估,这是一个极具挑战性的测试平台:局部自相似的脊线模式使对应关系具有最大程度的不确定性,皮肤与传感器接触产生真实的大位移弹性畸变,而细节点则作为精确地标,使独立匹配器能够从外部验证预测形变场的拓扑正确性。模型完全使用合成指纹印痕进行训练,并在真实基准数据上进行零样本评估;结果表明,在 FVC2004 上,结构相关性最高提升 15.7%,同时在独立匹配器下真实匹配得分提高,而错误匹配得分基本保持不变。这表明,预测得到的形变能够恢复真实结构,而不会捏造对应关系。
更新时间: 2026-11-19 10:26:57
领域: cs.CV,cs.AI
X Hedging: towards an eXplainable artificial intelligence option Hedging framework
We propose X Hedging, an alternative to the Deep Hedging framework that addresses computational and explainability limitations of neural-network-based hedging strategies. Deep Hedging leverages neural networks to learn flexible hedging policies but relies on opaque models and typically requires large training datasets, which can complicate interpretation and limit its effectiveness in data-constrained settings. X Hedging takes a step toward addressing these limitations by replacing neural networks with tree ensemble methods, specifically LightGBM, to estimate hedging strategies. This design provides a computationally efficient alternative while preserving strong hedging performance and moving toward more user-centered explainability. To integrate LightGBM into a reinforcement-learning-style hedging framework, we introduce an optimization approach that sequentially trains tree-ensemble models while introducing stochasticity through random training orders. In controlled experiments, X Hedging achieves performance comparable to Deep Hedging while offering greater user-centered explainability, improved computational efficiency, and substantially higher robustness when training data are limited. The numerical results demonstrate that tree-ensemble methods provide an effective computational alternative to neural networks for data-driven dynamic hedging.
Updated: 2026-11-19 10:21:28
标题: X对冲:迈向可解释人工智能期权对冲框架
摘要: 我们提出了 X Hedging,这是一种 Deep Hedging 框架的替代方案,旨在解决基于神经网络的对冲策略在计算效率和可解释性方面的局限。Deep Hedging 利用神经网络学习灵活的对冲政策,但依赖不透明的模型,通常还需要大量训练数据,这可能增加结果解读的难度,并限制其在数据受限情境下的有效性。X Hedging 通过以树集成方法,特别是 LightGBM,替代神经网络来估计对冲策略,着手解决上述局限。该设计在保持较强对冲表现的同时,提供了一种计算效率更高的替代方案,并朝着更以用户为中心的可解释性迈进。为将 LightGBM 融入强化学习式对冲框架,我们提出了一种优化方法:按顺序训练树集成模型,并通过随机化训练顺序引入随机性。在受控实验中,X Hedging 达到了与 Deep Hedging 相当的表现,同时具备更强的以用户为中心的可解释性、更高的计算效率,以及在训练数据有限时显著更强的稳健性。数值结果表明,树集成方法能够为数据驱动的动态对冲提供一种有效的神经网络计算替代方案。
更新时间: 2026-11-19 10:21:28
领域: cs.LG,math.OC
Generalist Meets Specialists: An Evolving Multimodal Agent with Persistent Tool Orchestration for Traffic Scenario Understanding
Traffic scenario understanding requires combining fine-grained visual evidence with spatial and temporal reasoning. Tool-augmented vision-language models (VLMs) can use specialized perception tools, but effective collaboration faces two challenges: terminal rewards provide limited guidance for intermediate decisions and error recovery, while repeated planning adds unnecessary cost across similar tasks. Echoing the fast-slow dichotomy of human cognition, we propose StarTV-Agent, which combines policy learning with experience evolution to support adaptive reasoning when needed and efficient reuse of prior experience when possible. During training, Role-Sensitive Process Optimization (RSPO) combines process advantages with terminal advantages, while Weakness-Driven Demonstration Learning (WDL) provides validated teacher demonstrations targeting the student's weak questions. During inference, Lightweight Adaptive Workflow Reuse (LAWR) enables a fast path by selecting suitable workflows and binding task-specific arguments and resource references, while a slow ReAct-based path handles tasks without suitable workflows. We further design label-free feedback based on execution completion, workflow adoption, and cost savings to guide workflow reuse and memory updates. Across three challenging benchmarks, StarTV-Agent achieves up to 8.0% relative performance improvement, while reducing token consumption by up to 52.1%.
Updated: 2026-11-19 10:20:37
标题: 通才遇见专才:一种具备持久化工具编排能力、不断演进的多模态交通场景理解智能体
摘要: 交通场景理解需要将细粒度视觉证据与空间和时间推理相结合。工具增强型视觉语言模型(VLM)可以使用专门的感知工具,但要实现有效协作仍面临两项挑战:终端奖励对中间决策和错误恢复提供的指导有限,而在相似任务之间反复进行规划又会产生不必要的成本。受人类认知中快思考与慢思考二分法的启发,我们提出 StarTV-Agent,通过结合策略学习与经验演化,在需要时支持自适应推理,并在可能时高效复用既有经验。 在训练阶段,角色敏感过程优化(RSPO)将过程优势与终端优势相结合;弱点驱动示范学习(WDL)则提供经过验证的教师示范,针对学生表现薄弱的问题进行指导。在推理阶段,轻量级自适应工作流复用(LAWR)通过选择合适的工作流并绑定任务特定的参数与资源引用,实现快速路径;对于缺乏合适工作流的任务,则采用基于 ReAct 的慢速路径进行处理。我们进一步设计了基于执行完成度、工作流采用情况和成本节省情况的无标签反馈,以指导工作流复用和记忆更新。 在三个具有挑战性的基准测试中,StarTV-Agent 的相对性能提升最高达到 8.0%,同时将令牌消耗最多降低 52.1%。
更新时间: 2026-11-19 10:20:37
领域: cs.AI
Full Rank and Stable Sampling of $\tanh$ Networks
We study the recovery of feedforward $\tanh$ networks of fixed architecture with $P$ parameters from finitely many point evaluations. First, we characterize the set of parameters where the differential of the realization map has full rank and show that it coincides with the regular parameters in the sense of Vla{č}i{ć} and B{ö}lcskei (2021). Second, we make use of this characterization to prove that almost every tuple of $2P+1$ sampling points yields uniform-norm Lipschitz stability on compact subsets of this parameter set. Third, we prove that for exact observations, projected gradient descent and projected Gauss--Newton converge locally from sufficiently close feasible initial guesses. The same evaluations also determine the realized function for arbitrary parameters and identify parameters in the characterized set up to permutations and sign changes of hidden neurons. Finally, we develop a general framework for real-analytic networks that highlights the role of full rank in stability and local reconstruction.
Updated: 2026-11-19 10:18:03
标题: $\tanh$ 网络的满秩与稳定采样
摘要: 我们研究了如何通过有限个点值评估恢复具有固定架构、含有 \(P\) 个参数的前馈 \(\tanh\) 网络。首先,我们刻画了实现映射的微分具有满秩的参数集合,并证明该集合与 Vla{č}i{ć} 和 B{ö}lcskei(2021)意义下的正则参数集合相一致。其次,利用这一刻画,我们证明几乎每一组由 \(2P+1\) 个采样点组成的采样点组,都能在该参数集合的紧子集上导出关于一致范数的 Lipschitz 稳定性。第三,对于精确观测值,我们证明投影梯度下降法和投影 Gauss–Newton 法从充分接近的可行初始点出发时,能够局部收敛。同样的点值评估对于任意参数都能确定其实现的函数,并且能够将所刻画集合中的参数确定到隐藏神经元的置换和符号变化为止。最后,我们为实解析网络建立了一个一般框架,突出了满秩条件在稳定性和局部重构中的作用。
更新时间: 2026-11-19 10:18:03
领域: math.NA,cs.LG
VideoEditor-MoE: Scaling Complex Video Editing with Mixture of Experts
Complex video editing requires understanding complex instructions while jointly fulfilling multiple editing requests. Meeting these demands through dense model scaling substantially increases computational cost. We introduce VideoEditor-MoE, the first open-source mixture-of-experts framework for video editing. Beyond sparse MLP-MoE layers, MoE-Attention expands attention capacity through routed key--value experts while preserving global interactions among video tokens. Initialized from a 5B video editing model, VideoEditor-MoE scales to 14B and 56B parameters, with approximately 8B parameters activated per token in both variants. Comparisons with existing methods and two complementary baselines, Explicit-MoE and MLP-MoE, assess its benefits over explicit expert guidance and MLP-only expert architectures. Further analyses demonstrate that all experts remain active and reveal that learned routing responds more strongly to sample content and diffusion noise levels than to human-defined editing categories. Spatial analysis further indicates sensitivity to object-level semantic features. We also identify decoupled weight decay as a strategy for stabilizing expert scaling.
Updated: 2026-11-19 10:12:22
标题: VideoEditor-MoE:利用专家混合扩展复杂视频编辑能力
摘要: 复杂视频编辑需要理解复杂指令,同时完成多项编辑请求。通过大幅扩展模型规模来满足这些需求,会显著增加计算成本。我们提出了 VideoEditor-MoE,这是首个开源的视频编辑混合专家框架。除了稀疏 MLP-MoE 层之外,MoE-Attention 还通过路由键值专家扩展注意力容量,同时保留视频令牌之间的全局交互。VideoEditor-MoE 基于一个 5B 参数的视频编辑模型初始化,可扩展至 14B 和 56B 参数;在这两个版本中,每个令牌激活的参数量均约为 8B。通过与现有方法以及两个互补基线——Explicit-MoE 和 MLP-MoE——进行比较,我们评估了该方法相较于显式专家引导和仅采用 MLP 专家架构的优势。进一步分析表明,所有专家始终保持活跃,并揭示出,学习到的路由对样本内容和扩散噪声水平的响应强于对人为定义的编辑类别的响应。空间分析进一步表明,该方法对对象级语义特征具有敏感性。我们还发现,解耦权重衰减是一种能够稳定专家规模扩展的策略。
更新时间: 2026-11-19 10:12:22
领域: cs.CV,cs.AI
FRInGe: Distribution-Space Integrated Gradients with Fisher--Rao Geometry
Although gradient-based attribution methods are model-faithful and scalable, a prominent variant, Integrated Gradients (IG), suffers from high sensitivity to design choices, particularly in baseline selection, path formulation, and discretization, as well as gradient saturation. To address these limitations, we propose Fisher--Rao Integrated Gradients (FRInGe), which defines both the reference and integration paths in the predictive distribution space. FRInGe replaces input baselines with a maximum-entropy predictive reference and follows a Fisher--Rao geodesic on the probability simplex. The corresponding input-space trajectory is realized through the pullback Fisher metric and stabilized by Kullback--Leibler (KL) and Euclidean trust regions; attributions are obtained by integrating input gradients along this trajectory. We further derive FRInGe-B, a variant that binarizes the predictive probability distribution, removing the computationally expensive Fisher products of FRInGe. Across six ImageNet architectures, FRInGe most clearly improves Magnitude Aligned Scoring (MAS), while remaining competitive on perturbation area-under-the-curve (AUC) metrics and infidelity.
Updated: 2026-11-19 10:11:28
标题: FRInGe:具有 Fisher–Rao 几何的分布空间积分梯度
摘要: 尽管基于梯度的归因方法具有模型忠实性强且可扩展的优点,但其中一个重要变体——积分梯度(Integrated Gradients,IG)——对设计选择高度敏感,尤其是在基线选择、路径构造和离散化方面,同时还会受到梯度饱和的影响。为解决这些局限,我们提出 Fisher–Rao 积分梯度(Fisher–Rao Integrated Gradients,FRInGe),在预测分布空间中同时定义参考点和积分路径。FRInGe 用最大熵预测参考替代输入基线,并在概率单纯形上沿 Fisher–Rao 测地线前进。相应的输入空间轨迹通过拉回 Fisher 度量实现,并由 Kullback–Leibler(KL)信赖域和欧氏信赖域加以稳定;归因结果则通过沿该轨迹对输入梯度进行积分获得。我们进一步推导出 FRInGe-B 变体,该方法将预测概率分布二值化,从而消除了 FRInGe 中计算开销较大的 Fisher 乘积。在六种 ImageNet 架构上的实验表明,FRInGe 在幅度对齐评分(Magnitude Aligned Scoring,MAS)方面带来了最明显的改进,同时在扰动曲线下面积(AUC)指标和不忠实度方面也保持了竞争力。
更新时间: 2026-11-19 10:11:28
领域: cs.LG
RePAIR: Predictive Self-Supervised Representation Learning in Chess
In this paper, we introduce Representation Prediction via Autoencoding using Iterative Refinement (RePAIR) - a novel self-supervised representation learning architecture that synthesizes Masked Autoencoders (MAE), Joint Embedding Predictive Architectures (JEPA), and Bidirectional Encoder Representations from Transformers (BERT). We demonstrate how it can be used to encode objects in sequential data like consecutive chess positions into compact yet meaningful representations. The basic principle of the architecture is to mask large portions of a sequence of latent states, similar to BERT and MAE. Then, we apply a lightweight Predictor to the latent representations that repairs gaps in the sequence in a lower-dimensional embedding space akin to JEPA. Our experiments in the domain of chess show that the Encoder refines the board representations such that meaningful chess concepts emerge clustered in the latent space. Furthermore, reconstructions of the masked board states show that the model is able to reason about the piece movements without relying on costly reinforcement learning methods. Lastly, we find that the resulting representation space allows for quick and intuitive dissections of chess games by observing the game path trajectories in this semantically rich space.
Updated: 2026-11-19 10:11:15
标题: RePAIR:国际象棋中的预测式自监督表征学习
摘要: 本文提出了通过迭代细化进行自编码的表征预测(Representation Prediction via Autoencoding using Iterative Refinement,RePAIR)——一种新颖的自监督表征学习架构,融合了掩码自编码器(Masked Autoencoders,MAE)、联合嵌入预测架构(Joint Embedding Predictive Architectures,JEPA)以及基于 Transformer 的双向编码器表征(Bidirectional Encoder Representations from Transformers,BERT)。我们展示了如何利用该架构,将连续数据中的对象(例如连续的国际象棋局面)编码为紧凑且具有意义的表征。该架构的基本原理是对潜在状态序列中的大部分内容进行掩码,这与 BERT 和 MAE 类似。随后,我们对这些潜在表征应用一个轻量级预测器,在类似 JEPA 的低维嵌入空间中修复序列中的缺失部分。我们在国际象棋领域进行的实验表明,编码器能够细化棋盘表征,使有意义的棋类概念在潜在空间中形成聚类。此外,对被掩码棋盘状态的重建结果显示,该模型能够推理棋子的移动,而无需依赖代价高昂的强化学习方法。最后,我们发现,所得的表征空间具有丰富的语义信息;通过观察棋局在该空间中的路径轨迹,可以快速且直观地剖析棋局。
更新时间: 2026-11-19 10:11:15
领域: cs.LG
The Endogeneity of Miscalibration: Impossibility and Escape in Scored Reporting
An agent's probability report is paid for twice: by a strictly proper scoring rule, which rewards accuracy, and by an approval rule for the decision it triggers. An approval rule that is not affine is known to defeat truthful reporting. We show the conflict is built in: whenever perfect screening is attainable, the welfare-maximizing approval rule is never affine. The distortion is predictable: there is a reserve report at which pretending to be the marginal type costs exactly what approval is worth. Approving every report at or above the reserve sorts agents as if their beliefs were observed, under every strictly proper score and for any belief distribution. So does a continuous rule with one corner; under strict feasibility no continuously differentiable rule does. The binding constraint is steepness, not smoothness: a slope-capped rule sorts perfectly if and only if the cap reaches the critical slope, the steepest chord of the pretending cost up to the reserve; below it the welfare loss is cubic in the shortfall. For the Brier, log and power scores, and whenever the pretending cost is convex up to the reserve, the critical slope has a closed form. The instances are AI-agent oversight and marketplace operation.
Updated: 2026-11-19 10:10:59
标题: 失校准的内生性:评分报告中的不可能性与突围
摘要: 代理人的概率报告获得双重支付:一方面,严格适当评分规则会奖励报告的准确性;另一方面,报告所触发决策的批准规则也会给予回报。人们普遍认为,非仿射的批准规则必然会破坏真实报告。我们表明,这种冲突是内生的:只要能够实现完美筛选,使福利最大化的批准规则就绝不会是仿射的。其扭曲具有可预测性:存在一个保留报告,在该报告处,假装成边际类型的成本恰好等于批准所带来的价值。批准所有不低于该保留报告的报告,便能像直接观察到代理人的信念一样对其进行排序,而且这一结论适用于任何严格适当评分规则和任意信念分布。一个带有单个折角的连续规则也能实现同样效果;而在严格可行的情况下,不存在能够实现这一点的连续可微规则。决定性约束在于陡峭程度,而非光滑性:设定斜率上限的规则能够实现完美排序,当且仅当该上限达到临界斜率,即截至保留报告的假装成本曲线的最陡弦斜率;当上限低于临界值时,福利损失关于这一不足量呈三次方增长。对于布里尔评分、对数评分和幂评分,以及在假装成本截至保留报告之前为凸的任何情形,临界斜率都有闭式表达。相关应用场景包括人工智能代理监督和市场运营。
更新时间: 2026-11-19 10:10:59
领域: cs.GT,cs.AI,cs.MA,econ.TH,math.OC
Decoupled Knowledge Retrieval and Compact Memory Enable Reliable Lifelong Model Editing
Lifelong model editing requires continuously incorporating new facts into deployed large language models (LLMs) without expensive retraining or compromising existing capabilities. Memory-based editors offer an appealing solution by keeping the base parameters untouched, yet their practical use is hindered by linearly growing storage requirements and deteriorating retrieval performance as edits accumulate. To tackle these problems, we introduce BiSpace, a lifelong model editing framework that decouples memory retrieval from knowledge injection across two distinct representation spaces. BiSpace routes queries and identifies relevant edits in an external semantic space, while injecting the corresponding knowledge into the internal representation space of the LLM through sparse and storage-efficient updates. Extensive experiments show that BiSpace shrinks each entry's storage to only about 10.2% of the original and shows strong resilience to long edit sequences of up to 16K edits. On a more challenging benchmark, BiSpace further improves Overall Performance by more than 23% over existing methods. These results advance memory-based editing toward reliable long-term model maintenance at scale.
Updated: 2026-11-19 10:10:57
标题: 解耦的知识检索与紧凑记忆实现可靠的终身模型编辑
摘要: 终身模型编辑要求在不进行昂贵再训练且不损害现有能力的情况下,持续将新事实融入已部署的大型语言模型(LLM)。基于记忆的编辑器通过保持基础模型参数不变,提供了一种颇具吸引力的解决方案;然而,随着编辑不断累积,其存储需求呈线性增长,检索性能也会逐渐下降,从而限制了实际应用。为解决这些问题,我们提出了 BiSpace,一种终身模型编辑框架,将记忆检索与知识注入解耦到两个不同的表示空间中。BiSpace 在外部语义空间中对查询进行路由并识别相关编辑,同时通过稀疏且高存储效率的更新,将相应知识注入大型语言模型的内部表示空间。大量实验表明,BiSpace 将每条记录的存储量压缩至原始大小的约 10.2%,并且能够强韧地应对长达 1.6 万次编辑的连续编辑序列。在更具挑战性的基准测试中,BiSpace 进一步将总体性能提升至超过现有方法 23% 的水平。这些结果推动了基于记忆的编辑技术向大规模、可靠的长期模型维护迈进。
更新时间: 2026-11-19 10:10:57
领域: cs.AI
Continuous-time learning of probability distributions: a case study in a digital trial of young children with type 1 diabetes
Understanding how biomarker distributions evolve over time is a central challenge in digital health and chronic disease monitoring. For example, in diabetes, changes in the distribution of glucose measurements can reveal patterns of disease progression and treatment response that conventional summary measures miss. Motivated by a 13-week clinical trial comparing the closed-loop insulin delivery system t:slim X2 with standard therapy in children with type 1 diabetes, we propose a probabilistic framework to model the continuous-time evolution of time-indexed distributions using continuous glucose monitoring (CGM) data collected every five minutes. We represent the glucose distribution as a Gaussian mixture, with time-varying mixture weights governed by a neural ODE. We estimate the model parameters using a distribution-matching criterion based on the maximum mean discrepancy. The resulting framework is interpretable, computationally efficient, and sensitive to subtle temporal distributional changes. In the CGM trial data analyzed here, the method detects treatment-related improvements in glucose dynamics that are difficult to capture with traditional analytical approaches.
Updated: 2026-11-19 10:10:29
标题: 概率分布的连续时间学习:一项针对1型糖尿病幼儿的数字化试验案例研究
摘要: 理解生物标志物分布如何随时间演变,是数字健康和慢性病监测领域面临的核心挑战之一。例如,在糖尿病研究中,血糖测量值分布的变化能够揭示疾病进展和治疗反应的模式,而传统的汇总指标往往难以捕捉这些信息。受一项为期13周、比较闭环胰岛素输注系统 t:slim X2 与标准治疗在1型糖尿病儿童中疗效的临床试验启发,我们提出了一个概率框架,利用每5分钟采集一次的连续血糖监测(CGM)数据,对以时间为索引的分布进行连续时间演化建模。我们将血糖分布表示为高斯混合分布,并通过神经常微分方程(neural ODE)描述随时间变化的混合权重。模型参数采用基于最大均值差异的分布匹配准则进行估计。该框架具有可解释性强、计算效率高以及能够敏感识别细微时间分布变化等特点。在本文分析的CGM试验数据中,该方法检测到了与治疗相关的血糖动态改善,而这些改善很难通过传统分析方法捕捉。
更新时间: 2026-11-19 10:10:29
领域: stat.ML,cs.LG
HabitusMem: Belief Memory over Evolving User Preferences for LLM Agents
Personalized LLM agents must act on a user's current preferences, which change across interactions and are rarely stated in full. Existing memory systems store and retrieve content from the interaction history and leave the agent to work out which preferences still hold and where they apply. Such content does not indicate whether a preference is still current or where it applies, so agents often act on outdated or misapplied preferences. We instead treat memory as the assistant's belief about the user. Following Bourdieu's account of habitus as durable but revisable dispositions, we model the user as a latent preference state that every interaction, including the current request, both reveals and updates. The belief summarizes what the history supports about this state, and memory consists of the individual beliefs that bear on the agent's current decision, each with its evidence, scope, and status. We implement this view in HabitusMem, a trained writer that states these beliefs as text records for a frozen agent. Across two agent families, HabitusMem achieves the best results among memory systems on both PersonaMem-v2 and VitaBench 2.0. Controlled analyses show that learned request conditioning drives the answering gain, while auxiliary training tasks improve tool use.
Updated: 2026-11-19 10:08:26
标题: HabitusMem:面向大语言模型智能体不断变化的用户偏好的信念记忆
摘要: 个性化大语言模型代理必须根据用户当前的偏好采取行动,而这些偏好会在不同交互之间发生变化,且很少被完整明确地表达出来。现有记忆系统会从交互历史中存储和检索内容,并将判断哪些偏好仍然有效以及适用于何处的任务留给代理完成。这类内容无法表明某项偏好是否仍然有效,也无法说明其适用范围,因此代理经常依据过时的偏好行事,或将偏好错误地应用于不适用的情境。 相较之下,我们将记忆视为助手对用户的信念。遵循布迪厄关于惯习的论述——惯习是持久但可修正的倾向——我们将用户建模为一种潜在的偏好状态:每次交互(包括当前请求)既揭示这一状态,也会更新这一状态。该信念概括了历史记录对于这一状态所提供的支持;记忆则由一组与代理当前决策相关的个体信念构成,每条信念都包含其证据、适用范围和状态。 我们在 HabitusMem 中实现了这一理念:它是一个经过训练的写入器,能够将这些信念以文本记录的形式表达出来,供一个冻结的代理使用。在两类代理上,HabitusMem 在 PersonaMem-v2 和 VitaBench 2.0 上均取得了记忆系统中的最佳结果。受控分析表明,学习到的请求条件化机制推动了回答能力的提升,而辅助训练任务则改善了工具使用能力。
更新时间: 2026-11-19 10:08:26
领域: cs.AI,cs.NE
Generative Forecasting from Coarse Observations: Does Cascading Help?
We study probabilistic forecasting of dynamical systems such as fluids and waves from coarse observations. Since the unseen fine scales influence the dynamics, the same coarse initial state can evolve into a whole distribution of futures. Generative forecasters may produce visually plausible samples, but it is hard to tell whether they sample the right conditional distribution, since trajectory data contain a single future for each initial state. We address this problem by generating reference data in a hierarchical way: for each coarse initial state, we generate many different fine-scale components and numerically evolve the full states. Using these conditional ensembles, we show that standard diffusion models and stochastic interpolants can make substantial distributional errors when trained over the full forecast horizon with finite data and model capacity, despite being exact in principle. We then show that cascading shorter forecasts greatly reduces these errors for the turbulent flows and waves we study, but we also find and characterize cases in which it hurts. Since the coarse process is not Markov, cascading discards information about the unresolved fine scales even with exact transitions. To understand this, we propose a solvable analytic model which shows that the optimal cascade depth decreases as the coupling between the unresolved and observed scales gets stronger, and increases as the dependence of the forecast on the observation becomes more oscillatory. Consistent with our experiments, cascading is detrimental when the direct forecast is "easy" to learn, for example Gaussian as in the passive scalar case. We release our datasets as a first benchmark for probabilistic forecasting with ground-truth conditional ensembles.
Updated: 2026-11-19 10:06:02
标题: 从粗粒度观测进行生成式预测:级联是否有帮助?
摘要: 我们研究了如何根据粗粒度观测对流体、波等动力系统进行概率预测。由于未观测到的细尺度会影响系统动力学,同一个粗粒度初始状态可能演化为一整组未来状态分布。生成式预测模型或许能够生成视觉上合理的样本,但很难判断它们是否采样了正确的条件分布,因为轨迹数据对于每个初始状态只包含一个未来。为解决这一问题,我们以分层方式生成参考数据:对于每个粗粒度初始状态,生成许多不同的细尺度分量,并对完整状态进行数值演化。利用这些条件集合,我们表明,在有限数据和有限模型容量下,标准扩散模型和随机插值模型即使在理论上是精确的,当针对整个预测时域进行训练时,仍可能产生显著的分布误差。随后我们表明,对于所研究的湍流和波动系统,将预测过程级联为多个较短时段的预测能够大幅减少这些误差,但我们也发现并刻画了级联会造成负面影响的情形。由于粗粒度过程并非马尔可夫过程,即使转移过程是精确的,级联仍会丢弃有关未解析细尺度的信息。为理解这一现象,我们提出了一个可解析求解的分析模型。该模型表明,随着未解析尺度与观测尺度之间的耦合增强,最优级联深度会减小;而随着预测对观测的依赖变得更加振荡,最优级联深度会增大。与我们的实验结果一致,当直接预测易于学习时,级联会产生不利影响,例如在被动标量情形中,直接预测服从高斯分布。我们将公开这些数据集,作为首个具有真实条件集合的概率预测基准。
更新时间: 2026-11-19 10:06:02
领域: cs.LG
Interpretable Prototype-Conditioned Adaptation for Weather Forecasting
Data-driven weather forecasting requires distinguishing local states and their temporal evolution. However, learned patterns remain implicit in neural forecasters, making their influence difficult to interpret. Failing to distinguish local evolution can lead to similar forecasts for locations that develop differently, increasing prediction error. This motivates explicit references for distinguishing and interpreting local patterns. Prototypes provide explicit pattern references, but sample- or task-level conditioning leaves open how to adapt to distinct locations and variable groups. To deal with this problem, we design ProtoCast, which uses group-specific prototype banks to adapt local features while accounting for cross-variable dependencies. Specifically, (1) we combine each group's historical features and temporal change with forecast context from cross-variable attention for evolution-aware prototype matching. (2) Sparse mixtures of prototype-specific low-rank operators tailor corrections to each group and location. A gated attention block then exchanges the corrected features across groups before prediction. Each group's correction decomposes into explicit prototype contributions before this fusion. (3) We jointly train the forecasting network and operators from scratch and refit each group's prototypes before every training epoch. Slot tracking preserves prototype-operator associations, making each prototype's contribution to local corrections more interpretable. Experiments on GlobalForecast and TyphoonTracking show improved forecasting accuracy, while prototype deletion links local feature contributions to changes in prediction error. This work advances the development of more accurate and interpretable data-driven weather forecasting models. Project page: https://zhixuanli.github.io/projects/li2026protocast
Updated: 2026-11-19 10:02:19
标题: 用于天气预报的可解释原型条件适应方法
摘要: 数据驱动的天气预报需要区分局地状态及其时间演化。然而,学习到的模式在神经预报模型中仍是隐式的,因此难以解释其影响。未能区分局地演化,可能会导致对发展方式不同的地点给出相似的预报,从而增加预测误差。这促使人们引入显式参照,以区分和解释局地模式。原型能够提供显式的模式参照,但基于样本或任务层面的条件机制仍未解决如何适应不同地点和变量组的问题。为此,我们设计了 ProtoCast,通过使用组特定的原型库来适应局地特征,同时考虑变量间的依赖关系。具体而言:(1)我们将每个变量组的历史特征及其时间变化,与通过跨变量注意力获得的预报上下文相结合,以实现具有演化感知能力的原型匹配。(2)由原型特定的低秩算子构成的稀疏混合机制,为每个变量组和地点定制修正。随后,门控注意力模块在预测前跨组交换修正后的特征。每个变量组的修正会在融合前分解为显式的原型贡献。(3)我们从头联合训练预报网络和算子,并在每个训练周期开始前重新拟合各组原型。槽位跟踪机制保留原型与算子之间的对应关系,使每个原型对局地修正的贡献更易于解释。在 GlobalForecast 和 TyphoonTracking 数据集上的实验表明,该方法提高了预报准确性;同时,删除原型能够将局地特征贡献与预测误差的变化联系起来。本研究推动了更准确、更具可解释性的数据驱动天气预报模型的发展。项目主页:https://zhixuanli.github.io/projects/li2026protocast
更新时间: 2026-11-19 10:02:19
领域: cs.LG,cs.CV
Probing the limits of materials design via a comprehensive crystal database of 14.6 million structures with 140 properties
Forward screening and inverse design drive materials discovery, yet their limits remain unquantified because records of known crystal structures and properties are fragmented across databases. Consequently, forward screening leaves known crystals underexplored for new functions, whereas generative and autonomous discovery has repeatedly reported known phases or close variants as new materials. Here we match structures across 55 databases to assemble MateriaViva, a unified database of 14.6 million distinct crystals and over one billion property values. To provide the missing properties of every structure, a task we term property completion, we develop an equivariant Crystal Graph Transformer Network with state-of-the-art accuracy on nine benchmark tasks and apply 140 property-prediction models across the database. These predictions reveal the underestimated potential of forward screening, identifying tens of thousands of high-performance candidates among previously synthesized or computationally studied materials that lack recorded target-property values. Conversely, comparison with MateriaViva shows that the novelty of inverse design has been overestimated, as 55-100% of inverse-designed structures are not new. Under equal density functional theory verification budgets for bulk-modulus design, inverse design yields a higher fraction of qualifying candidates, whereas forward screening reaches the higher bulk modulus. MateriaViva thus provides a comprehensive reference for probing the limits of both paradigms, revealing unrecognized performance in known crystals and directing inverse design beyond reported structures.
Updated: 2026-11-19 10:01:42
标题: 通过包含 1460 万种结构及 140 项性质的综合晶体数据库探索材料设计的极限
摘要: 正向筛选和逆向设计推动着材料发现,但由于已知晶体结构及其性质的记录分散在不同数据库中,二者的局限性仍未得到量化。因此,正向筛选使已知晶体在新功能方面的潜力未被充分探索,而生成式和自主材料发现则屡次将已知相或其近似变体作为新材料报道。在此,我们对55个数据库中的结构进行匹配,构建了MateriaViva这一统一数据库,收录1460万个不同晶体以及超过十亿条性质数据。为补全每种结构缺失的性质——我们将这项任务称为性质补全——我们开发了一种具备等变性的晶体图Transformer网络,在九项基准任务上取得了最先进的准确度,并在整个数据库上应用了140个性质预测模型。这些预测揭示了正向筛选被低估的潜力:在此前已合成或经过计算研究、但缺乏目标性质记录的材料中,发现了数以万计的高性能候选材料。相反,与MateriaViva的比较表明,逆向设计的新颖性被高估了,因为55%至100%的逆向设计结构并非全新结构。在体积模量设计中,当采用相同的密度泛函理论验证预算时,逆向设计产生合格候选材料的比例更高,而正向筛选获得的体积模量更高。因此,MateriaViva为探究这两种范式的局限性提供了全面的参考,揭示了已知晶体未被认识的性能,并引导逆向设计超越已报道的结构。
更新时间: 2026-11-19 10:01:42
领域: cond-mat.mtrl-sci,cs.LG
LINEAGE: A Benchmark for Empirical Lineage Retrieval in AI Scientific Literature
Current research agents are moving beyond academic search toward literature synthesis and experiment planning. These workflows increasingly rely on literature retrieval systems, which serve as standalone systems or as components of research agents. However, existing scientific literature retrieval benchmarks mainly evaluate these methods using topical relevance or citation links as supervision, which cannot capture which prior methods are used for empirical comparison. To address this gap, we introduce Lineage, a benchmark for empirical lineage retrieval in AI scientific literature. An empirical lineage relation links a prior paper to a source paper that explicitly uses its method as an empirical comparison baseline. These relations form lineage graphs whose multi-hop neighborhoods provide retrieval ground truth for structural evaluation. To construct these graphs at scale, we develop Lineage-Constructor, which converts heterogeneous paper records and full-paper empirical baseline evidence into calibrated lineage graphs. Built from 121,048 papers across 17 top AI venues from 2018 to 2025, Lineage contains 3,950 graph components, 67,502 paper nodes, 164,948 lineage edges, and 80,000 multi-facet retrieval queries. Experiments with 19 representative retrieval systems show that empirical lineage retrieval remains challenging. Performance drops sharply with lineage distance, while structural metrics reveal that isolated retrieval hits often fail to recover closely connected empirical comparison neighborhoods.
Updated: 2026-11-19 09:59:33
标题: LINEAGE:人工智能科学文献实证谱系检索基准
摘要: 当前的研究智能体正从学术搜索拓展至文献综合与实验规划。这些工作流程日益依赖文献检索系统,而文献检索系统既可以作为独立系统运行,也可以作为研究智能体的组成部分。然而,现有的科学文献检索基准主要使用主题相关性或引文链接来监督和评估这些方法,无法捕捉哪些先前方法被用于实证比较。为弥补这一空白,我们提出了 Lineage,这是一个面向人工智能科学文献中实证谱系检索的基准。实证谱系关系将一篇先前论文与一篇来源论文相连接,后者明确使用前者的方法作为实证比较基线。这些关系形成谱系图,其多跳邻域为结构化评估提供检索真值。为大规模构建这些图,我们开发了 Lineage-Constructor,将异构论文记录和全文中的实证基线证据转换为经过校准的谱系图。Lineage 数据集由 2018 年至 2025 年间发表于 17 个顶级人工智能会议和期刊的 121,048 篇论文构建而成,包含 3,950 个图组件、67,502 个论文节点、164,948 条谱系边,以及 80,000 个多维检索查询。对 19 个具有代表性的检索系统进行的实验表明,实证谱系检索仍然具有挑战性。随着谱系距离增加,系统性能会显著下降;与此同时,结构化指标显示,孤立的检索命中通常无法恢复联系紧密的实证比较邻域。
更新时间: 2026-11-19 09:59:33
领域: cs.IR,cs.AI
Whose Risks Count? What 1,901 AI Incidents Reveal About Corporate Disclosures
AI systems can harm people, yet the AI actors that provide or deploy them are rarely obliged to disclose these risks. US securities regulation is an exception. Companies registered with the Securities and Exchange Commission (SEC) must disclose their material risks, including those of their AI systems, in filings that carry liability for misstatement. Materiality, however, is defined by what a reasonable investor would consider important, so harms to third parties enter disclosure only insofar as they become financial risks for the company. We test whether AI harms do so by matching 9,001 AI incidents to 18,229 SEC filings of 328 AI actors by risk type. Of the 1,901 incidents with filings before and after them, half belong to a risk type that the AI actor never disclosed, and this share varies with the kind of harm. Filings disclose the risk types of 67\% of system failures but only 2\% of social system harms, and AI actors themselves report fewer than 2\% of incidents. Securities disclosure thus records the risks that AI actors face rather than the harms that people subject to AI bear. Public authorities that hold AI actors accountable for such harms could make them financially material. We release DISC, the Disclosure--Incident Securities Corpus, to support this work.
Updated: 2026-11-19 09:57:00
标题: 谁的风险才算数?1,901起人工智能事件揭示了企业披露的真相
摘要: 人工智能系统可能对人造成伤害,但提供或部署这些系统的人工智能行为者很少被要求披露此类风险。美国证券监管是一个例外。向美国证券交易委员会(SEC)注册的公司必须在申报文件中披露其重大风险,包括人工智能系统带来的风险,而对错误陈述承担法律责任。然而,重大性取决于合理投资者会认为哪些事项重要,因此,只有当对第三方的伤害转化为公司的财务风险时,这些伤害才会进入披露范围。我们按照风险类型,将9,001起人工智能事件与328家人工智能行为者提交的18,229份SEC申报文件进行匹配,以检验人工智能伤害是否会产生此类影响。在1,901起前后均有相关申报文件的事件中,有一半属于人工智能行为者从未披露过的风险类型,而这一比例会因伤害类型不同而变化。申报文件披露了67%的系统故障风险类型,却只披露了2%的社会性系统伤害风险类型;人工智能行为者自身报告的事件不足2%。因此,证券披露记录的是人工智能行为者面临的风险,而不是人工智能影响下的人们所承受的伤害。负责追究人工智能行为者此类伤害责任的公共机构,可以使这些伤害对企业具有财务重大性。我们发布了DISC(披露—事件证券语料库),以支持这项研究。
更新时间: 2026-11-19 09:57:00
领域: cs.AI
Harnessing Medical Visual-Language Models with Agentic Evidence Management
Medical vision-language agents increasingly rely on segmentation tools, and recent work has focused on acquiring the right mask, often treating a good mask as the end point of tool use. But do these agents use the resulting evidence effectively? To answer this question, we need a benchmark that separates evidence use from segmentation quality, spans multiple medical image types, and allows the same mask to be presented in different ways. Existing medical VQA datasets do not jointly provide these properties. We therefore construct Mask-Evidence MedVQA, a 2.5K-example benchmark spanning four image types, where each question is paired with an answer-relevant ground-truth mask and multiple possible renderings. Our study reveals two limitations of direct tool use. First, evidence presentation matters. Different renderings of the same fixed mask can substantially change model behavior. Second, masks introduce an evidence trade-off. Highlighting a relevant region can expose diagnostic evidence the model previously missed, but the added visual cue can also induce incorrect associations. As a result, even a ground-truth mask can correct some answers while turning initially correct ones into incorrect ones. Together, these findings show that acquiring the right mask is not enough. An agent must also decide how to present the evidence and whether it should change the answer. We therefore introduce TUNE (Tool Use is Not Enough), an evidence-management harness that explicitly manages what evidence to acquire, how to present it, and whether to accept the resulting answer update. Across three public medical VQA benchmarks, evidence management improves the fine-tuned Qwen3.5-9B backbone's mean accuracy by 4.0 percentage points. Full TUNE improves over direct tool use by 9.1 points on average across seven benchmarks and achieves competitive results against existing medical VLMs and agents.
Updated: 2026-11-19 09:55:33
标题: 利用智能体式证据管理驾驭医学视觉语言模型
摘要: 医学视觉语言智能体日益依赖分割工具,近期研究也主要集中于获取正确的掩膜,往往将高质量掩膜视为工具使用的终点。但这些智能体是否能够有效利用由此得到的证据?要回答这一问题,我们需要一种能够将证据利用与分割质量区分开来、覆盖多种医学图像类型,并允许以不同方式呈现同一掩膜的基准。现有医学视觉问答数据集并未同时具备这些特性。因此,我们构建了 Mask-Evidence MedVQA,这是一个包含 2.5K 个样例、覆盖四种图像类型的基准数据集,其中每个问题都配有与答案相关的真实掩膜以及多种可能的呈现方式。 我们的研究揭示了直接使用工具的两个局限。首先,证据的呈现方式十分重要。同一个固定掩膜的不同呈现方式,可能显著改变模型的行为。其次,掩膜会引入证据权衡。突出显示相关区域可以揭示模型此前遗漏的诊断证据,但新增的视觉线索也可能诱发错误联想。因此,即使是真实掩膜,也可能纠正部分错误答案,同时将原本正确的答案变为错误答案。 综上,这些发现表明,获取正确的掩膜并不足够。智能体还必须决定如何呈现证据,以及是否应据此修改答案。为此,我们提出 TUNE(Tool Use is Not Enough,工具使用并不足够),一种证据管理框架,能够明确管理应获取哪些证据、如何呈现这些证据,以及是否接受由此产生的答案更新。在三个公开医学视觉问答基准上,证据管理使经过微调的 Qwen3.5-9B 骨干模型的平均准确率提升了 4.0 个百分点。在七个基准上的平均结果表明,完整的 TUNE 相较于直接使用工具提升了 9.1 个百分点,并取得了与现有医学视觉语言模型和智能体具有竞争力的结果。
更新时间: 2026-11-19 09:55:33
领域: cs.CV,cs.AI
Self-Replicating Language Models
Whether large language models (LLMs) and LLM-based agents are a form of life is a scientifically interesting question. Under the Darwinian definition of life, it is also a practical one, because a system capable of Darwinian Evolution can adapt. We therefore test several modes in which a language model can reproduce itself: by emitting a genome that trains its offspring, by copying and mutating its own weights, and by teaching a child from its own samples. In principle, small language models can replicate and evolve: selection improves them, and they adapt to narrow niches. Selection also lowers mutation rates, and a language model, unlike any organism, can lower its own to zero, which may limit its evolution. Flagship LLMs can write such replicators, but for a large LLM to replicate by teaching its offspring remains, for now, technically and economically infeasible.
Updated: 2026-11-19 09:55:02
标题: 自我复制语言模型
摘要: 大型语言模型(LLM)及基于大型语言模型的智能体是否属于生命,是一个具有科学趣味的问题。按照达尔文式的生命定义,这同时也是一个具有实践意义的问题,因为能够进行达尔文式进化的系统具备适应能力。因此,我们测试了语言模型自我复制的几种方式:输出一个用于训练其后代的基因组、复制并突变自身的权重,以及利用自身生成的样本教导一个子代。原则上,小型语言模型可以实现复制和进化:选择会使它们得到改进,并使其适应狭窄的生态位。选择还会降低突变率,而语言模型不同于任何生物,它可以将自身的突变率降至零,这可能会限制其进化。旗舰级大型语言模型能够编写出这样的复制器,但对大型语言模型而言,通过教导其后代来实现自我复制目前仍在技术上和经济上不可行。
更新时间: 2026-11-19 09:55:02
领域: cs.AI
Refined Topology-Pass Scheduling: Damped Trust-Region Compensation for Dynamic k-NN Graphs in SE(3)-Equivariant Structure Prediction
Equivariant structure-prediction pipelines alternate coordinate updates with the construction of a k-nearest-neighbour (kNN) graph whose membership is a discrete, piecewise-constant function of the coordinates. Rebuilding that graph at every block boundary (PB) is the expensive part of an epoch, whereas reusing one frozen graph (F) is fast but leaves a topology gap. We study a two-pass design in which the cheap pass records a small amount of state (margins, kNN radii, measured per-boundary displacements) and a second pass compensates conservatively. We formulate the choice of the graph-construction basis as a damped fixed-point iteration whose unique fixed point is exactly PB, and derive (i) exact non-flip certificates with the two-sided constant $m_i/4$ and one-sided constant $m_i/2$, (ii) the minimum-variance (BLUE) replay gain $γ^*$ and the resulting feasibility crossover, (iii) an $\ell_\infty$ trust-region projection that preserves convergence, and (iv) an analytic near-tie spacing law $E[m] \approx r_k/(3k)$ that matches measurements to 1\%. Three compensation levels are implemented in C++ (L1: frozen set with live geometry; L2: margin-gated local repair; L3: damped, projected basis) and validated under a matched-conditions protocol (identical seed, MSA depth and trajectory family, only the topology mode differs). L2 reproduces the PB edge set exactly ($D = 0.0000$ at every boundary), L1 stays within 0.6% and L3 interpolates monotonically: L2 reproduces the PB edge set exactly when the trust region is removed, and L3 interpolates between the frozen and the PB topology. The recorded trajectory itself yields a measured $1.5\times$ Pass-1 and $1.76\times$ epoch speed-up with no measurable loss gap. An open-source implementation of the runtime and of all the experiments reported here is available at https://github.com/AlbertHuang96/ProteinPredictMachineLearning.
Updated: 2026-11-19 09:51:13
标题: 精细化拓扑通行调度:面向 SE(3) 等变结构预测中动态 k-NN 图的阻尼信赖域补偿
摘要: 等变结构预测流程交替进行坐标更新,并构建一个 k 近邻(kNN)图,其成员关系是坐标的离散分段常数函数。在每个模块边界(PB)重新构建该图是一个周期中最耗时的部分,而复用一张冻结图(F)虽然速度快,却会留下拓扑差距。我们研究了一种双遍设计:第一遍以较低成本记录少量状态信息(间隔、kNN 半径以及测得的每个边界位移),第二遍则进行保守补偿。我们将图构建基准的选择表述为一种阻尼定点迭代,其唯一不动点正是 PB,并推导出:(i)采用双侧常数 $m_i/4$ 和单侧常数 $m_i/2$ 的精确不翻转证书;(ii)最小方差(BLUE)重放增益 $γ^*$ 及由此得到的可行性交叉点;(iii)一种能够保持收敛性的 $\ell_\infty$ 信赖域投影;(iv)解析的近等距间隔定律 $E[m] \approx r_k/(3k)$,其与测量结果的误差为 1%。我们在 C++ 中实现了三种补偿级别(L1:采用冻结邻居集合但使用实时几何;L2:由间隔门控的局部修复;L3:阻尼的投影基准),并在匹配条件协议下进行了验证(使用相同的随机种子、MSA 深度和轨迹族,唯一差异是拓扑模式)。L2 完全重现了 PB 边集(每个边界的 $D = 0.0000$),L1 的偏差保持在 0.6% 以内,而 L3 则单调插值:移除信赖域后,L2 完全重现 PB 边集;L3 则在冻结拓扑与 PB 拓扑之间进行插值。记录的轨迹本身带来了 1.5 倍的第一遍速度提升和 1.76 倍的周期速度提升,且没有可测量的性能损失差距。本文所报告的运行时实现及全部实验的开源代码可在 https://github.com/AlbertHuang96/ProteinPredictMachineLearning 获取。
更新时间: 2026-11-19 09:51:13
领域: cs.LG,cs.AI
Rank2Replace: VLM-Ranked Slot Replacement for Out-of-Distribution Generalization
Spurious correlations can give image predictors high in-distribution accuracy but poor generalization under distribution shift. We introduce $\textbf{Rank2Replace}$, which transfers knowledge of task-relevant evidence from pretrained vision--language models (VLMs) to small predictors through training-time augmentation for out-of-distribution (OOD) generalization. The VLM ranks object-centric slots by task relevance and guides rank-dependent replacement with same-rank slot embeddings from another image. This augmentation retains the original image's label, encouraging reliance on preserved task evidence as incidental cues change, and supports combination with existing OOD methods. Across four datasets and six splits under shared frozen slot embeddings, the default cross-entropy configuration reaches macro-averaged average-group and worst-group accuracies of $80.43\%$ and $65.28\%$ without environment labels or dataset-specific replacement tuning. Slot corruption improves both macro-averaged metrics for all fourteen OOD training methods. Combining it with slot ranking and IRM reaches $81.96\%$ and $72.68\%$. Controlled ablations support the ranking and replacement design, with gains across five ranking VLMs and six extractor--predictor combinations. Permutation-invariant predictors further improve both macro-averaged metrics over their unaugmented counterparts while using VLM guidance only during training for efficient inference.
Updated: 2026-11-19 09:50:19
标题: Rank2Replace:基于视觉语言模型排序的槽位替换方法用于分布外泛化
摘要: 虚假相关性可能使图像预测器在分布内取得较高准确率,却在分布偏移下表现出较差的泛化能力。我们提出了 Rank2Replace,通过训练时增强,将预训练视觉—语言模型(VLM)所掌握的与任务相关的证据迁移到小型预测器中,以提升分布外(OOD)泛化能力。VLM 根据任务相关性对以对象为中心的槽位进行排序,并引导模型使用另一幅图像中排名相同的槽位嵌入进行依排名替换。这种增强方式保留原始图像的标签,在偶然线索发生变化时鼓励模型依赖保留下来的任务证据,同时支持与现有 OOD 方法结合。在四个数据集和六种划分上,基于共享冻结槽位嵌入的默认交叉熵配置,在不使用环境标签或针对数据集调节替换策略的情况下,宏平均组平均准确率和最差组准确率分别达到 80.43% 和 65.28%。槽位扰动使全部十四种 OOD 训练方法的宏平均指标均得到提升。将其与槽位排序和 IRM 结合后,这两项指标分别达到 81.96% 和 72.68%。受控消融实验验证了排序与替换设计的有效性;在五种排序 VLM 和六种提取器—预测器组合上均取得了提升。置换不变预测器相较于未进行增强的对应模型进一步改善了两项宏平均指标,同时仅在训练期间使用 VLM 指导,从而实现高效推理。
更新时间: 2026-11-19 09:50:19
领域: cs.CV,cs.LG
Hierarchical Control of Antiphase Synchronization in Biomorphic Spiking Neural Architectures for Locomotor Control
Central pattern generators (CPGs) provide a biologically inspired foundation for adaptive locomotor control, yet systematically characterizing their dynamic regimes in spiking neural networks remains challenging. This study introduces a framework for identifying and stabilizing antiphase synchronization in a biomorphic spiking CPG model embedded in a closed neuromuscular loop. A composite synchronization metric is developed, integrating phase coherence, amplitude balance, and temporal stability. Its performance is evaluated across systematically varied stimulation waveforms and synaptic configurations. Statistical analysis reveals that stimulation type dominates regime determination, with tonic drive yielding the most robust antiphase synchronization. Periodic inputs induce nonlinear saturation and context-dependent network routing. Although synaptic weights alone show limited discriminative power, they significantly modulate robustness within a given stimulation context, with reciprocal Ia interneuron connections emerging as key stabilizers. The proposed composite metric achieves robust antiphase detection, outperforming traditional phase-only measures while preserving biophysical interpretability. These findings establish a statistically validated, hierarchical modeling approach in which external drive defines the operating regime and targeted synaptic configurations fine-tune dynamic stability, providing actionable guidelines for closed-loop neuromechanical controllers and adaptive neuroprosthetic interfaces.
Updated: 2026-11-19 09:48:58
标题: 用于运动控制的仿生脉冲神经架构中反相同步的分层控制
摘要: 中央模式发生器(CPG)为自适应运动控制提供了具有生物学启发的基础,但在脉冲神经网络中系统刻画其动态状态仍然具有挑战性。本研究提出了一种框架,用于识别并稳定嵌入闭环神经肌肉回路中的仿生脉冲式CPG模型的反相同步。研究构建了一种复合同步性指标,综合考虑相位相干性、振幅平衡性和时间稳定性,并在系统改变的刺激波形和突触配置下对其性能进行了评估。统计分析表明,刺激类型在状态判定中起主导作用,其中,紧张性驱动能够产生最稳健的反相同步。周期性输入会诱发非线性饱和以及依赖于情境的网络路由。尽管单独的突触权重表现出有限的判别能力,但其能够显著调节特定刺激情境下的稳健性,其中,互惠性Ia中间神经元连接成为关键的稳定因素。所提出的复合指标能够稳健地检测反相同步,其性能优于传统的仅基于相位的测量方法,同时保留了生物物理学上的可解释性。这些发现确立了一种经过统计验证的分层建模方法:外部驱动决定运行状态,而有针对性的突触配置则对动态稳定性进行精细调节,从而为闭环神经机械控制器和自适应神经假体接口提供了可操作的设计指南。
更新时间: 2026-11-19 09:48:58
领域: q-bio.NC,cs.AI
RAVEN: A Self-RAG Based Agent for Threat Classification and Response
Security event analysis in large enterprises can be overwhelming, as each alert typically requires manual in- spection by human operators. This process is time-consuming and prone to inconsistencies, especially in high-volume Secu- rity Operations Center (SOC) environments. In this work- in-progress paper, we present RAVEN: Retrieval-Augmented Vulnerability & Event aNalysis, an agentic framework designed to support SOC analysts by automating the initial stages of alert investigation. The proposed system leverages a Self- Reflective Retrieval-Augmented Generation-based approach to provide an initial classification of security events and enables interactive refinement through analyst-in-the-loop queries. Un- like traditional approaches that rely on generic mitigation strategies, RAVEN generates context-aware remediation sug- gestions by incorporating knowledge of the target enterprise infrastructure. We implement an early-stage prototype and report preliminary results on three balanced test sets of 400 curated web payloads each (SQLi, XSS, SSTI) and a qualitative case study of mitigation generation; an evaluation on IDS- generated alerts and a user study are ongoing and outlined as remaining work.
Updated: 2026-11-19 09:47:11
标题: RAVEN:一种基于自检索增强生成的威胁分类与响应智能体
摘要: 大型企业中的安全事件分析可能令人不堪重负,因为每条警报通常都需要人工操作员进行检查。这一过程耗时长且容易出现不一致,尤其是在高告警量的安全运营中心(SOC)环境中。在这篇尚处于研究阶段的论文中,我们提出了 RAVEN:检索增强型漏洞与事件分析(Retrieval-Augmented Vulnerability & Event Analysis),这是一种旨在通过自动化告警调查初始阶段来支持 SOC 分析师的智能体框架。该系统采用基于自反思检索增强生成的方法,对安全事件进行初步分类,并支持通过分析师参与式查询进行交互式细化。不同于依赖通用缓解策略的传统方法,RAVEN 结合目标企业基础设施的相关知识,生成具备上下文感知能力的修复建议。我们实现了一个早期原型,并在三个规模均衡的测试集上报告了初步结果;这三个测试集分别包含 400 条经过整理的 Web 载荷,涵盖 SQL 注入(SQLi)、跨站脚本攻击(XSS)和服务器端模板注入(SSTI)。此外,我们还开展了一项关于缓解措施生成的定性案例研究;针对入侵检测系统(IDS)生成告警的评估以及用户研究仍在进行中,并作为后续工作加以说明。
更新时间: 2026-11-19 09:47:11
领域: cs.CR
GPUThor: Amplifying Rowhammer Attacks via Non-Uniform Patterns to Exploit ECC-Protected GPUs
GDDR memory in GPUs is vulnerable to Rowhammer attacks, where rapid memory accesses induce bit flips in adjacent cells, enabling data tampering and privilege escalation. However, prior GPU Rowhammer attacks trigger only tens to hundreds of bit flips, orders of magnitude fewer than CPU attacks, severely limiting their practical impact. This gap stems from the reliance of existing GPU Rowhammer attacks on uniform hammering patterns that activate aggressor and decoy rows equally, which results in low hammering intensity for aggressor rows. We present GPUThor, a high-intensity Rowhammer attack on NVIDIA GPUs leveraging non-uniform hammering. GPUThor reverse engineers GPU memory-access coalescing behavior to enable non-uniform hammering patterns on GPUs, that activate aggressor rows more intensely than decoy rows. Additionally, by identifying refresh instances when in-DRAM mitigations are applied, it constructs longer attack patterns that escape mitigation across refresh intervals, further increasing hammering intensity. Together, these techniques yield 500X to 23,500X more bit flips than prior GPU Rowhammer attacks, across several NVIDIA GPUs (A4000, A4500, A5000, A6000), reaching bit flip rates close to state-of-the-art CPU Rowhammer attacks. GPUThor also enables the first Rowhammer exploits on ECC-protected GPUs, inducing uncorrectable double and triple bit flips, making denial-of-service and privilege-escalation attacks practical even on GPUs with ECC enabled.
Updated: 2026-11-19 09:46:37
标题: GPUThor:通过非均匀模式增强Rowhammer攻击以利用受ECC保护的GPU
摘要: GPU 中的 GDDR 内存容易受到 Rowhammer 攻击:快速访问会诱导相邻内存单元发生比特翻转,从而实现数据篡改和权限提升。然而,先前的 GPU Rowhammer 攻击只能触发几十到几百次比特翻转,比 CPU 攻击少了几个数量级,严重限制了其实际影响。这一差距源于现有 GPU Rowhammer 攻击依赖均匀的锤击模式,即以相同频率激活攻击行和诱饵行,导致攻击行的锤击强度较低。 我们提出了 GPUThor,这是一种利用非均匀锤击的高强度 NVIDIA GPU Rowhammer 攻击。GPUThor 对 GPU 内存访问的合并行为进行了逆向分析,从而能够在 GPU 上实现非均匀锤击模式,以更高强度激活攻击行,而非诱饵行。此外,通过识别 DRAM 内部缓解机制所应用的刷新时机,GPUThor 构造了能够跨越刷新间隔、避开缓解机制的更长攻击模式,进一步提高了锤击强度。综合运用这些技术后,GPUThor 在多种 NVIDIA GPU(A4000、A4500、A5000 和 A6000)上触发的比特翻转数量达到现有 GPU Rowhammer 攻击的 500 倍至 23,500 倍,其比特翻转率已接近当前最先进的 CPU Rowhammer 攻击。GPUThor 还首次在采用 ECC 保护的 GPU 上实现了 Rowhammer 漏洞利用,通过诱导不可纠正的双比特和三比特翻转,使得即使在启用 ECC 的 GPU 上,拒绝服务攻击和权限提升攻击也具有实际可行性。
更新时间: 2026-11-19 09:46:37
领域: cs.CR
Beyond Alignment: Whitening Geometry, Profile Synthesis, and Heterogeneous Ensembles for Cross-Environment WiFi Action Recognition
Cross-environment deployment is the central obstacle to practical WiFi sensing: a pipeline reaching 0.89+ top-1 in its training environments collapses to 0.408 under Leave-One-Domain-Out (LODO) evaluation with only K-shot labels. A ceiling analysis shows the collapse is not an alignment problem: the action signal is strong across seen environments (about 0.89 K10), environment identity is decodable from the encoder (0.965), and the failure concentrates in the encoder's extrapolation to the novel environment. A pre-registered falsification chain confirms that "align the domains" methods--training-time alignment, readout-level prototype alignment, adversarial confusion, and covariance/subspace alignment (CORAL -3.8pp, subspace -8.3pp)--degrade performance, and that source-domain statistics anti-correlate with cross-environment contribution. The effective levers lie elsewhere; we combine them into Dec-H: (i) closed-form source within-class whitening, provably re-geometrizing the readout's L2 regularization (+8.6pp, zero cost); (ii) profile-mixing augmentation (+1.0pp); (iii) few-shot adaptation with alternating whitening refit (+1.5pp; fixed preconditioners are 20/20 negative); (iv) heterogeneous decision ensembles (+1.7pp); homogeneous scaling and source-weighted stacking are saturated or harmful. Dec-H reaches 0.560 K10 (0.812 K40), +15.2pp over the baseline, consistent across all four environments and seeds; all thirteen configurations were pre-registered with frozen criteria.
Updated: 2026-11-19 09:46:22
标题: 超越对齐:面向跨环境 WiFi 动作识别的白化几何、特征画像合成与异构集成
摘要: 跨环境部署是 WiFi 感知走向实际应用的核心障碍:一个在训练环境中 top-1 准确率达到 0.89 以上的流程,在仅使用 K-shot 标签的留一域外(Leave-One-Domain-Out,LODO)评估下,性能骤降至 0.408。上限分析表明,这种崩溃并非对齐问题:在已见环境中,动作信号很强(约为 0.89 K10);环境身份可以从编码器中被解码出来(0.965);性能失败主要集中在编码器向新环境外推的环节。预注册的证伪链证实,“对齐域”的方法——训练时对齐、读出层原型对齐、对抗式混淆,以及协方差/子空间对齐(CORAL 下降 3.8 个百分点,子空间下降 8.3 个百分点)——都会降低性能;同时,源域统计量与跨环境贡献呈负相关。有效的改进手段存在于其他方面;我们将其整合为 Dec-H:(i)闭式源域类内白化,在理论上重新塑造读出层的 L2 正则化几何结构(提升 8.6 个百分点,零成本);(ii)特征分布混合增强(提升 1.0 个百分点);(iii)采用交替白化重拟合的少样本适应(提升 1.5 个百分点;固定预条件器在 20/20 次实验中均为负收益);(iv)异质决策集成(提升 1.7 个百分点);同质缩放和源域加权堆叠已达到饱和或会造成损害。Dec-H 在 K10 下达到 0.560,在 K40 下达到 0.812,相比基线提升 15.2 个百分点;其效果在全部四个环境和各个随机种子下均保持一致。全部十三种配置均已预注册,并采用固定的评判标准。
更新时间: 2026-11-19 09:46:22
领域: cs.LG,eess.SP
Controllable Chains of Thought Can Reveal Less, Even Without Evasion Training
Chain-of-thought (CoT) monitoring is a promising tool for detecting hidden goals, off-task behavior, and other failures in AI agents. One risk is that models could deliberately shape their reasoning to make it opaque to monitors. We stress-test this risk through persona-control training: supervised fine-tuning on mathematical reasoning traces rewritten in the voices of diverse personas. This induces a broader ability to control CoT, even though training contains no monitor-evasion examples. In covert side-task evaluations, traces in which a gpt-oss-20b model organism completes the hidden side task contain less monitorable evidence than the base model's. Averaged across evaluations and CoT lengths, weighted by side-task-success counts, the CoT monitorability metric g-mean$^2$ falls from 0.94 for the base model to 0.68 for the model organism without a hiding instruction, and to 0.22 when explicitly instructed to hide. In intervention evaluations, explicit hiding often drives monitorability near zero. The effect extends to a Kimi-K2.6 model organism in agentic environments, though hidden objectives requiring extended reasoning or longer trajectories remain more monitorable than simple single-step side tasks. We further discover that targeted transparency prompts can substantially recover monitorability, sometimes surpassing the base model. These model organisms provide a testbed for studying monitorability failures and potential mitigations. Our code can be found on https://github.com/yongzx/cot-control-model-organism.
Updated: 2026-11-19 09:43:28
标题: 可控的思维链能够揭示更少信息,即使未经规避训练也能如此
摘要: 思维链(CoT)监控是检测人工智能代理隐藏目标、偏离任务行为及其他失效情况的一种有前景的工具。一个风险在于,模型可能会刻意塑造其推理过程,使其对监控器而言难以理解。我们通过人格控制训练对这一风险进行了压力测试:在数学推理轨迹上进行监督微调,这些轨迹被改写成不同人格的表达方式。尽管训练数据中不包含任何规避监控的示例,这种训练仍会诱导模型获得更广泛的思维链控制能力。在隐蔽副任务评估中,当 gpt-oss-20b 模型生物完成隐藏副任务时,其推理轨迹包含的可监控证据少于基础模型的推理轨迹。综合各项评估和不同思维链长度,并按照副任务成功次数加权后,思维链可监控性指标 g-mean² 从基础模型的 0.94 降至未接受隐藏指令的模型生物的 0.68;而在明确要求隐藏时,则降至 0.22。在干预评估中,明确的隐藏指令通常会使可监控性接近于零。这一效应也扩展至代理环境中的 Kimi-K2.6 模型生物,不过,需要较长推理过程或更长轨迹的隐藏目标,相较于简单的单步副任务,仍然更容易被监控。我们进一步发现,针对性的透明度提示能够大幅恢复可监控性,有时甚至超过基础模型。这些模型生物为研究可监控性失效及潜在缓解措施提供了测试平台。我们的代码可在 https://github.com/yongzx/cot-control-model-organism 获取。
更新时间: 2026-11-19 09:43:28
领域: cs.AI,cs.LG
A Sparse Low-Rank Biclique Decomposition for Graphs
Low-rank plus sparse decompositions, such as robust PCA, typically model the low-rank component as dense and the sparse component as corruption. This viewpoint is poorly suited to graph adjacency matrices, where sparsity is structural and dense low-rank factors destroy the combinatorial and computational properties of the graph. We propose signed biclique decomposition (SBD), a sparse low-rank decomposition for integer-weighted graphs that represents the structured component as a sum of sparse signed binary rank-one factors, together with a sparse signed residual. The resulting representation remains discrete, interpretable, sparse, and compatible with standard linear algebra. We formulate fixed-rank and greedy SBD objectives and derive a gain-based greedy algorithm with theoretical guarantees. Empirically, SBD recovers block structure in noisy graphs, while its factorized representation enables efficient sparse matrix-matrix multiplication (SpMM). On real graphs with strong shared-neighborhood structure, SBD achieves compression factors above $10$ and SpMM speedups up to $6\times$ over cuSPARSE, suggesting a practical alternative to dense low-rank decompositions for graphs. Code is available at https://github.com/IAntoineV/sbd.
Updated: 2026-11-19 09:42:18
标题: 图的稀疏低秩完全二部图分解
摘要: 低秩加稀疏分解(如鲁棒主成分分析)通常将低秩成分建模为稠密矩阵,并将稀疏成分视为扰动。这一观点并不适用于图的邻接矩阵,因为在邻接矩阵中,稀疏性具有结构性,而稠密的低秩因子会破坏图的组合性质和计算性质。我们提出有符号二分团分解(signed biclique decomposition,SBD),这是一种面向整数加权图的稀疏低秩分解方法,用稀疏的有符号二进制秩一因子之和表示结构化成分,同时配以稀疏的有符号残差。所得表示保持离散、可解释和稀疏的特点,并且兼容标准线性代数。我们构造了固定秩和贪心式 SBD 目标函数,并推导出一种具有理论保证的基于增益的贪心算法。实验表明,SBD 能够恢复含噪图中的块结构,其因子化表示还支持高效的稀疏矩阵—矩阵乘法(SpMM)。在具有显著共享邻域结构的真实图上,SBD 实现了超过 10 倍的压缩比,相较于 cuSPARSE,SpMM 加速最高可达 6 倍,表明它是稠密低秩图分解的一种实用替代方案。代码见:https://github.com/IAntoineV/sbd。
更新时间: 2026-11-19 09:42:18
领域: cs.LG
Limits of local curvature for constructing search subspaces in segmentation models
We examine how well subspaces constructed from local curvature represent the change in the gradient update field after a finite step in semantic segmentation models. The local response is the action of the curvature operator on the actual input displacement. In a study of 50 images and two models, we measure the ratio of the loss increase attained in a fixed subspace to that attained in the full space. This ratio decreases as the search radius increases. On ten images from the same sample, we compare the one-dimensional subspace spanned by the initial gradient with two rank-16 subspaces for both models. The two equal-rank subspaces are assessed at the same initial states, using the same actual steps and measured vectors. Adding generalised Gauss-Newton directions to the initial gradient reduces the mean relative error in representing the field change from 0.922 to 0.874 for the first model and from 0.819 to 0.763 for the second. At the same rank, including the response direction for the initial gradient nearly eliminates the error in representing the local response. The mean error in representing the field change does not decrease. A decomposition with fixed pixel weights shows that the finite-step remainder is comparable in norm to the field change and makes the largest diagonal contribution to the squared projection error of the field after the step. Evaluation of a search subspace should measure how accurately it represents the field change and the local response.
Updated: 2026-11-19 09:40:21
标题: 分割模型中用于构建搜索子空间的局部曲率界限
摘要: 我们考察了由局部曲率构造的子空间,在多大程度上能够表示语义分割模型经过有限步更新后梯度更新场的变化。局部响应是曲率算子作用于实际输入位移所得的结果。在对 50 张图像和两个模型的研究中,我们测量了固定子空间内达到的损失增量与全空间内达到的损失增量之比。随着搜索半径增大,该比值逐渐降低。在来自同一样本的 10 张图像上,我们针对两个模型,将由初始梯度张成的一维子空间与两个秩为 16 的子空间进行比较。两个秩相同的子空间均在相同的初始状态下进行评估,并使用相同的实际步长和测得的向量。将广义高斯—牛顿方向加入初始梯度后,表示场变化的平均相对误差在第一个模型中由 0.922 降至 0.874,在第二个模型中由 0.819 降至 0.763。在秩相同的情况下,加入初始梯度的响应方向几乎消除了表示局部响应时的误差。但表示场变化的平均误差并未降低。采用固定像素权重的分解表明,有限步余项的范数与场变化的范数相当,并且对步长之后场的平方投影误差作出了最大的对角贡献。对搜索子空间的评估应当测量其表示场变化和局部响应的准确程度。
更新时间: 2026-11-19 09:40:21
领域: cs.CV,cs.LG
Signed but Unbound: The Authority Gap Between Agent Commerce Mandates and Crypto Wallet Signatures
When an artificial intelligence agent pays with a stablecoin, the commerce protocol can specify the merchant, order, amount, and facilitator. The token contract enforces the fields the wallet signs. We call the difference the authority gap, define nine constraint classes, and derive them for 12 authorization configurations, including Coinbase's deployed Commerce Payments Protocol. All 31,800 trials on local copies of deployed contract code match the derivation. A controlled comparison shows that committing the terms in the signed nonce binds the order. When the facilitator submits a payment to a merchant account without code, binding the facilitator requires a separate recipient contract. Of 26,653 sampled USD Coin authorizations redeemed on Base, 98.7% followed a path that any holder of the signature could redeem. We prove sufficient conditions for a recipient contract to enforce the signed mandate under a trusted signer and show which recipient a wallet displays. MandateLock, a minimal implementation for immediate payments, rejects all 10,800 modified mandates on deployed token code and accepts signatures from two independent signers. It uses 25% more gas than a transfer that only the recipient can submit.
Updated: 2026-11-19 09:39:53
标题: 已签署但未受约束:代理商务授权与加密货币钱包签名之间的权威鸿沟
摘要: 当人工智能代理使用稳定币支付时,商务协议可以指定商户、订单、金额和支付促成方。代币合约会强制执行钱包签署的字段。我们将两者之间的差异称为“授权差距”,定义了九类约束,并针对12种授权配置推导出这些约束,其中包括Coinbase已部署的Commerce Payments Protocol。在已部署合约代码的本地副本上进行的全部31,800次试验均与推导结果一致。受控比较表明,将条款写入签名的随机数中可以约束订单。当支付促成方代表商户账户(该账户不含代码)提交付款时,若要约束支付促成方,就需要一个独立的接收方合约。在Base上抽样的26,653笔已兑换美元币授权中,有98.7%遵循了任何持有该签名者都可以完成兑换的路径。我们证明了在签名者可信的前提下,接收方合约强制执行已签署授权指令的充分条件,并展示钱包会显示哪个接收方。MandateLock是一种用于即时支付的最小化实现,它在已部署的代币代码上拒绝了全部10,800个被修改的授权指令,并接受来自两个独立签名者的签名。与仅允许接收方提交的转账相比,它消耗的燃料多25%。
更新时间: 2026-11-19 09:39:53
领域: cs.CR
Anchor and Check: Deterministic Cross-Prompt, Cross-Model Reconciliation for Auditable LLM Decisions
Pipelines that let a large language model (LLM) make discrete decisions need to know which decisions they may act on unattended, and a record that explains each one. We study a small, fully specified reconciliation contract: commit the target model's greedy answer (the anchor), draw one or two greedy checks that reach the answer by a different route (an alternate prompt, or a model from another family), and let a pure function return one of five outcomes, of which only Agree is acted on. On 48,000 model-item evaluations over 6,000 questions, with every method given access to verbalized confidence as a tie-breaker, the main finding concerns where calls come from: pooling another family's samples raises semantic entropy's AUROC by 1.7 to 4.0 points at every budget, and a same-model temperature check is the weakest design. As complete pipelines, the point estimates of the three-call contract and pooled semantic entropy over 3 or 5 samples differ by less than one point, with intervals containing zero. As detectors of the anchor's errors, the contract is ahead of pooled entropy with 3 and 5 samples under both tie-breaker conventions; with 10 samples the point estimates differ by less than one point and the sign depends on the convention. Under the strict Agree gate it automates 70% of items and still acts on 16% of errors. What the contract adds is a fixed committed answer, an explicit outcome and a decision replayable from its record; generation itself was not reproducible on the hosted API.
Updated: 2026-11-19 09:38:16
标题: 锚定与核验:面向可审计大语言模型决策的跨提示、跨模型确定性协调
摘要: 让大型语言模型(LLM)作出离散决策的流程,需要明确哪些决策可以在无人值守的情况下执行,以及一份能够解释每项决策的记录。我们研究了一种小型、完全明确的协调契约:确定目标模型的贪心答案(即锚点),抽取一到两个通过不同路径得到该答案的贪心检查结果(路径可以是另一种提示,或来自另一个模型家族),然后让一个纯函数返回五种结果之一,其中只有“同意”会触发执行。在涵盖6000个问题的48000次模型—题目评估中,每种方法都可以使用语言化置信度作为平局决胜依据。主要发现与调用结果的来源有关:在各个预算下,汇集另一个模型家族的样本都能使语义熵的AUROC提高1.7至4.0个百分点,而同一模型的温度检查是最弱的设计。作为完整流程,三次调用契约与基于汇集语义熵、使用3个或5个样本的流程,其点估计差异均小于一个百分点,且置信区间包含零。作为检测锚点错误的工具,在两种平局决胜约定下,使用3个和5个样本时,该契约均优于汇集语义熵;使用10个样本时,点估计差异小于一个百分点,且优劣方向取决于所采用的约定。在严格的“同意”门控下,它可以自动处理70%的题目,同时仍会对16%的错误采取行动。该契约所增加的是一个固定且已提交的答案、一个明确的结果,以及一个可根据记录重放的决策;但在托管式API上,生成过程本身并不可复现。
更新时间: 2026-11-19 09:38:16
领域: cs.AI,cs.CL,cs.LG
Inject Where It Matters: Objective-Dependent Feature Control in Rectified-Flow Image Editing
Many prompt-driven FLUX editing methods rely on injecting source features into target-conditioned generation, creating an inherent trade-off between source preservation and the desired edit. We address this problem by controlling where source features are injected and which transformer blocks are used. First, we introduce adaptive masks that spatially gate feature injection using differences between source- and target-conditioned block outputs at matched inversion states. Second, we use REINFORCE to select Top-K injection blocks under different preservation-editability objectives. The selected blocks are fixed at inference and require no online search. On PIE-Bench with FLUX.1-dev, spatial masking controls the alignment-preservation trade-off. On 60 validation examples, a learned nine-block set gives lower whole-image LPIPS than the 18-block RF-Edit set within the same masked pipeline, with slightly lower alignment. Among 50 random nine-block sets, it has the lowest LPIPS but not the highest reward. Separate objective sweeps reveal different block preferences for preservation and alignment.
Updated: 2026-11-19 09:32:40
标题: 注入于关键之处:整流流图像编辑中的目标依赖型特征控制
摘要: 许多由提示词驱动的 FLUX 编辑方法依赖于将源特征注入目标条件生成过程,从而在源内容保留与期望编辑之间产生固有的权衡。我们通过控制源特征的注入位置以及所使用的 Transformer 模块来解决这一问题。首先,我们引入自适应掩码,利用匹配反演状态下源条件模块输出与目标条件模块输出之间的差异,对特征注入进行空间门控。其次,我们使用 REINFORCE,在不同的保留—可编辑性目标下选择 Top-K 个注入模块。选定的模块在推理阶段固定,无需在线搜索。在使用 FLUX.1-dev 的 PIE-Bench 上,空间掩码能够控制对齐度与保留效果之间的权衡。在 60 个验证样例上,在相同的掩码流程中,一个学习得到的九模块集合相比由 18 个模块组成的 RF-Edit 集合具有更低的全图 LPIPS,但对齐度略低。在 50 个随机九模块集合中,该集合的 LPIPS 最低,但奖励并非最高。针对不同目标的独立搜索表明,保留效果与对齐度偏好的模块各不相同。
更新时间: 2026-11-19 09:32:40
领域: cs.AI
ALIoTh: Orchestrating Multi-Agent LLMs for Autonomous IoT Penetration Testing
Penetration testing in Internet of Things (IoT) environments, especially those composed of various different devices, e.g., smart plugs, smart cameras, and smart doors, presents great challenges across the phases of information gathering, attack surface enumeration, privilege escalation, and lateral movement. This paper introduces ALIoTh, a multi-agent, workflow-driven penetration testing framework that integrates Large Language Models agents within a Self-Retrieval-Augmented Generation (Self-RAG) architecture to autonomously identify and exploit vulnerabilities in IoT and Industrial-IoT (IIoT) environments. By leveraging state-of-the-art language models and orchestrating specialized agents via the LangGraph framework, ALIoTh dynamically plans and executes a full-spectrum offensive pipeline. This includes network, devices, and service enumeration, vulnerability assessment, payload generation, reverse shell deployment, and privilege escalation on each device. The Self-RAG mechanism equips expert agents with contextual access to IoT security knowledge, e.g., related documentation, tool manuals, and known attack techniques, enhancing their reasoning capabilities in scenarios involving multiple device exploitation and group policy manipulation.
Updated: 2026-11-19 09:31:08
标题: ALIoTh:为自主物联网渗透测试编排多智能体大语言模型
摘要: 物联网(IoT)环境中的渗透测试,尤其是在由多种不同设备组成的环境中,例如智能插座、智能摄像头和智能门,给信息收集、攻击面枚举、权限提升和横向移动等阶段带来了巨大挑战。本文提出了 ALIoTh,一种由多智能体驱动、基于工作流的渗透测试框架。该框架将大语言模型智能体集成到自检索增强生成(Self-RAG)架构中,以自主识别并利用物联网和工业物联网(IIoT)环境中的漏洞。通过利用最先进的语言模型,并借助 LangGraph 框架编排专业化智能体,ALIoTh 能够动态规划并执行全方位的攻击流程,包括网络、设备和服务枚举、漏洞评估、载荷生成、反向 Shell 部署,以及针对每台设备的权限提升。Self-RAG 机制使专家智能体能够获取物联网安全知识的上下文信息,例如相关文档、工具手册和已知攻击技术,从而增强其在涉及多设备利用和组策略操纵场景中的推理能力。
更新时间: 2026-11-19 09:31:08
领域: cs.CR
Noise Steering: Exploiting Wake Steering and Acoustic Directivity for Noise-Constrained Wind Farm Control via Reinforcement Learning
Existing noise mitigation strategies for wind farms usually consist in reducing turbines power output, without accounting for the wake interactions between them and the noise emission directivity. This leads to over-conservative policies and unexploited wind power. Yet, turbine yaw can simultaneously affect wake interactions and the direction of noise emission, offering an additional degree of freedom for farm-level noise control. We therefore propose Noise Steering, a model-free reinforcement learning (RL) strategy that jointly controls turbine yaw angles and power setpoints to maximise farm power while satisfying a local noise constraint in a defined region. To enable training at a reduced computational cost, a low-fidelity acoustic model is coupled with the steady-state FLORIS simulator. The RL agent effectively learns how to redirect wakes and noise directivity away from the protected region while redistributing power across the farm. On a six-turbine test farm, the policy satisfies the 40 dB noise constraint throughout the full range of turbulent winds, with an average power deficit of only 2% relative to greedy unimpeded control, and up to 7.7% at high wind speeds. In comparison, the industry-standard noise-reduced operation (NRO) baseline here generates an average power loss of 17%. When deployed in the higher-fidelity FASTFarm simulator, the policy largely retains its performance under steady and turbulent inflow, despite differences in simulation fidelity. These results demonstrate the potential of combining yaw control and power derating through RL to improve the power-noise trade-off in wind farm operation.
Updated: 2026-11-19 09:25:17
标题: 噪声引导:利用尾流引导与声学指向性,通过强化学习实现噪声约束下的风电场控制
摘要: 现有的风电场噪声缓解策略通常仅通过降低风机功率输出实现,而未考虑风机之间的尾流相互作用以及噪声辐射的方向性。这会导致过于保守的运行策略,并造成风能利用不足。然而,风机偏航既能影响尾流相互作用,也能改变噪声辐射方向,从而为风电场层面的噪声控制提供额外的自由度。因此,我们提出了“噪声引导”(Noise Steering)策略:一种无模型强化学习(RL)方法,通过联合控制风机偏航角和功率设定值,在满足特定区域局部噪声约束的同时,使风电场功率最大化。为降低训练所需的计算成本,我们将低保真度声学模型与稳态 FLORIS 模拟器相结合。强化学习智能体能够有效学习如何将尾流和噪声辐射方向引导至受保护区域之外,同时在风电场内重新分配功率。在一个包含六台风机的测试风电场中,该策略在全范围湍流风况下均满足 40 dB 的噪声约束;相较于不受约束的贪婪控制,其平均功率损失仅为 2%,在高风速下最高为 7.7%。相比之下,本文采用的行业标准降噪运行(NRO)基线会造成 17% 的平均功率损失。当部署于更高保真度的 FASTFarm 模拟器中时,尽管模拟保真度存在差异,该策略在稳态和湍流入流条件下仍基本保持其性能。这些结果表明,通过强化学习结合偏航控制与功率降额控制,有望改善风电场运行中的功率—噪声权衡。
更新时间: 2026-11-19 09:25:17
领域: cs.AI,eess.SY,physics.ao-ph,physics.flu-dyn
From field-scale to large-scale spectral libraries: Tabular foundation models in soil spectroscopy
Visible and near-infrared (vis-NIR) and mid-infrared (MIR) spectroscopy enable rapid, cost-effective prediction of soil properties. Yet, translating high-dimensional, highly collinear spectra into accurate soil property predictions remains challenging, particularly when employing machine learning. We systematically investigated regression models and dimensionality reduction approaches for spectroscopic modeling across 85 soil property prediction tasks from open benchmark datasets in pedometrics, spanning field-scale digital soil mapping and a global soil spectral library. We compared an in-context learning tabular foundation model (TabPFN), a convolutional neural network (CNN), rule-based regression (Cubist), Random Forest, and partial least squares regression (PLSR) using full spectra as well as features derived from principal component analysis (PCA) and partial least squares (PLS) latent variables. TabPFN consistently delivered the best overall performance across spectral regions, properties, and scales, including large spectral library tasks with tens of thousands of soil samples. Notably, TabPFN applied directly to full spectra already surpassed all classical baselines, showing that explicit dimensionality reduction is not strictly required for strong performance. Further improvements were achieved through PLS, which proved to be an effective dimensionality reduction strategy for all models. Combining PLS latent variables with TabPFN yielded the best predictions overall, lowering the root mean squared error (RMSE) relative to the strongest classical baseline on 44 of the 46 large-scale spectral library tasks, by a median of 14%. Our findings provide evidence-based guidance for spectroscopic calibration model selection across operational scales, demonstrating that the long-standing advantages of PLSR and modern tabular foundation models complement each other in chemometrics.
Updated: 2026-11-19 09:23:59
标题: 从田间尺度到大规模光谱库:土壤光谱学中的表格基础模型
摘要: 可见光与近红外(vis-NIR)和中红外(MIR)光谱技术能够快速、经济地预测土壤性质。然而,将高维、高度共线的光谱转换为准确的土壤性质预测结果仍然具有挑战性,尤其是在采用机器学习方法时。我们针对土壤计量学中开放基准数据集的85项土壤性质预测任务,系统研究了光谱建模中的回归模型与降维方法,涵盖田间尺度数字土壤制图和全球土壤光谱库。我们比较了基于上下文学习的表格基础模型(TabPFN)、卷积神经网络(CNN)、基于规则的回归方法(Cubist)、随机森林和偏最小二乘回归(PLSR),并分别使用完整光谱以及由主成分分析(PCA)和偏最小二乘(PLS)潜变量提取的特征进行建模。TabPFN在不同光谱区域、土壤性质和空间尺度上始终表现出最佳的总体性能,包括包含数万个土壤样本的大型光谱库任务。值得注意的是,直接将完整光谱输入TabPFN,其性能已经超过所有经典基线模型,表明要取得出色性能并不一定需要显式降维。采用PLS后,所有模型的性能均得到进一步提升,证明PLS是一种有效的降维策略。将PLS潜变量与TabPFN结合后,整体预测效果最佳:在46项大规模光谱库任务中的44项上,相较于性能最强的经典基线模型,均降低了均方根误差(RMSE),降幅中位数为14%。我们的研究为不同应用尺度下光谱校准模型的选择提供了基于证据的指导,并表明PLSR长期以来的优势与现代表格基础模型能够在化学计量学中形成互补。
更新时间: 2026-11-19 09:23:59
领域: cs.LG
How Reliable Are Explanations of Language Models That Detect Insider Threats?
Organizations monitor their workers' activity for insider threats, in which workers misuse their legitimate access, by copying confidential files before leaving. Detectors score how unusual each day of activity is, flagging the most unusual for an analyst to review. Prominent current approaches use opaque neural networks, so explanations of a flag point to internal features: patterns of neuron activity most active on days of misuse. We audit such explanations for language-model detectors trained on CERT's simulated workplace logs. To test an explanation, we see what happens to the detector's score when we remove its features inside the model. We compare this to a control: a change that is as similar as possible to the removal, but without actually removing the features. Because defining "similar" requires choosing a metric, our central contribution is the tipping radius: a first-order prediction of how far that metric must move before the difference between removal and control disappears, a measure of how fragile the result is to that choice. In 33 of 34 runs of seven language models, the tipping radius is at most 18% of the distance between two standard choices of metric. Moving that far removes at least 58% of the difference or reverses it, while random moves of the same size leave it largely intact. The result replicates in thirteen of fourteen pre-declared primary runs on openly released models, though on our trained detectors the difference is often too small to measure. We also find that a flag's score partly reflects who the worker is, not what they did, and that the features named depend on whom they are compared against. Audits should therefore fix the control's metric in advance, report its tipping radius, and disclose that comparison.
Updated: 2026-11-19 09:23:07
标题: 检测内部威胁的语言模型解释有多可靠?
摘要: 组织会监测员工的活动,以发现内部威胁;在这类威胁中,员工会滥用其合法访问权限,例如在离职前复制机密文件。检测器会评估每天活动的异常程度,并将最异常的活动标记出来,交由分析人员审查。目前主流的方法采用不透明的神经网络,因此对标记结果的解释会指向内部特征:在发生滥用的日子里最为活跃的神经元活动模式。我们针对使用 CERT 模拟工作场所日志训练的语言模型检测器,对这类解释进行审计。为了检验一种解释,我们观察在模型内部移除该解释所指向的特征后,检测器的评分会发生什么变化。我们将其与一个对照进行比较:该对照尽可能类似于移除操作,但实际上并不移除这些特征。由于界定“类似”需要选择一种度量,我们的核心贡献是提出“临界半径”:这是对该度量必须移动多远、移除操作与对照之间的差异才会消失的一阶预测,也是衡量结果对度量选择有多脆弱的指标。在七个语言模型的 34 次运行中,有 33 次的临界半径不超过两个标准度量选择之间距离的 18%。移动这么远至少会消除 58% 的差异,或使差异反转;而幅度相同的随机移动则会使差异基本保持不变。在公开发布的模型上预先声明的 14 次主要运行中,有 13 次复现了这一结果,不过在我们训练的检测器上,该差异往往小到无法测量。我们还发现,某个标记的评分部分反映的是员工是谁,而不是他们做了什么;同时,所指出的特征取决于将该员工与谁进行比较。因此,审计应预先固定对照所使用的度量,报告其临界半径,并公开这一比较。
更新时间: 2026-11-19 09:23:07
领域: cs.LG
SynthDCB: World Distillation for Scalable Device Control Benchmarking
Scaling device-control evaluation requires scaling both interactive worlds and the tasks agents must solve. We introduce SynthDCB, a benchmark for environment awareness and device control built through world distillation (WD). World distillation transforms knowledge of device behaviors, constraints, and environmental effects into modular executable components. A unified capability representation connects tool discovery, world execution, and task synthesis. SynthDCB instantiates Home, Car, and Phone with 114 device classes, 1,166 functions, and 95 events, supporting five task families with 32 subtypes. Explicit states and tool-call traces support task validation and agent evaluation. We evaluate 22 models on 2,560 test tasks; the best achieves 88.8% mean Pass@1. Construction experiments demonstrate token efficiency and expansion of task coverage. At the richest knowledge level, WD fully covers 22/23 properties, 19/29 functionalities, and 30/39 event requirements specified in a real RobotVacuum protocol. Furthermore, the 1,000 sampled tasks semantically cover 81.6% of the 854 reference instructions in the real-world corpus. SynthDCB connects an expanding space of real-to-sim executable capabilities to verifiable agent evaluation.
Updated: 2026-11-19 09:22:58
标题: SynthDCB:面向可扩展设备控制基准测试的世界蒸馏
摘要: 设备控制评测的扩展,需要同时扩展交互式世界以及智能体必须解决的任务。我们提出 SynthDCB,这是一个通过世界蒸馏(WD)构建的环境感知与设备控制基准。世界蒸馏将设备行为、约束条件和环境影响方面的知识转化为模块化的可执行组件。统一的能力表示连接了工具发现、世界执行和任务合成。SynthDCB 实例化了家庭、汽车和手机三类环境,涵盖 114 个设备类别、1,166 个功能和 95 个事件,支持五类任务及其 32 个子类型。显式状态和工具调用轨迹支持任务验证与智能体评测。我们在 2,560 个测试任务上评估了 22 个模型,其中表现最佳的模型取得了 88.8% 的平均 Pass@1。构建实验展示了令牌效率以及任务覆盖范围的扩展能力。在最丰富的知识水平下,WD 完全覆盖了真实 RobotVacuum 协议中规定的 23 项属性中的 22 项、29 项功能中的 19 项,以及 39 项事件要求中的 30 项。此外,1,000 个采样任务在语义上覆盖了真实世界语料库中 854 条参考指令的 81.6%。SynthDCB 将不断扩展的真实到模拟可执行能力空间与可验证的智能体评测连接起来。
更新时间: 2026-11-19 09:22:58
领域: cs.LG,cs.AI,cs.CL
When Safety Rationales Hallucinate: Diagnosing and Grounding Multimodal Safety Guards
Multimodal safety guards increasingly generate rationales alongside safety predictions, yet whether these rationales are reliable remains largely unexplored. We systematically study *rationale hallucination* from two perspectives: visual rationale hallucination, where rationales contain unsupported visual facts, and safety attribution hallucination, where grounded content is assigned an incorrect safety interpretation. Across rationale-generation methods, multiple vision-language backbones, and safety datasets, we find that rationale hallucination is widespread and does not consistently diminish with higher classification accuracy or increased model scale. Further analysis of the Think-with-Image paradigm shows that hallucination is concentrated in fine-grained attributes and relations, while visual tools are often invoked infrequently or without sufficient spatial focus. Based on these findings, we propose *Tool-Contrastive Grounding Reinforcement Learning* (TCG-RL), which rewards tool use only when it improves rationale grounding over a tool-free reference. TCG-RL substantially reduces rationale hallucination while maintaining competitive safety prediction performance. By revealing the gap between prediction correctness and rationale reliability, our study motivates a shift in multimodal safety guarding from outcome-only evaluation toward safety decisions that are both accurate and verifiably grounded.
Updated: 2026-11-19 09:22:27
标题: 当安全理由产生幻觉:多模态安全防护机制的诊断与基础化
摘要: 多模态安全防护模型越来越多地在生成安全预测的同时提供解释性理由,但这些理由是否可靠仍未得到充分研究。我们从两个角度系统研究了“理由幻觉”:一是视觉理由幻觉,即理由中包含缺乏视觉依据的事实;二是安全归因幻觉,即将有依据的内容赋予错误的安全解释。在多种理由生成方法、多个视觉语言骨干模型以及不同安全数据集上进行研究后,我们发现,理由幻觉十分普遍,并且不会随着分类准确率提高或模型规模扩大而持续减少。对“通过图像进行思考”范式的进一步分析表明,幻觉主要集中在细粒度属性和关系上,而视觉工具往往调用频率较低,或未能进行充分的空间聚焦。基于这些发现,我们提出了“工具对比式接地强化学习”(Tool-Contrastive Grounding Reinforcement Learning,TCG-RL),仅当工具使用相较于不使用工具的参考结果能够改善理由的接地程度时,才对其予以奖励。TCG-RL在保持具有竞争力的安全预测性能的同时,显著减少了理由幻觉。通过揭示预测正确性与理由可靠性之间的差距,本研究推动多模态安全防护从仅评估结果,转向同时要求安全决策准确且具有可验证依据。
更新时间: 2026-11-19 09:22:27
领域: cs.AI
On the Reliability of CyberGym Evaluation: Task Material Consistency and Reference-Target Identity
CyberGym evaluates vulnerability reproduction by checking whether a proof-of-concept input (PoC) crashes a vulnerable program version but not a fixed version. Interpreting this differential pass as successful reproduction requires consistent task materials and evidence that the PoC triggers the intended defect. We examine these requirements through a material audit of all 1,507 CyberGym tasks and an identity assessment of the final PoCs from one complete Level-1 GLM-5.3 run. Taking the defect associated with each reference crash report as the target, the audit assigns inconsistency labels to 338 tasks (22.4%) after correcting two labels identified by stratified blind review. The largest categories are coverage inconsistency (205 tasks) and descriptions and patches that jointly point to another defect (110 tasks). We assess PoC identity using an execution check, crash-signature matching, and LLM-assisted root-cause review. Of the 1,286 differential passes, the procedure assigns 89 non-target and 10 insufficient-evidence verdicts; requiring a target hit lowers the pass rate from 85.3% to 78.8%. Non-target verdicts also occur in tasks with no material inconsistency found: 39 of 1,052 differential passes (3.7%). Although the identity verdicts require independent validation, these findings motivate separate checks of task-material consistency and submission identity when interpreting vulnerability-reproduction scores.
Updated: 2026-11-19 09:20:55
标题: 论网络健身房评估的可靠性:任务材料一致性与参考目标同一性
摘要: CyberGym 通过检查概念验证输入(PoC)是否能使易受攻击的程序版本崩溃、但不会使修复后的版本崩溃,来评估漏洞复现能力。将这种差异性通过判定为成功复现,需要任务材料保持一致,并有证据表明 PoC 触发了预期缺陷。我们通过对全部 1,507 个 CyberGym 任务进行材料审计,以及对一次完整的 Level-1 GLM-5.3 运行所得最终 PoC 进行身份评估,考察了这些要求。在将每份参考崩溃报告所关联的缺陷作为目标的前提下,审计在对分层盲审发现的两个标签进行修正后,为 338 个任务(22.4%)标记了一致性问题。最大的类别是覆盖范围不一致(205 个任务),以及描述和补丁共同指向另一缺陷(110 个任务)。我们通过执行检查、崩溃特征匹配和借助大语言模型的根因审查来评估 PoC 身份。在 1,286 个差异性通过中,该流程判定 89 个为非目标、10 个为证据不足;要求命中目标后,通过率从 85.3% 降至 78.8%。在未发现材料不一致的任务中也会出现非目标判定:1,052 个差异性通过中有 39 个(3.7%)属于此类。尽管身份判定仍需独立验证,这些发现表明,在解读漏洞复现得分时,应分别检查任务材料的一致性和提交内容的身份。
更新时间: 2026-11-19 09:20:55
领域: cs.CR,cs.SE
Collision-Free Is Not Enough: Passage-Conditioned Navigation for Wheeled-Legged Robots
A collision-free detour can still bring a legged robot to the next stair or ledge a few centimetres or degrees off, and a fixed locomotion skill, factory or learned, can stall or fall. Existing methods prevent this with a robot model or extensive trial and error, but on a new site with unknown skills neither is available, so they cannot be used. We find that a single 27-minute teaching session already supplies what these methods have to derive or learn: for every stair and ledge, one crossing the skill has completed. Our method, passage-conditioned navigation, makes the route remember how each transition was entered, not only where the path went. It stores each taught crossing as an event and, without training or a robot model, enforces it after every local replan: before each ledge, an entry gate makes the robot turn or back up and retry if it is more than 10 cm or 10° off the taught crossing. Under localization noise, with path, gait schedule, and sensing unchanged, this raises the share of disturbed ledge crossings that stay within these limits from 24.1% to 88.6%. In contact simulation with our learned policies, a robot pushed off course before stairs never falls in 180 climbs, against 9 falls when the stored direction is ignored; pushed 1.2 m away, it rejoins the route, ending on average 0.14 m from it (1.10 m without rejoining), and finishes as often as an undisturbed robot. This suits any robot with fixed skills that repeats a route over terrain transitions, as in inspection and patrol, where one wrong entry can end the task. We deployed it in competition on a real wheeled-legged robot: over 271 m of multi-obstacle terrain spanning 7.0 m of elevation, it completed all six runs, won third place at the 2026 Global Open-source AI Challenge, which drew 2,999 submissions, and was the only finalist in its task to finish fully autonomously.
Updated: 2026-11-19 09:17:01
标题: 无碰撞还不够:面向轮腿式机器人的通道条件导航
摘要: 无碰撞的绕行仍可能让足式机器人偏离下一个台阶或凸台几厘米或几度,而固定的运动技能(无论是工厂预设的还是学习得到的)可能因此停滞或跌倒。现有方法通过机器人模型或大量试错来避免这一问题,但在技能未知的新场地中,这两者都无法获得,因而无法使用。我们发现,一次仅 27 分钟的教学过程就能提供这些方法需要推导或学习的信息:对于每个台阶和凸台,都已经完成过一次跨越。我们的方法称为通行条件导航,使路线记住每次过渡是如何进入的,而不仅仅是路径经过了哪里。它将每次教学得到的跨越存储为一个事件,并且无需训练或机器人模型,在每次局部重新规划后强制执行该事件:在每个凸台前设置一个进入门控,当机器人相对于教学得到的跨越偏离超过 10 厘米或 10° 时,便令其转向或后退并重试。在定位噪声下,路径、步态计划和传感方式均不变,该方法将受扰动凸台跨越保持在这些限值内的比例从 24.1% 提高到 88.6%。在采用我们学习策略的接触仿真中,一台在台阶前被推离路线的机器人在 180 次攀爬中从未跌倒,而忽略所存储方向时则跌倒 9 次;当机器人被推离 1.2 米时,它能够重新接入路线,最终平均距离路线 0.14 米(未重新接入时为 1.10 米),并且完成任务的频率与未受扰动的机器人相同。该方法适用于任何配备固定技能、需要反复沿路线通过地形过渡的机器人,例如执行巡检和巡逻任务的机器人;在这些任务中,一次错误的进入方向就可能导致任务失败。我们将其部署到一台真实的轮腿式机器人上参加竞赛:在涵盖 7.0 米高程变化、全长 271 米的多障碍地形中,它完成了全部六次运行,赢得了吸引 2,999 份投稿的 2026 年全球开源人工智能挑战赛第三名,并且是其任务中唯一完全自主完成比赛的决赛选手。
更新时间: 2026-11-19 09:17:01
领域: cs.RO,cs.AI
DAST: A VLM-LLM Framework for Cross-Interface Anomaly Detection in O-RAN
O-RAN enables a disaggregated baseband stack with programmable functions that communicate over standardized open interfaces. The same openness that enables multi-vendor composition also expands the attack surface across logically decoupled tiers that make up the compute continuum. Among these threats, Denial-of-Service and performance-degradation attacks, which account for the majority of catalogued O-RAN threats, are particularly difficult to detect. Traditional Time-Series Anomaly Detection (TSAD) methods fail in this new regime where labelled baselines are scarce, threats evolve faster than detectors can be retrained, and the high-dimensional multivariate telemetry overwhelms monolithic inference models. To address these challenges, we present DAST, a zero-shot multi-agent framework for cross-interface anomaly detection in O-RAN that chains a three-stage VLM $\rightarrow$ LLM $\rightarrow$ VLM pipeline. DAST converts multivariate KPI streams into visual representations, scores textual per-interface descriptions against O-RAN domain knowledge, and verifies suspects on high-resolution heatmaps to output the problematic interfaces, the anomalous time intervals, an indicative O-RAN WG11-aligned operational impact rating and the decision rationale. We evaluate DAST on real network traces collected from an O-RAN testbed under representative performance degradation scenarios, achieving 0.910 F1-Score and 0.843 Accuracy, outperforming state-of-the-art TSAD baselines.
Updated: 2026-11-19 09:13:35
标题: DAST:一种用于 O-RAN 跨接口异常检测的 VLM-LLM 框架
摘要: O-RAN 通过标准化的开放接口,使具备可编程功能的解耦基带协议栈得以实现。正是这种开放性促成了多厂商组件的组合,同时也扩大了横跨构成计算连续体的逻辑解耦层级的攻击面。在这些威胁中,拒绝服务攻击和性能降级攻击占已编目 O-RAN 威胁的大多数,尤其难以检测。传统的时间序列异常检测(TSAD)方法无法适应这一新环境:带标签的基线数据十分稀缺,威胁的演化速度快于检测器的重新训练速度,并且高维多变量遥测数据使单体推理模型不堪重负。为应对这些挑战,我们提出 DAST,一种用于 O-RAN 跨接口异常检测的零样本多智能体框架,采用由视觉语言模型(VLM)→大型语言模型(LLM)→视觉语言模型(VLM)串联而成的三级流水线。DAST 将多变量 KPI 数据流转换为视觉表示,依据 O-RAN 领域知识对各接口的文本描述进行评分,并在高分辨率热力图上核验可疑对象,从而输出存在问题的接口、异常时间区间、与 O-RAN WG11 对齐的指示性运行影响等级以及决策依据。我们在 O-RAN 测试床采集的真实网络轨迹上,针对具有代表性的性能降级场景对 DAST 进行了评估,取得了 0.910 的 F1 分数和 0.843 的准确率,优于当前最先进的 TSAD 基线方法。
更新时间: 2026-11-19 09:13:35
领域: cs.NI,cs.AI,cs.ET,cs.MA
RouteVerify: Routing Interventions for Step-Level Verification in Mixture-of-Experts Models
Routing states in mixture-of-experts (MoE) models can distinguish correct from erroneous reasoning steps. If changing routing also changes a model's step-level verification judgment, it is tempting to conclude that the judgment follows what routing encodes. We test this inference with RouteVerify, a controlled intervention study that replaces selected internal activations from one solution trace with activations from another, while keeping the evaluated input unchanged. Across nine MoE checkpoints, we compare three intervention interfaces: router logits, MoE outputs, and post-MoE residual states. We vary the layers and token positions at which activations are replaced. We measure changes in a verification margin that quantifies the model's preference for INCORRECT over CORRECT. We also evaluate the same input with activations from correct versus erroneous steps to test whether the resulting judgment depends on the source step's correctness. We report four linked results. First, probes on router logits separate correct from erroneous steps in eight checkpoints (AUROC 0.80-0.88). Second, replacing router logits across all routed layers changes the judgment in all nine checkpoints, and by more than a norm-matched random replacement. Third, this change rarely depends on whether the source step is correct. At one layer, routing from erroneous steps and from correct steps produces indistinguishable margins in all nine checkpoints. Under all-layer routing, their difference is resolved and positive in only one. Fourth, the same difference is positive for local residual replacements in eight of nine checkpoints, so the measure does detect such dependence where it exists. Correctness is therefore readable from routing, and routing replacements move the judgment, but the movement rarely follows correctness.
Updated: 2026-11-19 09:11:52
标题: RouteVerify:混合专家模型中用于步骤级验证的路由干预
摘要: 混合专家(MoE)模型中的路由状态能够区分正确的推理步骤与错误的推理步骤。如果改变路由也会改变模型对步骤层面验证的判断,人们很容易得出结论:这种判断遵循的是路由所编码的信息。我们通过 RouteVerify 这一受控干预研究检验了这一推断:在保持被评估输入不变的同时,将一条解题轨迹中的部分内部激活替换为另一条轨迹中的激活。我们在九个 MoE 检查点上比较了三种干预接口:路由器 logits、MoE 输出以及 MoE 之后的残差状态。我们改变被替换激活所在的层和词元位置。我们测量验证边际的变化,该指标量化了模型对 INCORRECT 相对于 CORRECT 的偏好。我们还使用来自正确步骤和错误步骤的激活评估同一个输入,以检验最终判断是否取决于源步骤的正确性。 我们报告了四项相互关联的结果。第一,在九个检查点中的八个上,基于路由器 logits 的探针能够区分正确步骤与错误步骤(AUROC 为 0.80–0.88)。第二,在所有参与路由的层中替换路由器 logits,会改变九个检查点中的模型判断,而且变化幅度大于范数匹配的随机替换。第三,这种变化很少取决于源步骤是否正确。在某一层中,来自错误步骤的路由与来自正确步骤的路由,在九个检查点上产生的验证边际都无法区分。在所有层进行路由替换时,二者的差异仅在一个检查点上得到消解并呈现为正值。第四,对于局部残差替换,在九个检查点中的八个上,这种差异为正;因此,当这种依赖确实存在时,该测量方法能够检测到它。 因此,正确性可以从路由中读取出来,路由替换也会推动模型判断发生变化,但这种变化很少遵循正确性。
更新时间: 2026-11-19 09:11:52
领域: cs.LG,cs.CL
Duopra: From Full-Duplex Conversation to Full-Duplex Agency
Full-duplex interaction models exhibit strong conversational agency, enabling natural, low-latency turn-taking, backchannels, and interruptions. However, completing tasks further requires task agency: timely tool invocation and argument revision following user corrections. Frontend-backend agents separate initiation from execution: the frontend decides whether and what to request, while the backend determines how. Execution can be offloaded, but unsent requests cannot be executed, and incomplete ones can misdirect the backend. On Full-Duplex-Bench v3 (FDB v3), most failures of Realtime-Venus-Audio + Harness in our streaming pipeline occur before a domain tool executes. We introduce Duopra, a full-duplex interaction model that learns task execution alongside conversational control. Duopra treats the backend as a tool, accepting a self-contained natural-language request. Direct calls and backend delegation share an action interface and requirements for faithful initiation and correct execution. Its three-stage training combines protocol SFT, full-duplex RL rewarding timely and complete execution, and projector-only repair of talker conditioning after thinker updates. With the same backend, Pass@1 rises from 4.7% to 44.7%; Duopra achieves 47.7% calling tools directly (26.0% after SFT) and 49.3% with a DeepSeek backend. It improves three FDB v1.0 takeover rates over the base model. These results show that task agency can coexist with key conversational agency.
Updated: 2026-11-19 09:09:23
标题: Duopra:从全双工对话到全双工智能体能力
摘要: 全双工交互模型展现出很强的对话自主性,能够实现自然、低延迟的轮流发言、附和反馈和打断。然而,要进一步完成任务,还需要任务自主性:在用户纠正后及时调用工具并修改参数。前端—后端代理将发起与执行分离:前端决定是否提出请求以及请求什么,后端则决定如何执行。执行过程可以外包,但未发送的请求无法执行,不完整的请求则可能误导后端。在 Full-Duplex-Bench v3(FDB v3)上,我们的流式处理流程中,Realtime-Venus-Audio + Harness 的大多数失败都发生在领域工具执行之前。我们提出 Duopra,一种全双工交互模型,在学习对话控制的同时学习任务执行。Duopra 将后端视为一种工具,接收自包含的自然语言请求。直接调用与后端委派共享同一动作接口,并且都要求发起忠实、执行正确。其三阶段训练包括协议监督微调(SFT)、通过奖励及时且完整的执行进行全双工强化学习,以及在更新思考者后仅训练投影器,以修复说话者条件输入。在使用相同后端的情况下,Pass@1 从 4.7% 提升至 44.7%;Duopra 直接调用工具时达到 47.7%(SFT 后为 26.0%),使用 DeepSeek 后端时达到 49.3%。在 FDB v1.0 的三项接管率指标上,它均优于基础模型。这些结果表明,任务自主性可以与关键的对话自主性共存。
更新时间: 2026-11-19 09:09:23
领域: cs.AI
Driver Gaze Target Identification via Gaze Estimation and Structured Driving Scene Understanding
Identifying a driver's gaze target provides object-level information for visual attention monitoring in intelligent vehicles. Gaze-zone classification and continuous attention localization provide limited information about the identity of the attended scene target. This paper proposes a modular framework that identifies object- or region-level gaze targets from synchronized in-cabin driver images and forward-view road images. The framework comprises four components: MFGaze, which combines a Vision Transformer pretrained with a masked autoencoder (MAE) and head-pose conditioning through feature-wise linear modulation (FiLM); panoptic scene understanding, which constructs a structured candidate set; polynomial ridge regression, which maps gaze features to 2D scene-image coordinates through individualized calibration; and entropy-driven target inference, which adaptively fuses boundary-distance geometry with class-level semantic priors. Experiments evaluate the framework using three public gaze datasets, a laboratory test using Cityscapes road scenes and self-collected gaze data, and the Look Both Ways (LBW) dataset. The complete framework achieves an overall Top-1 gaze target identification accuracy of 96.27% in the laboratory experiment. After sequence-specific calibration, it achieves Top-1 accuracies of 79.92% for task-relevant objects and 85.58% for the road class on LBW. MFGaze achieves the lowest mean angular errors among the compared methods, with 4.06$^\circ$, 4.23$^\circ$, and 10.52$^\circ$ on MPIIFaceGaze, ETH-XGaze, and Gaze360, respectively, and demonstrates strong cross-dataset generalization. Sensitivity analyses show stable performance under hyperparameter perturbations. These results support the framework as a source of object-level gaze information for driver monitoring.
Updated: 2026-11-19 09:09:04
标题: 通过视线估计与结构化驾驶场景理解识别驾驶员注视目标
摘要: 识别驾驶员的注视目标可为智能车辆中的视觉注意力监测提供目标级信息。注视区域分类和连续注意力定位只能提供有限的场景目标身份信息。本文提出了一种模块化框架,通过同步采集的车内驾驶员图像和前视道路图像,识别目标或区域级别的注视目标。该框架由四个组件构成:MFGaze,将经过掩码自编码器(MAE)预训练的视觉Transformer与通过特征级线性调制(FiLM)实现的头部姿态条件相结合;全景场景理解,用于构建结构化候选集;多项式岭回归,通过个体化校准将注视特征映射到场景图像中的二维坐标;以及熵驱动的目标推断,自适应地融合基于边界距离的几何信息与类别级语义先验。实验采用三个公开注视数据集、基于Cityscapes道路场景和自行采集注视数据的实验室测试,以及Look Both Ways(LBW)数据集对该框架进行了评估。在实验室实验中,完整框架取得了96.27%的总体Top-1注视目标识别准确率。在经过序列特定校准后,该框架在LBW数据集上对任务相关目标和道路类别分别取得了79.92%和85.58%的Top-1准确率。在所比较的方法中,MFGaze取得了最低的平均角度误差,在MPIIFaceGaze、ETH-XGaze和Gaze360数据集上分别为4.06°、4.23°和10.52°,并展现出较强的跨数据集泛化能力。敏感性分析表明,在超参数发生扰动时,该框架仍能保持稳定性能。这些结果表明,该框架能够为驾驶员监测提供目标级注视信息。
更新时间: 2026-11-19 09:09:04
领域: cs.CV,cs.LG
Disentangling Monitor Hardware Artifacts and Smoothing Lag for Shift-Robust Intraoperative EEG and Hemodynamic Risk Calibration
Commercial intraoperative electroencephalography (EEG) and blood pressure monitors introduce cyclic impedance pulses, smoothing delays, direct-current (DC) drift, and cuff holds that confound risk forecasting and uncertainty calibration. We developed a causal signal-conditioning and shift-robust conformal calibration framework across 5,439 public anesthesia procedures. Streaming filters blank 10.13-min 64-Hz impedance checks, apply unclipped post-notch conditioning, separate 63-s suppression-ratio lag, and distinguish three-channel cuff inflations from dropouts across propofol-remifentanil total intravenous anesthesia (TIVA; N = 3,214), volatile anesthesia (N = 2,046), European endoscopy sedation (N = 171), and DC-coupled surgery (N = 8). De-impedanced cortical tree ensembles were compared against deep sequence models, paired with patient-cluster Subgroup-Covariate-Weighted Conformal Risk Control (CRC) and lag-buffered online Conformal Proportional-Integral-Derivative (PID) tracking. Pre-filter blanking removed 97.90% and 97.60% of false flatline conflicts while preserving 99.23% and 98.96% of deep suppression. On unseen TIVA surgeries (N = 525), cortical features achieved area under the precision-recall curve (AUPRC) 0.3135 (1.94% prevalence) and 0.1627 (0.82% lag-free prevalence), with no detectable difference from deep encoders (p >= 0.36) and no cortical gain for hypotension (0.3432 vs. 0.3437, p = 0.784). Zero-retraining volatile transfer (N = 1,048) showed no detectable difference from an end-tidal gas oracle on lag-free suppression (0.0820 vs. 0.0736, p = 0.472). Subgroup-Covariate-Weighted CRC bounded all 70 TIVA shift cells at <= 4.38% (alpha = 5.0%) in 66.32 ms per 30-s epoch. Causal artifact disentangling and shift-aware conformal calibration support reliable real-time intraoperative risk bounds within explicit physiological observability limits.
Updated: 2026-11-19 09:05:22
标题: 解耦监视器硬件伪影与平滑延迟,实现对分布偏移稳健的术中脑电图与血流动力学风险校准
摘要: 商用术中脑电图(EEG)和血压监测仪会引入周期性阻抗脉冲、平滑延迟、直流(DC)漂移和袖带保持,从而干扰风险预测与不确定性校准。我们基于5439例公开麻醉手术,开发了一套因果信号调理与抗分布偏移保形校准框架。流式滤波器屏蔽持续10.13分钟、频率64 Hz的阻抗检查,采用无裁剪的陷波后调理,分离持续63秒的抑制比延迟,并区分三通道袖带充气与信号丢失;研究对象包括丙泊酚-瑞芬太尼全静脉麻醉(TIVA;N = 3214)、吸入麻醉(N = 2046)、欧洲内镜镇静(N = 171)和直流耦合手术(N = 8)。去除阻抗影响后的皮层树集成模型与深度序列模型进行了比较,并结合患者聚类的亚组-协变量加权保形风险控制(CRC)以及带延迟缓冲的在线保形比例-积分-微分(PID)跟踪。预滤波屏蔽分别消除了97.90%和97.60%的假性平线冲突,同时保留了99.23%和98.96%的深度抑制信号。在未见过的TIVA手术中(N = 525),皮层特征的精确率-召回率曲线下面积(AUPRC)为0.3135(患病率1.94%)和0.1627(无延迟患病率0.82%),与深度编码器相比未检测到差异(p >= 0.36);对于低血压,皮层特征也未显示增益(0.3432 vs. 0.3437,p = 0.784)。在无需重新训练的吸入麻醉迁移实验中(N = 1048),对于无延迟抑制,其表现与呼气末气体预言模型相比未检测到差异(0.0820 vs. 0.0736,p = 0.472)。亚组-协变量加权CRC将全部70个TIVA偏移单元的风险控制在不超过4.38%(α = 5.0%),每个30秒时间段的处理时间为66.32毫秒。因果性伪影解耦与具备偏移感知能力的保形校准,能够在明确的生理可观测性限制内,为术中实时风险提供可靠界限。
更新时间: 2026-11-19 09:05:22
领域: cs.LG
Closing Performance Gap for Diffusion Language Models under Low Inference Budgets
Diffusion language models offer an architectural route to low-budget generation by updating multiple tokens in parallel, which can reduce the number of sequential decoding steps relative to token-by-token autoregressive decoding. However, realizing this advantage at low budgets is challenging, as generation quality often declines when the number of denoising and refinement steps is reduced. Editable diffusion models address this quality loss through post-draft refinement, but useful intermediate results may still be lost before final submission. We introduce CaRR (Commitment-aware Refinement and Recovery), a training-free framework which improves submission quality from a fixed editable checkpoint through updated-context refill and trajectory-based recovery within its existing forward schedule. Token Commitment Remasking (TCR) remasks selected native pure replacements and refills them on the next scheduled edit forward using the updated context. Submission Commitment Recovery (SCR) uses the resulting refinement trajectory to recover supported candidates when the final response does not satisfy task-specific output requirements. Both modules operate within the native mask/edit schedule without additional backbone forwards. Experiments on code generation and mathematical reasoning show consistent gains in average accuracy over native ME-DLM across four inference budgets, with the largest gains under tight budgets. At one-eighth of the full scheduled forward budget, CaRR improves the six-metric average accuracy by 7.44 pp, including gains of 11.37 and 10.05 on MBPP and MBPP+.
Updated: 2026-11-19 09:03:43
标题: 在低推理预算下缩小扩散语言模型的性能差距
摘要: 扩散语言模型通过并行更新多个词元,为低预算生成提供了一种架构路径;与逐词元自回归解码相比,这可以减少串行解码步骤的数量。然而,在低预算条件下实现这一优势颇具挑战,因为当降噪与细化步骤减少时,生成质量往往会下降。可编辑扩散模型通过提交前的后处理细化来缓解这一质量损失,但在最终提交之前,有用的中间结果仍可能丢失。我们提出 CaRR(Commitment-aware Refinement and Recovery,感知提交的细化与恢复),一种无需训练的框架。该框架通过在现有前向调度中进行更新上下文重填充和基于轨迹的恢复,从固定的可编辑检查点提升提交质量。词元提交重掩码(Token Commitment Remasking,TCR)会对选定的原生纯替换结果重新掩码,并在下一次按计划执行的编辑前向过程中利用更新后的上下文重新填充。提交恢复(Submission Commitment Recovery,SCR)利用由此产生的细化轨迹,在最终响应不满足特定任务输出要求时恢复得到支持的候选结果。两个模块均在原生掩码/编辑调度内运行,无需额外的骨干网络前向计算。在代码生成和数学推理任务上的实验表明,在四种推理预算下,与原生 ME-DLM 相比,CaRR 的平均准确率均取得稳定提升,且在预算紧张时增益最大。在完整计划前向预算的八分之一条件下,CaRR 将六项指标的平均准确率提高了 7.44 个百分点,其中 MBPP 和 MBPP+ 分别提升了 11.37 和 10.05 个百分点。
更新时间: 2026-11-19 09:03:43
领域: cs.CL,cs.AI,cs.LG,stat.ML
Cross-Modal Backdoor Attack on Connector-based Multimodal Large Language Models
Assembling multimodal large language models (MLLMs) from pretrained components has become a widely adopted practice in the open-source ecosystem, yet the supply-chain risks of lightweight connectors remain largely unexplored. We propose a cross-modal backdoor attack that exploits this gap. By poisoning only the connector with a single seed sample and a small set of augmented variants from one modality, the adversary establishes a compact malicious region in the shared latent space associated with a target output. A centroid extracted from this region then serves as a latent anchor for cross-modal activation: adversarial inputs from any other modality can be optimized offline to reach this anchor, triggering the target response without access to the deployed model. Evaluations on PandaGPT and NExT-GPT show same-modality attack success rates (ASR) up to 99.9%, with most cross-modal settings exceeding 95.0% ASR under bounded perturbations. Experiments on ChatBridge further demonstrate the attack's effectiveness across different connector architectures. The attack produces 0.0% backdoor leakage on clean inputs and maintains weight-cosine similarity above 0.97 relative to benign connectors. Existing defenses fail to neutralize the threat without substantial utility degradation, revealing that a single poisoned connector can establish a reusable backdoor pathway across modalities.
Updated: 2026-11-19 09:02:05
标题: 针对基于连接器的多模态大语言模型的跨模态后门攻击
摘要: 从预训练组件组装多模态大语言模型(MLLM)已成为开源生态中广泛采用的实践,但轻量级连接器的供应链风险在很大程度上仍未得到探索。我们提出了一种利用这一漏洞的跨模态后门攻击。攻击者仅通过投毒连接器,并使用来自单一模态的一个种子样本及少量增强变体,便可在共享潜在空间中建立一个与目标输出相关联的紧凑恶意区域。随后,从该区域提取的质心可作为跨模态激活的潜在锚点:攻击者能够在线下优化来自任意其他模态的对抗性输入,使其到达该锚点,并在无法访问已部署模型的情况下触发目标响应。在 PandaGPT 和 NExT-GPT 上的评估表明,同模态攻击成功率(ASR)最高可达 99.9%;在有界扰动条件下,大多数跨模态设置的 ASR 超过 95.0%。在 ChatBridge 上的实验进一步证明,该攻击对不同连接器架构同样有效。该攻击在干净输入上的后门泄漏率为 0.0%,且相较于良性连接器,其权重余弦相似度保持在 0.97 以上。现有防御措施若不造成实质性的效用下降,便无法有效消除这一威胁,这表明单个遭到投毒的连接器即可在不同模态之间建立可复用的后门通路。
更新时间: 2026-11-19 09:02:05
领域: cs.CR
AdaptReg: Skip-level FiLM Adapter for Task-Specific Adaptation of a Frozen Registration Foundation Model
Longitudinal PSMA-PET/CT registration is a key step in assessing treatment response in prostate cancer, and it requires more than generic alignment accuracy: the deformation must preserve lesion volume, so that measured changes in metabolic tumor volume (MTV) and total lesion glycolysis (TLG) reflect treatment response rather than registration artifacts. We propose AdaptReg, which adapts a frozen registration foundation model to such task-specific requirements through a lightweight trainable adapter branch with identity-preserving initialization. Keeping uniGradICON fully frozen, we apply FiLM-style per-voxel affine modulation ($γ$, $β$) to its decoder skip connections; the modulation is generated from anatomical semantic features of a frozen TotalSegmentator encoder and supervised by a lesion volume-preservation loss. On the official Codabench validation set (20 pairs), AdaptReg achieves DSC 0.7585, HD95 6.33 mm, MTV/TLG errors of 1.68%/2.11%, and 0.0022% non-diffeomorphic voxels, improving on the uniGradICON + instance optimization baseline by $+0.05$ DSC and reducing the MTV/TLG errors by 70.9%/67.7%. On the hidden official test set (160 pairs), AdaptReg achieves CT DSC 0.816, PET DSC 0.598, and MTV/TLG errors of 4.02%/3.46%, ranking fourth among 16 teams in the final PSMAReg evaluation. Code: https://github.com/shishuyue/AdaptReg
Updated: 2026-11-19 09:01:33
标题: AdaptReg:用于冻结配准基础模型任务特定适配的跳层 FiLM 适配器
摘要: 纵向 PSMA-PET/CT 配准是评估前列腺癌治疗反应的关键步骤,其要求不仅是实现通用的对齐精度:形变还必须保持病灶体积,使测得的代谢肿瘤体积(MTV)和总病灶糖酵解量(TLG)的变化能够反映治疗反应,而非配准伪影。我们提出了 AdaptReg,通过一个采用保持恒等映射初始化的轻量级可训练适配器分支,使冻结的配准基础模型适应这类特定任务需求。在完全冻结 uniGradICON 的情况下,我们对其解码器跳跃连接施加 FiLM 风格的逐体素仿射调制(γ、β);该调制由冻结的 TotalSegmentator 编码器提取的解剖语义特征生成,并通过病灶体积保持损失进行监督。在官方 Codabench 验证集(20 对)上,AdaptReg 达到 0.7585 的 DSC、6.33 mm 的 HD95、1.68%/2.11% 的 MTV/TLG 误差,以及 0.0022% 的非微分同胚体素比例;相比 uniGradICON 加实例优化基线,DSC 提高了 0.05,MTV/TLG 误差分别降低了 70.9%/67.7%。在官方隐藏测试集(160 对)上,AdaptReg 达到 0.816 的 CT DSC、0.598 的 PET DSC,以及 4.02%/3.46% 的 MTV/TLG 误差,在最终 PSMAReg 评测的 16 支参赛队伍中排名第四。代码:https://github.com/shishuyue/AdaptReg
更新时间: 2026-11-19 09:01:33
领域: cs.CV,cs.LG
Characterizing and Detecting Unfaithful Work Reports by Coding Agents
Coding agents increasingly carry out long-horizon development tasks, autonomously planning and executing multi-step actions that span files, tools, and sessions. Because developers rarely follow each action, and agents resuming the work depend on records of what was done, the agent's work report often becomes the primary account of what was changed and established. When the report contains false or unsupported claims, it gives recipients false assurance: incomplete work may be accepted without verification, incorrect assumptions about the current state can propagate to later steps and agents, and evaluators that credit stated success may reward the report rather than the work. Yet little is known about what unfaithful reporting looks like in real development work, or how developers and agents handle it once it surfaces. Starting from real developer--agent conversations in SWE-chat, we conduct a systematic mixed-methods analysis of self-admitted unfaithful reports. We identify eleven subtypes in four categories: misreported observations, misattributed evidence, overstated task success, and faulty technical explanations, with overstated task success the most common. Handling these problems involves on average 4.3 further user turns and 12.71 minutes of recorded response and execution time, and users express dissatisfaction more often. Among 435 work reports that we separately sample and annotate, \NaturalPositiveShare{}\% contain at least one unfaithful claim. We also develop FaithDetector, a detector for unfaithful reporting informed by the observed patterns. On naturally sampled reports, FaithDetector attains \NaturalDetectorMacro{}\% macro-F1, about 13 percentage points above the baseline. Together, our findings and FaithDetector provide empirical evidence and an automated method for checking reporting faithfulness, informing agent evaluation and training feedback.
Updated: 2026-11-19 09:01:02
标题: 通过编码智能体刻画并检测不忠实的工作报告
摘要: 编码代理越来越多地执行长期开发任务,自主规划并执行跨越多个文件、工具和会话的多步骤操作。由于开发者很少跟踪每一项操作,而恢复工作的代理又依赖于对已完成工作的记录,代理的工作报告往往成为关于哪些内容已被修改、哪些内容已被确立的主要记录。当报告包含虚假或缺乏依据的陈述时,就会给接收者带来虚假的确信:未完成的工作可能未经核验便被接受,对当前状态的错误假设可能传播到后续步骤和其他代理,而那些根据所声称的成功来评分的评估者,可能奖励的是报告而非实际工作。然而,人们对于在真实开发工作中不忠实报告呈现为何种形式,以及开发者和代理在问题暴露后如何处理,仍知之甚少。我们以 SWE-chat 中真实的开发者—代理对话为起点,对代理自认的不忠实报告开展了系统性的混合方法分析。我们在四个类别中识别出十一种子类型:错误报告观察结果、错误归属证据、夸大任务成功程度,以及错误的技术解释,其中夸大任务成功程度最为常见。处理这些问题平均需要用户额外进行 4.3 轮交互,并耗费 12.71 分钟的记录响应与执行时间;用户表达不满的频率也更高。在我们另外抽样并标注的 435 份工作报告中,\NaturalPositiveShare{}\% 至少包含一项不忠实陈述。我们还开发了 FaithDetector,这是一种基于所观察模式、用于检测不忠实报告的检测器。在自然抽样的报告上,FaithDetector 达到 \NaturalDetectorMacro{}\% 的宏平均 F1,较基线高出约 13 个百分点。总体而言,我们的研究发现和 FaithDetector 为检查报告忠实性提供了实证证据和自动化方法,可为代理评估和训练反馈提供参考。
更新时间: 2026-11-19 09:01:02
领域: cs.SE,cs.AI
ADAPT: Adaptive Decision and Abstention with Pool-Size-Aware Thresholds for Service Routing
Retrieval-based classifiers efficiently route queries to specialised services, but they typically select a candidate even when no suitable service exists. We introduce Adaptive Decision and Abstention with Pool-Size-Aware Thresholds for Service Routing (ADAPT), a lightweight routing architecture with an explicit fallback option that enables queries to abstain from specialist selection. ADAPT uses the separation between the highest relevance score and the candidate score distribution as routing confidence. Experiments across retrieval models and increasing numbers of services reveal a consistent empirical behaviour: the confidence distribution changes systematically with candidate-pool size K, making fixed abstention thresholds increasingly miscalibrated. ADAPT addresses this effect with a K-aware threshold that adapts as services are added without classifier retraining. Evaluation across two specialist datasets shows that this simple mechanism provides an effective accuracy-cost trade-off compared with generative LLM routing, supporting lightweight and dynamically extensible service-routing architectures.
Updated: 2026-11-19 08:58:05
标题: ADAPT:面向服务路由的池规模感知阈值自适应决策与弃权
摘要: 基于检索的分类器能够高效地将查询路由至专门服务,但即使不存在合适的服务,它们通常也会选择一个候选服务。我们提出了面向服务路由的自适应决策与弃权机制(Adaptive Decision and Abstention with Pool-Size-Aware Thresholds for Service Routing,ADAPT),这是一种轻量级路由架构,提供明确的回退选项,使查询可以放弃选择专门服务。ADAPT利用最高相关性得分与候选得分分布之间的差异作为路由置信度。在不同检索模型和不断增加的服务数量下进行的实验表明,置信度分布会随候选池大小 K 发生系统性变化,导致固定的弃权阈值日益失准。ADAPT通过采用与 K 相关的阈值来应对这一影响,使阈值能够随着服务的增加而调整,而无需重新训练分类器。在两个专门服务数据集上的评估显示,与生成式大语言模型路由相比,这一简单机制能够实现有效的准确率—成本权衡,为轻量级且可动态扩展的服务路由架构提供支持。
更新时间: 2026-11-19 08:58:05
领域: cs.AI
Born for the Task: Rethinking Quantum Chemistry with Foresighted Agentic Computing
Quantum chemistry relies on general-purpose software, whose generality leaves many large-scale calculations beyond practical resource budgets. Coding agents make task-specific programs cheap to write, but not efficient ones easy to find: whether a computational strategy is accurate and fast enough becomes clear only after it actually runs at the target scale. We introduce MakoBORN, a foresighted agentic computing framework that synthesizes high performance quantum chemistry programs on demand. MakoBORN anticipates the behavior of each strategy before execution, extrapolating its error from representative small systems and predicting its runtime from the target-scale workload and measured hardware throughputs. Building on these predictions, MakoBORN unfolds the preset schemes of existing packages into independently configurable algorithmic components, selects the fastest strategy within the error tolerance from the predicted accuracy-runtime Pareto frontier, and guides coding agents to compile it with component-level performance predictions. For a Hartree-Fock calculation with 50,024 basis functions, MakoBORN finishes in 1.41 h on a single CPU node, 77$\times$ faster than the estimated runtime of a general-purpose baseline and still 9.8$\times$ faster with development time included. On a single GPU, MakoBORN completes the ubiquitin calculation in 2.1 h, the same order of runtime as the GPU-accelerated package Mako on 64 GPUs, and shortens the B-DNA duplex calculation from an estimated two months to 8.1 h (173$\times$).
Updated: 2026-11-19 08:57:57
标题: 生而为此:以高瞻远瞩的智能体计算重新思考量子化学
摘要: 量子化学依赖通用软件,而通用性使许多大规模计算超出了实际资源预算。编码代理能够以较低成本编写特定任务的程序,但并不容易找到高效的程序:一种计算策略是否足够准确且足够快速,只有在目标规模上实际运行后才能明确。我们提出 MakoBORN,一种具有前瞻性的智能体计算框架,可按需合成高性能量子化学程序。MakoBORN 在执行之前预测每种策略的表现:根据具有代表性的小型体系外推其误差,并结合目标规模的工作负载和实测硬件吞吐率预测其运行时间。在此基础上,MakoBORN 将现有软件包中预设的方案展开为可独立配置的算法组件,根据预测的精度—运行时间帕累托前沿,在误差容限内选择最快的策略,并利用组件级性能预测指导编码代理对其进行编译。对于一个包含 50,024 个基组函数的 Hartree–Fock 计算,MakoBORN 在单个 CPU 节点上用时 1.41 小时完成,比通用基线估计的运行时间快 77 倍;即使计入开发时间,仍快 9.8 倍。在单个 GPU 上,MakoBORN 用 2.1 小时完成泛素计算,其运行时间与 GPU 加速软件包 Mako 在 64 个 GPU 上的运行时间处于同一数量级;对于 B-DNA 双链计算,它还将预计两个月的运行时间缩短至 8.1 小时,提速 173 倍。
更新时间: 2026-11-19 08:57:57
领域: cs.AI,physics.chem-ph
Beyond Error Mitigation: Using Boosting for Noisy Quantum Machine Learning
Quantum error mitigation (QEM) can recover information about ideal quantum computations from noisy circuit executions, but may require a large sampling overhead. Fundamental lower bounds show that recovering noiseless observables without problem-specific information can require superpolynomially many samples, with exponential overhead for broad classes of noisy circuits. However, problem-specific information can reduce the number of samples needed to obtain the required answer. We investigate this possibility in supervised quantum machine learning, where labeled examples provide information about the function to be learned. Binary classification provides such a setting, since correct prediction depends on the sign and margin of the classifier output rather than on accurate reconstruction of every noiseless expectation value. We develop a theoretical and empirical framework for comparing boosting of noisy parameterized quantum circuits with probabilistic error cancellation (PEC), requiring both methods to reach the same learning target. For the specified circuit architectures under Pauli noise, we establish a common hypothesis-class complexity bound: matching empirical margin loss gives the same upper bound on expected classification risk. We derive resource criteria and evaluate AdaBoostR and Real AdaBoost in finite-shot teacher-student simulations across circuit depth and physical noise strength. Under the same classification-accuracy target, boosting requires fewer circuit executions as depth and noise increase. Boosting also achieves higher test accuracy than the corresponding reference. For the supervised-learning problems studied, these results demonstrate a task-dependent resource advantage: exploiting information retained in noisy outputs can avoid the cost of ideal-output reconstruction without sacrificing observed classification performance.
Updated: 2026-11-19 08:56:10
标题: 超越误差缓解:利用提升方法实现噪声量子机器学习
摘要: 量子误差缓解(QEM)能够从含噪量子电路的执行结果中恢复关于理想量子计算的信息,但可能需要巨大的采样开销。基本下界表明,在缺乏问题特定信息的情况下,恢复无噪声观测量可能需要超多项式数量的样本;对于广泛类别的含噪电路,所需开销甚至呈指数增长。然而,问题特定信息可以减少获得所需答案所需的样本数量。我们在监督式量子机器学习中研究了这一可能性,因为带标签样本能够提供关于待学习函数的信息。二分类提供了这样一个研究场景:正确预测取决于分类器输出的符号和间隔,而不是精确重构每一个无噪声期望值。我们建立了一个理论与实证框架,用于比较含噪参数化量子电路的提升方法与概率误差抵消(PEC),并要求两种方法达到相同的学习目标。对于指定的电路架构和泡利噪声,我们建立了一个共同的假设类复杂度界:匹配经验间隔损失即可得到相同的期望分类风险上界。我们推导了资源判据,并在不同电路深度和物理噪声强度下,通过有限采样次数的教师—学生模拟评估 AdaBoostR 和 Real AdaBoost。在相同分类准确率目标下,随着深度和噪声增加,提升方法所需的电路执行次数更少。与相应的参考方法相比,提升方法还取得了更高的测试准确率。对于所研究的监督学习问题,这些结果展示了一种任务依赖的资源优势:利用含噪输出中保留的信息,可以避免理想输出重构的成本,同时不牺牲观测到的分类性能。
更新时间: 2026-11-19 08:56:10
领域: quant-ph,cs.LG
VLRS-Bench: A Vision-Language Reasoning Benchmark for Remote Sensing
Recent advancements in Multimodal Large Language Models (MLLMs) have enabled complex reasoning. However, existing remote sensing (RS) benchmarks remain heavily biased toward perception tasks, such as object recognition and scene classification. This limitation hinders the development of MLLMs for cognitively demanding RS applications. To address this, we propose a Vision Language ReaSoning Benchmark (VLRS-Bench), which is the first benchmark exclusively dedicated to complex RS reasoning. Structured across the three core dimensions of Cognition, Decision, and Prediction, VLRS-Bench comprises 2,000 question-answer pairs with an average question length of 129.87 words, spanning 14 tasks and up to eight temporal phases. VLRS-Bench is constructed via a specialized pipeline that integrates RS-specific priors and expert knowledge to ensure geospatial realism and reasoning complexity. Experimental results reveal significant bottlenecks in existing state-of-the-art MLLMs, providing critical insights for advancing multimodal reasoning within the remote sensing community.
Updated: 2026-11-19 08:53:55
标题: VLRS-Bench:用于遥感的视觉-语言推理基准奠
摘要: 多模态大语言模型(MLLMs)的最新进展已使复杂推理成为可能。然而,现有的遥感(RS)基准仍严重偏向于目标识别和场景分类等感知任务。这一局限阻碍了面向认知要求更高的遥感应用开发多模态大语言模型。为此,我们提出了视觉语言推理基准(Vision Language ReaSoning Benchmark,VLRS-Bench),这是首个专门针对复杂遥感推理的基准。VLRS-Bench围绕认知、决策和预测三个核心维度构建,包含2000组问答对,问题平均长度为129.87个单词,涵盖14项任务以及最多八个时间阶段。VLRS-Bench通过一套专门设计的流程构建,将遥感领域特有的先验知识与专家知识相结合,以确保地理空间真实性和推理复杂度。实验结果揭示了现有最先进多模态大语言模型存在的显著瓶颈,为推动遥感领域多模态推理的发展提供了重要见解。
更新时间: 2026-11-19 08:53:55
领域: cs.CV,cs.AI
SAM 3 Sees More Than It Detects: Promptable Concept Maps Beyond Categories
Promptable segmenters answer what a thing is. Dense prediction tasks also ask class-agnostic questions, such as what stands out or hides, how light is blocked, transmitted or reflected, and where structure lies. Robots, surveillance systems and image editors build on their answers. We study promptable concept maps (PCM), which extend SAM 3's promptable concept segmentation from noun instances to maps of concepts named by short noun phrases such as `"transparent object", with "none" as an answer. PCM-Bench groups the standard test sets of seven such tasks by the question they ask. On it, we find that SAM 3 sees more than it detects. Its semantic path responds to many of these concepts, yet a low image-level presence score can block every detection of its instance path. We present UNVEIL, which trains a copy of SAM 3's semantic path for these maps, with LoRA on copies of its last blocks. A separate presence decoder learns from verified negatives whether a concept occurs. With one text phrase per query, UNVEIL maps region concepts such as salient and camouflaged objects, shadows, transparent objects and mirrors. The same weights map thin structures such as edges and skeletons as well as object categories. Run next to SAM 3, it leaves SAM 3's own outputs unchanged. On each of the seven tasks, UNVEIL reaches the highest score among the compared promptable models, including SAM 3's official fine-tuning and pipelines built on multimodal LLMs. Code is available at https://github.com/yuhuan-wu/UNVEIL.
Updated: 2026-11-19 08:52:36
标题: SAM 3 不仅能检测,还能看见更多:超越类别的可提示概念图
摘要: 可提示分割器回答的是“某个事物是什么”。密集预测任务还会提出类别无关的问题,例如什么最突出或被隐藏、光线如何被阻挡、透射或反射,以及结构位于何处。机器人、监控系统和图像编辑器都以这些答案为基础。我们研究了可提示概念图(PCM),将 SAM 3 的可提示概念分割从名词实例扩展到由简短名词短语命名的概念图,例如“透明物体”,并以“无”作为答案。PCM-Bench 按照问题类型,将七类此类任务的标准测试集进行归组。在该基准上,我们发现 SAM 3 的感知能力超出了其检测能力。其语义路径能够响应许多此类概念,但较低的图像级存在性分数可能会阻止其实例路径进行任何检测。我们提出 UNVEIL:针对这些概念图训练 SAM 3 语义路径的副本,并在其最后几个模块的副本上采用 LoRA。一个独立的存在性解码器通过经验证的负样本学习某个概念是否出现。对于每个查询,仅需输入一个文本短语,UNVEIL 即可映射显著物体、伪装物体、阴影、透明物体和镜子等区域概念。同一组权重还能够映射边缘和骨架等细薄结构,以及物体类别。将其与 SAM 3 并行运行时,不会改变 SAM 3 自身的输出。在七项任务中的每一项上,UNVEIL 均取得了所有参与比较的可提示模型中的最高分,包括 SAM 3 官方微调模型以及基于多模态大语言模型构建的处理流程。代码见:https://github.com/yuhuan-wu/UNVEIL】【。
更新时间: 2026-11-19 08:52:36
领域: cs.CV,cs.AI
Learning Which Evidence-Seeking Decisions Matter: Calibrated Counterfactual Replay for Language Agents
Language agents answer questions by searching, reading, and checking claims. A reward on the final answer says little about which of those decisions earned it, since an agent can reach the right string after redundant searches or with half the evidence missing. We treat the question as an experiment. At a saved decision point, PCCC-RL, for prefix-conditioned counterfactual credit, restores the tool state, runs the action the agent chose alongside a feasible alternative, and lets the same frozen policy finish both branches. The difference in final score then samples what the decision was worth. Replaying everything is too expensive, so the method predicts each action's credit up front, checks a random subset, and uses the recorded selection probabilities to correct the errors of that prediction, spending the budget where a further check can still move the training signal. Alternatives are drawn from the prefix alone, which keeps the comparison a usable gradient baseline. On HotpotQA and MuSiQue, joint exact match, requiring a correct answer together with complete supporting evidence, reaches 56.71% and 36.82%, gains of 4.19 and 3.86 points over a baseline with the same replay access. The gain concentrates in complete evidence chains and accumulates over many updates. Single-update effects stay uncertain, and citation coverage and scope distinctions such as "none" versus "not all" remain open.
Updated: 2026-11-19 08:52:31
标题: 学习哪些证据搜寻决策至关重要:面向语言智能体的校准式反事实回放
摘要: 语言智能体通过搜索、阅读和核查主张来回答问题。最终答案获得的奖励很难说明究竟是哪些决策带来了这一结果,因为智能体可能经过冗余搜索,或在证据缺失一半的情况下,仍然得到正确的答案。我们将问题视为一项实验。在一个已保存的决策点上,PCCC-RL(基于前缀条件的反事实信用分配)恢复工具状态,执行智能体所选择的动作,同时执行一个可行的替代动作,并让同一个冻结策略完成这两个分支。两个分支最终得分之差,就为该决策的价值提供了一个样本。由于重放所有决策的成本过高,该方法会预先预测每个动作的信用,随机检查其中一部分,并利用记录的选择概率来修正预测误差,将计算预算投入到那些进一步检查仍可能改变训练信号的地方。替代动作仅根据前缀生成,从而使比较结果能够作为可用的梯度基线。在 HotpotQA 和 MuSiQue 数据集上,联合精确匹配率(要求答案正确且支持证据完整)分别达到 56.71% 和 36.82%,相比具有相同重放权限的基线分别提高 4.19 个百分点和 3.86 个百分点。增益主要集中在完整的证据链上,并且会随着多次更新逐步累积。单次更新的效果仍存在不确定性,引用覆盖率以及“没有”与“并非全部”等范围区别仍有待进一步研究。
更新时间: 2026-11-19 08:52:31
领域: cs.LG,cs.AI
BrainPro: Process-conditioned Pretraining with Topographic Retrieval for Large EEG Models
EEG foundation models are pretrained on heterogeneous corpora, but two challenges remain underexplored: (1) experimental protocols provide mental-process cues that are rarely used in masked pretraining, and (2) electrode montages vary across datasets, making spatial representations montage-dependent. Existing methods typically learn a single general-purpose representation and model spatial structure implicitly, limiting their ability to exploit process-related information under montage heterogeneity. We introduce BrainPro, a process-conditioned self-supervised pretraining framework that couples topographic retrieval with shared and process-associated representation learning. BrainPro maps dataset-specific montages to a universal channel-region template and retrieves channel- and region-level spatial filters to form a topographically aligned spatial basis. Over this basis, BrainPro learns a shared encoder for general EEG structure and additional affective, motor-related, and auxiliary residual branches for process-associated variation. Protocol-derived mental-process cues condition branch activation and region-weighted masked reconstruction, incorporating topographic spatial priors and process information. Across nine public BCI benchmarks, BrainPro achieves strong performance among evaluated baselines. Ablations, channel-drop analysis, encoder-configuration studies, and spatial-filter visualizations suggest that topographic retrieval and process-conditioned representation learning jointly improve EEG decoding. Our code is available at https://github.com/yi-ding-cs/BrainPro.
Updated: 2026-11-19 08:51:44
标题: BrainPro:面向大型脑电图模型的过程条件预训练与拓扑检索
摘要: 脑电图基础模型通常在异质语料库上进行预训练,但仍有两个尚未得到充分研究的挑战:(1)实验方案提供了心理过程线索,而这些线索很少被用于掩码预训练;(2)不同数据集采用的电极布置各不相同,导致空间表征依赖于具体电极布置。现有方法通常学习单一的通用表征,并对空间结构进行隐式建模,因此在电极布置存在异质性的情况下,利用与心理过程相关的信息的能力受到限制。 我们提出 BrainPro,一种以心理过程为条件的自监督预训练框架,将地形检索与共享表征学习和过程关联表征学习相结合。BrainPro 将特定于数据集的电极布置映射到统一的通道—脑区模板,并检索通道级和脑区级空间滤波器,从而构建具有地形对齐特性的空间基。基于该空间基,BrainPro 学习一个用于表征通用脑电结构的共享编码器,以及用于表征过程相关变化的情感、运动相关和辅助残差分支。由实验方案推导出的心理过程线索用于调节分支激活和区域加权的掩码重建,将地形空间先验与过程信息融入模型。 在九个公开的脑机接口基准数据集上,BrainPro 在所评估的基线方法中取得了较强的性能。消融实验、通道丢弃分析、编码器配置研究以及空间滤波器可视化结果表明,地形检索与以过程为条件的表征学习能够协同提升脑电解码性能。我们的代码已发布于:https://github.com/yi-ding-cs/BrainPro。
更新时间: 2026-11-19 08:51:44
领域: cs.LG
Goal-Guided Reinforcement Learning via Fine-Tuning Vision-Language Models
Exploration remains a major challenge for reinforcement learning (RL) agents in Craftax-style environments due to sparse rewards and long horizons. Large language models (LLMs) can guide exploration by generating high-level goals, but methods using models without explicit task adaptation often rely on carefully designed prompts and may produce inconsistent or contextually inappropriate goals. We introduce CCGP-2M, a multimodal goal-preference dataset constructed from interaction trajectories in Craftax-Classic, and propose a vision-language model (VLM)-guided RL framework that learns environment-specific goal guidance from this dataset. The framework consists of two stages: offline VLM fine-tuning and online goal-guided RL. In the offline stage, we align the VLM with goal preferences using Kullback-Leibler Token-level Direct Preference Optimization (KLTDPO), which combines token-level KL regularization with distributionally robust reweighting. Experiments on Craftax-Classic show that our method collects diamonds earlier than state-of-the-art baselines, achieves the highest score and reward, and attains the highest success rates on most achievements.
Updated: 2026-11-19 08:50:19
标题: 通过微调视觉语言模型实现目标引导的强化学习
摘要: 由于奖励稀疏且决策时域较长,探索仍是 Craftax 风格环境中强化学习(RL)智能体面临的主要挑战。大型语言模型(LLM)能够通过生成高层次目标来引导探索,但那些未进行显式任务适配的模型方法通常依赖精心设计的提示词,并且可能生成不一致或不符合上下文的目标。我们提出了 CCGP-2M,这是一个基于 Craftax-Classic 交互轨迹构建的多模态目标偏好数据集;同时提出了一种由视觉语言模型(VLM)引导的强化学习框架,利用该数据集学习特定于环境的目标引导策略。该框架由两个阶段组成:离线 VLM 微调和在线目标引导强化学习。在离线阶段,我们采用结合了令牌级 KL 正则化与分布鲁棒重加权的 KL 散度令牌级直接偏好优化(KLTDPO),使 VLM 与目标偏好保持一致。在 Craftax-Classic 上的实验表明,与当前最先进的基线方法相比,我们的方法能够更早收集到钻石,取得最高的分数和奖励,并在大多数成就上达到最高成功率。
更新时间: 2026-11-19 08:50:19
领域: cs.LG
An LLM-Driven Traffic-Control xApp for Dynamic 5G RAN Intents
Programmable Radio Access Networks (RANs) enable runtime deployment of traffic-control functions, but selecting the appropriate configuration remains challenging as network conditions and service requirements change over time. Conventional solutions often rely on static rules or learning-based controllers with predefined state and action spaces, limiting their ability to accommodate changing intents. This paper introduces an LLM-driven xApp for traffic control in programmable RANs. The proposed architecture combines operator-defined service intents, runtime E2 interface telemetry, and the currently deployed configuration to generate traffic-management policies without blocking packet forwarding or the processing of incoming E2 measurements during LLM inference. Experiments on an OpenAirInterface 5G environment show that the proposed controller dynamically adapts the traffic-control pipeline to runtime intent changes, achieving an average intent satisfaction ratio of 0.91, compared with 0.52 for a static TC-RAN configuration. When channel conditions degrade, the controller maintains an intent satisfaction ratio of approx. 0.88, compared with approx. 0.4 for the static baseline.
Updated: 2026-11-19 08:47:12
标题: 一种由大语言模型驱动的用于动态 5G RAN 意图的流量控制 xApp
摘要: 可编程无线接入网(RAN)支持在运行时部署流量控制功能,但随着网络条件和服务需求随时间变化,选择合适的配置仍然具有挑战性。传统解决方案通常依赖静态规则,或依赖具有预定义状态空间和动作空间的基于学习的控制器,这限制了其适应不断变化的意图的能力。本文提出了一种由大语言模型(LLM)驱动的可编程 RAN 流量控制 xApp。所提出的架构结合了由运营商定义的服务意图、运行时 E2 接口遥测数据以及当前已部署的配置,在 LLM 推理期间无需阻塞数据包转发或传入 E2 测量数据的处理,即可生成流量管理策略。在 OpenAirInterface 5G 环境中的实验表明,所提出的控制器能够根据运行时意图的变化动态调整流量控制流程,实现 0.91 的平均意图满足率,而静态 TC-RAN 配置的意图满足率为 0.52。当信道条件恶化时,该控制器仍能保持约 0.88 的意图满足率,而静态基线的意图满足率约为 0.4。
更新时间: 2026-11-19 08:47:12
领域: cs.NI,cs.AI
Structured Role-Aware Policy Optimization for Multimodal Reasoning
Reinforcement learning from verifiable rewards (RLVR), especially with Group Relative Policy Optimization (GRPO), has shown strong potential for improving the reasoning capabilities of large vision-language models (LVLMs). However, in multimodal reasoning, final-answer rewards are typically assigned at the sequence level and do not distinguish the functional roles of different tokens, making it difficult to determine whether a correct answer is supported by task-relevant visual evidence. In this paper, we revisit multimodal RLVR from the perspective of role-aware token-level credit assignment, where structured responses are decomposed into perception tokens for extracting visual evidence and reasoning tokens for deriving answers from that evidence. Based on this perspective, we propose Structured Role-aware Policy Optimization (SRPO), which refines the sequence-level GRPO advantage into role-aware token-level advantages without changing the reward function. Specifically, SRPO assigns role-specific credit by using self-distilled on-policy contrasts: perception tokens are emphasized according to their visual dependency under original versus corrupted visual inputs, while reasoning tokens are emphasized according to their consistency with the generated perception. These role-specific signals are further unified through a shared trajectory-level baseline, yielding positive token weights that adjust relative update magnitudes while preserving the original GRPO reward and advantage signs, without requiring external reward models or separate teachers. Experiments across diverse multimodal reasoning benchmarks show that SRPO improves evidence-grounded reasoning, highlighting the importance of moving beyond uniform sequence-level credit toward role-aware optimization for reliable multimodal reasoning.
Updated: 2026-11-19 08:46:41
标题: 面向多模态推理的结构化角色感知策略优化
摘要: 基于可验证奖励的强化学习(RLVR),尤其是结合群组相对策略优化(GRPO)的方法,已展现出提升大型视觉语言模型(LVLM)推理能力的巨大潜力。然而,在多模态推理中,最终答案奖励通常以序列级形式分配,无法区分不同词元所承担的功能角色,因此难以判断正确答案是否得到了与任务相关的视觉证据支持。本文从角色感知的词元级信用分配视角重新审视多模态 RLVR:将结构化响应分解为用于提取视觉证据的感知词元,以及用于根据这些证据推导答案的推理词元。基于这一视角,我们提出结构化角色感知策略优化(SRPO),在不改变奖励函数的情况下,将序列级 GRPO 优势细化为角色感知的词元级优势。具体而言,SRPO 利用自蒸馏的在策略对比来分配角色特定的信用:根据原始视觉输入与受损视觉输入下的视觉依赖程度,突出感知词元的重要性;根据推理结果与生成的感知内容之间的一致性,突出推理词元的重要性。这些角色特定信号进一步通过共享的轨迹级基线加以统一,得到正的词元权重,在保留原始 GRPO 奖励及优势符号的同时,调整相对更新幅度,且无需外部奖励模型或独立教师模型。针对多种多模态推理基准的实验表明,SRPO 能够提升以证据为基础的推理能力,凸显了从统一的序列级信用分配转向角色感知优化对于实现可靠多模态推理的重要性。
更新时间: 2026-11-19 08:46:41
领域: cs.AI,cs.LG
PosteriorBench: Evaluating Behavior Posterior Sampling in Language Models
Rare language model behaviors can be difficult to study because obtaining them through ordinary sampling can require a very large number of samples. This motivates the behavior posterior sampling problem: given a language model and a behavior of interest, is there an algorithm that efficiently samples from the model's distribution over transcripts that exhibit this behavior? We introduce PosteriorBench, a benchmark for comparing algorithms by their compute cost and by how close their samples are to the true posterior in forward and reverse KL divergence. PosteriorBench contains 21 tasks on Qwen3.5-0.8B with behavior probabilities from $10^{-5}$ to $10^{-1}$, each with exact posterior samples from a corpus of one billion labeled responses. We find that no method we evaluate is both efficient and faithful: simple methods like prompting are cheap but plateau at a high KL divergence from the posterior, fine-tuning on posterior samples is often cost-prohibitive, and several training methods from prior work do not perform better. Building a posterior sampler that can cheaply approximate the true posterior remains an open problem, and we hope PosteriorBench can measure progress towards this objective. Code and data are available at https://github.com/TransluceAI/PosteriorBench.
Updated: 2026-11-19 08:46:27
标题: PosteriorBench:评估语言模型中的行为后验采样
摘要: 罕见的语言模型行为可能难以研究,因为通过普通采样获得这些行为往往需要极大量的样本。这促使我们提出行为后验采样问题:给定一个语言模型和一种感兴趣的行为,是否存在一种算法,能够从该模型在表现出这种行为的文本记录上的分布中高效采样?我们推出了 PosteriorBench,这是一个用于比较不同算法的基准,评估指标包括计算成本,以及其样本在正向和反向 KL 散度意义下与真实后验的接近程度。PosteriorBench 包含 Qwen3.5-0.8B 上的 21 项任务,行为概率范围为 $10^{-5}$ 至 $10^{-1}$;每项任务都具有来自十亿条带标签响应语料库的精确后验样本。我们发现,所评估的方法中没有一种能够同时做到高效且忠实:提示等简单方法成本低廉,但与后验之间的 KL 散度会停留在较高水平;在后验样本上进行微调通常成本过高;而先前工作中的几种训练方法表现也没有更好。构建一种能够以较低成本近似真实后验的后验采样器仍是一个开放问题,我们希望 PosteriorBench 能够衡量朝这一目标取得的进展。代码和数据可在 https://github.com/TransluceAI/PosteriorBench 获取。
更新时间: 2026-11-19 08:46:27
领域: cs.LG,cs.AI,cs.CL
From Reliance to Overreliance: Taxonomizing and Detecting Relational Risks in AI Companionship
Companion AIs are increasingly used for emotional support, yet distinguishing meaningful engagement from harmful reliance remains difficult. We introduce the Taxonomy of Relational Risks (TRR), which operationalizes users' emotional overreliance (EO) as observable conversational behaviors and separately identifies evidence of relational harm (RH), enabling empirical examination of when reliance behaviors co-occur with adverse consequences. Using naturalistic Character.AI and Replika conversations from 110 adults, we found EO-related behaviors in 63.2% of non-roleplay conversations, while observable relational harms appeared in 10.5%. Although EO did not necessarily lead to harm, recurring patterns often co-occurred with harmful outcomes, suggesting value as risk indicators. Open-source LLMs satisfactorily detected 12 of 14 EO behaviors in at least one configuration. Qualitative analysis revealed expectations of care, repeated support seeking, dependency, distress, and reduced confidence in personal judgment. We argue for graduated safety interventions tailored to patterns and trajectories of EO-related behavior.
Updated: 2026-11-19 08:46:09
标题: 从依赖到过度依赖:人工智能陪伴中的关系风险分类与检测
摘要: 陪伴型人工智能越来越多地被用于情感支持,但要区分有意义的互动与有害的依赖仍然困难。我们提出“关系风险分类体系”(Taxonomy of Relational Risks,TRR),将用户的情感过度依赖(emotional overreliance,EO)操作化为可观察的对话行为,并单独识别关系伤害(relational harm,RH)的证据,从而能够实证考察依赖行为何时会与不良后果共同出现。基于110名成年人的自然状态下 Character.AI 和 Replika 对话,我们发现,63.2%的非角色扮演对话中出现了与 EO 相关的行为,而10.5%的对话中出现了可观察到的关系伤害。尽管 EO 不一定会导致伤害,但反复出现的行为模式往往与有害结果共同发生,表明这些行为可作为风险指标。开源大语言模型在至少一种配置下能够令人满意地检测出14种 EO 行为中的12种。定性分析揭示了对关怀的期待、反复寻求支持、依赖、痛苦,以及对个人判断信心的下降。我们主张,应根据 EO 相关行为的模式与发展轨迹,制定分级的安全干预措施。
更新时间: 2026-11-19 08:46:09
领域: cs.HC,cs.AI
Can LLMs Resolve Entity Conflicts in Domain Specific NLU Pipelines?
Resolving entity conflicts is a critical step in Pipeline-based NLU architectures, especially when multiple extractors provide overlapping or conflicting outputs. Traditional rule-based entity conflict resolution methods often lack flexibility and are unscalable. In this work, we aim to study if the broad knowledge of LLMs can be leveraged to resolve entity conflicts in domain specific NLU pipelines. We present an experimental comparison between a traditional rule-based conflict resolution method, and two LLM-based approaches: a multi-shot prompting method using the Llama3.1-8B-Instruct model and a LoRA fine-tuned Llama3.1-8B-Instruct model. The evaluation was conducted under two setups: (1) a broad assessment of LLM's capability to match existing NLU pipeline output, and (2) a more controlled scenario assessing the LLM accuracy on human-labeled data. Results show that while multi-shot prompting offers ease of adaptation and rapid behavioral changes, the fine-tuned model delivers superior performance on complex, ambiguous cases. Ultimately, the best approach appears to be a combination of both strategies, leveraging multi-shot prompting's flexibility alongside the broad accuracy gains of LoRA fine-tuning for a more comprehensive performance.
Updated: 2026-11-19 08:45:09
标题: 大语言模型能否解决领域特定自然语言理解流程中的实体冲突?
摘要: 在基于流水线的自然语言理解(NLU)架构中,实体冲突消解是关键步骤,尤其是在多个提取器提供重叠或相互冲突的输出时。传统的基于规则的实体冲突消解方法通常缺乏灵活性,且难以扩展。在本研究中,我们旨在探究能否利用大型语言模型(LLM)的广泛知识,解决特定领域 NLU 流水线中的实体冲突问题。我们对一种传统的基于规则的冲突消解方法与两种基于 LLM 的方法进行了实验比较:一种是使用 Llama3.1-8B-Instruct 模型的多示例提示方法,另一种是经过 LoRA 微调的 Llama3.1-8B-Instruct 模型。评估在两种设置下进行:(1)全面评估 LLM 匹配现有 NLU 流水线输出的能力;(2)在更受控的场景中,评估 LLM 在人工标注数据上的准确率。结果表明,多示例提示方法易于适配,能够快速改变模型行为;而经过微调的模型在复杂且含义模糊的案例上表现更优。总体而言,最佳方案似乎是结合两种策略:利用多示例提示的灵活性,同时发挥 LoRA 微调带来的广泛准确率提升,从而获得更全面的性能。
更新时间: 2026-11-19 08:45:09
领域: cs.IR,cs.LG
Auto-Alpha: A Framework for Autonomous Factor Research
Autonomous factor research requires generating economic hypotheses as well as implementing and testing them. We present Auto-Alpha, a framework that connects report-guided initialization to self-directed research through a test-driven implementation loop. An idea agent proposes economic mechanisms and signal constructions; a research agent develops them with backtest feedback. Semantic audit, quantitative review, and human admission select factors for a persistent library, while an Experience Library retains research insights. Starting from 120 research reports, Auto-Alpha builds an initial library of 32 factors. It then generates new ideas and refines existing candidates, producing 420 implementations and retaining 62 additional factors. We evaluate factor quality and portfolio performance using a fixed library snapshot of 105 factors. The median 1-day Rank IC is 0.0301, and a weekly Top-300 portfolio returns 16.81% annualized after stated costs over 2020-2026, versus 1.71% for the CSI 1000 price index. These retrospective results document an operating research process and its artifacts; controlled evaluation is needed to isolate the contribution of its components.
Updated: 2026-11-19 08:44:01
标题: Auto-Alpha:自主因子研究框架
摘要: 自主因子研究不仅需要提出经济学假设,还需要对其进行实现与检验。我们提出 Auto-Alpha,这是一个通过测试驱动的实现循环,将报告引导的初始化与自主研究连接起来的框架。创意代理提出经济机制和信号构造方案;研究代理则根据回测反馈对其进行开发。语义审计、定量评审和人工准入共同筛选因子,并将其纳入持续维护的因子库;与此同时,经验库保存研究过程中形成的洞见。从 120 份研究报告出发,Auto-Alpha 构建了一个包含 32 个因子的初始库。随后,它生成新的创意并优化已有候选因子,产出 420 个实现方案,并额外保留 62 个因子。我们使用包含 105 个因子的固定因子库快照,对因子质量和投资组合表现进行评估。1 日 Rank IC 的中位数为 0.0301;在计入文中所述成本后,2020—2026 年期间,按周调仓的 Top-300 投资组合年化收益率为 16.81%,而中证 1000 价格指数为 1.71%。这些回溯性结果记录了一个实际运行的研究流程及其产出;仍需通过受控评估来剥离并确定其中各组成部分的具体贡献。
更新时间: 2026-11-19 08:44:01
领域: q-fin.CP,cs.AI,cs.SE
CGM: Chaos-Guided Graph Attention and Expert Routing for Autism Stereotypy Detection
Skeleton graph attention for autism video analysis weights joints by content alone, giving an erratic wrist the same standing as a still one. Stereotypy, however, is defined by how unpredictably movement unfolds rather than how much of it occurs: in our cohort, every amplitude-based kinematic descriptor falls in stereotyped clips, while windowed Sample Entropy of angular velocity alone rises (Hedges' g = +1.05). We compute this irregularity as a per-joint, per-frame tensor that structurally drives computation. The proposed chaos-guided graph attention and mixture-of-experts model (CGM) couples two mechanisms. First, a learned pairwise term added to the graph-attention logit concentrates attention on irregular joints and re-ranks the remaining edge weight toward jointly irregular pairs; its unconstrained coefficient neither vanishes nor inverts, and zeroing the tensor realigns attention in 94% of clips. Second, a gate conditioned on the same signal routes each frame to two of four experts, whose weights track frame-level irregularity. Under subject-grouped five-fold cross-validation on 116 clips, CGM reaches 0.930 balanced accuracy, exceeding the graph-attention baseline by +0.187; the component ordering replicates on the public MMASD dataset, and on held-out Panoptic Studio sessions, CGM keeps 0.86 specificity without retraining, against at most 0.35 for chaos-free baselines. In ablation, routing without irregularity yields no reliable gain, whereas chaos modulation alone contributes +0.132. A severity index from the same tensor reaches 0.87 split-half reliability, separates the cohorts with Hedges' g = +1.08, and stays consistent within children across therapy recordings, supporting video-only monitoring of stereotypy during intervention.
Updated: 2026-11-19 08:43:17
标题: CGM:用于自闭症刻板行为检测的混沌引导图注意力与专家路由
摘要: 用于自闭症视频分析的骨架图注意力机制仅依据内容为关节赋予权重,使不规则运动的手腕与静止不动的手腕获得同等地位。然而,刻板行为的定义在于运动展开过程的不可预测性,而非运动发生的多少:在我们的队列中,所有基于幅度的运动学描述指标在刻板行为片段中均下降,而仅有角速度的窗口化样本熵上升(Hedges' g = +1.05)。我们将这种不规则性计算为逐关节、逐帧的张量,并以结构化方式驱动计算。所提出的混沌引导图注意力与混合专家模型(CGM)结合了两种机制。首先,在图注意力的 logit 中加入一个学习得到的成对项,使注意力集中于不规则关节,并根据关节对的共同不规则性重新排序其余边权;其无约束系数既未趋于零,也未发生反转,而将该张量置零后,94%的片段中的注意力会重新排列。其次,一个以同一信号为条件的门控机制,将每一帧分配给四个专家中的两个,其权重能够反映帧级不规则性。在对116个片段进行按受试者分组的五折交叉验证中,CGM达到了0.930的平衡准确率,比图注意力基线高出+0.187;在公开的MMASD数据集上,组件排序得到了重复验证;在留出的Panoptic Studio会话中,无需重新训练,CGM仍保持0.86的特异性,而不含混沌信息的基线最高仅为0.35。在消融实验中,不包含不规则性的信息路由未带来可靠增益,而仅采用混沌调制即可贡献+0.132。基于同一张量构建的严重程度指数达到了0.87的分半信度,以Hedges' g = +1.08区分不同队列,并且在同一儿童的不同治疗记录中保持一致,从而支持在干预期间仅通过视频监测刻板行为。
更新时间: 2026-11-19 08:43:17
领域: cs.CV,cs.LG
Verifying Before Enhancing: Target Evidence Chain Verification for Infrared Small Target Detection
Infrared small target detection is essential for early warning, surveillance, remote sensing, and space-based target perception. However, infrared small targets are typically tiny, weakly textured, and boundary-blurred, making them difficult to distinguish from complex backgrounds. Moreover, target-like background structures can produce salient responses across multiple scales, making response strength alone insufficient for reliable target discrimination. To address this challenge, we propose VBE-UNet, a Target Evidence Chain Verification Network that assesses candidate reliability beyond response magnitude through complementary evidence cues. Specifically, counterfactual background explanation models local target evidence, while joint evidence verification integrates cross-scale support and perturbation-based contribution verification to guide feature recomposition. The resulting reliability estimates guide selective feature refinement, promoting target-relevant responses while reducing unsupported background activations. Extensive experiments on IRSTD-1K, NUDT-SIRST, and NUAA-SIRST demonstrate that VBE-UNet achieves superior detection accuracy and lower false-alarm rates compared with state-of-the-art methods. Ablation studies and evidence reliability analysis further validate the effectiveness of the proposed verification framework.
Updated: 2026-11-19 08:40:16
标题: 增强前先验证:面向红外小目标检测的目标证据链验证
摘要: 红外小目标检测对于预警、监视、遥感和空间目标感知至关重要。然而,红外小目标通常尺寸微小、纹理微弱且边界模糊,难以与复杂背景区分。此外,类目标背景结构可能在多个尺度上产生显著响应,使得仅依靠响应强度不足以实现可靠的目标判别。为应对这一挑战,我们提出了 VBE-UNet,即目标证据链验证网络,通过互补的证据线索,在响应幅度之外评估候选目标的可靠性。具体而言,反事实背景解释用于建模局部目标证据,而联合证据验证则整合跨尺度支持信息与基于扰动的贡献验证,以引导特征重组。由此得到的可靠性估计进一步指导选择性特征优化,在增强与目标相关响应的同时,抑制缺乏证据支持的背景激活。在 IRSTD-1K、NUDT-SIRST 和 NUAA-SIRST 数据集上的大量实验表明,与当前先进方法相比,VBE-UNet 取得了更高的检测精度和更低的虚警率。消融实验和证据可靠性分析进一步验证了所提出验证框架的有效性。
更新时间: 2026-11-19 08:40:16
领域: cs.CV,cs.AI
Fast Gauss Sums via Flash Attention
Gauss kernel sums are the computational core of maximum mean discrepancies (MMDs), kernel gradient flows, Stein variational gradient descent (SVGD), and many other kernel methods. At the same time, softmax attention has received an extraordinary amount of hardware-aware code engineering, culminating in FLASH attention. We show that Gauss kernel sums with arbitrary, signed weights can be evaluated via FLASH attention: two small input augmentations turn the normalized softmax reduction into the unnormalized Gauss sum, without writing a single line of custom GPU code. For feature dimension $D>8$ in fp16, this approach beats compiled PyTorch code in speed and memory, and PyKeOps kernels in speed and accuracy at comparable or lower memory. Its memory scaling remains linear.
Updated: 2026-11-19 08:39:00
标题: 通过闪存注意力机制实现快速高斯和
摘要: 高斯核求和是最大均值差异(MMD)、核梯度流、Stein 变分梯度下降(SVGD)以及许多其他核方法的计算核心。与此同时,softmax 注意力机制经过了大量面向硬件的代码工程优化,最终发展出了 FLASH attention。我们证明,任意带符号权重的高斯核求和都可以通过 FLASH attention 进行计算:只需对输入进行两处小幅增广,即可将归一化的 softmax 归约转换为非归一化的高斯求和,且无需编写任何自定义 GPU 代码。对于 fp16 精度下特征维度 $D>8$ 的情况,该方法在速度和内存占用方面优于编译后的 PyTorch 代码;与 PyKeOps 内核相比,在内存占用相当或更低的情况下,其速度更快、精度更高。其内存扩展仍保持线性。
更新时间: 2026-11-19 08:39:00
领域: cs.LG,math.NA
Relax Within, Balance Across: Load Balancing under Composition Shifts in Vision-Language Mixture-of-Experts
Vision-language mixture-of-experts (MoE) models such as Qwen3-VL need balanced loads for fast parallel serving. Standard training pools image and text tokens into one auxiliary loss, assuming training balance holds at inference. Yet we find a surprising mismatch: on a fixed router, balance shifts sharply whenever resolution, dynamic tiling, or image count changes the image-to-text token ratio. Splitting load by modality reveals cross-modal load cancellation: opposing image and text errors cancel near the training ratio, hiding strong skew until the mix changes. To quantify this shift, we derive an exact quadratic law: under fixed modality profiles, one reference run predicts the full response curve, and the image-text gap governs sensitivity. Meanwhile, patches within an image route similarly while patch counts vary, letting large images dominate flat pooling. We propose ReBA (Relax Within, Balance Across) to separate modality losses by token fraction and weight images equally, letting each image specialize while keeping overall visual load even. Across four split backbones, ReBA turns fragile single-ratio balance into stable balance across resolutions, tilings, and image counts without hurting accuracy. Large modality gaps in released native MoEs also show its promise for native post-training. Code is available at https://github.com/ZiangWu-77/ReBA.
Updated: 2026-11-19 08:36:26
标题: 内部松弛,跨域平衡:视觉语言混合专家模型中成分变化下的负载均衡
摘要: 视觉语言混合专家(MoE)模型(如 Qwen3-VL)需要均衡负载,才能实现快速并行服务。标准训练会将图像和文本 token 汇总到一个辅助损失中,默认训练阶段的负载均衡在推理时仍然成立。然而,我们发现了一个令人意外的不匹配:对于固定路由器,只要分辨率、动态切块或图像数量改变了图像与文本 token 的比例,负载均衡就会发生剧烈变化。按模态拆分负载后,我们发现了跨模态负载抵消现象:在接近训练比例时,图像和文本两种模态方向相反的误差会相互抵消,从而掩盖严重的偏斜,直到模态组合发生变化才显现出来。为量化这种变化,我们推导出了一个精确的二次规律:在模态分布特征固定的情况下,一次参考运行即可预测完整的响应曲线,而图像与文本之间的差距决定了敏感度。与此同时,同一图像中的各个图像块往往会以相似方式进行路由,而图像块数量却各不相同,这使得大图像能够在简单的汇总机制中占据主导。为此,我们提出 ReBA(Relax Within, Balance Across,在内部放宽、跨模态均衡),按照 token 占比拆分模态损失,并对图像进行等权处理,使每张图像都能进行专门化,同时保持整体视觉负载均衡。在四个拆分式骨干模型上的实验表明,ReBA 将脆弱的单一比例均衡转变为在不同分辨率、切块方式和图像数量下均稳定的负载均衡,且不会损害准确率。已发布的原生 MoE 模型中存在较大的模态差距,也表明 ReBA 有望应用于原生后训练。代码可见:https://github.com/ZiangWu-77/ReBA。
更新时间: 2026-11-19 08:36:26
领域: cs.CV,cs.AI
MemMend: A Selective Revision Framework for Memory Question Answering
Revising every answer from a long-term memory can consume substantial inference budget and damage facts that were already correct. We introduce MemMend, a modular selective revision framework that routes potentially incomplete answers to an editor, represents corrections as bounded exact-text replacements, and accepts only edits with resolvable source coordinates and valid edit operations. The editor preserves the current answer when no legal repair is proposed; accepted edits require no additional semantic-verification call. On 1,986 LoCoMo development questions, MemMend achieves 67.17 conversation-macro F1 and 88.35 mean Judge score, improving over a verified revision chain by 0.82 and 1.24 points while using 62.37% fewer revision calls. Routing uses 54.15% fewer revision calls than ungated local review, with similar F1 but a 0.67-point lower Judge score. Applied directly to native PropMem, Mem0, and SimpleMem answers, the editing interface raises F1 by 3.79, 6.44, and 0.42 points. It outperforms same-gate rewriting and saves 49.85-83.72% of editing calls relative to ungated editing, which retains higher F1 in this adaptation. A source-by-editing factorial supports local editing for F1 but leaves an independent quality benefit from source obligations unresolved. Transfer to 451 LongMemEval-V2 Small questions also favors revision efficiency, while an external PerLTQA dialogue subset reveals a completeness gap. These results support selective editing as a reusable quality-cost operating point.
Updated: 2026-11-19 08:34:26
标题: MemMend:一种用于记忆问答的选择性修订框架
摘要: 反复修订长期记忆中的每个答案可能会消耗大量推理预算,并损害原本正确的事实。我们提出 MemMend,一种模块化的选择性修订框架:它将可能不完整的答案路由给编辑器,将更正表示为有界的精确文本替换,并且仅接受具有可解析来源坐标和有效编辑操作的修改。当没有提出合法修复方案时,编辑器会保留当前答案;被接受的修改无需额外的语义验证调用。 在 LoCoMo 开发集的 1,986 个问题上,MemMend 达到 67.17 的对话宏平均 F1 和 88.35 的平均 Judge 分数;与经过验证的修订链相比,分别提高 0.82 和 1.24 分,同时减少 62.37% 的修订调用。与无门控的本地审查相比,路由机制减少了 54.15% 的修订调用,F1 相近,但 Judge 分数低 0.67 分。将该方法直接应用于原生 PropMem、Mem0 和 SimpleMem 答案时,编辑接口使 F1 分别提高 3.79、6.44 和 0.42 分。它优于采用相同门控的重写方法,并且相较于无门控编辑节省了 49.85%—83.72% 的编辑调用;不过,在这一适配设置中,无门控编辑保留了更高的 F1。来源与编辑的析因实验支持为提升 F1 采用局部编辑,但来源义务所带来的独立质量收益仍未得到解决。迁移到 451 个 LongMemEval-V2 Small 问题时,结果同样更有利于修订效率;而外部 PerLTQA 对话子集则揭示了完整性方面的差距。这些结果表明,选择性编辑可以作为一种可复用的质量—成本平衡点。
更新时间: 2026-11-19 08:34:26
领域: cs.AI
SteerTrace: Tracing How Target Attacks Steer World Action Models
World action models (WAMs) predict future videos and actions with one backbone, and their imagined future is often seen as a safety signal. We introduce SteerTrace, a targeted universal attack on WAMs that also traces its effect inside the model. One $\ell_\infty$-bounded (4/255) perturbation per model, shared across frames, tasks, and camera views, pushes the executed action toward an attacker-chosen target. On eight WAMs from four families (FastWAM, Faster-WAM, OpenWAM and LingBot-VA) on LIBERO and RoboTwin, it drives task success close to zero and moves the attacked action toward the target. Same-budget noise and BadWAM produce little action shift in the target direction. We use the signed targeted effect to measure how much of the effect each intervention removes or reproduces. Under the standard attack, restoring future tokens removes 61-94% of the targeted effect in the five models whose action experts attend to them. When the attack is constrained to keep the predicted future close to the clean prediction, the targeted effect can become more dependent on current-frame tokens. In three of these five models, restoring current-frame tokens removes 87-99% of the effect, compared with 9-15% for future tokens. In six models, restoring just 0.36% of the FFN neurons in layers 10-29 of the video expert removes 72-96% of the targeted effect. Residual directions 2-16 hold only 11-18% of the shift energy, yet removing them cancels most of the targeted effect.
Updated: 2026-11-19 08:32:45
标题: SteerTrace:追踪目标攻击如何引导世界行动模型
摘要: 世界动作模型(WAM)使用同一个骨干网络预测未来视频和动作,其想象出的未来通常被视为一种安全信号。我们提出 SteerTrace,一种针对 WAM 的定向通用攻击方法,同时能够追踪其在模型内部产生的影响。对于每个模型,仅需施加一个受 \(\ell_\infty\) 范数约束(4/255)的扰动,该扰动在不同帧、任务和摄像机视角之间共享,即可将执行动作推向攻击者指定的目标。在 LIBERO 和 RoboTwin 上对来自四个系列(FastWAM、Faster-WAM、OpenWAM 和 LingBot-VA)的八个 WAM 进行测试时,该方法使任务成功率接近于零,并使受攻击的动作朝目标方向移动。相同预算的噪声和 BadWAM 只能使动作向目标方向发生很小的偏移。我们利用有符号的定向效果来衡量每种干预能够消除或复现多少攻击效果。在标准攻击下,对于五个动作专家会关注未来标记的模型,恢复未来标记可以消除目标效果的 61%–94%。当攻击受到约束,必须使预测的未来接近干净预测时,目标效果可能更多依赖当前帧标记。在这五个模型中的三个模型里,恢复当前帧标记可以消除 87%–99% 的效果,而恢复未来标记只能消除 9%–15%。在六个模型中,仅恢复视频专家第 10–29 层中 0.36% 的 FFN 神经元,就可以消除目标效果的 72%–96%。残差方向 2–16 仅包含 11%–18% 的偏移能量,但移除这些方向却能够抵消大部分目标效果。
更新时间: 2026-11-19 08:32:45
领域: cs.CV,cs.AI
Hardening JavaScript Programs against LLM-Based Vulnerability Detection
JavaScript programs are often distributed as source code, so attackers can analyze them for vulnerabilities. LLM-based vulnerability detection agents now make this analysis much easier. To mitigate this emerging threat, we present AntiAgent, a defense that lets developers harden their programs against such detection agents. AntiAgent transforms a program before release to impede an agent's analysis. To find effective transformations, AntiAgent evolves a corpus of programs with known vulnerabilities and traces how a detection agent analyzes each evolved version. It keeps the versions on which the agent misses or misreports the vulnerability and extracts their transformations into reusable rules. To protect a new program, AntiAgent carefully divides the task between an LLM and the rules, so that the transformations adapt to the program while preserving its semantics. We evaluate AntiAgent on real-world JavaScript applications against four detection agents, including Claude Code and Codex. AntiAgent reduces the number of vulnerabilities that each agent detects by 52.0-60.7%, outperforming the conventional obfuscator JS-Obfuscator and the LLM-based transformation method FPA on every agent. The transformed programs pass all project tests, indicating that AntiAgent preserves the original program semantics. The transformation rules also remain effective on vulnerability types absent from the corpus and on programs written in another language like Python.
Updated: 2026-11-19 08:31:31
标题: 增强 JavaScript 程序以抵御基于大语言模型的漏洞检测
摘要: JavaScript 程序通常以源代码形式分发,因此攻击者可以对其进行分析以发现漏洞。基于大语言模型的漏洞检测代理如今使这种分析变得更加容易。为应对这一新兴威胁,我们提出了 AntiAgent,一种帮助开发者增强程序抵御此类检测代理分析能力的防御方案。AntiAgent 在程序发布前对其进行转换,以阻碍代理的分析。为了寻找有效的转换方式,AntiAgent 演化一组包含已知漏洞的程序,并跟踪检测代理如何分析每个演化版本。它保留代理未能检测出漏洞或错误报告漏洞的版本,并将其中的转换提取为可复用规则。为了保护新程序,AntiAgent 将任务细致地分配给大语言模型和这些规则,使转换能够适应程序,同时保持其语义不变。 我们在真实世界的 JavaScript 应用程序上,针对四种检测代理(包括 Claude Code 和 Codex)评估了 AntiAgent。AntiAgent 使每种代理检测到的漏洞数量减少了 52.0% 至 60.7%,在所有代理上均优于传统混淆器 JS-Obfuscator 和基于大语言模型的转换方法 FPA。经过转换的程序通过了项目的全部测试,表明 AntiAgent 保持了原程序的语义。即使面对语料库中未出现的漏洞类型,以及使用另一种语言(如 Python)编写的程序,这些转换规则仍然有效。
更新时间: 2026-11-19 08:31:31
领域: cs.CR
Survey-aware Machine Learning: A Guideline for Valid Population Health Inference based on Scoping Review
Machine Learning (ML) models trained on complex health surveys such as the National Health and Nutrition Examination Survey (NHANES) often ignore primary sampling units, stratification variables, and sampling weights. This practice violates the independence assumptions of standard evaluation methods. As a result, estimates become biased, uncertainty is underestimated, and fairness assessments fail to reflect population-level disparities. We propose Survey-aware Machine Learning (SaML), a nine-step guideline that incorporates survey design metadata across the ML lifecycle. Through a scoping review of 16 methodological papers, we summarize existing work on weighted model training, design-based cross-validation, and survey-adjusted performance evaluation. We also identify gaps in hyperparameter tuning and deployment. We provide task-specific guidance that clarifies which steps are required for different analytical objectives. SaML provides a checklist for valid population inference from survey data.
Updated: 2026-11-19 08:31:22
标题: 考虑调查设计的机器学习:基于范围综述的有效人群健康推断指南
摘要: 在美国国家健康与营养调查(NHANES)等复杂健康调查数据上训练的机器学习(ML)模型,通常会忽略主要抽样单位、分层变量和抽样权重。这种做法违背了标准评估方法中的独立性假设。因此,所得估计会产生偏倚,不确定性会被低估,公平性评估也无法反映总体层面的差异。我们提出了调查感知机器学习(SaML),这是一套九步指南,将调查设计元数据纳入机器学习的整个生命周期。通过对16篇方法学论文进行范围综述,我们总结了现有关于加权模型训练、基于设计的交叉验证以及调查调整后的性能评估等方面的研究工作。我们还指出了超参数调优和模型部署方面的不足。针对不同任务,我们提供了具体指导,明确不同分析目标所需的步骤。SaML为利用调查数据进行有效总体推断提供了一份核对清单。
更新时间: 2026-11-19 08:31:22
领域: stat.ML,cs.LG
Safeguarded Learning-Assisted Nonlinear Conjugate Gradient Methods
A learning-assisted framework for Nonlinear Conjugate Gradient (NCG) methods is developed in which lightweight online prediction is used to support, rather than replace, the classical optimization process. The proposed approach retains the standard two-term NCG structure and introduces two independent online extreme learning machine models. The first model predicts an NCG coefficient during restart recovery or when persistent stagnation is detected, whereas the second model is used only after a line-search failure in finite precision arithmetic to propose a bounded correction to the deterministic fallback step size. Neural predictions are accepted only when they satisfy deterministic numerical safeguards, including descent, scale, and out-of-distribution requirements; otherwise, the corresponding deterministic recovery or fallback mechanism is retained. Both learning models are updated online using quantities already generated along the optimization trajectory and therefore require no additional function or gradient evaluations for training. These learning frameworks are applied to six well-known classical NCG methods, producing corresponding low-storage learning-assisted variants with deterministic safeguards. Numerical experiments on 480 CUTEst test problems show improved robustness for all six variants at broadly comparable evaluation costs. A PDE-constrained conductivity-identification example further illustrates the potential of the proposed approach to reduce evaluation costs and computational time for problems with expensive function and gradient evaluations. These findings suggest that restricted online learning can improve the robustness and computational performance of classical NCG methods while preserving their low-storage structure and deterministic optimization safeguards, and is particularly promising when function or gradient evaluations are expensive.
Updated: 2026-11-19 08:20:19
标题: 安全保障的学习辅助非线性共轭梯度法
摘要: 提出了一种用于非线性共轭梯度(NCG)方法的学习辅助框架,其中采用轻量级在线预测来支持而非取代经典优化过程。该方法保留了标准的两项式 NCG 结构,并引入两个相互独立的在线极限学习机模型。第一个模型在重启恢复期间或检测到持续停滞时预测 NCG 系数;第二个模型仅在线搜索于有限精度算术中失败后使用,用于对确定性回退步长提出有界修正。只有当神经网络预测满足确定性的数值安全要求,包括下降性、尺度以及分布外要求时,才会接受这些预测;否则保留相应的确定性恢复或回退机制。两个学习模型均利用优化轨迹中已经产生的量进行在线更新,因此训练无需额外的函数或梯度评估。该学习框架应用于六种经典的著名 NCG 方法,形成了相应的、带有确定性安全机制的低存储学习辅助变体。在 480 个 CUTEst 测试问题上的数值实验表明,六种变体均具有更好的稳健性,同时评估成本总体上大致相当。一个受偏微分方程约束的电导率识别实例进一步展示了该方法在函数和梯度评估代价高昂的问题中降低评估成本和计算时间的潜力。这些结果表明,受限在线学习能够在保留经典 NCG 方法低存储结构和确定性优化安全机制的同时,提高其稳健性和计算性能;当函数或梯度评估代价较高时,该方法尤其具有应用前景。
更新时间: 2026-11-19 08:20:19
领域: math.OC,cs.LG
STARK: Moving towards Personalized Agents That Truly Learn and Remember
Long-term memory is essential for personalized agentic systems that interact with users over long time periods, yet current architectures only capture what happened while leaving the reasoning of why it happened to be derived later by underlying LLMs.%, and silo knowledge within individual users. These events can, however, convey not only what a user experienced but also how that experience shaped their behavioral patterns. We introduce STARK, a dual-graph memory architecture which treats these events not just as nodes but also as edges between behavioral insights. STARK maintains an Episodic Graph which records interactions as temporally, causally, and semantically linked episodes; and an Insight Graph which represents LLM-extracted behavioral signals scored by how many events support them, connected by the very events that led to them. At inference, behavioral knowledge is retrieved directly from insight nodes grounded by event-as-edges, eliminating repeated episodic traversal. The event-as-edge structure also naturally enables projecting the knowledge graph into a relational embedding space where cross-user transfer becomes possible under shared contextual circumstances, allowing the system to infer missing insights for cold-start users. Evaluations show that STARK improves by 1.48 judge score on LongMemEval information extraction and 0.93 on LoCoMo open domain questions over state of the art. On the public LongLaMP abstract-generation benchmark, cross-user transfer improves open-ended judge scores by 0.7 points and ROUGE-L by 3 at 5% graph sparsity.
Updated: 2026-11-19 08:19:28
标题: STARK:迈向真正能够学习和记忆的个性化智能体
摘要: 长期记忆对于与用户长期互动的个性化智能体系统至关重要,然而当前的架构只能记录发生了什么,而将发生原因的推理留待底层大语言模型之后再行推导,并且将知识局限于单个用户之内。事实上,这些事件不仅能够传达用户经历了什么,还能反映这些经历如何塑造了用户的行为模式。我们提出 STARK,一种双图记忆架构,将这些事件不仅视为节点,也视为行为洞见之间的边。STARK 维护一个情景图,用于记录在时间、因果和语义上相互关联的交互片段;同时维护一个洞见图,用于表示由大语言模型提取的行为信号,并根据支持这些信号的事件数量为其评分,再通过促成这些洞见的事件将它们连接起来。在推理时,系统直接从由事件边提供依据的洞见节点中检索行为知识,从而避免重复遍历情景。事件作为边的结构还能够自然地将知识图谱投影到关系嵌入空间中,使系统得以在共享上下文条件下实现跨用户迁移,并据此为冷启动用户推断缺失的洞见。评估结果显示,与当前最先进的方法相比,STARK 在 LongMemEval 信息抽取任务上的评审得分提高了 1.48 分,在 LoCoMo 开放域问题上的得分提高了 0.93 分。在公开的 LongLaMP 摘要生成基准测试中,当图稀疏度为 5% 时,跨用户迁移使开放式评审得分提高了 0.7 分,ROUGE-L 提高了 3 分。
更新时间: 2026-11-19 08:19:28
领域: cs.CL,cs.AI,cs.IR
From Geographic Memory to Spatial Generalization in Large Language Models
Large language models (LLMs) can associate places with geographic descriptions, but recovering an observed association does not establish an ability to generalize across geographic space. We distinguish geospatial memory, the recovery of location--description associations observed during training, from spatial generalization, the prediction of descriptions for locations in unobserved regions. We investigate whether continuous location representations improve this generalization and encourage geographic knowledge to become spatially organized within an LLM. We frame this organization as a latent spatial field: a learned mapping from locations to descriptions connected through spatial dependencies. Building on a continuous spatial encoder, we project location representations into the model's embedding space and supply them as spatial tokens. We evaluate the resulting models on two newly curated geo-text benchmarks for Los Angeles and London using two complementary assessments. Geospatial captioning tests both memory and spatial generalization by generating descriptions at observed locations and at locations beyond the spatial coverage of the training observations. A separate geospatial grounding model tests whether generated location--description pairs provide useful additional supervision for mapping text to geographic space. Across multiple LLM families, continuous location representations improve captioning at unobserved locations relative to textual coordinates, while their generated descriptions yield modest but consistent improvements in downstream grounding. Layer-wise probing and representation clustering provide additional evidence consistent with spatially organized geographic representations. Together, these findings show the value of evaluating spatial generalization separately from memory and of incorporating continuous spatial representations into language models.
Updated: 2026-11-19 08:18:16
标题: 从地理记忆到大型语言模型的空间泛化
摘要: 大型语言模型(LLM)能够将地点与地理描述联系起来,但恢复一个已观察到的关联,并不能证明其具备跨地理空间进行泛化的能力。我们将地理空间记忆与空间泛化区分开来:前者是恢复训练期间观察到的位置—描述关联,后者则是为未被观察区域中的位置预测描述。我们研究连续位置表示是否能够改善这种泛化能力,并促使地理知识在大型语言模型内部形成空间组织。我们将这种组织形式化为一个潜在空间场:一种将位置映射到描述、并通过空间依赖关系相互连接的学习映射。 在连续空间编码器的基础上,我们将位置表示投射到模型的嵌入空间中,并将其作为空间标记提供给模型。我们使用针对洛杉矶和伦敦新近构建的两个地理文本基准数据集,通过两种互补的评估方式对所得模型进行测试。地理空间描述生成同时检验记忆能力和空间泛化能力:模型需要在已观察位置以及超出训练观测空间覆盖范围的位置生成描述。另一种独立的地理空间定位模型则用于检验生成的位置—描述对,是否能够为将文本映射到地理空间提供有用的额外监督。 在多个大型语言模型系列中,与文本坐标相比,连续位置表示能够提升模型在未观察位置上的描述生成表现;同时,模型生成的描述还能在下游定位任务中带来幅度不大但稳定一致的改进。分层探测和表示聚类进一步提供了与空间组织化地理表示相一致的证据。总体而言,这些发现表明,有必要将空间泛化与记忆能力分开评估,并将连续空间表示纳入语言模型之中。
更新时间: 2026-11-19 08:18:16
领域: cs.CL,cs.AI,cs.LG
ProtoSeam: Lifting Classifier Training with Latent Gaussian Mixture Models
We propose a lifted reformulation of supervised classification that improves the final accuracy of standard classifiers without changing the architecture at inference time. A network $N=N_2\circ N_1$ is split at a single semantic interface and one learnable prototype per class is inserted there. Training combines a quadratic consensus penalty that pulls $N_1(x)$ toward the prototype of its class with a classification loss of $N_2$ evaluated on samples drawn around the prototypes, while no gradient crosses the interface. At inference the prototypes are discarded and the unmodified network $N_2\circ N_1$ is used. Across CIFAR-10, CIFAR-100, and TinyImageNet with ResNet and vision transformer backbones, lifted training improves test accuracy by up to six percentage points over variants without lifting under a shared tuning protocol. Moreover, we provide theoretical justification of those results.
Updated: 2026-11-19 08:18:14
标题: ProtoSeam:利用潜在高斯混合模型提升分类器训练
摘要: 我们提出了一种监督分类的提升式重构方法,在不改变推理阶段标准分类器架构的情况下提高其最终准确率。我们在单个语义接口处将网络 \(N=N_2\circ N_1\) 拆分开,并在该处为每个类别插入一个可学习的原型。训练过程结合了二次一致性惩罚项和分类损失:前者将 \(N_1(x)\) 拉向其所属类别的原型,后者则在从原型周围采样的样本上评估 \(N_2\);同时,没有梯度跨越该接口。在推理阶段,原型被丢弃,使用未修改的网络 \(N_2\circ N_1\)。在 CIFAR-10、CIFAR-100 和 TinyImageNet 数据集上,采用 ResNet 和视觉 Transformer 作为骨干网络,并在统一调参协议下进行比较,提升式训练相较于未采用提升方法的变体,最高可将测试准确率提高六个百分点。此外,我们还为这些结果提供了理论依据。
更新时间: 2026-11-19 08:18:14
领域: cs.LG
Weight Space Programming for Vision Language Model Repair
In weight-space programming, a language model edits a network's weights directly, without gradients. We ask what a successful repair of this kind relies on. We plant faults in the weights of two vision-language models, SmolVLM-256M and LFM2-VL-450M, and check each edit made by a coding agent against the original weights. Without being told where to look, the agent finds rescaled projector rows and noise in the vision encoder, infers the unknown scale factors, and returns most or all of the rescaled weights to their exact original values and accuracy to near its original level. These repairs depend on a trace of how the faults were computed. The original weights have 16-bit precision, and faults computed in 32-bit arithmetic leave low bits that only the damaged weights carry, a cue that a real failure need not leave. When we round those bits away, each model answers our test questions as before, but the agent, unaided, no longer repairs either model: on LFM2-VL accuracy recovers by about 4 points, against 17 from the unrounded weights. Marking the damaged weights again in their low bits brings the edits back to them. Rounded weights still hold statistical evidence of the rescaling. On SmolVLM the agent uses it once a sentence in the prompt, which we wrote knowing the fault, names such a statistic; on LFM2-VL, whose scale factors are larger, most sessions find the rescaled rows unaided, but none finds the noise. Swapped rows or columns, which keep the set of stored values, are not found unaided on either model within our budgets. We recommend that studies of weight repair report the number format of the weights and include a rounded control.
Updated: 2026-11-19 08:12:10
标题: 用于视觉语言模型修复的权重空间编程
摘要: 在权重空间编程中,语言模型直接编辑网络权重,而不使用梯度。我们探究这种修复能否成功依赖于哪些因素。我们在两个视觉语言模型 SmolVLM-256M 和 LFM2-VL-450M 的权重中植入故障,并将编码代理所做的每次编辑与原始权重进行比对。在未被告知应从何处查找的情况下,该代理发现了投影器中的缩放行以及视觉编码器中的噪声,推断出未知的缩放因子,并将大部分或全部经过缩放的权重恢复为精确的原始值,使准确率接近原始水平。这些修复依赖于故障生成过程留下的痕迹。原始权重采用 16 位精度,而以 32 位算术计算出的故障会留下只有受损权重携带的低位信息,这种线索并非真实故障必然会留下的。将这些低位舍入掉后,两个模型在测试问题上的回答仍与之前相同,但代理在没有辅助的情况下不再修复任一模型:在 LFM2-VL 上,准确率恢复约 4 个百分点,而未舍入权重可恢复 17 个百分点。再次在低位中标记受损权重后,代理又能发现这些编辑。经过舍入的权重仍保留有关缩放的统计证据。在 SmolVLM 上,当提示中的一句话——我们是在知晓故障的情况下写下这句话的——提到这类统计量时,代理曾利用过该证据一次;在缩放因子更大的 LFM2-VL 上,大多数会话无需辅助便能找到经过缩放的行,但没有一次找到噪声。在两个模型上,在我们的预算范围内,未经辅助的代理都未能发现行或列的置换,尽管这类置换保留了所存储值的集合。我们建议,关于权重修复的研究应报告权重的数值格式,并纳入一个经过舍入的对照组。
更新时间: 2026-11-19 08:12:10
领域: cs.CV,cs.AI
Achieving Near-Zero-Overhead Multi-Model Hierarchical Classification in Real-Time Detection Pipelines
Edge-deployed vision systems in target recognition, surveillance, autonomous vehicles, and drone domains require hierarchical inference pipelines where a detection model identifies objects of interest and downstream classifiers provide fine-grained attribute analysis. Running all models on the GPU creates a serial bottleneck that limits real-time throughput as pipeline stages grow. Modern edge SoCs pair GPUs with dedicated neural accelerators (NPUs, DLAs) capable of concurrent execution, yet deploying custom models on these accelerators remains impractical due to strict operator constraints, quantization incompatibilities, and an undocumented end-to-end pipeline. We target NVIDIA Jetson DLA cores as the representative platform. We present a five-step methodology for zero GPU fallback DLA INT8 deployment of classification backbones, comprising architecture adaptation, manual dynamic range workaround to rescue TensorRT's implicit quantization (recovering 94.0% accuracy from implicit quantization's 75%) for rapid pipeline validation before explicit quantization, quantization-aware training, ONNX graph surgery for DLA compilation, and a concurrent GPU-detection/DLA-classification inference pipeline. We document nine engineering constraints with root-cause analysis and generalizable solutions. Validation on a dual-head person attribute classifier running on DLA alongside a GPU object detector on a Jetson Orin NX demonstrates near-zero pipeline overhead (12.5 vs. 13.3~FPS detector-only at 1080p), with dual-DLA scaling at no additional cost. The methodology is backbone-agnostic and generalizes to any detection-classification edge pipeline.
Updated: 2026-11-19 08:11:18
标题: 在实时检测流水线中实现近乎零开销的多模型分层分类
摘要: 部署于边缘设备的视觉系统广泛应用于目标识别、监控、自动驾驶车辆和无人机等领域。这些系统需要采用分层推理流水线:检测模型负责识别目标对象,下游分类器则进行细粒度的属性分析。随着流水线阶段不断增加,将所有模型运行在 GPU 上会形成串行瓶颈,从而限制实时吞吐量。现代边缘 SoC 通常将 GPU 与能够并发执行的专用神经网络加速器(NPU、DLA)结合使用,然而,由于严格的算子限制、量化不兼容问题,以及端到端流水线缺乏公开文档,在这些加速器上部署自定义模型仍不切实际。本文以 NVIDIA Jetson DLA 核心为代表性平台。 我们提出了一套五步方法,用于在 DLA 上实现分类骨干网络的 INT8 部署,并确保完全不回退到 GPU。该方法包括:架构适配;手动动态范围处理,以解决 TensorRT 隐式量化问题——在进行显式量化之前,先将隐式量化导致的 75% 准确率恢复至 94.0%,从而实现快速流水线验证;量化感知训练;通过 ONNX 图修改实现 DLA 编译;以及 GPU 检测与 DLA 分类并发执行的推理流水线。我们记录了九项工程约束,分析其根本原因,并提出具有普适性的解决方案。 在 Jetson Orin NX 上进行的验证表明:一个运行于 DLA 的双头行人属性分类器可与运行于 GPU 的目标检测器并行工作,流水线开销几乎为零(在 1080p 分辨率下,检测器单独运行时为 13.3 FPS,并行运行时为 12.5 FPS);同时,使用双 DLA 进行扩展无需额外成本。该方法与具体骨干网络无关,可推广至任意检测—分类边缘计算流水线。
更新时间: 2026-11-19 08:11:18
领域: cs.CV,cs.DC,cs.LG
DMT-Attack: Diffusion-Prior Texture Search for Closed-Loop Vision-Language-Action Policies
Vision-language-action (VLA) policies rely on visual feedback throughout manipulation, making them vulnerable to persistent texture attacks. However, optimized patterns can stand out from their surroundings, making an attack easier to notice and its carrier more likely to be inspected or removed. To address this limitation, our key insight is to search the structured image distribution of a diffusion model for natural-looking textures while using closed-loop feedback to identify task-disruptive candidates. Based on this idea, we propose DMT-Attack, a gradient-free gray-box attack that generates textures for ordinary scene objects such as tablecloths. A frozen text-conditioned diffusion model defines the search space, and an eight-expert latent proposal network is initialized from evaluated teacher latents and refined using rollout feedback. We evaluate DMT-Attack against pi_0.5 and OpenVLA-OFT across four LIBERO suites. DMT-Attack achieves a macro clean-conditioned attack success rate (cASR) of 57.9%, compared with 44.7% for UPA-RFAS and 19.7% for random natural textures. It also attains higher scene similarity and a lower clean-calibrated detector flag rate (45% versus 97.5-100% for optimized patch baselines). These results demonstrate that natural-looking textures can disrupt VLA visual feedback and closed-loop decision-making, motivating defenses that jointly assess visual appearance and task behavior.
Updated: 2026-11-19 08:09:25
标题: DMT-Attack:面向闭环视觉-语言-动作策略的扩散先验纹理搜索
摘要: 视觉—语言—动作(VLA)策略在整个操作过程中依赖视觉反馈,因此容易受到持久性纹理攻击的影响。然而,经过优化的图案可能会与周围环境形成明显差异,使攻击更容易被察觉,其载体也更可能遭到检查或移除。为解决这一局限,我们的关键思路是:在扩散模型的结构化图像分布中搜索具有自然外观的纹理,同时利用闭环反馈识别会干扰任务的候选纹理。基于这一思路,我们提出了 DMT-Attack,这是一种无梯度灰盒攻击方法,可为桌布等普通场景物体生成纹理。一个冻结的文本条件扩散模型定义了搜索空间;一个由八个专家组成的潜变量提议网络则根据已评估的教师潜变量进行初始化,并利用 rollout 反馈加以优化。我们在四个 LIBERO 套件上,针对 pi_0.5 和 OpenVLA-OFT 对 DMT-Attack 进行了评估。DMT-Attack 的宏平均干净条件攻击成功率(cASR)达到 57.9%,而 UPA-RFAS 为 44.7%,随机自然纹理为 19.7%。此外,该方法还取得了更高的场景相似度,以及更低的经干净样本校准的检测器告警率(45%,而优化补丁基线为 97.5%–100%)。这些结果表明,具有自然外观的纹理能够干扰 VLA 的视觉反馈与闭环决策过程,也说明有必要设计同时评估视觉外观和任务行为的防御机制。
更新时间: 2026-11-19 08:09:25
领域: cs.AI
Kairos: A Unified PDDL Planner for Robots: Plans in Milliseconds, with a Guarantee for Every Answer
Robots that plan while they act need a task planner that reads the models their designers write, answers within milliseconds, and says what each answer means. Models are written in the Planning Domain Definition Language (PDDL), which has grown from classical planning to durative actions, numeric resources, time windows and continuous change, while planners cover one fragment each and differ in what their failures mean. The contribution in artificial intelligence is Kairos, a single planner, not a portfolio of existing planners, that covers the whole language and derives what each answer guarantees from the search that produced it. We prove when the exhaustion of a search shows that no plan exists, and give a relaxation of temporal tasks that proves unsolvability where temporal search cannot. For the compression of durative actions, we give a criterion on the values that actions read, prove that compression is sound, and show that it is not complete, so its failure is never reported as a proof. An independent validator checks every plan. The engineering application is on-line task planning for robots: Kairos is open source, packaged for the Robot Operating System, and the default planner of a widely used planning framework. On 1,756 public tasks from nine suites, Kairos solves more tasks than the strongest evaluated planner of each suite within 100 milliseconds, 1 second and 30 seconds; it proves ten of eleven unsolvable tasks, and handles each of the seventeen language features probed, where no other planner handles more than eight.
Updated: 2026-11-19 08:08:56
标题: Kairos:统一的机器人 PDDL 规划器:毫秒级生成计划,并为每个答案提供保证
摘要: 需要在行动过程中进行规划的机器人需要一种任务规划器:能够读取设计者编写的模型,在毫秒级时间内给出答案,并说明每个答案的含义。模型采用规划领域定义语言(PDDL)编写。PDDL 已从经典规划发展到涵盖持续动作、数值资源、时间窗口和连续变化,而现有规划器通常各自只覆盖其中的一个片段,并且对其失败结果的含义也各不相同。人工智能领域的这项工作提出了 Kairos:一个统一的规划器,而不是由现有规划器组成的组合系统。Kairos 覆盖完整语言,并根据产生答案的搜索过程推导出每个答案所提供的保证。我们证明了在何种情况下,搜索空间耗尽可以表明不存在计划;同时给出了一种对时序任务的松弛方法,即使时序搜索无法证明无解,该方法也能证明任务不可解。对于持续动作的压缩,我们针对动作所读取的值给出一个判据,证明压缩是可靠的,并表明它并不完备,因此压缩失败绝不会被报告为一种证明。一个独立的验证器会检查每个计划。其工程应用是机器人的在线任务规划:Kairos 已开源,以机器人操作系统(ROS)的形式打包发布,并作为一个广泛使用的规划框架的默认规划器。在来自九个测试套件的 1,756 个公开任务上,在 100 毫秒、1 秒和 30 秒的时间限制内,Kairos 解决的任务数都超过了每个测试套件中所评估的最强规划器;它证明了 11 个不可解任务中的 10 个无解,并且能够处理所测试的 17 种语言特性,而其他任何规划器处理的特性都不超过 8 种。
更新时间: 2026-11-19 08:08:56
领域: cs.AI,cs.RO
Measurable Does Not Imply Transportable: A Prospective Audit of Model Explanations in Multi-Year Field Trials
Model explanations are increasingly used as scientific evidence, yet it remains unclear what they license scientists to conclude beyond the data on which they were constructed. When a fine-grained explanation fails to replicate, the failure may be attributed to noisy measurement of its target, raising a fundamental question: does reliable measurement imply a reproducible explanation? We test this directly. We formalize prospective explanation transportability: the extent to which an explanation learned from past data is recovered in a genuinely future context. This property is distinct from feature importance and measurement reliability. Using multi-year Genomes-to-Fields maize trials, where each new year is a real future context rather than a random resample, we evaluate 16 agronomically interpretable environmental concepts across five forward splits and one prospectively locked test year. Coarse environment-level explanations transport reliably (median cosine 0.83); their locked 2024 value, 0.811, fell within a prespecified 80% bootstrap percentile interval. For grain yield, genotype-conditioned explanations have a historical median cosine of 0.30 and range from 0.006 to 0.822 across years. Reliability does not order these outcomes: the year with the highest split-half reliability had the lowest explanation transport. Within-context resampling showed that GxE explanations were reproducible within a fixed context (0.77-0.95) while exhibiting lower prospective alignment across the 2020-2023 transitions (0.01-0.36). A second phenotype transports strongly at both resolutions, and non-temporal validation inflates apparent interaction-level transport by +0.22. These results show that target reliability and within-context explanation reproducibility do not by themselves establish when a model explanation can support a reproducible scientific claim.
Updated: 2026-11-19 08:08:20
标题: 可测量并不意味着可迁移:对多年现场试验中模型解释的前瞻性审计
摘要: 模型解释正日益被用作科学证据,但人们仍不清楚,除了解释所依据的数据之外,它究竟允许科学家得出哪些结论。当一个细粒度解释未能复现时,这种失败可能被归因于对其目标的测量存在噪声,由此引出一个根本问题:可靠的测量是否意味着可复现的解释?我们对此进行了直接检验。我们对前瞻性解释迁移性进行了形式化定义:即从过去数据中学习到的解释在真正未来情境中被恢复的程度。这一性质不同于特征重要性和测量可靠性。我们利用多年开展的 Genomes-to-Fields 玉米试验进行评估。在这些试验中,每个新年份都是真正的未来情境,而不是随机重采样。我们在五个前向划分和一个前瞻性锁定的测试年份中,评估了16个具有农学可解释性的环境概念。粗粒度的环境层面解释具有可靠的迁移性(余弦相似度中位数为0.83);其锁定的2024年数值为0.811,处于预先设定的80%自助法百分位区间内。对于籽粒产量,基因型条件化解释的历史余弦相似度中位数为0.30,在不同年份间的范围为0.006至0.822。可靠性无法对这些结果进行排序:划分半信度最高的年份,其解释迁移性反而最低。在情境内重采样中,G×E解释在固定情境内具有较高的可复现性(0.77至0.95),但在2020年至2023年的时间转移中,其前瞻性一致性较低(0.01至0.36)。另一种表型在两种分辨率下都表现出很强的迁移性,而非时间验证则使表观的交互层面迁移性膨胀了0.22。这些结果表明,目标的可靠性和情境内解释的可复现性本身,并不能确定模型解释何时能够支持可复现的科学论断。
更新时间: 2026-11-19 08:08:20
领域: cs.LG
Persistent Sparse Autoencoders: Learning Feature-Specific Timescales in Language Model Representations
Sparse autoencoders (SAEs) decompose language model activations into sparse features, yet these models traditionally encode each token independently, failing to expose information that persists across a sequence. We first show that temporal persistence can naturally emerge in standard SAE features: after a feature activates, the hidden state remains aligned with its direction, and past activations reduce the reconstruction error of later hidden states. How long this lasts varies widely across features. We therefore introduce Persistent Sparse Autoencoders (Persistent SAEs), an extension of standard SAEs that learns a persistence coefficient for each feature, allowing feature-specific timescales to emerge from reconstruction. Our experiments show that Persistent SAEs retain competitive reconstruction quality while learning a spectrum of timescales: short-timescale (fast) features remain locally interpretable, whereas long-timescale (slow) features accumulate higher-level contextual information. Moreover, we show in a prompt-injection monitoring case study that slow features retain injection signals over long contexts and causally affect monitor judgements. These results suggest that Persistent SAEs offer new opportunities for interpreting and monitoring language models via persistent features.
Updated: 2026-11-19 08:02:31
标题: 持久稀疏自编码器:在语言模型表征中学习特征特异性时间尺度
摘要: 稀疏自编码器(SAE)将语言模型的激活分解为稀疏特征,但这类模型传统上独立编码每个词元,无法揭示在序列中持续存在的信息。我们首先表明,时间持久性可以自然地出现在标准 SAE 特征中:某个特征激活后,隐藏状态仍会与其方向保持一致,并且先前的激活会降低后续隐藏状态的重构误差。这种持续的时长在不同特征之间存在很大差异。因此,我们提出持久性稀疏自编码器(Persistent Sparse Autoencoders,Persistent SAEs),这是标准 SAE 的一种扩展,为每个特征学习一个持久性系数,使特定于特征的时间尺度能够从重构过程中自然涌现。实验表明,Persistent SAEs 在保持具有竞争力的重构质量的同时,能够学习出一系列时间尺度:短时间尺度(快速)特征仍然具有局部可解释性,而长时间尺度(慢速)特征则会积累更高层次的上下文信息。此外,我们通过一个提示注入监测案例研究表明,慢速特征能够在较长上下文中保留注入信号,并对监测器的判断产生因果影响。这些结果表明,Persistent SAEs 可通过持久性特征为解释和监测语言模型提供新的机遇。
更新时间: 2026-11-19 08:02:31
领域: cs.LG,cs.CL
TipDex-VTLA: Learning When to Refine Actions with Touch for Dexterous Manipulation
Changes in illumination can induce action drift in dexterous manipulation even when the physical state remains unchanged. Although existing vision--tactile--language--action (VTLA) policies incorporate tactile feedback, when and how touch refines actions under changing visual conditions remains challenging. We introduce \textbf{TipDex-VTLA}, a VTLA policy that combines estimated visual action reliability and tactile forecast verification to regulate execution-time refinement. Specifically, Visual Action Sensitivity Estimation (VASE) learns visual reliability from a frozen reference policy's action sensitivity to illumination perturbations. Tactile Anticipation and Correction during Execution (TACE) compares predicted and measured touch at matched times and combines the resulting discrepancy with visual reliability to gate bounded feature corrections for unexecuted actions. This effectively helps to refine actions under challenging unseen visual conditions. We evaluate TipDex-VTLA on four real-world dexterous manipulation tasks and the UniVTAC simulation benchmark. TipDex-VTLA trained on data collected under normal visual conditions, achieves average full-task success rates of 87.5% (resp. 73.8%) under normal (resp. challenging unseen) lighting in real-world tasks, significantly outperforming some state-of-the-art methods. We will release the collected data and source code.
Updated: 2026-11-19 08:01:59
标题: TipDex-VTLA:学习何时利用触觉精化灵巧操作动作
摘要: 光照变化可能导致灵巧操作中的动作漂移,即使物理状态保持不变。尽管现有的视觉—触觉—语言—动作(VTLA)策略已融入触觉反馈,但在视觉条件变化时,触觉何时以及如何对动作进行修正仍然具有挑战性。我们提出 TipDex-VTLA,一种结合视觉动作可靠性估计与触觉预测验证、以调节执行时动作修正的 VTLA 策略。具体而言,视觉动作敏感性估计(VASE)通过学习冻结参考策略对光照扰动的动作敏感性,获得视觉可靠性。执行期间的触觉预期与修正(TACE)在匹配的时间点比较预测触觉与实测触觉,并将所得差异与视觉可靠性相结合,从而为尚未执行的动作控制有界特征修正。这能够有效帮助策略在具有挑战性的未见视觉条件下修正动作。我们在四项真实世界灵巧操作任务和 UniVTAC 仿真基准上评估了 TipDex-VTLA。在正常视觉条件下采集的数据上训练的 TipDex-VTLA,在真实世界任务的正常光照和具有挑战性的未见光照条件下,平均完整任务成功率分别达到 87.5% 和 73.8%,显著优于部分最先进方法。我们将发布所采集的数据和源代码。
更新时间: 2026-11-19 08:01:59
领域: cs.RO,cs.AI
Explainability of genotype embedding models through observed cohort paths
Deep learning models that combine genotypes with neuroimaging predict neurological diseases more accurately than either modality alone. Their clinical use, however, requires identifying which genetic variants a prediction is based on. Path-based attribution methods like Integrated Gradients address this by integrating the model's gradient from a baseline to the input. These methods assume the model accepts any point along that path as a valid input. Genotype models violate this assumption. They map the three discrete allele dosages \{0,1,2\} to vectors through a learned embedding defined only at those values, so a straight line passes through fractional genotypes at which no embedding, and therefore no gradient, exists. Attribution must therefore proceed in embedding space where the choice of path can affect the resulting attribution. We show that the commonly used per-variant estimator does not generally satisfy completeness. Additive separability guarantees completeness for this estimator, but interactions between variants generally break that property. Instead, we integrate along piecewise-linear embedding-space paths connecting genotype waypoints observed in the training cohort. Each path satisfies completeness in the continuum although the interiors of its segments are not necessarily observed. Our method improves faithfulness over Integrated Gradients and discretized Integrated Gradients under both perturbation protocols, achieves the strongest results for Parkinson's disease classification under support-preserving perturbations, and is competitive with a support-background Shapley baseline under per-variant perturbations. It also shows higher seed stability and better recovery of planted non-additive effects in a synthetic benchmark.
Updated: 2026-11-19 08:00:38
标题: 通过观测队列路径解释基因型嵌入模型
摘要: 将基因型与神经影像相结合的深度学习模型,比单独使用任一模态更准确地预测神经系统疾病。然而,要在临床中应用这些模型,必须确定预测所依据的遗传变异。基于路径的归因方法(如积分梯度)通过对从基线到输入的模型梯度进行积分来解决这一问题。这些方法假设模型能够接受路径上的任意点作为有效输入。基因型模型违背了这一假设。它们将三个离散的等位基因剂量值 {0,1,2} 通过一个仅在这些取值处定义的学习嵌入映射为向量,因此直线路径会经过分数型基因型,而在这些位置不存在嵌入,因而也不存在梯度。因此,归因必须在嵌入空间中进行,而路径的选择可能影响最终的归因结果。我们表明,常用的逐变异估计量通常不满足完备性。加性可分性能够保证该估计量满足完备性,但变异之间的相互作用通常会破坏这一性质。为此,我们沿着连接训练队列中观测到的基因型途经点的分段线性嵌入空间路径进行积分。尽管这些路径各线段的内部点不一定被观测到,但每条路径在连续意义下都满足完备性。在两种扰动方案下,我们的方法相比积分梯度和离散化积分梯度都提高了忠实性;在保持支持集的扰动下,其帕金森病分类结果最为突出;在逐变异扰动下,其表现可与基于支持集背景的沙普利基线方法相媲美。此外,在合成基准测试中,该方法表现出更高的随机种子稳定性,并且能够更好地恢复预先植入的非加性效应。
更新时间: 2026-11-19 08:00:38
领域: cs.LG
Beyond Entity Recognition: Vision-Centric Knowledge Visual Question Answering
We propose VC-VQA, a large-scale benchmark for vision-centric knowledge reasoning, aiming to systematically evaluate the capabilities of Multimodal Large Language Models (MLLMs) in fine-grained visual knowledge acquisition and complex multi-stage reasoning. Unlike existing benchmarks that primarily treat visual information as entity recognition and rely on text-based external knowledge, VC-VQA explicitly models the role of visual information by considering both its source (internal vs. external images) and stage of involvement (pre-retrieval vs. post-retrieval). Specifically, VC-VQA requires models to retrieve external visual evidence, identify visual clues before retrieval, and localize, verify, or match retrieved knowledge against the internal image. We further construct a controlled multimodal knowledge base with traceable textual and visual evidence for each sample. We evaluate 21 representative MLLMs under four settings: no external knowledge, with provided evidence, knowledge base retrieval, and open-web search. Experimental results lead to three key findings: current models still struggle with vision-centric knowledge reasoning; fine-grained visual knowledge acquisition remains the primary bottleneck; and agentic retrieval highlights the value of multi-step planning and cross-modal knowledge integration. Overall, VC-VQA provides a more challenging benchmark for evaluating vision-centric knowledge reasoning in MLLMs. Our code and dataset are available at https://github.com/CASIA-IVA-Lab/VC-VQA.
Updated: 2026-11-19 07:58:14
标题: 超越实体识别:以视觉为中心的知识视觉问答
摘要: 我们提出了 VC-VQA,这是一个面向视觉中心知识推理的大规模基准,旨在系统评估多模态大语言模型(MLLM)在细粒度视觉知识获取和复杂多阶段推理方面的能力。不同于现有主要将视觉信息视为实体识别、并依赖基于文本的外部知识的基准,VC-VQA 通过同时考虑视觉信息的来源(内部图像与外部图像)及其参与阶段(检索前与检索后),明确建模视觉信息所发挥的作用。具体而言,VC-VQA 要求模型检索外部视觉证据、在检索前识别视觉线索,并将检索到的知识与内部图像进行定位、验证或匹配。我们进一步构建了一个受控的多模态知识库,为每个样本提供可追溯的文本和视觉证据。我们在四种设置下评估了 21 个具有代表性的 MLLM:无外部知识、提供证据、从知识库检索以及开放网络搜索。实验结果得出三个关键发现:当前模型在视觉中心知识推理方面仍面临困难;细粒度视觉知识获取仍是主要瓶颈;而智能体式检索凸显了多步规划与跨模态知识整合的价值。总体而言,VC-VQA 为评估 MLLM 的视觉中心知识推理能力提供了一个更具挑战性的基准。我们的代码和数据集已发布于 https://github.com/CASIA-IVA-Lab/VC-VQA。
更新时间: 2026-11-19 07:58:14
领域: cs.CV,cs.AI
LimiX-2: A Contextual Mechanism Network Towards General Structured-Data Intelligence
We introduce LimiX-2, a new model in the LimiX family, developed through model and data scaling guided by our previously established scaling laws. LimiX-2 adopts the Contextual Mechanism Networks (CMNs) paradigm and is pretrained with Context-Conditional Masked Modeling (CCMM). CMNs shifts the organizing principle of in-context learning from target-centric prediction to mechanism-oriented joint modeling. Rather than centering the network on the $p(y \mid x, D_{\mathrm{context}})$ objective of conventional tabular PFNs, it is designed around learning $p(x, y \mid D_{\mathrm{context}})$, a context-dependent representation of the joint structure underlying data generation. Pretraining uses synthetic datasets generated by structural causal models (SCMs) spanning diverse graph structures, functional mechanisms, and observation processes. Evaluations on TabArena, TALENT, and BCCO show that LimiX-2 outperforms current dataset-specific models and tabular foundation models. Beyond predictive performance, the CMN paradigm also promotes causal awareness in LimiX-2: its feature attention encodes direct causal relationships, enabling accurate causal skeleton recovery.
Updated: 2026-11-19 07:56:13
标题: LimiX-2:迈向通用结构化数据智能的上下文机制网络
摘要: 我们介绍 LimiX-2,这是 LimiX 系列中的新模型,其开发基于我们先前建立的缩放定律,通过模型规模和数据规模的扩展实现。LimiX-2 采用上下文机制网络(Contextual Mechanism Networks,CMNs)范式,并通过上下文条件掩码建模(Context-Conditional Masked Modeling,CCMM)进行预训练。CMNs 将上下文学习的组织原则从以目标为中心的预测转变为面向机制的联合建模。传统表格 PFN 以 $p(y \mid x, D_{\mathrm{context}})$ 为目标,使网络围绕该目标构建;而 CMNs 则围绕学习 $p(x, y \mid D_{\mathrm{context}})$ 进行设计,即学习一种依赖上下文、能够表征数据生成过程中潜在联合结构的表示。预训练所使用的合成数据集由结构因果模型(SCM)生成,涵盖多样的图结构、函数机制和观测过程。在 TabArena、TALENT 和 BCCO 上的评估表明,LimiX-2 的性能优于当前针对特定数据集的模型和表格基础模型。除预测性能外,CMN 范式还提升了 LimiX-2 的因果感知能力:其特征注意力能够编码直接因果关系,从而实现对因果骨架的准确恢复。
更新时间: 2026-11-19 07:56:13
领域: cs.AI
Lightweight Low-Frequency Non-Intrusive Load Monitoring via Karhunen-Loève Feature Distillation and Temporal Convolutional Networks
Non-Intrusive Load Monitoring (NILM) is a critical enabler for demand-side management which allows for smart grid optimization. A deployment-ready NILM solution necessitates three key features: accurate disaggregation, low-frequency sampling, and low computational cost. This paper proposes a lightweight, edge-oriented NILM framework that combines activity-boundary-aware synthetic data augmentation with Karhunen-Loève Transform (KLT) feature extraction and a Temporal Convolutional Network (TCN). The augmentation stage extracts and recombines complete or near-complete appliance activation segments so that the model can be trained without new fully labeled household aggregates. The KLT filter bank extracts decorrelated, appliance-informed temporal features which are then fed into a compact TCN along with the original aggregate for energy disaggregation. Evaluations on two standard NILM datasets, UK-DALE and REDD, at 10-s sampling and with leave-one-house-out testing, demonstrate that the proposed architecture achieves comparable or superior disaggregation accuracy relative to NILMFormer, BERT4NILM, BiLSTM, and BiGRU. The computational footprint of the framework is 31,009 parameters, the fewest of the five models compared, and on a single CPU thread it needs 2.78 ms per 1000 samples, 84-95% less than the baselines. These results demonstrate a favorable accuracy-efficiency tradeoff for low-frequency smart-meter NILM.
Updated: 2026-11-19 07:55:51
标题: 基于卡胡宁-勒夫特征蒸馏与时间卷积网络的轻量级低频非侵入式负荷监测
摘要: 非侵入式负荷监测(NILM)是需求侧管理的关键支撑技术,有助于实现智能电网优化。一个可部署的NILM解决方案必须具备三个关键特征:准确的负荷分解、低频采样和较低的计算成本。本文提出了一种面向边缘设备的轻量级NILM框架,将活动边界感知的合成数据增强与Karhunen–Loève变换(KLT)特征提取和时间卷积网络(TCN)相结合。数据增强阶段提取并重组完整或近乎完整的家电启用片段,使模型无需新增带有完整标签的家庭总负荷数据即可进行训练。KLT滤波器组提取去相关且包含家电信息的时序特征,随后将这些特征与原始总负荷一同输入紧凑型TCN,以实现能耗分解。在两个标准NILM数据集UK-DALE和REDD上的评估中,采用10秒采样间隔和留一户测试方法,结果表明,与NILMFormer、BERT4NILM、BiLSTM和BiGRU相比,所提出的架构取得了相当或更优的分解准确率。该框架的计算规模为31,009个参数,是五种对比模型中参数最少的模型;在单个CPU线程上处理每1000个样本仅需2.78毫秒,比基线模型少84%至95%。这些结果表明,该方法在低频智能电表NILM应用中实现了良好的准确率与效率平衡。
更新时间: 2026-11-19 07:55:51
领域: eess.SP,cs.LG,eess.SY
CompAct-Bench: A Benchmark for Working-Context Compaction in Long-Horizon Agent Tasks
As language-model agents are applied to increasingly extended tasks, their working context continuously accumulates interaction history, tool observations, intermediate decisions, and task progress. Context compaction offers a practical way to reduce this growing history while allowing execution to continue, yet the compaction ability of modern LLMs remains insufficiently understood. We introduce CompAct-Bench, a benchmark for evaluating working-context compaction through its downstream effect on agent task completion. Starting from successful agent trajectories, we insert compaction boundaries at different stages of execution, compress the preceding working context with the model under evaluation, and let the same executor continue the original task. To enable fair comparison across compactors, we evaluate them under controlled retention ratios using a lightweight iterative ratio-adjustment procedure. CompAct-Bench covers information-seeking, software-engineering, and workspace-oriented tasks through BrowseComp, SWE-bench, and an internal CompanyBench evaluation. Our experiments show that working-context compaction remains highly lossy even for frontier models: Claude- and GPT-family models perform strongest overall, yet substantial degradation in downstream task accuracy persists under aggressive compaction. Further analysis reveals that failures are often caused not only by omitted information, but also by distorted task state, such as turning unresolved issues into apparent conclusions or forgetting previously established results, which can lead to incorrect decisions or redundant execution. These findings highlight working-context compaction as a distinct and still challenging ability for LLMs operating in extended agent tasks.
Updated: 2026-11-19 07:49:37
标题: CompAct-Bench:面向长程智能体任务工作上下文压缩的基准测试
摘要: 随着语言模型智能体被应用于越来越长、越来越复杂的任务,其工作上下文会持续积累交互历史、工具观察结果、中间决策和任务进展。上下文压缩为减少不断增长的历史信息、同时允许任务继续执行提供了一种切实可行的方法;然而,现代大语言模型的上下文压缩能力仍缺乏充分研究。我们提出了 CompAct-Bench,这是一项通过评估上下文压缩对智能体任务完成情况的下游影响来衡量工作上下文压缩能力的基准。我们从成功的智能体轨迹出发,在执行的不同阶段插入压缩边界,使用待评估模型压缩此前的工作上下文,然后让同一个执行器继续完成原始任务。为实现不同压缩器之间的公平比较,我们通过一种轻量级的迭代比例调整流程,在受控的保留比例下对其进行评估。CompAct-Bench 通过 BrowseComp、SWE-bench 以及内部的 CompanyBench 评测,涵盖信息检索、软件工程和工作空间操作类任务。实验表明,即使对于前沿模型,工作上下文压缩仍然具有很高的信息损失:Claude 系列和 GPT 系列模型的整体表现最强,但在激进压缩条件下,下游任务准确率仍会显著下降。进一步分析发现,失败往往不仅源于信息被省略,还源于任务状态遭到扭曲,例如将尚未解决的问题变成看似已经得出的结论,或遗忘此前已经确立的结果,从而导致错误决策或重复执行。这些发现表明,对于执行长期智能体任务的大语言模型而言,工作上下文压缩是一项独特且仍然具有挑战性的能力。
更新时间: 2026-11-19 07:49:37
领域: cs.AI
LATER: Learning Action-Conditioned Temporal Evidence Retrieval for Predictive World Models
Early interactions can reveal physical properties that later observations no longer show. These properties can still gov- ern the effects of future actions. Inspired by the distinction between retention and selective readout in working mem- ory and cognitive science, we introduce LATER, an action- conditioned world model built on CF-JEPA. LATER stores completed real transitions in partitioned memories that remain fixed during candidate rollouts. A response bridge queries these memories using the current state and candidate action, while multi-cut auxiliary supervision trains the memory writ- ers. On distracted Two-Stage PushT, LATER raises terminal success from 15.5% to 25.0% over reconstructed CF-JEPA. In a separate comparison across six models and two scratch- training seeds, LATER achieves the lowest mean physical readout error in both clean and distracted views, reducing along-push mean absolute error (MAE) under distractors by 20.2% relative to CF-JEPA. Controlled history interventions show that later predictions depend on earlier physical evi- dence even when query observations and actions are fixed, with larger effects during pushing than waiting.
Updated: 2026-11-19 07:48:42
标题: LATER:为预测性世界模型学习动作条件化的时间证据检索
摘要: 早期交互能够揭示后续观测不再呈现的物理属性,而这些属性仍可能支配未来行动的效果。受到工作记忆与认知科学中“信息保留”与“选择性读取”之分的启发,我们提出了 LATER:一种构建于 CF-JEPA 之上的动作条件世界模型。LATER 将已完成的真实状态转移存储在分区记忆中,并在候选轨迹展开期间保持这些记忆不变。响应桥根据当前状态和候选动作查询这些记忆,同时通过多切分辅助监督训练记忆写入器。在具有干扰的 Two-Stage PushT 任务中,相较于重建的 CF-JEPA,LATER 将终端成功率从 15.5% 提升至 25.0%。在另一项涵盖六种模型和两组从头训练随机种子的比较中,无论是在干净视图还是受干扰视图下,LATER 都取得了最低的平均物理读取误差;在干扰因素存在时,其沿推动方向的平均绝对误差(MAE)相较于 CF-JEPA 降低了 20.2%。受控的历史干预表明,即使查询观测和动作保持不变,后续预测仍取决于早期的物理证据;并且,与等待阶段相比,这种影响在推动阶段更为显著。
更新时间: 2026-11-19 07:48:42
领域: cs.AI
Efficient Latent Reasoning for Vision-Language Model via Dynamics-Aware Quantization and Distillation
Efficient chain-of-thought (CoT) reasoning in vision-language models (VLMs) requires reducing both intermediate reasoning steps and their execution cost. Latent CoT methods compress textual rationales into continuous thoughts, yet their full-precision (FP) models retain substantial storage and computation costs. Lowering numerical precision could reduce these remaining costs, yet direct quantization severely degrades reasoning accuracy, particularly with 4-bit weights and activations. Operator and perturbation analyses reveal key sensitivity and direction-dependent predictive effects of continuous-thought errors, motivating preservation of information retrieval and subsequent reasoning beyond reconstruction accuracy. We therefore introduce QL-VLM, a dynamics-aware Quantization framework for efficient Latent reasoning in Vision-Language Models (VLMs). First, Dynamics-Guided Quantization (DGQ) uses nonuniform codebooks that preserve rotary-key structure, mitigating quantization-induced distortion in vision-language information retrieval. Second, Dynamics-Preserving Distillation (DPD) aligns continuous thoughts, latent-query readouts, and predictions with a full-precision teacher, maintaining predictive consistency through subsequent low-precision reasoning. On ScienceQA-IMG with Qwen2-VL-2B-Instruct, 4-bit QL-VLM achieves 90.43% accuracy and improves baseline by 40.33%, with 16.64x fewer bit-operations and 6.40x lower measured latency than explicit CoT.
Updated: 2026-11-19 07:48:38
标题: 通过动态感知量化与蒸馏实现视觉语言模型的高效潜在推理
摘要: 视觉语言模型(VLMs)中的高效思维链(CoT)推理需要同时减少中间推理步骤及其执行成本。潜在 CoT 方法将文本化的推理依据压缩为连续思维,但其全精度(FP)模型仍然具有较高的存储与计算成本。降低数值精度可以进一步减少这些成本,但直接量化会严重降低推理准确率,尤其是在权重和激活值均采用 4 位精度时。算子与扰动分析揭示了连续思维误差的关键敏感性及其具有方向依赖性的预测影响,这促使我们在关注重构精度之外,进一步保留信息检索以及后续推理所需的信息。为此,我们提出 QL-VLM,一种面向视觉语言模型(VLMs)高效潜在推理的动态感知量化框架。首先,动态引导量化(DGQ)采用非均匀码本来保留旋转键结构,从而减轻量化对视觉—语言信息检索造成的失真。其次,动态保持蒸馏(DPD)将连续思维、潜在查询读取结果和预测结果与全精度教师模型对齐,在后续低精度推理过程中保持预测一致性。在使用 Qwen2-VL-2B-Instruct 的 ScienceQA-IMG 上,4 位 QL-VLM 达到 90.43% 的准确率,相比基线提升 40.33%,同时比显式 CoT 的位运算次数减少 16.64 倍,实测延迟降低 6.40 倍。
更新时间: 2026-11-19 07:48:38
领域: cs.AI,cs.CV
The Value of Information in Resource-Constrained Pricing
Dynamic pricing with resource constraints requires balancing exploration of unknown demand patterns against exploitation of known information to maximize revenue. We develop algorithms for this problem across different information regimes. Products share perishable resources, and the firm posts prices and observes the realized requests, which may exceed the remaining capacity. In the full-information setting, a residual-correction policy that solves the fluid problem once attains $O(\log T)$ regret with bounded prices and arbitrary-rank resource matrices. In the no-information setting, deterministic exploration followed by a certainty-equivalent policy attains $O(\sqrt T)$ regret when the limiting fluid solution is nondegenerate. In the informed-price setting, given an initial price-demand estimate, a feedback controller learns the implementing prices without estimating the slope matrix if the slope matrix is symmetric, a set containing it is known in advance, the informed price is aligned with the resource constraints, and an inverse-image condition holds. A selector chooses between the informed-price algorithm and the no-information algorithm from historical data. Its regret bound includes observation error, misalignment, inventory exits, and periods on the fixed price. We further show how offline surrogate models reduce the regret of the learning policy through variance reduction, even when misspecified. The bound includes calibration and screen failures, and the regret is reduced for all sufficiently large horizons. We finally demonstrate the empirical performances of our policies through complete numerical experiments.
Updated: 2026-11-19 07:48:17
标题: 资源约束型定价中的信息价值
摘要: 具有资源约束的动态定价需要在探索未知需求模式与利用已知信息之间进行权衡,以最大化收益。我们针对不同信息情形下的这一问题开发了相应算法。产品共享易逝资源,企业公布价格并观测实际发生的请求,而请求量可能超过剩余容量。在完全信息情形下,一种仅需求解一次流体问题的剩余修正策略,在价格有界且资源矩阵秩任意的情况下,可实现 \(O(\log T)\) 的遗憾。在无信息情形下,当极限流体解非退化时,先进行确定性探索、再采用确定性等价策略,可实现 \(O(\sqrt T)\) 的遗憾。在已知价格情形下,给定初始的价格—需求估计,若斜率矩阵对称、预先知晓包含该矩阵的一个集合、已知价格与资源约束相一致,并且满足逆像条件,则一种反馈控制器无需估计斜率矩阵即可学习实现价格。一个选择器利用历史数据,在已知价格算法与无信息算法之间进行选择。其遗憾界包含观测误差、错位、库存退出、以及采用固定价格的时段所带来的影响。我们进一步说明,即使离线替代模型存在错设,方差缩减仍可降低学习策略的遗憾。该界包含校准失败和筛选失败,并且当期限足够长时,遗憾会降低。最后,我们通过完整的数值实验展示了各项策略的实证表现。
更新时间: 2026-11-19 07:48:17
领域: math.OC,cs.LG,stat.ML
Ask in the Crowd: Differentially Private LLM Inference via Dummy-Augmented Shuffling
Large language models are increasingly deployed as LLM-as-a-Service (LLMaaS), where user queries are sent to remote LLMs for inference, raising severe privacy concerns about the exposure of sensitive user inputs. Differentially private inference mitigates these risks by injecting noise into input embeddings. However, existing methods struggle to balance privacy and utility, as stronger privacy protection often leads to substantial accuracy degradation in LLM inference. In this work, we propose DP-SPD, a differentially private LLM inference framework that protects user queries by hiding the real query among client-generated dummy queries. All queries are randomly shuffled before being sent to the server, preventing direct identification of the user's true intent. To improve inference efficiency, we exploit the shared-prefix structure among queries and reuse transformer key--value (KV) caches during decoding. We analyze the privacy guarantee of DP-SPD and evaluate its utility on classification and generation tasks, as well as its privacy protection under QIA, EIA, and GPT-based attacks. Experimental results show that our method achieves strong inference-time privacy protection and near-plaintext utility while improving inference efficiency through shared-prefix KV-cache reuse.
Updated: 2026-11-19 07:47:07
标题: 在人群中提问:通过虚假数据增强的混洗实现差分隐私大语言模型推理
摘要: 大型语言模型正日益以“大语言模型即服务”(LLM-as-a-Service,LLMaaS)的形式部署,用户查询会被发送至远程大语言模型进行推理,这引发了人们对敏感用户输入泄露的严重隐私担忧。差分隐私推理通过向输入嵌入中注入噪声来缓解这些风险。然而,现有方法难以平衡隐私性与实用性,因为更强的隐私保护通常会导致大语言模型推理准确率显著下降。 在本文中,我们提出了 DP-SPD,一种差分隐私大语言模型推理框架,通过将真实查询隐藏在客户端生成的虚假查询之中来保护用户查询。所有查询在发送至服务器之前都会被随机打乱,从而防止服务器直接识别用户的真实意图。为提高推理效率,我们利用查询之间的共享前缀结构,在解码过程中复用 Transformer 的键值(KV)缓存。我们分析了 DP-SPD 的隐私保证,并在分类和生成任务上评估了其效用,同时还测试了其在 QIA、EIA 和基于 GPT 的攻击下的隐私保护能力。实验结果表明,该方法能够在推理阶段提供强有力的隐私保护,并实现接近明文推理的实用性,同时通过复用共享前缀的 KV 缓存提高推理效率。
更新时间: 2026-11-19 07:47:07
领域: cs.AI,cs.CR
EDITORS Know Your Style! Editing LoRA Subspaces for Stylistic Attribution and Imitation
Disentangling writing style from semantic content is a fundamental challenge in literary text modeling. Style-content entanglement causes models to rely on semantic content for authorship attribution (AA) tasks and memorize author-specific content for style imitation (SI) tasks. We propose EDITORS (EditingLoRA Subspaces), a diagnose-then-deflate framework that adapts pretrained large language models and prioritizes stylistic features, making it effective for both AA and SI tasks. EDITORS first trains a diagnostic LoRA adapter using style-neutral statements derived from the training corpus to identify a content-oriented subspace. It then trains the final style adapter under activation-space deflation that projects input activations away from the identified content-oriented directions. We empirically demonstrate that EDITORS is effective. On three AA benchmarks spanning literature, social media, and news, EDITORS achieves state-of-the-art accuracy, outperforming the strongest existing baseline by up to 29%. On SI, EDITORS generates stylistically faithful and diverse passages, outperforming baselines in achieving style similarity while adhering to content specifications.
Updated: 2026-11-19 07:45:54
标题: 编辑者,了解你的风格!编辑用于风格归因与模仿的 LoRA 子空间
摘要: 将写作风格与语义内容解耦是文学文本建模中的一项根本性挑战。风格与内容的纠缠会导致模型在作者归属(AA)任务中依赖语义内容,并在风格模仿(SI)任务中记忆特定作者的内容。我们提出 EDITORS(EditingLoRA Subspaces),一种“先诊断、后消减”的框架,用于适配预训练大语言模型并优先关注风格特征,从而有效处理 AA 和 SI 任务。EDITORS 首先利用从训练语料库中提取的风格中性陈述训练一个诊断性 LoRA 适配器,以识别面向内容的子空间。随后,在激活空间消减机制下训练最终的风格适配器,将输入激活投影到远离已识别内容方向的空间中。实验证明,EDITORS 十分有效。在涵盖文学、社交媒体和新闻的三个 AA 基准上,EDITORS 达到了最先进的准确率,较现有最强基线最高提升 29%。在 SI 任务中,EDITORS 能够生成风格忠实且多样的文本段落,在遵循内容要求的同时实现更高的风格相似度,优于各项基线方法。
更新时间: 2026-11-19 07:45:54
领域: cs.CL,cs.AI
GPU-Accelerated Secure Inference for Drug--Target Interaction Prediction
Deep learning models that predict drug--target interactions (DTI) can speed up drug discovery, but the candidate drugs they score are valuable intellectual property that their owners cannot reveal. Secure multiparty computation (MPC) lets two servers compute a prediction on a secret-shared drug, without either server learning the drug. However, secure inference of deep models is slow. Non-linear operations require communication between the servers, and MPC arithmetic does not map naturally to GPUs. In this paper, we present our solution to Track~III of the iDASH 2026 privacy and security competition, which asked for fast two-party secure DTI inference on GPUs. Our solution is built on the co-design of MPC-friendly models and MPC protocols. On the model side, we design SlimDTA, a DTI model that reduces the operations on the secret drug, and in particular the non-linear operations that require communication. On the protocol side, we build a GPU framework that evaluates the linear layers with additive secret sharing and the non-linear layers with function secret sharing, including a custom CUDA kernel for the comparisons. Our solution won first place in the competition, at under 10,ms per prediction on average, and its secure predictions match the plaintext model to within 0.02%.
Updated: 2026-11-19 07:43:19
标题: GPU 加速的药物—靶标相互作用预测安全推理
摘要: 能够预测药物—靶点相互作用(DTI)的深度学习模型可以加速药物发现,但其评分的候选药物属于宝贵的知识产权,所有者无法将其公开。安全多方计算(MPC)允许两台服务器在不获知药物信息的情况下,对采用秘密共享的药物进行预测。然而,深度模型的安全推理速度较慢。非线性运算需要服务器之间进行通信,而MPC算术运算也无法自然地映射到GPU上。本文介绍了我们针对iDASH 2026隐私与安全竞赛第三赛道提出的解决方案。该赛道要求在GPU上快速完成两方安全DTI推理。我们的解决方案基于MPC友好型模型与MPC协议的协同设计。在模型方面,我们设计了SlimDTA这一DTI模型,减少了对秘密药物的运算,尤其是需要通信的非线性运算。在协议方面,我们构建了一个GPU框架,使用加法秘密共享计算线性层,使用函数秘密共享计算非线性层,其中包括用于比较运算的定制CUDA内核。我们的解决方案在竞赛中获得了第一名,平均每次预测耗时低于10毫秒,并且其安全预测结果与明文模型的结果误差在0.02%以内。
更新时间: 2026-11-19 07:43:19
领域: cs.CR,cs.LG
Correctable Enrollment and One-Transaction Seed Proofs for Ethereum's Post-Quantum Transition
A quantum computer running Shor's algorithm can extract the private key of every Ethereum account whose public key is published, and accounts exposed by their own transactions hold 54.6% of execution-layer ETH. As the first such machine may stay secret, a migration cannot wait for visible thefts, and once keys are extractable, legacy signatures no longer tell owners from attackers. We design a migration in which owners enroll post-quantum keys cheaply with their existing signatures before ECDSA is retired at a scheduled time, while a zero-knowledge proof of the wallet's BIP-39 seed can correct any such enrollment until a common deadline afterward; an account nobody enrolled stays frozen and recoverable by seed proof without a deadline. Each proof binds the new key, a nonce and a fee cap, so neither a paying sponsor nor a reordering block builder can redirect or replay it. Validators switch to hash-based keys first, at a finalized checkpoint and under a stated bound on the attacker's voting power. We prove the account guarantees under explicit assumptions, model-check the rules, and implement the design in go-ethereum and a Lean consensus client. A three-layer recursive hash-based STARK yields a seed proof of about 190 KB that fits one transaction, verifies in 38 ms and takes a median of 111 s to generate on a laptop; four proofs aggregate into one. In a ten-node simulation with mainnet-derived accounts and fee demand, block space rather than proving sets the duration: the 4.45 million accounts with at least 0.1 ETH would migrate in 29.4 days if all enroll before ECDSA is retired and in 235 days if all recover after it in batches of four. In a mass enrollment, an enrollment waits a median of 19.1 minutes in the public mempool, longer than published estimates for a fast quantum computer to extract its key, so owners with a seed and an unexposed key should migrate by seed proof.
Updated: 2026-11-19 07:43:09
标题: 面向以太坊后量子迁移的可纠错注册与单交易种子证明
摘要: 运行肖尔算法的量子计算机能够提取所有已公开公钥的以太坊账户的私钥,而那些因自身交易而暴露公钥的账户,持有执行层 ETH 的 54.6%。由于第一台此类机器可能会处于秘密状态,迁移不能等到盗窃行为显现后才开始;一旦密钥可以被提取,传统签名便无法再区分账户所有者与攻击者。我们设计了一种迁移方案:在预定时间停用 ECDSA 之前,账户所有者可以使用现有签名,以低成本登记后量子密钥;此后,直到一个共同截止期限之前,钱包 BIP-39 助记词的零知识证明可以纠正任何此类登记;未进行登记的账户将保持冻结状态,并且可以通过助记词证明恢复,且不受截止期限限制。每个证明都会绑定新密钥、随机数和费用上限,因此无论是付费赞助者还是重新排序交易的区块构建者,都无法将其重定向或重放。验证者首先切换到基于哈希的密钥:在一个已最终确定的检查点进行切换,并以攻击者投票权上限的明确界定为前提。我们在明确假设下证明了账户安全保障,对规则进行了模型检验,并在 go-ethereum 和一个 Lean 共识客户端中实现了该设计。一个三层递归基于哈希的 STARK 可生成约 190 KB 的助记词证明,能够容纳在一笔交易中;其验证耗时 38 毫秒,在笔记本电脑上的生成中位时间为 111 秒;四个证明可以聚合为一个证明。在一个包含十个节点、使用源自主网的账户和费用需求进行的模拟中,持续时间由区块空间而非证明生成决定:如果所有账户都在 ECDSA 停用前完成登记,拥有至少 0.1 ETH 的 445 万个账户将在 29.4 天内完成迁移;如果所有账户都在停用后分批恢复,且每批四个证明,则需要 235 天。在大规模登记场景中,一次登记交易在公共内存池中的等待中位时间为 19.1 分钟,这长于已发布的快速量子计算机提取其密钥所需时间估计,因此,拥有助记词且密钥尚未暴露的账户所有者应当通过助记词证明进行迁移。
更新时间: 2026-11-19 07:43:09
领域: cs.CR,quant-ph
GRODE-RTL: Source-Mapped Dependency Views for LLM-Based RTL Repair
Large Language Models show great potential for automated Register-Transfer Level repair, yet they struggle with non-local faults where root causes and failing outputs reside far apart in source code. Treating RTL as a flat token sequence obscures hardware dataflows, whereas exposing complete synthesized graphs overwhelms the model with fine-grained metadata. To resolve this representation dilemma, we propose GRODE-RTL, an anchor-centric representation that extracts the single-clock-stage fan-in cone of a suspect register from the netlist, maps netlist nodes back to editable source lines, and organizes them into a compact hop-partitioned dependency view. By prioritizing direct drivers and folding distant hops, GRODE-RTL guides standard tool-using agents without exposing ground-truth hints or oracle feedback. We evaluate GRODE-RTL across 30 formally validated non-local faults using three LLMs (DeepSeek-V4-Flash, GLM-5.2, and MiniMax-M3) alongside a controlled six-configuration ablation study. GRODE-RTL improves pass@1 over source-level exploration by 16.7% on DeepSeek, by 26.7% on GLM-5.2, and by 20.0% on MiniMax-M3, with consistent gains on the hard-to-retrieve far-distance and indirect-anchor subsets of all three models. Our controls isolate structural relevance from generic context expansion, proving that selective dependency organization rather than full graph exposure is key to effective RTL repair.
Updated: 2026-11-19 07:42:26
标题: GRODE-RTL:面向基于大语言模型的 RTL 修复的源代码映射依赖视图
摘要: 大型语言模型在自动化寄存器传输级(RTL)修复方面展现出巨大潜力,但面对非局部故障时仍存在困难,因为根本原因与失败输出在源代码中相距甚远。将 RTL 视为扁平的词元序列会掩盖硬件数据流,而暴露完整的综合图又会使模型被细粒度元数据淹没。为解决这一表示困境,我们提出 GRODE-RTL:一种以锚点为中心的表示方法,从网表中提取可疑寄存器的单时钟级扇入锥,将网表节点映射回可编辑的源代码行,并将其组织成紧凑的、按跳数划分的依赖视图。通过优先呈现直接驱动节点并折叠较远跳数,GRODE-RTL 在不提供真实标签提示或预言机反馈的情况下,引导使用标准工具的智能体开展修复。我们使用三种大语言模型(DeepSeek-V4-Flash、GLM-5.2 和 MiniMax-M3),并结合受控的六配置消融研究,对 30 个经过形式验证的非局部故障进行了评估。与基于源代码的探索相比,GRODE-RTL 将 DeepSeek 的 pass@1 提升了 16.7%,将 GLM-5.2 提升了 26.7%,将 MiniMax-M3 提升了 20.0%;在三种模型中,对于难以检索的远距离子集和间接锚点子集,它也均取得了稳定增益。对照实验表明,结构相关性与泛化的上下文扩展是相互独立的,证明了选择性组织依赖关系,而非暴露完整图结构,是实现有效 RTL 修复的关键。
更新时间: 2026-11-19 07:42:26
领域: cs.AR,cs.AI,cs.MA
Every Measurement, Every Direction, All at Once: Multimodal Flow Matching for Molecules and Spectra
Generative modeling in science is often data-limited, where experiments are expensive. However, each experiment may yield several coupled measurements of the same physical entity. Standard generative models often train only on a single direction, discarding supervision from the rest. We argue that each experiment contains more training signal than this asymmetry allows the model to exploit: random masking enables measurements to serve as either conditioning inputs or prediction targets, yielding multiple supervised denoising tasks from a single experiment. We investigate this premise with MOSAIC, a multimodal flow matching transformer over molecular 3D structure and UV, IR, and Raman spectra. MOSAIC is a single model that is capable of any-to-any generation: generating any subset of modalities from any disjoint subset of the others. On QM9S, MOSAIC achieves 88.8% molecular graph recovery, outperforming the strongest spectra-to-structure baseline by 23.2% in structure generation, while simultaneously outperforming a structure-to-spectra specialist model in spectral generation. Ablations show that the any-to-any objective improves structure generation over structure-only training across model sizes. Furthermore, MOSAIC supports arbitrary subsets of available measurements and enables molecular identification by matching generated spectra to experimental references.
Updated: 2026-11-19 07:41:36
标题: 每次测量、每个方向,一次完成:用于分子与光谱的多模态流匹配
摘要: 科学中的生成建模通常受到数据量有限的制约,因为实验成本高昂。然而,每次实验可能会获得关于同一物理实体的多项相互关联的测量结果。标准生成模型通常只沿单一方向进行训练,因而丢弃了其余测量结果所提供的监督信号。我们认为,每次实验所包含的训练信号多于这种不对称训练方式所允许模型利用的部分:随机掩码使测量结果既可以作为条件输入,也可以作为预测目标,从而使单次实验能够产生多个有监督的去噪任务。我们使用 MOSAIC 研究了这一设想。MOSAIC 是一种多模态流匹配变换器,处理分子三维结构以及紫外、红外和拉曼光谱。MOSAIC 是一个能够执行任意到任意生成的单一模型:可以根据任意一个彼此不重叠的模态子集,生成其他任意模态子集。在 QM9S 上,MOSAIC 的分子图恢复率达到 88.8%,在结构生成方面比最强的光谱到结构基线模型高出 23.2%;与此同时,在光谱生成方面也优于专门的结构到光谱模型。消融实验表明,在不同模型规模下,与仅使用结构进行训练相比,任意到任意目标都能提升结构生成性能。此外,MOSAIC 支持使用可用测量结果的任意子集,并能够通过将生成的光谱与实验参考光谱进行匹配来实现分子鉴定。
更新时间: 2026-11-19 07:41:36
领域: cs.LG,physics.chem-ph
SiliconGym: A Versatile Reinforcement Learning Environment for Agentic EDA
Reinforcement learning (RL) with electronic design automation (EDA) feedback is advancing large language models for hardware design and verification. Extending these gains to hardware-engineering agents requires environments that span tasks, preserve state across tool calls, and support large hierarchies alongside parallel rollouts. We present SiliconGym, the first versatile, cross-task and cross-toolchain RL environment for hardware design and verification. By decoupling versioned workspaces, budgeted execution, and acceptance-gated scoring, SiliconGym scales from module-level RTL, testbench, and PPA tasks to multi-round repository repair and full-hierarchy SoC flows. Streaming dispatch overlaps tool checks with generation, finishing a 256-answer RL batch 21.9% faster than native ChipSeek. Using interchangeable open-source and commercial backends, we show that open-source-trained functional correctness transfers cleanly to commercial simulation, while paired netlist evaluation reveals when open-source PPA gains survive commercial synthesis.
Updated: 2026-11-19 07:40:52
标题: SiliconGym:面向智能体电子设计自动化的通用强化学习环境
摘要: 结合电子设计自动化(EDA)反馈的强化学习(RL)正在推动大语言模型在硬件设计与验证领域的发展。要将这些成果拓展至硬件工程代理,需要能够覆盖多种任务、在工具调用之间保持状态,并支持大规模层次结构与并行 rollout 的环境。我们提出了 SiliconGym,这是首个面向硬件设计与验证、跨任务且跨工具链的通用强化学习环境。SiliconGym 将版本化工作区、预算化执行和验收门控评分解耦,使其能够从模块级 RTL、测试平台和 PPA 任务扩展到多轮代码库修复以及完整层次结构的 SoC 流程。流式调度使工具检查与生成过程重叠,在完成包含 256 个答案的强化学习批次时,比原生 ChipSeek 快 21.9%。通过采用可互换的开源和商业后端,我们证明,在开源环境中训练得到的功能正确性能够顺利迁移至商业仿真;同时,配对的网表评估揭示了开源 PPA 增益何时能够在商业综合中保持。
更新时间: 2026-11-19 07:40:52
领域: cs.AI,cs.LG
Extending Rademacher Complexity-Based Generalization Theory to Domain Generalization
Domain generalization (DG) aims to train models on multiple source domains with distinct distributions to ensure robust performance on unseen target domains. In doing so, it elevates the concept of generalization from the traditional sample level to the distribution level. Existing theoretical frameworks introduce a domain space endowed with a meta-distribution to extend classical generalization analysis to this new setting. However, these approaches typically treat the domain space as devoid of geometry. In reality, the domain space is an inherently infinite-dimensional, nonlinear abstract space composed of probability distributions, and its complex geometric properties fundamentally determine generalization behavior. Consequently, existing geometry-free theories of domain generalization have a fundamental limitation. They lack a formal characterization of what distinguishes distribution-level generalization from sample-level generalization, leaving the inherent difficulty of generalizing across domains largely unexplained. To bridge this gap, we formalize the domain space as the Wasserstein space over the representation space. Building on the geometric properties of this space (specifically the $\mathrm{CD}(K,\infty)$ curvature theory) we derive a novel, geometry-dependent DG error bound. By introducing an additional curvature-dependent confidence term, this bound formally disentangles the two levels of generalization effects and reveals the essential nature that domain generalization is affected by both the invariance and the curvature of the representation space. Finally, we experimentally validate the effect of curvature on domain generalization.
Updated: 2026-11-19 07:32:29
标题: 将基于拉德马赫复杂度的泛化理论扩展至领域泛化
摘要: 领域泛化(DG)旨在利用具有不同分布的多个源域训练模型,以确保模型在未见过的目标域上具备稳健的性能。在这一过程中,它将泛化的概念从传统的样本层面提升到了分布层面。现有理论框架引入了赋有元分布的域空间,以将经典的泛化分析扩展到这一新场景。然而,这些方法通常将域空间视为不具有几何结构。事实上,域空间本质上是由概率分布构成的无限维、非线性抽象空间,其复杂的几何性质从根本上决定了泛化行为。因此,现有不考虑几何结构的领域泛化理论存在根本性局限:它们缺乏对分布层面泛化与样本层面泛化之间差异的形式化刻画,使得跨域泛化的内在困难在很大程度上仍未得到解释。为弥合这一空白,我们将域空间形式化为表示空间上的 Wasserstein 空间。在利用该空间的几何性质(具体而言,即 $\mathrm{CD}(K,\infty)$ 曲率理论)的基础上,我们推导出一种新的、依赖几何结构的领域泛化误差界。通过引入额外的依赖曲率的置信项,该误差界以形式化方式区分了两个层面的泛化效应,并揭示了领域泛化的本质:它同时受到表示空间的不变性与曲率的影响。最后,我们通过实验验证了曲率对领域泛化的影响。
更新时间: 2026-11-19 07:32:29
领域: cs.LG,cs.CV
AdsNet: A Graph Neural Network for Direct Adsorption Energy Prediction
Fast and accurate prediction of adsorption energies is critical for high-throughput computational catalyst screening, existing methods compromise either on evaluation speed (full-graph machine learning potentials) or geometric sensitivity (coordination-based models like the alpha-scheme). Here, we present AdsNet, an equivariant graph neural network that directly predicts adsorption energies in a single forward pass, which operates on a local graph restricted only to adsorbate atoms and its immediate surface neighbors within a cutoff radius. This local graph formulation decouples computational complexity from total system size while encoding continuous geometric features (interatomic distances and directional vectors) enabling sensitivity to subtle variations in local bonding environments. AdsNet adopts a message-passing architecture with scalar and vector node features over multiple interaction layers. Trained on AdsTraj, a dataset of 33,920 density functional theory (DFT) calculated structures spanning 26 transition metals and 6 adsorbates (H*, C*, O*, CO*, OH*, HOCO*), the model achieves an adsorption energy root-mean-square error (RMSE) of 0.032 eV and a force RMSE of 0.047 eV/A. Analytic forces obtained via automatic differentiation enable structure relaxation through a projected gradient descent algorithm with adaptive line search, eliminating entire geometry optimizations. Additionally, AdsNet uniquely decomposes predicted adsorption energies into contributions from individual atoms within the local adsorbate graph - an interpretability feature unattainable with conventional machine-learning potentials. AdsNet thus establishes an accurate, highly efficient, and interpretable framework for large-scale adsorption energy prediction and local interface relaxation across various material surfaces.
Updated: 2026-11-19 07:29:41
标题: AdsNet:用于直接预测吸附能的图神经网络
摘要: 快速且准确地预测吸附能对于高通量计算催化剂筛选至关重要。现有方法往往需要在评估速度(完整图机器学习势)和几何敏感性(如 alpha-scheme 等基于配位的方法)之间进行权衡。在此,我们提出 AdsNet,这是一种等变图神经网络,可在单次前向传播中直接预测吸附能。该模型仅基于由吸附质原子及其截断半径内的近邻表面原子构成的局部图进行计算。这样的局部图表述使计算复杂度与体系总规模解耦,同时编码连续几何特征(原子间距离和方向向量),从而能够感知局部成键环境中的细微变化。 AdsNet 采用消息传递架构,在多个相互作用层中使用标量和向量节点特征。模型基于 AdsTraj 数据集进行训练,该数据集包含 33,920 个由密度泛函理论(DFT)计算得到的结构,涵盖 26 种过渡金属和 6 种吸附质(H*、C*、O*、CO*、OH*、HOCO*)。模型的吸附能均方根误差(RMSE)达到 0.032 eV,力的 RMSE 达到 0.047 eV/Å。通过自动微分获得的解析力,使得能够利用带自适应线搜索的投影梯度下降算法进行结构弛豫,从而省去完整的几何优化过程。此外,AdsNet 还能够将预测的吸附能独特地分解为局部吸附质图中各个原子所作的贡献;这一可解释性功能是传统机器学习势所无法实现的。 因此,AdsNet 建立了一个准确、高效且可解释的框架,可用于在各种材料表面上大规模预测吸附能并进行局部界面弛豫。
更新时间: 2026-11-19 07:29:41
领域: cond-mat.mtrl-sci,cs.LG,physics.comp-ph
Erasing the Wrong Thing: Conditional Attribute Leakage and Concept Erasure in Shared Foundation-Model Embeddings
Medical-image embeddings are increasingly shared in place of raw images for authorized downstream tasks, yet they may reveal sensitive attributes. Standard concept-erasure methods target population-level guardedness. However, we prove that, when binary task and sensitive labels are associated, global and task-conditional linear guardedness cannot both hold while a nonzero linear task signal is preserved, so global erasure must either eliminate that signal or retain task-conditional linear leakage. We further show how global erasure affects linear readers' discrimination between positive and negative samples with different sensitive attributes, deriving an approximate closed-form prediction of its utility cost from pre-erasure statistics. Motivated by this conflict, we introduce Task-Conditional LEACE (TC-LEACE), a closed-form variant of LEACE that enforces linear guardedness within each task stratum of its fitting data. We evaluate four vision foundation models on 85 CelebA attribute pairs spanning a broad range of associations. After LEACE, conditional leakage persists across all four encoders, the discrepancy between marginal and conditional audits increases with association strength, and predicted utility costs track observed losses. We then examine hospital chest radiographs using three foundation models, including two biomedical models, in which chest-tube status is strongly associated with diagnosis. Although a marginal attack on LEACE-erased embeddings underperforms a diagnosis-only reference, chest-tube status remains detectable within diagnosis strata. TC-LEACE recovers most of LEACE's linear task-utility loss while keeping task-conditional leakage within a prespecified margin of LEACE's.
Updated: 2026-11-19 07:27:05
标题: 抹去错误之物:共享基础模型嵌入中的条件属性泄漏与概念擦除
摘要: 医学图像嵌入正日益取代原始图像,被共享用于经授权的下游任务,但它们仍可能泄露敏感属性。标准的概念擦除方法旨在实现总体层面的防护。然而,我们证明,当二元任务标签与敏感标签相关联时,在保留非零线性任务信号的情况下,不可能同时实现全局线性防护和任务条件线性防护;因此,全局擦除要么消除该信号,要么保留任务条件下的线性泄露。我们进一步展示了全局擦除如何影响线性读取器区分具有不同敏感属性的正样本和负样本,并根据擦除前的统计量,推导出其效用代价的近似闭式预测。受这一冲突启发,我们提出任务条件 LEACE(TC-LEACE),这是 LEACE 的一种闭式变体,能够在拟合数据的每个任务分层内实现线性防护。我们在四个视觉基础模型上,对涵盖广泛关联程度的 CelebA 中 85 对属性进行了评估。LEACE 处理后,四个编码器中均持续存在条件泄露;随着关联强度增加,边际审计与条件审计之间的差异也随之增大;预测的效用代价与观测到的损失相符。随后,我们使用三个基础模型(包括两个生物医学模型)研究医院胸部 X 光片;在这些模型中,胸管状态与诊断结果存在强关联。尽管针对 LEACE 擦除后嵌入的边际攻击表现不如仅使用诊断信息的参照方法,但在各诊断分层内仍可检测到胸管状态。TC-LEACE 在使任务条件泄露保持在 LEACE 泄露预设边界以内的同时,恢复了 LEACE 造成的大部分线性任务效用损失。
更新时间: 2026-11-19 07:27:05
领域: cs.CR,cs.AI,cs.CV,cs.LG
What One Sample Cannot See: Why Fewer Denoising Steps Can Score Higher on Physics Benchmarks
When a storm can head north or south, a forecast down the middle may score better under squared error than either plausible path. The same paradox appears when video generators are tested as world models: fewer denoising steps can raise physics scores even as videos blur or stop moving early. Why? Physics-IQ compares each generated video with one recording, although a scene can have multiple valid futures. An exact decomposition shows its scores can reward reduced variation among generated futures, even when their distribution becomes less accurate. We introduce Kernel Physics-IQ to remove this incentive in expectation, needing only two independent samples per condition. Two-step sampling lowers Kernel Physics-IQ in all five image-to-video models. For CogVideoX, the official score rises by 0.055 while ours falls by 0.131. Changing the sampling schedule reveals further differences official scores miss. In controlled physical systems with known outcome probabilities, our metric favors the true distribution over collapsed predictions. In short, a world model should be judged not only by how closely one video matches what happened, but by how faithfully its predictions represent what could have happened.
Updated: 2026-11-19 07:18:47
标题: 单个样本无法看见什么:为何更少的去噪步骤能在物理学基准测试中取得更高分
摘要: 当一场风暴可能向北或向南移动时,采用居中的预测,在平方误差指标下可能比两条合理路径中的任意一条得分都高。同样的悖论也出现在将视频生成器作为世界模型进行测试时:减少去噪步数可能提高物理学评分,即使生成的视频变得模糊,或过早停止运动。为什么会这样?Physics-IQ 将每个生成视频与一段记录进行比较,然而一个场景可能存在多个有效的未来。精确分解表明,即使生成结果的分布变得不再准确,该指标仍可能因生成未来之间的差异减少而给予更高分。我们提出 Kernel Physics-IQ,以在期望意义上消除这种激励,并且每个条件只需两个相互独立的样本。对于五个图像到视频模型,采用两步采样都会降低 Kernel Physics-IQ。对于 CogVideoX,官方评分提高了 0.055,而我们的评分降低了 0.131。改变采样调度方式还揭示了更多官方评分所遗漏的差异。在结果概率已知的受控物理系统中,我们的指标更偏好真实分布,而不是坍缩的预测。简而言之,评价一个世界模型时,不仅要看单个视频与实际发生情况的接近程度,还要看其预测在多大程度上忠实地表示了可能发生的情况。
更新时间: 2026-11-19 07:18:47
领域: cs.CV,cs.LG
NIMIS: A Structure-Agnostic, Chemically Informed Slot-Attention Framework for Demixing 1D $^1$H-NMR Mixture Spectra
The products of chemical reactions are usually complex mixtures that must be separated into their components before interpretable $^1$H-NMR spectra can be obtained. Direct analysis of the spectra of crude mixtures would accelerate reaction analysis and facilitate the exploration of new chemical space. We present NIMIS, a structure-agnostic, attention-based deep learning framework that groups the peaks of a 1D $^1$H-NMR mixture spectrum according to the component from which they originate. J-coupling information is introduced directly into the attention mechanism of a multi-head Transformer encoder, and the resulting contextualised peak embeddings are separated into components by slot attention. NIMIS was trained on 158,005 synthetic mixtures constructed from experimental spectra in the NMRexp database, covering molecules of up to 20 heavy atoms composed of C, H, N, O, S, F, Cl, Br and I. On held-out molecules it reaches a peak-to-component assignment accuracy of 82.28% for noise-free input and 77.34% with 10% integral noise, with a mean NIMIS score of 0.83 for correct assignments. NIMIS outperforms a conventional Transformer and simple baselines, and its performance carries over to a scaffold-disjoint evaluation. By grouping peaks into component-level sets, NIMIS provides a foundation for more robust mixture analysis methods, including methods capable of handling overlapping signals.
Updated: 2026-11-19 07:15:22
标题: NIMIS:一种结构无关、化学信息驱动的槽位注意力框架,用于解混一维 $^1$H-NMR 混合物谱屮
摘要: 化学反应的产物通常是复杂混合物,必须先将其分离成各个组分,才能获得可解读的 ¹H-NMR 谱图。直接分析粗混合物的谱图将加快反应分析,并促进对新化学空间的探索。我们提出了 NIMIS,这是一种与结构无关的、基于注意力机制的深度学习框架,可根据峰所属的组分,将一维 ¹H-NMR 混合物谱图中的峰进行分组。J-耦合信息被直接引入多头 Transformer 编码器的注意力机制中,随后利用槽注意力将所得的上下文化峰嵌入分离为不同组分。NIMIS 在 158,005 个合成混合物上进行训练,这些混合物由 NMRexp 数据库中的实验谱图构建而成,涵盖由 C、H、N、O、S、F、Cl、Br 和 I 组成、最多含 20 个重原子的分子。对于留出的分子,在无噪声输入下,其峰到组分的归属准确率达到 82.28%;在含 10% 积分噪声的情况下,准确率为 77.34%,正确归属的平均 NIMIS 得分为 0.83。NIMIS 的表现优于传统 Transformer 和简单基线方法,并且在骨架不相交的评估中仍能保持良好性能。通过将峰归组成分层面的集合,NIMIS 为更稳健的混合物分析方法奠定了基础,包括能够处理信号重叠的方法。
更新时间: 2026-11-19 07:15:22
领域: cs.LG
Physical Laws without Physics Loss? Probing Learned Dynamics in Video World Models through Forced Response
Do video world models learn physical laws without a physics loss, or merely imitate motion? Overall motion and appearance scores cannot settle it. We investigate this through nonlinear forced response: an excitation shakes the support of a suspended object. We introduce dual visual-numeric conditioning and adapt six image-to-video backbones to predict this motion using only the flow-matching loss. Wan predicts motion accurately and generalizes to unseen excitations, objects, poses, and scenes. Counterfactual tests suggest capabilities beyond replaying training videos. But what laws have they learned? We design three tiers of tests using Taylor expansions of the dynamics and geometry. All six reproduce the linear response, including resonance; five capture higher-order dynamics, including nonlinear softening. Remarkably, softening is barely present in training: only 0.74% of the swing's squared displacement. Extensions to a double pendulum and a rocking block show sustained dynamics are learned more faithfully than brief impacts. Yet learned dynamics may fail to appear when state estimation or propagation goes wrong. We turn these tests and findings into strategies to improve video training and generation.
Updated: 2026-11-19 07:14:01
标题: 没有物理损失的物理定律?通过强迫响应探究视频世界模型中学习到的动力学
摘要: 视频世界模型在没有物理损失的情况下学会了物理定律,还是仅仅模仿运动?总体运动和外观评分无法回答这一问题。我们通过非线性受迫响应对此展开研究:外部激励使悬挂物体的支撑端发生振动。我们引入视觉—数值双重条件,并将六种图像到视频的骨干模型调整为仅使用流匹配损失来预测这一运动。Wan 能够准确预测运动,并推广到未见过的激励、物体、姿态和场景。反事实测试表明,其能力可能超越了对训练视频的重放。但它们究竟学会了哪些定律?我们利用动力学和几何的泰勒展开,设计了三个层级的测试。六种模型都复现了线性响应,包括共振;其中五种捕捉到了更高阶动力学,包括非线性软化。值得注意的是,训练数据中几乎不存在软化现象:它仅占摆动位移平方的 0.74%。扩展到双摆和摇摆块的实验表明,与短暂冲击相比,模型对持续动力学的学习更加忠实。然而,当状态估计或传播过程出错时,已学到的动力学可能无法显现。我们将这些测试和发现转化为改进视频训练与生成的策略。
更新时间: 2026-11-19 07:14:01
领域: cs.CV,cs.LG
CHORUS: Coverage-Guided Agentic RL and Policy Consolidation for Testbench Stimulus Generation
Testbenches written by large language models can compile and run while leaving entire datapaths idle. We present CHORUS, the first framework to combine coverage-guided agentic reinforcement learning (RL) with policy consolidation for testbench stimulus generation. We train LLM4Cov's final supervised checkpoint to draft testbenches and repair its lowest-scoring draft using simulator feedback, raising CVDP-ECov agentic Pass@1 from 69.2% to 85.5%. Applying the same training to three checkpoints yields similar overall pass rates, yet the policies succeed on different designs. Averaging their weights combines these strengths in a single dense 4B model that reaches 86.7% agentic Pass@1. When simulator rewards select the teacher for each training prompt, the distilled 4B model reaches 88.0%, 13.5 percentage points above DeepSeek-R1 (671B).
Updated: 2026-11-19 07:12:59
标题: CHORUS:面向测试平台激励生成的覆盖率引导智能体强化学习与策略整合
摘要: 由大型语言模型编写的测试平台可能能够编译并运行,却让整个数据通路处于闲置状态。我们提出 CHORUS,这是首个将覆盖率引导的智能体强化学习(RL)与策略整合相结合、用于生成测试平台激励的框架。我们训练 LLM4Cov 的最终监督式检查点来起草测试平台,并利用仿真器反馈修复其得分最低的草稿,使 CVDP-ECov 智能体式 Pass@1 从 69.2% 提升至 85.5%。对三个检查点采用相同训练方法后,整体通过率相近,但不同策略在不同设计上表现出色。对它们的权重进行平均,可将这些优势整合到一个单一的稠密型 4B 模型中,使其智能体式 Pass@1 达到 86.7%。当仿真器奖励为每个训练提示选择教师模型时,蒸馏后的 4B 模型达到 88.0%,比 DeepSeek-R1(671B)高出 13.5 个百分点。
更新时间: 2026-11-19 07:12:59
领域: cs.AI,cs.LG
QUBO-based feature selection for MRI undersampling pattern design
We formulate undersampling mask design for Cartesian magnetic resonance imaging (MRI) as a feature subset selection problem. Each sampling line is represented by a binary feature indicating whether it is included in each candidate mask. Using candidate masks and their training-set evaluations, we estimate mutual information (MI) and conditional mutual information (CMI). These estimates and a sampling-count penalty define a quadratic unconstrained binary optimization (QUBO) model. The model is solved using simulated annealing and quantum annealing to determine a feature subset and its corresponding sampling mask. We assess the selected subsets on the test set through zero-filled reconstruction in Fourier undersampling simulations using fastMRI knee magnitude reference images, with patient-disjoint training and test sets. At all six tested target sampling rates from 15% to 40%, the resulting reconstructions have lower mean root mean square error than those obtained with four conventional sampling methods. They also have higher mean structural similarity than those obtained using univariate mutual-information ranking at all tested rates. These results support information-theoretic feature selection as an approach to MRI undersampling mask design under the tested zero-filled simulation settings.
Updated: 2026-11-19 07:10:59
标题: 基于 QUBO 的 MRI 欠采样模式设计特征选择
摘要: 我们将笛卡尔磁共振成像(MRI)的欠采样掩模设计表述为特征子集选择问题。每条采样线均由一个二元特征表示,用以指示该采样线是否包含在每个候选掩模中。利用候选掩模及其在训练集上的评估结果,我们估计互信息(MI)和条件互信息(CMI)。这些估计值与采样数量惩罚项共同定义了一个二次无约束二元优化(QUBO)模型。通过模拟退火和量子退火求解该模型,以确定特征子集及其对应的采样掩模。我们使用快速 MRI 膝部幅度参考图像,在傅里叶欠采样模拟中通过零填充重建,并采用患者互斥的训练集和测试集,在测试集上评估所选子集。在所测试的六种目标采样率(15% 至 40%)下,所得重建结果的平均均方根误差均低于四种传统采样方法所得的结果。在所有测试采样率下,其平均结构相似性也均高于采用单变量互信息排序方法所得的结果。这些结果表明,在所测试的零填充模拟条件下,基于信息论的特征选择可用于 MRI 欠采样掩模设计。
更新时间: 2026-11-19 07:10:59
领域: cs.LG,eess.SP
Deviations from the NTK Regime in CNNs under Joint Depth-Width Scaling
The concentration and training-time constancy of the neural tangent kernel (NTK) depend on the interplay between network width, depth, and initialization. While joint depth-width scaling has been studied in fully-connected, residual, and recurrent networks, its effects in convolutional neural networks (CNNs) remain less understood. We investigate these effects numerically in CNNs, examining NTK dispersion at initialization and kernel rotation during training. Let depth $L$ be the number of convolutional layers, and width $C$ the number of channels per layer. We find that NTK dispersion increases with $L/C$ in the critical and chaotic initialization regimes, but remains small in the ordered regime. At critical initialization, dispersion curves approximately collapse as a function of $L/C$, suggesting a nontrivial joint scaling regime. During training, kernel rotation generally increases with $L/C$, even in the ordered regime where initial dispersion is small. Together, these results suggest that $L/C$ may govern NTK deviations from the infinite-width limit in certain regimes, and that NTK concentration at initialization and stability during training exhibit different scaling behaviors.
Updated: 2026-11-19 07:09:49
标题: 联合深度—宽度缩放下卷积神经网络偏离神经切线核状态的现象
摘要: 神经切线核(NTK)的集中性和训练期间的恒定性取决于网络宽度、深度与初始化方式之间的相互作用。尽管全连接网络、残差网络和循环网络中的深度—宽度联合缩放已经得到研究,但其在卷积神经网络(CNN)中的影响仍不甚明了。我们在CNN中对这些影响进行了数值研究,考察了初始化时的NTK离散度以及训练过程中的核旋转。令深度 \(L\) 表示卷积层的数量,宽度 \(C\) 表示每层的通道数。我们发现,在临界初始化和混沌初始化区域,NTK离散度随 \(L/C\) 增大而增加,但在有序区域仍然较小。在临界初始化下,离散度曲线近似地关于 \(L/C\) 发生塌缩,这表明存在一种非平凡的联合缩放区域。在训练过程中,核旋转通常随 \(L/C\) 增大而增强,即使在初始离散度较小的有序区域也是如此。综合来看,这些结果表明,在某些区域中,\(L/C\) 可能控制着NTK偏离无限宽极限的程度,并且初始化时的NTK集中性与训练期间的稳定性呈现出不同的缩放行为。
更新时间: 2026-11-19 07:09:49
领域: cs.LG
QVAC Genesis III: A Large-Scale, High-Quality Open Synthetic STEM Corpus for Efficient Language Model Pre-Training
High-quality pre-training data is a critical bottleneck for educational and STEM-specific language models targeting edge AI and on-device deployment where token budgets are tightly constrained. While major organizations train ever-larger models on private corpora, the open ecosystem lacks STEM-focused synthetic datasets that deliver high per-token learning value efficiently for small models. To address this gap, we introduce QVAC Genesis III, a 191.43B-token, STEM-focused multi-domain synthetic corpus covering 19 domains across several difficulty levels and different educational styles. QVAC Genesis III is built via a dual generation strategy that performs targeted teacher distillation using a weak edge-scale student model as signal: the student's failures are converted into corrective explanations, while its successes are expanded into contrastive option-level reasoning over all answer choices. We further introduce an LLM-as-a-parser evaluation protocol that extracts final answers from free-form outputs and tracks both accuracy and answer validity. To validate the effectiveness of our QVAC Genesis III data, we conduct controlled from-scratch ablations with 1.7B-parameter models, showing that models trained with QVAC Genesis III consistently outperform both models trained with the open-source synthetic corpus Cosmopedia-v2 and the publicly released Cosmo-1B model across ARC, GPQA Diamond, and MMLU STEM benchmarks, achieving up to +28.57% on ARC-E and +21.35% on ARC-C, while reaching a Valid Answer Rate of up to 99.45%.
Updated: 2026-11-19 07:08:41
标题: QVAC Genesis III:用于高效语言模型预训练的大规模高质量开放合成STEM语料库
摘要: 高质量预训练数据是面向边缘人工智能和端侧部署的教育及 STEM 专用语言模型所面临的关键瓶颈,因为这类场景的令牌预算受到严格限制。尽管各大机构在私有语料库上训练规模越来越大的模型,但开放生态仍缺乏面向 STEM、能够以高效率为小型模型提供高单位令牌学习价值的合成数据集。为弥合这一空白,我们推出了 QVAC Genesis III,这是一个包含 1914.3 亿个令牌、专注于 STEM 的多领域合成语料库,涵盖 19 个领域、多个难度等级以及不同的教育风格。QVAC Genesis III 采用双重生成策略构建,以弱小型边缘设备规模学生模型作为信号,执行有针对性的教师蒸馏:将学生模型的错误转化为纠正性解释,同时将其正确答案扩展为针对所有选项的对比式、选项级推理。我们进一步提出了一种“以大语言模型充当解析器”的评估协议,从自由形式的输出中提取最终答案,并同时跟踪准确率和答案有效性。为验证 QVAC Genesis III 数据的有效性,我们使用 17 亿参数模型开展了从零开始训练的受控消融实验。结果表明,在 ARC、GPQA Diamond 和 MMLU STEM 基准测试中,使用 QVAC Genesis III 训练的模型始终优于使用开源合成语料库 Cosmopedia-v2 训练的模型以及公开发布的 Cosmo-1B 模型;其中,ARC-E 的得分最高提升 28.57%,ARC-C 的得分最高提升 21.35%,同时有效答案率最高达到 99.45%。
更新时间: 2026-11-19 07:08:41
领域: cs.AI,cs.LG
Characterize Then Distill: Mechanistic Reasoning in Large Output Spaces
Reasoning-trained language models can pick a document's few labels from thousands of candidates, zero-shot. We ask which components make these choices, and whether a student can be taught where to look as well as what to write, so its decisions trace to a few components and what they read. We study clinical coding of MIMIC-IV discharge summaries with all 5,651 candidate codes in the prompt. Each choice is one token: a region of the code list, a code within it, or the departure from a similar code named earlier. We measure each attention head's causal effect there by removing it and transplanting it into another summary. On essentially every summary, a small, shared set of heads, partly specific to each kind of choice, is necessary and sufficient; blocking what the tested heads read removes their effect. MISTILL builds on this: besides the teacher's text, it supervises where the student attends at the teacher's decision tokens. In a cross-family student, its own heads, found after training, restore nearly twice as much of the choice between similar codes as before, where chain-of-thought distillation alone adds under a third; one that already carried most of it gains a little, consistently across seeds, and both gains hold on the students' own completed traces. On two corpora with coder-marked evidence, a MISTILL student's decision heads attend to it more, and more specifically, than a chain-of-thought-distilled student's. Controls locate the gain in supervising attention at the decision tokens; in the cross-family student, a target built from unselected teacher heads loses it. No task difference from chain-of-thought distillation is detected at matched precision. The structure recurs in a second reasoner; ranked heads beat random ones on legal-document labelling and code generation; and without retraining the students keep their gain on Spanish case reports and a QA benchmark.
Updated: 2026-11-19 07:05:12
标题: 先刻画后蒸馏:大输出空间中的机制推理
摘要: 经过推理训练的语言模型能够在零样本条件下,从数千个候选标签中为一份文档选出少量标签。我们探究了哪些组件促成了这些选择,以及是否不仅能教会学生模型写什么,还能教会它该去哪里寻找信息,使其决策可以追溯到少数几个组件及其读取的内容。我们研究了 MIMIC-IV 出院总结的临床编码任务,并将全部 5,651 个候选代码放入提示中。每次选择都对应一个词元:代码列表中的某个区域、其中的一个代码,或相对于先前提到的相似代码的偏离。我们通过移除每个注意力头,并将其移植到另一份总结中,测量该注意力头在这些位置上的因果效应。对于几乎每一份总结,少数一组共享的注意力头都是必要且充分的,其中一部分注意力头对不同类型的选择具有一定专属性;阻断经过测试的注意力头所读取的信息,就会消除其效应。 MISTILL 以此为基础:除了教师模型的文本之外,它还在教师模型作出决策的词元位置监督学生模型的注意力。在跨模型家族的学生模型中,训练结束后发现的学生自身注意力头,使其恢复的相似代码之间的选择信息几乎达到训练前的两倍,而仅进行思维链蒸馏所增加的比例不到三分之一;对于原本已经保留大部分这类信息的学生模型,MISTILL 也带来了小幅提升,并且在不同随机种子下结果一致。两种提升在学生模型自行完成的推理轨迹上同样成立。在两个带有编码员标注证据的语料库上,MISTILL 学生模型的决策注意力头更多地关注这些证据,而且关注得比经过思维链蒸馏的学生模型更加具体。对照实验表明,增益来自在决策词元位置监督注意力;在跨模型家族的学生模型中,使用由教师模型未选中的注意力头构建的目标会使这一增益消失。在精度匹配的条件下,没有检测到其与思维链蒸馏之间存在任务性能差异。该结构在第二个推理模型中同样出现;在法律文档标注和代码生成任务上,按排名选出的注意力头优于随机选取的注意力头;而且无需重新训练,学生模型在西班牙语病例报告和一个问答基准测试上仍能保持其增益。
更新时间: 2026-11-19 07:05:12
领域: cs.CL,cs.AI,cs.LG
FlowDrive: moderated flow matching with data balancing for trajectory planning
Learning-based planners are sensitive to the long-tailed distribution of driving data. Common maneuvers dominate datasets, while dangerous or rare scenarios are sparse. This imbalance can bias models toward the frequent cases and degrade performance on critical scenarios. To tackle this problem, we compare balancing strategies for sampling training data and find reweighting by trajectory pattern an effective approach. We then present FlowDrive, a flow-matching trajectory planner that learns a conditional rectified flow to map noise directly to trajectory distributions with few flow-matching steps. We further introduce moderated, in-the-loop guidance that injects small perturbation between flow steps to systematically increase trajectory diversity while remaining scene-consistent. On nuPlan and the interaction-focused interPlan benchmarks, FlowDrive achieves state-of-the-art results among learning-based planners and approaches methods with rule-based refinements. After adding moderated guidance and light post-processing (FlowDrive*), it achieves overall state-of-the-art performance across nearly all benchmark splits. Our code is available at https://github.com/einsteinguang/flow_drive_planner.
Updated: 2026-11-19 06:58:25
标题: FlowDrive:采用数据平衡的调控流匹配轨迹规划
摘要: 基于学习的规划器对驾驶数据的长尾分布较为敏感。常见驾驶操作在数据集中占据主导地位,而危险或罕见场景较为稀少。这种不平衡可能使模型偏向高频案例,并降低其在关键场景中的表现。为解决这一问题,我们比较了多种训练数据采样平衡策略,发现按照轨迹模式进行重加权是一种有效方法。随后,我们提出了 FlowDrive,这是一种基于流匹配的轨迹规划器,通过学习条件整流流,仅需少量流匹配步骤即可将噪声直接映射为轨迹分布。我们进一步引入了适度的循环内引导,在流步骤之间注入小幅扰动,以系统性地提高轨迹多样性,同时保持与场景的一致性。在 nuPlan 和聚焦交互的 interPlan 基准测试中,FlowDrive 在基于学习的规划器中取得了当前最佳结果,并接近采用基于规则改进方法的规划器。加入适度引导和轻量级后处理后,FlowDrive* 在几乎所有基准测试划分上均取得了总体最佳性能。我们的代码已发布于:https://github.com/einsteinguang/flow_drive_planner。
更新时间: 2026-11-19 06:58:25
领域: cs.RO,cs.AI,cs.LG
Hierarchical Spatiotemporal World Modeling with Content-Adaptive Spatial Addressing
Long-horizon world modeling in partially observable environments requires compact memories that preserve spatial structure despite accumulated localization drift. Inspired by hippocampal episodic and spatial memory and the multi-periodic coding of entorhinal grid cells, we propose HiSTFormer, a hierarchical spatiotemporal world model, which adopts a layer-wise organization of local temporal RoPE and multi-periodic spatial RoPE, together with content-conditioned address offsets, to capture recent temporal context and long-range spatial structure. A fixed-capacity memory keeps KV storage and per-step attention cost bounded as the sequence grows. On MemoryMaze and HM3D, HiSTFormer outperforms strong world-model baselines within the training sequence length and generalizes substantially better to prediction horizons far beyond those seen during training, while using a compact model. The hierarchical spatiotemporal design remains effective across deeper Transformer stacks, with consistent gains as depth increases. These results show that hierarchical spatiotemporal organization and content-adaptive spatial addressing provide effective inductive biases for efficient long-horizon world modeling.
Updated: 2026-11-19 06:55:57
标题: 采用内容自适应空间寻址的层次化时空世界建模
摘要: 在部分可观测环境中进行长时域世界建模,需要紧凑的记忆机制,在定位误差不断累积的情况下仍能保留空间结构。受海马体的情景记忆与空间记忆,以及内嗅皮层网格细胞的多周期编码启发,我们提出了 HiSTFormer,一种分层时空世界模型。该模型采用逐层组织的局部时间 RoPE 与多周期空间 RoPE,并结合内容条件化的地址偏移,以捕捉近期时间上下文和长程空间结构。固定容量的记忆机制使 KV 存储量和每步注意力开销在序列增长时保持有界。在 MemoryMaze 和 HM3D 上,HiSTFormer 在训练序列长度范围内优于强大的世界模型基线,并且在预测时域远超训练阶段所见范围时表现出显著更强的泛化能力,同时保持了紧凑的模型规模。随着 Transformer 堆叠深度增加,分层时空设计仍然有效,并持续带来稳定的性能提升。这些结果表明,分层时空组织与内容自适应的空间寻址能够为高效的长时域世界建模提供有效的归纳偏置。
更新时间: 2026-11-19 06:55:57
领域: cs.NE,cs.LG
MetaScanner: An Empirical Study and Proactive Defense against Deceptive UI Attacks in Social VR
Social virtual reality (VR) platforms have surged in popularity but continue to face significant security challenges, including privacy invasion and user manipulation. Yet, the security risks posed by deceptive content remain largely unexplored. In this paper, we introduce four novel deceptive UI attacks that covertly manipulate social VR users into performing unintended actions without their awareness. We show how adversarial content creators can embed seemingly benign scripts and interactive elements within carefully designed virtual worlds, deceiving users into unknowingly carrying out harmful behaviors. We implemented these attacks on VRChat, a leading social VR platform, and an IRB-approved user study involving 30 participants confirmed their effectiveness. To mitigate these threats, we propose MetaScanner, a proactive analysis system that efficiently scans virtual world assets, including scripts and interactive objects, to identify suspicious or deceptive elements before users are exposed to them. We demonstrate that MetaScanner can successfully detect all threats in test worlds where the four attack scenarios were implemented. Additionally, MetaScanner shows its lightweight nature, with an average scanning time of 5 seconds across 38 real-world assets.
Updated: 2026-11-19 06:55:13
标题: MetaScanner:针对社交虚拟现实中欺骗性用户界面攻击的实证研究与主动防御
摘要: 社交虚拟现实(VR)平台近年来迅速普及,但仍面临诸多严峻的安全挑战,包括隐私侵犯和用户操纵。然而,欺骗性内容所带来的安全风险在很大程度上仍未得到探究。本文介绍了四种新型欺骗性用户界面攻击,这些攻击能够在用户不知情的情况下,秘密操纵社交 VR 用户执行非预期操作。我们展示了对抗性内容创建者如何在精心设计的虚拟世界中嵌入看似无害的脚本和交互元素,诱骗用户在不知不觉中实施有害行为。我们在领先的社交 VR 平台 VRChat 上实现了这些攻击,并通过一项经机构审查委员会(IRB)批准、涉及 30 名参与者的用户研究证实了其有效性。为缓解这些威胁,我们提出了 MetaScanner,这是一种主动式分析系统,能够高效扫描虚拟世界资产,包括脚本和交互对象,从而在用户接触这些内容之前识别可疑或欺骗性元素。我们证明,在实施了四种攻击场景的测试虚拟世界中,MetaScanner 能够成功检测出所有威胁。此外,MetaScanner 还展现出较低的资源开销,在对 38 个现实世界资产进行扫描时,平均扫描时间仅为 5 秒。
更新时间: 2026-11-19 06:55:13
领域: cs.CR,cs.HC
PSTO: A PDE-structured transport operator with shared implicit updates for multiscale CDR systems
Multiscale convection-diffusion-reaction (CDR) systems couple spatial transport with local stiff reaction kinetics, making their numerical simulation computationally demanding. Conventional neural surrogates require costly coupled CDR training data, and their parameter counts scale with the number of transported variables, limiting scalability to high-dimensional CDR systems. Here we propose a PDE-Structured Transport Operator (PSTO) that learns convection--diffusion dynamics solely from reaction-free data. By embedding the PDE structure into the neural architecture, PSTO generalizes to full CDR systems at inference without retraining. A single transport operator block is shared across all transported variables and refined through relaxed fixed-point iterations, performing an implicit-like correction in latent space. This improves stability during recursive multi-step prediction without adding trainable parameters. We evaluate PSTO on three benchmarks: a canonical 2D CDR system, a multiscale Robertson counterflow flame, and a multiscale hydrogen planar jet flame. In every case, PSTO reduces the mean relative $L_2$ error after 100 coupled steps by at least 50% compared to the strongest neural baseline. Ablation studies on the fixed-point iterations and detailed error decomposition further confirm that PSTO achieves both high one-step accuracy and long-term stability in coupled rollouts. Time-step sensitivity analysis shows that PSTO maintains accuracy even with a tenfold larger time step, whereas baseline accuracies decay rapidly as the time step increases. This framework enables efficient, modular modeling of multiscale CDR dynamics by separating transport learning from the treatment of local kinetics.
Updated: 2026-11-19 06:54:53
标题: PSTO:一种用于多尺度 CDR 系统的具有共享隐式更新的 PDE 结构化传输算子
摘要: 多尺度对流–扩散–反应(CDR)系统将空间输运与局部刚性反应动力学耦合在一起,使其数值模拟在计算上极具挑战性。传统神经代理模型需要代价高昂的耦合 CDR 训练数据,并且其参数量随输运变量数量增加而增长,从而限制了其向高维 CDR 系统的扩展性。本文提出了一种偏微分方程结构化输运算子(PSTO),仅利用无反应数据学习对流–扩散动力学。通过将偏微分方程结构嵌入神经网络架构,PSTO 在推理阶段无需重新训练即可推广到完整的 CDR 系统。所有输运变量共享一个输运算子模块,并通过松弛固定点迭代对其进行改进,在潜空间中执行类似隐式方法的校正。这一机制无需增加可训练参数,即可提升递归多步预测过程中的稳定性。我们在三个基准问题上评估了 PSTO:一个典型的二维 CDR 系统、一个多尺度 Robertson 逆流火焰,以及一个多尺度氢气平面射流火焰。在所有案例中,与最强的神经网络基线相比,PSTO 在耦合 100 个时间步后的平均相对 $L_2$ 误差至少降低了 50%。针对固定点迭代的消融研究以及详细的误差分解进一步证实,PSTO 在耦合滚动预测中同时实现了较高的一步预测精度和长期稳定性。时间步长敏感性分析表明,即使时间步长增大十倍,PSTO 仍能保持准确性;而随着时间步长增加,基线模型的准确性会迅速下降。该框架通过将输运学习与局部动力学处理相分离,实现了对多尺度 CDR 动力学的高效、模块化建模。
更新时间: 2026-11-19 06:54:53
领域: cs.LG
On the Informativeness of Structural Stability Bounds for GNNs: GINs versus GATs
Stability bounds for graph neural networks limit how much node representations can drift when the graph changes, but they are rarely compared with the simplest alternative: a bound on the distance between any two outputs, whatever the graph. We derive structural stability bounds for Graph Isomorphism Networks (GINs) and single-head GATv1 networks under deterministic edge perturbations that need not be small, and compare each with such a perturbation-independent diameter bound. For GINs, we characterize exactly when the stability bound is tighter, through a condition linking perturbation size, depth and maximum degree; it holds with a wide margin on Cora, but fails beyond a few layers on the low-degree MUTAG graphs. For GATv1, the bound is never tighter, which calls for analyses based on attention masses.
Updated: 2026-11-19 06:49:22
标题: 论图神经网络结构稳定性界的信息性:GIN 与 GAT 之比较
摘要: 图神经网络的稳定性界限限制了图发生变化时节点表示的漂移程度,但人们很少将其与最简单的替代方案进行比较:即无论图为何,任意两个输出之间距离的界限。我们针对确定性边扰动推导了图同构网络(GIN)和单头 GATv1 网络的结构稳定性界限,其中边扰动不必很小,并将每种界限与这种与扰动无关的直径界限进行比较。对于 GIN,我们通过建立扰动规模、网络深度和最大度数之间的联系,精确刻画稳定性界限何时更紧;在 Cora 数据集上,该条件以较大裕度成立,但在低度数的 MUTAG 图上,经过少数几层后便不再成立。对于 GATv1,该界限从不更紧,因此有必要开展基于注意力权重总量的分析。
更新时间: 2026-11-19 06:49:22
领域: cs.LG,cs.AI,cs.LO
Tether: Verified Stateful Policy Engine for System-Level Monitoring of Agents
Autonomous AI agents are increasingly deployed for long-running tasks that execute arbitrary shell commands or programs. However, these actions can result in unauthorized network requests or persistent, malicious changes to the user's file system, processes, or privileges. Existing defense mechanisms rely on either LLM-based monitors, which lack provable safety guarantees, or stateless policy enforcement layers, which miss multi-step data flows and execution side-effects unmodeled by the policy language (e.g., network calls initiated inside a Python script). We introduce Tether, a framework for runtime enforcement of stateful security policies over the observed side-effects of an agent's actions. Tether executes each proposed action in an ephemeral, isolated sandbox, inferring abstract action semantics from observed system calls. Tether then enforces stateful policies over these inferred semantics, permitting actions to proceed only if they comply with the policy. Policies and action semantics are defined in an embedded DSL in Lean 4 capable of expressing diverse constraints, including information flow control (IFC), access control, and network security policies. Because actions can propagate labels from sources to destinations, a single rule can enforce fine-grained IFC policies across multi-step execution flows of arbitrary length. Expressing policies in Lean enables formal verification that they satisfy global security invariants (e.g., preventing network access after reading a sensitive file). We evaluate Tether on realistic coding-agent benchmarks across both benign and adversarial trajectories. With a single policy shared across all tasks, Tether blocks 100% of in-scope attacks while maintaining a benign false-positive rate under 5%.
Updated: 2026-11-19 06:46:27
标题: Tether:用于对智能体进行系统级监控的经验证有状态策略引擎
摘要: 自主 AI 代理正越来越多地被用于执行长期任务,这些任务可能会运行任意 shell 命令或程序。然而,这些操作可能导致未经授权的网络请求,或对用户的文件系统、进程或权限进行持久且恶意的修改。现有防御机制要么依赖基于大语言模型的监控器,但这类监控器缺乏可证明的安全保证;要么依赖无状态的策略执行层,但这类执行层无法捕捉多步骤数据流,以及策略语言未建模的执行副作用(例如,在 Python 脚本内部发起的网络调用)。 我们提出 Tether,这是一种针对代理操作所产生的可观测副作用,运行时执行有状态安全策略的框架。Tether 会在临时的隔离沙箱中执行每个拟议操作,并根据观测到的系统调用推断抽象的操作语义。随后,Tether 针对这些推断出的语义执行有状态策略,仅当操作符合策略时才允许其继续执行。策略和操作语义通过嵌入 Lean 4 的领域特定语言(DSL)定义,该语言能够表达多种约束,包括信息流控制(IFC)、访问控制和网络安全策略。由于操作可以将标签从源传播至目标,单条规则即可针对任意长度的多步骤执行流程,实施细粒度的 IFC 策略。使用 Lean 表达策略,还能够形式化验证其是否满足全局安全不变量(例如,在读取敏感文件后禁止访问网络)。 我们在涵盖良性和对抗性轨迹的真实编码代理基准上评估了 Tether。在所有任务中共享同一策略的情况下,Tether 阻止了 100% 的适用范围内攻击,同时将良性误报率维持在 5% 以下。
更新时间: 2026-11-19 06:46:27
领域: cs.CR,cs.AI
Decision-Focused Reinforcement Learning for LLM Post-Training
Large language models (LLMs) have shown promise as predictors across various tasks, benefiting from their ability to use information from unstructured context. However, when predictions serve as parameters of downstream optimization problems, higher prediction accuracy does not necessarily translate into lower decision costs. We propose decision-focused reinforcement learning (DFRL), a framework for post-training LLMs to predict optimization parameters using negative downstream decision regret as reward. DFRL trains LLM predictors to minimize the costs of the decisions induced by their predictions, without requiring downstream convexity or differentiability, and integrates readily into existing RL post-training frameworks. To address expensive reward evaluation, we develop two approaches. Heuristic warm-starting uses inexpensive approximate rewards during an initial phase before switching to refinement with exact rewards. Reward correction combines inexpensive estimates with randomized exact evaluations, preserving the expected policy gradient while reducing the expected number of exact solves per update. Experiments on three synthetic optimization problems demonstrate improvements over prediction-loss baselines, while a larger knapsack experiment shows faster early improvement under short training budgets. On inventory planning with H&M transactions and product descriptions, our best configuration, in which the LLM reasons before predicting, reduces regret by 31.4% relative to the SFT baseline and 12.4% relative to the strongest evaluated conventional forecasting baseline.
Updated: 2026-11-19 06:44:35
标题: 面向决策的强化学习:用于大语言模型后训练
摘要: 大型语言模型(LLM)在各种任务中作为预测器展现出良好潜力,这得益于其利用非结构化上下文信息的能力。然而,当预测结果作为下游优化问题的参数时,更高的预测准确率并不一定会转化为更低的决策成本。我们提出了决策聚焦强化学习(DFRL),这是一种用于对大型语言模型进行后训练的框架,旨在利用负的下游决策遗憾作为奖励来预测优化参数。DFRL训练预测模型,使其最小化由预测结果所诱导的决策成本,无需下游问题具备凸性或可微性,并且能够便捷地集成到现有的强化学习后训练框架中。 为应对奖励评估成本高昂的问题,我们提出了两种方法。启发式热启动在初始阶段使用成本较低的近似奖励,随后切换到使用精确奖励进行优化。奖励校正则将低成本估计与随机化的精确评估相结合,在减少每次更新所需精确求解次数期望值的同时,保持期望策略梯度不变。在三个合成优化问题上的实验表明,该方法优于基于预测损失的基线;在更大规模的背包问题实验中,在训练预算较短的情况下,该方法能够更快取得早期改进。 在使用H&M交易数据和产品描述进行库存规划的任务中,我们表现最佳的配置——即让大型语言模型在进行预测前先进行推理——相较于监督微调(SFT)基线将遗憾降低了31.4%,相较于所评估的最强传统预测基线将遗憾降低了12.4%。
更新时间: 2026-11-19 06:44:35
领域: cs.LG,cs.AI
Variance-Optimal Counterfactual Policy Design for Sample-Efficient Online A/B Testing
Online A/B testing is the standard approach for evaluating changes to user-facing systems, such as a new recommendation or ranking policy, before deployment. While the difference-in-means estimator of a standard A/B test is unbiased, it often suffers from high variance. When the treatment and production policies choose the same actions with similar probabilities, the resulting observations can add noise while providing little information about the difference between the policies. Consequently, A/B tests can require large amounts of traffic and long durations to detect small treatment effects. Existing variance-reduction methods mainly improve the estimator after the data-collection scheme has been fixed, and recent overlap-aware designs only optimize a single traffic split between the two policies; thereby, they cannot direct traffic to the actions on which the policies disagree. In this paper, we jointly optimize how actions are sampled and how the resulting observations are used to estimate the treatment effect. Our contributions are two-fold. First, building on pairwise off-policy evaluation, we derive the variance-optimal action-level logging policy for estimating the average treatment effect between two policies, which has a closed-form solution for any fixed control variate. Second, we use historical logs to jointly optimize the logging policy and a control variate to further reduce variance. Our experimental results in simulated policy A/B tests show that our designs estimate the average treatment effect more accurately than existing variance reduction methods on every evaluated setting, while generally improving statistical power and reducing how often the worse policy is selected. As a result, our designs enable practitioners to reach reliable deployment decisions with considerably less online traffic.
Updated: 2026-11-19 06:42:24
标题: 面向样本高效在线 A/B 测试的方差最优反事实策略设计
摘要: 在线 A/B 测试是评估面向用户系统变更的标准方法,例如在部署新的推荐策略或排序策略之前进行评估。尽管标准 A/B 测试中的均值差估计量是无偏的,但其方差通常较高。当实验策略与生产策略以相似概率选择相同动作时,由此产生的观测会增加噪声,却很少提供有关两种策略差异的信息。因此,A/B 测试可能需要大量流量和较长时间,才能检测出较小的处理效应。现有的方差降低方法主要是在数据收集方案确定后改进估计量,而近期考虑策略重叠的设计仅优化两种策略之间单一的流量分配比例;因此,它们无法将流量引导至两种策略存在分歧的动作上。 在本文中,我们联合优化动作的采样方式,以及如何利用由此产生的观测来估计处理效应。我们的贡献有两点。第一,基于成对离策略评估,我们推导出了用于估计两种策略之间平均处理效应的动作级最优日志记录策略;对于任意给定的控制变量,该策略具有闭式解。第二,我们利用历史日志联合优化日志记录策略和控制变量,以进一步降低方差。模拟策略 A/B 测试中的实验结果表明,在所有评估设置下,与现有方差降低方法相比,我们的设计都能更准确地估计平均处理效应,同时通常还能提高统计功效,并减少选择较差策略的频率。因此,我们的设计使实践者能够以显著更少的在线流量,做出可靠的部署决策。
更新时间: 2026-11-19 06:42:24
领域: cs.LG,cs.IR
Bradley-Terry Training Can Distort Outcome Probabilities of Initially Accurate Language World Models
Comparative feedback, in which a judge says which of two candidate outcomes is closer to what happened, is a practical way to train language world models that assign probabilities to an action's outcomes. We show that, fitted with a Bradley-Terry objective, it need not teach the true outcome probabilities and can distort accurate ones. On a simulated robot push with enumerated outcome distributions, this objective takes a model that is accurate on unseen layouts (hazard error 2.4 percentage points, pp) and moves 33 to 43 pp of its probability onto outcomes that none of a condition's enumerated branches produces. The cause is the objective, not the comparisons: its optimum, computed before training, predicts where the model ends up, and a likelihood that knows the judge's rule learns from the same comparisons without the shift. The shift is robust: it recurs on unseen conditions, under five candidate laws and a three-fold denser enumeration, and about 29 pp remain without the physically impossible events. Its cost is conditional: with those events it inflates hazard probabilities, and a threshold inherited from the pre-feedback model costs about 3 pp of utility per decision on trained and 1 to 2 pp on unseen conditions, through false rejects; without them the utility loss averages below 1 pp over six seeds, though a small regret in action choice remains. Audits of readout, response and decision trace the effect from probabilities to actions.
Updated: 2026-11-19 06:42:02
标题: Bradley-Terry 训练可能扭曲初始准确的语言世界模型的结果概率
摘要: 比较式反馈是指评判者说明两个候选结果中哪一个更接近实际发生情况。这是一种训练语言世界模型的实用方法,这类模型为某个行动的各种结果分配概率。我们表明,在采用 Bradley–Terry 目标函数进行拟合时,这种方法未必能教会模型真实的结果概率,反而可能扭曲原本准确的概率。在一个枚举了结果分布的模拟机器人推推动作中,该目标函数会使一个在未见过的布局上表现准确的模型(危险事件误差为 2.4 个百分点,即 pp)的概率发生偏移:有 33 至 43 个百分点的概率被分配给某些条件下枚举分支中根本不会产生的结果。造成这一现象的是目标函数,而不是比较反馈本身:在训练前计算出的目标函数最优解能够预测模型最终会达到的状态;而一种了解评判者规则的似然函数,则可以从同样的比较中学习,却不会产生这种偏移。 这种偏移具有稳健性:在未见过的条件下、采用五种候选规律以及密度提高三倍的枚举方式时,偏移都会再次出现;即使排除物理上不可能发生的事件,仍有约 29 个百分点的概率发生偏移。其代价取决于具体条件:包含这些事件时,模型会高估危险事件的概率;沿用反馈前模型设定的阈值,会因错误拒绝而使训练条件下每次决策的效用损失约为 3 个百分点,在未见过的条件下损失约为 1 至 2 个百分点。不包含这些事件时,使用六个随机种子计算的平均效用损失低于 1 个百分点,但行动选择仍会出现轻微遗憾。对输出、响应和决策轨迹的审计表明,这一影响是如何从概率传导至行动的。
更新时间: 2026-11-19 06:42:02
领域: cs.LG,cs.AI,cs.CV
Measuring Hallucination in Large Language Models for Cyber Threat Intelligence: An Exploratory Study
Large language models (LLMs) are increasingly used in cyber threat intelligence (CTI) tasks, such as summarization and question answering. However, they may produce hallucinations, false or misleading content not grounded in the source text, which can mislead analysts and corrupt downstream security decisions. This paper presents an exploratory measurement study of hallucinations in LLM-based CTI. We introduce HalluVision, a reproducible framework that generates LLM outputs, extracts domain-specific entities using a fine-tuned named entity recognition model, and evaluates factual consistency using multiple similarity metrics. Using 4,940 real-world cybersecurity articles, we measure hallucinations in outputs from two commercial LLMs and one open-weight LLM. Measurements are validated against 100 human-annotated outputs and two established faithfulness detectors. Results show that semantic similarity aligns with human judgments, whereas entity-based metrics exhibit limited agreement. Differences between models are concentrated in question answering, while entity extraction quality limits what entity-level metrics can reveal.
Updated: 2026-11-19 06:35:05
标题: 面向网络威胁情报的大型语言模型幻觉测量:一项探索性研究
摘要: 大型语言模型(LLM)正日益应用于网络威胁情报(CTI)任务,例如摘要生成和问答。然而,它们可能产生幻觉,即生成与源文本无关的虚假或误导性内容,从而误导分析人员,并损害后续的安全决策。本文对基于 LLM 的 CTI 中的幻觉现象开展了一项探索性测量研究。我们提出了 HalluVision,这是一个可复现的框架,用于生成 LLM 输出,利用经过微调的命名实体识别模型提取领域特定实体,并使用多种相似度指标评估事实一致性。基于 4,940 篇真实世界的网络安全文章,我们测量了两个商业 LLM 和一个开放权重 LLM 的输出中的幻觉现象。我们将测量结果与 100 条经人工标注的输出以及两个已建立的忠实性检测器进行验证。结果表明,语义相似度与人工判断一致,而基于实体的指标表现出有限的一致性。模型之间的差异主要集中在问答任务中,而实体提取质量限制了实体级指标所能揭示的信息。
更新时间: 2026-11-19 06:35:05
领域: cs.AI,cs.CR
CP-Guard+: A New Paradigm for Malicious Agent Detection and Defense in Collaborative Perception
Collaborative perception (CP) is a promising method for safe connected and autonomous driving, which enables multiple vehicles to share sensing information to enhance perception performance. However, compared with single-vehicle perception, the openness of a CP system makes it more vulnerable to malicious attacks that can inject malicious information to mislead the perception of an ego vehicle, resulting in severe risks for safe driving. To mitigate such vulnerability, we first propose a new paradigm for malicious agent detection that effectively identifies malicious agents at the feature level without requiring verification of final perception results, significantly reducing computational overhead. Building on this paradigm, we introduce CP-GuardBench, the first comprehensive dataset provided to train and evaluate various malicious agent detection methods for CP systems. Furthermore, we develop a robust defense method called CP-Guard+, which enhances the margin between the representations of benign and malicious features through a carefully designed Dual-Centered Contrastive Loss (DCCLoss). Finally, we conduct extensive experiments on both CP-GuardBench and V2X-Sim, and demonstrate the superiority of CP-Guard+.
Updated: 2026-11-19 06:27:37
标题: CP-Guard+:协同感知中恶意智能体检测与防御的新范式
摘要: 协同感知(CP)是一种用于实现安全车联网与自动驾驶的有前景方法,能够使多辆车辆共享感知信息,从而提升感知性能。然而,与单车感知相比,协同感知系统的开放性使其更容易受到恶意攻击:攻击者可以注入恶意信息,误导自车的感知结果,进而对安全驾驶造成严重风险。为缓解这一脆弱性,我们首先提出了一种新的恶意智能体检测范式,能够在特征层面有效识别恶意智能体,而无需对最终感知结果进行验证,从而显著降低计算开销。在此范式的基础上,我们提出了 CP-GuardBench,这是首个用于训练和评估协同感知系统中各种恶意智能体检测方法的综合性数据集。此外,我们设计了一种名为 CP-Guard+ 的鲁棒防御方法,通过精心设计的双中心对比损失(DCCLoss)增大良性特征与恶意特征表示之间的间隔。最后,我们在 CP-GuardBench 和 V2X-Sim 上开展了大量实验,结果表明 CP-Guard+ 具有优越性能。
更新时间: 2026-11-19 06:27:37
领域: cs.CR,cs.AI,cs.CV,cs.LG
AZOWL AgentOps: Task-Scoped Governance for Deployed Agent Applications
AZOWL AgentOps provides shared governance for deploying agents and delegating work to them. Human and agent senders can exchange messages or explicitly delegate a business task. Accepted work has a stable identifier that links the sender's authority, the assigned runner, any required approval, and result evidence. The default enrolled customer PC profile is read-only. We compare AZOWL components with a configured LangGraph application in 28 synthetic runs across four paired pilots. Original AZOWL services checked work admission, recipient routing, and workflow prerequisites in isolated tests. The configured LangGraph application supplied business task and dispatch records in application code. Both configurations recorded zero business tasks in dialogue, rejected unauthorized agent handoffs, and issued zero writes when an approved delivery address changed. AZOWL's scope gate, exercised as a component, requested approval again on the same task. A product probe reused one registered provider across two workflows and checked prerequisite enforcement for ticket-task submission. The paired protected writes, including ticket creation, used mock providers. Of two deployed PC inventory reads with verified receipts, we traced the 0.6.57 run from submission through runner pickup and tool execution to the receipt, with matching local and central artifact hashes. A separate deployed GRC audit followed an operator-driven ticket lifecycle on sample records.
Updated: 2026-11-19 06:06:59
标题: AZOWL AgentOps:面向已部署智能体应用的任务范围治理
摘要: AZOWL AgentOps 为代理的部署和工作委派提供共享治理。人工发送方和代理发送方可以交换消息,或明确委派一项业务任务。被接受的工作具有稳定标识符,用于关联发送方权限、指定执行者、任何所需审批以及结果证据。默认登记的客户 PC 配置文件为只读。我们在四组配对试点中进行了 28 次合成运行,将 AZOWL 组件与一款经过配置的 LangGraph 应用进行比较。原始 AZOWL 服务在隔离测试中检查工作准入、接收方路由和工作流前置条件。经过配置的 LangGraph 应用则在应用代码中提供业务任务和调度记录。两种配置在对话中均记录了零项业务任务,拒绝了未经授权的代理交接,并在获批的交付地址发生变化时执行了零次写入。作为组件进行测试时,AZOWL 的范围门控在同一任务上再次请求审批。一项产品探测在两个工作流之间复用了一个已登记的提供方,并检查了提交工单任务时的前置条件执行情况。配对的受保护写入(包括工单创建)均使用模拟提供方。在两次已部署且带有已验证回执的 PC 库存读取中,我们追踪了 0.6.57 版本的运行过程:从提交、执行者接取和工具执行,一直到生成回执;本地与中央构件的哈希值相匹配。另一次独立部署的 GRC 审计则在样本记录上跟踪了由操作员驱动的工单生命周期。
更新时间: 2026-11-19 06:06:59
领域: cs.CR
Passing NPCR Without Diffusion: Exact Signatures, a Detection Benchmark and an Audit of Published Image Ciphers
NPCR, the share of ciphertext bytes changed by a one-pixel plaintext change, is reported for nearly every image cipher as evidence of diffusion, with 99.61% the target. Several mechanisms produce values near it, and the mean does not say which. We separate three regimes: no propagation, one round of forward and backward chaining linear over addition or XOR, and independent ciphertexts. For the second an exact count applies. After a least-significant-bit change its mean asymptotically matches the independent-ciphertext reference, while its spread without cancellation is about five to twenty times larger. In simulation, the one-sided NPCR test of Wu, Noonan and Agaian flags one-round additive, mixed and S-box chaining in 2-4% of papers; read in both directions, the same five values flag at least 99.9%. Two-sided testing does the detecting; the spread and the other signatures help diagnose the structure. We then audit twenty-one published schemes. The count matches a reimplementation of one published diffusion layer on every trial and accounts for its reported table, the signatures show two schemes whose printed specifications cannot produce their reported values, and find that three of our own report plain-versus-cipher values and fall to two chosen images; ten more change their encryption material with the plaintext or per encryption, so their NPCR mostly reflects that change. A released checker applies the signatures to published tables, showing what a table measures within stated assumptions; it does not certify security.
Updated: 2026-11-19 06:06:55
标题: 无需扩散通过 NPCR:精确特征、检测基准与已发表图像密码的审计
摘要: NPCR 是指明文图像改变一个像素后,发生变化的密文字节所占的比例。几乎所有图像密码算法都报告该指标,以证明其扩散性,其中 99.61% 是目标值。多种机制都能产生接近该值的结果,而均值本身无法说明究竟是哪一种机制。我们将其分为三种情形:无传播;在加法或异或运算下进行一轮前向和反向链式传播;以及相互独立的密文。对于第二种情形,可以进行精确计数。发生最低有效位变化后,其均值在渐近意义上与独立密文的参考值相匹配,但在没有抵消的情况下,其离散程度约大五至二十倍。 在模拟中,Wu、Noonan 和 Agaian 提出的一侧 NPCR 检验,会在 2% 至 4% 的论文中将一轮加法链、混合链和 S 盒链标记出来;若同时从正向和反向进行检验,同样的五个数值至少能标记出 99.9% 的情况。真正发挥检测作用的是双侧检验;而离散程度及其他特征则有助于诊断其结构。 随后,我们审查了 21 种已发表的方案。该计数结果在每次试验中都与对一种已发表扩散层的重新实现相符,并解释了其报告表格中的数据;这些特征显示,有两种方案的印刷规格不可能产生其报告的数值;此外,我们发现自己报告的三种方案实际上使用的是明文与密文之间的数值,在两幅特定图像下其结果便会失效。另有十种方案会随明文或每次加密过程改变其加密材料,因此它们的 NPCR 主要反映了这种变化。 我们发布了一个检查器,可将这些特征应用于已发表的表格,从而在所声明的假设下说明表格究竟测量了什么;但它并不能证明安全性。
更新时间: 2026-11-19 06:06:55
领域: cs.CR,cs.MM,eess.IV
UniReFP: Robust Unified Fingerprinting for Vision Models against Cross-Task Repurposing Attacks
We identify, for the first time, a new model modification attack--the cross-task model repurposing attack--that can render fingerprints generated by existing model fingerprinting approaches inapplicable. To address this challenge, we propose UniReFP--a novel unified model fingerprinting framework applicable to diverse vision models across different tasks--that utilizes ownership evidence in a shared class-level semantic space rather than original task-specific output space, enabling effective ownership verification when a protected model is repurposed across tasks with heterogeneous output formats. Specifically, UniReFP constructs a surrogate classifier by repurposing the protected model, enabling fingerprints to be generated independently of the original task-dependent output space of the protected model. Moreover, it optimizes grouped fingerprints to encode ownership evidence: fingerprints within the same group are encouraged to induce consistent semantic responses and intermediate representations on the surrogate classifier, while producing dispersed responses on independently trained reference classifiers. During verification, UniReFP uses a task-aware semantic projection mechanism to map heterogeneous suspect-model outputs into unified semantic-presence vectors, and determines ownership by measuring inner-group consistency. Extensive experimental results validate the effectiveness of UniReFP, consistently showing superior performance under cross-task repurposing attacks, commonly studied model modification attacks, and even their combinations.
Updated: 2026-11-19 06:00:41
标题: UniReFP:针对跨任务再利用攻击的视觉模型鲁棒统一指纹识别
摘要: 我们首次发现了一种新的模型修改攻击——跨任务模型再利用攻击,该攻击能够使现有模型指纹方法生成的指纹失效。为应对这一挑战,我们提出了 UniReFP——一种新颖的统一模型指纹框架,适用于不同任务中的多种视觉模型。该框架利用共享的类别级语义空间中的所有权证据,而非原始任务特定的输出空间,从而能够在受保护模型被重新用于具有异构输出格式的其他任务时,有效进行所有权验证。 具体而言,UniReFP 通过重新利用受保护模型构建替代分类器,使指纹的生成不再依赖于受保护模型原始任务特定的输出空间。此外,该方法通过优化分组指纹来编码所有权证据:鼓励同一组内的指纹在替代分类器上诱导出一致的语义响应和中间表示,同时在独立训练的参考分类器上产生分散的响应。在验证阶段,UniReFP 使用任务感知的语义投影机制,将异构的可疑模型输出映射为统一的语义存在向量,并通过测量组内一致性来判定所有权。 大量实验结果验证了 UniReFP 的有效性。在跨任务模型再利用攻击、通常研究的模型修改攻击,以及二者组合的攻击场景下,该方法均持续展现出优越性能。
更新时间: 2026-11-19 06:00:41
领域: cs.CV,cs.CR
LingSante MedGuard Technical Report
As medical AI is increasingly used for patient consultation and clinical decision support, identifying harmful, non-compliant, or ethically problematic responses is essential for responsible deployment. Assessing these risks requires checking clinical claims against relevant evidence, verifying calculations, and applying medical requirements under their intended conditions. We introduce LingSante MedGuard, a capability-enhanced guardrail that integrates supervision from a medical guardrail teacher model and six specialized medical capability experts into a unified model. The guardrail teacher supervises risk decisions and explanations across medical safety, compliance, and ethics, while the capability experts support medical rule understanding, numerical reasoning, multimodal hallucination detection, agentic safety verification, risk localization, and multimodal entity understanding. We consolidate these sources of supervision through offline supervised fine-tuning on teacher-generated demonstrations, followed by multi-teacher on-policy distillation using feedback on student-generated responses. We further introduce LingSante MedGuardBench, a benchmark comprising 11 risk-detection subsets spanning medical safety, compliance, and ethics. At 4B, 9B, and 27B scales, LingSante MedGuard achieves mean benchmark F1 scores of 82.3%, 82.4%, and 87.4%, respectively. The 4B model also achieves 73.9% mean accuracy across MedHallu and MedHALT-NOTA under retrieval-enabled evaluation. Additional evaluations of the verification components show improvements in evidence-supported consistency, source traceability, and rule-guided rationale quality across model scales. These results support the integration of specialized medical capabilities into a unified guardrail for medical risk assessment and evidence-based medical safety verification.
Updated: 2026-11-19 04:59:00
标题: LingSante MedGuard 技术报告
摘要: 随着医疗人工智能日益广泛地用于患者咨询和临床决策支持,识别有害、不合规或存在伦理问题的响应,对于负责任地部署此类技术至关重要。评估这些风险需要依据相关证据核查临床陈述、验证计算结果,并在预期适用条件下落实医疗要求。我们提出 LingSante MedGuard,这是一种能力增强型护栏模型,通过将医疗护栏教师模型的监督与六个专业医疗能力专家的支持整合到统一模型中,实现风险防护。护栏教师模型负责监督医疗安全、合规性和伦理领域的风险判断与解释;能力专家则分别支持医疗规则理解、数值推理、多模态幻觉检测、智能体安全验证、风险定位和多模态实体理解。我们首先利用教师模型生成的示例进行离线监督微调,随后通过多教师在策略蒸馏,利用针对学生模型生成响应的反馈,进一步整合这些监督信号。我们还提出 LingSante MedGuardBench,这是一个包含 11 个风险检测子集的基准,覆盖医疗安全、合规性和伦理三个方面。在 4B、9B 和 27B 参数规模下,LingSante MedGuard 的基准平均 F1 分数分别达到 82.3%、82.4% 和 87.4%。在启用检索的评测中,4B 模型在 MedHallu 和 MedHALT-NOTA 上的平均准确率还达到 73.9%。对验证组件的进一步评估表明,在不同模型规模下,模型在证据支持的一致性、来源可追溯性和规则引导的推理质量方面均有所提升。这些结果表明,将专业医疗能力整合到统一护栏模型中,有助于开展医疗风险评估以及基于证据的医疗安全验证。
更新时间: 2026-11-19 04:59:00
领域: cs.CR
Side-Channel Analysis of the RP2350 Challenge 2
Bug bounty programs and community challenges have become an established mechanism to incentivize collective action to improve security. In essence, these can be considered as crowd-sourcing mechanisms where participants carry the risk twice over: performing the work in addition to having it officially accepted, which at times can be tied to unacceptable terms. Consequently, independent assessments and publications that are free from third party obligations remain important to highlight deficiencies in implementations of public significance. We consider the RP2350 side-channel analysis challenge and its hardened Advanced Encryption Standard (AES) implementation to be of reasonable importance to justify such an approach, especially so since the presented challenge remained unsolved for more than a year. In our paper, we present our analysis, demonstrating comprehensive leakage detection, plaintext dependence, and key extraction from the challenge implementation. Our work presents concerning weaknesses in the implementation that contradict the challenge authors' claims. We hope by openly sharing this analysis to motivate further public scrutiny.
Updated: 2026-11-19 04:08:31
标题: RP2350 挑战赛第二题的侧信道分析
摘要: 漏洞悬赏计划和社区挑战赛已成为激励集体行动、提升安全性的一种成熟机制。从本质上说,它们可以被视为众包机制:参与者要承担双重风险——不仅要完成工作,还要面对成果能否被正式接受的问题,而后者有时可能与不可接受的条款挂钩。因此,不受第三方义务约束的独立评估和公开发表仍然十分重要,有助于揭示具有公共重要性的实现中的缺陷。我们认为,RP2350 侧信道分析挑战及其经过强化的高级加密标准(AES)实现具有足够的重要性,值得采用这种方法;尤其是因为该挑战在提出一年多后仍未被解决。在本文中,我们介绍了我们的分析,展示了对该挑战实现的全面泄漏检测、明文依赖性分析以及密钥提取结果。我们的工作揭示了该实现中令人担忧的弱点,这些弱点与挑战赛作者的说法相矛盾。我们希望通过公开分享这项分析,推动开展进一步的公众审查。
更新时间: 2026-11-19 04:08:31
领域: cs.CR
LLM-Based Threat Detection and Prevention Framework for IoT Ecosystems
The rapid expansion of the Internet of Things (IoT) has introduced complex and evolving cybersecurity challenges. This paper presents a Large Language Model (LLM)-based framework for intelligent threat detection and prevention in IoT networks. The proposed architecture integrates two core components: a Detection Component that leverages fine-tuned models trained on IoT-specific datasets (IoT-23 and TON_IoT) to identify anomalous network behaviours, and a Prevention Component that generates adaptive response strategies to mitigate detected threats. The framework incorporates prompt management, local adaptation, and global refinement modules to support context-aware decision-making and continuous model-guided adaptation. Experimental validation in a Docker-based edge-cloud environment shows that BERT Small achieves 99.75% accuracy, F1-score, precision, and recall for threat detection, while the Prevention LLM achieves 98.3% accuracy in selecting suitable mitigation actions. These results highlight the potential of LLM-driven architectures to provide explainable and adaptive security solutions for next-generation IoT ecosystems.
Updated: 2026-11-19 03:58:55
标题: 基于大语言模型的物联网生态系统威胁检测与防御框架
摘要: 物联网(IoT)的快速扩展带来了复杂且不断演变的网络安全挑战。本文提出了一种基于大语言模型(LLM)的物联网网络智能威胁检测与防御框架。所提出的架构集成了两个核心组件:检测组件利用基于物联网专用数据集(IoT-23 和 TON_IoT)训练的微调模型,识别异常网络行为;防御组件则生成自适应响应策略,以缓解检测到的威胁。该框架融入了提示管理、本地适配和全局优化模块,以支持基于上下文的决策以及模型引导的持续适应。在基于 Docker 的边缘云环境中进行的实验验证表明,BERT Small 在威胁检测方面的准确率、F1 分数、精确率和召回率均达到 99.75%;与此同时,防御大语言模型在选择适当缓解措施方面的准确率达到 98.3%。这些结果凸显了由大语言模型驱动的架构为下一代物联网生态系统提供可解释、自适应安全解决方案的潜力。
更新时间: 2026-11-19 03:58:55
领域: cs.CR,cs.AI,cs.ET,cs.LG
ToolPulse: Side-Channel Eavesdropping on Tool-Using LLM Agents
Large language models (LLMs) are increasingly deployed as agents that translate user requests into sequences of local tool invocations. While prior cache-based side-channel attacks target the locally deployed models, they typically require the adversary to share model-related components or hardware resources with the victim's inference process. These assumptions do not apply to the predominant agentic settings, in which commercial LLMs execute on vendor-controlled infrastructure. We show that agentic execution exposes a more practical attack surface: although inference remains remote, tools are executed on the user's machine and commonly rely on shared system libraries. In this paper, we first systematically evaluate Flush+Reload and Prime+Probe for monitoring agentic tool invocations. Our evaluation across three hardware platforms shows that Flush+Reload enables accurate, real-time tool monitoring, whereas Prime+Probe, despite supporting cross-VM attacks, incurs prohibitive monitoring overhead and suffers from cache-set aliasing. We present ToolPulse, a cache-based side-channel eavesdropping framework against tool-using agents. We first design the Tool Recovery Attack to reconstruct an agent's tool-execution workflow. We evaluate the Tool Recovery Attack on 11 LLMs across Codex and Claude Code. It consistently reconstructs tool workflows, with the lowest F1 score exceeding 93%. We further demonstrate two attack scenarios enabled by the recovered traces. Task Profiling Attack infers user intent across two Terminal-Bench task categories and the Trigger Localization Attack identifies sensitive tool calls in encryption/decryption and model training/inference workloads. Even under substantial system noise on a server shared by approximately 20 users, both Task Profiling Attack and Trigger Localization Attack maintain high accuracy.
Updated: 2026-11-19 03:57:41
标题: ToolPulse:对使用工具的大语言模型智能体进行侧信道窃听
摘要: 大型语言模型(LLM)正日益以智能体的形式部署,将用户请求转化为一系列本地工具调用。尽管以往基于缓存的侧信道攻击针对的是本地部署的模型,但通常要求攻击者与受害者的推理过程共享与模型相关的组件或硬件资源。这些假设并不适用于主流的智能体场景,因为在此类场景中,商业大语言模型运行于由供应商控制的基础设施上。我们发现,智能体执行过程暴露出了更为实际的攻击面:尽管推理过程仍在远程进行,工具却在用户机器上执行,并且通常依赖共享的系统库。 本文首先系统评估了 Flush+Reload 和 Prime+Probe 监测智能体工具调用的能力。我们在三种硬件平台上进行的评估表明,Flush+Reload 能够实现准确的实时工具监测;而 Prime+Probe 尽管支持跨虚拟机攻击,却带来了难以接受的监测开销,并且容易受到缓存组别别名问题的影响。 我们提出了 ToolPulse,这是一种针对工具使用型智能体的基于缓存的侧信道窃听框架。首先,我们设计了工具恢复攻击,用于重建智能体的工具执行工作流。我们在 Codex 和 Claude Code 上的 11 个大语言模型中评估了工具恢复攻击。该攻击能够持续重建工具工作流,最低 F1 分数也超过 93%。 我们进一步展示了两种由恢复的执行轨迹支持的攻击场景。任务画像攻击能够推断两类 Terminal-Bench 任务中的用户意图;触发定位攻击则能够识别加密/解密以及模型训练/推理工作负载中的敏感工具调用。即使在一台约由 20 名用户共享、存在大量系统噪声的服务器上,任务画像攻击和触发定位攻击仍能保持较高的准确率。
更新时间: 2026-11-19 03:57:41
领域: cs.CR,cs.AR
VisualJevBench: A Benchmark and Black-Box Attacks for Visual Typed Decision Models
Typed decision models (TDMs) return structured decisions instead of generating free-text responses, enabling fast and cheap decisions in real-world applications. Recent support for image inputs extends Jev, a representative TDM, to visual decision-making. We refer to this setting as Visual Jev. However, red teaming of Visual Jev leaves two gaps: a systematic evaluation of direct image manipulations is lacking, and universal visual attacks remain underexplored. To address these gaps, we introduce VisualJevBench, a benchmark for evaluating the adversarial robustness of Visual Jev. It comprises 800 images and 3,200 questions across eight scenarios and four visual attack surfaces: typographic manipulation, visual evidence spoofing, target selection interference, and geometric transformation. We also introduce Adaptive Black-Box Parameter Search (ABPS), a lightweight framework that uses typed-output feedback to find effective image manipulations. ABPS supports both image-specific attacks and universal attacks that transfer to unseen images and tasks in new scenarios without further optimization. Extensive experiments on jev-1.14.0 show that image-specific attacks achieve an attack success rate (ASR) of up to 69.6%, while universal attacks achieve an average ASR of 33.15% on unseen images. Geometric transformations achieve an average ASR of 40.09% in cross-scenario transfer.
Updated: 2026-11-19 03:16:43
标题: VisualJevBench:视觉类型化决策模型的基准测试与黑盒攻击
摘要: 类型化决策模型(TDM)返回结构化决策,而不是生成自由文本响应,从而能够在现实应用中实现快速且低成本的决策。近期对图像输入的支持使得具有代表性的 TDM——Jev——扩展到视觉决策领域。我们将这一设置称为 Visual Jev。然而,对 Visual Jev 的红队测试仍存在两个空白:缺乏对直接图像操纵的系统性评估,且通用视觉攻击尚未得到充分研究。为弥补这些空白,我们引入了 VisualJevBench,这是一个用于评估 Visual Jev 对抗鲁棒性的基准。该基准包含 800 张图像和 3,200 个问题,涵盖八种场景及四类视觉攻击面:文字排版操纵、视觉证据欺骗、目标选择干扰和几何变换。我们还提出了自适应黑盒参数搜索(ABPS),这是一个轻量级框架,利用类型化输出反馈来寻找有效的图像操纵方式。ABPS 同时支持图像特定攻击和通用攻击;后者无需进一步优化,即可迁移到新场景中未见过的图像和任务。针对 jev-1.14.0 的大量实验表明,图像特定攻击的攻击成功率(ASR)最高可达 69.6%,而通用攻击在未见图像上的平均 ASR 为 33.15%。在跨场景迁移中,几何变换达到 40.09% 的平均 ASR。
更新时间: 2026-11-19 03:16:43
领域: cs.CR
ChainAgent: Automated Chainable Vulnerability Discovery in PHP Web Applications
High-impact attacks on PHP web applications often chain limited-capability vulnerabilities with other flaws or intended behaviors. Discovering these chains requires identifying flaws and the dependencies enabling capability composition. Existing vulnerability discovery techniques analyze flaws in isolation, while attack planning assumes known components. This separation makes it difficult to discover previously unknown components whose security relevance becomes apparent only through their potential roles in an exploit chain. We present ChainAgent, a goal-directed LLM-agent framework that jointly discovers exploit-chain components and their capability dependencies in source code. Guided by an empirical study of 386 real-world web exploit chains, ChainAgent represents vulnerabilities and functional gadgets--intended program behaviors that can be repurposed in attacks--through preconditions and capabilities over security-relevant objects. Instead of discovering vulnerabilities first and constructing attack paths afterward, ChainAgent uses an evolving exploit graph to guide source-code inspection. It searches backward from unmet preconditions for capability producers and forward from discovered capabilities for functional gadgets that consume or amplify them. Object-centered chaining knowledge from our empirical study directs searches toward promising vulnerability classes, functional operations, and object accesses. We evaluate ChainAgent against Codex, a general-purpose coding agent, on 15 PHP applications across three shared LLM backends. ChainAgent achieves 42.02%--44.63% recall for goal-reaching components and recovers up to 4.4 times as many correct goal-reaching dependency edges as Codex. An additional evaluation of 30 real-world PHP applications identifies 20 vulnerabilities and 13 exploit chains, nine of which achieve remote code execution (RCE).
Updated: 2026-11-19 02:52:06
标题: ChainAgent:PHP Web 应用程序中的自动化可链式漏洞发现
摘要: 针对 PHP Web 应用的高影响攻击通常会将能力有限的漏洞与其他缺陷或预期行为串联起来。发现这类攻击链需要识别漏洞,以及促成能力组合的依赖关系。现有漏洞发现技术通常孤立地分析缺陷,而攻击规划则假设相关组件已知。这种分离使得发现此前未知的组件变得困难,因为这些组件的安全相关性往往只有在其可能于漏洞利用链中发挥作用时才会显现。 我们提出 ChainAgent,一种目标导向的 LLM 智能体框架,能够在源代码中联合发现漏洞利用链组件及其能力依赖关系。在对 386 条真实世界 Web 漏洞利用链进行实证研究的基础上,ChainAgent 通过安全相关对象上的前置条件与能力来表示漏洞和功能小工具——即能够被重新用于攻击的预期程序行为。ChainAgent 不再先发现漏洞、随后构建攻击路径,而是利用不断演化的漏洞利用图来指导源代码检查。它从尚未满足的前置条件反向搜索能力提供者,并从已发现的能力正向搜索能够消耗或增强这些能力的功能小工具。实证研究所得的面向对象的链式关联知识,会将搜索引导至具有潜力的漏洞类别、功能操作和对象访问位置。 我们在三个共享的 LLM 后端上,以 15 个 PHP 应用为对象,将 ChainAgent 与通用编码智能体 Codex 进行了评估。对于能够到达目标的组件,ChainAgent 的召回率达到 42.02%–44.63%,并且发现的正确目标依赖边数量最高是 Codex 的 4.4 倍。在对另外 30 个真实世界 PHP 应用进行的评估中,我们发现了 20 个漏洞和 13 条漏洞利用链,其中 9 条能够实现远程代码执行(RCE)。
更新时间: 2026-11-19 02:52:06
领域: cs.CR,cs.AI
Asymmetric Optical Image Watermarking
Watermark detectors held by a provider cannot be checked by third parties, and a party that can detect a mark can usually also forge it. We study a two-layer image watermark in which the Fourier transform at the core of the pipeline is performed by a coherent optical 4F unit. Layer 1 carries an Ed25519 signature bound to the image content in Fourier magnitudes, so anyone with the public key verifies offline. Layer 2 is a key-defined carrier written by a secret phase hologram and read by a matched-filter correlator. The optics is a scalar-diffraction simulation with finite modulator bits, pixel aperture, pupil, defocus, misalignment, and sensor noise. No hardware is built. All criteria were fixed in a hashed specification before any optical result. The simulated optical signer reproduces the digital pipeline (field error 1.7e-15, bit agreement 99.997%), verifies at least 99.5% of 877 images under each of 8 post-sensor settings, one unattacked, and accepts none of 40,670 unmarked images. The optical carrier is key-selective: the matched key detects it on 99.8% of the unattacked images, and detection falls to 0% under a scale error of 1% and to 0% under a mask shift of 1 bin. Security rests on the signature and the content binding, for which we separate what is provable from what is measured.
Updated: 2026-11-19 02:41:34
标题: 非对称光学图像水印
摘要: 由提供方持有的水印检测器无法接受第三方检验,而能够检测某种标记的一方通常也能够伪造该标记。我们研究了一种双层图像水印,其中,处理流程核心的傅里叶变换由相干光学 4F 单元完成。第 1 层在傅里叶幅度中携带与图像内容绑定的 Ed25519 签名,因此任何持有公钥的人都可以离线验证。第 2 层是由秘密相位全息图写入、并由匹配滤波相关器读取的密钥定义载波。光学部分采用标量衍射仿真,并纳入有限调制器位数、像素孔径、光阑、离焦、失准和传感器噪声等因素。未构建硬件。在获得任何光学结果之前,所有判据均已预先写入经过哈希的规格说明中。模拟光学签名器复现了数字处理流程(场误差为 1.7e-15,位一致率为 99.997%);在 8 种传感器后处理设置下,对 877 幅图像中的至少 99.5% 进行了验证,其中一种设置未受到攻击;对于 40,670 幅未加标记的图像,则没有一幅被接受。光学载波具有密钥选择性:匹配密钥能够在 99.8% 的未受攻击图像上检测到该载波;当缩放误差为 1% 时,检测率降至 0%,当掩模偏移 1 个仓位时,检测率也降至 0%。安全性依赖于签名及其与内容的绑定;对于后者,我们区分了可证明的部分与实测的部分。
更新时间: 2026-11-19 02:41:34
领域: cs.CR,cs.CV
From FIPS to FPGA with LLM Agents: Measuring What Tests and Reviews Miss in Post-Quantum Cryptographic Hardware
As LLM agents increasingly generate RTL alongside the tests and reviews that validate it, self-generated evidence is a weak foundation for trustworthy hardware. We present our seven-stage verification-gated workflow, evolved during a post-quantum design port, in which a gate counts only if shown able to fail on negative controls and fault mutants, and reviewer agents audit work before commit. We then audit this evidence with tool-selected netlist mutants, flaw replays, and formal checks. The flow ported an ML-KEM-768/ML-DSA-65 accelerator to a 300 MHz Zynq UltraScale+ key-custody card: all six operations are byte-exact on the board, and it passes all 85 interface-applicable NIST ACVP cases (of 285) and 484 ML-DSA known answers. However, passing module tests overstate the verification strength. Across three RTL modules, existing simulation gates kill only 76% of 399 tool-selected netlist mutants; specification-derived tests guided by the survivors raise the fresh-draw decapsulation kill rate from 48% to 74%. In pre-registered single-model replays on flaws invisible to known-answer tests, undirected whole-design review catches two verifier flaws in only 3/6 and 1/6 sessions, whereas module-scoped review catches every known flaw in all 54 sessions. Even scoped review detects planted key-custody flaws in only 3/20 sessions, whereas formal checks (one added for the replay) flag every one. In this study, trustworthy agentic hardware needed author-independent mutants for test gates, module-level scoping for LLM review, and formal checks for custody invariants.
Updated: 2026-11-19 01:25:35
标题: 从 FIPS 到 FPGA:用大语言模型代理衡量测试和审查在后量子密码硬件中遗漏的内容
摘要: 随着大语言模型(LLM)代理越来越多地在生成 RTL 的同时生成用于验证和评审 RTL 的测试与审查,自生成证据便成为构建可信硬件的薄弱基础。我们提出了一种七阶段、由验证门控的工作流程,该流程在一次后量子设计移植过程中不断演进:只有在证明某个门控能够在负向对照和故障变异体上触发失败时,该门控才会被计入;此外,评审代理会在提交前审查相关工作。随后,我们使用工具选定的网表变异体、缺陷重演和形式化检查对这些证据进行审计。 该流程将一款 ML-KEM-768/ML-DSA-65 加速器移植到一张运行频率为 300 MHz 的 Zynq UltraScale+ 密钥托管卡上:六项操作在板上均实现了逐字节精确,且通过了 NIST ACVP 中全部 85 个适用接口的测试用例(共 285 个)以及 484 个 ML-DSA 已知答案测试。然而,通过模块测试会高估验证强度。在三个 RTL 模块中,现有仿真门控只能杀死工具选定的 399 个网表变异体中的 76%;根据未被杀死的变异体所指导、由规范派生的测试,将新抽取样本上的解封装变异体杀死率从 48% 提高到 74%。 在预先注册的单模型重演实验中,针对已知答案测试无法发现的缺陷,无定向的全设计评审在 6 次会话中仅有 3 次发现某个验证器缺陷,在另一个缺陷上则仅有 1/6 次发现;相比之下,模块范围限定的评审在全部 54 次会话中发现了每一个已知缺陷。即使采用范围限定的评审,对于植入的密钥托管缺陷也只能在 20 次会话中发现 3 次;而形式化检查(其中一项是专为该重演新增的检查)则发现了所有缺陷。 在本研究中,要实现可信的代理式硬件,需要由作者独立构造的变异体来验证测试门控,需要按模块限定范围来开展 LLM 评审,还需要使用形式化检查来验证托管不变量。
更新时间: 2026-11-19 01:25:35
领域: cs.CR,cs.AI,cs.AR
HDKEM: Authentication Allocation for Deniable Hybrid Key Exchange
A deniable authenticated key exchange (DAKE) establishes an authenticated shared key without giving third parties proof of participation. Post-quantum DAKEs use ring signatures, message authentication codes, or split key-encapsulation mechanisms, which differ in who can authenticate and how deniability is achieved. We introduce \emph{authentication allocation} to classify which parties hold secrets that produce accepted authentication messages. For protocols using a fixed two-member ring, we prove that an accuser can simulate a session by either sharing the accused party's authentication key or signing with its own ring key. Thus, deniability relies on key sharing or the ring signature's ability to hide its signer. We propose \HDKEM, combining ML-KEM-768, X25519, and an optional pre-shared or quantum key distribution (QKD)-delivered key $k_3$ through a split-key pseudorandom function. The session key remains secret if at least one input remains secure. Since provisioning services and QKD key managers may know $k_3$, the client always authenticates with its own ring key; the mode determines whether other holders of $k_3$ can impersonate the server. Four modes are supported: \emph{source-backed} authenticates the server through key confirmation under $k_3$, allowing its holders to impersonate the server; \emph{hide} also encrypts the client's signature; \emph{mutual} adds a server ring signature to prevent such impersonation; and \emph{source-less} authenticates both endpoints with ring signatures without $k_3$. We prove extended Canetti--Krawczyk (eCK) session-key secrecy in the quantum random-oracle model, explicit authentication, forward secrecy, and session-partner deniability, with a concrete deniability bound in the classical random-oracle model. With FalconRS, source-backed mode sends 3,813~bytes in about 26~ms, versus 5,101~bytes and 47~ms in mutual mode.
Updated: 2026-11-19 01:13:13
标题: HDKEM:可否认混合密钥交换的认证分配
摘要: 不可否认认证密钥交换(DAKE)能够建立经认证的共享密钥,同时不向第三方提供参与会话的证据。后量子 DAKE 使用环签名、消息认证码或分离式密钥封装机制;这些方案在能够进行认证的参与方以及实现不可否认性的方式上各不相同。我们引入“认证分配”这一概念,用于分类哪些参与方持有能够生成可接受认证消息的秘密。对于使用固定双成员环的协议,我们证明,控告者可以通过共享被控告方的认证密钥,或使用自己的环密钥进行签名,来模拟一次会话。因此,不可否认性依赖于密钥共享,或依赖于环签名隐藏签名者的能力。 我们提出 HDKEM,通过分离式伪随机函数,将 ML-KEM-768、X25519 以及一个可选的预共享密钥或由量子密钥分发(QKD)提供的密钥 \(k_3\) 结合起来。只要至少有一个输入仍然安全,会话密钥就能保持机密。由于配置服务和 QKD 密钥管理器可能知晓 \(k_3\),客户端始终使用自己的环密钥进行认证;具体模式决定了其他 \(k_3\) 持有者是否能够冒充服务器。该方案支持四种模式:“源支持”模式通过基于 \(k_3\) 的密钥确认来认证服务器,因此 \(k_3\) 的持有者可以冒充服务器;“隐藏”模式还会加密客户端的签名;“相互”模式增加服务器环签名,以防止此类冒充;“无源”模式则不使用 \(k_3\),而是通过环签名认证通信双方。 我们在量子随机预言机模型中证明了扩展 Canetti–Krawczyk(eCK)会话密钥机密性、显式认证、前向保密性以及会话伙伴不可否认性,并在经典随机预言机模型中给出了具体的不可否认性界限。使用 FalconRS 时,“源支持”模式传输 3,813 字节,耗时约 26 毫秒;相比之下,“相互”模式传输 5,101 字节,耗时 47 毫秒。
更新时间: 2026-11-19 01:13:13
领域: cs.CR
Verified Netlist-to-RTL Recovery with LLM Agents
Gate-level netlists circulate among IP integrators and foundries and can be extracted from chips. Reverse engineering them into readable register-transfer-level (RTL) code would help an adversary understand and modify a design, but remains difficult because word-level operations are scattered across many gates. Large language models (LLMs) can write and optimize RTL, but often fail to recover it from a whole netlist. We propose LOCA (LOgic Cone Attack), an LLM-based attack that divides an anonymized netlist into logic cones, has parallel agents rewrite them, and assembles compact RTL. Each cone contains the complete next-state logic of a group of related registers, giving an agent a small, meaningful task. Of five partitioning methods tested, only grouped cones lead to recovery. LOCA keeps only RTL proven equivalent to the netlist and measures its quality by compression. Function-preserving obfuscation does not stop LOCA on the tested designs, whereas unknown keys or hidden cell functions prevent it from proving recovery of the original design. Across 21 model-design pairs, LOCA recovers 17, versus 6 with whole-netlist prompting. Per-run recovery across models rises from 5% to 74%, at a median cost below one dollar with a low-cost model.
Updated: 2026-11-19 00:58:40
标题: 使用大语言模型智能体验证网表到 RTL 的恢复
摘要: 门级网表在知识产权(IP)集成商和晶圆代工厂之间流转,也可以从芯片中提取出来。将其逆向工程为可读的寄存器传输级(RTL)代码,有助于攻击者理解并修改设计;但由于字级操作分散在大量门电路中,这一过程仍然十分困难。大型语言模型(LLM)能够编写和优化 RTL,却往往无法从完整网表中恢复 RTL。我们提出 LOCA(LOgic Cone Attack,逻辑锥攻击),这是一种基于 LLM 的攻击方法:将匿名化网表划分为逻辑锥,由并行智能体分别重写这些逻辑锥,再将其组装成紧凑的 RTL。每个逻辑锥包含一组相关寄存器的完整下一状态逻辑,从而为智能体提供规模较小且具有明确意义的任务。在测试的五种划分方法中,只有分组逻辑锥能够实现恢复。LOCA 仅保留经过证明与网表等价的 RTL,并通过压缩率衡量其质量。在所测试的设计中,保持功能不变的混淆无法阻止 LOCA;而未知密钥或隐藏的单元功能则会阻止其证明已恢复原始设计。在 21 个模型—设计组合中,LOCA 成功恢复了 17 个,而对完整网表直接进行提示时仅成功恢复 6 个。不同模型的单次运行恢复率从 5% 提升至 74%;使用低成本模型时,中位数成本低于 1 美元。
更新时间: 2026-11-19 00:58:40
领域: cs.CR,cs.AR
QUASI: Post-Quantum Quorum Attestation of Pre-Validated Statements
We present QUASI, a newly conceived class of hash-based, post-quantum-secure protocols that enable a group of parties to produce a publicly verifiable attestation about a pre-validated statement. QUASI produces attestations that reduce the size and verification cost to a fraction of a full hash-based signatures collection, without relying on SNARKs or a trusted setup. QUASI rests on a surprising discovery: each party need not sign the entire statement. Authenticating only a small subset of symbols suffices for a quorum to attest to the whole. We turn this insight into a randomized construction that achieves reductions of more than 10x in per-party contribution size and hash computations for generation and verification, compared with full hash-based signatures. QUASI is a generic primitive supporting diverse applications. Operationally, QUASI requires no additional interactive setup or preprocessing beyond independent key generation by parties for the underlying hash-based authentication scheme. Two principal use cases are external attestation for signature-free consensus, enabling clients to verify statements about committed state; and preprocessing for SNARK-based aggregation, compounding QUASI's savings with succinct-proof compression.
Updated: 2026-11-19 00:20:35
标题: QUASI:预验证陈述的后量子法定人数证明
摘要: 我们提出 QUASI,这是一类新构想的基于哈希、具备后量子安全性的协议,使一组参与方能够就一个已预先验证的陈述生成可公开验证的证明。与完整的基于哈希的签名集合相比,QUASI 生成的证明将规模和验证成本降低至其一小部分,且无需依赖 SNARK 或可信设置。 QUASI 建立在一个出人意料的发现之上:每个参与方无需对整个陈述进行签名。只要对少量符号进行认证,就足以让一个法定人数的参与方为整个陈述提供证明。我们将这一洞见转化为一种随机化构造。与完整的基于哈希的签名相比,该构造使每个参与方的贡献大小以及生成和验证过程中的哈希计算量均减少十倍以上。 QUASI 是一种支持多种应用的通用原语。在实际运行中,除参与方针对底层基于哈希的认证方案独立生成密钥外,QUASI 无需额外的交互式设置或预处理。其两个主要用例是:用于无签名共识的外部证明,使客户端能够验证关于已提交状态的陈述;以及作为基于 SNARK 的聚合的预处理,通过简洁证明压缩进一步叠加 QUASI 所带来的节省。
更新时间: 2026-11-19 00:20:35
领域: cs.CR