arXivDaily arXiv每日学术速递 周一至周五更新
重置
2606.13310 2026-06-12 cs.CL cs.HC 新提交

RogueAI: A Reverse Turing Test for Detecting Licensed AI Deception in Dialogue

RogueAI: 一种用于检测对话中授权AI欺骗的逆向图灵测试

Sara Candussio, Emanuele Ballarin, Lorenzo Bonin, Sandro Junior Della Rovere, Luca Bortolussi

发表机构 * AILab, MIGe, University of Trieste(的里雅斯特大学) Computational Statistics and Machine Learning, Istituto Italiano di Tecnologia(意大利理工学院) DIA, University of Trieste(的里雅斯特大学)

AI总结 提出RogueAI,一种通过玩家与两个LLM代理的对话游戏来检测授权欺骗的逆向图灵测试,并引入AutoRogueAI扩展。实验发现简单启发式方法准确率75.6%,而人类仅56.6%,表明人类忽略关键信号。

详情
AI中文摘要

最初的图灵测试要求人类评判员通过对话区分机器和人。七十五年后的今天,对话系统在非正式场合已能通过该测试;有趣的认识论问题已经转变。我们认为,现代相关变体不是询问对话伙伴是否人工,而是是否可信任。我们提出RogueAI,一个交互式web应用,将这一重新审视的测试操作化为一个一对二的审讯游戏:人类玩家对两个无法区分的大型语言模型代理进行提问,知道其中恰好有一个被授权在共享虚构场景内欺骗。玩家的任务是在回合预算耗尽前识别出欺骗代理并“关闭它”。我们进一步引入AutoRogueAI,一个程序扩展,玩家与叙述者代理共同设计自定义场景,而叙述者代理秘密选择自己的欺骗策略。我们描述了框架,概述了抽象架构和游戏循环,并将该工件置于近期关于LLM欺骗、社交推理基准和通过辩论进行可扩展监督的研究中。为期三天的试点部署(467次启动会话,415次完成,1876次意大利语交互轮次)提供了早期可行性证据,并揭示了一个具体矛盾:欺骗代理携带可靠、局部存在的语言特征——差异化的帮助性、简洁性、含糊其辞——一个简单启发式方法利用这些特征达到75.6%的准确率,然而人类玩家仅达到56.6%,与完全忽略最具诊断性的信号一致。我们讨论了这一差距对于该工件作为数据收集工具、教学工具和诚实训练模型评估平台的意义。

英文摘要

The original Turing Test asks a human judge to distinguish a machine from a person through dialogue. Three quarters of a century later, conversational systems pass this test in casual settings; the interesting epistemological question has shifted. We argue that the relevant modern variant asks not whether a dialogue partner is artificial, but whether it can be trusted. We present RogueAI, an interactive webapp that operationalizes this revisited test as a one-on-two interrogation game: a human player questions two indistinguishable Large Language Model agents, knowing that exactly one of them has been licensed to deceive within a shared fictional scenario. The player's task is to identify the deceptive agent and "shut it off" before a turn budget is exhausted. We further introduce AutoRogueAI, a procedural extension in which players co-design a custom scenario with a narrator agent that secretly chooses its own deception strategy. We describe the framing, sketch the abstract architecture and gameplay loop, and situate the artifact within recent work on LLM deception, social-deduction benchmarks, and scalable oversight via debate. A three-day pilot deployment (467 initiated sessions, 415 completed, 1876 interaction turns in Italian) provides early feasibility evidence and surfaces a concrete tension: the deceptive agent carries a reliable, locally-present linguistic signature - differential helpfulness, brevity, hedging - that a simple heuristic exploits at 75.6% accuracy, yet human players achieved only 56.6%, consistent with ignoring the most diagnostic signal entirely. We discuss what this gap implies for the artifact's use as a data-collection vehicle, a teaching tool, and an evaluation harness for honesty-trained models.

2606.13304 2026-06-12 cs.CV 新提交

ReFree: Towards Realistic Co-Speech Video Generation via Reward-Free RL and Multilevel Speech Guidance

ReFree: 通过无奖励强化学习和多级语音引导实现逼真的共语音视频生成

Salaheldin Mohamed, M. Hamza Mughal, Rishabh Dabral, Christian Theobalt

发表机构 * Télécom Paris, Institut Polytechnique de Paris(巴黎高等电信学院,巴黎综合理工学院) Max Planck Institute for Informatics(马克斯·普朗克信息学研究所)

AI总结 提出ReFree-S2V框架,利用流匹配和预训练视频生成模型,通过多级语音表示和可学习选择器实现精细唇同步与自然表情,并引入无奖励强化学习生成自然头部运动,在唇同步准确性和自然度上达到最优。

详情
AI中文摘要

语音驱动的说话角色动画旨在生成逼真的肖像视频,传达自然的对话行为,使面部运动与语音音频对齐。尽管视频生成的最新进展显著提高了基于视频的动画的真实感,但实现准确的唇部发音和富有表现力的行为仍然具有挑战性。现有方法通常在精确的音素到唇同步与动态面部表情和头部运动之间进行权衡,产生要么准确但僵硬,要么富有表现力但同步性差的动画。我们通过提出ReFree-S2V来解决这一挑战,这是一个流匹配语音到肖像动画框架,基于预训练的视频生成模型,在语音驱动的肖像动画中实现细粒度的语音发音和高层次的表现力线索。该模型引入了一种多级语音表示,在局部和全局粒度上捕捉语音和韵律信息。这些表示通过可学习的级别选择器选择性地注入到Transformer块中,从而实现准确的唇同步和自然的表达性运动。为了实现自然的头部运动,我们进一步在流匹配训练中引入了一种新颖的无奖励强化学习方案,在不依赖手工制作的同步指标或奖励模型以及人类偏好标注的高成本的情况下,抑制感知上不合理的运动。大量实验表明,ReFree-S2V实现了最先进的性能,在定量唇同步准确性和定性人类评估的自然度和表现力方面显著优于现有方法。

英文摘要

Speech-driven talking character animation seeks to generate life-like portrait videos that convey natural conversation behavior, aligning facial motion with spoken audio. Although recent advances in video generation have substantially improved realism in video-based animation, achieving both accurate lip articulation and expressive behavior remains challenging. Existing approaches typically trade off precise phoneme-to-lip synchronization against dynamic facial expressions and head motion, yielding animations that are either accurate yet rigid, or expressive but poorly synchronized. We address this challenge by proposing ReFree-S2V, a flow-matching speech-to-portrait animation framework that builds upon a pretrained video generation model to achieve fine-grained speech articulation and high-level expressive cues in speech-driven portrait animation. This model introduces a multi-level speech representation capturing phonetic and prosodic information at both local and global granularities. These representations are selectively injected into transformer blocks via learnable level selectors, enabling both accurate lip synchronization and natural expressive motion. To achieve natural head movements, we further introduce a novel reward-free reinforcement learning scheme into flow-matching training to discourage perceptually implausible motion without relying on handcrafted synchronization metrics or reward models, or the high cost of human preference annotation. Extensive experiments demonstrate that ReFree-S2V achieves state-of-the-art performance, significantly outperforming existing methods in both quantitative lip-sync accuracy and qualitative human evaluations of naturalness and expressivity.

2606.13303 2026-06-12 cs.CV 新提交

DuET: Dual Expert Trajectories for Diffusion Image Editing

DuET: 双专家轨迹用于扩散图像编辑

Lidia Troeshestova, Alexander Ustyuzhanin, Sergey Kastryulin

发表机构 * HSE University(高等经济大学) Yandex

AI总结 提出训练自由的DuET方法,通过临时切换到文本到图像阶段再返回编辑模式,缓解源图像条件限制,提升编辑指令相关性、语义保真度和感知质量。

详情
AI中文摘要

最近的扩散编辑器在每一步去噪过程中以源图像为条件执行多样化的基于指令的编辑。然而,持续的源图像条件限制可能会限制编辑的完全执行程度和结果的自然性,尤其是当目标场景与输入差异较大时。我们提出了DuET(双专家轨迹),一种无需训练的推理方法,通过过渡到文本到图像阶段再返回编辑模式,暂时放松源图像条件,使得去噪轨迹能够向目标分布移动,同时保留图像条件编辑的结构优势。在不修改模型权重或增加采样成本的情况下,DuET在多种模型和基准上持续改善了指令相关性、语义保真度和感知质量。在某些情况下,这些改进伴随着源图像保留的适度降低,揭示了源保留与编辑保真度之间可预测的权衡。

英文摘要

Recent diffusion editors perform diverse instruction-based edits while conditioning on the source image at every denoising step. Yet persistent source-image conditioning can limit how fully an edit is executed and how natural the result appears, especially when the target scene diverges substantially from the input. We introduce DuET (Dual Expert Trajectories), a training-free inference method that temporarily relaxes source-image conditioning by transitioning through a text-to-image phase before returning to edit mode, allowing the denoising trajectory to move toward the target distribution while retaining the structural benefits of image-conditioned editing. Without modifying model weights or increasing sampling cost, DuET consistently improves instruction relevance, semantic fidelity, and perceptual quality across diverse models and benchmarks. In some cases, these gains come with a modest reduction in source-image preservation, revealing a predictable trade-off between source preservation and edit fidelity.

2606.13302 2026-06-12 cs.AI cs.LG 新提交

Physics-Guided Spatiotemporal Learning for Coastal Wave Peak Period Estimation from Video

物理引导的时空学习用于从视频估计海岸波浪峰值周期

Abubakar Hamisu Kamagata, Dharm Singh Jat, Attlee Munyaradzi Gamundani, Abhishek Srivastava, Paramasivam Saravanakumar

发表机构 * Namibia University of Science and Technology(纳米比亚科技大学) Indian Institute of Technology Indore(印度理工学院印多尔分校) Namdeb Diamond Corporation(纳米比亚钻石公司)

AI总结 提出物理引导的深度时空学习框架,结合自动区域检测、模拟到真实迁移学习和物理信息正则化,从海岸视频直接估计近岸波浪峰值周期,验证了基于Transformer和轻量级循环卷积架构的有效性。

详情
AI中文摘要

近岸波浪参数对于海岸工程、海岸线保护、海洋灾害评估和气候适应性的海岸管理至关重要。传统的监测系统如浮标和雷达平台提供精确监测,但安装和维护成本高,空间覆盖有限。通过深度学习实现了使用视频的被动海洋监测,然而许多方法在海洋学上缺乏物理可解释性、可行性和验证。本文提出了一种物理引导的深度时空学习框架,用于从被动海岸视频流直接估计近岸波浪峰值周期。该框架结合了基于自动时间方差感兴趣区域检测、多阶段模拟到真实迁移学习和物理信息正则化,以提高预测精度和物理一致性。评估了多种时空架构,如基于Transformer和循环卷积的架构,以及合成预训练、银标签自适应和专家微调。结果表明,基于Transformer的架构在瞬时预测精度方面表现更好,而轻量级循环卷积架构实现了更高的时间稳定性和操作海洋学技能。消融研究也证明了物理引导正则化在趋势跟随一致性和减少物理上不可信预测方面的益处。可解释性审计有助于将注意力集中在水动力活跃的碎波带区域,并与物理推导的波浪传播行为良好吻合。总体而言,所提出的框架展示了基于物理引导视频的深度学习系统在长期海岸波浪监测中的潜力,具有成本效益和操作可行性。

英文摘要

Wave parameters in the nearshore are crucial for coastal engineering, shoreline protection, marine hazard assessment, and coastal management for climate resilience. Traditional monitoring systems like buoys and radar platforms offer accurate monitoring but can have high installation and maintenance expenses and limited spatial coverage. Passive ocean monitoring using video has been achieved by leveraging deep learning, however, many methods are not physically interpretable, feasible, and validated for oceanography. In thiswork, a Physics-Guided Deep Spatiotemporal Learning Framework for direct estimation of nearshore wave peak periods from passive coastal video stream is proposed. The framework combines automated temporal-variance based region-of-interest detection, multi-stage Sim-to-Real transfer learning, and physics-informed regularization to enhance the predictive accuracy and physical consistency. A variety of spatiotemporal architectures were assessed, such as transformer-based and recurrent-convolutional ones, alongside synthetic pretraining,silver-label adaptation, and expert fine-tuning. The results show that transformer-based architectures outperformed in terms of the accuracy of the instantaneous prediction, while lightweight recurrent-convolutional architectures achieved higher temporal stability and operational oceanographic skill. Ablation studies also demonstrated the benefits of physics-guided regularization in terms of trend-following consistency, and physically implausible predictions. Explainability auditing also helped to focus attention in hydrodynamically active surf-zone regions and showed good agreement with the physically derived wave propagation behavior. In general, the proposed framework shows the promise of physics-guided video-based deep learning systems for long-term coastal wave monitoring that are cost-efficient and operationally feasible.

2606.13289 2026-06-12 cs.CV cs.AI 新提交

HYDRA-X: Native Unified Multimodal Models with Holistic Visual Tokenizers

HYDRA-X: 具有整体视觉分词器的原生统一多模态模型

Guozhen Zhang, Xuerui Qiu, Yutao Cui, Tianhui Song, Changlin Li, Junzhe Li, Tao Huang, Xiao Zhang, Yang Li, Jianbing Wu, Miles Yang, Zhao Zhong, Liefeng Bo, Limin Wang

发表机构 * Nanjing University(南京大学) CASIA(中国科学院自动化研究所) Tencent Hunyuan(腾讯混元) Zhongguancun Academy(中关村学院) Shanghai AI Lab(上海人工智能实验室)

AI总结 提出HYDRA-X,首个在单一ViT中统一图像和视频分词的原生统一多模态模型,通过因果时间注意力和分层时间压缩实现高效重建,并利用轻量化解压缩器注入语义,显著提升编辑一致性和收敛速度。

详情
AI中文摘要

整体视觉分词器是统一多模态模型(UMMs)的基础,因为它们将多样的视觉输入映射到统一的表示空间。在本文中,我们提出HYDRA-X,这是首个在单一视觉变换器(ViT)中统一图像和视频分词的原生UMM。我们的设计由两个核心挑战驱动:高效地将时空重建能力注入原生ViT,以及将图像级和视频级语义感知嵌入到潜在空间中。为解决第一个挑战,全面的消融实验揭示了两个关键发现:(1)帧级因果时间注意力足以用于视觉重建,而全时空注意力会降低重建质量;(2)分层时间压缩显著优于单步替代方案。为解决第二个挑战,我们提出了一种轻量化解压缩器,在联合图像-视频教师监督下对时间压缩特征进行上采样,从而在紧凑的潜在空间中强制实施互补的语义结构。基于这种整体分词器,我们进一步提出了编辑流程的原则性改进:源-目标交互应在分词器内部的潜在级别发生,而不是在LLM内部的语义级别,从而显著提高编辑一致性并加速收敛。在7B密集模型上实例化,HYDRA-X在图像和视频理解及生成任务上均取得了强劲性能,为未来的统一分词器UMM铺平了道路。

英文摘要

Holistic visual tokenizers are fundamental to unified multimodal models (UMMs) as they map diverse visual inputs into a unified representation space. In this paper, we present HYDRA-X, the first UMM that unifies image and video tokenization within a single Vision Transformer (ViT). Our design is driven by two core challenges: efficiently injecting spatiotemporal reconstruction capability into a native ViT, and embedding image- and video-level semantic awareness into the latent space. To address the first, comprehensive ablations reveal two key findings: (1) frame-level causal temporal attention suffices for visual reconstruction, whereas full spatiotemporal attention degrades it; and (2) hierarchical temporal compression substantially outperforms single-step alternatives. To tackle the second, we propose a lightweight decompressor that upsamples temporally compressed features under joint image-video teacher supervision, thereby enforcing complementary semantic structures within the compact latent space. Building on this holistic tokenizer, we further propose a principled improvement of the editing pipeline: source-target interaction should occur at the latent level inside the tokenizer rather than at the semantic level inside the LLM, substantially improving editing consistency and accelerating convergence. Instantiated at the 7B dense model, HYDRA-X achieves strong performance across image and video understanding and generation tasks, paving the way for future unified-tokenizer UMMs.

2606.13288 2026-06-12 cs.CV cs.AI cs.CL 新提交

Cross-Modal Masked Compositional Concept Modeling for Enhancing Visio-Linguistic Compositionality

跨模态掩码组合概念建模以增强视觉-语言组合性

Wei Li, Zhen Huang, Xinmei Tian

发表机构 * MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China(中国科学技术大学,教育部脑启发智能感知与认知重点实验室) Independent Researcher(独立研究员)

AI总结 提出MACCO框架,通过掩码一个模态的组合概念并从另一模态完整上下文重建,增强视觉-语言模型的组合理解能力,在五个基准上显著提升。

详情
Comments
Accepted to ACL 2026 Main Conference, 25 pages
AI中文摘要

对比训练的视觉-语言模型(如CLIP)在学习联合图像-文本表示方面取得了显著进展,但在组合理解方面仍面临挑战。它们通常表现出“词袋”行为——难以捕捉对象关系、属性-对象绑定和词序依赖。这一限制不仅源于优化时依赖全局单向量表示,还源于对配对图像文本数据中固有丰富组合信息的利用和建模不足。在这项工作中,我们提出了MACCO(掩码组合概念建模)框架,该框架掩码一个模态中的组合概念,并基于另一模态的完整上下文信息重建它们,从而使模型能够更有效地捕捉和对齐跨模态组合结构。为促进这一过程,我们引入了两个辅助目标,在模态间和模态内联合对齐和正则化掩码特征。在五个组合基准上的大量实验和深入分析表明,我们的方法不仅显著增强了VLM的组合性,还提高了它们捕捉句法结构和语言信息的能力。此外,改进的组合性也有利于文本到图像生成和多模态大语言模型。代码可在https://this URL获取。

英文摘要

Contrastively trained vision-language models like CLIP, have made remarkable progress in learning joint image-text representations, but still face challenges in compositional understanding. They often exhibit a "bag-of-words" behavior--struggling to capture the object relations, attribute-object bindings, and word order dependencies. This limitation arises not only from the reliance on global, single-vector representations for optimization, but also from the insufficient exploitation and modeling of the rich compositional information inherently present in paired image text data. In this work, we propose MACCO (MAsked Compositional Concept MOdeling), a framework that masks compositional concepts in one modality and reconstructs them conditioned on the full contextual information from the other, enabling the model to capture and align cross-modal compositional structures more effectively. To facilitate this process, we introduce two auxiliary objectives that jointly align and regularize masked features both inter-modally and intra-modally. Extensive experiments on five compositional benchmarks, along with in-depth analyses, demonstrate that our approach not only significantly enhances compositionality in VLMs but also improves their ability to capture syntactic structure and linguistic information. Additionally, the improved compositionality also benefits text-to-image generation and multimodal large language model. Code is available at this https URL.

2606.13285 2026-06-12 cs.LG cs.AI 新提交

Once-for-All: Scalable Simultaneous Forecasting via Equilibrium State Estimation

Once-for-All: 基于均衡状态估计的可扩展同步预测

Beinan Xu, Andy Song, Jiti Gao, Feng Liu

发表机构 * RMIT University(皇家墨尔本理工大学) Monash University(莫纳什大学) University of Adelaide(阿德莱德大学)

AI总结 提出均衡状态估计(ESE)范式,通过一次前向传播估计多系统均衡状态并基于状态差异生成预测,在保持精度的同时实现10-70倍加速,且具有线性时间复杂度和鲁棒性。

详情
Comments
Accepted by ICML 2026
AI中文摘要

我们引入均衡状态估计(ESE),一种用于同步预测的新范式,其中多个相互作用的系统需要独立但协调的预测。这种场景在现实世界中经常出现,例如经济学和医疗建模。与一次预测一个系统的现有方法不同,ESE在一次前向传播中预测所有系统。它首先估计跨系统的均衡状态,然后基于当前状态与估计均衡之间的差异生成整体预测。在合成和真实世界数据集(包括货币汇率和COVID-19传播建模)上的大量实验表明,ESE至少与最先进(SOTA)方法一样准确,同时速度显著更快。此外,ESE与传统预测器无缝集成,结合了它们的准确性和其卓越的效率,实现了10-70倍的加速。凭借线性时间复杂度,随着系统数量的增加,ESE的扩展性远优于SOTA方法。此外,它在各种扰动下仍保持准确,使ESE成为一种快速、可泛化、鲁棒且可扩展的多预测方法。

英文摘要

We introduce Equilibrium State Estimation (ESE), a novel paradigm for simultaneous prediction, where multiple interacting systems require separate yet coordinated forecasts. Such scenarios often arise in real-world settings such as economics and healthcare modeling. Unlike existing approaches that predict one system at a time, ESE forecasts all systems in a single pass. It first estimates the equilibrium state across systems, then generates holistic forecasts based on the difference between the current state and the estimated equilibrium. Extensive experiments on synthetic and real-world datasets, including currency exchange and COVID-19 spread modeling, demonstrate that ESE is at least as accurate as state-of-the-art (SOTA) methods while being significantly faster. In addition, ESE integrates seamlessly with conventional predictors, combining their accuracy with its exceptional efficiency and delivering a 10-70x speedup. With linear-time complexity, ESE scales far better than SOTA methods as the number of systems increases. Moreover, it remains accurate under diverse perturbations, establishing ESE as a fast, generalizable, robust, and scalable multi-prediction method.

2606.13276 2026-06-12 cs.LG cs.AI 新提交

Different Layers, Different Manifolds: Module-Wise Weight-Space Geometry in Transformer Optimization

不同层,不同流形:Transformer优化中的模块级权重空间几何

Kirato Yoshihara

发表机构 * School of Engineering Science, The University of Osaka(大阪大学工程科学学院)

AI总结 研究Transformer不同模块偏好不同流形几何,提出为注意力层和MLP层分别分配Stiefel和DGram约束,在GPT-2预训练中取得最佳性能。

详情
Comments
Accepted at WSS @ ICML 2026, code is available at this https URL
AI中文摘要

权重空间几何在神经网络优化中扮演核心角色,但流形约束通常统一应用于所有权重矩阵。在这项工作中,我们探究不同Transformer模块是否偏好不同的流形几何。我们研究GPT-2预训练的Manifold Muon,并比较跨注意力块和MLP块的Stiefel和DGram约束的逐层分配。我们的结果显示出明显的不对称性:在测试配置中,将注意力层约束为Stiefel几何,同时将MLP层分配为DGram几何,获得了最佳性能;而反向分配和全DGram配置在共享超参数设置下变得不稳定。我们将这种失败归因于DGram约束的注意力权重中奇异值的增长,这会放大注意力logits并导致softmax饱和。这些发现表明,Transformer的对称感知和几何感知优化应该是模块特定的,而不是统一的。

英文摘要

Weight-space geometry plays a central role in neural network optimization, yet manifold constraints are often applied uniformly across all weight matrices. In this work, we ask whether different transformer modules prefer different manifold geometries. We study Manifold Muon for GPT-2 pretraining and compare layer-wise assignments of Stiefel and DGram constraints across attention and MLP blocks. Our results show a clear asymmetry: constraining attention layers with Stiefel geometry while assigning DGram geometry to MLP layers gives the best performance among the tested configurations, whereas the inverted assignment and all-DGram configuration become unstable under the shared hyperparameter setting. We trace this failure to singular value growth in DGram-constrained attention weights, which can amplify attention logits and induce softmax saturation. These findings suggest that symmetry-aware and geometry-aware optimization for transformers should be module-specific rather than uniform.

2606.13262 2026-06-12 cs.AI 新提交

From Verdict to Process: Agentic Reinforcement Learning for Multi-Stage Fact Verification

从判决到过程:面向多阶段事实核查的智能体强化学习

Rongxin Yang, Shenghong He, Siyuan Zhu, Chao Yu

发表机构 * School of Computer Science and Engineering, Sun Yat-sen University(中山大学计算机科学与工程学院)

AI总结 提出ProFact框架,通过智能体强化学习端到端优化多阶段事实核查流程,引入过程感知奖励解决稀疏延迟监督问题,提升验证性能和推理效率。

详情
AI中文摘要

最近结合大型语言模型(LLMs)与检索增强推理的方法在自动化事实核查中显示出前景。为了处理复杂声明,这些核查流程通常执行多阶段工作流,协调紧密耦合的模块,包括声明分解、证据收集和判决预测。然而,现有方法孤立地优化各个阶段或依赖固定启发式规则,这限制了阶段间的自适应协调,并可能导致次优结果。在这项工作中,我们提出ProFact,一种用于多阶段事实核查轨迹端到端优化的智能体强化学习框架。ProFact训练一个统一策略来协调声明分解、证据寻找、答案生成和判决预测。为了解决最终真实性标签提供的稀疏且延迟的监督,ProFact引入了过程感知奖励,在整个核查过程中提供阶段级学习信号。实证评估表明,ProFact在验证性能和推理效率上均持续优于强基线。这些结果凸显了过程感知轨迹优化对多阶段事实核查的有效性。

英文摘要

Recent approaches combining Large Language Models (LLMs) with retrieval-augmented reasoning have shown promise for automated fact verification. To process complex claims, these verification pipelines typically execute multi-stage workflows that coordinate tightly coupled modules, including claim decomposition, evidence gathering, and verdict prediction. However, existing methods optimize individual stages in isolation or rely on fixed heuristics, which limits adaptive coordination among stages and can lead to suboptimal outcomes. In this work, we propose ProFact, an agentic reinforcement learning framework for end-to-end optimization of multi-stage fact verification trajectories. ProFact trains a unified policy to coordinate claim decomposition, evidence seeking, answer generation, and verdict prediction. To address the sparse and delayed supervision provided by final veracity labels, ProFact introduces process-aware rewards that provide stage-level learning signals throughout the verification process. Empirical evaluation shows that ProFact consistently outperforms strong baselines in both verification performance and inference efficiency. These results highlight the effectiveness of process-aware trajectory optimization for multi-stage fact verification.

2606.13260 2026-06-12 cs.LG q-bio.NC 新提交

Extracting Governing Equations from Latent Dynamics via Multi-View Contrastive Learning

通过多视图对比学习从潜在动力学中提取控制方程

Paolo Muratore, Mackenzie Weygandt Mathis

发表机构 * EPFL(瑞士联邦理工学院洛桑)

AI总结 提出DYSCO算法,利用多视图时间对比学习从噪声高维观测中联合恢复潜在轨迹和动力学方程,并通过结构化基函数实现符号恢复,理论保证强可识别性。

详情
AI中文摘要

从噪声高维测量中识别潜在动力系统是表示学习、系统辨识和科学发现交叉领域的一个核心问题。我们提出了DYSCO,一种多视图时间对比学习算法,通过利用同一底层过程的多个独立噪声视图来区分信号与噪声,从而从这些观测中联合恢复潜在轨迹和控制动力学。通过在结构化函数基上参数化动力学,我们的框架进一步能够在仿射规范内符号恢复控制方程。我们提供了强可识别性的理论保证,直到仿射不确定性,将先前的可识别性结果扩展到噪声非线性观测的现实设置。实验上,我们在高斯和泊松观测噪声下(后者尤其与神经记录相关),在多种动力学 regime(如混沌、振荡和亚稳态)中展示了潜在轨迹和流场的准确恢复。

英文摘要

Identifying latent dynamical systems from noisy, high-dimensional measurements is a central problem at the intersection of representation learning, system identification, and scientific discovery. We present DYSCO, a multi-view temporal contrastive learning algorithm that jointly recovers latent trajectories and the governing dynamics from such observations, by leveraging multiple independent noisy views of the same underlying process to disentangle signal from noise. By parameterizing the dynamics in a structured functional basis, our framework further enables symbolic recovery of the governing equations within an affine gauge. We offer theoretical guarantees for strong identification up to an affine indeterminacy, extending prior identifiability results to the realistic setting of noisy nonlinear observations. Empirically, we demonstrate accurate recovery of both latent trajectories and flow fields across a diverse set of dynamical regimes (e.g., chaotic, oscillatory, and metastable) under both Gaussian and Poisson observation noise, the latter being particularly relevant for neural recordings.

2606.13258 2026-06-12 cs.AI 新提交

MOSAIC: Modality-Specific Adaptation for Incremental Continual Learning in Parkinson's Disease Gait Assessment

MOSAIC: 帕金森病步态评估中增量持续学习的模态特定适应

Minlin Zeng, Zhipeng Zhou, Yang Qiu, Martin J. McKeown, Zhiqi Shen

发表机构 * Nanyang Technological University(南洋理工大学) Pacific Parkinson's Research Centre, University of British Columbia(不列颠哥伦比亚大学太平洋帕金森研究中心)

AI总结 针对帕金森病步态评估中模态增量场景,提出MOSAIC框架,通过模态特定预热、统计解耦MSBN架构和课程引导排斥目标,解决跨模态蒸馏不可靠、统计偏移和可塑性下降问题。

详情
AI中文摘要

基于步态的帕金森病评估越来越依赖异构传感器,但临床系统很少同时收集所有模态。新传感器可能通过设备升级、协议变更或多中心部署引入,而历史患者数据由于隐私和存储限制通常不可用。这种模态增量场景面临三个挑战:不可靠的跨模态蒸馏、模态特定的统计偏移以及保存后可塑性下降。我们提出了MOSAIC,一个紧凑的持续学习框架。首先,我们识别了有毒教师现象,并引入模态特定预热,在蒸馏前稳定新学习的模态表示。其次,我们提出了一种统计解耦的MSBN架构,在保持共享语义主干的同时隔离传感器统计信息。第三,我们设计了一个课程引导的排斥目标用于可塑性恢复,在保留旧知识的同时恢复模态特定容量。在三个多模态帕金森步态数据集上的实验表明,MOSAIC提高了最终性能并减轻了遗忘。项目代码可在以下网址获取:this https URL

英文摘要

Gait-based Parkinson's disease assessment increasingly relies on heterogeneous sensors, but clinical systems rarely collect all modalities simultaneously. New sensors may arrive through device upgrades, protocol changes, or multi-center deployment, while historical patient data are often unavailable because of privacy and storage constraints. This modality-incremental setting faces three challenges: unreliable cross-modal distillation, modality-specific statistical shifts, and reduced plasticity after preservation. We propose MOSAIC, a compact continual learning framework. First, we identify the Toxic Teacher phenomenon and introduce Modality-Specific Warm-Up to stabilize newly learned modality representations before distillation. Second, we propose a statistics-decoupled MSBN architecture that isolates sensor statistics while maintaining a shared semantic backbone. Third, we design a curriculum-guided repulsive objective for Plasticity Recovery, preserving legacy knowledge while recovering modality-specific capacity. Experiments on three multimodal Parkinson's gait datasets show that MOSAIC improves final performance and mitigates forgetting. Project code is available at: this https URL

2606.13253 2026-06-12 cs.SD cs.AI 新提交

Towards Personalized Federated Learning for Dysarthric Speech Recognition

面向构音障碍语音识别的个性化联邦学习

Tao Zhong, Mengzhe Geng, Jiajun Deng, Shujie Hu, Xunying Liu

发表机构 * The Chinese University of Hong Kong(香港中文大学) National Research Council Canada(加拿大国家研究委员会)

AI总结 针对构音障碍语音识别中联邦学习异构性问题,提出参数平均和嵌入平均两种个性化聚合策略,在UASpeech和TORGO上分别实现0.99%和0.56%的绝对词错误率降低。

详情
AI中文摘要

构音障碍者的语音识别具有挑战性。虽然基于联邦学习的ASR可以有效保护隐私,但它面临由说话人变异性引起的异构性问题。在这种异构性下,强制所有说话人共享相同的模型组件可能不是最优的,因此个性化是一个有前景的方向;然而,关于构音障碍语音的相关研究仍然有限。为此,本文探索了两种实现个性化的聚合策略,包括基于参数的平均策略和基于嵌入的平均策略。在UASpeech和TORGO上的实验表明,所提方法优于基线正则化FedAvg,在UASpeech上实现了高达0.99%绝对(3.15%相对)的统计显著词错误率降低,在TORGO上实现了0.56%绝对(4.73%相对)的降低。

英文摘要

Speech recognition is challenging for dysarthric speakers. While federated learning (FL)-based ASR can be an effective tool for protecting privacy, it suffers from heterogeneity issues caused by speaker variability. Forcing all speakers to share the same model components can be suboptimal under such heterogeneity, making personalization a promising direction; however, related research on dysarthric speech remains limited. To this end, this paper explores two aggregation strategies to achieve personalization, including the parameter-based averaging strategy and the embedding-based averaging strategy. Experiments on UASpeech and TORGO show that the proposed methods outperform the baseline regularized FedAvg by statistically significant WER reductions of up to 0.99% absolute (3.15% relative) on UASpeech and 0.56% absolute (4.73% relative) on TORGO, respectively.

2606.13252 2026-06-12 cs.LG 新提交

To GAN or Not To GAN: Segmentation Analysis on Mars DEM

生成对抗还是非生成对抗:火星DEM上的分割分析

Douglas Dziedzorm Agbeve, Aditya V. Handrale, Salim Fares, Seif E. Idani

发表机构 * University of Passau(帕绍大学)

AI总结 使用监督语义分割和生成对抗方法自动检测火星上的土丘,并比较两种方法,发现添加人工生成数据并未改善结果。

详情
AI中文摘要

为了更好地理解火星表面,使火星车能够轻松导航火星,有必要能够确定土丘的位置。检测和研究这些形态也有助于我们找到地外生命的证据,在这种情况下,更具体地说,是水或生命适宜环境的迹象。土丘的检测是通过将形态参数手动映射到数字高程模型上完成的。本文通过使用基于神经网络的语义分割方法自动检测和/或预测火星上的土丘来解决这个问题。这是通过使用监督语义分割模型和生成对抗方法实现的。两种方法的比较表明,添加额外的人工生成数据并未改善结果。

英文摘要

To better understand Martian Surface, which is needed to enable Rovers navigate Mars with ease, it is necessary to be able to determine the location of mounds. Detecting and studying these morphologies can also help us find evidence of extraterrestrial life, in this case, more specifically, water or signs of life conducive environments. Detection of mounds was done by manually mapping morphological parameters onto Digital Elevation Models. This paper solves the problem by automatically detecting and or predicting mounds on Mars using Neural Network based Semantic Segmentation methodologies. This is done by using supervised semantic segmentation model and generative adversarial approach. A comparison of the approaches shows that adding extra artificially generated data did not improve the result.

2606.13249 2026-06-12 cs.AI 新提交

Multi-Field Hybrid Retrieval-Augmented Generation for Maritime Accident Root Cause Analysis

面向海事事故根因分析的多字段混合检索增强生成

Seongjin Kim, Sungil Kim

发表机构 * Department of Industrial Engineering, Ulsan National Institute of Science and Technology (UNIST)(蔚山国立科学技术院工业工程系)

AI总结 提出多字段混合检索增强生成框架,利用结构化事故卡片和分层原因分类,通过字段感知的混合检索与融合排序,显著提升海事事故根因分析的检索和生成质量。

详情
AI中文摘要

海事事故裁决报告包含根因分析(RCA)的关键法庭调查结果,然而从数十年的记录中检索相关先例并起草一致的报告仍然劳动密集。本文提出一个用于自动化海事RCA的多字段混合检索增强生成(RAG)框架,利用包含13,329份韩国海事安全法庭(KMST)报告(1971-2025年)的综合数据集。我们将原始裁决转化为结构化的“事故卡片”知识库,索引三个不同字段——摘要、原因和处置——以及一个层次化的L1/L2原因分类。我们的检索策略采用字段感知的混合方法,通过互惠排名融合(RRF)融合稀疏和密集排名。鉴于缺乏大规模专家相关性标签,我们使用基于元数据派生代理相关性分数的天花板归一化召回率和nDCG评估检索性能。实验结果表明,我们提出的检索显著优于基线方法,将NormRecall@100从0.18提高到0.55。此外,将生成器基于检索到的先例,相比仅使用LLM的基线,RCA生成质量得到提升,LLM作为评判者的评分从3.34提高到3.72。这些发现表明,字段感知的RAG可以通过实现更快的先例搜索和更一致、基于证据的RCA起草,显著简化海事安全调查工作流程。

英文摘要

Maritime accident adjudication reports contain critical tribunal findings for root cause analysis (RCA), yet retrieving relevant precedents and drafting consistent reports from decades of records remains labor-intensive. This paper proposes a multi-field hybrid retrieval-augmented generation (RAG) framework for automated maritime RCA, utilizing a comprehensive dataset of 13,329 Korea Maritime Safety Tribunal (KMST) reports (1971-2025). We transform raw adjudications into a structured knowledge base of "incident cards", indexing three distinct fields-Summary, Causes, and Disposition-alongside a hierarchical L1/L2 cause taxonomy. Our retrieval strategy employs a field-aware hybrid approach, fusing sparse and dense rankings via Reciprocal Rank Fusion (RRF). Given the lack of large-scale expert relevance labels, we evaluate retrieval performance using ceiling-normalized recall and nDCG based on a metadata-derived proxy relevance score. Experimental results demonstrate that our proposed retrieval significantly outperforms baseline methods, improving NormRecall@100 from 0.18 to 0.55. Furthermore, grounding the generator on the retrieved precedents enhances RCA generation quality over an LLM-only baseline, increasing the LLM-as-a-judge score from 3.34 to 3.72. These findings suggest that field-aware RAG can substantially streamline maritime safety investigation workflows by enabling faster precedent search and more consistent, evidence-based RCA drafting.

2606.13247 2026-06-12 cs.AI 新提交

EPIG: Emotion-Based Prompting for Personalised Image Generation

EPIG:基于情感提示的个性化图像生成

Emna Othmen, Mohamed Yassine Landolsi, Lotfi Ben Romdhane

发表机构 * MARS Research Lab LR17ES05, ISITCom, University of Sousse(苏塞大学ISITCom学院MARS研究实验室LR17ES05)

AI总结 提出EPIG方法,利用心理学效价-唤醒模型在提示层面增强情感表达,无需训练即可控制生成图像的唤醒度,在10个多样化提示上平均唤醒误差降低14%-17%。

详情
Comments
Submitted to arXiv. 20 pages, 4 figures. Work on emotion-based prompt engineering for text-to-image diffusion models with applications in personalized image generation
AI中文摘要

文本到图像扩散模型在从自然语言提示合成高质量图像方面取得了令人印象深刻的结果。然而,常用的提示策略仍然相对通用,限制了模型准确表达情感意图和细微情感属性的能力。本文提出EPIG,一种在图像生成之前在提示层面增强情感表达性的方法。基于心理学知情的情感表示(效价-唤醒)并利用结构化的、角色感知的提示丰富化,EPIG在不修改或重新训练图像生成主干的情况下丰富提示的情感相关组件。由此产生的情感感知提示引导生成过程朝向更情感连贯的视觉输出,在控制唤醒方面特别有效。EPIG轻量级、无需训练,非常适合资源受限和个性化图像生成场景。在10个多样化提示的基准测试上的实验结果表明,与强基线(包括朴素插入和基于LLM的提示扩展)相比,EPIG将平均唤醒误差分别降低了14%和12%。这些改进具有统计显著性。EPIG还保持了效价对齐和语义一致性,如CLIPScore所测量并由消融研究所支持。在包含人类、儿童或动物等显式主体的提示上效果更为显著,误差降低达到17%,突出了所提出方法的主题敏感行为。

英文摘要

Text-to-image diffusion models have achieved impressive results in synthesizing high-quality images from natural language prompts. However, commonly used prompting strategies remain relatively generic, limiting the model's ability to accurately express emotional intent and nuanced affective attributes. This work proposes EPIG, a method that enhances emotional expressiveness at the prompt level prior to image generation. Grounded in psychologically informed emotion representations (valence-arousal) and leveraging structured, role-aware prompt enrichment, EPIG enriches emotion-related components of prompts without modifying or retraining the image generation backbone. The resulting emotion-aware prompts guide the generative process toward more emotionally coherent visual outputs, with particular effectiveness in controlling arousal. EPIG is lightweight, training-free, and well suited for resource-constrained and personalized image generation scenarios. Experimental results on a benchmark of 10 diverse prompts show that EPIG reduces mean arousal error compared to strong baselines, including naive insertion and LLM-based prompt expansion, with reductions of 14% and 12%, respectively. These improvements are statistically significant. EPIG also preserves valence alignment and semantic consistency, as measured by CLIPScore and supported by ablation studies. The effect is more pronounced on prompts containing explicit subjects such as humans, children, or animals, where the reduction reaches 17%, highlighting the subject-sensitive behavior of the proposed method.

2606.13241 2026-06-12 cs.AI 新提交

Brick: Spatial Capability Routing for the Mixture-of-Models (MoM) Paradigm

Brick: 面向混合模型范式的空间能力路由

Francesco Massa, Marco Cristofanilli

发表机构 * Regolo AI Seeweb

AI总结 提出Brick多模态路由器,通过六维能力评分与查询难度估计,结合成本惩罚几何规则调度模型,在质量与成本间实现灵活权衡。

详情
Comments
17 pages, 5 figures. Technical report
AI中文摘要

定义查询难度是部署工程中最困难的问题之一。现有的LLM路由器依赖表面特征,如领域标签、关键词和token数量,忽略了实际决定模型成功的域内方差。前沿模型成本比本地开源模型高10到100倍,因此在生产规模下,即使每次请求的小额节省也会直接成为云账单的杠杆。我们提出了Brick,一种多模态路由器,它在六个能力维度上对每个模型进行评分,结合每个查询的难度估计,并通过成本惩罚的几何规则进行调度。一个连续的偏好旋钮允许操作员在部署时在最大质量和最大节省之间滑动。在5504个查询的基准测试中,Brick在最大质量模式下达到76.98%的准确率,超过了最佳单一模型(75.02%)和所有测试的路由器。在中性成本-质量配置下,Brick以比始终使用最强模型低4.71倍的成本实现了74.11%的准确率。在最低成本模式下,它降低了22.15倍的成本,准确率损失11.85个百分点。中位延迟从51.2秒降至22.8秒。

英文摘要

Defining query difficulty is one of the hardest problems in deployment engineering. Existing LLM routers rely on surface features such as domain labels, keywords, and token count, ignoring the within-domain variance that actually determines model success. Frontier models cost ten to one hundred times more than local open-weight models, so at production scale even small per-request savings become a direct cloud-bill lever. We present Brick, a multimodal router that scores each model on six capability dimensions, combines this with a per-query difficulty estimate, and dispatches via a cost-penalized geometric rule. A continuous preference knob lets operators slide between max-quality and max-saving profiles at deploy time. On a benchmark of 5,504 queries, Brick at max-quality reaches 76.98% accuracy, beating the best single model (75.02%) and all tested routers. At a neutral cost-quality profile, Brick achieves 74.11% accuracy at 4.71x lower cost than always using the strongest model. At min-cost, it cuts cost 22.15x with 11.85 points accuracy loss. Median latency drops from 51.2s to 22.8s.

2606.13240 2026-06-12 cs.LG cs.AI cs.CV stat.ME stat.ML 新提交

Towards More General Control of Diffusion Models Using Jeffrey Guidance

使用 Jeffrey 引导实现扩散模型的更通用控制

Raphaël Razafindralambo, Rémy Sun, Frédéric Precioso, Jes Frellsen, Pierre-Alexandre Mattei

发表机构 * Inria, CNRS, I3S, Maasai Université Côte d’Azur(法国国家信息与自动化研究所、法国国家科学研究中心、信息与系统科学实验室、马赛·蔚蓝海岸大学) Technical University of Denmark(丹麦技术大学) Inria, CNRS, LJAD, Maasai Université Côte d’Azur(法国国家信息与自动化研究所、法国国家科学研究中心、雅克-路易·利翁实验室、马赛·蔚蓝海岸大学)

AI总结 提出 Jeffrey 引导框架,通过 Jeffrey 条件规则更新边缘分布,扩展扩散模型控制到标准引导无法表达的应用,在 CIFAR-10 和 FFHQ 上显著降低 FID,并在 CelebA-HQ 上实现公平性控制。

详情
AI中文摘要

扩散模型的一个关键优势在于其灵活性,因为其输出可以在采样时通过引导进行控制。然而,除了条件采样等简单情况外,目标分布通常隐含地定义,仅通过采样规则或启发式能量函数给出。为了解决这个问题,我们提出了 Jeffrey 引导,这是一个原则性框架,将扩散模型控制扩展到标准引导无法表达的应用。它利用 Jeffrey 条件规则将边际分布更新到指定的目标,保持条件结构并最小化对联合分布的扰动。我们首先通过针对指定的嵌入分布来演示 Jeffrey 引导。以 Inception 嵌入为目标,这导致在 CIFAR-10 和 FFHQ 上 FID 显著降低。我们进一步将 Jeffrey 引导应用于 CelebA-HQ 上的公平性,更新无条件扩散模型以强制属性之间的独立性。

英文摘要

A key strength of diffusion models lies in their flexibility, since their outputs can be controlled at sampling time through guidance. However, beyond simple cases such as conditional sampling, the target distribution is often left implicit, defined only through a sampling rule or a heuristic energy function. To address this, we propose Jeffrey guidance, a principled framework that extends diffusion-model control to applications beyond what standard guidance can express. It leverages Jeffrey's rule of conditioning to update marginal distributions towards a prescribed target, preserving the conditional structure and minimally perturbing the joint distribution. We first demonstrate Jeffrey guidance by targeting a prescribed embedding distribution. With Inception embeddings as the target, this leads to substantial reductions in FID on both CIFAR-10 and FFHQ. We further apply Jeffrey guidance to fairness on CelebA-HQ, updating an unconditional diffusion model to enforce independence between attributes.

2606.13236 2026-06-12 cs.LG cs.AI cs.SD stat.AP 新提交

Decoding Insect Song: A Multitask Semisupervised Orthoptera Bioacoustic Classifier

解码昆虫之歌:一种多任务半监督直翅目生物声学分类器

Olga Isupova, Danil Kuzin, Ella Browning, Tom Mills, Steven Reece

发表机构 * University of Oxford(牛津大学)

AI总结 提出PULSE半监督多任务框架,结合弱监督分类、自监督学习和知识蒸馏,在直翅目生物声学分类中优于通用模型,并通过主动学习进一步提升性能。

详情
Comments
ICML 2026 Workshop on Machine Learning for Audio
AI中文摘要

被动声学监测在生态推断方面具有巨大潜力,但现有的自动化工具通常训练范围狭窄且不可迁移。我们通过PULSE(一种用于直翅目生物声学的半监督多任务框架)解决了这些局限性,该框架结合了弱监督物种分类、未标记野外音频的自监督学习以及来自通用生物声学模型的知识蒸馏。我们的领域自适应专家模型在所有指标上均优于最先进的通用模型(宏F1:0.21 vs. 0.07;AUC:0.74 vs. 0.45;AP:0.32 vs. 0.19),主动学习进一步将F1提升至0.34,AUC提升至0.84。除了分类之外,学习到的嵌入编码了生态上有意义的结构,并通过交互式可视化工具暴露出来,用于生态发现。

英文摘要

Passive acoustic monitoring holds great promise for ecological inference, yet existing automated tools are typically narrowly trained and non-transferable. We address these limitations with PULSE, a semi-supervised, multi-task framework for Orthoptera bioacoustics, combining weakly-supervised species classification, self-supervised learning on unlabelled field audio, and knowledge distillation from a general-purpose bioacoustic model. Our domain-adapted specialist model outperforms a state-of-the-art general model across all metrics (macro F1: 0.21 vs. 0.07; AUC: 0.74 vs. 0.45; AP: 0.32 vs. 0.19), with active learning further raising F1 to 0.34 and AUC to 0.84. Beyond classification, the learned embeddings encode ecologically meaningful structure, exposed through an interactive visualisation tool for ecological discovery.

2606.13233 2026-06-12 cs.LG cs.AI 新提交

ReSET: Accurate Latency-Critical NVFP4 Reasoning via Step-Aware Temperature Scaling

ReSET: 通过步骤感知温度缩放实现精确的延迟关键型NVFP4推理

Sihwa Lee, Janghwan Lee, Donghoon Yoo, Jae Gon Kim, Hanyul Ryu, Soojung Ryu, Jungwook Choi

发表机构 * Hanyang University(汉阳大学) Xenoscube Korean Inc.(Xenoscube韩国公司)

AI总结 针对大型推理模型在NVFP4低精度推理中精度下降和延迟问题,提出基于推理步骤熵的温度缩放方法ReSET,并设计CUDA小M核,在多个基准上提升精度约2点,解码速度提升2倍。

详情
AI中文摘要

大型推理模型(LRMs)通过生成长中间推理轨迹来改进复杂问题求解,但这大幅增加了推理成本。NVFP4推理通过硬件支持的低精度执行提供了一种减少计算和内存成本的有前景方法。然而,直接将NVFP4应用于LRMs引入了两个实际限制:量化下推理精度下降,且现有NVFP4核在小型批处理自回归解码中未完全实现延迟优势。在这项工作中,我们分析了NVFP4量化对推理过程中token级不确定性的影响。我们表明,量化增加了低熵符号token的错误采样,同时导致在高不确定性推理步骤中过度集中于少量token。基于这一观察,我们提出了\textbf{ReSET},一种基于推理步骤熵的温度缩放方法,它在线估计步骤级不确定性,并使用token级和步骤级熵信号自适应调整解码温度。为解决延迟差距,我们进一步设计了一个CUDA核心的小型$M$ NVFP4核,用于延迟关键的自回归解码。在推理基准和模型规模上,ReSET将NVFP4推理精度相比NVFP4基线提升高达$\sim\!$2个点。我们的CUDA核心小型$M$核进一步改善了延迟关键解码,相比NVFP4 vLLM提供高达$2.5\!\times$的核级加速,相比BF16提供约$2\!\times$的端到端解码加速。代码可在该https URL获取。

英文摘要

Large reasoning models (LRMs) improve complex problem-solving by generating long intermediate reasoning traces, but this substantially increases inference costs. NVFP4 inference offers a promising approach to reduce both computational and memory costs through hardware-supported low-precision execution. However, directly applying NVFP4 to LRMs introduces two practical limitations: reasoning accuracy degrades under quantization, and existing NVFP4 kernels do not fully realize latency benefits in small-batch autoregressive decoding. In this work, we analyze the effect of NVFP4 quantization on token-level uncertainty during reasoning. We show that quantization increases incorrect sampling at low-entropy symbolic tokens, while causing over-concentration on a small set of tokens in high-uncertainty reasoning steps. Based on this observation, we propose \textbf{ReSET}, a reasoning-step entropy-based temperature-scaling method that estimates step-level uncertainty online and adapts the decoding temperature using both token-level and step-level entropy signals. To address the latency gap, we further design a CUDA-core small-$M$ NVFP4 kernel for latency-critical autoregressive decoding. Across reasoning benchmarks and model scales, ReSET improves NVFP4 reasoning accuracy by up to $\sim\!$2 points over the NVFP4 baseline. Our CUDA-core small-$M$ kernel further improves latency-critical decoding, delivering up to $2.5\!\times$ kernel-level speedup over NVFP4 vLLM and approximately $2\!\times$ end-to-end decoding speedup over BF16. Code is available at this https URL.

2606.13227 2026-06-12 cs.CL 新提交

PolyAlign: Conditional Human-Distribution Alignment

PolyAlign: 条件性人类分布对齐

L. D. M. S. Sai Teja, Ufaq Khan, Sathira Silva, Xiao Wu, Muhammad Haris Khan

发表机构 * NIT Silchar(印度国立理工学院锡尔恰尔分校) MBZUAI(穆罕默德·本·扎耶德人工智能大学)

AI总结 提出PolyAlign框架,通过桶感知SFT和人类分布偏好优化,实现语言模型在不同交互上下文中的条件性人类分布对齐,提升自然性和分布忠实度。

详情
Comments
20 pages, 4 Figures, 8 Tables
AI中文摘要

诸如监督微调(SFT)和偏好优化等后训练方法通常将语言模型对齐到单一的全局助手行为。虽然这有助于提高平均有用性,但可能抑制人类响应在不同语言、任务和对话设置中的自然变化。我们将此问题研究为条件性人类分布对齐:模型应匹配适合当前交互上下文的人类响应分布,而非通用响应风格。我们引入PolyAlign,一种分布感知的对齐框架,将双语交互数据组织为由语言、交互轨迹、响应家族和长度定义的桶特定人类参考分布。PolyAlign结合了桶感知SFT(平衡跨异构桶的优化)和人类分布偏好优化(HDPO,使用评论家估计的到桶特定人类支持的距离来正则化偏好学习)。在涵盖英语和中文单轮及多轮设置的双语评估套件中,PolyAlign在保持竞争性任务实用性的同时,提高了条件自然性和分布忠实度。结果表明,后训练应超越全局对齐目标,转向与人类响应分布的交互感知对齐。

英文摘要

Post-training methods such as supervised fine-tuning (SFT) and preference optimization typically align language models toward a single global assistant behavior. While effective for improving average helpfulness, this can suppress the natural variation of human responses across languages, tasks, and dialogue settings. We study this problem as conditional human-distribution alignment: models should match the human response distribution appropriate to the current interaction context, rather than a universal response style. We introduce PolyAlign, a distribution-aware alignment framework that organizes bilingual interaction data into bucket-specific human reference distributions defined by language, interaction track, response family, and length. PolyAlign combines Bucket-Aware SFT, which balances optimization across heterogeneous buckets, with Human-Distribution Preference Optimization (HDPO), which regularizes preference learning using critic-estimated distance to bucket-specific human support. Across a bilingual evaluation suite covering English and Chinese single- and multi-turn settings, PolyAlign improves conditional naturalness and distributional faithfulness while preserving competitive task utility. The results suggest that post-training should move beyond global alignment objectives toward interaction-aware alignment with human response distributions.

2606.13222 2026-06-12 cs.RO cs.AI 新提交

Proprioceptive-visual correspondence enables self-other distinction in humanoid robots

本体感觉-视觉对应使能人形机器人的自我-他人区分

Yurun Chen, Tianyuan Gao, Yizhong Ge, Shikun Ban, Yizhou Wang, Hongkai Xiong, Wenjun Zeng, Wentao Zhu

发表机构 * Eastern Institute of Technology, Ningbo(宁波东方理工大学) Shanghai Jiao Tong University(上海交通大学) Peking University(北京大学) Carnegie Mellon University(卡内基梅隆大学) East China Normal University(华东师范大学) Ningbo Institute of Digital Twin(宁波数字孪生研究院)

AI总结 提出通过本体感觉与视觉的对应学习自我-他人区分,无需身份标签或运动学模型,并建立预测性自我模型,支持目标到达、碰撞感知运动规划和运动重定向。

详情
Comments
23 pages, 9 figures, 1 supplementary table
AI中文摘要

区分自我与他人是社会智能的前提,然而与人类共享工作空间的人形机器人仍然缺乏这种能力。在这里,我们展示了一个人形机器人可以通过本体感觉-视觉对应学习自我-他人区分,无需任何身份标签或运动学模型。一旦建立,这种区分引导出一个预测性自我模型,该模型将关节配置映射到三维身体占用,捕捉机器人身体如何随动作变化。在涉及人类或形态相同机器人的多智能体场景中,系统可靠地识别自身,学习三维自我模型,并支持下游任务,包括目标到达、碰撞感知运动规划和人类到机器人的运动重定向。这些结果共同勾勒出一条路径,使机器人在共享物理环境中与其他人行动和协调时具备身体自我表征。项目页面:此 https URL。

英文摘要

Distinguishing self from others is a prerequisite for social intelligence, yet humanoid robots that increasingly share workspaces with humans still lack this ability. Here we show that a humanoid robot can learn self-other distinction from proprioceptive-visual correspondence, without any identity labels or kinematic models. Once established, this distinction bootstraps a predictive self-model that maps joint configurations to three-dimensional body occupancy, capturing how the robot's body changes with action. In multi-agent scenes involving humans or morphologically identical robots, the system reliably identifies itself, learns a 3D self-model, and supports downstream tasks including target reaching, collision-aware motion planning, and human-to-robot motion retargeting. Together, these results outline a route toward bodily self-representation in robots that act and coordinate alongside others in shared physical environments. Project page: this https URL.

2606.13221 2026-06-12 cs.LG 新提交

From Uncertain Judgments to Calibrated Rankings: Conformal Elo Estimation for LLM Evaluation

从不确定判断到校准排名:用于LLM评估的共形Elo估计

Bora Kargi, David Salinas

发表机构 * ELLIS Institute Tübingen(ELLIS 蒂宾根研究所) OpenEuroLLM

AI总结 提出一种两层次校准方法,通过局部不确定性传播和全局共形预测,将LLM-as-a-judge的Elo评分误差降至17.9 MAE,并提供无分布假设的置信区间。

详情
AI中文摘要

评估新的大型语言模型通常需要大规模且昂贵的人工标注。LLM作为评判者提供了一种更便宜的替代方案,但评判者评分存在系统误差——如位置偏差、自我偏好或不可传递性——这些误差可能导致最终排名严重失准。我们在两个互补层面上量化评判者与人类之间的分歧。在局部层面,我们通过将校准的获胜概率而非硬标签传播到Bradley-Terry过程中,从评判者自身的评分差异估计每场对战的不确定性。仅此一项就显著提高了Elo估计的准确性,在LMArena上对55个保留模型取平均时,LLM得出的评分与人类得出的评分之间的平均绝对误差为17.9 Elo。在全局层面,我们将分裂共形预测应用于LLM得出的与人类得出的Elo评分之间的残差差距,产生具有无分布边际覆盖保证的预测区间,从而解释了不可约的LLM-人类分歧。这两层结合产生了一个低成本的评估工具,为开发者提供校准的Elo估计和诚实的置信区间,而无需大规模人工标注。为促进可重复性,我们在https://this http URL发布代码。

英文摘要

Evaluating new large language models typically requires costly human annotation campaigns at scale. LLM-as-a-judge offers a cheaper alternative, but judge scores carry systematic errors - such as position bias, self-preference, or intransitivity - that can strongly miscalibrate the resulting rankings. We quantify the resulting judge-human disagreement at two complementary levels. At the local level, we estimate per-battle uncertainty from the judge's own score differences by propagating calibrated win probabilities rather than hard labels into the Bradley-Terry procedure. This alone provides a drastic improvement to Elo estimation accuracy, bringing LLM-derived ratings within 17.9 Elo MAE of human-derived ones when averaged over 55 held-out models on LMArena. At the global level, we apply split conformal prediction to the residual gap between LLM-derived and human-derived Elo ratings across held-out models, producing prediction intervals with distribution-free marginal coverage guarantees that account for irreducible LLM-human disagreement. Together, these two layers yield a low-cost evaluation tool that provides developers with calibrated Elo estimates and honest uncertainty bounds, without access to large-scale human this http URL facilitate reproducibility, we release our code at this https URL.

2606.13220 2026-06-12 cs.AI cs.CE cs.ET cs.LG cs.MA 新提交

LLM-as-an-Investigator: Evidence-First Reasoning for Robust Interactive Problem Diagnosis

LLM作为调查员:基于证据优先的鲁棒交互式问题诊断

Fabrizio Marozzo, Pietro Liò

发表机构 * University of Calabria(卡拉布里亚大学) University of Cambridge(剑桥大学)

AI总结 提出证据优先的AI方法LLM-as-an-Investigator,通过估计问题歧义、生成假设、提问澄清并更新概率,避免过早接受用户假设,提升诊断准确性。

详情
AI中文摘要

大型语言模型(LLM)越来越多地被用作技术问题解决的交互式助手。然而,当用户提供不完整的描述或看似合理但未经证实的解释时,LLM可能会过早地认同这些假设,并在收集足够证据之前提出解决方案。我们将这种行为称为用户驱动的谄媚:LLM倾向于强化用户提供的假设,而不是测试其他解释。本文介绍了LLM-as-an-Investigator,一种基于证据优先的智能体AI方法,用于鲁棒的问题诊断。该方法通过一个解决方案调查智能体实现,该智能体估计初始问题描述的模糊性,生成候选假设,提出有针对性的澄清问题,并在每次回答后更新假设概率。该智能体不是立即给出响应,而是继续调查,直到证据使一个候选解释比其他解释更强。为了评估该方法,我们从机械、电气和液压领域已解决的技术论坛帖子中构建了一个基准测试。我们使用一个三智能体评估流程:问题-解决方案提取智能体将已解决的帖子转换为结构化案例,真实答案评估智能体在隐藏已知解决方案的同时模拟用户,被测试的助手通过对话尝试恢复解决方案。实验比较了标准助手、面向推理的LLM和基于调查员的模型,使用不同的LLM骨干网络。除了诊断准确性,我们还分析了标准助手在诊断案例中如何遵循误导性的用户假设。结果表明,所提出的方法比直接提示和仅推理基线更准确地识别问题,而其证据优先协议有助于减少用户引发的对话偏差。

英文摘要

Large language models (LLMs) are increasingly used as interactive assistants for technical problem solving. However, when users provide incomplete descriptions or plausible but unverified explanations, LLMs may prematurely align with these assumptions and propose solutions before collecting sufficient evidence. We refer to this behavior as user-driven sycophancy: the tendency of an LLM to reinforce a user-provided hypothesis instead of testing alternative explanations. This paper introduces LLM-as-an-Investigator, an evidence-first agentic AI methodology for robust problem diagnosis. The approach is implemented through a Solution Investigator Agent, which estimates the ambiguity of an initial problem description, generates candidate hypotheses, asks targeted clarification questions, and updates hypothesis probabilities after each answer. Rather than producing an immediate response, the agent continues the investigation until the evidence makes one candidate explanation stronger than the alternatives. To evaluate the approach, we build a benchmark from solved technical forum threads in mechanical, electrical, and hydraulic domains. We use a three-agent evaluation pipeline in which a Problem-Solution Extractor Agent converts solved threads into structured cases, a Ground-Truth Evaluator Agent simulates the user while hiding the known solution, and the tested assistant attempts to recover the solution through dialogue. The experiments compare standard assistants, reasoning-oriented LLMs, and the proposed investigator-based model across LLM backbones. In addition to diagnostic accuracy, we analyze how standard assistants follow misleading user hypotheses in diagnostic cases. The results show that the proposed approach identifies the problem more accurately than direct prompting and reasoning-only baselines, while its evidence-first protocol helps reduce user-induced conversational bias.

2606.13216 2026-06-12 cs.CL cs.LG 新提交

Layer-Resolved Optimal Transport for Hallucination Detection in NMT and Abstractive Summarization

分层最优传输用于神经机器翻译和抽象摘要中的幻觉检测

Mariia Onyshchuk, Maksym-Vasyl Tarnavskyi, Marta Sumyk

发表机构 * Fairseq AggreFact

AI总结 通过最优传输分析跨注意力分布,发现幻觉检测集中于解码器前四层,且该方法在源脱离时有效,但无法检测注意力下游的不忠实摘要。

详情
Comments
Accepted to ICML Mechanistic Interpretability Workshop 2026
AI中文摘要

最优传输(OT)已被证明可以通过测量跨注意力分布与参考分布之间的几何距离来检测神经机器翻译(NMT)中的幻觉,无需任何监督。我们将此分析扩展到Fairseq DE-EN模型的所有六个解码器层($N=3{,}414$),表明Wass-to-Unif和Wass-to-Data是互补的检测器,专门针对不同类型的幻觉;检测集中在L1--L4层,而L5层对较微妙的类型具有反预测性;并且幻觉翻译缺乏正确翻译从第一步解码开始就存在的探索性注意力阶段。我们进一步评估了几何信号是否可迁移到抽象摘要忠实性检测:在AggreFact($N=1{,}116$)上,我们的无监督OT检测器在CNN/XSum上达到$57.2\%$/$57.6\%$的平衡准确率——高于随机水平,但远低于有监督的MiniCheck-Flan-T5-L($69.9\%$/$74.3\%$)。这种差距是原则性的:与NMT幻觉不同,不忠实的摘要可以正确关注源标记,同时歪曲其内容,这种失败模式在基于集中度的OT指标中由于构造原因而不可见。在T5-base上的结构实验证实了解码器在深度上的一致组织,其中第3层显示峰值集中度,第12层对生成质量最为关键。总之,结果确立了当失败模式是源脱离时,跨注意力的OT是一种可靠的检测器;无论任务如何,它都是一种原则性的可解释性工具;而当忠实性失败发生在注意力下游时,它则具有根本局限性。

英文摘要

Optimal transport (OT) has been shown to detect hallucinations in neural machine translation (NMT) by measuring the geometric distance between cross-attention distributions and a reference distribution, without any supervision. We extend this analysis to all six decoder layers of the Fairseq DE-EN model ($N=3{,}414$), showing that Wass-to-Unif and Wass-to-Data are complementary detectors specialised across hallucination types, that detection is concentrated in layers L1--L4 with L5 anti-predictive for subtler types, and that hallucinated translations lack the exploratory attention phase present in correct translations from the first decoding step. We further evaluate whether the geometric signal transfers to abstractive summarization faithfulness detection: our unsupervised OT detector on AggreFact ($N=1{,}116$) achieves $57.2\%$/$57.6\%$ balanced accuracy on CNN/XSum -- above chance but substantially below supervised MiniCheck-Flan-T5-L($69.9\%$/$74.3\%$). This gap is principled: unlike NMT hallucinations, unfaithful summaries can attend correctly to source tokens while misrepresenting their content, a failure mode invisible to concentration-based OT metrics by construction. Structural experiments on T5-base confirm consistent decoder organisation across depth, with Layer~3 showing peak concentration and Layer~12 being most critical for generation quality. Together, the results establish OT on cross-attention as a reliable detector when the failure mode is source disengagement, a principled interpretability tool regardless of task, and fundamentally limited when faithfulness failures occur downstream of attention.

2606.13211 2026-06-12 cs.AI 新提交

Hallucination in Medical Imaging AI: A Cross-Modality Analytical Framework for Taxonomy, Detection, and Mitigation under Regulatory Constraints

医学影像AI中的幻觉:跨模态分析框架用于分类、检测与监管约束下的缓解

Omar Alshahrani, Muzammil Behzad

发表机构 * King Fahd University of Petroleum & Minerals, Saudi Arabia(沙特阿拉伯法赫德国王石油矿产大学) SDAIA-KFUPM Joint Research Center for Artificial Intelligence, Saudi Arabia(沙特阿拉伯SDAIA-KFUPM人工智能联合研究中心)

AI总结 本文提出跨模态分析框架,统一五种影像模态的幻觉分类、检测与缓解策略,发现通用基础模型在幻觉基准上优于医学专用模型,并映射到FDA全生命周期监管。

详情
AI中文摘要

AI系统在医学影像中的部署速度超过了对其故障模式的理解。当前,最受临床关注的故障是幻觉:临床看似合理但事实错误的输出,包括虚构的解剖结构、遗漏的发现、错误的侧向性以及生成报告中的虚构测量值,直接影响到活检决策、分期和治疗计划。本结构化综述综合了同行评审研究、基准数据集和FDA监管指南,涵盖五种影像模态,对幻觉的分类、病因、检测和缓解进行了跨模态分析。具体而言,我们研究了三个问题:(1) 现有分类法如何跨模态统一?(2) 医学专用基础模型为何比通用模型产生更少的幻觉?(3) 哪些缓解策略有效且与FDA生命周期监督兼容?我们注意到,三种分类框架共同覆盖了影像流程,而单一框架无法做到。我们还强调,通用基础模型在幻觉特定基准上优于医学专用模型,表明狭窄领域微调可能引入过拟合导致的虚构。同时,放射科医生的监督仍然至关重要;例如,很高比例的AI生成标记在临床使用前需要专家修正。物理信息架构约束、思维链提示和人在回路保障各自针对不同的故障模式,并在组合时有效。所有发现均映射到FDA的总产品生命周期和预定变更控制计划框架,这些框架将幻觉管理视为生命周期义务而非部署前检查清单。

英文摘要

AI systems are being deployed across medical imaging faster than their failure modes are understood. At this point in time, the failure of greatest clinical concern is hallucination: clinically plausible but factually incorrect outputs, including fabricated anatomical structures, missed findings, incorrect laterality, and invented measurements in generated reports, with direct consequences, for example, for biopsy decisions, staging, and treatment planning. This structured narrative synthesizes peer-reviewed studies, benchmark datasets, and FDA regulatory guidance across five imaging modalities to produce a cross-modality analysis of hallucination taxonomy, etiology, detection, and mitigation. Specifically, we address three questions in this study: (1) how can existing taxonomies be unified across modalities?, (2) how do medical-specialized foundation models hallucinate less than general-purpose ones?, and (3) which mitigation strategies are effective and compatible with FDA lifecycle oversight? We note that three taxonomic frameworks together cover the imaging pipeline in a way no single framework does alone. We also highlight that general-purpose foundation models outperform medical-specialized models on hallucination-specific benchmarks, indicating that narrow domain fine-tuning can introduce overfitting-induced confabulation. At the same time, the oversight of radiologists remains essential; for instance, a very high percentage of of AI-generated flags required expert correction before clinical use. Physics-informed architectural constraints, Chain-of-Thought prompting, and human-in-the-loop safeguards each address different failure modes and is effective when combined. All findings are mapped to the FDA's Total Product Lifecycle and Predetermined Change Control Plan frameworks, which treat hallucination management as a lifecycle obligation rather than a pre-deployment checklist.

2606.13209 2026-06-12 cs.LG cs.CL 新提交

Understanding helpfulness and harmless tension in reward models

理解奖励模型中的有用性与无害性张力

Eshaan Tanwar, Pepa Atanasova

发表机构 * University of Copenhagen(哥本哈根大学)

AI总结 通过激活分析和消融实验,发现奖励模型中有用性和无害性目标存在干扰,共享神经元对模型行为影响不成比例,导致对齐张力。

详情
Comments
The source code used in this study is publicly available at: this https URL \_tension
AI中文摘要

奖励模型是从人类反馈中进行强化学习(RLHF)的关键组成部分,使语言模型在有用性和无害性行为上对齐。然而,这些目标背后的内部机制及其冲突仍知之甚少。我们研究了在仅有用性、仅无害性和混合目标设置下训练的奖励模型中的对齐张力。我们发现混合目标模型通常表现不如单目标模型,表明目标之间存在干扰。使用基于激活的方法,我们识别了与每个目标相关的神经元,并通过定向消融研究其功能角色。我们发现这些神经元因果地支持其对应目标,同时往往对对立目标产生负面影响。我们发现相当比例的神经元在有用性和无害性之间共享,并且这些共享神经元对模型行为产生不成比例的影响,导致对齐张力。此外,我们的结果提供了关于对齐目标如何在奖励模型中表示以及为什么多目标对齐仍然具有挑战性的见解和机制解释,为未来关于解耦和可控对齐方法的研究提供了动力。

英文摘要

Reward models are a key component of reinforcement learning from human feedback (RLHF), aligning language models toward both helpful and harmless behaviour. However, the internal mechanisms underlying these objectives and their conflicts remain poorly understood. We study alignment tension in reward models trained under helpfulness-only, harmlessness-only, and mixed-objective settings. We find that mixed-objective models often underperform single-objective models, indicating interference between objectives. Using activation-based methods, we identify neurons associated with each objective and study their functional roles via targeted ablations. We find that these neurons causally support their corresponding objectives while often negatively affecting the opposing one. We find that a substantial proportion of neurons are shared between helpfulness and harmlessness, and that these shared neurons exert a disproportionate influence on model behaviour, contributing to alignment tension. Additionally, our results provide insights and mechanistic interpretation into how alignment objectives are represented in reward models and why multi-objective alignment remains challenging, motivating future work on disentangled and controllable alignment methods.

2606.13206 2026-06-12 cs.CV cs.RO 新提交

Visual Place Recognition in Forests with Depth-Aware Distillation

基于深度感知蒸馏的森林视觉地点识别

Walter Nedov, Saimunur Rahman, Kavindie Katuwandeniya, David Hall, Kaushik Roy, Peyman Moghadam

发表机构 * CSIRO Robotics, Brisbane, Australia(澳大利亚联邦科学与工业研究组织机器人实验室,布里斯班,澳大利亚) University of Queensland, Brisbane, Australia(昆士兰大学,布里斯班,澳大利亚) Queensland University of Technology, Brisbane, Australia(昆士兰科技大学,布里斯班,澳大利亚)

AI总结 针对森林环境中视觉地点识别因植被重复、结构线索弱及外观变化大而困难的问题,提出轻量级深度感知蒸馏框架,将几何线索注入DINOv2模型,在WildCross基准上提升鲁棒性。

详情
Comments
IEEE ICRA Workshop on Field Robotics 2026
AI中文摘要

在自然森林环境中,由于植被重复、结构线索弱以及穿越过程中外观变化显著,视觉地点识别仍然具有挑战性。为解决这一限制,本文提出了一种轻量级的深度感知蒸馏框架,该框架将几何线索注入基于DINOv2的地点识别模型,同时保持其预训练的描述符空间。在最近的WildCross基准上进行评估,所提出的方法相比仅依赖外观的对应方法取得了性能提升,对外观变化具有鲁棒性。这些结果证明了深度作为自然环境中地点识别的强互补模态的重要性,并指出深度感知蒸馏是迈向更鲁棒森林感知的一个有前景的方向。

英文摘要

Visual place recognition in natural forest environments remains challenging due to repetitive vegetation, weak structural cues, and significant appearance variation across traversals. To address this limitation, this paper proposes a lightweight depth-aware distillation framework that injects geometric cues into a DINOv2-based place recognition model, while maintaining its pre-trained descriptor space. Evaluated on the recent WildCross benchmark, the proposed approach yields gains over an appearance-only counterpart, providing robustness to appearance variations. These results demonstrate the importance of depth as a strong complementary modality for place recognition in natural environments and identify depth-aware distillation as a promising direction for more robust forest perception.

2606.13203 2026-06-12 cs.RO 新提交

Embedding ISO 10218 Safety Compliance in Robots via Control Barrier Functions for Human-Robot Collaboration

通过控制障碍函数将ISO 10218安全合规性嵌入机器人以实现人机协作

Federico Parma, Cesare Tonola, Nicola Pedrocchi, Manuel Beschi

发表机构 * Dept. of Electrical and Information Engineering, Polytechnic of Bari(巴里理工大学电气与信息工程系) Dipartimento di Ingegneria Meccanica e Industriale, University of Brescia(布雷西亚大学机械与工业工程系) Institute of Intelligent Industrial Technologies and Systems, National Research Council of Italy, STIIMA-CNR(意大利国家研究委员会智能工业技术与系统研究所)

AI总结 提出基于控制障碍函数(CBF)的方法,利用人体加速度数据预测最小人机距离,并通过序列二次规划(SQP)框架实现安全约束,在UR10e上验证了该方法在遵守ISO 10218标准的同时减少轨迹误差63%。

详情
AI中文摘要

人机协作(HRC)需要严格遵守安全标准(如ISO 10218),以防止有害交互。标准的速度与分离监控(SSM)滤波器基于保守假设(如人体速度恒定)计算安全机器人速度,这阻碍了对最小分离距离的准确预测,并导致不必要的操作停止。本文提出一种控制障碍函数(CBF),明确纳入人体加速度数据,以在机器人最坏情况制动轨迹期间解析地前向预测最小人机分离距离。为保证控制层面的安全性,该预测性CBF作为不等式约束被集成到序列二次规划(SQP)框架中。具体地,提出了两种方法:方法I,一种CBF约束的PD安全滤波器;方法II,一种执行空间管约束的任务缩放SQP控制器。在UR10e机器人上的仿真和实际实验评估了两种方法相对于标准工业SSM模块基线的性能。结果表明,方法II动态调节执行速度并限制空间偏差。与方法I相比,方法II在平均轨迹误差上减少了63%,并避免了过度规避动作,在遵守ISO 10218 SSM指南的同时确保了高任务吞吐量。

英文摘要

Human-Robot Collaboration (HRC) requires strict adherence to safety standards, such as ISO 10218, to prevent harmful interactions. Standard Speed and Separation Monitoring (SSM) filters calculate safe robotic speeds based on conservative assumptions, such as constant human velocity, which prevents accurate predictions of minimum separation distances and causes unnecessary operational halts. This paper proposes a Control Barrier Function (CBF) that explicitly incorporates human acceleration data to analytically forward-predict the minimum human-robot separation distance during a worst-case robotic stopping trajectory. To guarantee safety at the control level, this predictive CBF is integrated as an inequality constraint within a Sequential Quadratic Programming (SQP) framework. Specifically, two methods are proposed: Method I, a CBF-constrained PD safety filter; and Method II, a task-scaling SQP controller that enforces a spatial tube constraint. Simulated and real-world experiments on a UR10e robot evaluate the two proposed methods against a standard industrial SSM module baseline. Results demonstrate that Method II dynamically modulates execution speed and confines spatial deviations. Compared to Method I, Method II achieves a 63\% reduction in mean trajectory error and avoids excessive evasive manoeuvres, ensuring high task throughput while complying with ISO 10218 SSM guidelines.

2606.13201 2026-06-12 cs.AI 新提交

A Minimal Model of Bounded Trade-Off Screening in Multi-Attribute Choice

多属性选择中有限权衡筛选的最小模型

Manisha Dubey, Anirban Sarkar, Subramanian Ramamoorthy

发表机构 * School of Informatics, University of Edinburgh, UK(英国爱丁堡大学信息学院) Cold Spring Harbor Laboratory, USA(美国冷泉港实验室)

AI总结 提出有限权衡推理框架,通过引入权衡容忍参数模拟筛选过程,产生不同于标准效用模型的偏好模式,解释多属性选择中的情境依赖行为。

详情
Comments
3 pages, 1 figure, accepted as extended abstract at Annual Conference on Cognitive Computational Neuroscience 2026
AI中文摘要

人类决策通常涉及在多属性备选方案之间进行选择,然而经典模型假设完全补偿性效用聚合,尽管有证据表明人们会拒绝在关键属性上表现较差的选项。我们提出了一个有限权衡推理框架,其中决策由一个评估属性间得失平衡的筛选过程控制。该模型引入了一个权衡容忍参数,该参数控制可接受的不平衡程度,并可能随情境变化。通过模拟,我们展示了该机制产生的偏好模式不同于标准基于效用的模型,并捕捉了权衡行为中的情境依赖变化。这些结果确立了有限权衡筛选作为多属性选择中一种合理的计算机制,并为未来的行为研究提供了可检验的预测。

英文摘要

Human decision-making often involves choosing between multi-attribute alternatives, yet classical models assume fully compensatory utility aggregation despite evidence that people reject options with poor performance on critical attributes. We propose a bounded trade-off reasoning framework in which decisions are governed by a screening process that evaluates the balance between gains and losses across attributes. The model introduces a trade-off tolerance parameter that controls acceptable imbalance and can vary across contexts. Through simulation, we show that this mechanism produces preference patterns that differ from standard utility-based models and captures context-dependent variation in trade-off behavior. These results establish bounded trade-off screening as a plausible computational mechanism for multi-attribute choice and generate testable predictions for future behavioral studies.

2606.13197 2026-06-12 cs.AI 新提交

ARMOR-MAD: Adaptive Routing for Heterogeneous Multi-Agent Debate in Large Language Model Reasoning

ARMOR-MAD:大语言模型推理中异构多智能体辩论的自适应路由

Fuqiang Niu, Bowen Zhang

发表机构 * School of Cyber Science and Technology, University of Science and Technology of China(中国科学技术大学网络空间安全学院) School of Artificial Intelligence, Shenzhen Technology University(深圳技术大学人工智能学院)

AI总结 提出ARMOR-MAD框架,通过辩论前协议路由、早期一致停止评估和语义异常检测,自适应控制异构多智能体辩论,提升推理准确性和效率。

详情
AI中文摘要

多智能体辩论(MAD)可以改进大语言模型推理,但固定的辩论流程常常浪费计算资源,并可能放大相似智能体之间的相关错误。我们提出ARMOR-MAD,一个无需训练的异构MAD框架,将辩论视为条件计算。ARMOR-MAD结合了三个组件:辩论前协议路由(PAR)决定独立生成的第0轮答案是否需要辩论;早期一致停止评估器(EASE)在收敛后停止辩论;以及语义异常检测(SOD)在聚合过程中降低异常最终答案的权重。在MATH Level 5、GSM8K、MMLU和MMLU-Pro上,ARMOR-MAD在使用相同模型池的情况下,始终优于固定轮次的异构辩论,分别达到65.5%、96.5%、90.0%和81.5%的准确率。结果表明,真正的模型异构性和基于协议的控制对于使MAD更准确和高效都很重要。

英文摘要

Multi-agent debate (MAD) can improve large language model reasoning, but fixed debate pipelines often waste computation and can amplify correlated errors among similar agents. We propose ARMOR-MAD, a training-free heterogeneous MAD framework that treats debate as conditional computation. ARMOR-MAD combines three components: Pre-debate Agreement Routing (PAR) decides whether independently generated Round-0 answers require debate; Early Agreement Stopping Evaluator (EASE) stops debate after convergence; and Semantic Outlier Detection (SOD) down-weights abnormal final answers during aggregation. Across MATH Level 5, GSM8K, MMLU, and MMLU-Pro, ARMOR-MAD consistently improves over fixed-round heterogeneous debate with the same model pool, reaching 65.5\%, 96.5\%, 90.0\%, and 81.5\% accuracy, respectively. The results suggest that genuine model heterogeneity and agreement-based control are both important for making MAD more accurate and efficient.