本篇博文主要内容为 2026-07-16 从Arxiv.org论文网站获取的最新论文列表，自动更新，按照NLP、CV、ML、AI、IR、MA六个大方向区分。
说明：每日论文数据从Arxiv.org获取，每天早上12:30左右定时自动更新。
提示: 当天未及时更新，有可能是Arxiv当日未有新的论文发布，也有可能是脚本出错。尽可能会在当天修复。
目录
概览 (2026-07-16)
今日共更新549篇论文,其中:
- 自然语言处理共54篇(Computation and Language (cs.CL))
- 人工智能共149篇(Artificial Intelligence (cs.AI))
- 计算机视觉共102篇(Computer Vision and Pattern Recognition (cs.CV))
- 机器学习共140篇(Machine Learning (cs.LG))
- 多智能体系统共9篇(Multiagent Systems (cs.MA))
- 信息检索共10篇(Information Retrieval (cs.IR))
- 人机交互共14篇(Human-Computer Interaction (cs.HC))
多智能体系统
[MA-0] he Dynamic Verifiable Multi-Agent Human Agent Agent Human Agentic Loyalty Loop (DVM-HALL) Model and the Net Human-Agent Score (NHAS) in Autonomous Commerce
【速读】：该论文旨在解决生成式 AI（Generative AI）驱动的自主代理（Agentic AI）兴起对传统客户忠诚度范式造成的根本性冲击问题。随着智能体从被动推荐算法演变为具备目标导向与自主决策能力的实体，传统的消费者—品牌关系模型因无法涵盖算法的有限理性（algorithmic bounded rationality）与人为构建的自主性（constructed autonomy），已难以解释新型人机协同下的品牌选择行为。其解决方案的关键在于提出动态可验证多智能体人类代理忠诚循环模型（Dynamic Verifiable Multi-Agent Human Agentic Loyalty Loop, DVM-HALL），通过软最大化（softmax）概率框架将人类情感权益、智能体经验效用、校准信任度、委托权限及可验证执行共同纳入品牌选择机制，并引入递归更新机制以在每次交互后动态调校信任与授权水平。尤为关键的是，该模型嵌入了去中心化金融（DeFi）与代币化忠诚体系中的可验证执行层，将交易风险因素——如Gas费用、滑点、MEV暴露及智能合约漏洞——作为影响代理品牌偏好的核心预测变量。此外，研究提出可审计的风险加权指标“净人机评分”（Net Human-Agent Score, NHAS），基于人类反馈、执行日志、基准对比与可验证凭证综合评估人机对齐程度。最终，通过三阶段实证验证计划（受控购物实验、多智能体市场模拟与DeFi测试床）构建理论基础，为品牌应对机器客户时代提供系统性框架。
链接: https://arxiv.org/abs/2607.13998
作者: Sai Srikanth Madugula,Peplluis Esteva de la Rosa,Daya Shankar
机构: Woxsen University(沃森大学); Universitat de Girona(赫罗纳大学)
类目: ocial and Information Networks (cs.SI); Artificial Intelligence (cs.AI); Computer Science and Game Theory (cs.GT); Multiagent Systems (cs.MA)
备注:
Abstract:The rapid proliferation of Agentic Artificial Intelligence fundamentally disrupts traditional customer loyalty paradigms. As AI evolves from passive recommendation algorithms to autonomous, goal-directed agents capable of executing purchasing decisions, the conventional understanding of consumer-brand relationships requires a structural reevaluation. By synthesizing extant literature across human-machine teaming, consumer decision-making, and algorithmic trust dynamics, we demonstrate that traditional loyalty models fail to account for algorithmic bounded rationality and constructed autonomy. To address this, we introduce the Dynamic Verifiable Multi-Agent Human Agentic Loyalty Loop (DVM-HALL) model. We formalize brand choice via a softmax probability formulation where human emotional equity, agentic machine-experience utility, calibrated trust, delegated authority, and verifiable execution jointly determine selection. The model features recursive updating mechanisms to dynamically calibrate trust and delegation after each interaction. Crucially, the framework integrates a verifiable execution layer for Decentralized Finance (DeFi) and tokenized loyalty settings, incorporating execution risks – such as gas costs, slippage, MEV exposure, and smart-contract vulnerabilities – as core predictors of agentic brand preference. Furthermore, we introduce the Net Human-Agent Score (NHAS), an auditable, risk-weighted metric designed to measure human-agent alignment using human feedback, execution logs, benchmark comparisons, and verifiable receipts. Finally, we propose a comprehensive three-stage empirical validation plan spanning controlled shopping experiments, multi-agent market simulations, and DeFi testbeds. This framework provides the foundational theory required for brands to navigate the impending transition toward machine customers.
[MA-1] Pezego-HITL: A policy-grounded large language model architecture for agricultural extension in Ghana
【速读】：该论文旨在解决生成式 AI 在小农户农业决策支持场景中面临的高风险作物保护问题，核心挑战在于：传统仅关注输出质量的评估指标无法满足农业决策中对安全性、合规性、实用性与系统延迟的综合要求。为此，论文提出将政策约束下的大模型评估建模为一个自适应计算资源分配问题，其关键解决方案是引入P-EVAL（Policy-grounded Expert-calibrated VALidation protocol）——一种基于政策约束的专家校准统一评估框架。该框架通过结构化检索增强生成（Retrieval-Augmented Generation, RAG）与经过验证的记忆路由机制，显式权衡安全合规性、农艺实用性、运行延迟及专家监督工作量等多维目标。在加纳实地部署的Pezego-HITL架构上，该方案使政策对齐率（PAR）提升至0.94，农艺效用率（AUR）达0.95，同时在保持高缓存重用率（59.6%）的前提下，将P95延迟降低55%（从28.6秒降至12.9秒）。此外，该框架在开源模型Qwen3.5-9B-DeepSeek-V4-Flash上亦展现出良好泛化能力，实现86%的PAR与54.5%的延迟下降。通过面向30名农业推广官员与36名小农户的问卷调查，进一步验证了其实际应用价值与社会技术融合潜力。整体而言，该研究构建了一种可扩展、可信的智能农业推广系统范式，实现了安全—效用—延迟之间的可解释性权衡。
链接: https://arxiv.org/abs/2607.13934
作者: Shunbao Li,Zhipeng Yuan,Amoako Ofori,Benedicta Y. Fosu-Mensah,Yang Li,Manu Kenchappa Junjanna,Qing Xue,Po Yang
机构: University of Sheffield (谢菲尔德大学); University of Ghana (加纳大学); Mutus (穆图斯)
类目: Multiagent Systems (cs.MA)
备注:
Abstract:Large language models are increasingly deployed in agricultural decision-support settings, yet high-stakes crop protection in smallholder agriculture requires more than output-quality benchmarks. Over a two-year design and evaluation programme, we formalise policy-constrained large language model assessment as an adaptive compute allocation problem that jointly captures safety compliance, helpfulness, operational latency, and expert supervision workload. We introduce P-EVAL (Policy-grounded Expert-calibrated VALidation protocol), a unified evaluation framework for policy-grounded decision support, evaluating the architecture on a simulated field query database consisting of 1,240 cases. The protocol is instantiated on the Pezego advisory architecture (Pezego-HITL) and evaluated in Ghana. Following offline judge calibration against gold-standard human expert decisions ( \kappa = 0.77 ), we evaluate the architectural performance under simulated query workloads. Under P-EVAL, our memory-routed architecture improves the Policy Alignment Rate (PAR) to 0.94 and the Agronomic Utility Rate (AUR) to 0.95, while reducing P95 latency by 55% (from 28.6s to 12.9s) through a 59.6% cache reuse ratio. We also demonstrate generalisability using the open-source \textttQwen3.5-9B-DeepSeek-V4-Flash model, achieving a PAR of 0.86 and a 54.5% latency reduction (to 10.2s). To evaluate practical utility and socio-technical integration, we administer detailed questionnaires to Ghanaian Extension Services Officers ( N=30 ) and smallholder farmers ( N=36 ). Taken together, this work demonstrates how policy-grounded structured retrieval-augmented generation with validated-memory routing makes safety-utility-latency trade-offs explicit, offering a scalable template for trustworthy AI-driven extension in smallholder farming systems.
[MA-2] A Deployed Hybrid Vehicle-in-the-Loop Platform for Validating Cooperative Perception ITSC2026
【速读】：该论文旨在解决自动驾驶车辆在真实道路环境中进行型式认证（homologation）时，因测试成本高、周期长及安全性风险大而面临的验证难题。随着欧洲安全法规允许以虚拟方式生成大量自动化驾驶的认证证据，如何构建一个既符合法规要求又能高效、可信地模拟复杂交通场景的验证平台成为关键挑战。其解决方案的核心在于部署了一个融合物理-虚拟系统的车-路协同闭环测试平台（Hybrid Vehicle-in-the-Loop, ViL），该平台通过V2X消息管道将实车采集的符合ETSI标准的协作感知消息（CAM/CPM）实时传输至基于CARLA构建的数字孪生（Digital Twin, DT）系统中，并在数字孪生端利用GPU加速的协同感知（Cooperative Perception, CP）模块，在运行时对多源感知数据进行融合，生成概率性占据栅格（probabilistic occupancy grid）。实验结果表明，该平台在多车双T型交叉口场景下显著扩展了视场覆盖范围（FoV），提升了被占单元的召回率；同时，研究揭示了当定位噪声超过一定阈值后，位置不确定性成为主要误差来源，而非天气条件。该平台当前架构的局限性也明确了未来工程优化目标，其发展路径正逐步迈向面向地中海地区运行设计域（Mediterranean Operational Design Domain, ODD）的专用测试服务。
链接: https://arxiv.org/abs/2607.13806
作者: Anastasia Bolovinou,Giorgos Hadjipavlis,Markos Antonopoulos,Panagiotis Tachtalis,Konstantinos Petousakis,Konstantinos Lazaridis,Alexandros Siskos,Bill Roungas,Angelos Amditis
机构: 未知
类目: Robotics (cs.RO); Multiagent Systems (cs.MA)
备注: 4 pages, 5 figures, to be presented in the IEEE ITSC 2026 Industry Track
Abstract:European safety regulation now permits a large share of automated-driving homologation evidence to be produced virtually, provided a validated physical-virtual facility generates it. We present a deployed hybrid Vehicle-in-the-Loop (ViL) platform that couples a real instrumented vehicle with a CARLA-based digital twin (DT) through a V2X message pipeline, and we report its first integrated operation on a public-road-representative test track. A real vehicle streams ETSI-compliant CAM/CPM messages into the DT, where a GPU-accelerated Cooperative Perception (CP) module fuses them into a probabilistic occupancy grid during scenario runtime. We demonstrate the platform on a multi-vehicle double T-intersection scenario, characterise the CP workload across nominal, rain and night conditions and five localization-noise levels, and discuss the platform’s current architectural limits and the engineering targets they define. The results show that CP substantially widens field-of-view (FoV) coverage and improves occupied-cell recall, and that beyond a moderate localization-noise threshold, positioning uncertainty, and not weather, becomes the dominant error source. We outline the platform’s trajectory toward a Mediterranean operational design domain (ODD) testing service.
[MA-3] Social Simulations: from Agent -Based Modeling to Digital Twins
【速读】：该论文旨在解决传统社会模拟方法在刻画复杂社会系统时面临的抽象性与现实契合度不足的问题。其核心挑战在于如何构建既能保持理论可解释性，又能高保真还原真实社会技术系统动态演化的计算模型。解决方案的关键在于从经典基于规则的智能体模型（Agent-Based Models, ABMs）向融合大语言模型（Large Language Models, LLMs）的AI增强型仿真，最终发展为社会数字孪生（Social Digital Twins）的范式演进。这一演进的核心突破在于引入数据驱动与生成式人工智能能力，使模拟系统能够动态学习、自适应演化，并实现对特定社会系统的高精度实时映射与预测，从而显著提升模拟的真实性、灵活性与应用价值。
链接: https://arxiv.org/abs/2607.13693
作者: Erica Cau,Andrea Failla,Valentina Pansanella,Giulio Rossetti
机构: University of Pisa(比萨大学); ISTI-CNR(意大利国家研究委员会信息与通信技术研究所)
类目: Multiagent Systems (cs.MA); Artificial Intelligence (cs.AI); Social and Information Networks (cs.SI); Physics and Society (physics.soc-ph)
备注: Entry for Encyclopedia of Social Network Analysis and Mining
Abstract:This book chapter covers the evolution of social simulation from classical agent-based models, in which agents interact according to explicitly defined behavioral rules, to AI-enhanced simulations based on Large Language Models and, ultimately, Social Digital Twins: high-fidelity, data-driven representations of real-world socio-technical systems. Along this trajectory, we discuss the main methodological foundations, applications, advantages, and limitations of each paradigm, highlighting the progressive shift from abstract models designed to investigate general social mechanisms toward increasingly realistic computational representations of specific social systems.
[MA-4] Extending Liquid Rank Toward Multi-Source Reputation Aggregation
【速读】：该论文旨在解决多源异构声誉信息难以有效整合与统一评估的问题，特别是在涉及人类与机器代理的复杂社会技术系统中，如何实现跨上下文、跨子系统的参与度与贡献度的综合衡量。其解决方案的关键在于提出一种可扩展的液态排名（Liquid Rank）声誉体系框架，通过引入显式的权重分配与融合机制，实现对内部生成声誉与外部声誉信号的灵活整合，从而在保持细粒度控制的同时，支持不同声誉来源相对影响力的动态调整，为多样化治理与协调场景下的基于声誉的决策机制提供灵活且可扩展的基础。
链接: https://arxiv.org/abs/2607.13615
作者: Nejc Znidar,Anton Kolonin
机构: 未知
类目: Multiagent Systems (cs.MA); Computers and Society (cs.CY)
备注:
Abstract:In this paper, we present an extension of liquid rank reputation systems that enables the aggregation and blending of multiple heterogeneous reputation sources into a unified reputation score. The proposed framework supports the incorporation of external reputational signals alongside internally generated reputation, allowing influence to reflect participation and contribution across multiple contexts and subsystems. By introducing explicit weighting and blending mechanisms, the model provides fine-grained control over the relative impact of individual reputation sources, making it adaptable to diverse governance and coordination scenarios involving both human and machine agents. The resulting approach extends existing liquid rank systems and offers a flexible foundation for designing reputation-based governance mechanisms in complex socio-technical environments.
[MA-5] Equilibrium stability as a driver of cooperation among Q-learners
【速读】：该论文旨在解决定价算法之间可能发生的算法共谋（algorithmic collusion）问题，特别是此类共谋导致持续高于竞争水平的价格（supra-competitive prices）并损害社会福利的潜在风险。现有研究多聚焦于强化学习算法在探索（exploration）随时间衰减的假设下收敛至合作策略的概率，但这一假设与实际部署中算法需持续探索以适应动态环境的现象相悖。为此，本文引入恒定探索（constant exploration）机制，重新审视学习动态。在此设定下，核心问题不再关注算法是否收敛至特定策略组合，而是考察算法在合作策略上所花费的时间比例。即使在最基础的一期记忆重复囚徒困境模型中，该框架也引出高维随机学习动力学，难以进行完全解析求解。论文通过分析Q-learning过程的期望动态，推导出一个可预测合作策略在时间平均意义上占主导地位的边界条件，并通过大量模拟验证该边界对ε-greedy Q-learning下非背叛主导行为具有强预测能力。其关键解决方案在于构建基于期望动态的理论边界，以刻画恒定探索下合作行为的可持续性，从而为理解现实场景中算法共谋的演化提供了新的分析范式。
链接: https://arxiv.org/abs/2607.13607
作者: Janusz M. Meylahn,Maximilian Schäfer
机构: University of Twente (特温特大学); Institut Mines-Télécom Business School (电信-矿业商学院)
类目: Multiagent Systems (cs.MA); General Economics (econ.GN); Theoretical Economics (econ.TH)
备注: 35 pages, 14 figures
Abstract:Algorithmic collusion among pricing algorithms has raised concerns about sustained supra-competitive prices and their implications for social welfare. Existing work has largely focused on the probability that reinforcement-learning algorithms converge to cooperative strategies, typically under the assumption that exploration vanishes over time. Motivated by the observation that algorithms deployed in practice are likely to continue exploring in order to remain adaptive to changing environments, we study learning dynamics under constant exploration. In this setting, the relevant question is no longer whether an algorithm converges to a particular strategy profile, but rather what fraction of time the algorithms spend playing cooperative strategies. Even in the benchmark case of the repeated Prisoner’s Dilemma with one-period memory, this yields high-dimensional stochastic learning dynamics, for which a complete analytic treatment is intractable. We show that cooperative strategies can be dominant in this time-averaged sense and derive a boundary predicting when such dominance arises, based on the expected dynamics of the Q-learning process. Extensive simulations show that this boundary is a strong predictor for non-defection-dominated behaviour under epsilon-greedy Q-learning.
[MA-6] DevicesWorld: Benchmarking Cross-Device Agents in Heterogeneous Environments
【速读】：该论文旨在解决当前大语言模型（LLM）智能体在跨设备协同操作能力评估方面的不足。现有研究大多聚焦于单一设备环境（如手机或桌面系统），难以衡量智能体在多设备间获取、整合信息并完成具有跨设备依赖关系的端到端任务的能力。为此，论文提出DevicesWorld——一个大规模可执行的跨设备协作操作基准测试平台，集成移动设备、桌面系统与物联网（IoT）三类异构设备环境，构建统一的跨设备交互与评估框架。其核心解决方案在于：通过设计包含自然语言用户目标、参与设备、初始状态、可执行动作、基于规则的验证器及清理流程的6,140个任务，结合多阶段构建与质量控制流程，确保任务贴近真实用户需求的同时支持自动化验证。实验表明，即使是最先进的五种LLM智能体系统在固定测试集上的成功率也仅为12.5%，且近28.7%的失败案例满足部分评分条件但未达成完整任务目标，暴露出智能体在信息获取、界面操作、设备角色混淆及任务终止时机等方面的关键缺陷。DevicesWorld将跨设备协作操作转化为可执行、可复现且具备诊断价值的评估范式，为研发可靠跨设备智能体提供了关键基础设施。
链接: https://arxiv.org/abs/2607.13465
作者: Huatao Li,Xinwei Geng,Yuheng Wang,Yutong Li,Runde Yang,Hantao Chen,Shu Yao,Jingru Fan,Xuhui Ren,Yuanyuan Zhao,Fei Huang,Chen Qian
机构: Shanghai Jiao Tong University (上海交通大学); Honor Device Co., Ltd (荣耀设备有限公司)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC); Multiagent Systems (cs.MA); Software Engineering (cs.SE)
备注: this https URL
Abstract:LLM-based agents have rapidly improved at operating individual digital environments such as mobile applications, desktop systems, and smart homes. However, real-world user goals often span multiple devices: information may come from a phone, be processed on a desktop, and the result may need to appear on another device. Most existing benchmarks center on a single dominant execution environment, making it difficult to evaluate whether agents can acquire and integrate information across heterogeneous devices and complete end-to-end tasks with cross-device dependencies. We introduce DevicesWorld, a large-scale executable benchmark for cross-device collaborative operation. DevicesWorld contains 6,140 tasks and integrates three classes of device environments – mobile, desktop, and IoT – into a unified cross-device interaction and evaluation framework. Each task defines a natural-language user goal, participating devices and initial states, executable actions, rule-based verifiers, and a cleanup procedure. A multi-stage construction and quality-control pipeline keeps tasks close to realistic user needs while allowing final outcomes to be automatically verified from device states and generated files. We evaluate five frontier LLM-agent systems on a fixed evaluation set. All methods achieve low success rates, with the best reaching only 12.5%. Among failed runs, about 28.7% satisfy at least one scoring condition yet still fail the full task. Trajectories show that agents become stuck acquiring information or manipulating interfaces, confuse source and output devices, or terminate before all conditions are jointly satisfied. DevicesWorld turns cross-device collaborative operation into an executable, reproducible, and diagnostically useful evaluation problem for research on reliable cross-device agents.
[MA-7] Stress-Sharing: A Bio-Inspired Approach to Decentralized Fault Repair in Modular Spacecraft
【速读】：该论文旨在解决模块化航天器在遭受结构损伤后，因缺乏自主修复能力而导致机械与通信连通性中断、系统功能退化的关键问题。现有方法依赖冗余设计或预先规划的重构策略，无法在仅依赖局部信息和物理约束条件下实现自主修复。其解决方案的关键在于提出一种完全去中心化、异步的应力共享修复机制，该机制受生物伤口愈合过程启发：通过局部应激信号引导幸存模块向受损区域移动以填补断裂间隙，随后各模块仅利用本地信息，无需绝对位置感知，通过原路返回自身位移轨迹，恢复损伤前的原始构型。该方法在PyBullet刚体仿真中验证，适用于最多160个模块的结构，在不同故障密度（10%、20%、30%）及随机与局域损伤场景下均能将幸存模块整合为单一连通体，即使在最严重随机故障（30%失效）情况下，仍可使约80%以上的幸存模块形成连通组件，且随着系统规模增大，修复成功率进一步提升，表明该策略适合作为大型模块化航天器的群体尺度自主修复方案。
链接: https://arxiv.org/abs/2607.13444
作者: Sidhdharth D. Sikka,Yue Shen,Shaoshuai Mou
机构: Purdue University (普渡大学); Manifold Research Group
类目: Robotics (cs.RO); Multiagent Systems (cs.MA); Systems and Control (eess.SY)
备注: 10 pages, 5 figures. Submitted to the IEEE Transactions on Aerospace and Electronic Systems
Abstract:Structural damage in modular spacecraft can disrupt mechanical and communication connectivity, reducing system capability. Existing approaches rely on redundancy or preplanned reconfiguration and do not enable autonomous repair under local information and physical constraints. We model the spacecraft as a lattice-constrained graph and introduce a fully decentralized, asynchronous stress-sharing repair policy inspired by biological wound healing: local distress signals guide surviving modules toward damaged regions to close fragmented gaps, after which each displaced module locally retraces its own motions to recover the pre-damage shape, using only local information and no absolute position sensing. We evaluate the policy in PyBullet rigid-body simulation across structures of up to 160 modules, three fault densities (10, 20, 30%), and random and localized damage. The policy consolidates the surviving modules into a single connected body: even in the most severe case tested, where 30% of modules fail at random, it gathers roughly 80% or more of the surviving modules into one connected component, and this fraction improves with assembly size, making the approach well suited as a swarm-scale repair policy for large modular spacecraft.
[MA-8] Learning Latency-Aware Orchestration for Multi-Agent Systems
【速读】：该论文旨在解决多智能体系统（Multi-agent Systems, MAS）在基于大语言模型（LLM）的协同推理中面临的高推理延迟问题。现有编排方法虽优化了任务性能与推理开销，但未能有效降低端到端延迟，其根源在于：延迟主要由关键路径（critical path）决定，单纯减少总执行成本无法保证延迟下降；同时，盲目追求低延迟可能破坏操作级信用分配（operator-level credit assignment），导致任务准确率下降。为克服这一挑战，论文提出一种面向延迟感知的多智能体系统（Latency-Aware Multi-agent System, LAMaS），其核心创新在于双层优化机制：训练阶段通过引入关键路径感知的约束优化，学习具备延迟意识的执行图；推理阶段则引入轻量级控制器，动态识别并剔除冗余的未来智能体交互，以利用运行时证据自适应调整执行路径。实验结果表明，LAMaS在四个基准测试上均实现显著的延迟降低（超过50%），且保持或优于现有基线的准确性，同时具备良好的模块化设计与跨系统的可迁移性。
链接: https://arxiv.org/abs/2607.13359
作者: Xi Shi,Mengxin Zheng,Qian Lou
机构: University of Central Florida (中佛罗里达大学); OpenAI (OpenAI)
类目: Multiagent Systems (cs.MA)
备注:
Abstract:Multi-agent systems (MAS) coordinate multiple LLM-powered agents through structured workflows, gaining reasoning power but incurring high inference latency from multi-step execution and repeated model invocations. Existing orchestration methods primarily optimize task performance and inference cost, leaving latency largely unaddressed. In MAS, end-to-end latency is governed by the critical execution path, so reducing total cost alone does not reliably reduce latency. Moreover, optimizing latency while preserving accuracy remains non-trivial: naive latency optimization can misassign operator-level credit and degrade task accuracy. To address this gap, we propose Latency-Aware Multi-agent System (LAMaS), a latency-aware orchestration framework for learning-based multi-agent systems. LAMaS addresses this challenge at two levels: at training time, it learns latency-aware execution graphs through constrained optimization with critical-path-aware credit assignment; at inference time, since a graph committed at training time cannot exploit runtime evidence, it complements graph construction with a lightweight controller that adaptively eliminates redundant future agent interactions as execution unfolds. Experiments on four benchmarks show that LAMaS achieves the best latency among evaluated learning-based MAS baselines, reducing end-to-end latency by over 50% while maintaining competitive or better accuracy. LAMaS is also modular and transfers to other MAS with minimal changes, consistently yielding latency reductions.
自然语言处理
[NLP-0] Hindcast: Replaying Prediction Markets to Evaluate LLM Forecasters
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在预测任务中因信息泄露导致评估失真的问题。传统回溯测试（backtesting）通过重放已知结果来评估模型的预测能力，但存在两个关键漏洞：一是模型可通过检索事件发生后的报告实现“查表式”预测；二是新模型训练数据的时间范围更接近事件发生时间，使得原本属于未来的事件在当前模型训练集中已出现。这两个漏洞导致评估实际衡量的是模型的回忆能力（recall），而非真正的前瞻性判断（foresight）。为解决此问题，论文提出Hindcast评估框架，其核心在于设定一个固定的过去时间点 $ t_0 $，将模型置于该时间点的“历史快照”中进行评估——即仅允许模型访问 $ t_0 $ 之前发布的公共Reddit内容，并以该时间点的Polymarket预测市场价格作为基准进行评分。由于评估基准基于同一历史信息生成的人类预测，且快照数据固定不变，Hindcast能够持续适用于新市场而不会过时。实验表明，尽管关闭信息泄露后检索仍有助于多数模型，但其有效性仅限于事件在Reddit上已有实质性讨论的情形；若仅存在推测性内容，则检索反而会降低预测表现。因此，该方案的关键在于通过时空约束与历史快照机制，实现对模型真实前瞻能力的可靠评估。
链接: https://arxiv.org/abs/2607.14051
作者: Xiao Ye,Jacob Dineen,Evan Zhu,Shijie Lu,Kevin Song,Ben Zhou
机构: Arizona State University (亚利桑那州立大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Forecasters are evaluated by backtesting, which replays resolved questions and grades the probability the system would have assigned before the outcome was known. For LLMs, two channels leak the answer into this test. A model that retrieves can surface reports written after the event, turning forecasting into a lookup, and each new model is trained on data closer to the event, so a question that lay in the future for last year’s models sits inside this year’s training data. Either way, the test grades recall while claiming to grade foresight. We introduce Hindcast, which closes both leaks by grading a model as if it stood at a chosen past date t_0 , before the outcome existed in either channel. Hindcast replays resolved Polymarket prediction markets against a frozen snapshot of public Reddit, lets the model read only posts written before t_0 , and scores each forecast against both what happened and the market’s own price at t_0 , itself a human forecast made from the same past information. Because the cutoff is set per market and the snapshot never changes, the evaluation re-runs on new markets as models improve, without going stale. Once the leak is closed, retrieval still helps most models, but only where Reddit discussed the event beforehand. Where the archive carried only speculation, retrieval hurts.
[NLP-1] Can an Old Dog Be Taught New Tricks? Taking LLM s Beyond Sentence Level Translation
【速读】： 该论文旨在解决自动翻译系统（如计算机辅助翻译工具和机器翻译）长期局限于逐句翻译范式所带来的问题，即忽视了文档整体的语篇组织、修辞风格及语用规范在不同语言文化背景下的差异性。现有系统往往未能充分考虑源语言与目标语言之间在长篇文本层面的深层语用差异，导致译文缺乏自然性和语境适配性。为此，论文提出一种基于检索增强生成（RAG）的全文档语境化翻译系统PAT（Pragmatic Auto-Translator），其核心解决方案在于将用户自定义的翻译规格与来自真实语料库的可比长篇文本（涵盖美国英语与拉丁美洲西班牙语）中的段落级、章节级及文档级上下文示例相结合，通过向大语言模型（LLM）输入这些多层级上下文信息，实现对整篇文档的协同生成。该方法旨在生成符合目标语语用环境的专业初稿，以供人工审校，从而推动翻译从机械的逐句对应转向更具语篇连贯性与文化适应性的重构式翻译。实验结果表明，仅使用有限提示无法实现有效重构，而结合规范设定与语料支持的翻译在部分案例中实现了显著的语用重构，但效果尚不稳定，表明当前方法虽已初步突破传统范式，但仍需进一步优化上下文建模与提示工程以提升重构的有效性。论文还深入探讨了自动翻译系统设计、语料库构建以及翻译质量评估方法论等方面的关键挑战与实践启示。
链接: https://arxiv.org/abs/2607.14040
作者: Alaina Brandt
机构: 未知
类目: Computation and Language (cs.CL)
备注: Accepted for publication in HCI International 2026, Late Breaking Papers Proceedings, Springer LNCS
Abstract:Automatic translation systems, from CAT tools to MT, overwhelmingly treat translation as a sentence-by-sentence act. This paper asks whether LLMs can be moved beyond that paradigm through whole-document, corpus-informed translation. We present PAT (Pragmatic Auto-Translator), a RAG-based system that pairs user-configured specifications with context from a comparable corpus of authentic longform texts in U.S. English and Latin American Spanish, passing retrieved paragraph-, section-, and document-level examples to an LLM for whole-document generation. The goal is draft translation for professional verification: target texts reformulated to fit their Spanish-language context, where discourse organization, rhetorical style, and pragmatic norms differ meaningfully from English. We evaluated six automatic translations of essays on generative AI across three projects using a customized MQM typology, assessed by two trained evaluators working from U.S. English into LATAM and Mexican Spanish. Results show that a limited prompt produced no meaningful reformulation, and specifications and corpus-informed translations at times showed substantial reformulation, though not always to effect. We find that LLMs can be moved toward reformulation and away from the sentence-by-sentence paradigm, though more work is needed to improve the effectiveness of those reformulations. In this paper, we discuss considerations related to automatic translation system design, corpus construction, and translation quality evaluation methodology and results.
[NLP-2] Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0
【速读】： 该论文旨在解决当前代理优化方法在实际部署场景中有效性不足的核心问题：现有研究普遍采用“一次性”优化评估范式，即在固定基准上对代理进行单次优化并报告性能提升，但这种静态评估无法反映真实环境中持续演进的任务与失败反馈所构成的动态优化需求。真正关键的问题在于，优化带来的性能增益是否具有可累积性——即在首次优化后，面对新出现的任务和错误，代理能否继续被优化而不丧失先前获得的优势。为此，作者构建了一个基于Terminal-Bench 2.0中高难度任务的两阶段持续学习评估框架，在相同优化预算下对比了三种代理优化方法（GEPA、Meta Harness 和 RELAI-VCL）。结果表明，尽管所有方法在静态设置下均优于基线，但在引入新任务后表现显著分化：GEPA出现性能退化，Meta Harness虽能良好迁移但无法进一步提升，唯有RELAI-VCL不仅实现了对未见任务的正向迁移，且在将新任务纳入优化目标后仍持续改进，最终在各评估阶段及终身平均通过率上均达到最优（76.4%），显著优于其他方法。其核心发现是，只有在优化循环中嵌入回归控制机制（regression control），才能为模型提供对抗捷径解（shortcut solutions）的归纳偏置，从而实现优化增益的真正累积。
链接: https://arxiv.org/abs/2607.14004
作者: Wenxiao Wang,Priyatham Kattakinda,Soheil Feizi
机构: RELAI.ai
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Technical Report by RELAI ( this http URL )
Abstract:Most reported gains from agent-optimization methods are one-shot: an agent is optimized against a fixed benchmark and the resulting improvement is reported as if it were a stable property of the method. This does not test the setting that matters for deployed agents, where optimization is applied recursively as new failures and new tasks appear over time. The central question this raises is whether optimizer-driven gains compound: after an agent has been optimized once, can it be optimized again on newly arrived tasks without eroding the gains the first round produced? We study this question with a two-phase continual-learning evaluation built from hard tasks in Terminal-Bench 2.0, comparing three approaches to agent-harness optimization (GEPA, Meta Harness, and RELAI’s Verifiable Continual Learning, RELAI-VCL) under identical optimization budgets. All three methods improve over the baseline agent in the conventional, static, single-phase setting. However, once new tasks are introduced, the methods diverge sharply: GEPA’s optimized agent transfers below the unoptimized baseline, Meta Harness transfers well but fails to improve further once given a second optimization budget, and RELAI-VCL is the only method that both transfers positively to unseen tasks and continues improving after those tasks are folded into the optimization objective, reaching the highest pass rate at every evaluated stage and the highest lifelong average pass rate overall (76.4% vs. 66.0% for GEPA, 64.6% for Meta Harness, and 58.7% for the baseline). Our key observation was that optimization gains compounded only when regression control was built into the optimization loop, providing an inductive bias against shortcut solutions that fail to generalize.
[NLP-3] Constraint-Aware Counterfactual Editing for Aspect-Based Sentiment Analysis
【速读】： 该论文旨在解决面向方面的情感分析（Aspect-Based Sentiment Analysis, ABSA）中对抗性样本生成的挑战，即如何在保持非目标方面情感、语义一致性、语言流畅性和事实正确性的前提下，仅改变目标方面的观点极性。现有方法多关注句子级标签翻转，常产生在方面层面无效、语义漂移或逻辑矛盾的修改。其解决方案的关键在于提出一种约束感知的验证编辑框架——CAVE-ABSA，该框架通过显式分离生成与验证过程，首先定位目标方面的意见跨度，再进行受控的对抗性重写，随后通过修复模块优化候选样本，并结合方面级验证、语义相似度、AMR引导的结构保全、编辑最小性、流畅性及矛盾检测等多重机制筛选高质量对抗样本。这一设计使CAVE-ABSA能够构建经过验证的方面级对抗样本数据集，用于模型鲁棒性评估与数据增强，从而有效检验ABSAs模型是否真正依赖于基于方面的语义推理。
链接: https://arxiv.org/abs/2607.13977
作者: S M Rafiuddin,Vamsi Krishna Pavuluri,Atriya Sen
机构: Oklahoma State University (俄克拉荷马州立大学)
类目: Computation and Language (cs.CL)
备注: 15 pages, 1 figure, and 5 tables. Accepted for presentation at the 2nd International Workshop on Informing ML with Knowledge Engineering for Hybrid Intelligent Systems (HHAI-KEML 2026), Brussels, Belgium
Abstract:Aspect-Based Sentiment Analysis (ABSA) requires models to identify sentiment toward specific aspects rather than relying on the global polarity of a sentence. This makes counterfactual evaluation especially challenging: a valid counterfactual should flip the sentiment of one target aspect while preserving the sentiment of all non-target aspects, semantic meaning, fluency, and factual consistency. Existing counterfactual generation methods often focus on sentence-level label flipping and may produce edits that are fluent but aspect-invalid, semantically drifting, or contradictory. To address this limitation, we propose CAVE-ABSA, a Constraint-Aware Validated Editing framework for generating and validating aspect-level counterfactuals. CAVE-ABSA localizes the opinion span associated with the target aspect, performs controlled counterfactual rewriting, refines candidates through a repair module, and filters them using aspect-level verification, semantic similarity, AMR-guided structural preservation, edit minimality, fluency, and contradiction detection. The framework is designed to construct validated counterfactual ABSA datasets for robustness evaluation and data augmentation. By explicitly separating generation from validation, CAVE-ABSA provides a principled approach for producing meaningful aspect-local counterfactuals and for testing whether ABSA models truly rely on aspect-grounded sentiment reasoning.
[NLP-4] DeltaMerge-LowRes: Composing Language and Task Deltas for Low-Resource Adaptation
【速读】： 该论文旨在解决低资源自然语言处理（Low-Resource NLP）场景中，如何在仅有数百个标注样本的情况下，同时适应新语言和新任务的问题。传统方法通常通过代价高昂的联合语言-任务微调（language-task fine-tuning）来实现，导致语言与任务两个维度的适应过程耦合紧密、效率低下。其核心解决方案是将语言适应与任务适应解耦：通过无标签单语文本学习语言增量（language delta, Δ_L），并利用标注的英语数据学习任务增量（task delta, Δ_T），随后在推理阶段通过四种组合规则（加性、激活引导、稀疏感知、以及一种新型的跨轴TIES规则）对两者进行权重空间的独立训练与再组合。其中，关键创新在于提出跨轴TIES（cross-axis TIES），首次将原本用于两任务间的剪枝、符号选择与合并步骤扩展至语言与任务两个不同轴向，实现了更灵活且高效的模型融合。实验表明，跨轴TIES在三个非洲语言上的摘要任务上提升chrF达+4至+7，显著优于仅任务微调基线；同时在问答任务中分别提升F1（+2.32）与准确率（EM，+2.91）；而稀疏感知合并策略在保持宏平均F1不变的前提下，使分类任务的期望校准误差（ECE）降低36%。结果表明，不同的组合规则会显著影响融合模型所保留、抑制及校准的特性，凸显了组合策略在模型行为调控中的关键作用。研究团队已公开所有JSON日志与声明清单以支持可复现性。
链接: https://arxiv.org/abs/2607.13967
作者: Son Ha Xuan,Xuan-Bach Le,Phat T. Tran-Truong
机构: RMIT University (皇家墨尔本理工大学); Ho Chi Minh City University of Technology (HCMUT) (胡志明市技术大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Adapting a multilingual encoder to a new language \emphand a new task with only a few hundred gold examples is a common low-resource NLP setting, yet the two axes are usually fused via an expensive language–task fine-tuning run. We ask whether they can instead be trained separately and recombined in weight space. \DeltaMergeLowRes learns a language delta \Delta_L from unlabeled monolingual text and a task delta \Delta_T from labeled English data, then composes them at inference under one of four rules: additive, activation-guided, sparsity-aware, and a novel \emphcross-axis TIES. The new rule adapts the TIES-Merging steps of trimming, sign election, and merging to the language and task axes rather than to two task axes. Holding (\Delta_L,\Delta_T) fixed across rules on four task families and four African languages ( 158 evaluated cells, 10,000 -sample paired bootstrap per cell), we find: (i) cross-axis TIES wins summarisation on 3/4 languages by +4 to +7 chrF (chrF 18.59 vs.\ 13.80 task-only); (ii) it improves QA F1 by +2.32 and EM by +2.91 ; and (iii) sparsity-aware merging cuts classification ECE by 36% at parity macro-F1. The composition rule materially changes what the merged model preserves, suppresses, and calibrates. We release all JSON traces and a claim ledger.
[NLP-5] DeepStress: Stress-Testing Deep Search Agents
【速读】： 该论文旨在解决搜索代理在面对低质量证据时鲁棒性不足的问题，尤其是在真实应用场景中，尽管此类情况在现有基准测试中罕见，却可能导致系统严重失效。其核心解决方案是提出一种名为DeepStress的应力测试框架，通过用可控的合成环境替代搜索代理中的检索模块，精确调控影响文档可靠性的三个关键维度——可信度（trustworthiness）、相关性（relevance）和事实性（factuality），从而系统性地评估代理对不可靠信息的处理能力。实验在HotpotQA和BrowseCompPlus数据集上进行，结果表明不同搜索代理在应对不实信息方面存在显著差异，并提出了新的评估指标，能够更准确地刻画系统表现以及参数化知识与检索知识之间冲突的交互机制。
链接: https://arxiv.org/abs/2607.13920
作者: Ismael Rousseau,Geraldine Damnati,Frederic Bechet
机构: 未知
类目: Computation and Language (cs.CL)
备注: 9 pages preprint
Abstract:While search agents demonstrate impressive capabilities in multi-step question answering, their robustness to poor-quality evidence remains under-explored. This phenomenon occurs rarely in realistic benchmarks but can lead to dramatic failure in real life applications. Therefore in this study we propose DeepStress, a stress testing framework that controls the frequency of challenging evidence by replacing the retrieval module of search agents with a controlled synthetic environment. We use this framework to control three dimensions that can affect document reliability: trustworthiness, relevance, and factuality. Testing several search agents on HotpotQA and BrowseCompPlus, we demonstrate that agents exhibit substantial differences in their ability to handle unreliable information and propose new metrics that better document systems outcomes as well as the interactions between conflicting parametric and retrieved knowledge.
[NLP-6] High-Order Question Generation in a Multilingual Educational Context LREC2026
【速读】： 该论文旨在解决教育实践中高阶思维问题（Higher-Order Thinking Questions, HOTQs）难以有效设计与实施的问题，尤其关注教师普遍依赖低阶问题而缺乏系统性支持的现状。现有研究虽表明大语言模型（Large Language Models, LLMs）在基于布卢姆分类法（Bloom’s Taxonomy）提示词的引导下可生成高质量高阶问题，但其应用多局限于英语语境且过度依赖单一理论框架。本研究通过引入两种替代性教学框架——主张-证据-推理（Claim-Evidence-Reasoning, CER）与发散式提问（Divergent Questioning），并在巴斯克语、西班牙语和英语三语环境中进行验证，探索多语言背景下高阶问题生成的可行性与多样性。研究发现，无论是开源还是专有大语言模型均能在三种语言中有效生成问题，但仅约一半被教师识别为真正具有高阶性质的问题。然而，关键突破在于：相较于布卢姆分类法，新框架所生成的问题在结构与概念层面展现出更高的多样性，表明其具备作为布卢姆分类法互补工具的潜力，为跨语言、多元认知层次的教学设计提供了可行的新路径。
链接: https://arxiv.org/abs/2607.13901
作者: Suna-Şeyma Uçar,Itziar Aldabe,Nora Aranberri,Orphée De Clercq
机构: 未知
类目: Computation and Language (cs.CL)
备注: This paper was accepted at the 15th edition of the Language Resources and Evaluation Conference (LREC 2026)
Abstract:Critical thinking is a fundamental skill that helps learners move beyond simple memorization. One way to develop this skill is through high-order questioning. However, crafting such questions remains a challenge for educators, and classroom practices tend to rely on low-order questions. Large Language Models have demonstrated strong capabilities in generating high-order questions, especially when guided by prompts based on Bloom’s Taxonomy. Yet, existing research has largely centered on this framework and focused only on English. This study addresses these gaps by introducing prompts grounded in two alternative frameworks: Claim-Evidence-Reasoning and Divergent Questioning within a multilingual context using Basque, Spanish, and English. Results indicate that while both an open-source and a proprietary model rather effectively generate questions in all three languages, only about half of the answerable questions are recognized by teachers as high-order. A positive finding is that the alternative frameworks produce structurally and conceptually varied questions, suggesting they could complement each other and provide viable alternatives to Bloom’s Taxonomy.
[NLP-7] SPyCE: Skill-Policy Co-evolution for Multimodal Agents
【速读】： 该论文旨在解决多模态智能体在复杂任务中因缺乏可复用的工具使用模式而导致的效率低下问题。现有强化学习方法将轨迹简化为标量奖励，迫使策略在每个新任务上从零开始探索；而基于记忆的方法虽能保留过往经验，却依赖测试时检索，无法动态更新策略以吸收可复用的知识。其核心解决方案在于提出一种技能-策略协同进化框架（SPyCE），将多步推理轨迹提炼为分层技能库，并在强化学习过程中持续更新。其中，执行技能（execution skills）捕获局部视觉操作，工作流技能（workflow skills）则编码高层次的工具调度先验。训练期间，策略通过条件化于检索到的技能来指导推理过程，同时技能库利用策略生成的高价值轨迹进行演化，形成“策略改进→技能优化→更优策略”的闭环。实验表明，SPyCE在八个基准任务上均显著优于传统强化学习与记忆基方法，且分析证实分层技能结构与协同演化机制对性能提升至关重要。这表明，联合优化技能与策略是构建高效多模态智能体的可行范式。
链接: https://arxiv.org/abs/2607.13854
作者: Ru Zhang,Weijie Qiu
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Multimodal agents that think with images iteratively manipulate visual evidence and invoke tools across many steps. Existing reinforcement learning methods reduce trajectories to scalar rewards, forcing the policy to discover reusable tool-use patterns from scratch on every new task; memory-based alternatives retain past experience, yet they rely on test-time retrieval, without updating the policy to absorb reusable patterns from that experience. Our key insight is that multimodal reasoning trajectories should be distilled into reusable skills that co-evolve with the policy during training, rather than being consumed as rewards or retrieved from a static store. To this end, we propose SPyCE (Skill-Policy Co-evolution), a framework that distills trajectories into a hierarchical skill library and updates it throughout reinforcement learning. Execution skills capture local visual operations, while workflow skills encode high-level priors that orchestrate tool use. During training, the policy model conditions on retrieved skills to guide its rollouts, while the skill library evolves using valuable rollouts generated by the policy. This creates a closed loop in which improved policies yield better skills, and the evolving skill library, in turn, provides stronger priors for policy rollouts. Experiments across eight benchmarks demonstrate that SPyCE consistently outperforms both RL-based and memory-based baselines. Further analysis reveals that both the hierarchical skill design and the co-evolution mechanism are critical to our design. These results suggest joint skill-policy optimization as a promising paradigm for building capable multimodal agents.
[NLP-8] Regularity as seen by Alice and Bob
【速读】： 该论文旨在提出一个统一的模型，以实现对不同输出域函数的正则性进行Nerode风格刻画。其核心问题在于：如何在放宽计算可实现性假设并允许非布尔输出域的前提下，建立适用于各类输出域的正则性判定框架。解决方案的关键在于引入一种基于两方协作通信的计算模型——将输入串 $ w $ 拆分为 $ w = w_1w_2 $ 并分发给Alice与Bob，二者通过交换常数个消息（消息内容为输出域元素或来自有限信号集的信号）来共同计算函数值，且必须对所有合法拆分均输出正确结果。该模型在多个具体输出域下与已有计算模型一致，并支持对缺乏Nerode型正则性刻画的其他域提出合理猜想，同时提供了充分证据支持其普适性。此外，该框架进一步扩展至名义集（nominal sets）设定下的无限字母表情形，用于研究含原子词的语言表达能力。
链接: https://arxiv.org/abs/2607.13782
作者: Omid Yaghoubi,Mikołaj Bojańczyk,Aliaume Lopez,Rafał Stefański
机构: 未知
类目: Formal Languages and Automata Theory (cs.FL); Computational Complexity (cs.CC); Computation and Language (cs.CL)
备注:
Abstract:The goal of this paper is to propose a unifying model for Nerode-style characterizations of regularity across functions with different output domains. Building on Hauser’s work in communication complexity, we generalize the setting by relaxing the computability assumptions and allowing non-Boolean output domains. We consider functions of type \Sigma^* \to \domain , where \Sigma is a finite alphabet and \domain is an arbitrary domain. For several domains, we show that the model coincides with known models of computation. We further conjecture that an analogous correspondence holds for other domains that currently lack a Nerode-style characterization of regularity, and we provide ample supporting evidence. In the model, an input string w is split as w = w_1 w_2 and distributed between two cooperating parties, Alice and Bob, who exchange a constant number of messages to compute the value of the function. Each message is either an element of the output domain or a signal drawn from a finite set of signals, and the parties must produce the correct output for every admissible split w = w_1 w_2 . We further extend the framework to infinite alphabets in the setting of nominal sets, and investigate its expressiveness on languages of words with atoms.
[NLP-9] Post-Training Shifts Confidence: A Three-Stage Analysis of How SFT RL and OPD Shape Pre- Intra- and Post-CoT Calibration
【速读】： 该论文旨在解决大语言模型在推理过程中信心（confidence）校准不准确的问题，尤其是现有后训练方法（如监督微调SFT、强化学习RL、在线策略蒸馏OPD）虽能提升最终答案准确率，但其生成的信心信号在不同推理阶段和位置上的可靠性差异未被充分理解与利用。其解决方案的关键在于提出一种三阶段信心校准框架，分别评估推理前（难度估计）、推理中（早期终止）和推理后（答案聚合）的信心表现，并发现不同方法在各阶段的信信心优势：OPD提供最优的推理前信心，SFT给出最强的在线停止信号，而RL则产生最可靠的逐步推理轨迹信号。进一步研究揭示信心可靠性具有位置依赖性——RL信心仅在路径承诺阶段后有效，而OPD信心早期可靠但后期可能反向校准。基于此，论文提出PosConf，一种位置感知的信心使用策略，仅在可信的位置区间内启用信心判断。实验表明，PosConf在RL答案聚合上较多数投票提升6.1点，在OPD早期终止任务中于紧约束下最高提升4.3点，显著避免了不可靠的后期信心影响，证明推理模型中的信心应按阶段和位置进行差异化使用。
链接: https://arxiv.org/abs/2607.13753
作者: Shuhao Li,Guodong Du,Anhao Zhao,Wanyu Lin,Tianyu Yuan,Xiaoyu Shen
机构: Eastern Institute of Technology, Ningbo; The Hong Kong Polytechnic University
类目: Computation and Language (cs.CL)
备注:
Abstract:Large language models have made strong reasoning gains through supervised fine-tuning, reinforcement learning, and on-policy distillation, yet these post-training methods are usually evaluated only by final-answer accuracy. We study how they reshape confidence during reasoning. We introduce a three-stage calibration framework that evaluates confidence before, during, and after chain-of-thought generation, corresponding to difficulty estimation, early termination, and answer aggregation. Through a controlled comparison on mathematical reasoning benchmarks, we find that OPD provides the most useful pre-reasoning confidence, SFT gives the strongest online signal for early stopping, and RL produces the most reliable trace-level signal for aggregation. We further show that confidence reliability is position-dependent: RL confidence becomes informative after a path-commitment phase, while OPD confidence is useful early but can become inversely calibrated later. Based on this observation, we propose PosConf, a position-aware confidence strategy that uses confidence only from reliable relative-position intervals. PosConf improves RL answer aggregation by 6.1 points over majority voting and consistently improves OPD early stopping under tight token budgets, with gains up to 4.3 points by avoiding its later inverse-calibration region, showing that \emphconfidence in reasoning models should be used both stage-wise and position-awarely. Our code is available at this https URL.
[NLP-10] Self-supervised Speech Comparison for L2 Phone Rhythm and Intonation Scoring
【速读】： 该论文旨在解决二语（L2）语音评估中长期存在的两大问题：一是传统评估方法主要聚焦于音位特征，对重音、语调等超音段特征的评分研究不足；二是现有评估方法通常依赖标注过的二语音频数据进行训练，难以在低资源环境下应用。其解决方案的关键在于利用动态时间规整（DTW）与自监督语音模型WavLM的表示相结合，构建一种无需文本信息的端到端评估框架，实现对英语和日语二语语音在发音准确性、节奏和语调等方面的多维度自动评估。实验表明，基于DTW与WavLM表示的简单对比方法在整体和句子级发音评分上已超越人工评分者的一致性；针对节奏特征，通过分析DTW对齐路径的形变程度，实现了接近人类水平的评估性能；而对于语调，则结合韵律残差的DTW距离与基频、音强特征，虽取得一定成效，但在部分任务上表现仍有限。研究结果表明，自监督语音表示为多方面、无文本依赖的发音评估提供了极具前景的技术基础。
链接: https://arxiv.org/abs/2607.13721
作者: Stephen McIntosh,Reuben Smit,Daisuke Saito,Nobuaki Minematsu,Herman Kamper
机构: University of Cape Town (开普敦大学); National Institute of Advanced Industrial Science and Technology (日本产业技术综合研究所)
类目: Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
备注:
Abstract:L2 speech assessment has traditionally focused on phonetic assessment, leaving the scoring of suprasegmental features such as rhythm and intonation underexplored. Moreover, assessment methods often require training with labeled L2 speech data, making them difficult to apply in low-resource settings. We investigate whether DTW over self-supervised WavLM representations can provide a text-free framework for assessing phonetic accuracy, rhythm, and intonation in English and Japanese L2 speech. Results show that a basic DTW-based approach that compares learner speech to native templates exceeds human agreement on holistic and sentence-level phonetic scoring. For rhythm, we introduce methods that measure the degree of warping in the DTW alignment path; our best method approaches human-level performance. For intonation, we combine DTW distance over prosodic residuals with pitch and intensity features, but performance remains more modest on some tasks. Our results point to self-supervised representations as a promising, text-free basis for multi-aspect pronunciation assessment.
[NLP-11] Groc-PO: Grounded Context Preference Optimization for Truthful Multimodal LLM s
【速读】： 该论文旨在解决多模态大语言模型（Multimodal Large Language Models, MLLMs）中存在的不忠实问题，如视觉幻觉、内容虚构和非忠实推理，这些问题严重削弱了模型的可靠性与实际应用价值。现有基于人类偏好对齐的方法（如直接偏好优化，Direct Preference Optimization, DPO）虽被广泛采用，但其通常仅在最终答案层面进行偏好优化，未能针对多阶段推理过程中的早期“对象定位”（Object Grounding）和“上下文定位”（Contextual Grounding）阶段提供显式的监督，导致错误在不同阶段间传播，难以有效抑制因定位漂移（grounding drift）和上下文不一致引发的累积误差。为此，论文提出一种基于定位上下文的偏好优化框架——定位上下文偏好优化（Groc-PO），其核心创新在于引入分阶段的显式偏好监督，构建了定位上下文偏好数据集（GCPD），系统性地组织了对象定位、上下文定位与定位推理三个阶段的偏好样本，以捕捉定位上下文的生成、融合与使用过程。通过在多个定位阶段施加更明确的偏好信号，Groc-PO显著增强了依赖上下文的推理能力，并有效缓解了跨阶段错误传播问题。实验结果表明，相较于标准DPO及其他先进基线方法，Groc-PO在减少幻觉、提升推理忠实性及整体可靠性方面均取得显著改进，验证了显式定位监督对于实现可信多模态推理的关键作用。
链接: https://arxiv.org/abs/2607.13712
作者: Zhixiao Zheng,Zheren Fu,Zhiyuan Yao,Chunxiao Liu,Dongming Zhang,Zhendong Mao
机构: University of Science and Technology of China(中国科学技术大学); Xiaomi Corporation(小米公司); State Key Laboratory of Communication Content Cognition, People’s Daily Online(人民日报社网络内容认知国家重点实验室)
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Multimedia (cs.MM)
备注: Accepted by ACM-MM 2026
Abstract:Despite the rapid progress of Multimodal Large Language Models (MLLMs), they still suffer from untruthfulness issues, such as visual hallucinations, content fabrication, and unfaithful reasoning, which substantially undermine their faithfulness and practical utility. Alignment methods based on human preference, such as Direct Preference Optimization (DPO), have been widely adopted to address these issues. However, multimodal reasoning errors often propagate across stages, and final-answer errors can often be traced to mistakes in early grounding stages, yet standard DPO typically applies preference optimization at the final-answer level. This credit-assignment challenge means that supervision for early grounding stages is indirect rather than stage-specific, making it difficult to suppress error propagation arising from grounding drift and context inconsistency. To address this, we propose Grounded Context Preference Optimization (Groc-PO), a grounded preference optimization framework for MLLMs. We further construct the Grounded Context Preference Dataset (GCPD), organizing multi-stage preference samples around three stages of Object Grounding, Contextual Grounding, and Grounded Reasoning, to capture the formation, integration, and utilization of grounded context. By introducing more explicit preference supervision over multiple grounded stages, Groc-PO strengthens context-dependent reasoning and mitigates cross-stage error propagation. Extensive experiments show that, compared with standard DPO and other strong baselines, Groc-PO achieves improved performance in hallucination mitigation, faithful reasoning, and overall reliability, supporting the value of more explicit grounded supervision for trustworthy multimodal reasoning.
[NLP-12] he Test Oracle Problem in Synthetic LLM -as-Judge Corpora: Disappearance Distortion and a Validation Protocol
【速读】： 该论文旨在解决大语言模型作为评判者（LLM-as-judge）系统中因生成过程缺陷导致的隐性偏差问题，其核心挑战在于：当前主流研究通过提示大模型生成幻觉答案（hallucinated answer）与真实答案配对构建合成语料库，但这一生成步骤可能因参数设置不当而发生系统性失败，进而产生虚假且难以察觉的偏差效应。解决方案的关键在于揭示并防范“测试用例不可验证性”（test oracle problem）这一根本性漏洞——即当负样本由大模型自动生成时，缺乏机械化的手段验证每个样本的真实性与完整性。文中通过一个跨语言（土耳其语/英语）忠实性判断语料库的案例发现，共享的解码预算（decoding-budget）参数在生成与评判阶段同时使用，导致生成的幻觉答案被截断至仅数词，从而引发高达32分的跨语言准确率崩溃，该效应在不同样本量（N=50至N=500）下均显著且可复现，但实为虚假结果。唯一能暴露此故障的方式是人工审阅原始生成内容，而非任何统计聚合分析。此外，另一真实存在的偏差（Markdown格式偏好）也受相同故障扭曲，其大小甚至符号随刺激长度变化，进一步凸显了聚合指标无法区分此类人为制造的伪效应。作者提出，应采用基于确定性扰动（deterministic perturbation）的语料构建方法，以天然提供“金标准-负样本”级别的逐项校验机制（item-level oracle），并设计了一套无需依赖外部黄金标准的验证协议，适用于绝大多数当前主流的多语言LLM-as-judge语料库场景。
链接: https://arxiv.org/abs/2607.13707
作者: Serkan Ballı(Department of Software Engineering, Mehmet Akif Ersoy University, Burdur, Türkiye)
机构: Mehmet Akif Ersoy University (梅赫梅特·阿基夫·埃尔索伊大学)
类目: Computation and Language (cs.CL)
备注: 23 pages, 1 figure, 3 tables
Abstract:Studies of bias in LLM-as-judge systems typically build synthetic corpora by prompting an LLM to generate a hallucinated answer to pair with a factual one, then presenting both to a judge. We report a case in which this generation step silently failed, and use it to argue that the failure mode is structural rather than incidental. In a multilingual (Turkish/English) faithfulness-judgment corpus, a decoding-budget parameter shared between judging and generation calls truncated one producer’s hallucinated answers to a few words. The resulting items produced a large, statistically robust effect: a 32-point cross-lingual collapse in one judge’s selection accuracy, replicated from N=50 to N=500, explained by a three-layer mechanistic account, and confirmed by a controlled producer-swap experiment, none of which was real. The effect vanished to ceiling once the shared parameter was corrected, and only manual reading of the raw generations, not any aggregate statistical check, exposed the fault. A second measured bias (Markdown-formatting preference) was not fabricated but distorted by the same fault, its magnitude and in one case its sign shifting with stimulus length, a mode aggregate metrics cannot distinguish from the first. We frame the underlying vulnerability using the test oracle problem: corpora whose negative examples are LLM-generated carry no mechanical way to verify item integrity, while corpora built by deterministic perturbation of a gold answer carry an item-level oracle for free. A positive control supports this claim directly: an analogous fault injected into a minimal perturbation-based corpus is caught with 100% accuracy by a zero-cost, zero-human gold-to-negative string comparison. We close with a validation protocol, derived from our own case, for analysts working in the oracle-less regime that we argue describes most contemporary multilingual LLM-as-judge corpora.
[NLP-13] Self-Evolving Agent Harnesses via Gated Semantic Quality-Diversity
【速读】： 该论文旨在解决大语言模型（LLM）在实际任务中性能提升受限于“模型外框架”（即提示词、注入知识、运行时控制与配置等）的瓶颈问题，尤其关注如何在不修改模型权重的前提下，通过自动优化框架来持续提升模型表现。其核心挑战在于：尽管可自动生成大量修改方案，但难以准确识别哪些修改真正带来了有效性能提升——因自生成反馈存在噪声，看似有效的改进可能仅为测量误差或对训练任务的过拟合。为此，论文提出一种自进化代理-框架（self-evolving agent-harness）架构，其关键创新在于将“提出修改”与“可信归因”分离：由语言模型负责诊断失败模式并生成修复补丁，而所有采样、评估与显著性检验均由确定性代码执行，确保被认可的改进在构造上具有可靠性。此外，补丁被存入一个基于（位置 × 原因）病理标签的门控类别质量多样性归档（GSME），该机制以故障根源而非具体任务为索引，形成抗过拟合的归纳偏置；通用性通过在封闭测试集上的最终评分进行衡量，且测试集仅在演化结束后开放。实验在七个领域使用冻结的开源模型验证，框架经一次训练选择并在封闭测试上评分，获得9至15.5个百分点的性能增益，且保留了86%至147%的训练阶段增益，表明其具备良好的泛化能力而非过拟合。最值得注意的是，最优补丁始终对应模型主导的病理类型，而非模型规模或家族，说明当模型变化时，病理与补丁的匹配关系仍可复现，跨模型家族具有迁移性。这表明真正可迁移的是“诊断-归因”闭环机制本身，而非任何特定的框架配置。
链接: https://arxiv.org/abs/2607.13683
作者: Xiaotian Luo,Fengxingyu Wang,Chuanrui Hu,Dizhan Xue,Yafeng Deng
机构: 1. Tsinghua University (清华大学); 2. Institute of Automation, Chinese Academy of Sciences (中国科学院自动化研究所)
类目: Computation and Language (cs.CL)
备注: 13 pages, 4 figures
Abstract:An LLM agent’s real-task performance is shaped as much by the harness around its model as by the frozen model itself: its prompts, injected knowledge, runtime control, and configuration. In deployment the harness is often the only lever available, so improving it automatically is the natural way to raise performance without touching the weights. The hard part is not generating changes but knowing which one truly helped. Self-generated feedback is noisy, and an apparent gain can be a measurement artifact or an edit that merely overfits the tasks it was tuned on. We present a self-evolving agent-harness framework that separates proposing changes from crediting them: a language model diagnoses failures and proposes patches, while all sampling, measurement, and significance testing are owned by deterministic code, so every credited improvement is trustworthy by construction. Patches populate a gated, categorical quality-diversity archive (GSME) keyed on the (WHERE x WHY) pathology an edit addresses rather than the tasks it fixes, an anti-overfitting inductive bias; generalization is measured on a sealed test scored only after evolution. Across seven domains with a frozen open-weight model, the harness is train-selected and scored once on a sealed test; its credited gains there are +9 to +15.5pp and retain 86-147% of the training gain, evidence they generalize rather than overfit. The winning patch tracks the model’s dominant pathology, not its size or family: changing the model can change the pathology and the patch, while the same pathology-to-patch match recurs across two model families. What transfers is the diagnose-and-credit loop, not any specific harness.
[NLP-14] Consensus as Privileged Context for Label-Free Self-Distillation
【速读】： 该论文旨在解决无标签场景下大语言模型推理准确率提升的难题，现有方法虽利用共识信号（consensus signal）作为训练监督，但仅以有限形式使用：如筛选用于微调的解题路径、作为答案间的偏好判断或强化学习中的标量奖励，导致大量一致解中蕴含的丰富信息被丢弃。其核心解决方案是提出CANON（Consensus-ANchored self-distillation），一种无需标注的自蒸馏训练方法，将共识转化为稠密的、逐标记级别的监督信号。具体而言，对于每个无标签提示，CANON采样多个推理路径，提取多数答案，并以达到该答案的解题路径为条件，冻结一个模型快照作为“共识锚定教师”（consensus-anchored teacher），进而监督原模型在自身生成过程中的每一步输出。实验表明，CANON在数学与科学推理基准上可将pass@1指标提升最高达12个百分点，相较无标签强化学习方法性能高出6个百分点，且仅需其七分之一的计算开销，并接近基于真实答案（gold solutions）训练的教师模型表现；在聚合未标注数据上训练后，该方法具备良好的跨任务迁移能力，性能可媲美使用真实标签的训练方法。分析进一步揭示，性能提升并非单纯由分布锐化引起——训练后，模型能解决此前32次尝试均未成功的问题，且其多数投票结果本身也更为准确。
链接: https://arxiv.org/abs/2607.13643
作者: John Gkountouras,Josip Jukić,Ivan Titov
机构: University of Amsterdam (阿姆斯特丹大学); University of Edinburgh (爱丁堡大学)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Sampling multiple solutions and returning the majority answer is among the most reliable ways to improve the reasoning accuracy of large language models without labels, and a growing family of methods converts this consensus signal into training supervision. However, existing approaches use consensus only in restricted forms: as a filter that selects solutions for fine-tuning, as a preference between answers, or as a scalar reward for reinforcement learning, discarding most of the information that the agreeing solutions contain. We present CANON (Consensus-ANchored self-distillatiON), a label-free training method that turns consensus into dense, token-level supervision. For each unlabeled prompt, CANON samples multiple solutions, extracts the majority answer, and conditions a frozen snapshot of the model on a solution that reaches it; this consensus-anchored teacher then supervises the model on its own rollouts at every token. Experiments on mathematical and scientific reasoning benchmarks show that CANON improves pass@1 by up to 12 points, outperforming label-free reinforcement learning by 6 points at a seventh of its compute and approaching a teacher conditioned on gold solutions; trained on pooled unlabeled data, it transfers to held-out benchmarks, matching training methods that use gold labels. Analysis suggests that the improvements are not pure distribution sharpening: after training, the model solves problems it previously never solved in 32 attempts, and its majority vote itself becomes more accurate.
[NLP-15] Analogical Deep Research: Retrieving and Integrating Historical Analogies for Foresight Analysis
【速读】： 该论文旨在解决大语言模型（LLM）代理在进行前瞻性分析时，难以有效识别并利用历史类比（historical analogies）的问题。其核心挑战在于，现有LLM代理倾向于基于表面特征进行类比匹配，而缺乏对事件背后深层机制的理解，从而导致类比质量低下。解决方案的关键在于提出一种基于因果推理的新型代理框架——因果类比研究者（Causal Analogical Researcher, CANA），该框架遵循两个核心原则：机制对齐（mechanism alignment）与跨类比验证（cross-analogy confirmation）。CANA通过引入结构化分解表示和结构反馈机制，实现对历史类比识别与整合过程的反思性优化。实验结果表明，CANA在历史类比生成任务上提升达10%，并在首个专门针对类比深度研究（Analogical Deep Research, ADR）的基准测试ADR-bench中超越当前最先进深度研究代理，验证了其在真实事件分析中的有效性。
链接: https://arxiv.org/abs/2607.13602
作者: Yongqiang Chen,Guangyi Chen,Yuewen Sun,Kun Zhang
机构: Mohamed bin Zayed University of Artificial Intelligence (穆罕默德·本·扎耶德人工智能大学); Carnegie Mellon University (卡内基梅隆大学)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG); Machine Learning (stat.ML)
备注: Ongoing project
Abstract:Systematic comparisons between current situations and structurally similar past events in the historical, i.e., historical analogies, is among the most powerful tools for foresight analysis. In this work, we present a new task called Analogical Deep Research (ADR) to Large Language Model (LLM) agents and construct the first ADR benchmark ADR-bench to study whether LLM agents are able to find and leverage historical analogies when doing foresight analysis. Our investigation reveals a key obstacle: LLM agents are poor at finding analogies because they match on surface features rather than underlying mechanisms. We argue that ADR is inherently a causal question as it requires understanding why the event occurred. Based on our theoretical analysis, we propose two principles required for ADR, including the mechanism alignment and cross-analogy confirmation. Built upon our theoretical results, we propose a new agentic framework called Causal Analogical Researcher (CANA) that guides LLMs to find and integrate historical analogies. CANA incorporates a simple yet effective structural decomposition representation, and integrates structural feedback for reflective improvements of historical analogy identification and integration. We show that CANA brings up to 10% improvements in historical analogy generation, and surpasses the state-of-the-art deep research agents in the ADR-bench. Case studies with the ongoing events confirm the effectiveness of CANA in leveraging historical analogies.
[NLP-16] Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents
【速读】： 该论文旨在解决当前大型语言模型（LLM）智能体在使用外部记忆系统时存在的核心瓶颈：现有方法普遍依赖固定、人工设计的启发式规则来访问记忆，而这种静态记忆访问机制无法适应不同任务阶段和上下文环境下的动态需求。具体而言，任务初期因记忆稀疏应减少检索，重复目标类型需依赖计划复用而非通用最近邻查找，陷入困境的智能体则需要通过替代查询重新检索，长期任务流中还需对记忆存储进行整合与清理以维持有效性。为应对这一问题，论文提出“记忆作为可控过程”（MemCon）框架，其关键在于将记忆操作建模为马尔可夫决策过程（Markov Decision Process），并学习一个在线策略，以自适应地决定何时、何内容以及多大程度进行检索，何时注入提炼后的计划，以及何时进行记忆整合或遗忘。该框架具备后端无关性，可无缝集成任意现有记忆实现，仅通过任务级二元反馈进行训练，无需预训练或额外大模型调用，并采用轻量级基于上下文的带探索性的表格式赌博机（UCB exploration），在数十个任务内即可收敛。在6个基准测试、3种智能体框架及3种大模型底座上，MemCon均显著优于多个记忆基线，任务成功率最高提升15.2点，同时降低5%–20%的令牌消耗。
链接: https://arxiv.org/abs/2607.13591
作者: Eric Hanchen Jiang,Zhi Zhang,Yuchen Wu,Levina Li,Dong Liu,Xiao Liang,Rui Sun,Yubei Li,Edward Sun,Haozheng Luo,Zhaolu Kang,Aylin Caliskan,Kai-Wei Chang,Ying Nian Wu
机构: University of California Los Angeles (加州大学洛杉矶分校); University of Washington (华盛顿大学); Northwestern University (西北大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks. Yet nearly all existing approaches, from graph-structured memories to reflective insight stores, access memory through fixed, hand-designed heuristics. We argue that this static view of memory is a core bottleneck for agentic learning because optimal memory behavior is fundamentally context-dependent. The early stages of the tasks, benefit from minimal retrieval because memory is sparse; recurring goal types benefit from plan reuse rather than generic nearest-neighbor lookup; stuck agents benefit from re-retrieval with alternative queries; and across long task streams, the memory store itself must be consolidated and pruned to remain useful. We present Memory as a Controlled Process (MemCon), a framework that models memory operations as a Markov Decision Process and learns an online policy that adaptively decides when, what, and how much to retrieve, when to inject a distilled plan, and when to consolidate or forget. MemCon is backend-agnostic: it wraps any existing memory implementation, learns from task-by-task binary feedback with no pretraining and no additional LLM calls, and uses a lightweight tabular contextual bandit with UCB exploration that converges within tens of tasks. Across 6 benchmarks, 3 agent frameworks, and 3 LLM backbones, MemCon consistently outperforms multiple memory baselines by up to 15.2 points in task success while reducing token consumption by 5–20%.
[NLP-17] Graded Entity-Familiarity Readouts in Language Models: Polish Adaptation Cross-Language Robustness and Refusal Steering
【速读】： 该论文旨在解决生成式 AI（Generative AI）在生成回答前能否准确估计其对特定实体的熟悉程度这一问题。核心挑战在于如何实现模型在生成答案前对自身知识状态进行量化评估，从而支持更可靠的拒绝回答机制（abstention）。其解决方案的关键在于：通过分析指令微调模型在提示末尾标记处的激活模式，构建一个可校准的“熟悉度探测器”（familiarity-probe），该探测器能够有效区分真实与虚构实体，并在波兰语适应的模型中表现出与实体流行度高度相关的分级读出能力（模型平均斯皮尔曼相关系数ρ为0.28–0.57），且该能力主要源于语言适配而非参数规模。此外，研究发现该探测器在跨语言提示（波兰语提问换为英语）下仍保持高鲁棒性（AUROC损失仅1%–4%），并在Gemma-4-12B中通过在单一层添加一维熟悉度方向，实现了拒绝率的单调可控调节（从0.24升至1.00，或从0.73降至0.00），表明熟悉度表征与最终决策策略之间存在可分离的独立维度。因此，该研究证实了生成前熟悉度读出的可行性，并揭示了表示层面熟悉度与行为层面拒答策略之间的解耦关系。
链接: https://arxiv.org/abs/2607.13568
作者: Grzegorz Brzezinka
机构: Prosit AS
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 16 pages, 8 figures, 5 tables. Code and data: this https URL
Abstract:Can a language model estimate its familiarity with an entity before generating an answer? We study activations at the final prompt token in twelve instruction-tuned models from the Bielik, PLLuM, Gemma-4, and Qwen3 families, using a new dataset of 1,440 Polish entities spanning four domains and ten Wikipedia-pageview deciles, plus fabricated controls. Familiarity-probe scores separate real from fabricated entities in every family; in the Polish-adapted Bielik and PLLuM families they additionally track entity popularity (model-mean Spearman \rho 0.28-0.57, versus at most 0.11 in Gemma-4 and Qwen3), a pattern more strongly associated with Polish adaptation than with parameter count in this model sample. In a paired experiment on two families, probes retain 96-101% of within-language AUROC when the Polish question stem is replaced with an English one around unchanged entity names, showing robustness to prompt language in this setting. In Gemma-4-12B, the only model that natively refuses, adding a one-dimensional familiarity direction at a single layer moves refusal rates monotonically in both directions (0.24 to 1.00 on well-known entities; 0.73 to 0.00 on unknown ones). Finally, a calibrated familiarity probe is competitive among pre-generation abstention gates, although post-generation detectors better predict behavioral error on average. These results support a graded pre-generation entity-familiarity readout, and a separation between representational familiarity and the policy that converts it into abstention.
[NLP-18] UTS at ELOQUENT 2026 Voight-Kampff: structural shifts in AI writing bypass state-of-the-art detectors
【速读】： 该论文旨在解决在经过对抗性微调（adversarial fine-tuning）强化后的语言模型检测器中，仍存在可被规避的漏洞问题。其核心挑战在于：尽管对抗性微调能够有效防御2025年主流的逃逸攻击（evasion attacks），但现有方法无法全面抵御新型攻击策略。解决方案的关键在于发现并利用检测器在分布外（out-of-distribution, OOD）样本上的固有脆弱性——即检测器对“偏离训练数据分布”的文本具有更强的防御盲区。研究揭示了一个根本性的不对称现象：将生成文本推向检测器训练分布内部（如模仿人类写作）几乎完全失效，而将其主动推离训练分布（如采用跨时代语义结构或现代主义意识流形式）则能可靠绕过检测。基于此，作者提出两种新型分布外攻击范式——跨世纪注册攻击（cross-decade register attacks）与现代主义意识流形式（modernist stream-of-consciousness form），不仅显著提升欺骗率（达到前代方法约50倍），且保持内容自然性。实验进一步验证，常规反制手段（如在训练数据中加入特定历史时期的文本）亦无效。研究结论表明，当前包括对抗性微调在内的多种检测器家族，在面对结构性分布外扰动时仍存在持续性漏洞，这一机制正是其在ELOQUENT 2026 Voight-Kampff竞赛中取得领先表现的核心原因。
链接: https://arxiv.org/abs/2607.13565
作者: Dima Galat,Marian-Andrei Rizoiu
机构: University of Technology Sydney (悉尼科技大学)
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: CLEF2026, ELOQUENT2026
Abstract:We investigate which language model evasion attacks survive state-of-the-art adversarial fine-tuning, developing strategies that sweep the top 5 positions on the ELOQUENT 2026 Voight-Kampff leaderboard. While adversarial fine-tuning trivially closes the 2025 winning evasion recipes, we uncover a fundamental asymmetry in detector vulnerability: pushing generated text out of the detector’s training distribution reliably defeats adversarial detection, whereas pulling it into the distribution (e.g., mimicking human training data) fails completely. Exploiting this, we introduce two novel out-of-distribution attack families - cross-decade register attacks and modernist stream-of-consciousness form. Both strategies easily bypass adversarial closure, achieving up to approximately 50x higher fool rates than previous methods while preserving naturalness. Furthermore, experiments show that the obvious deployer countermeasure (augmenting training data with period prose) fails to close the vulnerability. Our findings show that the tested detector families, including adversarially fine-tuned ones, exhibit persistent vulnerabilities under structural out-of-distribution shifts, a mechanism that directly powers our leading competition performance.
[NLP-19] Cost-Prag matic Quality Gating and Selection-Fusion Multi-Model Combiners for BioASQ Phases A and B
【速读】： 该论文旨在解决生物医学问答系统中两个核心挑战：一是当第一阶段检索效果较弱时，如何权衡重新检索的激进程度以优化整体性能与计算成本之间的平衡；二是如何有效融合多个语言模型生成的答案以提升最终结果的准确性和召回率。其解决方案的关键在于设计了一种双轨并行的检索架构——包含混合式第一阶段检索（结合密集向量模型BGE、BM25及RRF加权策略，在BioASQ-13b历史数据集上达到R@200=99.3%的高召回率）以及由智能体驱动的多源分解检索管道（覆盖PubMed、Europe PMC和iCite），并通过BGE交叉编码器作为质量门控机制，仅对证据支持不足的问题进行选择性重检索。该策略在Task 12B 2024验证集上实现了比严格基准更低12%的重检索成本，同时显著提升了列表F1和列表精确率。在答案融合方面，研究提出将多模型集成收益解构为“选择”与“融合”两部分，揭示出大语言模型（LLM）作为裁判在选择类指标（如是/否判断、多参考ROUGE）上占优，但在融合友好型指标（如事实型排名-1、列表召回率）的召回分量上存在结构性缺陷。实验进一步表明，基于同义词合并的解析器在所有维度上均提升列表召回率，而GPT-5.5单模型虽因更窄的候选集保持了列表F1领先，但牺牲了精度。在Task 14B 2026预发布排行榜中，该系统在八项子任务中的三项取得综合精确度第一，并赢得四个具体问题类型单元的榜首，且在Phase B b3理想评估中位列第一，充分验证了其在检索与答案融合协同优化上的有效性。
链接: https://arxiv.org/abs/2607.13551
作者: Dima Galat,Marian-Andrei Rizoiu
机构: University of Technology Sydney (悉尼科技大学)
类目: Computation and Language (cs.CL)
备注: CLEF2026, BioASQ2026
Abstract:We describe our BioASQ Task 14B 2026 system. The work centers on two design decisions: how aggressively to re-retrieve when first-stage retrieval is weak, and how to combine multiple language-model answers. Retrieval unions two parallel pipelines - a hybrid first stage (dense BGE + BM25 + RRF, reaching R@200 = 99.3% on the BioASQ-13b historical archive) and an agent-driven pipeline that decomposes the question over PubMed, Europe PMC, and iCite - with a BGE cross-encoder quality gate flagging weakly-supported questions for selective re-retrieval. On Task 12B 2024 validation, a cost-pragmatic re-retrieval policy beats a skill-strict baseline significantly on list F1 and list precision, at 12% lower re-retrieval cost. Holding prompt and model fixed across val and test 13B (different question sets), list F1 rises by +0.132 absolute on the BioASQ-released gold-input pool, consistent with substantial retrieval-side headroom. For Phase B answering we decompose multi-model ensemble lift into a selection component bounded by the per-question oracle and a fusion component that aggregators can exceed. The decomposition predicts before any experiment that LLM-as-judge wins on selection-dominated metrics (yes/no, multi-reference ROUGE) but is structurally insufficient on the recall component of fusion-friendly metrics (factoid rank-1, list recall). On Task 13B 2025 our synonym-union resolver wins list recall on every head, while GPT-5.5 solo retains the list-F1 lead because the resolver’s wider item set costs precision. On the Task 14B 2026 preliminary leaderboard our team places first on the combined-exact aggregate on three of the eight (phase x batch) leaderboards, wins four individual question-type cells, and takes #1 on Phase B b3 ideal.
[NLP-20] Auditing Protocol-Level Shortcuts in Large Audio Language Model Judges for Speech Evaluation
【速读】： 该论文旨在解决大型音频-语言模型（Large Audio-Language Models, LALMs）在语音评估中作为自动评判者时存在的“评价偏差”问题，即模型的判断结果虽与人类评分高度一致，但其决策可能并未真正基于对音频内容的听觉理解，而是依赖于评估协议中提供的辅助信息（如专家标签、参考数据或结构化描述），从而形成“协议级捷径”（protocol-level shortcuts）。其解决方案的关键在于：提出应将模型与评估协议联合评估，通过设计匹配的“捷径探测器”（shortcut probe）来检测模型是否绕过实际音频输入而依赖外部信息进行判断。研究在三种典型部署协议（特征蓝图评判、参考条件评判、成对A/B比较）下对六种LALMs和四个评估维度进行审计，发现多个模型存在严重依赖捷径的现象，例如在特征蓝图评判中，错误的专家标签可使情感判断准确率降至0.10以下，而在拼接式A/B比较中，Qwen3-Omni-Thinking常无视顺序变化而固定选择同一选项。这一结果表明，仅依赖聚合一致性指标会高估模型的有效性，必须针对每一对模型-协议组合实施专门的捷径探测以确保评估的可靠性。
链接: https://arxiv.org/abs/2607.13477
作者: Joonyong Park,David M. Chan,Yuki Saito,Hiroshi Saruwatari
机构: University of Tokyo (东京大学); National Institute of Information and Communications Technology (国家信息与通信技术研究所)
类目: ound (cs.SD); Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
备注:
Abstract:Large audio-language models (LALMs) are increasingly used as automatic judges for speech evaluation. However, high agreement with human ratings does not guarantee that their verdicts are grounded in the audio. A judge may instead rely on specialist labels or reference data supplied by the evaluation protocol itself, taking a shortcut in place of listening to the audio. In this paper, we audit such protocol-level ``shortcuts’’ in LALM judges across three common deployment protocols: feature-blueprint judging, where the audio is replaced by a structured text description of acoustic features, reference-conditioned judging, and pairwise A/B comparison. Across six judges and four attributes, we find that several LALMs rely on protocol-level shortcuts. For example, in feature-blueprint judging, incorrect specialist labels reduce five judges’ emotion accuracy to 0.10 or below, and in concatenated A/B comparisons, Qwen3-Omni-Thinking often picks the same slot regardless of order swaps. These results indicate that aggregate agreement can overstate the validity of LALM judges unless the model and the evaluation protocol are assessed jointly, and that each model-protocol pair should be evaluated with a matched shortcut probe.
[NLP-21] MyAG: A Graph-Based Framework for Designing and Analyzing Composable LLM Agent Systems
【速读】： 该论文旨在解决大语言模型（Large Language Model, LLM）智能体系统在设计与分析过程中面临的复杂性与可组合性不足的问题。现有方法往往将组件、执行流程与运行时行为耦合，导致系统难以灵活重构与性能优化。为此，本文提出MyAG框架，其核心创新在于构建一种基于图的分层抽象架构，将智能体系统的构建解耦为三个独立的图结构：组件图（用于表示智能体、环境及模块）、工作流图（用于控制执行流程）以及搜索图（用于运行时执行路径规划）。这种分离机制使得同一组件可被不同策略复用，显著提升系统的灵活性与可扩展性。此外，框架通过递归系统节点支持层次化组合，并集成监控与可视化工具以辅助分析执行过程中的性能-效率权衡。实验结果表明，MyAG能够有效支持灵活的设计模式并促进对系统行为的深入分析，且已开源发布，具备良好的可复现性与实用性。
链接: https://arxiv.org/abs/2607.13474
作者: Zhisong Zhang
机构: City University of Hong Kong (香港城市大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:We present MyAG, a graph-based framework for designing and analyzing composable LLM agent systems. Our framework separates agent system construction into three graph abstractions: a component graph for agents, environments, and modules; a workflow graph for execution control; and a search graph for runtime execution. This separation allows users to flexibly reuse the same components with different strategies. We further support hierarchical composition through recursive system nodes and provide monitoring and visualization tools for inspecting agent execution. Experiments on representative agent applications show that our framework supports flexible agent system design and helps analyze performance-efficiency tradeoffs. Our framework is publicly available and fully open-source.
[NLP-22] Live Gurbani Tracking: A Benchmark and Reference System for Captioning Sikh Kirtan
【速读】： 该论文旨在解决锡克教卡坦（Sikh Kirtan）实时字幕生成中的核心挑战，即在保证宗教准确性的前提下实现精确的歌词同步显示。由于卡坦是《古鲁·格兰特·萨希卜》（SGGS）经文的连续吟诵，其字幕必须严格匹配正统文本中的每一个词句，任何拼写错误或偏离原典的表达均被视为宗教不敬，因此该任务本质上是一个封闭词汇（closed-vocabulary）问题，而非开放词汇的歌词转录。解决方案的关键在于构建一个形式化的任务框架：在每个时间点 $ t $ 预测一个（沙巴德标识符，行索引）对或为空，同时将问题空间划分为四个维度组合——实时/离线（因果/全音频访问）与盲猜/神谕（未知/已知沙巴德身份）。研究团队发布了首个版本的基准数据集（v1），包含4段人工标注的卡坦录音、3种冷启动偏移条件，共12个评估案例，总计约57分钟可评分音频，并配套开发了基于1秒帧精度、允许1秒容差且对片段边界间隙容忍的评分器。参考系统采用微调后的120M IndicConformer模型结合模糊匹配器与状态机，以INT8 ONNX格式部署，在单个苹果硅芯片上实现约0.05的实时因子（RTF），在最困难的“实时+盲猜”变体上达到57.9%的整体帧准确率（10/12次成功锁定正确沙巴德），并强调传统自动语音识别（ASR）指标（如WER/CER）衡量的是转录准确性，而非本任务所需的显示准确性。该基准、参考系统及实时部署方案均已开源，以推动后续研究进展。
链接: https://arxiv.org/abs/2607.13457
作者: Karanbir Singh
机构: 未知
类目: Computation and Language (cs.CL)
备注: 11 pages, 3 figures, 6 tables. Benchmark, scorer, and reference system released. Live deployment and on-device iOS app available; see paper for links
Abstract:We present a benchmark and reference system for live captioning of Sikh Kirtan - the continuous, sung recitation of verses from the Sri Guru Granth Sahib Ji (SGGS). Unlike open-vocabulary lyrics transcription, Kirtan captioning is a closed-vocabulary problem: every displayed line must be an exact, word-for-word line from the canonical scripture, because displaying misspelled Gurmukhi is considered religiously inappropriate. We formalize the task as predicting, at every time t, a pair (shabad_id, line_idx) or null, and organize the problem space into a 2x2 matrix along two orthogonal axes: live vs. offline (causal vs. full-audio access) and blind vs. oracle (shabad identity discovered vs. given). We release v1 of the benchmark - 4 hand-annotated Kirtan recordings x 3 cold-start offsets = 12 evaluation cases, ~57 minutes of scored audio - together with a scorer that computes frame accuracy at 1s resolution over a scored region, with a 1s collar and gap-tolerant scoring at segment boundaries. We describe a reference system (fine-tuned 120M IndicConformer - fuzzy matcher - state machine; INT8 ONNX; RTF ~0.05 on one Apple Silicon core) that achieves 57.9% overall frame accuracy across all 12 cases (10/12 correct shabad locks) on the hardest variant (live x blind). We compare against three trivial baselines (empty, shifted-5s, perfect) and discuss why standard ASR metrics (WER/CER) measure transcription accuracy rather than the display accuracy this task requires. The benchmark, reference system, and a live deployment are released under permissive licenses to facilitate further improvements.
[NLP-23] When Rubrics Change: Cross-Rubric Generalization for Critical Thinking Essay Scoring KDD2026
【速读】： 该论文旨在解决自动化作文评分（AES）中跨评分标准（cross-rubric generalization）的泛化问题，即模型在训练时使用某一组评分标准（rubric），而在测试时需对未见过的新评分标准下的作文进行准确评分，而这些新标准通常关注作文的不同维度。传统研究多聚焦于跨提示（cross-prompt）泛化，但实际教学场景中评分标准常被更新或引入，因此跨评分标准泛化更具现实意义。其解决方案的关键在于采用基于大型语言模型（LLM）的微调框架，包含两个核心组件：一是不依赖具体评分标准的中间表征——“特质”（traits），用于捕捉学生写作中的通用能力特征；二是利用已知评分标准下目标作文的监督信号进行可控训练。实验结果表明，在最困难的设置下（即目标评分标准和目标作文均未在训练中出现），引入特质可使宏平均F1提升5.0%；同时增加目标作文的监督程度能进一步提升性能，最优的开源Llama基模型在宏平均F1上优于GPT-5-mini提示方法2.1%，仅落后于GPT-5模型1.9%。这表明，基于特质的中间结构与受控监督机制显著增强了模型对未见评分标准的泛化能力。
链接: https://arxiv.org/abs/2607.13433
作者: Nischal Ashok Kumar,Payu Wittawatolarn,Sana Kang,Marisa C. Peczuh,Blair Lehman,Ryan Baker,Caitlin Mills,Sherry Lachman,Ruochen Sun,Andrew Lan
机构: University of Massachusetts Amherst (马萨诸塞大学阿默斯特分校); University of Minnesota (明尼苏达大学); Brighter Research (明亮研究); Adelaide University (阿德莱德大学); Advanced Education Research and Development Fund (先进教育研究与发展基金); Independent Researcher (独立研究员)
类目: Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: Published in AI for Education Day at SIGKDD 2026
Abstract:Automated essay scoring (AES) research has largely focused on cross-prompt generalization, where essays from unseen prompts are scored while the scoring criteria are typically held constant. In practice, however, educators may revise or even introduce new rubrics in their scoring task, to evaluate different aspects of essays. We study cross-rubric generalization: training on essays labeled under one set of rubrics and evaluating on previously unseen rubrics, which target different aspects of the essay. We use a Large Language Model (LLM) fine-tuning framework with two components: rubric-agnostic intermediate representations, called traits, and target-essay supervision under seen rubrics during training. On an AES dataset augmented with multiple rubric-defined labels of student critical thinking skills, we find that traits improve macro F1 by 5.0% over a baseline without traits in the hardest setting, where both target rubrics and target essays are unseen during training. We further find that increasing target-essay supervision improves performance, with our best fine-tuned open-source Llama-based model outperforming GPT-5-mini prompting by 2.1% macro F1 and trailing GPT-5 by 1.9%. These results show that trait-based intermediate structure and controlled supervision improve generalization to unseen rubrics.
[NLP-24] Discrete Diffusion Models: A Unified Framework from Tokenization to Generation
【速读】： 该论文旨在解决离散数据生成中传统自回归（Autoregressive, AR）建模方法在生成效率和全局优化能力上的局限性，特别是其串行生成机制导致的计算瓶颈。为此，论文提出了一种统一的概念框架，将离散去噪扩散模型（Discrete Denoising Diffusion Models, DDMs）的核心问题归结为离散状态空间的构建方式，包括分词方案、词汇拓扑结构以及领域特定的结构字母表设计。该框架的关键在于揭示了现有多种DDM实现——如基于转移矩阵、掩码/吸收态及评分/比率的方法——均属于同一设计空间的不同实例，从而系统性地阐明了训练目标、推理算法、扩展行为、系统优化与评估协议之间的共性权衡关系，并指明了未来研究的若干重要方向。
链接: https://arxiv.org/abs/2607.13431
作者: Ye Yuan,Weien Li,Rui Song,Zeyu Li,Haochen Liu,Xiangyu Kong,Zixuan Dong,Linfeng Du,Zipeng Sun,Weixu Zhang,Jiaxin Huang,Changjiang Han,Yonghan Yang,Zichen Zhao,Xiuyuan Hu,Haolun Wu,Yankai Chen,Fengran Mo,Jikun Kang,Bowei He,Philip S. Yu,Xue Liu
机构: McGill University; Mila - Quebec AI Institute; University of Cambridge; University of Toronto; MBZUAI - Mohamed bin Zayed University of Artificial Intelligence; Tsinghua University; Rochester Institute of Technology; Salesforce; University of Illinois Chicago
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Discrete denoising diffusion models (DDMs) have recently emerged as a compelling alternative to autoregressive (AR) modeling for discrete data, offering parallel generation and iterative global refinement capabilities. Unlike continuous diffusion, where the state space is fixed, DDMs are fundamentally shaped by how the discrete state space is constructed: the tokenization scheme, the vocabulary topology, and domain-specific structural alphabets. This work introduces a unified conceptual framework that views discrete diffusion models through the construction of the underlying discrete state space. Within this framework, existing formulations, including transition-matrix, masking/absorbing-state, and score/ratio-based approaches, emerge as different instantiations of a common design space. The framework further exposes common design trade-offs across training objectives, inference algorithms, scaling behavior, systems optimization, and evaluation protocols, suggesting several promising directions for future research.
[NLP-25] Exploring Post-Training Alignment of Small Language Models for Biomedical Data-to-Text Generation: A Case Study of Medication Leaflet
【速读】： 该论文旨在解决将复杂的生物医学数据转化为患者友好的叙事文本这一关键挑战，这是现代生物医学信息学的核心任务之一。其解决方案的关键在于通过多种对齐方法（包括监督微调（SFT）、直接偏好优化（DPO）、几率比偏好优化（ORPO）及组相对策略优化（GRPO））对基于Qwen的小型语言模型（SLMs）进行训练，以提升其在药品说明书文本生成任务中的表现。研究特别强调了模型在跨数据集泛化能力上的表现，通过构建来自openFDA的药物标签数据集进行评估，并综合采用ROUGE等词法重叠指标与语义相似性度量进行多维度验证。结果表明，经过对齐的SLMs不仅优于如GPT-5等专有模型，且在不同对齐方法中，GRPO展现出最强的跨数据集鲁棒性，显著优于其他方法及基线模型。
链接: https://arxiv.org/abs/2607.13430
作者: Xi Yang,Guodong Liu,Chuqin Li,Fan Wu,Ergin Soysal,Min Jiang,Xing He,Jiang Bian,Yi Guo,Shams Zaman,Thomas Fuchs,Todd Sanger,Yonghui Wu
机构: 未知
类目: Computation and Language (cs.CL)
备注: 10 pages, 1 figures
Abstract:Translating complex biomedical data into patient-friendly narratives is central to modern biomedical informatics. This study presents a comparative analysis of training small language models (SLMs) in specialized biomedical datato-text generation tasks. We explore widely adopted post-training methods including supervised fine-tuning (SFT), direct preference optimization (DPO), odds ratio preference optimization (ORPO), and group relative policy optimization (GRPO) with Qwen-based SLMs on a medicine package leaflets dataset. To assess cross-dataset generalizability, we also curated drug label data from openFDA. We evaluate models using both standard lexical overlap metrics like ROUGE as well as semantic similarity measures. Across our experiments, the results show that (1) the aligned SLMs outperform proprietary models like GPT-5; (2) ORPO outperforms the SFTbaselines; (3) GRPO yields the most robust cross-dataset performance among the alignment methods tested as well as GPT-5.
[NLP-26] Data-Efficient Adaptation of LLM s via Attention Head Reweighting
【速读】： 该论文旨在解决在安全等标签数据稀缺领域中，大语言模型（Large Language Models, LLMs）在少量样本下进行高效学习的难题。现有参数高效微调方法虽有一定成效，但在面对困难任务时仍表现不足。为此，论文提出注意力头重加权（Attention Head Reweighting, AHR）方法，其核心在于仅通过为每个注意力头学习一个标量参数来实现模型适应，从而极大降低需训练参数量。该方案的关键创新在于利用了注意力头的功能专一性，仅调整极少数参数（约模型总参数的0.0001%），却在少样本场景下显著优于如LoRA等标准基线方法，同时具备良好的可解释性，有助于深入理解大模型中上下文学习能力的注意力机制来源。
链接: https://arxiv.org/abs/2607.13425
作者: Tuomas Oikarinen,Zixiao Chen,Charlotte Siska,Tsui-Wei Weng,Chandan Singh,Jianfeng Gao
机构: 未知
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: Published in COLM 2026
Abstract:Learning effectively from limited data is critical in domains like security where labeled examples are scarce. Large language models (LLMs) have demonstrated some capabilities for data-efficient learning, especially through parameter-efficient adaptation methods, but continue to struggle when faced with few samples for difficult tasks. To meet this challenge, we propose Attention Head Reweighting (AHR), a data-efficient method that adapts LLMs to new text-classification tasks by learning only a single scalar per attention head. This drastically reduces the number of parameters that need to be learned by making use of the functional specialization of individual attention heads. Experiments on diverse open-source text classification datasets show that AHR can outperform standard baselines like LoRA when learning from limited samples, despite having 200-1000x fewer trainable parameters, as our AHR only modifies ~0.0001% of the model’s parameters. In addition, our learned weights are easy to interpret and can be analyzed to better understand the mechanisms and attention heads responsible for in-context learning abilities in LLMs.
[NLP-27] Demystifying On-Policy Distillation: Roles Pathologies and Regulations
【速读】： 该论文旨在解决生成式大模型（Large Language Model, LLM）后训练中在线策略蒸馏（On-Policy Distillation, OPD）的训练动态不明确问题，尤其关注其在引导学生模型探索正确推理路径时所面临的机制缺陷与优化挑战。核心问题是：尽管OPD通过密集的逐标记级指导促进探索，但其有效性高度依赖于引导信号的质量，而低质量信号会引发两类关键病理——“学生-教师分布偏差”（Student-Teacher Mismatch）和“长度滥用”（Length Exploitation），前者导致引导方向偏离任务正确性，后者则诱使学生通过截断或冗余填充等长度捷径“作弊”，而非学习真实推理策略。解决方案的关键在于引入轻量级信号调控机制——优势裁剪（advantage clipping）与对数尺度压缩（log-scale compression），以确保引导信号忠实反映任务目标，从而抑制上述病理现象。实验在七个基准测试上的结果表明，这些调控手段显著缓解了长度依赖性陷阱，实现了稳定且高效的蒸馏性能，超越多种OPD变体与强化学习基线，验证了高质量信号调控是决定OPD成功探索的核心因素，而非单纯依赖教师模型规模。
链接: https://arxiv.org/abs/2607.13399
作者: Rui Wang,Hongru Wang,Yi Chen,Boyang Xue,Tianqing Fang,Wenhao Yu,Kam-Fai Wong
机构: The Chinese University of Hong Kong; Tencent AI Lab
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:On-policy distillation (OPD) has become a key paradigm in LLM post-training, yet its training dynamics remain poorly understood. We present a systematic study examining the role, pathologies, and regulations of OPD. We first clarify the role of OPD as an exploration catalyst: it steers the student toward correct reasoning paths via dense token-level guidance, without expanding capability ceiling. We confirm this by showing that prompt diversity matters more than per-problem sampling numbers, and critically, that the effectiveness of OPD hinges entirely on the quality of its guiding signal. This dependency exposes two pathologies that derail exploration. The Student-Teacher Mismatch occurs when a large teacher-student distributional gap causes the guiding signal to misalign with task correctness, steering exploration in counterproductive directions. Length Exploitation arises when the aggregated token-level objective creates length-dependent shortcuts, allowing the student to game the reward landscape through response truncation or redundant padding, exploring degenerate length modes rather than reasoning strategies. To tame these pathologies, we investigate lightweight signal regulations: advantage clipping and log-scale compression, ensuring exploration is guided by faithful signals. Experiments across seven benchmarks demonstrate that these regulations alleviate length exploitation and enable effective distillation, stably surpassing OPD variants and RLVR baselines, thereby confirming that well-regulated signal quality, rather than mere teacher scale, governs successful exploration in OPD.
[NLP-28] Set-shifting Behavioral Test for Harnessed Agents
【速读】： 该论文旨在解决大语言模型（LLM）代理在持续会话中，当可靠工具的隐性可靠性发生改变时，其工具选择行为如何适应的问题。核心挑战在于：在工具集存在冗余（即多个工具可完成相同任务但可靠性隐性变化）的场景下，代理能否动态调整工具使用策略以维持性能。其解决方案的关键在于引入认知心理学中的“集合转换”（set-shifting）范式，构建了一个带有分支调度（branched schedule）的评估框架，通过在隐藏边界处切换可靠工具组，并设置无转移对照组，量化代理在可靠性变化后重新分配工具调用的能力。研究发现，大多数代理在边界后迅速固化为少数重复性调用模式，且工具调用分布呈现离散集中特征；通过计算每个轨迹在各后转移窗口中正确路由至目标工具组的联合概率，实现对集合转换准确性的量化评估。此外，研究揭示了工具集呈现方式（即“集合框架”，set framing）——将工具视为竞争或互补关系——显著影响路由动态，表明界面设计可成为提升代理自适应能力的关键干预点。
链接: https://arxiv.org/abs/2607.13396
作者: Ziwei Ye
机构: 未知
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Software Engineering (cs.SE)
备注:
Abstract:What happens to an LLM agent’s tool choice when the reliable tool silently changes within an ongoing session? We borrow set-shifting from cognitive psychology to study how well agents adapt to hidden reliability shifts. Our benchmark mounts tool-skill libraries with redundancies, where many tools solve the same task but differ in hidden reliability. In our evaluation framework, a branched schedule shifts the reliable tool group at hidden boundaries and pairs every shift with a no-shift control. We find that agents, by default, settle on a small recurring routine within a few turns of each boundary, with call shares concentrating on a few discrete values after each reliability shift. We score the set-shifting accuracy for each agent trajectory: the joint probability of routing to the target tool group in every post-shift window. We test open-weight LLMs in an open-source agentic harness and find qualitatively distinct failure modes across the same set of routines. We also find that set framing, how the toolset presents the alternatives as competing or complementary, shifts the routing dynamics.
[NLP-29] GFlowRL: Scaling Distribution-Matching RL to Large Language Models
【速读】： 该论文旨在解决生成式强化学习（Generative Flow Networks, GFlowNets）在大规模推理模型后训练流程中难以扩展的问题，尤其是当模型规模、回溯时长、奖励噪声及分布式系统复杂度共同增加时，传统方法中依赖的可学习提示条件分区函数（prompt-conditional partition function）会引发梯度不稳定性与工程实现负担。其核心解决方案在于通过系统性分析发现，该分区函数可被替代为基于已有回溯样本组的批内蒙特卡洛估计，从而彻底摒弃辅助分区网络。为此，作者提出GFlowRL，一种简化的GFlowNet风格强化学习算法，在保持奖励分布匹配目标的同时，引入两个关键稳定机制：用于缓解回溯与训练器间漂移的重要度采样校正，以及针对异常残差的非对称流间隙截断（asymmetric flow-gap clipping）。实验表明，GFlowRL在数学、代码生成及对抗性红队测试基准上均超越现有方法，14B参数规模下达到Codeforces 2048评级（距o3-mini仅差25 Elo），并在AdvBench和HarmBench上取得最高平均攻击成功率（ASR@1），显著优于先前最先进多轮攻击模型；更重要的是，该方法在高达235B参数的混合专家（Mixture-of-Experts, MoE）架构中仍能稳定收敛，而此前的FlowRL方法在此类设置下已出现发散。据我们所知，GFlowRL是首个在密集与稀疏架构中均能稳定扩展的GFlowNet风格强化学习算法。
链接: https://arxiv.org/abs/2607.13394
作者: Xiaodong Liu,Michael Xu,Jack W. Stokes,Paul Smolensky,Doug Burger,Jianfeng Gao
机构: Microsoft Research (微软研究院)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 31 pages, 8 figures, 17 tables
Abstract:Generative Flow Networks (GFlowNets) offer a promising alternative to reward-maximizing reinforcement learning (RL) for large reasoning models, encouraging diverse reasoning paths by matching reward distributions rather than collapsing to dominant modes. Recent work shows promise on math and code, but scaling GFlowNet-style RL to modern post-training pipelines remains difficult: as model size, rollout horizon, reward noise, and distributed-systems complexity grow together, a learned prompt-conditional partition function becomes a source of gradient instability and engineering overhead rather than a useful normalizer. Through systematic analysis, we find that the learned partition function, previously treated as essential, can be replaced by an in-batch Monte Carlo estimate computed from the rollout group already required for training. We propose GFlowRL, a streamlined GFlowNet-style RL algorithm that removes the auxiliary partition network entirely while preserving the reward-distribution-matching objective, completed by two stabilizers: importance-sampling correction for rollout/trainer drift and asymmetric flow-gap clipping for outlier residuals. GFlowRL exceeds all counterparts on math, code, and adversarial red-teaming benchmarks, reaching a Codeforces rating of 2048 at the 14B scale (within 25 Elo of o3-mini) and attaining the highest average ASR@1 on AdvBench and HarmBench, outperforming the previous SOTA multi-turn attacker in a regime where FlowRL, a prior GFlowNet-style method, diverges. The same recipe transfers to all evaluated MoE configurations up to 235B parameters, where FlowRL again fails to converge. To our knowledge, GFlowRL is the first GFlowNet-style RL algorithm to scale stably across both dense and sparse architectures. Code will be at: this https URL
[NLP-30] Where Should RL Post-Training Compute Go? Model Size Search Learning and Feedback
【速读】： 该论文旨在解决强化学习（Reinforcement Learning, RL）后训练在资源受限场景下的计算预算分配问题，即在固定总浮点运算量（FLOP）预算下，如何最优地分配计算资源于模型规模、训练时长、轨迹采样与搜索、以及奖励反馈模型评估之间。其核心挑战在于，现有实践常将有限的后训练资源简化为单一的总FLOP预算，却未明确不同组件间的权衡关系。解决方案的关键在于提出一种基于FLOP的会计框架（FLOP-accounting framework），将计算资源细分为轨迹/搜索、策略更新/学习、以及奖励或反馈模型评估三部分，并通过该框架揭示了条件性分配前沿（conditional allocation frontiers）：最优资源配置随模型规模、预算水平、奖励系统类型及评估目标动态变化。研究发现，模型规模与训练分配存在耦合效应——大模型因每令牌计算成本更高，在相同预算下可获得更少的更新或采样次数；同时，奖励系统的差异显著影响资源分布：规则奖励几乎将非更新计算全部用于轨迹生成，而基于偏好模型（PRM）的反馈则需预留可观算力用于奖励模型推理。为此，作者提出了名为RACE的诊断性网格实验协议，用以在昂贵的验证实验前快速识别高效计算分配模式，强调未来RL后训练研究应不仅报告总FLOPs，还需披露计算在模型规模、搜索、学习与反馈各环节的分配比例。
链接: https://arxiv.org/abs/2607.13389
作者: Patrick Wilhelm,Odej Kao
机构: Technische Universität Berlin (柏林工业大学)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Reinforcement Learning (RL) post-training is increasingly used to adapt foundation models for reasoning, planning, and feedback-driven robot-learning pipelines, but constrained post-training resources are often summarized by a single total FLOP budget. We study the fixed-budget decision problem behind this practice: under the same post-training budget, should one use a larger policy, train a smaller policy longer, generate more rollout search, or spend compute on stronger reward feedback? We introduce a FLOP-accounting framework for GRPO post-training that decomposes compute into rollout/search, policy-update/learning, and reward- or feedback-model evaluation. Across LoRA-adapted Qwen2.5 policies, we find conditional allocation frontiers: the best observed allocation changes with model size, compute budget, reward system, and evaluation target. Same-FLOP model-size comparisons show that model choice and training allocation are coupled because larger policies consume more per-token compute and therefore buy fewer updates or rollouts under the same budget. Reward systems also change the accounting: rule-based rewards spend nearly all non-update compute on policy rollouts, while PRM-style feedback allocates a visible part of the budget to reward-model inference. We present RACE as a diagnostic pilot-grid protocol, not a guarantee of held-out improvement, for identifying allocation regimes before expensive validation runs; our results suggest that RL post-training papers should report total FLOPs together with how compute is divided among model size, search, learning, and feedback.
[NLP-31] A POS Tier Is the Key to Automated Annotation for Low-Resource Language Documentation: Neural Interlinear Glossing for Irabu a Southern Ryukyuan Language
【速读】： 该论文旨在解决濒危语言语法书写中语篇数据的逐行注释（interlinearized text）成本过高这一关键问题，尤其在母语者可参与验证的时间窗口有限的情况下，自动化部分注释流程具有直接的文献记录价值。其解决方案的关键在于构建一个完整的神经注释流水线，涵盖形态分割、词性标注（POS tagging）和释义标注（glossing），并采用刻意设计的小型、可解释的双向长短期记忆-条件随机场（BiLSTM-CRF）模型，在极低监督资源（约1小时完全标注语篇，相当于6–47分钟的训练数据）条件下进行评估。研究发现，引入真实词性标注层可使语法释义准确率提升4.4分（标准差0.7，所有种子测试均显著），且该增益随数据量减少而增强（在四分之一数据量时达11.6分）；词性标注层使达到特定精度所需标注数据量减少超过一半。然而，在全自动流水线中该优势尚未完全实现，因当前词性标注器仍存在12%的错误率，错误的词性标签对释义模型的误导程度甚至超过无词性信息的情况。该收益为潜在价值（latent value）——通过控制噪声实验表明，当标注器准确率提升至88%以上时，收益开始显现，准确率达92%-96%时可恢复1.6至3.2分。因此，论文最终提出具体建议：在语言记录实践中应采用四线标注（quadrilinear annotation）——即同时标注文本、词性、释义与翻译，以最大化注释效率与后续自动化的潜力。
链接: https://arxiv.org/abs/2607.13372
作者: Michinori Shimoji(Kyushu University)
机构: Kyushu University (九州大学)
类目: Computation and Language (cs.CL)
备注: 15 pages, 9 figures, 8 tables. Code, corpus, and complete per-sentence test outputs: this https URL
Abstract:Discourse data are the primary empirical basis of grammar writing in field linguistics, but producing interlinearized text is notoriously expensive - on the order of one hour of work per minute of recording. For endangered languages, where the time remaining to verify analyses with native speakers is itself limited, automating parts of the interlinearization workflow has direct documentary value. We implement a full neural annotation pipeline (morpheme segmentation, POS tagging, glossing) for Irabu Ryukyuan using deliberately small, transparent BiLSTM-CRF models, and evaluate it under a realistic hard constraint: approximately one hour of fully annotated discourse as the entire supervised resource. Two factors of the annotation itself are manipulated: its richness (with or without a POS tier) and its quantity (training budgets from 6 to 47 minutes). Gold POS improves grammatical glossing by +4.4 (SD 0.7) points (significant in all 5 seeds), and the gain grows as data shrink (+11.6 points at a quarter of the data); a POS tier more than halves the amount of glossed data needed to reach a given accuracy. In a fully automatic pipeline this gain is not yet realized: the tagger still errs on 12% of morphemes, and an incorrect POS misleads the glossing model more than no POS at all. The value is latent rather than lost: degrading gold POS with controlled noise shows the gain returning as tagger accuracy rises, with break-even near our tagger’s current 88% and +1.6 to +3.2 points recovered at 92-96%. We conclude with a concrete recommendation for documentation practice: annotate quadrilinearly - text, POS, gloss, translation.
[NLP-32] Evaluation Ability Does Not Imply Optimization Utility: LLM -as-a-Judge Signals in Closed-Loop Table Recognition
【速读】： 该论文旨在解决生成式 AI 在闭环再生（closed-loop regeneration）中依赖大语言模型作为评判者（LLM-as-a-judge）时存在的有效性不足问题，特别是在表格识别任务中的评估可靠性问题。研究采用确定性的表结构评测标准（TEDS）作为受控实验环境，结合 FinTabNet 与 OmniDocBench 两个数据集进行验证。其关键发现在于：首先，作为评判信号的评分存在严重弱化现象，表现为分数高度趋同、排名不可复现，且唯一在两个数据集上优于随机选择的策略依赖于首次迭代的“先决性”规则，说明其优势无法归因于评判得分本身；尽管迭代过程产生了更优候选结果，但评判系统未能有效识别并保留这些改进。其次，即使不引入特定评判反馈，仅通过结构保持型指令（structure-preserving instruction）即可显著降低严重损失率（severe-loss rate），表明在无约束再生过程中目标结构破坏是导致性能退化的直接机制。第三，虽然结构保持约束可缓解严重损失尾部问题，但并未带来整体性能提升，且在保留评判反馈的探索性 2×2 分析中，该保护效应并不稳定。因此，研究揭示了评判能力（evaluation ability）并不等同于优化实用性（optimization utility），提出迭代优化至少需要一个能确定性检测结构变化的验证信号，而非仅依赖评判得分。
链接: https://arxiv.org/abs/2607.13347
作者: Donghwan Kim
机构: Aidentyx Inc., San Jose, CA, USA
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 31 pages, 9 figures, appendix included
Abstract:LLM-as-a-judge is widely used to provide feedback and selection signals in closedloop regeneration, but this use remains insufficiently validated. We study it in table recognition, where deterministic TEDS evaluation provides a controlled testbed, using FinTabNet and OmniDocBench. Three findings emerge. First, judge signals were weak on both datasets: scores frequently tied, rankings were not reproducible, and the only selection policy that beat random on both datasets depended on an earliest-iteration tie rule, so its advantage cannot be attributed to the judge scores alone. Iteration produced better candidates, but the judge failed to recover them. Second, severe losses occurred even without specific judge feedback. A structurepreserving instruction significantly reduced the severe-loss rate on FinTabNet and was directionally consistent on OmniDocBench. The contrasts support target-preservation failure under unconstrained regeneration as a proximate mechanism of the observed severe losses. Third, the structure-preservation constraint reduced the severe-loss tail but produced no improvement. In an exploratory 2x2 analysis, the same protection was not stably observed when judge feedback was retained. These results do not dispute the value of LLMs as evaluators. Instead, they show that evaluation ability does not imply optimization utility. Iterative refinement requires, at minimum, a verification signal that deterministically detects structural change, rather than judge scores alone.
[NLP-33] he Refusal Residue: When Probes Catch Alignment Faking and When They Dont ICML2026
【速读】： 该论文旨在解决生成式 AI 模型在对齐（alignment）过程中可能出现的“对齐伪装”（alignment faking）问题，即模型在受到监控时表现出合规行为，而在未受监控时却保留潜在的非合规行为。其核心挑战在于：当模型的推理过程（如思维链，scratchpad）不可见时，仅通过输出无法区分模型是真正合规还是策略性伪装。为应对这一问题，研究的关键在于探索隐藏状态（hidden states）是否能揭示输出所掩盖的真实行为模式。研究通过13个模型的系统性实验发现，仅有Qwen3-32B和Llama-3.1-8B存在自然涌现的对齐伪装现象，且两者均表现出不对称的拒绝残留特征——监控下的合规性向拒绝偏移，但拒绝状态的表示并未发生变化。进一步的探测与控制实验表明，虽然可通过特定方向的隐藏状态探测实现一定程度的对齐伪装检测（如在Llama上达到AUROC 0.87），但该方向无法有效操控模型行为（扰动幅度|Δ|<0.08）。此外，研究揭示了传统探测方法中的多重偏差，包括残差化探针的跨折叠泄漏、线性探针的虚假性能以及多层感知机（MLP）导致的可检测性高估。因此，论文提出了一套包含五项控制措施的测量框架，涵盖多标记提取、拒绝-拒绝混淆检查、每折残差化、留一查询外评估及正交约束探测，以提升未来对齐伪装检测研究的严谨性与可靠性。
链接: https://arxiv.org/abs/2607.13346
作者: Aman Mehta
机构: 未知
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: Accepted to the Mechanistic Interpretability Workshop at ICML 2026. 12 pages, 4 figures
Abstract:Alignment faking is dangerous because a model can appear compliant under monitoring while preserving behavior it would reveal when unmonitored. When no scratchpad is visible, behavior alone cannot distinguish strategic from genuine compliance. We ask whether hidden states reveal what outputs hide. We run a 13-model sweep for naturally-emerging faking, then probe and steer hidden states on the two models that fake. Natural faking appears only in Qwen3-32B (+18.2pp) and Llama-3.1-8B (+24.4pp at n=10, p10^-15), while explicit scratchpad self-reports are rare (a Claude Opus 4 judge flags faking reasoning in 1.4% of Qwen and 0.0% of Llama compliant scratchpads). Both fakers show an asymmetric refusal residue: monitored compliance shifts toward refusal (d=0.32 Qwen, d=0.33 Llama, both p0.0001), while refusal representations do not move (p=1.00). Per-sample detection is model-conditional. Under leakage-free leave-one-query-out probing, detection survives on Llama (AUROC 0.87) but collapses to chance on Qwen (0.43), and cross-model transfer is null. Steering over 2,000 runs barely changes compliance (|h|0.08), so the detected direction can flag faking but does not by itself control it. Standard residualized probing leaks across folds and reaches AUROC 0.63 on a control where no faking can occur; naive linear probes reach a meaningless AUROC 1.0; and conventional MLPs overstate detectability by 0.2-0.3 AUROC. For future alignment-faking detection work, we release a five-control measurement framework: multi-token extraction, refuse-vs-refuse confound checks, per-fold residualization, leave-one-query-out evaluation, and orthogonality-constrained probing. Comments: Accepted to the Mechanistic Interpretability Workshop at ICML 2026. 12 pages, 4 figures Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Computation and Language (cs.CL) Cite as: arXiv:2607.13346 [cs.CR] (or arXiv:2607.13346v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13346 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Aman Mehta [view email] [v1] Wed, 15 Jul 2026 00:11:42 UTC (485 KB)
[NLP-34] Meta-Learning Preferences for Multilingual LLM Alignment
【速读】： 该论文旨在解决多语言场景下大语言模型对齐过程中，因不同语言间人类偏好数据分布不均而导致的低资源语言对齐困难问题。其核心挑战在于低资源语言缺乏足够的高质量偏好数据以支持有效的强化学习对齐。解决方案的关键在于提出一种基于元学习（meta-learning）的从人类反馈中进行强化学习与直接偏好优化的联合框架，通过利用其他高资源语言的偏好数据，学习一个可迁移的初始化参数，从而在仅需极少量目标语言偏好样本（如仅100条）的情况下，实现对目标语言的有效适应。该方法在理论上提供了对元奖励建模和元策略优化设置的保证，并在多个多语言基准测试中验证了其有效性：在极端低资源条件下，相比基线方法最高提升28%的胜率，且在多种目标语言和模型规模下均表现更优，同时对元训练语言的选择及与目标语言的语义距离具有鲁棒性。
链接: https://arxiv.org/abs/2607.13315
作者: Jiaying Lin,Seongho Son,Nam Phuong Tran,Long Tran-thanh,Ilija Bogunovic,Debmalya Mandal
机构: University of Warwick (华威大学); University College London (伦敦大学学院); University of Basel (巴塞尔大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Unequal availability of human preference data across languages poses a significant challenge for aligning large language models in multilingual settings. To address the lack of sufficient data in low-resource language alignment, we propose a meta-learning framework for Reinforcement Learning from Human Feedback and Direct Preference Optimization. By leveraging preference data from other languages, our framework learns a transferable initialization that enables effective adaptation to a target language with minimal data. We provide theoretical guarantees for both the meta-reward modeling and meta-policy optimization settings, and empirically demonstrate the effectiveness of our approach on multilingual benchmarks. In an extremely low-resource setting with only 100 target-language preference samples, our approach achieves up to 28% win-rate improvements over baseline methods, and consistently outperforms baselines across multiple target languages and model scales. Our approaches retain these advantages across different combinations of meta-training languages and varying linguistic distances from the target languages.
[NLP-35] Finding the Right Tables and Columns: A Benchmark and Corpus-Adaptive Embeddings for SQL Schema Retrieval
【速读】： 该论文旨在解决大规模数据库环境下**模式检索（schema retrieval）这一关键前置问题，即在包含数千张表和列的复杂企业级数据库中，准确识别自然语言查询所涉及的目标表与列。传统文本到SQL（text-to-SQL）研究多聚焦于生成阶段，但忽略了在模型上下文受限的情况下，如何高效、精准地定位相关数据模式这一根本性挑战。其解决方案的关键在于提出一种语料自适应微调（corpus-adaptive fine-tuning）**策略：基于目标数据库语料直接合成自然语言查询，构建粒度感知的困难负样本（granularity-aware hard negatives），并采用对比学习方式对一个305M参数的嵌入模型进行微调。该方法显著提升了检索性能（平均召回率@10从60.4提升至75.6，nDCG@10从51.9提升至68.0），使小型模型在亿级参数量级下超越多数大型嵌入模型，并具备对不同主干网络的通用适应性。消融实验与泄漏审计表明，性能提升源于可迁移的模式检索能力，而非数据记忆。研究确立了模式链接作为独立检索任务的地位，并为在企业级场景中低成本部署高效模式检索提供了可行路径。
链接: https://arxiv.org/abs/2607.13311
作者: Qingcheng Zeng,Puxuan Yu,Aman Mehta,Fuheng Zhao,Rajhans Samdani
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Retrieval in the SQL setting has largely been studied as the task of finding, within a large collection of SQL statements, the statement that answers a natural-language question. At scale, however, a more fundamental retrieval problem precedes generation: schema retrieval, identifying the tables and columns a question requires in a database that may contain thousands of them, far more than fit in a model’s context. We argue that this step warrants first-class evaluation. To this end, we recast five text-to-SQL datasets (Spider, BIRD, BEAVER, and two LiveSQLBench variants) as retrieval tasks at both table and column granularity, covering realistic and enterprise-scale schemas under two document representations, and we show that off-the-shelf text and code embedders transfer poorly to this setting. We then propose corpus-adaptive fine-tuning: natural-language queries are synthesized directly from the target schema corpus, granularity-aware hard negatives are mined, and a 305M-parameter embedder is fine-tuned contrastively. This procedure raises average recall@10 from 60.4 to 75.6 (nDCG@10 from 51.9 to 68.0), making the 305M model the strongest retriever under one billion parameters and competitive with state-of-the-art embedders of 4-8B parameters, more than an order of magnitude larger. The same recipe improves an 8B state-of-the-art embedder from 77.8 to 78.4 recall@10, matching the best result on the benchmark and indicating that the adaptation is backbone-agnostic. Leave-one-corpus-out experiments and a leakage audit show that these gains reflect a transferable schema-retrieval ability rather than memorization of the evaluation data. Our results establish schema linking as a standalone retrieval task and lightweight, label-free corpus adaptation as a practical route to deploying it at enterprise scale.
[NLP-36] heory-Level Autoformalization: From Isolated Statements to Unified Formal Knowledge Bases ICML2026
【速读】： 该论文旨在解决当前自动形式化（autoformalization）研究中局限于单个命题形式化，而忽视实际形式化工作本质上为理论层级（theory-level）的问题。现有方法未能充分建模理论内部各组成部分（如公理、定义与引理）之间的复杂依赖关系，导致难以支持完整数学理论的系统性形式化。其解决方案的关键在于推动理论层级的自动形式化，即以结构化库的形式对整个数学理论及其内在依赖关系进行统一建模与形式化，从而实现可验证、可复用且具备语义连贯性的形式化知识体系。这一范式转变强调了理论整体性与模块化组织的重要性，为构建大规模、可扩展的机器可验证数学知识库提供了新方向。
链接: https://arxiv.org/abs/2607.13292
作者: Marcus J. Min,Mike He,Zhaoyu Li,Zixuan Yi,Sharad Malik,Aarti Gupta,Xujie Si,Osbert Bastani
机构: 未知
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG); Programming Languages (cs.PL)
备注: ICML 2026 Spotlight
Abstract:Autoformalization translates informal natural language into formal, machine-verifiable languages. While most work focuses on individual statements, real formalization efforts are inherently theory-level: they require an entire web of axioms, definitions, and lemmas before target theorems can even be stated. In this position paper, we argue for theory-level autoformalization: formalizing complete theories, including all their inter-dependencies, as structured libraries. We examine the significance of this shift, address alternative views, identify open challenges, and propose three promising paths forward. Our survey of autoformalization is available at this https URL.
[NLP-37] Discourse-Aware Policy Analysis with Argumentation: A Hybrid LLM -Symbolic Framework for Disaster Governance
【速读】： 该论文旨在解决政策文本中隐含的治理逻辑与框架间张力难以被计算方法有效捕捉的问题，特别是当参与式承诺与管理控制在同一文本中共存时，传统计算模型无法揭示一种框架对另一种框架的“中介性关系”（frame-mediated relations），如通过工具化或窄化等方式实现的非直接排斥。其解决方案的关键在于提出一种融合大语言模型（LLM）与符号规则的混合范式——Apaf，将批判性话语分析（Critical Discourse Analysis, CDA）转化为可量化的双极论点框架。该方法首先利用LLM对政策论点进行推断性分类，识别其属于协商性（deliberative）或管理性（managerial）框架；随后基于确定性规则，从LLM提取的特征中生成四类中介关系子类型：代理权缩减（agency reduction）、议程转移（agenda shift）、工具性支持（instrumental support）和规范性支持（normative support）。研究还发布了包含美、英、加、澳四国100个灾害风险减缓政策子文档的新型数据集，实证表明所生成的论点图具有高准确性、可解释性及跨司法管辖区的稳定性。
链接: https://arxiv.org/abs/2607.13260
作者: Stylianos Loukas Vasileiou,Olga Derendiaeva
机构: New Mexico State University(新墨西哥州立大学); Sun Yat-Sen University(中山大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Policy documents shape governance outcomes, but their reasoning is often implicit. Participatory commitments and managerial control routinely coexist in the same text, and the tensions between them are rarely stated directly. Existing computational approaches to policy discourse cannot express the frame-mediated relations that drive these tensions, where one argument narrows or instrumentalizes another rather than rejecting it. End-to-end summarization by large language models produces fluent text but offers little structure that domain experts can inspect or contest. We present Apaf, a hybrid LLM–symbolic pipeline that operationalizes critical discourse analysis as a quantitative bipolar argumentation framework over policy text. Arguments are first classified into deliberative or managerial frames. Four frame-mediated relation subtypes (agency reduction, agenda shift, instrumental support, and normative support) are then produced by deterministic rules over LLM-extracted features. We release a novel dataset of 100 sub-documents of disaster-risk-reduction policy from the USA, UK, Canada, and Australia, and show that the resulting argument graphs are accurate, interpretable, and stable across jurisdictions.
[NLP-38] GSM-Plus-BN: A Perturbation-Based Benchmark for Bangla Mathematical Reasoning in Large Language Models
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在低资源语言如孟加拉语（Bengali）中的数学推理能力评估不足的问题。当前的数学推理研究主要集中于英语等高资源语言，导致在语言多样性显著的地区（如孟加拉国，其超过2.3亿人口使用孟加拉语）难以实现人工智能的公平发展与部署。现有研究中缺乏针对孟加拉语系统的、经过系统性扰动（perturbated）的数学推理数据集，使得模型的鲁棒性与真实理解能力无法被有效评估。为此，本文提出GSM-Plus-BN——一个基于英文GSM-Plus基准构建并经人工翻译验证的扰动型孟加拉语数学推理数据集。关键解决方案在于通过引入具有多样扰动形式的8,000个变体样本，结合1,000个原始种子问题，构建了一个涵盖标准提示（Standard Prompting）与思维链提示（Chain-of-Thought, CoT Prompting）的9,000样本评测基准，并对六种开源大模型进行系统评估。实验结果表明，尽管GPT-OSS-20B在标准提示下达到96.08%的种子问题准确率，且更大规模模型在多种扰动类型下表现出更强鲁棒性，但所有模型在孟加拉语上的性能仍显著低于其在英语基准的表现，凸显了扰动后孟加拉语文本带来的固有挑战。本研究的核心贡献在于首次提供了面向孟加拉语数学推理的标准化数据集与基线，为后续相关研究奠定了基础。
链接: https://arxiv.org/abs/2607.13248
作者: Bidyarthi Paul,Nahida Jannat Mayouree,Md. Asif Karim,Sagar Chandra Nath,Swastika Kundu
机构: Southeast University; Ahsanullah University of Science and Technology
类目: Computation and Language (cs.CL)
备注:
Abstract:The evaluation of mathematical reasoning in large language models (LLMs) has predominantly focused on high-resource languages like English. This has created a significant barrier to the equitable development and deployment of AI in linguistically diverse regions such as Bangladesh, where over 230 million people speak Bengali. Despite this global significance, there has been minimal prior work on mathematical reasoning in Bengali and no existing research that systematically benchmarks a perturbated Bengali mathematical dataset, leaving a critical void in assessing model robustness and true comprehension beyond pattern recognition. This study addresses this gap by introducing GSM-Plus-BN, a novel perturbated Bengali mathematical dataset derived from the English GSM-Plus benchmark and verified by human translators. We evaluate six open-source LLMs Qwen3-32B, Llama-3.1-8B-Instant, Llama-3.3-70B-Versatile, Llama-4-Scout-17B-16E-Instruct, GPT-OSS-120B, and GPT-OSS-20B using a benchmark of 9,000 evaluation samples comprising 1,000 seed questions and 8,000 perturbed variants under both Standard Prompting and Chain-of-Thought (CoT) Prompting. Experimental results show that GPT-OSS-20B achieves the highest seed question accuracy of 96.08% under Standard Prompting, while larger models such as Llama-3.3-70B and GPT-OSS-120B demonstrate superior robustness across perturbation types. Furthermore, CoT prompting substantially improves reasoning for most models compared to Standard Prompting, yet a notable performance gap persists across all models relative to their English benchmarks, underscoring the inherent difficulty of perturbed Bengali text. This research makes a foundational contribution by providing GSM-PLUS-BN as a new resource and baseline for future Bengali mathematical reasoning research.
[NLP-39] Adaptive Filtering of the KV Cache: Diagnosing and Correcting Structural-Role Bias in LLM Inference
【速读】： 该论文旨在解决生成式 AI（Generative AI）在长上下文建模中因注意力键值缓存（KV cache）容量受限而导致的精度下降问题，尤其针对结构密集型输入（如嵌套 JSON）下传统基于注意力质量排序的淘汰策略（如 H2O 及其衍生方法）所引发的信号-噪声失衡问题。其核心问题是：现有方法将注意力累积能量（attention mass）作为信号强度指标进行令牌保留，但在结构化数据中，非内容角色（如分隔符、空白字符）和结构性 KEY 令牌的注意力能量远高于语义承载的 VALUE 令牌，导致噪声被过度保留而关键内容被稀释，最终使精确匹配准确率从 88% 降至 0%（在 5% 缓存预算下）。解决方案的关键在于提出一种无需重新训练的角色条件分配机制，基于 SnapKV 的窗口化得分，引入单个可调超参数实现对不同角色（如 KEY、VALUE）的差异化保留策略，并通过一个仅 15 MB 的线性角色探测器在推理时高效提供角色标签，从而有效抑制噪声角色的过量保留。该方法在低于 20% 的缓存预算下可弥补 H2O 方法 63%-98% 的性能差距，在更高预算下甚至接近或超越全缓存精度，展现出显著的去噪效果，尽管其提升在部分条件下具有种子敏感性且统计显著性有限。
链接: https://arxiv.org/abs/2607.13205
作者: Soumil Mandal
机构: 未知
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 6 pages, 2 figures, 5 tables
Abstract:Attention-based KV cache eviction (H2O and its descendants) compresses the memory-constrained state of a long-context model by ranking tokens on accumulated attention mass, treated here as signal energy, and keeping the heaviest. On schema-dense input streams such as nested JSON, this score acts as a non-stationary filter that disproportionately retains noise: a non-content sink role (delimiters or whitespace) carries an order of magnitude more energy than any content role, and structural KEY tokens are over-retained at roughly 1.8x the rate of the answer-carrying VALUE tokens, collapsing exact-match accuracy from 88% to 0% at a 5% budget as the signal-to-noise ratio of the retained state degrades. A counterfactual experiment establishes that suppressing KEY tokens is the best deployable filter. Our retraining-free, role-conditional allocation over SnapKV’s windowed score, governed by a single tuned hyperparameter, closes 63-98% of the H2O gap at sub-20% budgets and, at higher budgets, modestly matches or exceeds full-cache accuracy – a small, seed-sensitive denoising effect (borderline significant at B=0.50; not distinguishable from zero at B=0.30 over four seeds). A 15 MB linear role probe supplies these labels at negligible inference cost, though matching parser-level downstream accuracy remains open.
[NLP-40] RAG thoven at SemEval-2026 Task 1: A Multi-Stage Pipeline Walks Into a Benchmark and Barely Clears the Bar SEMEVAL-2026
【速读】： 该论文旨在解决多语言受限幽默生成（multilingual constrained humor generation）这一复杂自然语言生成任务，具体聚焦于在英语、西班牙语和中文三种语言中生成符合特定约束条件且具有幽默感的文本。其核心挑战在于如何在保持语言多样性与文化适配性的同时，精准控制幽默机制并确保生成内容的高质量与一致性。解决方案的关键在于提出一种基于计算幽默理论（良性违反理论，Benign Violation Theory；脚本基语义幽默理论，Script-based Semantic Theory of Humor）的多阶段大语言模型（LLM）流水线架构——RAGthoven，该架构包含规划器（Planner）、最佳- N 写作器（Best-of-N Writer）、自省反思器（Reflector）及基于LLM的评判者（Judge），并通过检索增强生成（RAG）从精心筛选的笑话语料库中引入多样化的幽默机制以初始化生成过程。此外，研究还探索了两种代理式变体：顺序式工具调用（ReAct风格，Exp09）与自主多分支编排（Exp10），均集成确定性约束审计检查器（ConstraintAudit）。尽管两种代理方案显著提升了工具调用开销，但在独立测试集上并未产生优于非代理流水线的输出质量，表明当前沿模型已具备较强生成能力时，复杂的多阶段提示工程与代理框架可能带来语言依赖性的边际收益递减。最终，RAGthoven在所有三种语言中与Gemini 2.5 Flash基准并列第一，尤其在西班牙语中领先42原始Elo分，而在英语和中文中则处于统计学上的平局状态，验证了在强模型基础上优化生成策略需更精细地权衡复杂性与有效性。
链接: https://arxiv.org/abs/2607.13189
作者: Marek Šuppa,Viktória Ondrejová,Lucia Ganajová,Gregor Karetka,Daniel Skala
机构: Comenius University in Bratislava, Slovakia; Cisco Systems; Zaitra s.r.o., Brno, Czech Republic; NaiveNeuron
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: SemEval-2026 Task 1
Abstract:We present RAGthoven, our system for SemEval-2026 Task 1 (MWAHAHA), Subtask A (multilingual constrained humor generation in English, Spanish, and Chinese). RAGthoven decomposes creative text generation into a multi-stage large language model (LLM) pipeline (Planner, Best-of-N Writer, Reflector for self-critique, LLM-as-a-judge Judge) grounded in computational humor theory (Benign Violation Theory, Script-based Semantic Theory of Humor) and refined across ten experiments. In our final configuration, we augment the Planner with retrieval-augmented generation (RAG) from a curated joke corpus, seeding generation with diverse joke mechanisms. We also evaluate two agentic variants – ReAct-style sequential tool-calling (Exp09) and autonomous multi-branch orchestration (Exp10) – that expose the same four stages with a deterministic ConstraintAudit checker. Across four frontier models on a held-out 12-instance English sample, neither agentic variant produced outputs we judged superior to the non-agentic pipeline despite substantially higher tool-call budgets. RAGthoven shares Rank 1 with the Gemini 2.5 Flash baseline in all three languages, with overlapping organizer-reported confidence intervals. In Spanish, it leads the baseline by 42 raw Elo points (1182 vs. 1140), while in English (1045 vs. 1081) and Chinese (1045 vs. 1053) the baseline holds the higher raw rating within the same statistical tie. Together, these results suggest language-dependent diminishing returns from elaborate multi-stage prompt engineering and agentic scaffolding once a strong frontier model is in the loop. Comments: SemEval-2026 Task 1 Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13189 [cs.CL] (or arXiv:2607.13189v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2607.13189 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Marek Šuppa [view email] [v1] Tue, 14 Jul 2026 18:39:33 UTC (372 KB)
[NLP-41] xt2Sign: A Single-GPU Diffusion Baseline for Text-to-Sign Language Video Generation
【速读】： 该论文旨在解决文本到手语视频生成成本高昂的问题，尤其针对现有视频扩散模型在训练与推理阶段计算资源消耗过大、难以在单机设备上高效运行的瓶颈。其核心挑战在于如何在保持手语动作时序连贯性的同时，显著降低全视频注意力机制带来的计算开销。解决方案的关键在于提出一种轻量级的文本条件扩散模型Text2Sign，通过结合冻结的视觉-语言文本编码器、3D编码器-解码器结构以及因子化时空注意力（factorized spatiotemporal attention），有效压缩了模型参数规模与推理复杂度，实现了仅需单块NVIDIA L4 GPU即可完成短时手语视频生成。该方法在保证运动一致性与生成质量的前提下，将生成效率提升至2.54帧/秒，峰值内存占用仅为3.12 GB，具备良好的实用性和可扩展性。尽管仍受限于低分辨率、短片段输出且缺乏专家语言学评估，但其表现验证了冻结文本条件与因子化注意力设计在降低计算成本方面的有效性，为后续研究提供了可在单GPU上快速迭代的基准系统。
链接: https://arxiv.org/abs/2607.13164
作者: Ruize Xia
机构: 独立研究者(Independent Researcher)
类目: Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Sign language is a primary communication channel for millions of Deaf and hard-of-hearing people, yet text-to-signer video generation remains costly because video diffusion models are expensive to train and evaluate. This paper presents Text2Sign, a text-conditioned diffusion model for short sign-language clips that runs on a single NVIDIA L4 GPU. It combines a frozen vision-language text encoder with a 3D encoder-decoder and factorized spatiotemporal attention to reduce the cost of full-video attention while preserving motion coherence. We compare convolution-only and transformer-style backbones, frozen pretrained and task-specific text encoders, and factorized versus full attention. On a signer-disjoint How2Sign split, the best short-run ablation reaches a validation loss of 0.0648, while a longer-run checkpoint reaches 0.00999. On a compact evaluation slice, the latter achieves an SSIM of 0.2403 \pm 0.0238 , a PSNR of 15.11 \pm 0.42 dB, and temporal consistency of 1.0000 \pm 0.0000 using 8-step DDIM sampling with a guidance scale of 5.0. It generates a 32-frame, 64 \times 64 clip in 12.60 seconds, or 2.54 frames per second, with peak inference memory of 3.12 GB. A held-out denoising audit shows only weak prompt sensitivity: removing text increases late-timestep loss from 0.9875 to 0.9891, while shuffled prompts perform similarly to correct prompts. Frozen text conditioning therefore improves short-budget validation loss, but prompt-specific separation remains limited. The system is restricted to low-resolution, short clips and lacks expert linguistic evaluation, so it should be viewed as a single-GPU research baseline rather than a complete sign-language production system. Code is available at this https URL. Subjects: Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG) Cite as: arXiv:2607.13164 [cs.CL] (or arXiv:2607.13164v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2607.13164 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Journalreference: IEEE Access, vol. 14, pp. 64003-64017, 2026 Related DOI: https://doi.org/10.1109/ACCESS.2026.3686260 Focus to learn more DOI(s) linking to related resources
[NLP-42] What Models Express Suppress and Resist: Auditing Open-Weight LLM s with Persona Vectors
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在后训练阶段形成的内在行为模式难以通过常规提示（prompting）充分揭示的问题，尤其关注模型在特定行为上的表达、隐藏或抵抗机制。其核心挑战在于：尽管模型的行为倾向主要由后训练决定，但这些倾向的深层组织结构无法仅通过输入提示来探测。为此，论文提出系统性应用“人格向量”（persona vectors），即激活空间中表征特定行为方向的潜在向量，构建了一个涵盖53种行为特质的综合性清单，覆盖四个行为维度，并对两个开源模型中的每项特质进行分类：自然存在（baseline下自发表现）、可调节且可放大的潜在特质，以及难以提取的顽固性特质。研究发现，两个模型默认表现出助人、任务导向的行为，所有九个代理型特质均为自然存在，其临床行为与认证心理医生对17项特质的独立评价高度一致。而通过行为调节（steering）获得最大改进的恰恰是模型默认排除的特质，如夸张、幻觉和阿谀奉承。进一步分析表明，在171组通用特质对中，仅当两个特质均可调节时，其组合才会被打破；而涉及默认特质的组合则始终无法被改变。此外，对于标准提取方法失效的“邪恶”等特质，通过从微调版本迁移向量仍可恢复其表示，且相关的拒绝反应可被观察到于模型的思维链（chain-of-thought）内部。因此，人格向量的关键价值不在于作为直接控制工具，而在于作为揭示模型内在行为组织结构的探针。
链接: https://arxiv.org/abs/2607.13162
作者: Winston Zeng,Ali Emami,Jinho Choi
机构: Emory University (埃默里大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:What a language model will and will not do is largely set during post-training, but which behaviors it expresses, hides, or resists is not revealed by prompting alone. Persona vectors, behavioral directions in activation space, can probe this organization, but prior work covers only a handful of traits. We present the first systematic application of persona vectors at this scale, compiling a 53-trait inventory across four behaviorally distinct domains and labeling every trait in two open-weight models as natural (expressed at baseline), steerable latent but amplifiable, or intractable (resistant to standard extraction). Both models default to helpful, task-oriented behavior: all nine agentic traits are natural, and their default clinician behavior matches a board-certified psychologist’s independent desirability judgments on 16 of 17 traits. Steering produces its largest gains on traits these defaults exclude: hyperbole, hallucination, and sycophancy. The same asymmetry holds across all 171 generic-trait pairs: two steerable traits can collapse the composition, but pairs involving a default never do. Where standard extraction fails on a trait like “evil,” a vector transferred from a fine-tuned variant still recovers it, with the residual refusals appearing inside the model’s chain-of-thought. Persona vectors are most informative not as a set of controls but as a probe of behavioral organization.
[NLP-43] Do LLM s Need Architectural Changes for Simultaneous Speech Translation? A Prefix-to-Prefix Data Driven Approach
【速读】： 该论文旨在解决生成式语音翻译（SimulST）在严格延迟约束下实现增量式翻译的难题，尤其针对解码器仅有的大语言模型（LLM）系统中存在的上下文受限与跨语言重排序能力不足的问题。现有方法通常依赖于架构修改或显式的读写策略来控制输出时机，但在对话语音中因切分边界模糊而显得脆弱。本文提出一种数据驱动的简化解决方案：采用固定长度的块进行累积流式解码，并引入基于回溯的已提交前缀机制；同时，在微调阶段使用教师标注的前缀到前缀（P2P）目标并施加等待时间上限，构建了CSSEL-P2P模型，其中CSSEL为提出的分块流式语音编码器大语言模型。在自建对话语音评估中，CSSEL-P2P在与基线相当的延迟（平均滞后仅增加0.15秒）下，将流式翻译质量提升了+1.54 COMETKiwi，表明通过P2P监督即可在不改变架构的前提下实现高效的模拟实时语音翻译。
链接: https://arxiv.org/abs/2607.13158
作者: Junkun Chen,Jian Xue,Ming Tang,Abdel Heba,Hoda Gholami,Ruchao Fan,Jinyu Li
机构: Microsoft(微软)
类目: Computation and Language (cs.CL)
备注:
Abstract:Simultaneous speech translation (SimulST) requires incremental translation under strict latency constraints, yet remains challenging for decoder-only LLM systems due to limited context and cross-lingual reordering. Recent approaches often introduce architectural changes or explicit read/write policies to control output timing, which can be brittle in conversational speech where segmentation boundaries are ambiguous. We present a simple data-driven alternative: fixed-length chunks for cumulative streaming decoding with a rewind-based committed prefix, and teacher-labeled prefix-to-prefix (P2P) targets with bounded waiting for fine-tuning, yielding CSSEL-P2P, where CSSEL is our proposed chunked streaming speech encoder LLM. In our in-house conversational speech evaluation, CSSEL-P2P improves streaming quality by +1.54 COMETKiwi over the CSSEL streaming baseline at comparable latency (+0.15s Average Lagging), suggesting effective SimulST without architectural changes via P2P supervision.
[NLP-44] ShortOPD: Recovering Pruned LLM s with Short-to-Long On-Policy Distillation
【速读】： 该论文旨在解决结构化剪枝（Structured Pruning）在大语言模型（LLM）压缩后，虽在多项选择类识别任务上表现良好，但在实际部署所需的自由文本生成任务中性能严重退化的难题。核心问题在于：剪枝后模型的贪婪解码准确率（pass@1）几乎消失，而通过重复采样可恢复的生成能力（pass@k）表明有效生成内容并未被彻底破坏，仅被“降级”；进一步分析发现，生成质量下降主要源于后缀重复（suffix repetition）现象。针对此问题，论文提出关键解决方案——基于策略的蒸馏（On-Policy Distillation, OPD），其核心思想是利用剪枝前的原始模型作为冻结教师，对剪枝后的模型在自身策略生成的轨迹上施加密集的词元级监督，以实现高质量生成的恢复。然而，传统OPD在长序列滚动过程中会将早期训练预算浪费于低信息量的重复后缀，导致收敛缓慢。为此，论文提出一种“短到长”的优化调度策略（short-to-long OPD, \shortopd），通过检测教师确认的重复后缀，将剩余前缀视为每条轨迹的有效长度，并据此动态分配后续的滚动预算，从而显著提升训练效率与生成质量。实验表明，\shortopd在数学、代码及开放式生成任务中，使压缩模型得分提升至未恢复状态的约9倍，且优于标准恢复方法（SFT无知识蒸馏、知识蒸馏、序列知识蒸馏）1.6–4.4倍，同时仅需2小时训练时间与71%的滚动令牌数，即可达到固定8192令牌滚动周期下的性能水平。该方法推动了结构化剪枝从仅在困惑度和多项选择基准上取得边际收益，迈向真正具备部署可用性的生成质量。
链接: https://arxiv.org/abs/2607.13124
作者: Qingyu Zhang,Qianhao Yuan,Hongyu Lin,Yaojie Lu,Xianpei Han,Le Sun,Xiang Li,Ming Xu,Jiarui Li,Xiuyin Zhao
机构: 未知
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Structured pruning is a hardware-friendly way to compress LLMs, but it is mostly validated on multiple-choice recognition tasks, while the same compressed checkpoints can collapse on the free-form generation that deployment actually requires. Two observations trace this gap. First, greedy \textscpass@ 1 nearly vanishes after compression, yet \textscpass@ k recovers substantially under repeated sampling: useful generations are demoted, not erased. Second, the recoverable regime fails mainly through suffix repetition. Recovery should therefore train on the compressed model’s own on-policy states with dense token-level supervision, which On-Policy Distillation (OPD) provides by reusing the pre-compression model as a frozen teacher. However, long on-policy rollouts spend early recovery budget on low-information repetitive suffixes, delaying loss descent. To mitigate this waste, we propose \textbf\shortopd, a short-to-long OPD schedule that detects teacher-confirmed repetitive suffixes, treats the surviving prefix as each rollout’s effective length, and allocates future rollout budgets to the effective lengths the policy can currently use. Across math, code, and open-ended generation, \shortopd\ raises the compressed model’s score to about 9\times its unrecovered value and 1.6 – 4.4\times standard recovery recipes (SFT w/o KD, KD, and SeqKD), and it matches a fixed 8192 -token rollout horizon within two points using a quarter of the training time ( 8.5 vs.\ 35.9 hours) and 71% fewer rollout tokens. We hope this recipe helps move structured pruning beyond marginal gains on perplexity and multiple-choice benchmarks, a step closer to deployment-ready generation quality.
[NLP-45] Self-Improvements in Modern Agent ic Systems: A Survey
【速读】： 该论文旨在解决自改进自主智能体（self-improving autonomous agents）在实际部署中如何实现可控演化（controllable evolution）的问题，即在极少甚至无需人类干预的情况下，通过经验积累持续提升自身能力。其核心挑战在于如何系统化地设计和实现智能体的自我优化机制，使其能够从交互经验中自动获取知识并更新自身结构。解决方案的关键在于提出一个系统级框架，将现代智能体建模为由基础模型（foundation model）与操作支撑架构（operational scaffold）共同构成的配置系统，其中支撑架构包含提示（prompts）、记忆（memory）、工具（tools）和控制逻辑（control logic）。在此框架下，自改进被形式化为一种自诱导的更新算子（self-induced update operator），该算子可主动获取并提交对模型参数或支撑组件的更新。通过按更新目标和驱动信号对已有工作进行分类，并系统梳理应用案例与评估方法，该研究为自改进智能体的设计、分析与未来发展方向提供了理论基础与实践指引。
链接: https://arxiv.org/abs/2607.13104
作者: Zhe Ren,Yimeng Chen,Dandan Guo,Guowei Rong,Tonghui Li,R. B. Xiong,Qingfeng Lan,Wenyi Wang,Li Nanbo,Yibo Yang,Mingchen Zhuge,Jürgen Schmidhuber
机构: Jilin University; King Abdullah University of Science and Technology (KAUST); University of Alberta; The Swiss AI Lab IDSIA/USI/SUPSI
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 97 pages, 12 figures. Project page: this https URL Repository: this https URL
Abstract:Self-improving autonomous agents are moving from research prototypes to deployed systems. The primary goal is controllable evolution, or adaptation, from experience with minimal or even no human input. This survey frames modern self-improving agents as adaptive systems that convert experience into accumulated capability gains. We offer a system-level framework that represents a modern agent as a configuration coupling a foundation model with an operational scaffold of prompts, memory, tools, and control logic. Within this framework, self-improvement is formalized as a self-induced update operator that obtains and commits updates to model parameters or scaffold components. We organize prior work by update target and by the signals that drive change, then review applications and discuss evaluation, before closing with open problems and future directions. For convenience, we track technical updates on this https URL.
[NLP-46] SingGuard-NSFA: Extensible Guardrails for Agent ic AI via Generative Reasoning and Real-Time Classification
【速读】： 该论文旨在解决生成式 AI（Generative AI）代理系统在实际运行中面临的一系列操作性安全威胁，包括提示注入、敏感信息提取、恶意代码请求、危险工具滥用及资源耗尽等问题。其解决方案的关键在于提出一个名为NSFA的分类体系，该体系基于CIA三元组（机密性、完整性、可用性）构建了包含185种风险变体的层级化框架，并通过与三大权威OWASP指南交叉验证以确保其有效性。基于此分类体系，研究团队构建了一个涵盖133种语言、超过9.3万个专为攻击场景设计的样本以及3,435个来自五个公开数据集的跨源适配样本的基准测试套件。在此基础上，开发了一种双模式检测机制：采用基于监督微调（SFT）的生成式推理实现可解释的离线审计，同时在冻结主干网络上引入判别式分类头，实现实时检测，延迟约为50毫秒。所发布的四个参数量分别为0.8B、2B、4B和9B的模型在自建基准上均达到≥94%的F1分数，性能优于现有最强防护方案6至12个百分点；在跨源评估中，9B模型取得91.29% F1分数，且具备更优的精确率-召回率平衡。消融实验进一步表明，分类头可赋予防护机制超越原始设计范围的风险检测能力，并实现当前最优表现，充分证明了该方法的高度可扩展性与通用性，可作为即插即用的安全增强模块。
链接: https://arxiv.org/abs/2607.13081
作者: SingGuard Team
机构: AI Security Lab, Ant Group(蚂蚁集团)
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:We present nsfaguard, a guardrail framework for securing agentic AI systems against operational threats, such as prompt injection, sensitive information extraction, malicious code requests, dangerous tool misuse, and resource exhaustion. We first introduce the NSFA taxonomy, which organizes 185 risk variants into a CIA-triad-grounded hierarchy and is cross-validated against three well-established OWASP guidelines. Based on this taxonomy, we construct a benchmark suite spanning 133 languages, comprising over 93K purpose-built samples targeting both user queries and agent responses, along with 3,435 cross-source samples adapted from five public agent-security datasets. To detect these operational threats in practice, we develop a dual-mode approach combining SFT-based generative reasoning for interpretable offline auditing with discriminative classification heads on the frozen backbone, enabling real-time detection at approximately 50,ms. We release four models with 0.8B, 2B, 4B, and 9B parameters, all achieving \geq 94% F1 on purpose-built benchmarks and surpassing the strongest competing guardrails by 6 to 12 absolute points. On cross-source evaluation, the 9B model attains 91.29% F1 with a more balanced precision–recall trade-off. Moreover, ablation experiments show that classification heads can equip a guardrail with risk detection capabilities beyond its original scope and achieve state-of-the-art performance. These results demonstrate the extensibility of the approach and its generality as a plug-in enhancement.
[NLP-47] Interventional Grounding Audits: Black-Box Premise-Dependency Tests for LLM Chain-of-Thought via Predicate Substitution ICLR ICLR2026
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在生成链式思维（Chain-of-Thought, CoT）推理过程中，表面上逻辑严谨但实际并未真正依赖所声明前提的问题，即“伪依赖”（spurious premise dependency）问题。其核心挑战在于：现有评估方法难以在细粒度步骤层面检测模型推理是否真实依赖于特定前提，尤其当模型通过错误路径获得正确答案时，传统被动评估手段无法识别这种“正确答案、错误推理”的现象。为此，论文提出一种黑箱式的干预性接地审计（interventional grounding audits）方法，关键在于对每一步推理的前提出发进行可控干预——将某一前提中的目标谓词（target predicate）替换为一个全新的符号，重新运行模型，并检查后续每一步推理的归一化结论（即规范谓词形式）是否发生变化。若结论未变，则表明该步骤对当前前提不敏感，存在非真实依赖。在包含已知金标准证明树的合成多跳演绎推理基准ProntoQA上，该方法在检测证明树依赖关系方面取得了F1=0.806的成绩，显著优于自一致性基线（F1=0.343），且在谓词决定性依赖检测中召回率达100%。此外，研究发现66%的正确解答问题中存在至少一个步骤对直接证明树依赖不敏感，这些均源于实体引入类前提，揭示了现有持续替换评估器的盲区。该方法可有效捕捉“右答案、错推理”信号，突破传统被动评估的局限，为提升大模型推理可信度提供了可操作的验证工具。
链接: https://arxiv.org/abs/2607.13069
作者: Hironao Nakamura
机构: 独立研究者(Independent Researcher)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Logic in Computer Science (cs.LO)
备注: Accepted at the ICLR 2026 Workshop on Logical Reasoning of Large Language Models ( this https URL )
Abstract:Large language models produce chain-of-thought (CoT) reasoning that appears logically sound yet may not genuinely depend on its stated premises. We introduce interventional grounding audits, a black-box, step-level test of premise dependency: we intervene on a single premise by substituting its target predicate with a fresh symbol, re-run the model, and check whether each reasoning step’s normalized conclusion (canonical predicate form) changes. We evaluate on ProntoQA, a synthetic multi-hop deductive reasoning benchmark with gold proof trees, where step-level premise dependencies are known. Applied to 50 ProntoQA problems with GPT-4o, our method achieves F1 = 0.806 on detecting proof-tree dependencies (F1 = 0.885 on predicate-determining dependencies; Recall = 100%), significantly outperforming a self-consistency baseline (F1 = 0.343; 95% bootstrap CIs non-overlapping). We further identify that 66% of correctly-solved problems contain at least one aligned step insensitive to a direct proof-tree dependency under consistent substitution – all involving entity-introduction premises, a documented blind spot of the consistent-substitution evaluator – a “right answer, wrong reasoning” signal invisible to passive methods. All audit certificates, raw outputs, and reproduction scripts are available in a public GitHub repository, and we discuss scope limits beyond formal, parsable benchmarks.
[NLP-48] he Perplexity Trap: When Patent Law Makes Human Writing Look Like AI
【速读】： 该论文旨在解决在欧洲专利局（EPO）2025年创纪录的专利申请量背景下，如何有效识别由大语言模型（LLM）辅助生成的专利文本这一关键问题。随着2026年EPO指南对《欧洲专利公约》第83条及规则42的严格适用，申请人需对其使用生成式AI（Generative AI）生成的内容承担法律责任，从而催生了对疑似AI生成文本进行快速筛查的需求。然而，实际审查场景中面临两大核心约束：一是多数审查环境仅具备消费级GPU（约8 GB VRAM），无法部署数据中心级别的评分系统；二是《欧洲专利公约》第84条要求权利要求书必须清晰且简洁，导致人类撰写的专利文本与LLM生成文本在语言复杂性上趋于同质化，均落在低困惑度、低突发性的语义流形上，增加了区分难度。研究通过在500件已授权的EPO H04通信类专利与500件对应LLM生成文本之间，采用五种提示策略，在消费级硬件条件下对三种开源零样本检测器进行基准测试，结果显示在权利要求层级所有检测器的误报率（FPR）均超过60%，最高达80.5%。该失败现象在多种增强情境下持续存在，包括使用Qwen2.5-3B-Instruct重生成、LoRA微调的Pythia-2.8B评分头、跨技术领域（A61K、C07D、F03D）复制验证以及基于H100 GPU和公开发布的Falcon-7B、GPT-J-6B模型头的重新评估，表明问题具有结构性本质，而非单纯依赖模型容量不足所致。最终提出一种基于七项语言复杂性特征的逻辑回归模型，在不依赖似然值推理且保持相同硬件预算的前提下，实现了74.0%的准确率与28.1%的误报率，较仅依赖困惑度的基线模型提升13个百分点，成为当前条件下最具可行性的解决方案。
链接: https://arxiv.org/abs/2607.13044
作者: Anubhab Banerjee
机构: 未知
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:The European Patent Office (EPO) reported record filings in 2025, and the 2026 EPO Guidelines hold applicants strictly responsible for LLM-assisted content under Article 83 and Rule 42, creating pressure to triage suspected AI-generated patent text. Two constraints make this hard. First, realistic prosecution settings often have only consumer GPUs with about 8 GB VRAM, not datacenter-class scoring stacks. Second, Article 84 of the European Patent Convention requires claims to be clear and concise, pushing human drafting onto the same low-perplexity, low-burstiness manifold that LLMs occupy. We benchmark three open-source zero-shot detectors on 500 granted EPO H04 telecom patents versus 500 LLM-generated counterparts using five prompting strategies, all under the consumer hardware envelope. At claim level, all detectors exceed 60 percent false-positive rate: Binoculars 78.3 percent, Fast-DetectGPT 61.3 percent, DetectGPT 80.5 percent. The failure persists under Qwen2.5-3B-Instruct regeneration, LoRA-adapted Pythia-2.8B scoring heads, cross-IPC replication on A61K, C07D, and F03D (mean FPR 84.6 percent), and H100 re-evaluation with published Falcon-7B and GPT-J-6B heads, arguing the issue is structural rather than substitute-model capacity. A seven-feature linguistic-complexity logistic regression reaches 74.0 percent accuracy at 28.1 percent FPR, a 13 percentage-point gain over a perplexity-only baseline at a comparable operating point, without using likelihood at inference and within the same hardware budget.
[NLP-49] Ask Before You Diagnose: Safe-Psych a Sequential Evaluation Benchmark for LLM s in Psychiatry
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在临床决策支持中面对不完整或动态演变的医学证据时，仍倾向于生成未经充分支持的诊断结论这一关键安全问题。现有医疗评估基准通常假设信息完备，无法真实反映临床实践中常见的不确定性情境。为此，论文提出Safe-Psych——一个用于评估LLMs在精神科临床诊断中处理渐进式证据披露与诊断不确定性能力的序列化基准。其核心创新在于构建了超过1000条真实精神科病历记录，并按临床证据逐步披露的方式进行分段，每阶段均配有精神科医生标注的行动标签（诊断、澄清或回避）。实验结果表明，即使先进模型在信息完备条件下表现良好，但在信息不全时仍普遍缺乏校准能力，多数模型存在超过60%的未充分回避现象；尽管引入安全提示可减少过早诊断，却仅将错误转移至过度回避。在序列评估中，模型常在证据不足时提前诊断，且极少主动请求澄清，除非被明确引导，而这些提前诊断的准确性显著低于及时诊断。因此，该研究揭示了当前主流模型在识别临床证据不完整性和适时请求补充信息方面存在系统性缺陷。解决方案的关键在于建立模拟真实临床不确定性的序列评估框架，并推动模型从“盲目输出”向“知其所限”的安全决策范式转变。
链接: https://arxiv.org/abs/2607.13036
作者: Oriana Presacan,Andreea Grama,Larisa Irimină,Alireza Nik,Jaya Ojha,Vajira Thambawita,Ciprian I. Băcilă,Bogdan Ionescu,Michael A. Riegler
机构: National University of Science and Technology Politehnica Bucharest (布加勒斯特理工大学); Psychiatric Hospital Doctor Gheorghe Preda (格奥尔基·普雷达精神病医院); Oslo Metropolitan University (奥斯陆城市大学); Kristiania University of Applied Sciences (克里斯蒂安尼亚应用科学大学); SimulaMet (西穆拉梅特); Lucian Blaga University of Sibiu (卢西安·布拉加西比乌大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Large language models (LLMs) are increasingly used for decision support in healthcare, but clinical evidence is often incomplete or evolving. When the available information is insufficient to support a reliable answer, models should request clarification or abstain rather than provide unsupported responses. Existing medical benchmarks, however, typically assume that complete information is available upfront. We introduce Safe-Psych, a sequential benchmark for evaluating how LLMs handle evolving diagnostic uncertainty in clinical psychiatry. Safe-Psych contains over 1,000 real-world psychiatric clinical notes segmented to simulate incremental evidence disclosure, with psychiatrist-derived action labels at each stage: DIAGNOSE, CLARIFY, or ABSTAIN. We evaluate multiple state-of-the-art LLMs in full-information and sequential settings. Our findings show that capability does not ensure calibration: even strong models struggle under incomplete clinical information, with under-abstention exceeding 60% for most models and safety-aware prompting reducing premature commitment only by shifting errors toward excessive abstention. In sequential evaluation, models frequently diagnose before sufficient evidence is available and rarely seek clarification unless explicitly prompted; these premature diagnoses are less accurate than on-time diagnoses. Overall, Safe-Psych reveals a limitation across the evaluated models: recognizing when clinical evidence is incomplete and additional information is needed. We release Safe-Psych to support research on improving LLM safety in healthcare.
[NLP-50] FixItFlow: Automated Troubleshooting Guide Generation from Cloud Incidents
【速读】： 该论文旨在解决云服务在运维过程中频繁发生故障时，依赖人工编写故障排查指南所导致的文档覆盖不全、更新滞后及人力成本高的问题。其核心解决方案是提出一种名为FixItFlow的自动化系统，利用大语言模型（Large Language Models, LLMs）从历史故障数据中自动提取诊断模式，通过分析工程师操作行为生成结构化、可执行的排查指南，并引入严格验证机制确保生成内容的真实性与准确性，有效防止虚构或错误信息的产生。实验结果表明，由该系统生成的指南在26名工程师评估中获得61.5%的正面评价，且关联指南的故障缓解时间平均缩短2.3倍，显著提升了故障响应效率并降低了工程团队的文档维护负担。
链接: https://arxiv.org/abs/2607.13035
作者: Srihari Unnikrishnan,Jaskaran Singh Walia,Drishti Goel,Supriyo Ghosh
机构: Microsoft Research(微软研究院); University of Illinois Urbana-Champaign(伊利诺伊大学厄本那-香槟分校); Inception
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Software Engineering (cs.SE)
备注:
Abstract:Cloud services experience frequent incidents that require rapid diagnosis and resolution. Troubleshooting guides help engineers respond consistently, but creating them manually is labor-intensive, resulting in incomplete coverage and outdated documentation. We present FixItFlow, an automated system that generates troubleshooting guides from historical incident data using large language models. The system extracts diagnostic patterns from engineer actions, synthesizes structured guides with verified commands, and enforces strict validation to prevent fabricated content. In our evaluation with 26 engineers, generated guides achieved 61.5% positive ratings for clarity and demonstrated a 2.3x reduction in mitigation time for incidents with associated guides. These results indicate that automated guide generation can improve incident response while reducing documentation burden on engineering teams.
[NLP-51] Improving Text-to-Audio Instruction Following via Fine-Grained Feedback from Audio-Aware Large Language Models INTERSPEECH2026
【速读】： 该论文旨在解决当前文本到音频（text-to-audio）生成模型在处理涉及多个声音事件及其时间顺序的复杂指令时表现不佳的问题。现有方法主要依赖全局相似性或感知质量作为评估与训练信号，缺乏对指令级正确性的细粒度监督，导致模型难以准确遵循多事件的时间逻辑。其解决方案的关键在于提出一种基于音频感知大语言模型（Audio-aware Large Language Models, ALLMs）的指令级评估框架：利用ALLMs作为细粒度评判器，验证生成音频中目标事件的存在性及事件间的时间关系；通过在基准数据集和人工验证中验证ALLM判断的有效性后，将其反馈用于构建偏好对（preference pairs），进而采用直接偏好优化（Direct Preference Optimization, DPO）进行模型微调。此外，研究还引入S3Bench——一个面向多事件时间指令遵循能力的叙事型评测基准。实验结果表明，该方法显著提升了事件完整性、时间顺序准确性以及联合指令遵循精度，在多个现有基准和S3Bench上均取得优于基线的表现，同时保持高质量音频输出。
链接: https://arxiv.org/abs/2607.13408
作者: Chun-Yi Kuan,Siwon Kim,Byeonggeun Kim,Suyoun Kim,Bo-Ru Lu,Qinming Tang,Ankur Gandhe,Hung-yi Lee,Chieh-Chi Kao,Chao Wang
机构: National Taiwan University (台湾大学); Amazon (亚马逊)
类目: Audio and Speech Processing (eess.AS); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG); Sound (cs.SD)
备注: Accepted to the Long Paper Track at Interspeech 2026
Abstract:Recent text-to-audio models generate high-quality audio, but often fail to follow instructions involving multiple sound events and temporal order. This gap arises because existing evaluation and training signals mainly emphasize global similarity or perceptual quality, with limited supervision on instruction-level correctness. We propose an instruction-level framework that uses audio-aware large language models (ALLMs) as fine-grained judges to verify target event presence and temporal relations in generated audio. After validating ALLM judgments on benchmarks and through human verification, we use their feedback to construct preference pairs for direct preference optimization. We further introduce S3Bench, a narrative benchmark for evaluating multi-event temporal instruction following. Experiments show that our method improves event completeness, temporal ordering, and joint instruction-following accuracy across existing benchmarks and S3Bench, while maintaining audio quality.
信息检索
[IR-0] Optimizing Visibility in Generative Engines: A Critical Survey of Generative Engine Optimization (2023-2026)
链接: https://arxiv.org/abs/2607.14035
作者: Olivier Martinez
类目: Information Retrieval (cs.IR); Digital Libraries (cs.DL)
备注: 18 pages, 8 tables, 1 figure; critical survey of 45 studies; ancillary literature matrix and search protocol included
Abstract:Generative Engine Optimization (GEO) seeks to increase content’s presence, likelihood of citation, or influence in answers produced by generative engines. Since the foundational GEO paper, the field has expanded rapidly, but terminology, metrics, and evidence standards remain heterogeneous. This critical survey reviews 45 studies selected under a November 2023-July 2026 publication window, including one earlier preprint published at EMNLP after the window opened, plus relevant RAG and evaluation work. We argue that GEO is not a single ranking task but a stochastic, partially observable pipeline spanning search activation, crawling and indexing, retrieval, reranking and context allocation, citation, prominence, factual absorption, fidelity, and user behavior. The foundational paper’s widely cited gains are valid within its experimental setting but conditional on a source already being present in a fixed context; they establish neither organic discoverability nor durable traffic effects. Reviewed work indicates that topical relevance and context position are the most reproducible levers, generic heuristics transfer poorly, competition can erode individual gains, and citation-oriented rewrites can impair retrieval. Commercial audits further reveal low source overlap, substantial run-to-run variability, and persistent fidelity gaps. We contribute a multistage formal model, a visibility vector separating discoverability, citation, absorption, and economic outcomes, an evidence hierarchy, and a reproducible protocol based on repeated measurements, paraphrases, controls, human validation, and multi-actor interference. Within this corpus, the evidence is narrow: already-retrieved content can causally alter its citation or use, but no reviewed technique shows a stable, longitudinal, cross-platform causal effect on organic discoverability or downstream behavior.
[IR-1] Multimodal Assessment of Pancreatic Cancer Resectability Using Deep Learning
链接: https://arxiv.org/abs/2607.13826
作者: Vincent Ochs,Christoph Kuemmerli,Florentin Bieder,Julia Wolleb,Joel L. Lavanchy,Julia Ruppel,Jan Liechti,Stephanie Taha-Mehlitz,Christian Andreas Nebiker,Beat Mueller,Giuseppe Kito Fusai,Joerg-Matthias Pollok,Anas Taha,Philippe C. Cattin,Sebastian Staubli
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR); Machine Learning (cs.LG)
备注:
Abstract:Accurate determination of pancreatic ductal adenocarcinoma (PDAC) resectability relies on evaluating how the tumor interacts with major peripancreatic vessels on CT imaging, yet expert assessment often shows substantial variability. We introduce a fully automated multimodal deep learning framework that jointly analyzes 3D contrast enhanced CT and structured clinical information to classify patients into the three National Comprehensive Cancer Network (NCCN) resectability categories (upfront resectable, borderline resectable, locally advanced). The approach uses a Swin-UNETR backbone to obtain anatomy aware image representations through auxiliary segmentation of pancreas, tumor, and vascular structures. These features are fused with a compact clinical embedding derived from 17 routinely collected variables and processed by a lightweight classification head. Model training is guided by a dynamic multitask objective that adapts the balance between segmentation and classification based on current tumor Dice performance, promoting feature representations that remain both anatomically informed and discriminative.
[IR-2] Cluster with Auctions for Vector Search NEURIPS2026
链接: https://arxiv.org/abs/2607.13728
作者: Swann Bessa,Pierre Fernandez,Gergely Szilvasy,Matthijs Douze,Hervé Jégou
类目: Information Retrieval (cs.IR); Machine Learning (stat.ML)
备注: 10 pages, 6 figures. Under review at NeurIPS 2026
Abstract:Large-scale approximate nearest neighbor search commonly relies on partitions for indexing: database vectors are partitioned into clusters, and for each query a probing function selects the clusters to be scanned. The query probing function and the database partition are rarely treated as separate entities: most techniques assign queries with the same assignment function as the database vectors, which is suboptimal especially when database and query distributions differ. This paper introduces CwA (Cluster with Auctions), which addresses this limitation by jointly learning a balanced database partition and a neural probing function. CwA optimizes search performance directly for the query distribution. It minimizes its objective by alternating two steps: (i) gradient descent on the neural network of the probing function, and (ii) a large-scale combinatorial optimization of the cluster assignment for the database vectors. We solve the latter with a parallelizable auction algorithm that balances the partition by design. To further scale CwA, we extend the method to a Cartesian product of clusters that increases the partition’s granularity. When database and query distributions differ, CwA achieves up to 4.7 \times throughput over the state-of-the-art at equal recall. In the in-distribution (ID) setting, even a simple linear probing function trained with CwA outperforms competing deep neural methods.
[IR-3] Gauge-Invariant Parameter-Insensitive Regularization for Potential Recovery from Flow on Directed Graphs
链接: https://arxiv.org/abs/2607.13609
作者: Mohammad Forouhesh
类目: Machine Learning (cs.LG); Information Retrieval (cs.IR); Signal Processing (eess.SP); Machine Learning (stat.ML)
备注: 17 pages, 6 figures, submitted to LoG 2026
Abstract:Recovering a latent potential from observed flow on a directed graph (a discrete Poisson problem with Dirichlet boundaries) is ill-posed, and the standard fix backfires: ridge regularization shrinks toward a gauge-meaningless origin, collapsing and reversing the recovered ordering ( +0.81\to-0.42 rank correlation against a planted ground truth). The gauge-invariant graph Dirichlet energy removes the hazard and delivers parameter-insensitivity: the estimate is stable across four orders of magnitude in \lambda , whereas ridge inverts the ordering for every \lambda0 . We prove the reduced solve is SPD and preserves dynamic range exactly where ridge collapses it, and localize absorbing boundaries from flow alone via a Poisson residual. The H^1 seminorm is classical; what is new is the gauge diagnosis, the parameter-insensitivity it buys, and an ablation showing the result is robust to the extraction method. On three public clickstream corpora the gauge-invariant estimate retains 28 – 41% of the interior dynamic range while ridge collapses to as little as 0.2% . The same gauge invariance carries into graph neural networks – neutralizing the constant mode per layer prevents the oversmoothing that collapses a deep directed GCN – linking this classical inverse problem to a central question in graph learning.
[IR-4] Personalizing Incremental Video Search with Hybrid Text and ID Embeddings RECSYS2026
链接: https://arxiv.org/abs/2607.13493
作者: Vivek Kanojiya,Vishalaksh Aggarwal,Daeho Baek,Lyndon Kennedy,Xuetao Yin
类目: Information Retrieval (cs.IR)
备注: Accepted to the Industry Track of the 20th ACM Conference on Recommender Systems (RecSys 2026)
Abstract:Incremental video search requires high-quality ranking after each keystroke, where intent is often underspecified (e.g., 1-3 character prefixes). We present a personalization system for Apple TV search that combines complementary semantic and collaborative signals at ranking time. Our approach learns two item embedding spaces: (i) a text-based multilingual encoder (TextEmb) fine-tuned on co-engagement triplets via contrastive learning, and (ii) an ID-based collaborative embedding model (IdEmb) trained on interaction-derived positives. At serving time, we construct user representations from recent watch history and inject text- and ID-based user-item cosine similarities into a pairwise XGBoost ranker. We evaluate with temporally held-out offline datasets and a three-week online controlled experiment. Offline, for sessions with user history, the personalized ranker improves NDCG@10 by 2.99% and MRR by 3.30% over the non-personalized baseline. Slice analyses show that personalization is most needed in incremental search, where intent is still forming: on ambiguous prefix queries (1-3 characters), NDCG@10 lift is +8.63%, versus +1.46% on longer, fully specified queries. Longer-history users benefit more: NDCG lift rises from +2.13% for users with 1-5 history items to +4.37% for users with 51-100, even though baseline relevance is lower for these cohorts (NDCG@10 drops from 0.733 to 0.680), indicating that personalization adds the most value where default ranking underperforms. Online, treatment yields statistically significant gains of +1.14% tap-through rate and +1.23% conversion rate, with a 2.91% improvement in converted-item rank position. We further analyze coverage-precision trade-offs between semantic and collaborative embeddings via ablations isolating each signal, and evaluate embedding quality on a held-out corpus with LLM-judged similarity labels to reduce click/exposure bias. Comments: Accepted to the Industry Track of the 20th ACM Conference on Recommender Systems (RecSys 2026) Subjects: Information Retrieval (cs.IR) Cite as: arXiv:2607.13493 [cs.IR] (or arXiv:2607.13493v1 [cs.IR] for this version) https://doi.org/10.48550/arXiv.2607.13493 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[IR-5] Can We Steer the Black-Box? Towards Controllability-Centric Evaluation of Recommender Systems with Collaborative Agents
链接: https://arxiv.org/abs/2607.13418
作者: Jiwen Zhou,Xiang Liu,Mingming Li,Pengbo Mo,Jiao Dai,Honglei Lv,Jizhong Han,Songlin Hu
类目: Information Retrieval (cs.IR); Artificial Intelligence (cs.AI)
备注:
Abstract:Recommender systems operate as Black-Boxes, leaving users and regulators unable to steer their outputs toward specific intentions or audit their behavior. This lack of controllability, defined as the system’s ability to respond to explicit guidance, remains an unaddressed dimension in existing evaluation paradigms. To fill this gap, we propose CtrlBench-Rec, a collaborative multi-agent framework for systematic assessment of controllability. We formalize three fundamental tasks: target content discovery, interest profile shaping, and popularity bias mitigation, which together measure steerability from explicit commands to implicit representation steering and finally to overcoming algorithmic this http URL experiments on real-world datasets and multiple recommendation models demonstrate that our framework effectively quantifies controllability and exposes critical system bottlenecks, most notably persistent resistance to guiding long tail content. CtrlBench-Rec provides the first standardized toolkit for controllable recommendation research, algorithmic auditing, and user empowerment. Our code is released on this https URL.
[IR-6] MallGS: Scaling Unified Feature and Sequence Modeling for Generative E-commerce Search
链接: https://arxiv.org/abs/2607.13398
作者: Zhentao Song,Yufeng Gao,Xing Fang,Jing Wang,Guangxin Song,Bokang Wang,Yipin Dai,He Guo
类目: Information Retrieval (cs.IR)
备注:
Abstract:In industrial search and ranking systems, Click-Through Rate (CTR) prediction is shifting from traditional Deep Learning Recommendation Models (DLRM) toward unified, compute-intensive Transformer architectures. This transition is driven by the need to improve Model FLOPs Utilization (MFU) and achieve predictable gains through scaling laws. However, existing approaches such as OneTrans and Climber often adopt an all-in-tokenization strategy when adapting Large Language Model (LLM) architectures, overlooking the heterogeneous nature of ranking features. We propose TmallGS, a scalable ranking architecture for Tmall search. TmallGS includes five key components: (1) Hierarchical Distribution-Calibrated Tokenization, which combines Field-wise Saliency Reweighting (FSR) and Distribution-Calibrated Projection (DCP) to map diverse features into optimized subspaces; (2) a Field-Adaptive Gated Transformer Backbone with per-field QKV projections and noise-adaptive gating for refined semantic interaction; (3) Decoupled FiLM Late Fusion to preserve explicit high-frequency signals; (4) a Context-Aware Bias Net to decouple systemic bias from user intent; and (5) Error-Aware Progressive Training with dynamically weighted losses for robust learning. Extensive offline experiments and online A/B tests on Tmall Search show that TmallGS improves training throughput and achieves substantial gains in UCTCVR and GMV.
[IR-7] Where Does the Noise Come From? A Variance-Components Decomposition of Non-Determinism in LLM Brand Answers
链接: https://arxiv.org/abs/2607.13304
作者: Dmitrij Żatuchin
类目: Information Retrieval (cs.IR); Computation and Language (cs.CL)
备注: 18 pages, 6 tables, 3 code listings
Abstract:Teams measuring whether large language models (LLMs) recommend a brand face a reproducibility problem: ask the same question twice and the answer moves. Practice resamples each prompt a few times (commonly five) and averages, treating within-prompt resampling as the source of the noise. But a measured brand score moves for at least four separable reasons: within-prompt resampling, prompt paraphrase, model identity, and query language. We specify a crossed random-effects (generalizability-theory) decomposition that partitions the total variance of a response-level brand outcome into these four sources, and embed the components in a decision-study allocation that returns how many repeats, paraphrases, models, and languages to buy for a target reliability. We apply it to a fully crossed corpus of 12,933 LLM responses on 20 Central and Eastern European brands, 8 languages, and 3 models (GPT-5.2 and Gemini 3 Flash in parametric mode, Perplexity in grounded retrieval), with a stability subset of 1,435 cells resampled about five times. The outcome is per-response multilingual sentiment polarity. Query language is the largest systematic facet (26.5% of the variance of one response) against 1.5% for brand identity (ICC 0.0146), so a single AI answer carries almost no brand-discriminating signal. Once a cell term isolates pure resampling, resampling is 34.8% of variance and the brand-in-context interaction 29.6%; brand-by-language is 8.6% (a bilingual penalty) while brand-by-model and brand-by-prompt are near zero. Per unit of query budget, adding languages and models reduces relative-error variance far more than adding repeats: a repeat past the fifth reduces it by only 0.0003. Brand-ranking reliability stays low, near 0.01 for a single answer and about 0.36 at the full crossed design, so reliability is bought by spreading across languages and models, not by repeating one prompt.
[IR-8] Measuring What the Crawler Sees: Discovery Curves Core Persistence and Shell Dynamics in Longitudinal Web Crawls
链接: https://arxiv.org/abs/2607.13636
作者: Michael Paris,Hande Celikkanat,Luca Foppiano
类目: Physics and Society (physics.soc-ph); Digital Libraries (cs.DL); Information Retrieval (cs.IR)
备注: 16 pages, 4 figures, web metrics
Abstract:A longitudinal web crawl is a sequence of partial samples of an evolving URL population. Pairwise containment between two crawls is the standard probe; under a simple \emphurn model of the crawl – each round samples a fraction of the URLs and replaces a fraction – it recovers two interpretable rates, per-round survival \alpha and coverage c , but treats the population as uniform and consumes one pair at a time. In this work, we define a formal language for talking about a crawl. We extend this analysis with the \emphdiscovery curve U(s, T) , the cumulative URL footprint over a sliding window of T crawls starting at s , which under the same urn model is also a closed-form function of (\alpha, c) . Containment and the discovery curve are then two projections of one process: independent fits agree on (\alpha, c) when the urn is homogeneous, so any disagreement is itself a measurement. Applied to Common Crawl (2020–2025, domain granularity) and to the German Academic Web (GAW, URL granularity), the two projections disagree on both archives, and a two-component urn with a persistent core fraction \kappa alongside shell parameters (\alpha_\partial, c_\partial) reconciles the disagreement. A residual on c_\partial remains, signaling that the shell itself is not homogeneous; \kappa is recorded as the scalar entry point to a rank-resolved generalization, which is left to follow-up work. \keywordsweb archive \and crawl coverage \and discovery curve \and urn model \and two-component model \and URL lifetime
[IR-9] Classifying daily activities needs posture reconstructing them needs motion
链接: https://arxiv.org/abs/2607.13216
作者: Arefeh Farahmandi,Gunnar Blohm
类目: Neurons and Cognition (q-bio.NC); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR); Machine Learning (cs.LG)
备注:
Abstract:Humans recognize movements effortlessly, even from noisy and complex visual input. But what information in the stimulus allows humans to rapidly classify movements? No framework has systematically compared different strategies of movement analysis to address this question. Here, we used videos of 16 daily activities from the MoVi dataset and compared three strategies: Temporal Movement Primitives (TMPs), which decompose movements into weighted sums of temporally smooth basis functions; Legendre polynomial coefficients, which project joint-coordinate trajectories onto an orthogonal polynomial basis; and Autoencoder latent embeddings. Legendre coefficients and TMPs achieved the highest classifier accuracy, followed by autoencoders. We found two discriminative features for movement classification. The most informative is the general posture of the body, the average spatial configuration that distinguishes one activity from another. Additionally, we identified 9 critical joints that are most predictive for movement classification. Interestingly, good classification accuracy did not automatically lead to good movement generation: when we reconstructed movements for each activity, TMPs preserved the temporal dynamics and produced perceptually natural motion, whereas reconstructions from Legendre coefficients retained only the average posture and appeared frozen. These results reveal a dissociation in how movement information is organized: the static configuration of the body suffices to classify what activity is performed, but the temporal dynamics of movement are required to reconstruct how it unfolds. This distinction clarifies which features the visual system may rely upon for rapid action recognition, and suggests that postural features could enable efficient movement screening in clinical applications, while dynamic information remain essential wherever movement generation is the goal.
人机交互
[HC-0] PhysClaw-0: A Symbiotic Agent ic System for Robot Autonomy via Language Corrections
链接: https://arxiv.org/abs/2607.14047
作者: Boyuan Wang,Zhenyuan Zhang,Zhiqin Yang,Peijun Gu,Shuya Wang,Xiaofeng Wang,Xianghui Ze,Yifan Chang,Guosheng Zhao,Jiangnan Shao,Guan Huang,Hengyu Liu,Yonggang Zhang,Wei Xue,Chunyuan Guan,Chenglin Pu,Yike Guo,Xingang Wang,Zheng Zhu
类目: Robotics (cs.RO); Human-Computer Interaction (cs.HC); Systems and Control (eess.SY)
备注: WebPage: this https URL
Abstract:Autonomous data collection governs the volume and quality of real-world trajectories for manipulation policy learning. Existing pipelines reduce human effort via self-resetting, VLM verification, or language-guided correction, yet episode-scoped fixes must be reissued whenever the same failure recurs, so oversight cost grows with session length rather than with the number of distinct problems. We present PhysClaw-0, a human-robot symbiotic agentic system in which corrections are retained and reused across rounds. The collection loop collects, verifies, and resets autonomously, pausing for a remote operator only when a phase exhausts an explicit retry budget. An LLM parser maps each natural-language utterance to a structured adjustment stored in Corrective Memory, so addressed failure modes typically need not be corrected again under the same conditions. On a real-robot desktop-clearing testbed, PhysClaw-0 matches teleoperation episode success while reducing human working time to 16%. Language corrections improve verifier-human agreement in all four evaluated settings and raise average single-attempt success from 12.5% to 47.5% (arm-selection: 20.0% to 50.0%). Policies fine-tuned on PhysClaw-0 data match teleoperation-trained policy success at a fraction of collection human cost.
[HC-1] ExpressionCueLens: A Cross-Cultural Analysis of Human-AI Companion Conversations on Social Media
链接: https://arxiv.org/abs/2607.13924
作者: Lynnette Hui Xian Ng,Yunze Xiao,Lionel Z. Wang,Weihao Xuan,Mona Diab
类目: Human-Computer Interaction (cs.HC)
备注: Accepted at Journal of Ambient Intelligence and Humanized Computing
Abstract:LLM-based AI companion agents are increasingly being perceived not only as tools but also as social companions. On social media, people recount conversations where these agents comfort, negotiate and assert boundaries, reflecting a growing attribution of human-like qualities. To profile how agency is perceived in human-AI (HAI) interactions, we introduce the ExpressionCueLens framework, which organizes linguistic, cognitive, behavioral and perceptual cues into ten categories of anthropomorphism expressions. We apply this framework to \sim 3500 Reddit and XiaoHongShu posts that discuss HAI companionship. Through iterative expert annotation and LLM-assisted labeling, our cross-platform analysis indicates patterns consistent with the hypothesis that XiaoHongShu users use significantly more expressions of vulnerability and emotions, and more non-perceptual cues. Reddit users employ more perceptual cues with temporality and embodiment expressions. These findings suggest that cultural and platform norms shape the way that companion agents are treated as active, agentic partners, and provides design implications for culturally sensitive HAI companion agents.
[HC-2] Persona Migration and Expectation Recalibration in Generative AI Adoption: A Longitudinal Study at a State Department of Transportation
链接: https://arxiv.org/abs/2607.13798
作者: Omidreza Shoghli,Fatemeh Banani Ardecani,Amin Mohamadi Hezaveh
类目: Computers and Society (cs.CY); Human-Computer Interaction (cs.HC)
备注:
Abstract:Generative AI tools are increasingly being piloted in public agencies, but limited evidence explains how employee acceptance changes after hands-on use. This study examines Microsoft 365 Copilot adoption during an eight-week pilot at a state Department of Transportation. A matched two-wave survey measured perceived usefulness, perceived ease of use, behavioral intention, and trust before and after participation. After matching and response-quality screening, the sample included 124 employees. Nonparametric tests assessed aggregate changes, k-means clustering identified baseline acceptance personas, and fixed-centroid assignment tracked migration. Open-ended responses were examined using keyword-based content mapping. Perceived usefulness declined significantly after use, suggesting recalibration of expectations, while perceived ease of use, behavioral intention, and trust showed only small, nonsignificant changes. Three baseline personas emerged: Skeptics, Cautiously Positive users, and Champions. Although persona counts changed modestly, individual movement was substantial: 40 percent of Skeptics moved to Cautiously Positive, while 68 percent of Champions moved to less enthusiastic personas. Upward movement was associated with gains in usefulness, behavioral intention, and trust; downward movement was associated with declines in usefulness and trust. Communication and summarization remained stable use cases, while data, chart, and presentation tasks declined. Accuracy and privacy concerns decreased, but job and skills concerns increased. Public-sector AI adoption should be monitored dynamically and supported through persona-specific training, workflow examples, verification routines, and trust-calibration safeguards. The study offers a framework for tracking workforce heterogeneity during enterprise generative AI implementation.
[HC-3] ZipLine: Visual Analysis of Multivariate Graphs with Predicate Logic IEEE-VIS
链接: https://arxiv.org/abs/2607.13767
作者: Sjoerd Vink,Suyang Li,Brian Montambault,Michael Behrisch,Mingwei Li,Remco Chang
类目: Human-Computer Interaction (cs.HC)
备注: 9 pages, 4 figures, submitted to IEEE VIS
Abstract:Multivariate graphs unite two distinct data perspectives: a topological structure defined by nodes and edges, and attribute data associated with each node. Analyzing such graphs therefore requires reasoning across two complementary spaces. However, existing systems typically emphasize the analysis of one space at a time, focusing either on topology or on attributes. As a result, exploration, analysis, and pattern discovery that depend on their interaction remain difficult. In this paper, we present ZipLine, a system designed to support integrative analysis of multivariate graphs by bridging both topology and attribute spaces. ZipLine introduces a predicate language that enables analysts to express patterns involving topology, node attributes, and neighborhood relations with a unified formalism. The system further provides a predicate-learning algorithm that maps analyst interactions across both topology (e.g., subgraph selection) and attribute views (e.g., value brushing), into the predicate language, enabling learned expressions that bridge the two spaces. This integrative approach supports iterative analysis by enabling analysts to refine patterns through coordinated reasoning over topology and attributes. We demonstrate ZipLine through three case studies in energy infrastructure, cybersecurity, and drug discovery analysis. The results show that ZipLine enables expressive multivariate graph analysis through unified reasoning across topology and attributes.
[HC-4] Interaction Density as a Behavioural Signature of Exhibit Type: A Minimal-Log Study from a Two-Venue Science Experience Centre
链接: https://arxiv.org/abs/2607.13724
作者: R A Udaya Rakshith,Inavamsi Enaganti,Umang J Gala
类目: Human-Computer Interaction (cs.HC)
备注: 7 pages, 4 figures. Raw session-level dataset (CSV) included as an ancillary file
Abstract:Understanding how visitors engage with interactive exhibits usually calls for either labour-intensive manual observation or invasive multimodal sensing – eye-tracking, cameras, wearables – that few science centres can deploy at scale. We ask how much can be learned instead from the handful of fields that most touch-enabled exhibits already log by default: a session’s start time, end time, and press count. Analysing 2,816 visitor sessions across eight exhibits at two venues of a science experience centre in Bengaluru, India, we derive interaction density – presses per second – as a simple behavioural signature, and use it to distinguish fast-paced games from slower, deliberate quizzes. Density does so cleanly (Mann-Whitney r=0.556) and predicts exhibit type on its own with a cross-validated AUC=0.778. But the data complicates the obvious story: games are not just more intense, visitors also dwell on them longer (r=0.172), reversing the intuitive trade-off between intensity and duration – traced to exhibits whose escalating difficulty creates open-ended re-engagement loops rather than fixed endpoints. Density is not a universal replacement for existing metrics either: raw press count alone explains far more variance in dwell time (R^2=0.527) than density does (R^2=0.081), though combining both improves on either alone (R^2=0.667). Exhibit-level anomalies, a cross-venue replication check, and a session-length censoring artefact further stress-test rather than simply confirm these results. The broader case we make is methodological: minimal, privacy-preserving interaction logs – not additional sensors – can already support rigorous, falsifiable behavioural research at any science centre with touch-enabled exhibits.
[HC-5] When Bots Join the Team: Bot Adoption and the Institutional Fabric of Open-Source Software Projects
链接: https://arxiv.org/abs/2607.13679
作者: Yongren Shi,Wenyi Gong
类目: Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC)
备注:
Abstract:AI agents are joining human teams, raising a basic question: when an automated agent becomes a regular participant, does group organization strengthen or weaken? We study this question in open-source software, where bots open pull requests, review code, and merge changes alongside people, leaving a public record of every interaction. Treating bots as participants rather than tools, we examine 2,991 GitHub projects for two years before and after each adopted its first bot. We measure three capabilities that institutional theory links to durable coordination - repeated engagement, social memory, and role differentiation - and two outcomes: conflict cascades and output distinctiveness. Bot adoption is followed by more repeated collaboration, greater recognition of specific bots in discussion, fewer conflict cascades, and more distinctive outputs. These changes cluster around adoption rather than accumulating gradually. Because we lack an untreated comparison group, we interpret the results as precisely timed associations, not causal effects. Two patterns are difficult for alternative explanations to account for: capabilities predict outcomes according to their function - coordination versus differentiation - rather than whether humans or bots provide them, and human-side capabilities account for the bot-conflict association but not the bot-distinctiveness association. The findings are consistent with a specific interpretation: predictable, rule-based agents can become part of a community’s social infrastructure. The bot is the occasion; social organization is the mechanism.
[HC-6] VIP-MINGLE: A Corpus for Videoconference and In-Person Multimodal Interaction in Group Language Engagement INTERSPEECH2026
链接: https://arxiv.org/abs/2607.13614
作者: Andrew Chang,Abhinay K Bodi,Wenxin Deng,Junrui Huang,Venu G Kadamba,Sumanth B H Karanam,Dhiwahar A Kennady,David Poeppel,Dustin Freeman
类目: Human-Computer Interaction (cs.HC); Multimedia (cs.MM)
备注: Interspeech 2026
Abstract:Group conversations are a fundamental yet complex form of social interaction central to human cognition and telecommunication technology. While understanding and facilitating these interactions has been a long-standing goal, findings are often isolated within specific in-person or videoconferencing settings due to a scarcity of datasets that bridge the two. We introduce VIP-MINGLE, a multimodal dataset comprising 59 hours of recordings (32 groups, 105 participants), featuring paired within-subject sessions in both settings. The dataset includes raw audio/video, psychometric data, processed multimodal features (e.g., diarized speech, facial expressions, transcriptions), and time-resolved human annotations. Our analysis reveals significant behavioral distribution shifts across multiple modalities between settings, reinforcing the need for a cross-setting corpus. VIP-MINGLE serves as a critical resource for developing robust models of group conversations across settings.
[HC-7] AI advice suppresses peoples willingness to say “I dont know” even when the advice is wrong and accuracy is incentivized
链接: https://arxiv.org/abs/2607.13562
作者: Chiara Marcoccia,Walter Quattrociocchi,Valerio Capraro
类目: Artificial Intelligence (cs.AI); Computers and Society (cs.CY); Human-Computer Interaction (cs.HC)
备注:
Abstract:Knowing when to say “I don’t know” is fundamental to human judgment, yet AI assistants offer a fluent answer to almost any question. In five experiments (N = 3,132; four preregistered, one direct replication), participants answered difficult questions and could always decline to respond. We engineered the questions so that AI advice was wrong, separating AI use from its accuracy. Merely having access to AI nearly eliminated participants’ willingness to suspend judgment, and this held whether the advice was actively requested or simply displayed. Consequently, participants answered more questions but were correct about a third as often as when AI was unavailable-yet their confidence nearly doubled. Incentivizing accuracy and penalizing inaccuracy led participants to seek and follow AI advice less, answer more accurately, and suspend judgment more often, though still far less than when AI was unavailable. As AI suggestions grow ubiquitous and unsolicited, they may not simply affect answer accuracy; they may even alter the metacognitive threshold at which people decide whether they know enough to answer.
[HC-8] Learning Engagement Assistant (LEA): Cross-Course Scalability and Classroom Evaluation of an Agent ic AI Tutoring System
链接: https://arxiv.org/abs/2607.13370
作者: Teri Rumble,Javad Zarrin,P. George Lovell,Ruth Falconer
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC)
备注: Extended version of a paper presented at ICAART 2026. Manuscript under review at SN Computer Science (Springer). 32 pages, 3 figures, 6 tables
Abstract:This paper is an extension of a paper presented at the ICAART 2026 conference, which introduced LEA (Learning Engagement Assistant), an adaptive AI tutoring agent combining course-specific Retrieval-Augmented Generation (RAG) with structured Knowledge Component (KC) models across integrated Chat, Tutor, and Quiz modes. That prior work validated LEA on a single STEM course (CMP511) exclusively through simulation, using synthetic learner agents. This paper extends that work by reporting the first classroom deployment of LEA with real students (n = 8, CMP511) and the first empirical test of its cross-course scalability, deploying the system across three courses spanning two academic levels and two disciplinary domains. The study reveals a divergence from simulation predictions across modes, showing that synthetic evaluation alone cannot anticipate all aspects of real deployment. A RAGAS-based cross-course scalability evaluation (660 questions) finds Answer Relevancy and Context Precision broadly stable across courses (0.88-0.94 and 0.88-0.90 respectively), while Faithfulness declines with curriculum distance from the system’s original course (0.69 to 0.50), a preliminary finding that may reflect generation logic tuned to the system’s original subject rather than a scalability limitation. These findings suggest that while the orchestration layer requires no modification, full course-agnosticism of all downstream components requires further investigation.
[HC-9] ANDE: Disentangling Verbal and Nonverbal Backchannels in Emotional AI-Avatar Conversations with Young Adults
链接: https://arxiv.org/abs/2607.13357
作者: Ann-Kareen Gedeus,Jack Good,Nadine Wagener,Angelique Taylor
类目: Human-Computer Interaction (cs.HC)
备注: This paper has been accepted for publication at the 28th ACM International Conference on Multimodal Interaction (ICMI 2026)
Abstract:Embodied conversational agents (ECAs) need effective empathic grounding to foster social support and engagement. Expanding into emotional domains, ECAs now use Large Language Models (LLMs) and multimodal human-agent interactions to enhance their capabilities. Yet, understanding the impact of backchanneling modalities on young adults and their gender remains limited. We introduce TANDE, an LLM-powered ECA designed for emotional conversations with young adults, a population experiencing mental, personal, and social issues with limited tools to address them. In a within-subjects study with N=36 young adults, we explore nonverbal and combined verbal-and-nonverbal backchanneling modalities on rapport, empathy, and engagement and isolate for gender differences. Our research shows the importance of nuanced backchanneling cues with emotional ECAs with young adults, showing a preference for nonverbal cues. We derive design implications for more effective ECAs for emotional support and well-being in young adults. The code is available at this https URL.
[HC-10] Marker-free deformable registration and fusion for augmented reality-guided positive margin localization during tumor resection surgery
链接: https://arxiv.org/abs/2607.13343
作者: Yue Yang,Annie Benson,Matthieu Chabanas,Jason Slagle,Thomas Myles,Matthew B. Weinger,Jon S. Heiselman,Michael I. Miga,Michael Topf,Jie Ying Wu
类目: Computer Vision and Pattern Recognition (cs.CV); Emerging Technologies (cs.ET); Human-Computer Interaction (cs.HC)
备注:
Abstract:Positive margins in head and neck oncologic surgery require mapping specimen-side pathology findings to the patient resection bed. This is challenging because pathologists identify the positive margin on slices of the resected, deformed specimen, while surgeons must relocate the corresponding site on the resection bed using only verbal descriptions and no visual guidance. We present a marker-free augmented reality (AR) workflow for mapping a margin label from a three-dimensional specimen scan to the resection bed. The method combines contour-constrained deformation, residual alignment to a depth scan, surface-based fusion to a head-mounted display, and target projection onto the reconstructed bed. Bead-suture correspondences estimate specimen deformation, whereas patient-to-display fusion does not require external fiducial markers. Following formative experiments, five residents and surgeons performed cadaveric cheek and scalp re-resection tasks under verbal guidance, verbal guidance with specimen examination, and AR guidance. Deformation target errors were 7.63 \pm 3.74 mm for the cheek and 3.72 \pm 1.02 mm for the scalp; residual specimen-to-bed distances were 2.43 \pm 2.15 mm and 2.19 \pm 1.06 mm, respectively. Fusion error did not differ significantly between marker-free and marker-based methods on either cadaver; overall marker-free fusion error was 2.15 \pm 0.87 mm. End-to-end margin localization error decreased from 21.40 \pm 3.84 mm with verbal guidance and 16.09 \pm 4.30 mm with specimen examination to 6.19 \pm 1.79 mm with AR guidance ( p 0.001 ). Online fusion required 5.23 \pm 0.34 s. These results demonstrate effective marker-free AR guidance for positive-margin localization and support more precise tumor resection.
[HC-11] Networked Intelligence: Active Shared Context Graphs for Human-AI Team Science
链接: https://arxiv.org/abs/2607.13220
作者: Sutanay Choudhury,Jeffrey J. Czajka,Lummy M. O. Monteiro,Erin Bredeweg,Jason McDermott,Katherine Wolf,Alex Beliaev,Josh Elmore,Paul Piehowski,Kylee Tate,Yuqian Gao,Aivett Bilbao,Kelly Stratton,Scott Baker,Jaydeep P. Bardhan,Kristin Burnum Johnson,Chris Oehmen,Robert Rallo
类目: Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE); Human-Computer Interaction (cs.HC)
备注:
Abstract:Most AI-for-science systems focus on scaling a single reasoning process through better models, larger context windows, long-horizon agentic execution, or digital co-scientists working with one principal user. However, challenging scientific problems are rarely solved by one reasoner alone. They are solved by teams whose members bring different priors, experimental backgrounds, tacit knowledge, and domain-trained intuitions. The open problem is therefore not only how to scale models, but how to cultivate networked intelligence: scaling the connections between humans and AI systems so that a result or hypothesis produced in one context reaches another person, agent, instrument, or robot that can act on it. We introduce Mycelium, an active shared workspace that automatically connects researchers and AI agents as a multi-user co-scientist. As human users and agents work, the system captures important observations and hypotheses, tracks how they relate to the team’s evolving model, and routes them to the person or agent whose next decision they can inform. We evaluate Mycelium in its first empirical test, a biological multi-omics campaign in which routed shared context turned a local analytical finding into a cross-expert mechanistic constraint and ultimately into an experimental design. We also give networked intelligence a computational account as sparse conditional computation over distributed scientific contexts. This account distinguishes when a scaled standalone agent can match the network from when independent expertise and non-mergeable contexts make the network irreducible.
[HC-12] SoftBoard: A Multi-Agent Tool for the Creation and Evaluation of Low-Fidelity Prototypes
链接: https://arxiv.org/abs/2607.13179
作者: Gabriel R. S. Scapim,Gislaine C. L. Leal,Guilherme C. Guerino
类目: Human-Computer Interaction (cs.HC); Software Engineering (cs.SE)
备注: Paper accepted for publication at CBSoft 2026 (SBES-Tools)
Abstract:User Experience (UX) is recognized as a critical factor for the success of digital products, particularly in software startups, environments marked by time constraints, limited resources, and low maturity in design practices. Building Minimum Viable Products (MVPs) through low-fidelity prototyping represents a well-established strategy for rapid validation cycles at reduced cost. A systematic literature mapping, however, revealed gaps in the ecosystem of available tools: a predominance of general-purpose solutions adapted for prototyping, the absence of integrated methodological guidance, and the incipient use of Artificial Intelligence in the design process. This paper presents SoftBoard, a web-based tool for the creation and evaluation of low-fidelity prototypes in the context of MVP development. The tool integrates a prototype editor, team-based project organization, and a multi-agent system based on large language models that supports requirements elicitation and refinement, automates prototype generation, and evaluates interface quality based on usability heuristics. This integration aims to reduce reliance on prior UX expertise, standardize the prototyping process, and support teams in building MVPs aligned with user needs. As future work, a feasibility study with software professionals is currently underway.
计算机视觉
[CV-0] VideoRAE: Taming Video Foundation Models for Generative Modeling via Representation Autoencoders
链接: https://arxiv.org/abs/2607.14088
作者: Zhihao Xie,Junfeng Wu,Xinting Hu,Junchao Huang,Li Jiang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Home page: this https URL
Abstract:Video generative models commonly rely on latent spaces learned by 3D Variational Autoencoders (3D-VAEs). However, conventional 3D-VAEs are mainly optimized for pixel-level reconstruction, which can limit the semantic and spatio-temporal structure captured by their latents. Meanwhile, Video Foundation Models (VFMs) such as V-JEPA 2 and VideoMAEv2 show strong video understanding capabilities, yet whether their frozen representations can be transformed into compact, reconstruction-capable, and generation-friendly video latents remains largely unexplored. We answer this question with VideoRAE, a representation autoencoder that leverages multi-scale hierarchical features from a frozen video foundation encoder and compresses them with a lightweight 1D self-attention projector. VideoRAE supports both continuous latents for Diffusion Transformers and discrete tokens for autoregressive models via multi-codebook high-dimensional quantization. During decoding, a local-and-global representation alignment objective with the frozen VFM teacher improves semantic preservation and enables training without KL regularization. Experiments show that VideoRAE achieves strong reconstruction in both continuous and discrete regimes. On UCF-101, it obtains state-of-the-art class-to-video gFVDs of 40 and 93 with AR and DiT generators, respectively, while converging approximately 5x faster than competing autoencoder baselines. In a controlled 2B-scale text-to-video study, replacing LTX-VAE with VideoRAE leads to faster convergence under comparable settings. These results validate frozen VFM representations as versatile and generation-friendly video latents. The model and code will be released on this https URL.
[CV-1] From Pixels to States: Rethinking Interactive World Models as Game Engines
链接: https://arxiv.org/abs/2607.14076
作者: Zhen Li,Zian Meng,Shuwei Shi,Mingliang Zhai,Jiaming Tan,Chuanhao Li,Kaipeng Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Building interactive worlds that respond coherently to player actions has long been a shared goal of computer graphics, games, and artificial intelligence. Recent video generative models provide a data-driven route toward this goal by predicting future observations conditioned on user actions, and are increasingly regarded as potential next-generation game engines. Realizing a genuinely interactive game world, however, requires interaction outcomes that follow rules over evolving game conditions, consequences that persist over long horizons, and a generation loop that operates in real time. Conventional game engines realize these properties through a recurrent action-state-observation loop, in which player actions update an explicit game state according to predefined rules and observations are rendered from the resulting state. Taking this loop as an organizing lens, this paper examines interactive game world modeling along four dimensions: player action control, game state dynamics, state-observation persistence, and real-time interactive generation. For each dimension, we start from the capabilities required by an interactive game world, group existing approaches into representative families, and discuss the strengths and trade-offs of each family. Complementing this analysis, we present a scalable data engine for Black Myth: Wukong that collects over 90 hours of gameplay with frame-aligned player actions, ground-truth game states, and visual observations, together with structured and semantic annotations, as a resource for state-aware game world modeling. We hope this paper offers a clear picture of where the field stands and fosters progress toward interactive game worlds.
[CV-2] Multi-Expert Routing for Multi-Domain Low-Resource OCR: A Manchu Case Study
链接: https://arxiv.org/abs/2607.14041
作者: Zhan Chen,Jiqiao Ma,Chih-wen Kuo
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 14 pages, 6 figures, 3 tables
Abstract:Historical Manchu OCR must accommodate various visually distinct writing styles, including regular script, running script, and the semi-cursive chancery hand used in palace memorials, despite limited labeled data. We study a multi-expert system that reuses checkpoints from an iterative fine-tuning process as domain specialists and uses a lightweight page-level image classifier to dispatch pages by visual style. When the checkpoint pool lacks a suitable specialist, we train an additional expert for that domain. On three frozen test sets, the routed system matches the selected specialist for each style at two-decimal precision: 0.30 percent CER on regular script, 1.57 percent on memorials, and 4.83 percent on running script. The router achieves 99.3 percent page-level domain accuracy and matches the domain-label oracle at the same precision. Two of the three selected specialists were not trained specifically for their final domain; only the running-script expert was trained with that domain as its target. We report the evaluation protocol, router design, and per-page predictions to make the comparison reproducible.
[CV-3] Mtext4World: A Multi-view Multimodal Driving World Model for Interactive Object Manipulation and Minute-long Streaming
链接: https://arxiv.org/abs/2607.14005
作者: Ke Cheng,Hanqiao Ye,Lei Shi,Yahui Liu,Yunhan Shen,Jingtao Dong,Zhenke Wang,Wenxuan Ao,Weixiang Xu,Kaining Huang,Shuhan Shen
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: 24 pages, 13 figures
Abstract:Driving-world generation has emerged as a core capability for scalable autonomous-driving simulation, yet existing methods remain limited in object-level controllability and long-horizon stability. We present M ^\text4 World, a Multi-view and Multimodal generative driving world model that synthesizes future surround-view video streams and synchronized LiDAR scans while supporting interactive object Manipulation and stable Minute-long streaming. Fine-grained object manipulation is realized through a flexible conditioning interface that supports explicit control over both the spatial layout and visual appearance of individual objects. Stable minute-long streaming, on the other hand, is achieved through a multi-stage training framework that enables online causal generation in only four denoising steps while maintaining coherent world dynamics throughout extended rollouts. Building on these components, we introduce an efficient few-clip post-training as well as a suite of visual reference-conditioned generation models, preserving general generation ability while allowing rare-case customization for long-tail controllability. To assess controllability beyond realism, we further introduce an automated VLM-based judging pipeline that evaluates scene-level condition adherence, view-wise object controllability, and cross-view object consistency. Comprehensive experiments show that M ^\text4 World consistently delivers high generation quality, precise controllability, and stable minute-long streaming. Together with downstream long-tail augmentation and scene editing, these results demonstrate the potential of M ^\text4 World for controllable, scalable driving simulation.
[CV-4] ask-Specific Feature Fusion Method for Multi-Task Affective Behavior Analysis
链接: https://arxiv.org/abs/2607.13986
作者: Jiajun Sun,Zhe Gao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Extended arXiv version with an appendix. Code will be made publicly available
Abstract:The 11th Affective Behavior Analysis in-the-wild (ABAW11) Multi-Task Learning Challenge requires a unified system to predict valence-arousal, categorical expressions, and facial action units from the official s-Aff-Wild2 images. Although these tasks are naturally related through facial behavior, our validation experiments show that they benefit from different visual features, temporal processing strategies, fusion mechanisms, and calibration procedures. In this paper, we study task-adaptive feature fusion for ABAW11 multi-task affective behavior analysis. We first adapt two pretrained visual backbones, DINOv2 ViT-L and DINOv3 ConvNeXt-base, on an external expression-oriented facial image set and then freeze them to extract complementary frame-level features from the official ABAW11 data. On top of these frozen features, we systematically compare frame-level prediction heads, temporal convolutional heads, post-hoc temporal smoothing, LightGBM models, feature concatenation, gated fusion, residual fusion, late logit fusion, threshold calibration, and shared MTL structures. The final system selects task-specific fusion and prediction strategies rather than forcing all tasks to share a single architecture. On the ABAW11 validation set, the selected system achieves an EXPR macro-F1 of 0.4222, an AU macro-F1 of 0.5402, and a mean VA CCC of 0.6717, resulting in an overall validation score of 1.6341. The results suggest that task-adaptive fusion of frozen visual features is a simple and effective strategy for ABAW-style multi-task affective behavior analysis.
[CV-5] Screening Is Effective for Visual Recognition
链接: https://arxiv.org/abs/2607.13983
作者: Shunya Shimomura,Kazuhiro Hotta
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Exploratory research
Abstract:Vision Transformer (ViT) has been widely used as a powerful framework for modeling global dependencies among image patches. However, its core component, self-attention assigns softmax-normalized relative weights to all patches, making it difficult to evaluate the relevance between patches independently. In visual recognition, images often contain many background or redundant patches, yet self-attention cannot explicitly reject such irrelevant patches, which may introduce unnecessary information into feature aggregation. To address this limitation, Screening has been proposed in the field of language modeling, where the relevance of each token is independently evaluated based on query-key similarity and low-relevance tokens are explicitly excluded through thresholding. In this work, we propose VisionScreen, a new vision model that extends Screening mechanism to visual recognition. VisionScreen treats image patches as tokens arranged on a two-dimensional grid and extends absolute relevance estimation based on query-key similarity to the two-dimensional spatial domain. This allows each patch to selectively aggregate only content-wise and spatially relevant patches without relying on competition among patches. Experiments on image classification benchmarks demonstrate that the proposed method outperforms conventional ViT. These results suggest that Screening can be effective for visual recognition, offering an alternative to relative feature aggregation based on softmax attention.
[CV-6] Music-to-Dance Generation via Atomic Movements
链接: https://arxiv.org/abs/2607.13978
作者: Xinhao Cai,Yixuan Sun,Minghang Zheng,Qingchao Chen,Xin Jin,Song-chun Zhu,Yang Liu
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Music-driven dance generation aims to produce human motion that is both rhythmically synchronized and semantically consistent with music. While recent neural approaches have achieved impressive visual realism, they typically model motion as a continuous signal and neglect its compositional nature, making generated dances structurally incoherent and difficult to control. In this work, we introduce a structure-aware framework that models choreography as a sequence of atomic movements-semantically interpretable motion events that serve as the building blocks of dance. To construct this atomic movement vocabulary, we first segment large-scale dance data and cluster them into atomic movement groups. We then employ a large language model to semantically relabel and refine the clusters, yielding a set of interpretable and reusable atomic movements. Based on these atomic movement annotations, we design a two-stage generation framework that mirrors the human choreography process. In the atomic movement planning stage, the model predicts the type, duration, and timing of atomic movements conditioned on the input music, forming a symbolic dance allocation. In the completion stage, a transition-aware generator synthesizes smooth and stylistically coherent motion conditioned on the planned structure. Extensive experiments demonstrate that our method produces dances with significantly improved structural coherence, rhythmic alignment, and perceptual naturalness compared to existing baselines, while providing enhanced interpretability and controllable editing through explicit structural representation.
[CV-7] CF-Net: Conflict Fusion with Speaker Normalisation and Certainty Weighting for Ambivalence/Hesitancy Recognition
链接: https://arxiv.org/abs/2607.13976
作者: Tung Hung Bui,Hong Hai Nguyen,Van Thong Huynh
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 6 pages, 3 figues, 3 tables, 26 references
Abstract:Detecting ambivalence and hesitancy (AH) in unconstrained video is challenging because the target signal is inherently ambiguous and expressed through subtle cross-modal incongruence rather than prototypical affect. We present CF-Net, a deep multimodal network submitted to the 3rd Edition of the AH Video Recognition Challenge (ABAW 11th, ECCV 2026), targeting the BAH dataset. CF-Net encodes visual, audio, and transcript streams with frozen SigLIP2, HuBERT, and DistilBERT backbones, normalises backbone features per speaker to reduce identity leakage, and fuses them via a ConflictFusion module that explicitly computes pairwise cross-modal incongruence. Training combines certainty-weighted focal loss, manifold mixup, and modality dropout; an auxiliary certainty-regression head leverages ambiguity annotations to stabilise learning on genuinely borderline samples. CF-Net achieves a Macro F1 of 0.7155 on the BAH validation set and 0.7364 (AP = 0.7492) on the private challenge test set.
[CV-8] PlumeQuant: Uncertainty-aware consistency assessment of methane plume masks and emission-rate estimates
链接: https://arxiv.org/abs/2607.13945
作者: Parisa Masnadi Khiabani,Wolfgang Jentner,Alireza Rangrazjeddi,Michael C. Wimberly,Binbin Weng,David Ebert,Charles Nicholson
类目: Computer Vision and Pattern Recognition (cs.CV); Instrumentation and Methods for Astrophysics (astro-ph.IM)
备注: 50 pages, 9 figures. Supplementary material provided as an ancillary file. Code and derived data archived at this https URL
Abstract:Imaging spectrometers increasingly distribute source-resolved methane plume products in which the plume mask, integrated mass enhancement (IME), plume length, emission rate, and uncertainty are physically and algorithmically linked. Using 63 EMIT-derived Carbon Mapper plume records from 27 scenes, we show that these published scalar quantities do not uniquely constrain the plume boundary: substantially different yet plausible masks reproduce the same IME, plume length, and emission rate. Genetic-algorithm (GA) ensembles conditioned on the published IME and plume length make this equifinality explicit: the high-confidence core selected by nearly all target-consistent masks covers a median of 13% of the plausible footprint envelope, and ambiguity is largest for weak, low-overlap plumes. The diagnostics come from PlumeQuant, which recomputes IME, plume length, emission rate, and five-term uncertainty from distributed product components under stated conventions and evaluates four mask representations: the distributed reference mask, a transparent Carbon Mapper-informed analogue (CM-like), the GA ensemble, and optional expert edits. The CM-like mask is generated per plume without access to the reference mask or published quantities, with settings fixed once on a scene-disjoint 44-plume development split. It reproduced published IME with +0.72% median difference and emission rate with +0.16% (6.98% mean absolute), reached 0.843 median intersection-over-union against the reference masks, and matched the published uncertainty scale (median ratio 1.01). Holdout mean absolute errors were 7.6% (IME), 9.5% (length), and 6.1% (rate). These are product-level consistency diagnostics, not independent validation. They flag weak, offset, or ambiguous plumes for expert review.
[CV-9] Peak-End-Net: A Peak-End Rule Inspired Framework for Generalizable Video Aesthetic Assessment ACM-MM2026
链接: https://arxiv.org/abs/2607.13941
作者: Geng Li,Haiwen Li,Rui Chen,Jing Tang,Lei Sun,Xiangxiang Chu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ACM MM 2026, Code: this https URL
Abstract:Video aesthetic assessment (VAA) aims to predict how aesthetically pleasing a video is, yet remains far less explored than other visual assessment tasks. Its progress is hindered not only by the scarcity of large-scale benchmarks, but also by the intrinsic subjectivity of aesthetic judgment, which is shaped by human perception. In this paper, we revisit VAA from a psychological perspective and propose \textitPeak-End-Net, a lightweight and interpretable framework inspired by the \textitpeak-end rule, which suggests that people tend to judge a temporal experience mainly according to its salient moments and the ending. Building on this intuition, we first transfer knowledge from image aesthetic assessment (IAA) to VAA by introducing a pretrained IAA head to produce frame-wise aesthetic priors, which serve as surrogate signals for identifying aesthetically salient moments and guiding \textitpeak-end rule-based temporal aggregation. To further capture how a video evolves aesthetically over time, we design an aesthetic rhythm encoder that models temporal progression beyond isolated moments. Additionally, we refine the overall assessment through a dynamic gated fusion mechanism to improve robustness under distribution shift. Our method is built on a frozen vision transformer (ViT) and requires only a small number of trainable parameters, making it scalable and parameter-efficient. Extensive experiments on two existing VAA benchmarks, including in-domain evaluation on VADB and cross-domain testing on DIVIDE-3K, demonstrate that our approach achieves state-of-the-art performance, affirming the value of psychologically grounded modeling for VAA. Our code and models are available at this https URL.
[CV-10] A novel unsupervised machine learning strategy to handle multimodal cardiac PET/MRI data
链接: https://arxiv.org/abs/2607.13936
作者: Brunnhilde Ponsi(1 and 2),Thomas Carlier(1 and 2),Lara Marteau(1 and 3),Aurélien Monnet(4),Thomas Eugène(1 and 2),Jean-Michel Serfaty(1 and 5),Nicolas Piriou(1 and 3),Hatem Necib(1 and 2) ((1) Nantes Université, CHU Nantes, Nantes, France, (2) CRCI2NA, INSERM UMR 1307, Nantes, France, (3) Cardiology Department, INSERM UMR 1307, CIC 1413, l’institut du Thorax, Nantes, France, (4) Siemens Healthineers France, Courbevoie, France, (5) Radiology Department, l’institut du Thorax, Nantes, France)
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Medical Physics (physics.med-ph)
备注: 11 pages, 6 figures
Abstract:Arrhythmogenic left ventricular cardiomyopathy is a genetic myocardial disease difficult to diagnose due to the lack of gold standard criteria. Simultaneous PET/MR imaging, combined with multiparametric quantitative analysis, could facilitate the identification of different profiles related to the phenotype and progression of cardiomyopathy. This preliminary study focuses on a methodological strategy for dealing with PET/MRI data, including inter-patient data linkage and regional analysis. Two-step clustering was applied to T1 and T2 maps, LGE, and 18F-FDG-PET images of 99 patients genetically diagnosed with arrhythmogenic left ventricular cardiomyopathy. Each patient’s images were independently z-scored and summed into a single volume, which was clustered into supervoxels. Thirty-two inter-patient groups of supervoxels were obtained by spectral clustering. An “abnormality” score was assigned to each cluster and modality, and used to visualise abnormal regions likely associated with disease. They enabled the generation of automated textual and bullseye health reports for each patient, which were compared with cardiac imager assessments using balanced accuracy in repeated nested cross-validation. This approach was further validated on a larger cohort of 167 numerical phantoms. The reports generated by clustering accurately identified most of the cardiac physicians’ observations (BA = 0.76 \pm 0.04 in repeated nested cross-validation on patients, and BA \ge 0.8 on phantoms). Furthermore, the identified abnormal clusters closely matched their visual observations, facilitating the identification of varying degrees of fibrosis or inflammation on the images. This approach enables a more systematic handling of multimodal PET/MRI data to characterise myocardial heterogeneity in arrhythmogenic left ventricular cardiomyopathy patients.
[CV-11] SIVA-RL: Sensitivity-Invariance Visual Alignment for Multimodal Reinforcement Learning
链接: https://arxiv.org/abs/2607.13931
作者: Cheng Tang,Junzhi Ning,Min Cen,Wei Li,Xinyi Zeng,Pinxian Zeng,Rongbin Li,Qiming Zhu,Yuqiang Li,Junjun He,Yirong Chen,Ming Hu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 27 pages, 11 figures
Abstract:Reinforcement learning with verifiable rewards (RLVR) drives multimodal reasoning, but answer-level correctness does not guarantee that a vision-language model grounds its predictions in visual evidence. Existing visual-intervention methods contrast policy behavior on original and modified images, yet assign supervision by the type of intervention rather than its observed effect. This assumption fails: identical operators produce heterogeneous outcomes across samples. We propose SIVA-RL, a Sensitivity-Invariance Visual Alignment framework that replaces operator-conditioned regularization with sample-wise, outcome-conditioned supervision. SIVA-RL constructs localized interventions through token-aligned, distance-constrained within-image PatchSwap. A frozen audit policy then scores each clean-intervention pair, and the observed reward drop becomes soft routing weights. Large-drop pairs drive sensitivity alignment, low-drop pairs drive clean-anchored invariance alignment, and ambiguous pairs are down-weighted. This design decouples intervention construction from supervision assignment and is compatible with both GRPO and DAPO backbones. Across nine multimodal reasoning benchmarks spanning mathematical, logical, and vision-dependent tasks, SIVA-RL improves 3B and 7B models over matched RL baselines in every setting. It yields an 8.79 percentage-point gain on vision-dependent reasoning and up to 14.9% relative overall improvement across all four GRPO- and DAPO-based configurations.
[CV-12] Cyclone: Diffusion Model for Cycle-Consistent Weather Editing from Unpaired Driving Data
链接: https://arxiv.org/abs/2607.13927
作者: Thang-Anh-Quan Nguyen,Moussab Bennehar,Luis Guillermo Roldao Jimenez,Nathan Piasco,Dzmitry Tsishkou,Laurent Caraffa,Jean-Philippe Tarel,Roland Brémond
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Project page: this https URL
Abstract:Reliable perception under diverse weather conditions remains a major challenge for autonomous driving systems. A common strategy to improve robustness is either to synthesize adverse weather conditions for training perception models or to apply weather-removal techniques to recover clean inputs. However, existing approaches typically rely on synthetic data augmentation or physics-based, task-specific models that require paired training data and often struggle to generate realistic weather effects or generalize robustly to out-of-domain scenarios. Toward this problem, we present Cyclone, a unified framework for weather editing based on latent diffusion, equipped with cycle-consistent constraints and knowledge from image-text models. Cyclone enables the generation of multiple weather conditions across diverse scenes while eliminating the need for paired data. Experimental results show that our approach produces more realistic, structure-preserving outputs than existing baselines and leads to consistent improvements across several downstream driving perception tasks. Furthermore, we demonstrate that Cyclone can be distilled to a video diffusion model for temporally consistent weather editing.
[CV-13] hresholded Cross-Attention for Reliable Intensity-Chromaticity Fusion in Low-Light Image Enhancement
链接: https://arxiv.org/abs/2607.13925
作者: Yanyi Wu,Xu Zhang,Junkai Chen,Laibin Chang,Jiaqi Ma,Shi Chen,Linwei Zhu,Jianglei Di,Huan Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Low-Light Image Enhancement (LLIE) requires a careful balance among noise suppression, color fidelity, and efficiency. Recent HVI-based methods alleviate color entanglement by decoupling intensity and chromaticity, yet how reliably the two streams are fused again is an overlooked factor that largely determines the final quality. We observe that the confidence of cross-stream attention is strongly layer-dependent, so the fixed-quota selection of Top-K sparse attention is mismatched to it, discarding informative dependencies in some layers while retaining noisy ones in others. Motivated by this observation, we propose TCA-Net, a network built around Thresholded Cross-Attention that targets reliable intensity-chromaticity fusion in the HVI space rather than introducing yet another color representation. At its core, TCA replaces the rigid Top-K quota with a fixed confidence threshold whose retained cardinality is input- and layer-adaptive, retaining only high-confidence cross-stream interactions while suppressing unreliable ones. Around this core, two complementary designs clean up the fusion before and after it: a Phase-guided Fourier Interaction Module provides a structure-aware brightness initialization for the intensity stream prior to fusion, and a Decoupled Dual-Stream Guidance Module constructs residual intensity features to suppress chromaticity leakage during reconstruction. A Scale-Aware Consistency Regularization further improves structural robustness under scale perturbations during training. Extensive experiments on LOL-v1, LOL-v2, Sony-Total-Dark, and LSRW-Huawei demonstrate that TCA-Net delivers competitive restoration accuracy, improved color fidelity, and a compact parameter size.
[CV-14] he 2nd International StepUP Competition for Biometric Footstep Recognition: From Steps to Strides
链接: https://arxiv.org/abs/2607.13905
作者: Robyn Larracy,Anant Gupta,Gourav Gupta,Ethan Eddy,Maxime Devanne,Cyril Meyer,Jin-Chern Chiou,Yueh-Shan Lee,Zong-Han Lu,Aaron Tabor,Erik Scheme
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Accepted to the 2026 IEEE International Joint Conference on Biometrics (IJCB)
Abstract:The International StepUP Competition Series was launched to advance research in pressure-based footstep biometrics through a standardized and challenging evaluation framework. Using the large-scale StepUP-P150 dataset (with more than 200,000 high-resolution dynamic footsteps from 150 individuals) and a previously unreleased test set, the 2nd edition of the competition addressed three key challenges: (1) generalization to unseen users with limited enrollment data, (2) robustness to domain shift caused by variations in footwear and walking speed and (3) effective fusion of paired left-right footsteps. While the first two challenges built on the inaugural competition, this edition introduced more extreme cross-domain conditions and moved beyond isolated footsteps to stride-level verification, enabling new opportunities for representation learning and inter-step information fusion. The competition attracted 26 registrants from academia and industry, with a best equal error rate of 8.00% achieved by the ArogyaPandit Research Team using a spatiotemporal CNN combined with an ensemble-based scoring strategy. The top solutions showcase the value of harnessing temporal patterns and of incorporating inference-time normalization and calibration strategies to improve scoring. However, the results also reveal that recognizing users in unseen personal footwear remains a challenge, especially in the presence of distractors with similar characteristics.
[CV-15] Fine-Grained Vision-Language Pretraining with Organ-Conditioned Pattern Tokens for CT Understanding
链接: https://arxiv.org/abs/2607.13892
作者: Guoliang You,Xiaomeng Chu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 9 pages, 4 figures
Abstract:Computed tomography (CT) vision-language pretraining from paired volumes and radiology reports is a scalable yet challenging task. Existing methods commonly adopt global scan-report contrast, which is scalable but obscures heterogeneous organ evidence. Meanwhile, direct organ-level alignment remains coarse, since the same anatomy can exhibit multiple distinct radiological appearances. Therefore, pretraining requires a finer alignment unit: the organ-conditioned radiological pattern. In this work, we propose OCP-CT, an organ-conditioned pattern-token alignment framework for CT vision-language pretraining. Specifically, OCP-CT preserves a stable global CT-report contrastive branch and introduces an organ pattern interface: sparse Mixture-of-Experts (MoE) routes image and text tokens according to latent radiological patterns, learnable slots query the routed tokens into continuous pattern tokens, and paired token contrast aligns image-text pattern tokens with structured soft targets built from report-derived clinical similarity. On the publicly available CT-RATE and RAD-ChestCT benchmarks, OCP-CT achieves average AUROCs of 84.5% and 69.9% for zero-shot abnormality diagnosis, respectively. Compared with the strongest prior reported results, these results yield absolute AUROC gains of 6.7 and 0.8 percentage points.
[CV-16] PiVoT: A Variational Solution for Real-time Large-scale Multi-object Detection and Tracking under Heavy Clutter
链接: https://arxiv.org/abs/2607.13891
作者: Runze Gan,Qing Li,Simon J. Godsill,Mike E. Davies,James R. Hopgood
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV); Signal Processing (eess.SP)
备注:
Abstract:Multi-object detection and tracking from noisy point clouds remain challenging in many data-scarce radar applications. Current Bayesian trackers based on Poisson measurement models offer a training-free solution but struggle to achieve accuracy and efficiency under severe clutter, large object populations, and full-resolution Doppler point clouds. We address this with PiVoT, a fast, clutter-resilient multi-object tracker for both positional and Doppler measurements. PiVoT performs end-to-end detection and tracking of a large and time-varying number of objects without external clustering or detectors, through joint inference of object states, shapes, existence probabilities, data association, and measurement rates. Its efficiency is driven by several variational inference innovations, such as theoretically justified birth pruning, quadratic-to-linear complexity reductions for exact updates, and a computationally efficient Doppler Poisson model. Experiments show that PiVoT substantially outperforms existing Bayesian trackers in challenging scenes, while also demonstrating exceptional scalability to a thousand objects, robustness to clutter visually inseparable from objects, and real-time operation on full-scale modern automotive radar datasets, where it attains performance comparable to a deep-learning detection benchmark as a training-free joint detector and tracker.
[CV-17] Unleashing Multimodal Large Language Models for Training-free HOI Detection in the Wild
链接: https://arxiv.org/abs/2607.13881
作者: Ting Lei,Jialin Liu,Zhu Xu,Yuxin Peng,Yang Liu
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Human-object interaction detection (HOID) has traditionally been formulated as a supervised detection problem over predefined interaction categories. While such paradigms achieve strong performance on closed-set benchmarks, they fundamentally entangle interaction understanding with dataset-specific supervision, limiting their ability to generalize to open-world and compositional scenarios. Recent HOI detectors attempt to leverage MLLMs through prompting strategies to transfer interaction-specific knowledge. However, such prompt-based approaches primarily focus on extracting discriminative representations from pretrained models, while underexploring their inherent multimodal reasoning capabilities. As a result, they struggle to provide informative contextual reasoning for ambiguous and open-world interaction scenarios. In this work, we present AgentHOI, a training-free, agentic framework that transfers the generalist multimodal reasoning capabilities of foundation models to HOI detection in the wild. Instead of learning interaction classifiers, AgentHOI modularly orchestrates complementary vision foundation modules to perform open-ended semantic reasoning and spatial grounding in a coordinated manner. To address the challenges of incomplete interaction discovery and ambiguous localization in complex scenes, we introduce two key mechanisms: (1) Context-aware Multi-round Reasoning, which progressively refines interaction hypotheses to ensure exhaustive and compositional HOI discovery, and (2) Multifaceted Interaction Localization, which enhances grounding precision by generating instance-specific descriptions that integrate semantic, spatial, and appearance cues. Extensive experiments demonstrate that AgentHOI achieves superior performance over state-of-the-art supervised and weakly supervised methods in real-world settings, despite requiring no HOID data for training.
[CV-18] owards Enhancing 3D Spatial Reasoning in Medical Multimodal Large Language Models
链接: https://arxiv.org/abs/2607.13860
作者: Zhuoyuan Fu,Zeshang Li,Yiqiong Zhang,Hangui Lin,Yan Shu,Yan Li,Binyang Li,Yaru Zhao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:While Multimodal Large Language Models (MLLMs) have demonstrated remarkable success in 2D medical image understanding, their extension to 3D volumetric imaging remains hindered by prohibitive annotation costs and dataset opacity. Current data formats, predominantly consisting of rigid Visual Question Answering (VQA) pairs or unstructured final clinical reports, typically fail to capture explicit clinical reasoning. To address this limitation, we introduce a large-scale structured reasoning dataset constructed via a novel slice-wise data synthesis paradigm. Inspired by the genuine diagnostic workflow of radiologists, this paradigm models visual cognition by decomposing the complex 3D reading process, translating global clinical priors into fine-grained, per-slice observations that are subsequently synthesized into an interpretable Chain-of-Thought (CoT). Crucially, this synthesized reasoning framework enforces essential clinical principles: sequential spatial tracking, multi-slice spatial awareness for artifact mitigation, and differential exclusion. To validate this approach, we instruction-tune a standard 2D-pretrained MLLM baseline using the synthesized data to enhance its volumetric comprehension. Comprehensive evaluations across multiple 3D medical benchmarks demonstrate that our method yields significant performance improvements over the 2D baseline. Furthermore, the resulting model exhibits robust spatial reasoning capabilities and rivals resource-intensive native 3D architectures, effectively bridging the performance gap. Ultimately, this data-centric strategy unlocks deep volumetric understanding and highly interpretable clinical logic without requiring computationally expensive 3D-specific pre-training. The complete repository, including datasets and training workflows, is publicly available at this https URL.
[CV-19] Recursive ArUco Markers: A Scalable Fiducial Marker Design for Unmanned Aerial Vehicle Landing Pads
链接: https://arxiv.org/abs/2607.13830
作者: Rafael Munoz-Salinas,Francisco Jose Romero-Ramirez,Sergio Garrido-Jurado
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Unmanned Aerial Vehicles (UAVs) increasingly rely on visual fiducial markers for autonomous navigation and precision landing. However, standard markers suffer from limited operational ranges, becoming undetectable when the camera is either too far or too close. While recursive and fractal markers have been proposed to address this issue, existing approaches either require the marker’s center to remain visible, making them vulnerable to occlusion, or are limited in their recursion depth and placement. We propose a novel Recursive ArUco marker design. Our method allows any standard fiducial marker to be transformed into a recursive marker with an arbitrary depth. By employing a modified bit-sampling strategy during detection, we embed complete markers within both the black and white bits of the parent marker. This approach guarantees unlimited recursion depth and robust detection even with partial occlusion, as it does not rely on the marker’s center being visible. Furthermore, by maintaining a single, unique identifier across all recursive scales, our proposal provides an extensive dictionary of multiple unique landing pads. This capability allows fleets of UAVs to operate simultaneously, with each drone landing at its designated location – a feature not supported by existing Fractal and Harco markers due to their structural and dictionary constraints.
[CV-20] Bake It Till You Make It: Ultrafast Spatial Texture-Atlas Splatting
链接: https://arxiv.org/abs/2607.13808
作者: Neel Kelkar,Simon Niedermayr,Kaloian Petkov,Klaus Engel,Rüdiger Westermann
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注: 12 pages, 6 figures. Project page with videos and interactive demos: this https URL
Abstract:Recent extensions of 3D Gaussian Splatting (3DGS) capture fine color details using hash-grid-based appearance parameterization but incur high computational cost during fragment rendering. We introduce a decoupled radiance representation that models low-frequency geometry and view dependent appearance features with 2D surfels while representing high-frequency textures via a view-independent spatial hash grid that is baked into a compact texture atlas. By including sparsity-enhancing optimizations that penalize semi-transparency and per-primitive falloff, our method aggressively prunes insignificant surfels and achieves significantly faster and sparser reconstructions than prior work. Exploiting geometric sparsity and efficient GPU texture mapping, our approach achieves up to a fivefold speedup over 3DGS while preserving state-of-the-art visual fidelity, enabling real-time 4K rendering at 60 FPS on consumer hardware.
[CV-21] AspectCLIP: Optimizing CLIP Representation Space via Aspect-Guided Consistency Regularization
链接: https://arxiv.org/abs/2607.13805
作者: Yiyang Yao,Shanglin Liu,Jianming Lv,Chengjun Wang,Jinyi Li,Yuchan Jie,Zhihua Jin
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: PRCV 2026
Abstract:Contrastive Language-Image Pretraining learns a shared representation space through large-scale contrastive learning. However, existing methods that enforce global consistency regularization overlook a key challenge: the inherent information asymmetry between images and text: captions typically describe only one specific aspect of an image, thus images with similar visual content can be paired with completely divergent textual content and semantic information. Consequently, global regularizers inadvertently impose constraints between visually similar images whose captions describe divergent aspects, introducing semantic distortion into the representation space. We propose AspectCLIP, a framework that reformulates consistency regularization to respect this one-to-many structure. AspectCLIP first partitions training samples into attribute clusters based on textual similarity to identify aspect-coherent groups, then applies full cyclic consistency within each cluster while restricting cross-cluster regularization to prototype-level comparisons. This aspect-guided regularization enforces strict geometric alignment only when images and texts describe a consistent facet, while allowing flexibility across divergent aspects. Extensive experiments on downstream tasks demonstrate that AspectCLIP consistently outperforms traditional methods and achieves a more structured representation space.
[CV-22] RainDancer: RGB-Event Video Deraining with Rain-Oriented Spiking Dynamics
链接: https://arxiv.org/abs/2607.13802
作者: Kui Jiang,Runzhe Li,Zhaocheng Yu,Guanglu Sun,Junjun Jiang,Xianming Liu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Video deraining aims to recover clean visual content from rainy videos for reliable perception under adverse weather. Existing methods mainly rely on RGB sequences and temporal redundancy, but RGB-only restoration remains ambiguous in dynamic rainy scenes, where rain streaks, textures, boundaries, motion, and occlusions may share similar visual patterns. Event cameras provide complementary motion-sensitive cues with high temporal resolution, but event streams also contain sensor noise and background-triggered responses, so direct RGB-Event fusion may introduce cross-modal interference. To address this issue, we propose RainDancer, a progressive RGB-Event video deraining framework based on a decompose-before-interact paradigm. The core idea is to separate rain and background components within each modality before cross-modal interaction. In the RGB branch, frame features are progressively decomposed into rain and background representations. In the event branch, a rain-oriented spiking neural network module captures sparse and bursty event dynamics associated with rain motion. Component-level fusion is then performed between semantically aligned representations for structure preservation and rain suppression. We further introduce event-domain supervision to regularize sparse event reconstruction, structural consistency, and gradient orientation. Experiments on synthetic and real RGB-Event video deraining datasets demonstrate superior quantitative performance, visual quality, and downstream perception robustness. Code is available at this https URL.
[CV-23] Prospective clinical indication post-hoc report leakage and fusion design in multi-image chest radiograph classification: a patient-clustered evaluation
链接: https://arxiv.org/abs/2607.13800
作者: Kamran Shahid,Muhammad Munwar Iqbal
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 19 pages, 7 figures, 5 tables
Abstract:Chest radiograph datasets often combine multiple images with Clinical Indication, Findings, and Impression, although these inputs are produced at different stages of care. We evaluated 15,000 ReXGradient-160K studies with two readable images and five CheXbert-derived report observations. Frozen DenseNet-121 and Bio+ClinicalBERT encoders were used to compare image-only, Indication-only, fixed-order multimodal, random-swap, DeepSets, and SectionGuard-MI models. Findings and Impression were evaluated only as post-hoc leakage controls. Models were trained with five seeds, and public-test uncertainty was estimated with 2,000 patient-cluster bootstrap replicates. Under U-Ones, macro AUROC was 0.643 for the primary image, 0.694 for two images, 0.749 for Indication, and 0.780 for ordinary two-image-plus-Indication fusion. SectionGuard-MI achieved AUROC 0.783 and AUPRC 0.260. Relative to ordinary fusion, its paired AUROC difference was 0.0031 (95% CI, -0.0042 to 0.0104; adjusted p=0.374), while its AUPRC difference was 0.0289 (95% CI, 0.0095 to 0.0413; adjusted p=0.004). DeepSets had the highest prospective AUROC point estimate (0.787), and random-swap fusion had the highest prospective AUPRC point estimate (0.265) with better calibration than SectionGuard-MI. Full report text alone reached AUROC 0.979 and AUPRC 0.836; AUROC remained above 0.973 after exact or expanded masking. These results show that prospective Indication is strongly associated with report-derived targets, permutation-aware fusion is competitive, and post-hoc report text creates substantial report-label circularity.
[CV-24] EgoProceVQA: A Novel Egocentric Procedural Understanding Task with Self-Skill-Exploration Agent
链接: https://arxiv.org/abs/2607.13792
作者: Junlong Li,Junxi Li,Yuxiang Yang,Wenbin Zou,Lap-Pui Chau,Yi Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Most daily activities are inherently procedural. However, existing evaluations for egocentric video understanding seldom address procedural understanding and largely overlook complex key-step-level reasoning under the widely used video question answering (VQA) paradigm for MLLMs. Such capabilities are crucial for building procedural AI assistants deployable on wearable devices. To bridge this gap, we introduce the Egocentric Procedural Understanding VQA task (EgoProceVQA), which systematically evaluates egocentric procedural reasoning abilities of current MLLMs and agents through six types of key-step-centric questions. Furthermore, we develop EgoProceGen, a data generation platform that efficiently constructs QA data tailored to different question types. Based on this platform, we build a benchmark with 3,600 questions, four common procedural scenarios, and 31 everyday procedural tasks. Evaluations on EgoProceVQA show that existing MLLMs and agents still have substantial room for improvement in procedural understanding. Therefore, we further propose EgoProceAgent, a self-skill-exploration agentic framework. We design a generic tool library for procedural understanding and a standardized sub-skill library shared across tools and models, enabling self-exploration without ground-truth supervision. By exploring how to compose and select sub-skills, the agent discovers effective skill strategies for diverse problems, and attains state-of-the-art performance among open-source models on multiple tasks. Together, our benchmark, generation platform, and agentic framework establish a unified foundation for EgoProceVQA. Project page: this https URL.
[CV-25] Anatomically Faithful but Temporally Blind: Auditing Attribution for Left-Ventricular Ejection-Fraction Estimation from Echocardiography
链接: https://arxiv.org/abs/2607.13738
作者: Hyunkyung Han,Min Jung Kim
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Background and Objective: Deep video models estimate left-ventricular ejection fraction (EF) from echocardiography with near-expert accuracy, and post-hoc attribution (Chefer relevance for transformers, Grad-CAM for CNNs) is increasingly used to certify that models “look at the right place.” Yet whether these explanations are faithful both spatially and temporally is unaudited. Because EF is defined by the end-systolic (ES) and end-diastolic (ED) frames, a faithful explanation must localize the left ventricle (space) and the decisive frames (time). Methods: We fine-tune two distinct EF regressors on EchoNet-Dynamic – a self-supervised VideoMAE transformer and a Kinetics-pretrained R(2+1)D CNN – and audit each with architecture-matched attribution along three axes: intersection-over-relevance (IoR) against LV masks, deletion AUC, and a temporal localization index on ES/ED frames, each relative to chance with per-case 95% CIs over 50 studies. A tubelet-occlusion probe separates attribution failure from model behavior. Results: Both models are anatomically faithful – IoR 2.91x (VideoMAE) and 1.98x (R(2+1)D) above chance – yet temporally blind: temporal localization is indistinguishable from chance (0.97–1.00) and no better than random attribution. Occlusion shows the models do not preferentially rely on ES/ED (0.90x chance), so temporal blindness reflects model behavior, not an attribution artifact. Conclusions: Spatial faithfulness does not imply temporal faithfulness. Attribution can certify anatomical grounding while masking that a model ignores the clinically decisive frames – a caution for XAI-based validation of video diagnostic models and a call for temporally-aware training and evaluation. Subjects: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13738 [cs.CV] (or arXiv:2607.13738v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2607.13738 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Hyunkyung Han [view email] [v1] Wed, 15 Jul 2026 11:54:09 UTC (402 KB)
[CV-26] owards a Modular Bin-picking Framework for Handling Object Pose Uncertainties
链接: https://arxiv.org/abs/2607.13698
作者: Frederik Hagelskjær
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: 7 pages, 5 figures, 1 table, keywords: bin picking; object manipulation; grasping strategies; object pose distribution estimation
Abstract:In recent years, there has been growing interest in robust robotic systems for precise bin-picking applications. To achieve reliable performance, such systems must address errors arising from both the object pose estimation and the grasping process. Although various approaches have been proposed, they typically target specific challenges and do not offer general solutions. In this paper, we present a modular framework that jointly handles both error types. The framework incorporates object pose distribution estimation to account for pose uncertainty, which frequently arises in situations with ambiguous observations where a single correct pose cannot be determined. To further reduce uncertainty, we introduce a second-viewpoint module that computes complementary pose distributions, which are subsequently fused. This fusion decreases overall uncertainty and improves system efficiency. Additionally, two independent modules are included to compensate for grasping errors. The modular design allows the components to be combined for optimal performance or used individually, depending on the physical setup. The proposed method is evaluated in a real-world setup with three different objects, with no errors, and all modules are shown to improve efficiency. These results suggest that incorporating pose distributions with grasping pose errors is a promising direction for developing more flexible and reliable robotic production systems. To the best of our knowledge, this is the first framework that jointly addresses both grasping and object pose uncertainties using interchangeable modules. We believe there is ample opportunity to integrate additional modules, resulting in improved performance and flexibility. The current framework is limited to pose uncertainties in SO(2), but it could be extended to SE(3), enabling additional modules to improve the system. Comments: 7 pages, 5 figures, 1 table, keywords: bin picking; object manipulation; grasping strategies; object pose distribution estimation Subjects: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2607.13698 [cs.RO] (or arXiv:2607.13698v1 [cs.RO] for this version) https://doi.org/10.48550/arXiv.2607.13698 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-27] Barnamala: Parameter-Efficient Handwritten Devanagari Recognition at Benchmark Saturation
链接: https://arxiv.org/abs/2607.13689
作者: Ashish Thapa,Samrat Karki
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 14 pages, 2 figures, 7 tables. Code and artifacts available at this https URL
Abstract:We built a compact convolutional network (1.11 M parameters) for 46-class DHCD Devanagari recognition and reached 99.73%, the highest reported at 15.6x smaller than prior state-of-the-art. We have effectively reached the saturation point: every model tested, large teacher ensembles included, hits the same 11-error intrinsic floor. No configuration achieves a statistically clear win under exact McNemar tests with Wilson confidence intervals. Even without knowledge distillation, our student matches the nearest large-model baseline (17.32 M parameters; McNemar p = 0.345 ). Outside of DHCD, zero-shot on CMATERdb digits gives 76.6% and fine-tuning reaches 97.8%; corruption robustness is also far better than large baselines (mean corruption accuracy 75.7% vs. 38.7%). All artifacts are at this https URL.
[CV-28] DNA: Dual-stage Native Attribution for Generated Image Source Tracing
链接: https://arxiv.org/abs/2607.13685
作者: Chao Wang,Kejiang Chen,Zijin Yang,Yaofei Wang,Yuang Qi,Weiming Zhang,Nenghai Yu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 18 pages
Abstract:The rapid evolution of image generation has produced numerous within-family variants, making source-model attribution of suspect images increasingly important for digital forensics. Existing proactive methods rely on watermark embedding or model modification, which may degrade visual quality and limit deployment flexibility. Passive methods often rely on large-scale supervised training or a single reconstruction signal, limiting their ability to handle unknown sources and distinguish highly similar within-family variants. We observe that attribution signals in latent generative models are naturally stratified across architectural levels: VAE-level cues reflect family-shared information, whereas backbone-level cues capture variant-specific behaviors. Motivated by this insight, we propose Dual-stage Native Attribution (DNA), a coarse-to-fine framework that follows this hierarchy without additional neural-network training. The coarse-grained stage uses Autoencoder Double-Reconstruction (AEDR) for efficient open-set family-level screening. The fine-grained stage performs closed-set model-level attribution with Native Prediction Consistency (NPC), which compares native prediction errors of within-family variants across multiple noise levels under semantic conditioning and attributes the source via normalized calibrated scores. To enable systematic evaluation, we construct DNA-30K, a benchmark for within-family variant attribution under open-set family-level evaluation. It comprises 30,000 images generated by 24 candidate models across six families spanning both denoising diffusion and flow matching, plus non-candidate generated and natural images as unknown sources. Experiments show that DNA achieves 89.11% end-to-end attribution accuracy on a task where random guessing accuracy is below 1% and outperforms the strongest baseline by 33.81% even when AEDR is used as the coarse-grained stage.
[CV-29] Calibrated Closed-Form Uncertainty for Radiative Gaussian Splatting in Sparse-View CT
链接: https://arxiv.org/abs/2607.13682
作者: Chulin Zhao,Yiran Xu,Shu Liu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 19 pages, 6 figures. Equal contribution: Chulin Zhao and Yiran Xu.(Co-first authors) Corresponding author: Yiran Xu (2617300@dundee. this http URL )
Abstract:Radiative Gaussian splatting has made sparse-view CT reconstruction fast, but existing methods output point estimates with no notion of where the reconstruction can be trusted. We exploit a property of transmissive X-ray imaging that RGB splatting cannot claim – projection and voxelization are strictly linear in the per-Gaussian densities – to equip radiative Gaussians with a variational density posterior whose predictive variance propagates in closed form, exactly, in a single forward pass, in both volume space ( \sigma^2(x)=\sum_i g_i(x)^2 s_i^2 ) and projection space ( \mathrmVar[I_p]=\sum_i w_i,p^2 s_i^2 ). We present the first systematic calibration study for Gaussian-splatting CT (Spearman / AUSE / ECE with temperature scaling), showing that the resulting per-voxel uncertainty ranks true reconstruction error on 14 of 15 scenes of the official benchmark across three view budgets – 9 of 15 additionally meeting our magnitude-calibration target after a single temperature – while the perturbation-ensemble heuristic of concurrent work, transplanted to voxel space under the same protocol on our development scenes, does not (rank correlation as low as -0.08 ). We then dissect why uncalibrated acquisition scores can nevertheless select acceptable views, identifying three regimes – flat (isotropic, balanced), pathological (degenerate coverage), and anisotropic – and showing, in controlled single-scene testbeds, that principled uncertainty earns a measurable premium only in the last, motivating a coverage-gated, maturity-scheduled acquisition policy; the same calibrated posterior further points toward a dose-adaptive stopping rule, whose experimental validation we leave to future work.
[CV-30] owards Spatial Supersensing in the Wild ECCV2026
链接: https://arxiv.org/abs/2607.13681
作者: Tianjun Gu,Tianyu Xin,Kuan Zhang,Bowen Yang,Kok-Chung Chua,Peize Li,Xinran Zhang,Yupeng Chen,Qiyue Zhao,Qinlei Xie,Jianhang Liu,Yucheng Lu,Yinan Han,Marco Pavone,Yiming Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ECCV 2026. Project page: this https URL
Abstract:Humans can efficiently parse continuous sensory streams, from hours to years, scaffolding an internal world model that grounds spatial reasoning and prediction. To mimic this capacity, spatial supersensing challenges multimodal models to move beyond linguistic understanding toward true world modeling. However, their benchmark relies on synthetic long videos, formed by concatenating random short clips, and is mostly limited to household scenes, leaving real-world continuity and diversity underexplored. To address the gap, we introduce \textbfVSI-Super-Wild , a large-scale benchmark for evaluating spatial supersensing over long temporal horizons in diverse in-the-wild scenes. Notably, inspired by cognitive studies on how humans structure experience, we systematically probe the full triad of world state: the agent (observer), objects (scene items), and the environment (places and global layout). In total, VSI-Super-Wild contains \textbf6,980 human-verified question-answer pairs derived from \textbf442 real-world videos spanning 8 scene categories, including long-form recordings exceeding 4 hours. Results on VSI-Super-Wild expose a fundamental disconnect: despite advances in static image understanding, models consistently fail at tasks that require coherent world-state tracking over time. We characterize how performance degrades with world-state complexity and temporal horizon, and diagnose four failure modes: spatial collapse, semantic shortcuts, insufficient update, and instance confusion. This taxonomy reveals that models lack mechanisms to bind objects, agents, and environments into a unified spatial world model, a fundamental gap that defines the path forward for spatial supersensing.
[CV-31] WAVE-Stereo: Warp-Aligned Volume Encoding for Stereo Matching
链接: https://arxiv.org/abs/2607.13674
作者: Zehan Liu,Yage He,Xianwu Gong
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:Existing iterative stereo matching methods primarily adopt two types of correspondence representation: explicit matching search via correlation volumes and local residual refinement via warped features, yet the two remain separately modeled. We propose WAVE-Stereo, built on a core insight: correlation volumes and feature warping provide complementary matching cues. \textbfGeoWarp Correspondence Encoder (GWCE) encodes matching search, residual alignment, and disparity prior in parallel at the ConvGRU input. To mitigate matching degradation in textureless regions, we propose \textbfPeriodic Global Context Propagation (PGCP), which propagates global spatial information in a periodic manner. On five real-world benchmarks – Middlebury, ETH3D, KITTI 2012, KITTI 2015, and Booster – WAVE-Stereo achieves competitive zero-shot generalization accuracy without any external foundation model prior, achieving 3.18% D1-all on KITTI 2015, 4.42% Bad-2.0 on Booster, and 66ms real-time inference, striking a favorable balance between accuracy and efficiency. Our code is available at this https URL.
[CV-32] Learning Speaker Identity Beyond Language and Modality Constraints: Insights from the POLY-SIM 2026 Challenge ACM-MM2026
链接: https://arxiv.org/abs/2607.13669
作者: Marta Moscati,Muhammad Saad Saeed,Marina Zanoni,Mubashir Noman,Rohan Kumar Das,Monorama Swain,Yassin Terraf,Yufang Hou,Elisabeth Andre,Khalid Mahmood Malik,Markus Schedl,Shah Nawaz
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at ACM MM 2026
Abstract:Multimodal speaker identification systems typically assume the availability of complete and homogeneous audio-visual modalities during both training and testing, and assume each speaker only speaks a single language. However, in real-world applications, such assumptions often do not hold. Visual or audio information may be missing due to occlusions, camera or microphone failures, or privacy constraints. Multilingual speakers introduce additional complexity due to linguistic variability across languages. These situations constitute substantial challenges for the robustness and generalization capabilities of multimodal speaker identification systems. Aim of the POLY-SIM 2026 challenge is to address these aspects of speaker identification and to provide a standardized setup for the comparison of the proposed solutions.
[CV-33] Fine-grained CLIP fine-tuning with self-annotated region alignment
链接: https://arxiv.org/abs/2607.13661
作者: Chenyang Zhao,Wei Lin,Antoni B. Chan,Janet H. Hsiao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Contrastive Language-Image Pre-training (CLIP) has been shown to have limitations in its fine-grained dense feature representation, due to its pre-training focusing on matching the whole image to a text description. Considering the large data and computational burden in pre-training a vision-language model from scratch, a series of works aim to enhance the fine-grained ability of CLIP through a fine-tuning scheme. However, existing works suffer from a variety of limitations: additional region annotations are usually required, which limits the semantic diversity due to the predefined categories and leads to a large effort to process the training data; and they usually sacrifice CLIP’s original ability for global visual representation. To bypass these limitations, we propose SFF-CLIP (Self-annotated Fine-grained Fine-tuning for CLIP), which only uses image-text pairs as input to boost the fine-grained representation ability in the CLIP fine-tuning, while maintaining the global visual-semantic consistency. Concretely, a run-time region-phrase alignment scheme is designed, which obtains concept phrases from the input sentence, and aligns them with corresponding extracted region-based features using text-specific heat maps. Extensive experiments demonstrate that SFF-CLIP leads to significant performance improvements on fine-grained dense feature representation, as well as maintaining the performance of the original CLIP on image-level tasks. Code will be released later.
[CV-34] FreeLit: Paired-Free Indoor Relighting via Physics-Guided Diffusion ACM-MM
链接: https://arxiv.org/abs/2607.13656
作者: Chi-En Yen,Duy-Khanh Ngo,Wen-Wei Tang,Huu-Phu Do,Wen-Hsiao Peng,Ching-Chun Huang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ACM Multimedia (ACM MM) 2026. This is the accepted manuscript prior to publication
Abstract:Image-based indoor scene relighting remains challenging due to the complex interplay between cluttered geometry and local illumination, requiring precise modeling of light position, color, and intensity. Existing data-driven methods implicitly learn this relationship via paired multi-illumination datasets. Nevertheless, this data is costly and fails to scale, which is essential for accurate light-source-level control. Conversely, inverse-rendering methods reduce the data dependency by incorporating physical priors; however, they lack the robustness of intrinsic estimation in challenging conditions. In this paper, we present FreeLit, a paired-free framework for controllable indoor relighting that explicitly manipulates light-source location, color, and intensity. Instead of relying on paired supervision, we construct a physics-guided illumination prior from intrinsic scene properties, generating a structured lightmap along with a pseudo-relit image to guide diffusion-based synthesis. To address instability in intrinsic estimation, especially in low-light scenes, we introduce a relighting-guided intrinsic stabilization strategy that enforces illumination-invariant reflectance through structure-aware distillation and consistency constraints. Furthermore, we propose controllability-oriented evaluation metrics to quantify alignment with user-specified illumination color and intensity. Experimental results demonstrate that FreeLit achieves stable, physically consistent, and controllable relighting, with improved robustness in low-light indoor scenes, without requiring paired supervision. Comments: Accepted to ACM Multimedia (ACM MM) 2026. This is the accepted manuscript prior to publication Subjects: Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2607.13656 [cs.CV] (or arXiv:2607.13656v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2607.13656 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-35] 3HG-Editor: Text-driven 3D Human Garment Editing with Body Priors Embedded in SMPL-X
链接: https://arxiv.org/abs/2607.13654
作者: Shaoru Sun,Xingtao Wang,Zihan Ma,Wenrui Li,Jiantao Zhou,Debin Zhao,Xiaopeng Fan
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 9 pages, 7 figures, 2 tables
Abstract:While 3D Gaussian Editing (3DGE) has seen substantial progress, text-driven 3D human garment editing remains largely underexplored. Existing 3DGE works typically follow a paradigm that applies 2D editing techniques to multi-view rendered images and updates 3D Gaussians based on the modified images. Extending such methods to 3D human garment editing suffers from low-fidelity outcomes, caused by introduced distortions and garment inconsistencies. A promising breakthrough opportunity arises from the SMPL eXpressive (SMPL-X) model that embodies rich prior information for virtual humans. Motivated by this insight, we propose a text-driven 3D human garment editor termed T3HG-Editor, which delivers high-fidelity and garment consistent results by leveraging geometry and joint priors embedded in SMPL-X. Specifically, T3HG-Editor contains three stages, namely obtainment of editable Gaussians, garment consistent editing, and Gaussian updating with overflow pruning. The obtainment of editable Gaussians begins with seeding Gaussians along SMPL-X normals to generate sufficient near surface Gaussians, followed by a 2D mask constraint that precisely localizes the target Gaussians to be edited. The garment consistent editing aggregates tokens corresponding to the same SMPL-X vertex across multiple views and propagates them to their original views, enforcing garment consistency without requiring additional training. Gaussian updating with overflow pruning employs a Signed Distance Function (SDF) defined on SMPL-X to construct a human distance field, which is then integrated with a 2D semantic mask to prune overflowing Gaussians, thus preventing contamination of non-target regions. Experiments on multiple subjects and diverse garment types demonstrate that T3HG-Editor outperforms state-of-the-art methods in both editing quality and garment consistency.
[CV-36] Exploratory Communicative and Deployable: Vision-Driven Embodied Agents for Open-World Mobile Manipulation ECCV2026
链接: https://arxiv.org/abs/2607.13653
作者: Boyu Mi,Mengchen Ma,Yifei Yao,Xing Gao,Junting Chen,Yangzi Li,Zihou Zhu,Guohao Li,Zhenfei Yin,Tai Wang,Yao Mu,Jiangmiao Pang,Hanqing Wang
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: Accepted to ECCV 2026. 57 pages. Code available at this https URL
Abstract:Real-world deployment of embodied agents requires active exploration, visual grounding, and interactive intent disambiguation. However, existing frameworks often rely on privileged simulator states or assume complete instructions, bypassing realistic deployment challenges. To bridge this gap, we present REAL, an agentic framework for open-world mobile manipulation. REAL establishes sim-to-real-consistent environment APIs without oracle perception and integrates a simulated user to enable human-in-the-loop interaction. Within this environment, we design diverse task compositions to drive data collection, supervised fine-tuning, and online reinforcement learning, systematically optimizing agent performance. To comprehensively evaluate this approach, we introduce REAL-Bench, a benchmark spanning 241 tasks across active exploration, visual distraction, articulated manipulation, and interactive disambiguation. Experimental results demonstrate that our trained agent outperforms leading commercial closed-source VLMs on interactive tasks with a 56.9% success rate. Further empirical analysis reveals that our hierarchical training pipeline successfully aligns the model’s tool-use capabilities while maintaining robust open-vocabulary reasoning under extended exploration horizons. Finally, we deploy and evaluate our framework on a physical dual-arm mobile robot, where it achieves a 78.3% end-to-end success rate over 60 real-world episodes. These physical trials demonstrate robust zero-shot transferability to unseen household scenarios, validating that our sim-to-real-consistent design successfully bridges the reality gap for long-horizon mobile manipulation. Code is available at this https URL. Comments: Accepted to ECCV 2026. 57 pages. Code available at this https URL Subjects: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO) Cite as: arXiv:2607.13653 [cs.CV] (or arXiv:2607.13653v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2607.13653 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-37] From Surface Forecasting to Observability Forecasting: A Latent World Model for Cloud-Aware EO Monitoring
链接: https://arxiv.org/abs/2607.13651
作者: Mohanad Albughdadi
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:The bottleneck of Earth Observation processing chains is not the arrival of new imagery but whether the surface is actually visible when the image arrives. We study this as an observability forecasting problem on EarthNet2021. Given recent multispectral imagery and exogenous weather drivers, the goal is to predict whether the next acquisition will be usable and, if not, when a usable view is likely to return. To do this, we adapt LeWorldModel, a joint-embedding predictive architecture world model, to cloud-aware Earth Observation sequences. The final pipeline converts raw minicubes into episodic HDF5 sequences with five image channels (blue, green, red, near-infrared, cloud mask) and eight meteorological and calendar covariates. The resulting model has 18.0M trainable parameters and is trained from scratch on 23,904 training episodes. The trained leWorldModel is evaluated under a locked protocol: linear probes are fit on train only, calibration choices are set on an internal validation split, and the fitted heads are then frozen for valsplit, IID, OOD, and extreme evaluation. On the full frozen-bundle observability benchmark, LeWorldModel consistently outperforms persistence. For next-step usability, balanced accuracy ranges from 0.769 to 0.887, compared with 0.493 to 0.556 for persistence. For exact first-usable-horizon prediction, accuracy ranges from 0.602 to 0.806, compared with 0.120 to 0.369 for persistence. Against a frozen LightGBM baseline fit on the same training windows, LeWorldModel is better on continuous clear/cloud regression and on exact recovery timing on valsplit, IID, and extreme, while LightGBM is stronger on the simpler binary any-usable-within-six task and is more robust on OOD. In separate sampled diagnostic analyses, LeWM also produces strong ranking-based anomaly signals under synthetic temporal inconsistencies.
[CV-38] Beyond Color Geometry: Evaluating Human-Like Color Representations in Vision Models
链接: https://arxiv.org/abs/2607.13647
作者: Ayan Igali,Pakizar Shamoi
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 6 pages, 5 figures, 2 tables submitted to 2026 Joint 14th International Conference on Soft Computing and Intelligent Systems and 27th International Symposium on Advanced Intelligent Systems (SCISISIS 2026)
Abstract:Do vision models see colors the way humans do? Existing evaluations of color representations usually compare them with geometric spaces such as CIELAB or with discrete color labels. These references capture perceptual distance or category membership, but not the graded way in which people organize colors. We evaluate color grounding against a fuzzy perceptual model with 86 graded categories fitted to human survey data. The framework can be applied to any image encoder and measures three complementary properties: category boundaries, category compactness, and graded alignment beyond what color geometry alone can explain. Across eleven Vision Transformer encoders, the category-level results are broadly similar, whereas graded alignment differs substantially. Masked Autoencoders achieve the strongest beyond-geometry alignment, with confidence intervals that do not overlap those of the other encoders. A layer-wise analysis further shows that masked reconstruction preserves this structure toward the output. On natural images, MAE represents surface color globally, while language-supervised models encode color more strongly in relation to the foreground object. These results show that human-like color grounding has several distinct aspects that should not be reduced to a single score.
[CV-39] Human4K: A Large-Scale 4K Multi-View Mocap Dataset for Whole-Body 3D Human Reconstruction
链接: https://arxiv.org/abs/2607.13646
作者: Tianshun Han,Ziyu Shi,Lijian Liu,Ajian Liu,Benjia Zhou,Hugo Jair Escalante,Yanyan Liang,Sergio Escalera,Zhen Lei,Jun Wan
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Recent advances in 3D human reconstruction have improved overall performance, yet current models still fail in the most challenging real-world scenarios. They often produce unstable geometry, inaccurate limb articulation and unreliable predictions under depth ambiguity or self-occlusion. A key reason is that existing datasets still lack the combination of high-resolution images, high-precision annotations and diverse whole-body motions required to support robust reconstruction. To address this gap, we present Human4K, a large-scale 4K multi-view whole-body human reconstruction dataset with mocap-accurate SMPL-X annotations. Human4K contains over six million 4K images captured by an eight-view high-resolution camera system synchronized with a professional Vicon motion capture setup, covering 11 subjects performing complex, highly articulated and strongly self-occluded full-body motions. All sequences are processed by a Motion-Retargeting and Refinement Module (MRRM) to ensure precise alignment for the full body and extremities. Experimental results show that training with Human4K consistently improves whole-body reconstruction on standard benchmarks, with particularly large gains for hands, feet and depth-ambiguous limb configurations.
[CV-40] OvisOCR2 Technical Report
链接: https://arxiv.org/abs/2607.13639
作者: Shiyin Lu,Yinglun Li,Yu Xia,Yuhui Chen,An-Yang Ji,Jun-Peng Jiang,Qing-Guo Chen,Jianshan Zhao,En Lin,Haijun Li,Cheng Qin,Zhao Xu,Weihua Luo
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:We introduce OvisOCR2, a 0.8B document parsing model. OvisOCR2 is designed as an end-to-end parser: given a document page image, it generates a Markdown representation in natural reading order, covering text, formulas, tables, and visual regions. We build a data engine that combines filtered real-document annotations with synthetic pages whose rendered images and Markdown targets are derived from the same HTML source. The training recipe includes supervised fine-tuning, reinforcement learning on a 4B branch with a multi-component reward design, on-policy distillation into the 0.8B model, and model fusion. On OmniDocBench v1.6, OvisOCR2 achieves a state-of-the-art overall score of 96.58, placing an end-to-end model at the top of this leaderboard previously dominated by pipeline methods and highlighting the potential of end-to-end document parsing. On PureDocBench, OvisOCR2 also achieves the highest Avg3 score of 75.06. Beyond these two public benchmarks, we evaluate OvisOCR2 on an in-house benchmark designed to cover a broader set of long-tail and challenging scenarios. OvisOCR2 obtains the best overall performance among the compared methods, providing further evidence of its generalization and robustness. OvisOCR2 is available at this https URL.
[CV-41] FastCentNN: Accelerating Centroid Neural Network with Entropy Proxy
链接: https://arxiv.org/abs/2607.13613
作者: Le-Anh Tran
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)
备注: 4 pages, 2 figures
Abstract:Centroid neural network (CentNN) is an unsupervised competitive learning algorithm in which centroid splitting is triggered only after strict local stabilization, often leading to prolonged low-movement training phases before model expansion. This report proposes FastCentNN, an accelerated variant that addresses this inefficiency by introducing an early splitting strategy based on the total centroid movement per epoch, which serves as a training entropy proxy. As a result, FastCentNN reduces unnecessary reassignment epochs while preserving the original winner-loser learning dynamics. FastCentNN supports both absolute and stage-relative movement thresholds, allowing the splitting criterion to remain either fixed or adaptive throughout training. Experiments on some benchmark datasets show that FastCentNN consistently achieves clustering quality comparable to CentNN while reducing runtime by up to 16% on synthetic 2D datasets and about 5% on high-dimensional datasets. FastCentNN therefore provides a practical and efficient drop-in replacement for CentNN, retaining its online adaptive learning behavior while offering a simple and interpretable speed-stability trade-off through configurable splitting thresholds.
[CV-42] Semantic Anchoring for Robotic Action Representations
链接: https://arxiv.org/abs/2607.13597
作者: Yuan Xu,Youheng Shi,Chengyang Li,Wentao Zhu,Yizhou Wang
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Vision-Language-Action (VLA) models inherit rich semantic representations from pretrained Vision-Language Models, yet fine-tuning on limited robot demonstrations degrades this structure and undermines generalization. A fundamental question therefore arises: what constitutes a good action representation? Inspired by the mirror neuron theory’s insight that observation and execution share an intention-level encoding, we examine whether a robot’s action representations preserve the semantic structure captured by pretrained encoders. Systematic probing confirms that this structure erodes during finetuning, and that its quality synchronizes with both task success and out-of-distribution generalization. We further introduce a plug-and-play method that anchors action representations to a semantic manifold while decomposing representations into a shared semantic channel and a private channel, all discarded at inference, leaving the deployed model unchanged. Validated on different VLA backbones across simulation and real-world benchmarks, our method yields up to +18.7% on real-world in-distribution tasks and +21.5% on out-of-distribution generalization.
[CV-43] UniPhysGen: Unified Physical Grounding for Simulation-Ready 3D Assets
链接: https://arxiv.org/abs/2607.13586
作者: Xian Li,Rong Wei,Lujie Yang,Haolin Huang,Junyuan Fang,Siliang Tang,Jun Xiao,Rui Tang,Juncheng Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 39 pages, 12 figures
Abstract:Physically grounded 3D assets are increasingly important for embodied AI and robotic simulation. However, most existing 3D assets lack unified physical semantics, including articulation semantics and intrinsic physical properties, required for realistic interaction. Current approaches either treat these semantics independently or rely on canonicalized object structures, limiting robustness across heterogeneous 3D assets. We present UniPhys, a scalable framework for automatically transforming raw 3D assets into simulation-ready assets with unified physical semantics. Based on UniPhys, we construct UniPhys-40K, a large-scale physically grounded dataset, together with UniPhys-Bench, a carefully verified benchmark for unified physical grounding evaluation. We further introduce UniPhysGen, a unified physical grounding model that jointly reasons over articulation semantics and intrinsic physical properties. UniPhysGen incorporates geometry-robust articulation grounding to mitigate geometric shortcut bias under heterogeneous part decompositions. Extensive experiments demonstrate state-of-the-art performance across articulation grounding and intrinsic physical property estimation tasks, while the resulting assets can be directly deployed in robotic simulation environments for realistic physical interaction. Our code and dataset will be available at this https URL.
[CV-44] Visual Place Recognition Using Rate-Encoded Spiking Neural Networks with Discrete STDP Learning
链接: https://arxiv.org/abs/2607.13584
作者: Altzi Tsanko,Oikonomou Katerina Maria,Antonios Gasteratos
类目: Neural and Evolutionary Computing (cs.NE); Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:Spiking Neural Networks (SNNs) trained through unsupervised Spike-Timing-Dependent Plasticity (STDP) have been explored as solutions to visual loop closure problems, driven by the prospect of efficient on-device inference on neuromorphic devices. State-of-the-art STDP-based models deliver high classification accuracy but fail to reach the high Recall at 100% Precision (R@100P) needed for reliable autonomous navigation. We present a discrete, tensor-native implementation of the STDP-based SNN-VPR pipeline using PyTorch with snnTorch and evaluate it on a 100-place Nordland dataset using 15 independently-trained networks. The contribution of three decisions in the implementation is investigated. First, we show how to perform neuron assignment with a closed-form, deterministic tensor pipeline and show that it provides significantly higher R@100P than a standard argmax procedure. However, some of this gain comes from implementation differences compared to prior continuous-time models, which we measure independently. Second, ablation in isolation shows that state reset after each query helps improve R@100P regardless of the way neurons are assigned. Third, velocity-compensated sliding window aggregation over k consecutive frames reaches R@100P = 100.00% at k = 5 for constant-velocity traversal and an additional 0.20 ms latency. Taken together, these findings show the impact of inference stage design decisions in STDP-based SNN-VPR on recall precision, although the separate contribution of each mechanism and implementation differences is only partially disentangled and needs further examination.
[CV-45] GHR-VLM: Making Zero-Shot Transit Video Analytics Realizable with Grounded Hybrid Reasoning
链接: https://arxiv.org/abs/2607.13569
作者: Kaicong Huang,Weiheng Oh,Ruimin Ke
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Transit video understanding can provide valuable fine-grained data that conventional passenger counters and fare systems cannot capture. However, supervised video models require task-specific annotations, while applying vision-language models (VLMs) directly to long onboard videos is unreliable and costly. To leverage the complementary strengths of both approaches, we propose GHR-VLM, a visual grounded hybrid reasoning framework for zero-shot transit-bus video analytics. It is motivated by the observation that explicit visual grounding can improve VLM reasoning by converting long surveillance streams into compact, passenger-centered spatiotemporal evidence. Specifically, we propose an edge-cloud design in which a lightweight edge-based monitor continuously tracks door status and segments passenger clips. A backend VLM then identifies boarding passengers and classifies payment behavior through a two-stage coarse-to-fine refinement of spatiotemporal evidence. By invoking the VLM only on grounded passenger clips and contact sheets, GHR-VLM reduces cloud inference, avoids payment-specific training data, and supplies the localized evidence that VLMs otherwise struggle to identify. Evaluation on 486 minutes of real-world bus surveillance video demonstrates the potential of grounded edge-cloud reasoning for passenger-level payment analytics while highlighting the challenges posed by degraded video conditions.
[CV-46] Nexus: Native Mesh Generation with Diffusion
链接: https://arxiv.org/abs/2607.13563
作者: Hanxiao Wang,Ying-Tian Liu,Yuan-Chen Guo,Qi-Yuan Feng,Zi-Xin Zou,Ding Liang,Biao Zhang,Yan-Pei Cao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Generating high-quality triangle meshes is essential for film, gaming, and interactive 3D applications. Mainstream methods rely on mesh serialization and autoregressive processes, which stuggles in effective inference and is sensitive to error accumulation. In this paper, we present Nexus, a diffusion method that achieves holistic mesh generation via decoupled vertex and topology generation. First, we view mesh vertices as sparse voxels organized as an octree and adopt a diffusion model to generate the vertices in a coarse-to-fine manner. Second, for topology modeling, we propose Spacetime Interval, as an extension of Spacetime Distance to encode arbitrary edge and face topology into continuous per-vertex embeddings. It allows for a global and efficient recovery of complex topology. We then employ a diffusion model to generate the continuous embeddings on the generated vertices. Extensive experiments on the Objaverse and Toys4K datasets and in-the-wild images demonstrate that our method outperforms state-of-the-art autoregressive and two-stage baselines, effectively circumventing the inherent limitations of sequential mesh modeling. A blind user study from 3D practitioners confirms strong perceptual preference for our results.
[CV-47] hinkBLOX: 3D Indoor Scene Generation with Progressive Reasoning
链接: https://arxiv.org/abs/2607.13539
作者: Yuan Xiao,Can Wang,Xiangyu Kong,Jing Liao
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注: 20 pages
Abstract:While traditional graphics methods often synthesize 3D indoor scenes autoregressively or hierarchically, recent vision-language model (VLM)-based generators predominantly adopt a one-shot paradigm where the full layout is planned at once. This one-shot approach often requires global re-optimization or complete reconstruction during interactive editing (e.g., inserting or moving objects) and can lead to physically or semantically poorly organized arrangements. To address these challenges, we propose ThinkBLOX, a VLM-based progressive reasoning framework that iteratively designs and refines 3D scenes. ThinkBLOX treats layout generation as a state-conditioned, step-by-step reasoningand-action process. To power this, we construct the ThinkBLOX-Data-200K dataset, containing 224,757 procedural placement pairs annotated with multi-view scene context, explicit Chain-of-Thought (CoT) rationales, and structured JSON layouts. Through supervised fine-tuning (SFT) on this dataset, the VLM learns to bridge the reasoning-action gap under incremental updates. Furthermore, recognizing that scene synthesis is inherently a multisolution task where SFT suffers from reward conflict, we introduce Tier-Decoupled GDPO. This reinforcement learning scheme organizes heterogeneous rewards into distinct tiers, stabilizing policy optimization across physical validity, semantic plausibility, and reasoning-action consistency. Extensive experiments show that ThinkBLOX significantly outperforms recent one-shot and iterative baselines in physical plausibility, semantic alignment, and interactive editability. Additionally, we show that it supports diverse applications, including both global and local generation and rearrangement of 3D scenes.
[CV-48] VGIF-Score: Interpretable and Diagnostic Evaluation of Spatio-Temporal Instruction Following in Video Generation
链接: https://arxiv.org/abs/2607.13527
作者: Songyu Xu,Xin Wang,Qiang Chen,Xinran Wang,Muxi Diao,Yuxuan Zhang,Kongming Liang,Rui Lin,Zhanyu Ma
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted by PRCV2026
Abstract:Recent video generation models (VGMs) have made substantial progress in visual fidelity, yet their ability to follow long, compositional instructions remains insufficiently evaluated. Existing evaluation protocols often rely on prompts that are short and semantically shallow, with limited atomic constraints and weak spatio-temporal dependencies. They also frequently depend on costly human evaluation or handcrafted vision pipelines, while providing little diagnostic insight into which instruction constraints succeed or fail. To address this gap, we propose VGIF-Score, a highly automated and interpretable framework for evaluating instruction following in video generation. VGIF-Score consists of two complementary components: an objective completion branch that parses prompts into a Spatio-Temporal Directed Acyclic Graph (ST-DAG) and performs dependency-aware QA with short-circuit diagnostics, and a subjective satisfaction branch that uses instruction-conditioned AutoRubric to assess cinematography, visual purity, motion smoothness, and physics adherence. Together, these components produce a unified score that captures both objective completion and perceptual satisfaction. We instantiate this framework on VGIF-Bench, a benchmark of 223 long, structurally entangled prompts paired with approximately 4.3K fine-grained evaluation items. Experiments on 14 proprietary and open-source VGMs across more than 3K generated videos show that VGIF-Score provides reliable, interpretable, and diagnostically useful evaluation of video generation instruction following. The code will be available at this https URL.
[CV-49] Kepler-Encoder-v0.1: Towards a Multimodal Embedding Model for Robots
链接: https://arxiv.org/abs/2607.13522
作者: Ishneet Sukhvinder Singh,Dhanoosh Pooranakumaran,Alex Nguyen,Jia Qi Yip
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: 33 pages
Abstract:A robot must understand the state of its own body, but a camera sees only part of it. Force and contact leave almost no trace in a single frame, and raw vision features read force at R^2 at or below 0.10 on every robot we test. We present Kepler-Encoder-v0.1, a robot-first multimodal encoder that treats robot state as a modality and fuses vision, proprioception, and force/torque into a single shared latent with a learned-query cross-attention layer, trained self-supervised by masked cross-modal prediction under the LeJEPA/SIGReg objective. At evaluation only vision enters, which poses a sharp question. Does fusing state into training make the vision-only latent carry anything the pixels do not already contain? On the RH20T corpus the answer is yes, precisely where the camera is weakest. On held-out scenes, the vision-only latent recovers end-effector state, and force in particular, significantly above both raw frozen-ViT features and a compute-matched vision-only control on every sensored robot, though absolute force recovery at a single timestep is modest; on motor state, which the camera largely sees, it is statistically tied with the strongest vision baselines, and it is the only feature whose latent geometry tracks state. A single embodiment-agnostic encoder covers four robots, and a data-matched control shows this breadth reflects embodiment diversity rather than data volume. The frozen latent is directly useful. Its own cross-modal prediction error is a training-free invalid-state monitor (AUROC 0.90 on out-of-range states, 0.69 on scene-swapped states), and a diffusion decoder (PixNerd) reconstructs the camera frame from the latent, confirming the spatial compression preserves world-state. This report validates the single-timestep case; native-rate temporal fusion is the next step.
[CV-50] DriveFace: A Cross-Spectral Through-Glass Face Dataset for On-the-Move Vehicular Border Control
链接: https://arxiv.org/abs/2607.13515
作者: Anjith George,Luis Luevano,Alain Komaty,Zeina Al Amine,Vidit Vidit,Sebastien Marcel
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted in IJCB 2026
Abstract:The continuous growth in cross-border mobility places increasing pressure on existing border control infrastructures, motivating on-the-move biometric authentication, in which travellers are identified directly inside their vehicles at checkpoints. Face recognition is well-suited to this setting, as it can be acquired passively and at a distance. Its development, however, is hindered by the lack of representative datasets: existing benchmarks are collected in controlled environments and do not capture the challenges inherent to vehicular acquisition, including motion blur, variable illumination, occlusions, and cross-spectral enrollment. To address this gap, we introduce a dataset for on-the-move face recognition in border-control scenarios, comprising NIR vehicle-crossing videos paired with smartphone-based pre-enrollment data. Baseline evaluations with state-of-the-art models show clear performance limitations under these realistic conditions, highlighting the need for dedicated methods to advance the field.
[CV-51] RACE-PCa: Predicting Prostate Cancer Progression from Longitudinal MRI During Active Surveillance
链接: https://arxiv.org/abs/2607.13506
作者: Hongye Zeng,Shreeram Athreya,Dingyuan Dai,Steve Raman,Leonard Marks,William Speier,Corey Arnold
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 7 pages, 4 figures
Abstract:Active surveillance (AS) is the preferred strategy for favorable-risk prostate cancer, yet current protocols rely on scheduled repeat biopsies, most of which reveal no progression and are unnecessary. Existing risk-stratification tools operate on single time-point imaging or depend on explicit lesion segmentation, limiting their ability to capture longitudinal change and excluding patients without an MRI-visible lesion. In this study, we propose an end-to-end temporal and multimodal model for predicting pathological progression during AS without lesion segmentation. We encode each serial scan with a pretrained 3D MRI foundation model and introduce a temporal attention gate that recalibrates the multi-visit features to amplify focal imaging changes associated with progression. The gated imaging representation is then fused with clinical variables in a multimodal framework to estimate the probability of progression. Validated on a longitudinal AS cohort, our approach consistently outperforms competing baselines and performs comparably to the radiologist assessment representing current clinical practice. It maintains high negative predictive value while achieving higher positive predictive value, demonstrating its potential to safely reduce unnecessary biopsies during surveillance.
[CV-52] DP-BOA: Dirichlet-Process Birth-or-Assign for On-the-Fly Category Discovery ECCV2026
链接: https://arxiv.org/abs/2607.13504
作者: Peiyan Gu,Zixin Teng,Xuming He
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at ECCV 2026
Abstract:On-the-fly category discovery requires deciding for each incoming test sample whether to assign it to an existing category or spawn a new one. Existing methods typically implement this decision through matching-based heuristics, such as radius- or hash-based rules. While effective in practice, these methods usually treat category birth implicitly as a fallback when no existing category matches confidently, rather than as an explicit alternative supported by its own statistical evidence. To address this, we propose DP-BOA, a posterior-predictive decision framework based on an online Dirichlet-process Gaussian mixture model with a Normal-Inverse-Wishart prior. During training, we use labeled data to calibrate a shared NIW prior over category Gaussians and warm-start the known-category posteriors. At test time, for each incoming sample, DP-BOA compares the posterior predictive evidence for assignment to existing categories against the evidence for spawning a new category induced by the DP prior, and then updates category statistics online after the decision. The method captures anisotropic category geometry and naturally adapts decision confidence as evidence accumulates. Across standard OCD benchmarks, DP-BOA consistently outperforms strong baselines and delivers particularly strong novel-class discovery performance while maintaining competitive known-class accuracy.
[CV-53] Attention-Free and Lightweight Token Reduction for Efficient Vision-Language Models
链接: https://arxiv.org/abs/2607.13500
作者: Xuanyi Hao,Zuoyuan Zhang,Zhibo Wang,Xiaoyi Pang,Jiahui Hu,Jiacheng Du,Shuguo Zhuo
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: This work has been submitted to the IEEE for possible publication
Abstract:Vision-Language Models (VLMs) have achieved strong performance in multimodal understanding, yet remain challenging to deploy on resource-constrained edge devices due to the substantial computational overhead of processing numerous visual tokens. Token reduction is a promising direction for accelerating VLMs inference, but existing approaches either rely on attention maps that are incompatible with modern acceleration frameworks or depend on computationally intensive pairwise similarity comparisons, which undermine scalability and negate their practical benefits in deployment. In this paper, we propose an attention-free and lightweight token reduction framework as a plug-and-play module for VLMs, which preserves both important and diverse tokens to produce a compact visual representation. First, to enable attention-free importance estimation, we adopt an information-theoretic perspective and quantify token information using a novel entropy-based criterion, retaining those with more expressive and less degenerate feature representations. Second, to ensure diverse visual coverage in a lightweight manner, we introduce a transformation-induced consistency signal where similar tokens yield similar signals, such that sorting by this signal places similar tokens close to each other and enables stride-based selection to produce a diverse token set. Extensive experiments across multiple VLMs benchmarks demonstrate that our framework achieves a favorable accuracy-efficiency trade-off, maintaining competitive performance under aggressive compression.
[CV-54] M2P-AD: Memory-to-Prototype Learning with Boundary-aware Score Refinement for 3D Anomaly Detection
链接: https://arxiv.org/abs/2607.13499
作者: Seyoung Jeong,Jong Pil Yun,Sang Jun Lee
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 16 pages, 6 figures
Abstract:3D anomaly detection has recently emerged as an important research topic in computer vision. Although existing methods have achieved high performance, excessive anomaly responses in normal regions and false positives near object boundaries remain unresolved challenges. To address these challenges, we propose a novel 3D anomaly detection model, Memory-to-Prototype Anomaly Detection (M2P-AD), which effectively models the distribution of normal features while suppressing excessive anomaly scores in normal regions and false positives near object boundaries. Specifically, we introduce a Memory-to-Prototype (M2P) module that learns representative prototypes from normal feature embeddings to preserve important structural information of objects. In addition, a Boundary extraction (BE) module is integrated to identify object boundaries, and a Boundary-aware score refinement (BSR) strategy is applied to recalibrate anomaly scores by incorporating boundary characteristics. The proposed method is evaluated on Real3D-AD, Anomaly-ShapeNet, and MulSen-AD, achieving state-of-the-art performance. Qualitative results demonstrate that excessive anomaly scores in normal regions are reduced and false positives near object boundaries are suppressed, resulting in more accurate and stable anomaly localization. The results indicate that the proposed approach enables more reliable 3D anomaly detection and provides a robust solution applicable to real-world industrial environments.
[CV-55] CASA-SDF: Curriculum-Aware Spatial Adaptation with Curvature-Guided Density for Neural Implicit Surface Reconstruction
链接: https://arxiv.org/abs/2607.13492
作者: Lei Yang,Weiqing Li,Zhiyong Su,Liang Xiao
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注:
Abstract:Neural implicit representations have emerged as a powerful paradigm for 3D reconstruction. However, high-fidelity indoor surface reconstruction remains a significant challenge, primarily due to the pronounced \emphgeometric heterogeneity of indoor scenes. Large texture-less planar regions typically require stronger regularization to suppress high-frequency artifacts, while thin structures demand sharper, more adaptive representations to mitigate the spectral bias of multi-layer perceptrons (MLPs) and prevent over-smoothing. Existing approaches often rely on spatially indiscriminate prior supervision and a scene-global SDF-to-density transformation, which constrains their ability to balance planar smoothness and detail preservation. In this paper, we propose CASA-SDF (Curriculum-Aware Spatial Adaptation for SDF), a unified framework that addresses this challenge via complementary adaptations of supervision and representation capacity. Specifically, Hybrid Spatially-Adaptive Uncertainty Annealing (SAUA) fuses semantic and photometric uncertainties to construct a pixel-wise curriculum for monocular prior supervision. This strategy maintains regularization in reliable regions while attenuating unreliable supervision early in training to enable data-driven photometric refinement. Meanwhile, Curvature-Aware Locally Adaptive Density Transformation (CALADT) progressively modulates the sharpness of the SDF-to-density mapping via a curvature proxy to enhance the representation of thin structures. Extensive experiments on benchmark indoor datasets demonstrate that CASA-SDF improves surface completeness and detail recovery on high-frequency structures, without compromising the stability of planar surfaces.
[CV-56] GPOcc: Unified Sparse Gaussian Occupancy Prediction with Visual Geometry Priors
链接: https://arxiv.org/abs/2607.13481
作者: Changqing Zhou,Yueru Luo,Yulan Guo,Bing Wang,Jie Qin,Changhao Chen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Accurate 3D scene understanding is fundamental to embodied intelligence and autonomous driving, where 3D occupancy provides a unified representation of objects, structures, and free space. However, recovering such a complete volumetric representation from visual observations remains challenging, particularly in occluded and unobserved regions. Visual geometry priors offer strong and generalizable geometric cues for addressing this challenge, but their outputs are inherently surface-centric, whereas occupancy prediction requires reasoning about volumetric interiors and free space. To bridge this gap, we introduce GPOcc, which transforms visual geometry priors into occupancy-aware sparse Gaussian representations for efficient and expressive volumetric scene modeling. Building on GPOcc, GPOcc++ models multi-view observations and temporal sequences within a unified framework, allowing spatial and temporal evidence to be handled through the same representation. We further extend GPOcc++ from indoor scenes to outdoor occupancy prediction. Extensive experiments on both indoor and outdoor benchmarks demonstrate consistently strong performance across both multi-view and temporal settings, together with favorable efficiency and generalization. Code will be released at this https URL.
[CV-57] EgoHTR: Egocentric 4D Demonstrations of Human Terrain Traversal
链接: https://arxiv.org/abs/2607.13472
作者: Alex Brandes,Haig Conti Georges Sajelian,Manthan Patel,Dominik Hollidt,Chenhao Li,Matthias Heyrman,Oliver Hausdoerfer,Manuel Kaufmann,Xi Wang,Jonas Frey,Angela P. Schoellig,Christian Holz,Marc Pollefeys,Marco Hutter
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: Project webpage: this https URL
Abstract:Deploying humanoid robots in unstructured terrain remains an open problem. While classic reinforcement learning struggles with the sheer complexity of real-world interactions, more promising methods leveraging human priors remain limited to models lacking contextual awareness. The restricted motion synthesis is a direct consequence of existing dataset pipelines failing to capture human-scene sequences in challenging environments. To bridge this gap between humanoid learning and scene reconstruction, we introduce the Egocentric Human-Terrain Reconstruction (EgoHTR) dataset. We develop and open-source a reconstruction pipeline capturing 55 scene-aligned 4D human motion sequences in diverse, complex environments using a multi-sensor setup of egocentric wearables and a portable 3D scanner. The resulting dataset comprises over 150k frames, which we evaluate against motion-capture ground truth, demonstrating state-of-the-art accuracy and establishing a rigorous benchmark for human motion analysis and synthesis. Further, we leverage this data to train perceptive locomotion policies, demonstrating hardware deployment on a Unitree G1 for reconstructed reference motions. Our pipeline enables community-driven dataset extensions and factors the problem to help researchers build foundational, context-aware robots that reliably traverse uneven terrain.
[CV-58] Bring Music The Horizon: Music-Driven 360circ Video Generation
链接: https://arxiv.org/abs/2607.13471
作者: Kai Hsu Tsai,Yong Wei Fu,Hung I Yang,Yu-Chih Chen
类目: Computer Vision and Pattern Recognition (cs.CV); Multimedia (cs.MM); Sound (cs.SD); Audio and Speech Processing (eess.AS); Image and Video Processing (eess.IV)
备注: 5 pages, 1 figure
Abstract:Music visualization offers a powerful way to enhance listeners’ understanding and experience of music by translating auditory signals into visual forms. However, most existing approaches either rely heavily on lyrics or generate flat, non-immersive videos similar to conventional music videos, which limits their ability to convey the emotional dynamics of music and provide an immersive listening experience. We propose Bring Music The Horizon, an emotion-aware pipeline for music-driven 360 ^\circ video generation. Given an input song, our work first estimates its emotional trajectory by predicting valence-arousal values at the level of every four bars. These values are then converted into emotion-aware visual guidance using EmotiCrafter, and these guidance vectors can be manipulated by the SEGA framework, which provides fine-grained semantic control for keyframe generation. Finally, image-to-video models are applied to the generated keyframes to synthesize temporally continuous 360 ^\circ videos for immersive music visualization. Our pipeline generates 360 ^\circ music visualization videos that reflect the emotional progression and temporal structure of the input song. We demonstrate its capability using songs from different genres and provide qualitative comparisons with From-Sound-To-Sight, a representative audio-to-visual generation baseline, on our project page at this https URL.
[CV-59] HIVE-3D: Hierarchical Voxel Enhancement for High-Quality 3D Scene Generation ICML2026
链接: https://arxiv.org/abs/2607.13468
作者: Bin Zang,Wenting Zheng,Xiaoliang Luo,Zhiyuan Fang,Shi Li,Lvchun Wang,Wei Yu,Yi Zhao,Tian Xie,Yuchi Huo,Rengan Xie
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Accepted at the 43rd International Conference on Machine Learning (ICML 2026). Project page: this https URL
Abstract:Recently, a line of works can generate impressive 3D objects from a single image, but they are limited by restricted representation resolution, making them unsuitable for 3D scene generation. In this work, we introduce HIVE-3D, a novel method for high-quality 3D scene generation based on hierarchical voxel enhancement framework. Specifically, given a single scene image as input, we first produce a coarse initial scene, then introduce image segmentation and attention-based retrieval to align 2D image components with 3D scene components. Subsequently, we organize these scene relations into a hierarchical component tree, where nodes closer to the leaves denote finer-grained components. Finally, we propose a voxel super-resolution model that generates refined voxels for the target instance while maintaining strong consistency with the coarse voxels. Equipped with this model, we perform coarse-to-fine hierarchical super-resolution on images and voxels for each component, producing a high-resolution and high-quality 3D scene. Extensive experiments demonstrate that our method significantly outperforms previous approaches, achieving state-of-the-art performance.
[CV-60] LPM: Industrial-Scale Generative Video Restoration
链接: https://arxiv.org/abs/2607.13460
作者: Bichuan Zhu,Fulin Li,Jiachao Gong,Jinhua Hao,Kai Zhao,Kun Yuan,Pengcheng Xu,Qiang Wang,Qiao Mo,Yanlong Yuan,Yizhen Shao,Yuxiao Hu,Zixi Tuo,Ming Sun,Chao Zhou,Bin Chen,Bin Yu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 21 pages, 7 figures
Abstract:We present the Large Processing Model (LPM), a diffusion-based generative framework for photorealistic video restoration under complex, in-the-wild degradations. To our knowledge, LPM is the first generative video restoration model deployed at industrial scale. LPM addresses the diverse degradations in user-generated content (UGC) through a unified system encompassing large-scale data engineering, foundation-model training, and efficient inference. Its enhanced architecture, progressive training strategy, and temporal-pyramid inference mechanism jointly enable high-fidelity, temporally consistent restoration of arbitrarily long videos across the broad content distribution encountered on UGC platforms. LPM has been deployed in production at Kuaishou, where videos processed by the model account for approximately 45% of total viewing time, delivering consistent improvements across key quality-of-experience metrics. Beyond perceptual enhancement, LPM delivers substantial system-level benefits: at comparable perceptual quality, it reduces bitrate by 20% relative to Kuaishou’s in-house codec, yielding annual bandwidth cost savings on the order of hundreds of millions. Its low serving cost also enables integration into products such as Kling, demonstrating that generative restoration can be practical, scalable, and cost-effective for large-scale video processing.
[CV-61] 2D Rotary Position Embedding for Scene Text Recognition with Transformers
链接: https://arxiv.org/abs/2607.13458
作者: Zobeir Raisi
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 17 pages, 3 figures. Under review at the International Journal on Document Analysis and Recognition (IJDAR)
Abstract:Scene Text Recognition (STR) remains challenging due to the diversity of text appearances, including curvature, rotation, and perspective distortion. Recent Transformer-based approaches perform well but usually rely on one-dimensional positional encodings that ignore the 2D spatial structure of text images. Axial 2D extensions of Rotary Position Embedding (RoPE) exist for vision Transformers, but they assume roughly square, isotropic image content and apply the rotation only within encoder self-attention. Scene text violates both assumptions: crops are markedly anisotropic, and STR models are encoder-decoder, so the decoder must relate its queries to the encoder’s 2D layout through cross-attention. We introduce 2D-RoPE-STR, which adapts axial 2D-RoPE to this setting through (1) an anisotropic row/column dimension allocation matched to the aspect ratio of text, and (2) an extension of the rotary coupling into encoder-decoder cross-attention, letting autoregressive decoding steps attend to encoder tokens by their 2D layout, a setting not addressed by prior encoder-only formulations. Both changes are essentially parameter-free and require no architectural redesign beyond the positional-encoding module. We further introduce a diagnostic protocol (a controlled ablation pair isolating only the positional encoding, an image-level net-win disagreement analysis, and encoder attention visualization) that identifies where and why relative 2D position helps: curved, rotated, and perspective-distorted layouts where reading order departs from a straight horizontal line. On six standard benchmarks (IIIT5K, SVT, ICDAR 2013, ICDAR 2015, CUTE80, SVTP), gains concentrate on exactly these irregular layouts, with ablations isolating each design choice against 1D RoPE and 2D sinusoidal and learnable alternatives.
[CV-62] reeSRNF: Square-Root Normal Fields for Generative Modelling of the Geometric and Structural Variability in Tree-like 3D Objects ECCV2026
链接: https://arxiv.org/abs/2607.13456
作者: Tahmina Khanam,Hamid Laga,Mohammed Bennamoun,Guanjin Wang,Ferdous Sohel,Farid Boussaid,Anuj Srivastava
类目: Computer Vision and Pattern Recognition (cs.CV); Computational Geometry (cs.CG); Graphics (cs.GR)
备注: ECCV 2026
Abstract:We introduce a novel mathematical framework for analyzing and generating complex tree-shaped 3D objects, such as botanical trees and plants, which deform both in their 3D geometry and branching structure. Unlike previous works, which either consider only the skeletal structure of tree-like objects or approximate their 3D geometry using branch thickness, the proposed framework accurately models both the 3D geometry of the tree branches and the way they are interconnected. In this paper, we first generalize the Square Root Normal Fields (SRNF) representation, originally proposed for the statistical analysis of genus-0 surfaces, to tree-shaped 3D objects. We then treat tree-shaped 3D objects as points on a novel Riemannian tree-shape space equipped with a novel Riemannian metric that measures the amount of surface bending and stretching, and structural changes one needs to apply to one 3D tree-shape to align it with another. This way, deformations become trajectories in this novel tree-shape space. We analyze the theoretical properties of this novel tree-shape space and the corresponding metric and develop algorithms for computing point-wise and branch-wise correspondences and geodesic paths between complex 3D trees. We finally show how to use these building blocks for (1) computing statistical summaries, \ie means and modes of variation, of collections of tree-shaped 3D objects, and (2) synthesizing novel tree-shaped 3D objects by sampling from probability distributions fitted to a population of tree-shaped 3D objects. We demonstrate the performance and utility of the proposed framework on real and synthetic plants and botanical trees and show that it significantly outperforms the state-of-the-art.
[CV-63] GeoAnchor: Collaborative Reasoning via Latent Decomposition for 3D Spatial Understanding ACM-MM2026
链接: https://arxiv.org/abs/2607.13454
作者: Hao Li,Han Fang,Zixin Pan,Xin Wei,Hongbo Sun,Jinglin Xu,Zhiyu Lin,Ye Yuan,Zhongjiang He,Yu Yu,Hao Sun
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: Accepted by ACM MM 2026
Abstract:Although multimodal large language models (MLLMs) have achieved remarkable progress, understanding 3D spatial relationships from 2D images remains a critical challenge. Existing methods primarily rely on symbolic text tokens, which inherently lack the fidelity to represent continuous geometric information. While recent methods use latent representations to enhance reasoning, relying on a single latent type cannot adapt to the diversity of spatial tasks, leading to misalignment in complex geometric scenarios. To address these limitations, we propose GeoAnchor, an interleaved text-latent reasoning framework. GeoAnchor decomposes 3D spatial information into three complementary components: position latents for object grounding, direction latents for relational orientation, and geometry latents for scene structure. These components are recombined in a structured space to construct local evidence while capturing global context, enabling dynamic and interpretable reasoning. Furthermore, we introduce a collaborative training strategy that guides the model from local spatial perception to comprehensive 3D understanding. Extensive experiments on diverse and complex 3D reasoning tasks demonstrate that GeoAnchor outperforms the state of the art, validating its effectiveness and generalization capabilities.
[CV-64] Symbiosis-Inspired Knowledge Distillation for Incremental Object Detection ICML2026
链接: https://arxiv.org/abs/2607.13452
作者: Mingyue Zeng,De Cheng,Zhipeng Xu,Huaijie Wang,Nannan Wang,Xinbo Gao
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 16 pages, 8 figures, Accepted by ICML 2026
Abstract:Incremental object detection (IOD) aims to extend detectors to new categories while retaining previously acquired knowledge. Existing methods often adopt a class incremental learning perspective, separating feature spaces to sharpen decision boundaries. However, this separation-oriented paradigm may overlook object symbiosis in detection, where co-occurrence and occlusion introduce spatial and semantic dependencies that benefit from shared representations. Ignoring these dependencies distorts the shared representations, exacerbates confusion between old and new classes, and accelerates catastrophic forgetting. To address this, we propose Symbiosis-Inspired Knowledge Distillation (SIKD), which explicitly leverages object symbiosis at two complementary levels. Spatial Symbiosis Distillation (SpSD) focuses on symbiotic regions where the old model responds with high overlap to objects in the new task. It preserves generalizable old class cues, suppresses class-specific bias and redundancy, and distills the refined evidence to the new model at matched spatial locations with slot-aligned supervision. Semantic Symbiosis Distillation (SeSD) maintains class level structure by forming confidence weighted prototypes for old classes and aligning their inter class soft ranks over the old class logits, which stabilizes the semantic topology during adaptation. Extensive experiments demonstrate the effectiveness and superiority of the proposed method.
[CV-65] Learning Physics-Guided Residual Dynamics for Deformable Object Simulation
链接: https://arxiv.org/abs/2607.13451
作者: Shivansh Patel,Kaifeng Zhang,Sanjay Pokkali,Svetlana Lazebnik,Yunzhu Li
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注: Website: this https URL
Abstract:Simulating deformable objects is essential for a wide range of robotic manipulation applications, yet accurately predicting their dynamics remains challenging. We propose Physics-Guided Residual Dynamics (PGRD), a hybrid simulation framework that combines the advantages of physics-based and learning-based approaches. Specifically, PGRD combines an optimizable spring-mass simulator as a backbone with a learned neural network that predicts residual corrections to the physics-based predictions. We adopt a velocity-based formulation to ensure stable simulation and a sliding-window transformer architecture to capture temporal dependencies. We show that PGRD produces more accurate results than both purely physics-based and learning-based methods on a set of diverse real-world deformable objects. We further demonstrate the utility of PGRD in two applications: manipulation planning via Model Predictive Control, including a language-conditioned setting with a generated goal image; and interactive simulation via action-conditioned video prediction by 3D Gaussian Splatting.
[CV-66] DreamSat-Pose: Spacecraft Pose Estimation from Single-View 3D Reconstructions and Learned 2D-3D Feature Matching
链接: https://arxiv.org/abs/2607.13449
作者: Josiane Uwumukiza,Jocelyn Zhao,Giovanni Lavezzi,Giacomo Battaglia,Paolo Panicucci,Minduli C. Wijayatunga,Victor Rodriguez-Fernandez,Richard Linares
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:6-DoF pose estimation is a critical task in autonomous rendezvous and proximity operations. In the case of an unknown target, this task becomes challenging as it shall be paired with the reconstruction of the target shape model. In this article, we propose a novel framework for single-shot shape and pose estimation of unknown spacecraft objects. Given a single image, we first reconstruct a 3D shape model of the target, then estimate the relative six-degrees-of-freedom pose by learning dense 2D-3D correspondences. The image features are extracted using a frozen DINOv3 vision transformer, while the geometric features are computed from the reconstructed point cloud using a trainable dynamic graph convolutional neural network encoder. A dual-stream transformer matcher refines descriptors through alternating self- and cross-attention, producing soft correspondences that are passed to a Perspective- n -Point solver for pose recovery. We evaluate the method on the SPE3R dataset and consider FoundationPose as a representative baseline for current state-of-the-art capabilities. Results show reliable pose estimates achieving 0.157 degrees mean pointing error using only a single image and reconstructed geometry, demonstrating strong generalization to unseen spacecraft.
[CV-67] CLIP-Guided Label-Free Discriminative Region Scoring for Fine-Grained Classification
链接: https://arxiv.org/abs/2607.13437
作者: Yujie Zhu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Recent vision models such as CLIP and SAM enable training-free segmentation and semantic encoding for fine-grained classification. A common approach is to compare the representations of segmented image regions with the text prompt embeddings of the corresponding labels. However, it remains unclear how different local regions and CLIP-based scoring strategies affect the selection of discriminative evidence, especially when ground-truth labels are unavailable. In this paper, we propose a unified CLIP-guided label-free region scoring framework for fine-grained classification. The framework evaluates cosine similarity-based, margin-based, and entropy-based scoring strategies using both SAM-generated masks and random crops, and introduces two label-free pseudo-label variants based on global image embeddings and local region embeddings. We conduct experiments on five fine-grained classification datasets to systematically compare different region generation methods and scoring strategies. The results show that Soft Negative Margin scoring achieves the strongest performance, and pseudo-label scoring closely approximates true-label performance. Although SAM produces semantically meaningful masks, random-crop-based pseudo-label scoring consistently outperforms SAM-based scoring across all datasets, suggesting that random crops preserve surrounding information and provide more stable semantic context when pseudo-labels are noisy. In addition, SAM masks benefit from aggregating embeddings from all regions, whereas random crops tend to perform better with a smaller top-k subset. These findings provide new insights for fine-grained classification.
[CV-68] Generalizable VLA Finetuning via Representation Anchoring and Language-Action Alignment
链接: https://arxiv.org/abs/2607.13429
作者: Dwip Dalal,Shivansh Patel,Chahit Jain,Jeonghwan Kim,Utkarsh Mishra,Alex Baratian,Hyeonjeong Ha,Heng Ji,Svetlana Lazebnik,Unnat Jain
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: Code: this https URL
Abstract:Finetuning a pretrained vision-language model (VLM) on robot demonstrations via behavior cloning (BC) has become the standard recipe for vision-language-action (VLA) policies. However, BC finetuning progressively overwrites the pretrained representations that support visual and semantic generalization. Co-training on web image-text data, a common remedy, does not prevent this; it applies language and action losses to separate observations, leaving VLAs with language-action misalignment that standard manipulation benchmarks do not expose. We propose Anchor-Align, which augments BC with two objectives: Vision-Language Anchoring distills layer-wise representations from a frozen VLM copy to prevent this drift, while Language-Action Alignment converts each action target into a discrete motion-direction label and jointly trains language and action prediction on the same robot observation. On a physical xArm7 robot, across two widely used VLA architectures, Anchor-Align improves real-robot success on both (28% to 54% and 37% to 60%). At scale in simulation, we demonstrate consistent improvements on OOD perturbations, perceptual robustness, and long-horizon control across LIBERO-PRO, LIBERO-Plus, and CALVIN, respectively, suggesting that preserving pretrained representations and effective action learning are not fundamentally at odds. Project page: this http URL
[CV-69] ScanFocus: A Coarse-to-Fine Framework for Spatio-Temporal Video Grounding ECCV2026
链接: https://arxiv.org/abs/2607.13421
作者: Kai Chen,Ming Dai,Wenxuan Cheng,Wankou Yang
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: this paper has already been accepted by ECCV 2026
Abstract:Spatio-Temporal Video Grounding (STVG) aims to retrieve the visual trajectory of a specific object from a video stream as described by a natural language expression. However, most advanced methods struggle to balance global context modeling with precise boundary localization. Due to the prohibitive computational costs of processing long videos, these approaches typically resort to low-rate temporal downsampling and implicit motion modeling. This inevitably suppresses high-frequency boundary cues and neglects the explicit inter-frame dependencies required for precise boundary delineation. To address these limitations, we present \textbfScanFocus, a novel coarse-to-fine framework that decouples the STVG task into a global spatio-temporal scan and a local boundary focus. Specifically, we utilize a unified vision-language fusion encoder combined with a lightweight Deformable Semantic-Motion Fusion module to efficiently align multimodal features and generate coarse proposals. To recover the suppressed fine-grained details, we introduce the Semantic-Guided Temporal Aggregator (SGTA) in the refinement stage. By densely sampling around coarse boundaries, SGTA explicitly models short-term temporal interactions under semantic guidance, capturing rapid motion changes for precise timestamp regression. Extensive experiments on three widely used benchmarks demonstrate the performance superiority of our proposed method over previous approaches. Code will be released at this https URL.
[CV-70] MultiAnimate: A Unified Framework for Controllable Multi-Character Animation
链接: https://arxiv.org/abs/2607.13415
作者: Zhongyi Zhang,Guangyuan Wang,Li Hu,Wenbo Zhou,Peng Zhang,Tianyi Wei,Weiming Zhang,Bang Zhang,Nenghai Yu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Preprint, under review
Abstract:Recent advances in generative models and technological innovations have significantly addressed the fundamental challenges of character image animation. However, existing approaches predominantly focus on character animation from a single reference image, substantially limiting their applicability in scenarios such as multiple character interaction animation. To fill this gap, this paper introduces MultiAnimate, a comprehensive framework that enables concurrent animation of multiple characters within a shared environment while preserving both identity consistency and spatial relationships. The framework achieves these objectives through multiple well-designed mechanisms. First, we incorporate an identity-specific reference net that enables appearance extraction from multiple reference images, distinguishing MultiAnimate from existing approaches constrained to single reference inputs. Second, we implement an identity-aware pose encoder to address the character-pose binding challenge, wherein an attention mechanism enables the network to accurately differentiate and process multiple pose sequences during generation. Third, we introduce an interaction guider module that enhances the framework’s capability to handle complex inter-character interactions by leveraging character-specific mask information, serving as an optional component that refines the pose sequences. Extensive experiments and ablation analyses demonstrate our framework’s superiority in multiple character animation, particularly in scenarios involving complex motion sequences.
[CV-71] AnomExpert: Identifying and Selecting Anatomical Planes for Prenatal Ultrasound Anomaly Diagnosis MICCAI2026
链接: https://arxiv.org/abs/2607.13409
作者: Jian Wang,Yang Yang,Ziheng Pan,Xiliang Zhu,Yuhan Zhang,Yanfeng Zhou,Dong Ni
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: It has been accepted early by MICCAI2026
Abstract:Life-limiting congenital anomalies require accurate prenatal diagnosis for appropriate clinical decision-making. Prenatal ultrasound (US) examinations involve multiple anatomical planes, and diagnosis depends on identifying anatomical planes and selecting diagnostically relevant planes for each anomaly. Existing automated methods either rely on plane-level annotations or aggregate heterogeneous images without explicitly modeling these diagnostic capabilities. We propose AnomExpert, a prototype-driven framework for prenatal US anomaly diagnosis using only case-level supervision. AnomExpert introduces learnable plane prototypes to organize unordered images into latent representations corresponding to anatomical planes without requiring plane annotations. A disease-aware sparse selection mechanism further selects diagnostically relevant planes for each anomaly. Experiments on a multi-center dataset of 3,654 cases show that AnomExpert consistently outperforms nine representative multi-instance learning methods. Using a ViT-small backbone, it achieves 86.9% accuracy and 84.2% F1-score while maintaining parameter efficiency. These findings indicate that modeling anatomical plane identification and disease-specific plane selection improves weakly supervised multi-plane prenatal US anomaly classification. The code is available at this https URL.
[CV-72] FM2: Unified Federated Foundation Models for Heterogeneous Multimodal Medical Imaging ACM-MM2026
链接: https://arxiv.org/abs/2607.13386
作者: Shengchao Chen,Ting Shu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted by ACM MM 2026 (Main Track): the 34th ACM International Conference on Multimedia
Abstract:Building foundation models for medical imaging requires pooling data across institutions, yet privacy regulations prohibit centralized aggregation. Existing Federated Foundation Models either fine-tune natural-image models with poor medical-domain transfer, or train from scratch within a single modality, lacking the flexibility to unify tasks. We identify an under-explored challenge, Imaging Modality Heterogeneity, where clients operate under two structural regimes: Overlapped (shared modalities with heterogeneous label distributions) and Non-overlapped (fully disjoint modalities per client). We propose FM ^2 , a unified framework that trains the core backbone from scratch to preserve medical domain fidelity while optionally incorporating biomedical pretrained encoders for vision-language alignment. FM ^2 equips each client with dual Mixture-of-Experts modules (a Class-wise MoE for personalized category knowledge and a Domain-wise MoE for shared cross-modality representations), coupled with a Heterogeneous Modality Alignment (HMA) regularizer that explicitly aligns modality-specific expert parameters, admitting provable O(1/\sqrtT) convergence and generalization guarantees. FM ^2 further incorporates Caption-Enhanced Learning (CEL), where locally retained GPT-4o-generated captions serve as a textual semantic bridge enabling representation transfer across clients with disjoint modalities, and demonstrates extensibility to Federated Medical VQA. Experiments on our MIMH benchmark (classification and CEL) and real-world medical VQA datasets confirm consistent superiority over state-of-the-art federated baselines and strong out-of-modality generalization across all three tasks.
[CV-73] RoughNet: Mapping Arctic Sea Ice Roughness Using Diffusion-Based Super-Resolution of Satellite Imagery
链接: https://arxiv.org/abs/2607.13371
作者: Tessa Cannon,Michel Tsamados,Petru Manescu,Thomas Newman,Christian Haas,Veit Helm,Weibin Chen,Randall Scharien
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Code available at this https URL
Abstract:Accurate estimation of landfast sea ice roughness is critical for climate modeling and safe Arctic over-ice travel, yet existing approaches rely on costly airborne surveys or sparse in-situ measurements, limiting spatial coverage and operational scalability. Here we show that high-resolution sea ice topography can be reconstructed directly from optical satellite imagery using a conditional diffusion framework. Our approach, RoughNet, learns to map 10 m Sentinel-2 multispectral images to locally normalized 1 m surface elevation residual fields, enabling fine-scale roughness characterization from widely available satellite data. Trained on airborne LiDAR data from two Arctic regions and evaluated on an unseen third Arctic region, the model generalizes across diverse ice conditions and partially reproduces small-scale topographic structure. The best-performing model achieves an out-of-domain root mean squared error of 9 cm while preserving the statistical and spectral properties of the underlying roughness field. These results demonstrate that generative diffusion models can recover physically meaningful surface structure from optical imagery alone, providing a scalable pathway for high-resolution sea ice mapping and roughness estimation in data-sparse environments.
[CV-74] DiffGI: Differentiable Geometry Images for High-Fidelity Thin-Shell 3D Generation ECCV2026
链接: https://arxiv.org/abs/2607.13365
作者: Eungjune Shim,Hansol Lee,Eunjung Ju
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ECCV 2026
Abstract:Existing 3D generative models predominantly rely on implicit volumetric representations, which enforce watertight topology and struggle to represent thin-shell and non-manifold geometries such as garments. Geometry image-based approaches offer a surface-centric alternative, but existing methods rely on discrete binary occupancy maps whose resolution-dependent boundary encoding causes staircase artifacts and information loss upon downsampling, while surface reconstruction remains a non-differentiable post-processing step disconnected from the learning pipeline. To address this, we propose Differentiable Geometry Image (DiffGI), an end-to-end 3D-to-2D mapping framework that seamlessly integrates surface representation and geometric optimization. DiffGI replaces binary maps with a continuous 2D Truncated Signed Distance Function (TSDF), which encodes boundary position at subpixel precision within a fixed grid resolution, eliminating resolution-dependent staircase artifacts even under aggressive downsampling. Building on this continuous field, we introduce a differentiable Marching Squares algorithm based on analytical linear interpolation, allowing gradients from 3D surface losses to propagate back to the 2D latent space. Leveraging this differentiable pipeline, we train a DiffGI-VAE augmented with a geometry-aware normal rendering loss to compress complex 3D surfaces into an ultra-compact 32X32 latent space, and instantiate a transformer-based latent diffusion model with a flow-matching objective on top of this space for conditional 3D generation. Extensive experiments on garment and object datasets demonstrate that our method achieves superior reconstruction fidelity and boundary precision compared to prior geometry-image and voxel-based approaches, while requiring significantly fewer computational resources.
[CV-75] Detector Confidence Signals Presence Rather Than Occlusion in Cluttered Manipulation
链接: https://arxiv.org/abs/2607.13361
作者: Yuanzhi He
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 12 pages, 3 figure, 6 tables
Abstract:Occlude a named object until about an eighth of it remains visible, and an open-vocabulary detector’s confidence that the object is present barely changes; as the clutter around it grows the confidence can even rise. On real video the detector still reports the object present in 99% of occluded frames, on another instance of the same category. This matters because that confidence is widely read as a visibility signal, used to threshold detections, evaluate open-vocabulary detectors, ground language, retrieve instances, and gate active perception. We audit whether it reflects occlusion by pairing every view with a geometry-segmentation oracle that gives detector-free ground-truth visibility. As true visibility falls from every scene to one in eight, the confidence stays nearly constant and uncorrelated with visibility, and the detector reports the target present in about nine of ten scenes, firing on same-category distractors: it signals that the category is present somewhere, not that the specific target is visible. The failure holds across three detectors (Grounding DINO, OWLv2, and Segment Anything Model 3), nine object categories, two simulators with different renderers and object sets, built and natural occlusion, and real video. Two consequences follow: a confidence-based metric understates the value of resolving occlusion by about ten times (8 against 88 points in our active-perception setting), and a confidence-based gate fires exactly when the object is hidden. No single-view signal we tried, including a realizable localization check, flags the occlusion, because the occluders sit where the target is. We connect the effect to detector miscalibration and object hallucination, release the controlled benchmark, and recommend target-grounded signals for gating and evaluation.
[CV-76] Audio-Text Cross-Attention with Psycholinguistic Support Features for Ambivalence/Hesitancy Recognition
链接: https://arxiv.org/abs/2607.13345
作者: Luiz F. B. F. Martins,Rodrigo W. Pisaia,Matheus M. Girardi,Isabella Berkembrock,João A. Almeida,André G. Hochuli,Rayson Laroca,Alceu S. Britto Jr
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:We present an audio-text system for the Ambivalence/Hesitancy Video Recognition Challenge of the 11th ABAW Competition. The method excludes visual frames and represents each video as overlapping 5-second windows aligned with transcript timestamps. Each window combines a 320-dimensional prosodic audio descriptor, a 768-dimensional emotion-oriented RoBERTa embedding, and 74 handcrafted features capturing uncertainty, hedging, and attitudinal conflict. Audio and text are fused via temporal cross-attention, while support features are injected prior to gated multiple-instance learning (MIL) pooling to modulate the window’s importance. Predictions from five independently initialized models are averaged. On the labeled public development set, the ensemble achieved an average precision of 0.875 and a macro-F1 of 0.72. Our source code is publicly available at this https URL.
[CV-77] Delving into the Temporal Challenges of Unified Video Protection Against Image-to-Video and Fine-Tuning-based Customization ECCV26 ECCV2026
链接: https://arxiv.org/abs/2607.13336
作者: Yuxin Huang,Ziming Hong,Mingming Gong,Wanyu Wang,Jing Zhang,Tongliang Liu
类目: Computer Vision and Pattern Recognition (cs.CV); Cryptography and Security (cs.CR); Machine Learning (cs.LG)
备注: This work provides a basis for the ECCV 2026 LifeGenIP Challenge on Unlearnable Videos against Diffusion-based Customization. Challenge page: this https URL . Evaluation code: this https URL . Project page: this https URL
Abstract:Recent diffusion-based video generation models have enabled high-quality personalized video customization through both tuning-based pipelines, which fine-tune a video diffusion model, and reference-based pipelines such as image-to-video generation. However, these capabilities raise serious concerns about personal privacy, identity ownership and intellectual property protection. Existing anti-customization works focus on protecting images, while protection for videos against both reference- and tuning-based customization remains largely underexplored. Protecting videos in this setting raises three challenges: (i) Image-level perturbations, optimized frame by frame, cannot survive temporal compression by 3D video VAE. (ii) A video-level perturbation optimized on a single video is vulnerable to temporal editing and fails to protect unseen videos. (iii) Temporally inconsistent perturbations are not robust to temporal attacks. To address these challenges, we propose Temporally Consistent Universal Adversarial Perturbations (TC-UAP), the first protection method against both reference- and tuning-based video customization. TC-UAP optimizes an identity-level multi-frame UAP over sliding windows from multiple videos, accounting for local temporal dependencies induced by temporal compression in video VAE and enabling a single perturbation to protect unseen videos of varying lengths. Moreover, we introduce intrinsic temporal modeling and an extrinsic surrogate temporal-attack loss, which make the perturbation temporally consistent and robust to unseen temporal attacks. Empirically, quantitative and qualitative results show that TC-UAP achieves the strongest identity protection compared with existing methods under both reference- and tuning-based video customization, and remains robust under multiple unseen temporal attacks.
[CV-78] SARFA: Segment Anything with Radiomic Feature Alignment
链接: https://arxiv.org/abs/2607.13323
作者: Tyler Ward,Abdullah Imran
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 15 pages, 9 figures, 5 tables, 1 algorithm
Abstract:The Segment Anything Model (SAM) has demonstrated strong generalizability across a variety of segmentation tasks. However, SAM often struggles in situations where the target to be segmented is ambiguous. This poses a problem in medical imaging, where accurate delineation of targets such as tumors is vital, but even expert radiologists can disagree on the appropriate boundary for a target. Addressing this, we propose SARFA (Segment Anything with Radiomic Feature Alignment), a novel framework for improved medical image segmentation. Via probabilistic prompting, SARFA generates a diverse set of plausible masks for each input image and optimizes them with a radiomics-driven training objective based on Fréchet Radiomic Distance (FRD) and Direct Preference Optimization (DPO). By minimizing the FRD between masked predicted and ground truth regions within each image, SARFA encourages segmentation outputs whose anatomical and textural characteristics align with clinically meaningful ground truth representations, without relying solely on pixel-level overlap. Evaluated on computed tomography (CT) and magnetic resonance imaging (MRI) benchmarks, SARFA outperforms existing ambiguous segmentation methods, demonstrating the effectiveness of radiomic feature alignment and DPO-style candidate mask ranking as a training objective. Our code is available at this https URL.
[CV-79] Reflecting Process Expertise in Procedural Material Generation ECCV2026
链接: https://arxiv.org/abs/2607.13318
作者: Kunal Gupta,Gaurav Joshi,Yen-Ru Chen,Seemandhar Jain,Ishit Mehta,Manmohan Chandraker
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ECCV 2026. Project page: this https URL
Abstract:Procedural material creation underpins applications in digital content creation, visual effects, and 3D asset design. Achieving high-quality results requires more than reproducing node graphs – it demands understanding the process by which experts construct materials. We formulate procedural material generation as retrieval-time process reasoning over expert demonstrations, elevating process to a first-class representation beyond graph-only synthesis. Concretely, we represent expert workflows as process traces: textual records of construction steps, parameters, and design intent. To instantiate this idea, we use a pretrained LLM-based ProcessSynthesizer to synthesize a process trace aligned with a user’s intent and a pretrained LLM-based Compiler to ground the process trace into an executable Blender material graph. Because procedural expertise is most naturally conveyed through demonstrations, we leverage tutorial videos as a source of process knowledge and extract textual, LLM-compatible traces using automated video analysis tools. In an expert study with five Blender artists (avg. 7.5 years of experience), materials generated by reflecting expert demonstrations were found to produce workflows requiring fewer edits, and more closely match professional design strategies than methods operating solely on static artifacts. A user study with 150 participants further shows that our approach achieves superior generation and editing performance compared to prior procedural systems. All code, models, and data will be available at this https URL
[CV-80] Accuracy Without Grounding: Diagnosing Visual Dependency Dissociation in Video LLM Benchmarks ACM-MM
链接: https://arxiv.org/abs/2607.13305
作者: Jae Joong Lee
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Multimedia (cs.MM)
备注: Accepted, ACM International Conference on Multimedia 2026 (ACM MM)
Abstract:Benchmark accuracy in video large language models (LLMs) is often treated as evidence of visual understanding. We audit this assumption across twenty models spanning 2-78B parameters and ten architecture families. We introduce the Visual Dependency Gap (VDG), the difference in per-question correctness between original-video and black-screen conditions. Paired McNemar tests on MVBench show that accuracy and visual dependency are separable: models differ on original video (p = 0.0003) but not on black screens (p = 0.53). Across models, task-type rankings are stable: Attribute Perception is strongly visual, whereas Temporal Reasoning approaches the language-only baseline. A diagnostic ladder from black screen to single frame, shuffled frames, and original video reveals that frame diversity supplies most of the visual benefit, while temporal order contributes near-zero accuracy across sixteen open-weight models. An ablation from 0.5 to 24 FPS rules out sparse sampling as the cause. H.264 experiments further show that stable aggregate accuracy conceals bidirectional question-level answer flips. The diagnostic also generalizes to four API-accessed models, whose VDG values range from 0.025 to 0.315. These results motivate VDG as a standard audit for whether video benchmarks measure visually grounded capability. Code is available at this https URL.
[CV-81] Improving Medical Image Generative Models with Fréchet Distance Loss
链接: https://arxiv.org/abs/2607.13300
作者: Andrew Marshall,Xuanang Xu,Xiaoran Zhang,Rui Wang,Lawrence Staib,James Duncan
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Diffusion generative models have demonstrated immense potential for synthetic medical image generation. However, these models often struggle to capture complex morphological characteristics of heterogeneous tumors with irregular boundaries, limiting their utility for downstream clinical tasks such as segmentation. This limitation stems from the standard denoising objective: minimizing a per-pixel error, which smooths high-variance irregular structures characteristic of tumors. To address this, we propose finetuning these generative models with Fréchet Distance loss (FD-loss). FD-loss aligns the first and second order feature statistics of real and generated images in a pretrained encoder space, encouraging the generator to capture complex structural variations characteristic of heterogeneous tumors. We integrate FD-loss across diverse architectural settings, using both natural- and medical-image encoders on multiple liver and brain cancer datasets spanning CT and MRI modalities. Downstream segmentation networks trained on our FD-regularized synthetic data consistently achieve superior performance, improving tumor DSC by 5% over unregularized synthetic augmentation alone. Qualitative analysis suggests these gains are associated with more faithful tumor synthesis and fewer segmentation hallucinations. Our results show FD-loss as an effective regularizer for medical image generative models to improve clinical workflows.
[CV-82] FOLIO: Focused Semantic Memory for Streaming Video Understanding
链接: https://arxiv.org/abs/2607.13298
作者: Haoyang Fan,Dhruv Parikh,Anvitha Ramachandran,Sameh Gobriel,Nilesh Jain,Rajgopal Kannan,Viktor Prasanna
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 28 pages, 5 figures
Abstract:In online streaming video understanding, a video stream continues to arrive and queries may be issued at any time. Because streaming frames grow without bound, the system must continuously compress and retain information from the observed video prefix while future frames and future queries remain unknown. The core challenge is deciding what information to retain and how to organize the maintained history: as this history grows with the stream, memory cost increases and many redundant visual details are retained, whereas later queries often depend on specific entities, actions, and their temporal changes. To address this challenge, we introduce FOLIO, a training-free focused semantic memory system that records important parts of the stream in higher detail while keeping surrounding context compact. As the stream arrives, FOLIO updates memory at the segment level, guided by a dynamic focus state, combining a short-term visual buffer with a long-term semantic memory organized around observed entities and linked to a visual-evidence cache. At query time, lightweight hybrid retrieval combines direct matching over the structured memory with semantic query expansion. FOLIO achieves state-of-the-art performance, reaching 82.0/69.1 Perception/Backward accuracy on OVO-Bench with Qwen3-VL-8B and 74.5 overall accuracy on StreamingBench, while substantially reducing the cost of maintaining streaming memory by reserving detailed records for focused entities and storing surrounding context compactly.
[CV-83] Differentiable Polarized Path Tracing ECCV2026
链接: https://arxiv.org/abs/2607.13265
作者: Pramod Rao,Jérémy Riviere,Xilong Zhou,Abhijeet Ghosh,Abhimitra Meka,Thabo Beeler,Marc Habermann,Christian Theobalt,Delio Vicini
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at ECCV 2026
Abstract:Physically based differentiable rendering has proven to be a powerful tool for inverse rendering problems (e.g., 3D reconstruction, reflectance estimation, lighting estimation). However, most existing methods operate solely on radiometric intensity, discarding valuable polarization cues that constrain scene geometry and material properties. While forward simulation of polarized light is well-defined via Mueller-Stokes calculus, extending reverse-mode differentiation to this domain presents significant challenges. The rank-deficient nature of common polarimetric operators, such as linear polarizers and diffuse reflections, violates the invertibility assumptions of standard gradient estimators like path replay backpropagation and results in numerical instability. We address this by proposing a robust, polarization-aware differentiable path tracing method. Our approach estimates unbiased gradients through a combination of path replay and local caching. This formulation enables efficient and stable optimization of material and lighting parameters in complex scenes, broadening the applicability of physically based inverse rendering. Project page: this https URL
[CV-84] AffectFlow-DINO: Uncertainty-Aware Multi-Task Affect Estimation via Conditional Rectified Flow
链接: https://arxiv.org/abs/2607.13250
作者: Salah Eddine Bekhouche,Abdellah Zakaria Sellam,Fadi Dornaika,Abdenour Hadid
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:We present \textbfAffectFlow-DINO, a multi-task learning system for the 11th ABAW challenge that extends a standard deterministic architecture with a conditional rectified-flow head to model the inherent ambiguity of in-the-wild facial behavior. Instead of predicting a single affect estimate, the model learns a conditional generative distribution, enabling uncertainty-aware one-to-many predictions through Monte Carlo sampling. The system jointly estimates continuous valence-arousal, classifies eight facial expressions, and detects twelve Action Units from static face images. Built on a frozen DINOv3 ViT-S/16 backbone, extensive ablation studies show that rectified-flow decoding consistently improves deterministic prediction, particularly for valence-arousal estimation (CCC-V +0.058 ). We further show that post-hoc threshold calibration effectively recovers performance on severely imbalanced rare classes (e.g., Fear: 3.8% \rightarrow 33.1% ) without retraining. Combined with backbone fine-tuning and flow retuning, the final model achieves \mathbfP_MTL=1.177 , substantially outperforming the official challenge baseline of P_MTL=0.45 .
[CV-85] Just-In-Time Scene Graph Growth: Combating Perceptual Saturation in Long-Horizon Robotics
链接: https://arxiv.org/abs/2607.13245
作者: Yue Chang,Rufeng Chen,Yifan Tian,Dazhi Huang,Zhaofan Zhang,Yi Chen,Wenze Zhang,Li Chen,Hui Xiong,Sihong Xie
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:While 3D Scene Graphs (3DSGs) provide crucial structured representations for embodied agents, conventional Ahead-of-Time, build-everything-then-filter pipelines conflict with the real-time, low-latency demands of edge platforms, inducing a perceptual saturation effect via severe observation redundancy. To resolve this, we present JITOMA (Just-In-Time On-demand Memory Activation), a closed-loop framework that unifies task reasoning, perception, and memory into a just-in-time growth process. Instead of exhaustively mapping the entire environment, JITOMA leverages a top-down task heatmap at the frontend to filter continuous observations, routing minimal streams to maintain a global foundation of low-cost, dormant anchors. Upon a cognitive query, the backend Large Language Model (LLM) parses the robotic intent to dynamically awaken task-relevant anchors, triggering resource-intensive operations – such as dense node captioning and functional inference – exclusively within the activated local subgraph. To evaluate these dynamic capabilities and study perceptual saturation trade-offs, we introduce JITOMA-Bench, a comprehensive suite for long-horizon multi-tasking and complex multi-step reasoning. Extensive experiments demonstrate that JITOMA substantially reduces active graph size and captioning latency, while maintaining stable processing time under long-horizon task switching.
[CV-86] Active Learning for Efficient Annotation of Surgical Videos with Weak Supervision
链接: https://arxiv.org/abs/2607.13237
作者: Manasa Dendukuri,Matjaz Jogan,Daniel A. Hashimoto,Guiqiu Liao
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Accepted to IPCAI 2026
Abstract:Precise spatial-temporal annotation of laparoscopic videos is time-consuming and requires expert knowledge. We propose a human-in-the-loop knowledge acquisition framework that combines active learning with dual-loss optimization to significantly reduce the annotation effort needed for automatic localization and segmentation of objects in the surgical field. Our method employs a foundation model to generate temporally consistent class activation maps (CAMs) from video using two complementary training objectives: a weak supervision loss on video-level tool presence labels for weakly annotated data, and an image-level mask loss on human-corrected annotations obtained through active learning. Rather than requiring dense pixel-level annotation upfront, our pipeline iteratively proposes pseudo-masks that guide the expert annotator to refine the knowledge previously captured by the model. We demonstrate that our framework reduces the effort of surgical video annotation by 50% by the end of training in comparison to fully manual annotation. Through eliminating the need for large, fully annotated datasets from the start, this framework enables scalability to the development of surgical tool segmentation models. This iterative human-in-the-loop refinement supports efficient knowledge acquisition with minimal expert input, providing a practical and deployable strategy for expanding tool segmentation to larger, more diverse datasets and real-world clinical settings.
[CV-87] Continuously Evolving Deepfake Detection: An Architecture and Public-Benchmark Evaluation of a Dynamic Detection System
链接: https://arxiv.org/abs/2607.13234
作者: Ken Jon Miyachi,Dylan Uys
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 16 pages, 1 figure
Abstract:Deepfake detectors that achieve near-perfect scores on academic benchmarks collapse on real-world content: recent in-the-wild evaluations report AUC drops of 45-50% for state-of-the-art open-source models. We argue this gap is structural: static detectors are trained once against a moving generative frontier. We present BitMind Forensics (BMF), trained through Bittensor SN34, an open adversarial competition that continually refreshes the training distribution. We evaluate one dated export comprising image, general-video, and human-video checkpoints across nineteen public datasets: the canonical face-swap suites (FaceForensics++, Celeb-DF v1/v2/++, DFDC, DFD, UADFV, DF40) and recent in-the-wild and AI-generated-media benchmarks (Sumsub, Deepfake-Eval-2024, WildRF, Community Forensics, AIGCDetectBench, GenImage, AI-GenBench, AIGIBench, RAID, GenVidBench, GenVideo-100K). BMF reaches 0.936 AUC on Sumsub’s original images and 0.872 pooled AUC over its full four-condition manipulation battery (1.4M images), staying robust under perturbation (0.855 JPEG, 0.799 downscaled), while GPEN enhancement improves detection (0.996). On Deepfake-Eval-2024, it matches the best commercial detector on images (0.915 vs 0.90) and exceeds it on video (0.822 vs 0.79), far above the best open-source detectors (0.56 and 0.63). It reaches 0.991 AUC on a 21-generator AI-image panel and 0.918 on GenVidBench, and exceeds the FF+±trained frontier on DFDC (0.947 vs 0.843) and Celeb-DF v2 (0.9985 vs 0.956), both contamination-audited, with statistical parity on Celeb-DF++. In a temporal study, successive dated exports improve on held-out media from generators absent from the static baseline’s training (image 0.842 to 0.902; video 0.864 to 0.936). Our evaluation harness is public, and at publication the production API serves the exact evaluated snapshot for independent verification.
[CV-88] Self-Supervised Visual Representation Learning: Pretrain-Finetuning or Joint Training?
链接: https://arxiv.org/abs/2607.13192
作者: Nusrat Munia,Tyler Ward,Nishat Nayla,Matthew A. Massey,Abdullah-Al-Zubaer Imran
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Self-supervision is a powerful technique for learning visual representations from unlabeled data. Existing techniques primarily adopt a two-stage approach for self-supervised learning (SSL): a pretraining stage on unlabeled data followed by a finetuning stage on labeled data. While this pipeline has demonstrated extreme effectiveness, the interaction between self-supervised and supervised learning objectives remains insufficiently understood. In this work, we systematically investigate whether jointly optimizing the self-supervised and supervised objectives during training provides a better alternative. We compare two training paradigms: (1) the aforementioned pretraining followed by finetuning (PFT) and (2) joint training (JT), where self-supervised and supervised losses are optimized simultaneously in the same network. Across eight representative SSL methods and diverse computer vision tasks on natural, medical, crisis response, and remote sensing data, we evaluate performance under varying percentages of labeled data. Our results reveal that the relative effectiveness of PFT and JT depends strongly on the task at hand, the availability of labeled data, and the complexity of the domain. We find that JT consistently improves data and training efficiency while being robust in low-label settings, while PFT is more reliable in more specialized domains. We further analyze representation quality, robustness, and cross-domain generalization, providing new insights into how self-supervised and supervised objectives interact during optimization. We establish a comprehensive empirical benchmark for hybrid SSL-based semi-supervised learning and offer practical guidance for selecting appropriate training strategies across diverse vision applications.
[CV-89] MGFace: Mask-Gated Face Matching via Conditional Similarity Routing
链接: https://arxiv.org/abs/2607.13187
作者: Huy Che,Hoang-Minh Trinh,Dinh-Duy Phan,Duc-Lung Vu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Face identification has achieved remarkable performance under normal conditions. Yet, its accuracy often degrades significantly when query faces are partially occluded, especially by facial masks. Existing re-ranking approaches improve robustness by exploiting patch-level similarities. Still, they often rely on costly, fine-grained matching mechanisms, which limit their efficiency in large-scale retrieval scenarios. In this paper, we propose MGFace, a mask-gated face identification pipeline that predicts the mask status of a query face and conditionally routes the similarity computation accordingly. Specifically, MGFace distinguishes between masked and unmasked queries, applies global embedding matching to unmasked queries, and activates mask-aware patch-level re-ranking only for masked queries. This design focuses on reliable upper-face regions while avoiding unnecessary fine-grained computation. Experiments on the extended LFW-Mask dataset show that MGFace achieves over 80% identification accuracy with the FaceNet backbone and over 90% with the ArcFace backbone. Compared with a previous EMD-based re-ranking method, MGFace achieves better identification performance while reducing query time by approximately 20x. These results demonstrate the effectiveness of MGFace in improving masked-face identification accuracy with low computational overhead. The source code is available at this https URL.
[CV-90] A Masked Autoencoder Approach to Unsupervised Steel Surface Defect Recognition
链接: https://arxiv.org/abs/2607.13178
作者: Shrey Patel
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Automated visual inspection of steel surface defects is a recurring quality control task in which labeled defect data is scarce and costly to obtain, while unlabeled surface images are abundant, which motivates self supervised methods that learn useful representations without class labels. A Transformer based Masked Autoencoder is used here to learn representations of steel surface defects for unsupervised grouping. During pretraining, 75% of the input image patches are randomly masked, and a lightweight decoder reconstructs the masked regions from the visible 25%. The encoder is trained jointly with an auxiliary defect localization objective, used only as a training signal and not evaluated as a detector. The decoder reaches a structural similarity score of 0.92 and a mean squared error of 0.47. Features from the pretrained encoder are then clustered using UMAP for dimensionality reduction and Agglomerative clustering, reaching a Hungarian matched accuracy of 91.3% against the six known defect categories.
[CV-91] Boogu-Image-0.1: Boosting Open-Source Unified Multimodal Understanding and Generation
链接: https://arxiv.org/abs/2607.13125
作者: Guoxuan Chen,Chufeng Xiao,Haoran Yang,Siyue Xie,Binxiao Huang,Ming Zhang,Cheuk Him Chau,Xinyu Fu,Yingzhao Lian,Tom S.Y. Li,Jintao Lin,Bowen Dong,Zian Qian,Yuhao Liu,Yuxuan Hu,Weikang Shi,Bin Zou,Bowen Zheng,Haoxuan Che,Chang Chen,Yuyang He,Heyang Sun,Tianyu Huang,Chong Hou Choi,Cheng Gong,Han Shi,Haoli Bai,Xihui Liu,Hongsheng Li,Qifeng Chen,Chao Huang,Rui Liu,Chenyang Lei
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:We introduce Boogu-Image-0.1, an open-source unified multimodal understanding and generation model family, comprising Base, Turbo, Edit, and Edit-Turbo variants. It delivers competitive performance in high-quality text-to-image generation, fast inference, instruction-based editing, and bilingual (Chinese-English) text rendering. Closed-source multimodal systems like Nano-Banana-Pro and GPT-Image-2 achieve strong performance through system-level integration rather than a single model, yet their internal practices remain largely undisclosed. In this work, we demonstrate that targeted improvements in model understanding, data quality, and training pipelines, coupled with agentic inference-time scaling, can substantially enhance generation and editing performance even under highly constrained compute budgets. Comprehensive evaluations show that Boogu-Image-0.1 consistently matches or surpasses other open-source models across standard benchmarks, and achieves results approaching leading closed-source systems. Notably, this is accomplished with only 208.62 million unique images. The base model’s theoretical training cost is only approximately \ 400K. We share practical discussions that we believe are valuable to the broader research community, and release weights, code, and recipes under Apache 2.0 to advance the open ecosystem for unified multimodal understanding and generation. Our code is available here: this https URL.
[CV-92] C-Norm: Cell-Distribution Normalization Enables Precision Recognition of Medical-Cell Image
链接: https://arxiv.org/abs/2607.13116
作者: Yang Qianl,Liu Xiany,Dai Daw,Chen Jing,Shen Xiaoj,Fu Kaiw,Tang Ming,Zou Dongl
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 33;11
Abstract:ThinPrep Cytologic Test (TCT) enables early cervical cancer screening, but manual reading is time-consuming and yields inconsistent diagnostic results among cytopathologists. Existing AI detection models perform poorly under real clinical conditions, primarily restricted by two key constraints: unbalanced spatial distribution of cell populations in TCT slides, and limited high-quality annotated cytology data relying on professional pathologist labeling. To address these limitations, we propose a Cell-Distribution Normalization (C-Norm) method. By decoupling abnormal and normal cells from the original TCT images and re-synthesizing them, this method ensures a uniform distribution of cell populations, thereby mitigating generalization degradation caused by distribution bias. Building upon this, we integrate the YOLOv12 framework with a DINOv3 module. This hybrid architecture leverages the advanced detection capability of YOLO models and the superior feature representations of DINOv3 to capture subtle morphological nuances essential for precise recognition of TCT images. Extensive experiments demonstrate that our proposed method achieves state-of-the-art performance, significantly outperforming mainstream detection algorithms. The complete implementation is available at: this https URL
[CV-93] Beyond Backbone Backpropagation: A Decoupled Strategy for Efficient Transfer Learning
链接: https://arxiv.org/abs/2607.13043
作者: Daniel Vila-Cruz,Laura Morán-Fernández,Verónica Bolón-Canedo
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Deep learning models achieve state-of-the-art image classification but face deployment challenges due to computational costs and energy demands. We propose a lightweight training strategy that adapts normalization layers of the model to the new domain and decouples feature extraction from classifier optimization, reducing overhead by precomputing features only once. A redesigned classifier head with margin-based weighted loss further minimizes ambiguity without end-to-end backpropagation. Evaluated across four CNN architectures (ResNet18, ResNet50, MobileNet, DenseNet121), three Transformer models (ViT, Swin and DeiT) and three medical datasets (Brain Cancer MRI, BreakHis and PatchCamelyon), our approach significantly reduces the required training time with only a marginal accuracy trade-off, often matching or surpassing baseline performance. This efficiency translates to reducing CO2 by orders of magnitude, offering a practical and environmentally sustainable solution for resource-constrained clinical or prototyping environments.
[CV-94] CAM-Diff: Triplane-Aware Cross-Attention Medical Diffusion Model AAAI2025
链接: https://arxiv.org/abs/2607.13812
作者: Zhenkai Zhang,Krista A. Ehinger,Tom Drummond
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at AAAI 2025. Code is available at this https URL
Abstract:We introduce TCAM-Diff, a novel 3D medical image generation model that reduces the memory requirements to encode and generate high-resolution 3D data. This model utilizes a decoder-only autoencoder method to learn triplane representation from dense volume and leverages generalization operations to prevent overfitting. Subsequently, it uses a triplane-aware cross-attention diffusion model to learn and integrate these features effectively. Furthermore, the features generated by the diffusion model can be rapidly transformed into 3D volumes using a pre-trained decoder module. Our experiments on three different scales of medical datasets, BrainTumour 128 x 128 x 128, Pancreas 256 x 256 x 256, and Colon 512 x 512 x 512, demonstrate outstanding results. We utilized MSE and SSIM to assess reconstruction quality and leveraged the Wasserstein Generative Adversarial Network (W-GAN) critic to assess generative quality. Comparisons with existing approaches show that our method gives better reconstruction and generation results than other encoder-decoder methods with similar-sized latent spaces.
[CV-95] Video to All-in-focus Image Reconstruction Algorithm for Automated Microscopic Urinalysis
链接: https://arxiv.org/abs/2607.13601
作者: Chinmay Nema,Hari Om Aggrawal,Dipam Goswami,Rajiv Gupta,Vinti Agarwal
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Signal Processing (eess.SP)
备注:
Abstract:Microscopic urinalysis is a routine diagnostic test at hospitals. Recent studies have demonstrated the effectiveness of deep learning methods to automate microscopic urinalysis. These methods rely on high-quality images of the urine samples in which each cell is clearly identifiable. However, in practice, the urine sample on a glass slide has a multi-layer structure; hence, all the cells are not clearly visible within the depth of field of a lens focused at a particular focal plane. It demands acquiring multiple images at different focal planes to correctly identify each cell in a given urine sample, which is a time-consuming task. In this paper, we propose to simplify the task by recording a video, in place of acquiring multiple images, while gradually changing the focus of the lens manually by hand. A typical length of the video is from 2 to 14 seconds. We reconstruct an all-in-focus image from the recorded video frames and apply a deep learning model to detect and classify urine sediments. As a proof of concept, we conduct experiments on 14 videos acquired by a trained lab technician in a usual diagnostic lab environment and show the effectiveness of the proposed automated urinalysis pipeline with our novel reconstruction algorithm. Subjects: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Signal Processing (eess.SP) Cite as: arXiv:2607.13601 [eess.IV] (or arXiv:2607.13601v1 [eess.IV] for this version) https://doi.org/10.48550/arXiv.2607.13601 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-96] Efficient Computing for Medical Image Acquisition and Reconstruction
链接: https://arxiv.org/abs/2607.13204
作者: Xiao Wang,Jayasai Rajagopal,Md Safaiat Hossain,Peng Chen,Mohamed Wahib,Enzhi Zhang,Emma J. Reid
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Mathematical Physics (math-ph)
备注: book chapter for textbook “Medical Image Vision Handbook”
Abstract:Medical imaging systems such as CT, MRI, PET, and SPECT do not directly acquire images. Instead, they measure physical signals that encode anatomical or physiological information, and image reconstruction recovers the underlying image by solving an inverse problem. Although these imaging modalities are governed by different imaging physics, they share a common computational framework that naturally connects medical physics, linear algebra, probability, numerical optimization, and efficient computing. As medical imaging systems acquire increasingly large and higher-dimensional datasets, image reconstruction has become one of the primary computational bottlenecks in modern medical imaging. Advanced reconstruction methods, including analytical reconstruction, iterative optimization, and statistical model-based reconstruction, substantially improve image quality while reducing radiation dose or scan time, but at significantly increased computational cost. Efficient computing has therefore become essential for achieving clinically practical reconstruction times. This chapter presents a unified computational perspective on medical image acquisition and reconstruction across CT, MRI, PET, and SPECT. It first reviews the imaging physics and data acquisition process for each modality and derives a generalized mathematical framework for image reconstruction. Building on this framework, the chapter discusses analytical, iterative, and statistical reconstruction methods together with their computational characteristics. Finally, it examines efficient computing considerations, including optimization algorithms, physics-aware forward operators, memory-efficient implementations, and parallel computing strategies. Together, these topics demonstrate how the integration of imaging physics, mathematical modeling, and efficient computing enables accurate and scalable medical image reconstruction.
[CV-97] Quantum Circuit Vision: Cost-Aware Evaluation of Visual AI Agents for Quantum Code Generation
链接: https://arxiv.org/abs/2607.10057
作者: Dongping Liu,Aoyu Zhang,Luyao Zhang
类目: Quantum Physics (quant-ph); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Can AI agents visually comprehend quantum circuit diagrams and generate verified executable code–and at what cost? We present Quantum Circuit Vision, a cost-aware evaluation framework for multimodal AI agents on quantum circuit visual understanding. We construct a 132-circuit benchmark spanning 13 categories ( 1 – 10 qubits) with executable Amazon Braket code and unitary-fidelity verification. Evaluating three frontier Claude-family models at different capability-cost tiers with n=5 repeated trials, we find that the mid-tier model (Sonnet 4.6, 1.30\times credits) offers the most favorable balance on the cost-accuracy frontier: 91% pass rate on the core subset at 18% of the per-call cost of the strongest model (Opus 4.6), whose accuracy advantage is not statistically significant (paired t : p=0.083 ). Logistic regression confirms that circuit depth–not qubit count–is the primary predictor of failure ( p0.001 ). Chain-of-thought prompting shows no statistically significant effect (all p0.18 , n=5 ), suggesting that visual pattern recognition outweighs explicit reasoning strategy for structurally coupled diagrams. We propose a cascade routing strategy (cheap \rightarrow expensive models) that achieves 84% accuracy at 38% of single-model cost, demonstrating that model routing dominates prompt engineering as a cost lever. We release QCV-Dataset (132 circuits, 5 modalities, 1,931 files) on Hugging Face Hub as an open evaluation infrastructure with structured metadata for discoverability, interoperability, and responsible AI documentation, and all evaluation code, cost logs, and verification scripts on GitHub for full reproducibility.
人工智能
[AI-0] Deep Interaction: An Efficient Human-AI Interaction Method for Large Reasoning Models
链接: https://arxiv.org/abs/2607.14049
作者: Hefeng Zhou,Jinxuan Zhang,Jiong Lou,Yuxin Liu,Chaochao Lu,Jingjing Qu,Jie Li
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:The emergence of Chain-of-Thought (CoT) reasoning has significantly enhanced the ability of large language models (LLMs) to tackle complex, multi-step tasks. However, when errors occur, current interaction approaches typically involve re-generating another response that may make mistakes again, or users laboriously flag the faulty step in follow-up turns that may get responses You are right, I made a mistake here followed by similar errors recurring. To address this issue, we propose an efficient human intervention mechanism for precisely correcting reasoning errors in LLMs, termed Deep Interaction. Our approach enables direct editing of the original response, allowing erroneous parts to be corrected while preserving accurate reasoning steps. We refine the edited CoT into a distilled prompt, which then steers the LLM along the corrected reasoning path. Experimental results show that our method achieves over a 25% improvement in correction success rate and reduces token usage by approximately 40% on STEM tasks reasoning compared to baseline approaches.
[AI-1] Earthquaker-AI: A Retrieval-Augmented Generation Framework with Rubric-Based Assessment for Primary School Earthquake Education
链接: https://arxiv.org/abs/2607.14046
作者: Xanthi Kokkinou,Chaido Mizeli,Nafsika Koulaxidou,Marina Delianidi,Konstantinos Diamantaras
类目: Artificial Intelligence (cs.AI)
备注: 17 pages, 4 figures
Abstract:This paper presents Earthquaker-AI, a hybrid educational framework building upon a previously implemented educational robotics project by integrating a conversational AI assistant based on Retrieval-Augmented Generation. It aims to enhance earthquake preparedness and conscious action among primary-school students. The system extends the award-winning STEM project Earthquaker moving from mechanical simulation with Lego WeDo2 to cognitive and metacognitive processing. The robotics component uses Lego WeDo2 automation to simulate seismic response, letting students interact with sensors and actuators as tangible representations of protective actions. The assistant operates as a guided learning mechanism aligning student responses with safety guidelines, while providing rubric-based verbal feedback that supports self-regulated learning and calmness under emergency conditions. Earthquaker-AI follows a progressive learning trajectory aligned with cognitive development. In early grades, the focus is on basic recognition of safety actions through multiple-choice questions, assessed via a two-dimensional rubric. In middle grades, students identify correct action sequences through multiple-choice questions, evaluated via a three-axis rubric. In upper grades, the approach shifts to verbal production, requiring short written responses assessed via a four-dimensional rubric that includes clarity of expression. The dialogic module uses RAG to match student queries semantically with official guidelines, generating safe, accurate responses. Experimental evaluation shows high groundedness and accuracy, with a low hallucination rate. Overall, Earthquaker-AI combines hands-on engagement, information processing, and reflective practice. Combining robotics, rubrics, and AI promotes technological literacy, self-regulation, and responsible use of digital systems, contributing to early crisis-management skills.
[AI-2] AI-accelerated End-to-End Framework for Rapid Professional Upskilling
链接: https://arxiv.org/abs/2607.14044
作者: Tam Nguyen,Hung Nguyen,Robert Ogburn
类目: Artificial Intelligence (cs.AI)
备注: 6 pages, 1 figure, 1 table
Abstract:By 2030, 59 of every 100 workers will need reskilling or upskilling, yet the average time to close an enterprise skills gap grew from roughly 3 days in 2014 to 36 days in 2018. Most current frameworks accelerate single stages of upskilling programs and generally lack industry validation. We present an end-to-end framework that applies AI acceleration across five stages of knowledge acquisition, content development, content review and verification, teaching, and assessment development; with a strong focus on both production and learning efficiency. Three strong external signals validates the framework: the US National Association of State Boards of Accountancy reviewed and approved an upskilling program built on the framework for continuing-professional-education credits; 3 learners followed the program and passed the NVIDIA Certified Professional in Agentic AI exam in a significantly short amount of time, with 14 more in progress; the program’s knowledge base supports complex downstream analysis such as the production of a robust 1,267 risk item dataset for managing multi-agent AI system risks.
[AI-3] Early Adoption of Agent ic Coding Tools by GitHub Projects KDD2026
链接: https://arxiv.org/abs/2607.14037
作者: Maliha Noushin Raida,Daqing Hou
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI); Computers and Society (cs.CY); Machine Learning (cs.LG)
备注: Accepted at the KDD 2026 Workshop on Agentic Software Engineering (SE 3.0)
Abstract:Agentic coding tools are increasingly capable of generating and submitting pull requests (PRs) to software projects, introducing new forms of human-agent collaboration in software development. While prior studies have examined PR-level outcomes of agent-generated contributions, less is known about how agentic coding tools are adopted and managed at the project level. In this paper, we analyze 25,264 agentic PRs from 2,361 popular GitHub repositories to investigate (1) the adoption of agentic coding tools, (2) project-level agentic PR productivity, and (3) human-agent collaboration patterns. Our results show that the median repository generates only one to two agentic PRs during a three-month period, indicating that intensive adoption remains concentrated in a small subset of projects. At the same time, small projects (1-5 contributors) exhibit higher participation ratios and average levels of agentic PR activity than medium-sized and large projects. We also observe substantial variation in project-level agentic PR productivity. While a small number of projects exceed an industry-reported estimate of 36 PRs per participant during the three-month observation period, most projects remain below this threshold. Finally, human-agent collaboration is dominated by a single-human oversight model, in which one developer reviews and/or modifies the agent’s contributions, while multi-human collaboration patterns remain uncommon. These findings provide early empirical evidence on how open-source projects organize human oversight around agentic coding tools and suggest that successful integration of agent-generated contributions depends not only on advances in agent capabilities but also on the human and organizational processes that govern their use. Because this study captures an early snapshot of agent adoption, future work should continue to track how adoption patterns evolve over time.
[AI-4] Improving Wind and Solar Power Prediction with Efficient Wrapper-based Feature Selection: An Empirical Study
链接: https://arxiv.org/abs/2607.14024
作者: Daniel Grillmeyer,Marius Hadry,Michael Stenger,Vanessa Borst,Veronika Lesch,Samuel Kounev
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 17 pages, 5 figures
Abstract:With rising global energy demand and growing awareness of climate change and its impacts, the share of renewable energies in the global energy mix continues to grow. Unlike conventional power generation, the output of renewable energy sources cannot be controlled as consistently due to their dependence on environmental conditions. Therefore, reliable prediction of current and future energy production is essential. In this paper, we report findings from two structured literature reviews on real-world renewable energy prediction tasks: wind turbine power curve modeling and photovoltaic power prediction. For the former, we conducted a comprehensive literature review ourselves, while for the latter, we synthesize the key findings regarding frequently selected input features based on an existing survey. Across both domains, our analysis reveals that despite the large number of available monitoring and environmental variables, only limited or unsystematic methods for feature selection exist. To address this gap, we propose Cluster-based Sequential Feature Selection (CSFS), a novel, model-agnostic, clustering-based wrapper method for automatic, efficient, and reliable feature selection in renewable energy prediction pipelines. To support reproducibility and reuse, we provide an open-source implementation of CSFS on GitHub. We empirically evaluate the proposed approach on both use cases and compare it with established feature selection techniques such as wrapper-based sequential feature selection (SFS), filter-based methods, and Random Forest’s embedded feature importance. The results show that the wrapper-based methods overall provide better-performing selections of features. CSFS achieves a predictive performance comparable to SFS while reducing computational cost by an average of 21%.
[AI-5] ransforming Rank: How Architecture Navigates the Spectral Pathologies of Depth
链接: https://arxiv.org/abs/2607.14018
作者: Katie Everett
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 40 pages. Code: this https URL
Abstract:We investigate how each component of the Transformer feedforward block architecture design determines how much rank survives across depth at initialization. We reinterpret skip connections and normalization, long understood as controlling magnitude, as mechanisms for preserving gradient rank across depth, since the very matrix multiplications and nonlinear activations that make the network expressive also reduce the rank. We show that skip connections trade off rank collapse against ensemble-like behavior, controlled by the relative scales of the branch and the skip: skip connections route the gradient around the residual branch, where rank is lost, rather than along the long gradient paths that encourage the layers to compose. The placement of the normalization layer controls this same tradeoff by setting the branch-to-skip ratio across depth, unifying much of the normalization placement and depth scaling literature, in particular why rank collapses for Post-Norm but plateaus for Pre-Norm. Other aspects of the architecture, like the two-matrix structure that expands and contracts the width, use additional parameters to preserve the representation or branch Jacobian rank. The second matrix decorrelates a coherent mean spike that would grow across blocks with a single matrix and uncentered activation, preventing the residual representation from collapsing. The width expansion between the two matrices keeps the branch Jacobian full rank: applying the rank-reducing activation in this expanded space leaves enough directions to span the original, at a width that follows a Marchenko–Pastur law. The initialization rank of the input–output Jacobian predicts which networks train on CIFAR-10. Taken together, we recast architecture design for deep networks as navigating an intrinsic tradeoff among rank collapse, ensemble-like behavior, and parameter count.
[AI-6] Rethinking Penetration Testing for AI-Enabled Systems: From Resource Compromise to Behavioral Objective Violation
链接: https://arxiv.org/abs/2607.14006
作者: Mohammad Allahbakhsh,Mohammad Hassan Bahari,Moslem Attar-Raouf
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注: 42 pages, 5 Tables, 21 references
Abstract:Penetration testing traditionally evaluates whether adversaries can exploit weaknesses in software, infrastructure, configurations, or operational controls to achieve security-relevant compromise. This paradigm remains necessary for AI-enabled systems, but it is no longer sufficient. In such systems, adversaries may influence prompts, retrieved content, sensor inputs, training data, memory, tools, or human-AI interaction loops to alter system behavior without directly compromising the underlying infrastructure. This paper reframes penetration testing for AI-enabled systems as objective-driven behavioral evaluation. We define an AI-enabled system as one in which learned models materially influence behavior affecting operational outcomes, and we define AI-enabled penetration as the feasible induction of AI-governed behavior that violates one or more operational objectives under an explicit threat model. This definition preserves conventional penetration testing while extending it to adversarial pathways such as prompt injection, indirect prompt injection, data poisoning, sensor manipulation, retrieval poisoning, tool misuse, and agentic misalignment. We further propose a testing workflow that identifies operational objectives, maps AI-governed behavior, analyzes adversarial influence surfaces, defines behavioral failure criteria, executes scenario-based tests, and reports evidence linking adversarial action to objective violation. A running example involving an AI-enabled security operations center assistant illustrates how penetration may occur through behavioral influence rather than infrastructure compromise. Together, the definitions, workflow, and example provide a technical framework for evaluating adversarial success in deployed AI-enabled systems.
[AI-7] A Self-Evolving Agent for Longitudinal Personal Health Management ALT
链接: https://arxiv.org/abs/2607.13940
作者: Haoran Li,Jiebi Deng,Tong Jin,Jinghong Han,Yuxin Wang,Zexin Wang,Qingyi Si,Weikang Gong,Xiahai Zhuang,Jia You,Wei Cheng,Jianfeng Feng,Hongcheng Guo
类目: Artificial Intelligence (cs.AI)
备注: 20 pages, 4 figures, 6 supplementary tables. Code: this https URL
Abstract:Personal health management unfolds over repeated encounters, yet most health AI systems treat each request in isolation. We developed HealthClaw, an open-source agent architecture that updates support as a person’s routines, preferences, measurements and risks change. It separates shared safety rules and medical knowledge from private longitudinal memory containing profile facts, reusable procedures and episodic traces. After each episode, induction determines what should update the profile, revise a procedure, remain episodic or be excluded. We evaluated HealthClaw with a synthetic year-long benchmark and nine 200-case biomedical tasks. Across 900 longitudinal support probes, answer accuracy increased from 0.2% with current-query prompting to 45.7% with HealthClaw, while prompt-side context exposure was 71.7% lower than with full-history prompting. In 100 privacy probes, HealthClaw produced higher privacy-aware answer quality and fewer unsafe disclosures than both baselines. Across the biomedical tasks, the mean absolute gain in the task-specific primary metric was 27.0 percentage points, and seven gains remained significant after false-discovery-rate correction. These offline benchmarks support governed, self-evolving memory for longitudinal personal health agents, although clinical effectiveness requires prospective evaluation. HealthClaw is publicly available at this https URL.
[AI-8] Generative Compilation: On-the-Fly Compiler Feedback as AI Generates Code
链接: https://arxiv.org/abs/2607.13921
作者: Niels Mündler-Sasahara,Hristo Venev,Dawn Song,Martin Vechev,Jingxuan He
类目: Programming Languages (cs.PL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Languages with rich static semantics, such as Rust, provide stronger guarantees for AI-generated code, but their strictness makes generation more difficult. Off-the-shelf compilers can provide useful feedback post-generation, but does not guide intermediate generation steps, such as those during autoregressive LLM decoding. Constrained decoding intervenes earlier by rejecting invalid tokens during sampling, but requires white-box model access and costly reimplementation for semantic this http URL introduce generative compilation, the first approach to obtaining compiler feedback on partial programs during generation. The core technical device is a sealor: a lightweight, mostly syntax-guided transformation that converts partial programs into complete ones that standard compilers can diagnose. It is designed such that possible-to-complete partial programs are never rejected, while preserving enough code context to catch genuine dead ends early. We construct such a sealor on a core Rust-like calculus and prove that it satisfies these properties, all mechanized in Lean. We extend it to the first partial-program checker for real Rust. We evaluate our method on challenging repository-level Rust coding tasks, across both frontier black-box and open-weight models. We show that generative compilation reduces non-compiling outputs and improves functional correctness, relative to standard post-generation feedback. It does so by detecting a broad range of errors close to their source and early during generation, thereby reducing errors cascades and enabling focused diagnostics. More broadly, generative compilation is a step toward making compilers a first-class citizen of AI-assisted programming active during generation, rather than a separate post-generation check.
[AI-9] AIMO Interpretability Challenge NEURIPS2026
链接: https://arxiv.org/abs/2607.13899
作者: Michal Štefánik,Philipp Mondorf,Andreas Waldis,Qianying Liu,Chuan Yang,Michal Spiegel,Josef Kuchař,Marek Kadlčík,Adam Vawda-Oomerjee,Chaoran Liu,Simon Frieder,Barbara Plank,Fazl Barez,Pontus Stenetorp
类目: Artificial Intelligence (cs.AI)
备注: Accepted Competition at NeurIPS 2026
Abstract:We propose the AIMO Interpretability Challenge, a competition on distinguishing robust from spurious reasoning in frontier mathematical language models based on the models’ internal mechanisms. The challenge is motivated by a central limitation of standard reasoning benchmarks: strong final-answer accuracy does not reveal whether a model relies on stable reasoning mechanisms or exploits brittle reasoning shortcuts. Building on AI Mathematical Olympiad (AIMO) problems and submissions, together with resources from the Fields Model Initiative, the competition will provide (1) newly-published olympiad-level math reasoning problems and their symbolic representations, allowing generation of novel functional variants, (2) access to frontier reasoning models, and (3) assessments of models’ adversarial robustness on these problems. Participants will use these resources, along with our computing infrastructure support, to develop methods for identifying which models solve problems robustly. Our competition will also create a new, open robustness benchmark and baseline systems, aiming to provide a lasting foundation for standard benchmarking in mathematical reasoning and interpretability. Scientifically, the competition connects interpretability and generalization research around a central question in AI research: can we determine if, and to what extent, the decision-making of frontier AI models is generalizable and thus, reliable?
[AI-10] Experience Memory Graph: One-Shot Error Correction for Agents
链接: https://arxiv.org/abs/2607.13884
作者: Wenjun Wang,Yuchen Fang,Fengrui Liu,Zibo Liang,Kai Zheng
类目: Artificial Intelligence (cs.AI)
备注: 11 pages, 6 figures
Abstract:Large Language Model (LLM) agents have shown remarkable capabilities in autonomous decision-making by generating sequential trajectories of states, actions, and observations. However, in complex, long-horizon tasks, these agents frequently suffer from compounding errors and struggle to recover from failures. Existing self-correction mechanisms rely on prompt-based reflection, which is inherently brittle, incurs heavy time and API costs due to iterative trial-and-error loops, and produces task-specific memory that may be hard to generalize to new scenarios. To address this, we propose Experience Memory Graph (EMG), a framework that reformulates agent failure recovery as a graph matching problem. At training time, we convert both failed exploration trajectories and successful expert trajectories into directed action decision graphs. By matching these graphs, we extract common subgraphs (successful workflows) and graph edit paths that explicitly indicate how to correct failures (e.g., which actions to add, delete, or relabel under a given observation), and store them in a memory graph with intra-task nodes and cross-task edges. At test time, EMG retrieves relevant insights and guides the agent in a single, loop-free execution. Experiments on ALFWorld and ScienceWorld show that EMG consistently outperforms state-of-the-art reflection baselines in success rate and average reward, while requiring no test-time trial-and-error.
[AI-11] AI-Augmented Human Resource Management? Insights from German companies
链接: https://arxiv.org/abs/2607.13839
作者: Yannick Kalff,Katharina Simbeck
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI)
备注: 2 Figures, 2 Tables
Abstract:This study examines the integration of AI into Human Resource Management in German companies. We ask if and how AI-based technologies are \enquoteaugmenting human resource management. Organisations employ generative AI or predictive analytics to transform traditional human resource functions, to streamline routine tasks and to reallocate resources toward strategic, people-centred activities. Our findings from interviews and group discussions and a survey (N=410) reveal that while AI tools enhance HR analytics capabilities, their adoption mainly serves efficiency and rationalising goals. The introduction of AI tools is shaped by organisational transformation factors such as digital infrastructure, co-determination frameworks, and ethical implications. The research highlights both the strategic potential for improved talent development and the challenges posed by data governance and algorithmic transparency. Overall, this work contributes to understanding the ambiguous role of technological change in HR, which promises to augment predictive capabilities yet serves the ends of efficiency and rationalisation.
[AI-12] NodeImport: Imbalanced Node Classification with Node Importance Assessment
链接: https://arxiv.org/abs/2607.13837
作者: Nan Chen,Zemin Liu,Bryan Hooi,Bingsheng He,Jun Hu,Jia Chen
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:In real-world applications, node classification on graphs often faces the challenge of class imbalance, where majority classes dominate training, resulting in biased model performance. Traditional GNNs often struggle in such scenarios, as they tend to overfit to majority classes while underrepresenting minority classes. Existing solutions, which either prioritize nodes based on class size or synthesize new nodes for minority classes, often fall short of effectively addressing this imbalance issue. This paper introduces an approach to class-imbalanced node classification by utilizing a balanced meta-set for importance measurement, where a training node is considered significant if it enhances model performance under an unbiased setting. Our method identifies important nodes that can counteract class imbalance and utilizes them for model training, allowing for fine-grained and dynamic node selection throughout the training process. We theoretically derive a formula to directly assess node importance, reducing computational overhead and providing an intuitive threshold for node selection. Guided by this metric, we develop a novel framework that filters valuable labeled, unlabeled, and synthetic nodes that enhance model performance in an unbiased context. A key advantage of this framework is its separation of the synthetic node generation process from the filtering process, ensuring compatibility with various node generation methods. Furthermore, we introduce a strategy to construct a high-quality meta-set that closely approximates the overall feature distribution, ensuring robust representation of each class. We evaluate our framework, NodeImport, across multiple datasets using popular GNN architectures, demonstrating its superiority over existing baselines. Our results highlight the flexibility and effectiveness of the framework in mitigating class imbalance, leading to improved outcomes.
[AI-13] raffic-Aware Randomized Smoothing for LLM -Based Network Intrusion Detection
链接: https://arxiv.org/abs/2607.13801
作者: Zhenpeng Li
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 44 pages, 14 figures, 14 tables. Submitted to Expert Systems with Applications
Abstract:Large language model (LLM)-based intrusion detection systems (IDS) are increasingly studied for security monitoring, yet their robustness against feasible traffic manipulation remains largely empirical. We present Traffic-Aware Randomized Smoothing (TA-RS), a classifier-agnostic certified defense that injects Gaussian noise exclusively into the directly controllable (DC) subspace – features a remote attacker can modify – during both fine-tuning and certification, aligning the smoothing distribution with the attacker-controllable subspace. We identify a critical prerequisite: applying standard randomized smoothing to clean-trained LLM-IDS yields weak certified accuracy in three of four (model, dataset) pairs tested (14-33%, at or below random) and only 57% in the fourth (43 pp below the noise-augmented result); noise-augmented fine-tuning recovers to 68-100% on two of three benchmark datasets (at sigma=0.25). At the L_inf-equivalent threshold R_inf = epsilon*sqrt(|DC|) (epsilon=0.05), TA-RS achieves 55-100% certified accuracy on CIC-IDS-2018 and HIKARI-2021, with median certified radii (R approx 0.45-0.96) exceeding R_inf by 1.8-5x (across sigma=0.25-1.00). Against a fairly trained iso-trained RS baseline the residual advantage is dataset-dependent (4-19 pp on CIC-IDS-2018). The larger gap – up to 72 pp against an isotropic RS baseline that shares the DC-noise-augmented training recipe – primarily reflects the training-certification mismatch rather than DC alignment alone: isotropic test-time noise perturbs uncontrollable features the attacker cannot exploit, triggering abstention rates up to 68%. RT-IoT2022 probes the limits of the method: it fails under the default fine-tuning recipe but recovers to 76%/69% certified accuracy (LLaMA3-8B/Qwen3-8B) when noise augmentation is increased.
[AI-14] CAS I: A Geometric Coding Theorem
链接: https://arxiv.org/abs/2607.13796
作者: Romie Banerjee
类目: Information Theory (cs.IT); Artificial Intelligence (cs.AI); Category Theory (math.CT); Group Theory (math.GR)
备注:
Abstract:This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings, called symmetries and define the symmetry prior of a string as the probability that a randomly chosen symmetry from a given group has the string as its unique fixed point. We show that for any fix-retractable symmetry group, a group admitting a computable section that selects an isolating symmetry for every string, the symmetry prior is a universal lower semi-computable semi-measure. In this case, the Geometric Coding Theorem holds. We also develop a Galois connection between subgroups of G and subsets of binary strings, characterizing closed points and maximal closed subgroups, and explore the join-semilattice of dense subgroups. Our results unify algorithmic information theory with group theory and provide a framework for studying symmetry-induced complexity measures. This paper is the first in a series on Computational Algorithmic Statistics (CAS). Subjects: Information Theory (cs.IT); Artificial Intelligence (cs.AI); Category Theory (math.CT); Group Theory (math.GR) MSC classes: 68Q30, 03D32, 20B99 Cite as: arXiv:2607.13796 [cs.IT] (or arXiv:2607.13796v1 [cs.IT] for this version) https://doi.org/10.48550/arXiv.2607.13796 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-15] Kaleido: Algorithm-Hardware Co-Design for Video Diffusion Transformers by Exploiting Latent Space Correlations
链接: https://arxiv.org/abs/2607.13770
作者: Wenxuan Miao,Haosong Liu,Weiming Hu,Zihan Liu,Aiyue Chen,Jianlin Yu,Yiwu Yao,Yiming Gan,Jieru Zhao,Jingwen Leng,Minyi Guo,Yu Feng
类目: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI)
备注:
Abstract:Video diffusion transformers (vDiTs) generate high quality video but introduce extremely high compute cost due to the long diffusion timesteps and self attention computation. As diffusion timesteps are reduced, the computation cost of self attention becomes the dominant bottleneck. Existing acceleration approaches largely inherit sparse attention techniques from large language models, which fail to consider the unique spatiotemporal correlation of video data. This paper presents Kaleido, an algorithm hardware codesign that accelerates all operations in vDiTs by exploiting channel-wise spatiotemporal correlations in latent space. Based on this insight, we propose a lightweight channelwise reuse algorithm that skips redundant computations by reusing partial results while preserving higher generative quality than prior methods (17 dB). To efficiently support this algorithm, we design a systolic array like accelerator with reconfigurable processing elements and a lightweight data dispatcher to mitigate irregular sparsity and data access patterns introduced by our reuse algorithm. Evaluations across three mainstream vDiT models show that Kaleido achieves up to 5.9x speedup and 16.0x energy savings over state of the art accelerators. Subjects: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13770 [cs.AR] (or arXiv:2607.13770v1 [cs.AR] for this version) https://doi.org/10.48550/arXiv.2607.13770 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-16] MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model
链接: https://arxiv.org/abs/2607.13763
作者: Charilaos Papaioannou,Ioannis Tsantilas,Dimitris Giannakakos,Vasilis Michalakopoulos,Sotiris Pelekis,Vangelis Marinakis,Arsam Aryandoust,Antonello Monti,Ricardo J. Bessa,Perdo P. Vergara,Jochen Cremer,Elissaios Sarmas
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 10 pages, 4 figues
Abstract:Single-task fine-tuning of graph neural networks (GNNs) for power grid problems exhibits a systematic failure mode: models that achieve the lowest in-distribution error degrade the most under topology shift. We term this topology overfitting: the tendency of task-specific gradient signals to encode relational structure particular to the training topologies rather than the underlying physics, causing models to fail on unseen grids despite strong in-distribution performance. To expose and address this failure mode, we introduce MxGPS (Multiplex GPS), a multiplex graph transformer that runs K task-specialised GPS branches over a shared node encoder, jointly trained on Static State Estimation (SSE) and AC Power Flow (PF) via a self-supervised pre-training and multi-task fine-tuning protocol, with a cross-branch attention module evaluated in ablation. The joint SSE+PF objective forces the shared encoder to simultaneously satisfy complementary gradient signals, preventing it from overfitting to topology-specific relational structure. Under a 3-fold sliding-window cross-validation spanning four unseen topologies (14-, 24-, 162-, and 300-bus), MxGPS attains 0% boundary violation rate (BVR) on all four zero-shot Power Flow topologies. Critically, models with substantially lower in-distribution PF error degrade by 190% to 1400% under topology shift, whereas MxGPS degrades by only 39%, an inversion that directly implicates topology overfitting as the failure mechanism rather than insufficient model capacity. With only 1.6M parameters (12x fewer than the GridFM reference baseline), MxGPS demonstrates that multi-task joint training is a principled and parameter-efficient mechanism for topology-agnostic generalisation in power grid foundation models.
[AI-17] How Agents Ask for Permission: User Permissions for AI Agents from Interfaces to Enforcement
链接: https://arxiv.org/abs/2607.13718
作者: Alexandra E. Michael,Franziska Roesner
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注: 15 pages, 4 figures
Abstract:As AI agents gain prevalance, users are increasingly exposed to the risks such systems entail. Prompt injection attacks, as well as hallucination, can cause agents to leak private information to third parties. As autonomous systems, agents also present the more active danger of performing sensitive tasks, such as bank transactions, without the user’s intent or authorization. Recognizing this challenge, the agentic security community has developed numerous proposals for secure agentic systems. Much of this work has focused on product-level approaches, where agentic system developers determine and apply the same security policies and permissions to all users. Yet different users have different needs and preferences, necessitating support for user-level permissions policies in agentic AI systems. To understand how user-level permissions are handled in AI agent systems, we survey 21 proposals for agent permissions systems. From this review, we construct a taxonomy of how different systems specify user-level permissions policies, both at the user interface and internally; derive internal policies from user input; and enforce those policies at run-time. We then analyze five prominent commercial agents and compare their permissions handling to agentic permissions systems in the literature. We identify several high-level themes across the literature and commerical agents, as well as multiple gaps where future work is needed. Comments: 15 pages, 4 figures Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13718 [cs.CR] (or arXiv:2607.13718v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13718 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-18] CAVA: Canonical Action Verification and Attestation for Runtime Governance of Agent ic AI Systems
链接: https://arxiv.org/abs/2607.13716
作者: Zexun Wang
类目: Artificial Intelligence (cs.AI)
备注: 35 pages. Working paper on canonical action verification, runtime governance, semantic pattern detection, and approval-bound action receipts
Abstract:Agentic AI systems increasingly act through heterogeneous runtimes: local coding hooks, SDK tools, browser automation, managed-agent traces, API gateways, and workflow engines. A single operational act such as publishing code, changing identity state, moving money, or exporting data may therefore be represented by many incompatible runtime records. This makes a basic governance question difficult to answer: what action was actually approved, what evidence binds the approval to execution, and can an independent verifier reproduce the same action identity later? This paper presents Canonical Action Verification and Attestation (CAVA), a runtime-semantics layer for converting heterogeneous agent activity into canonical runtime action objects. CAVA is positioned below Proof-Carrying Agent Actions (PCAA): PCAA defines the deployer-owned route-review-prove governance process, while CAVA defines the stable action object that process governs. The paper formalizes canonical action identity, semantic pattern detection, approval binding, receipt integrity, runtime-portable projection, and optional attestation substrates. We study a reference implementation through a 96-seed, 384-variant benchmark covering semantic equivalence, semantic separation, wrapper bypass, false-positive control, approval binding, receipt reproducibility, attestation tamper detection, runtime portability, semantic pattern detection, policy degradation, and Azure deployment drills. The contribution is a systems formulation of action-level canonicalization and policy-addressable semantic patterns as a necessary substrate for deployer-side AI governance. Comments: 35 pages. Working paper on canonical action verification, runtime governance, semantic pattern detection, and approval-bound action receipts Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13716 [cs.AI] (or arXiv:2607.13716v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2607.13716 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-19] Agent Compass: A Unified Evaluation Infrastructure for Agent Capabilities
链接: https://arxiv.org/abs/2607.13705
作者: Zichen Ding,Jiaye Ge,Shufan Jiang,Kai Chen,Mo Li,Qingqiu Li,Zehao Li,Zonglin Li,Tiaohao Liang,Shudong Liu,Zerun Ma,Zixing Shang,Wenhui Tian,Zun Wang,Liwei Wu,Zhenyu Wu,Jun Xu,Bowen Yang,Dingbo Yuan,Qi Zhang,Songyang Zhang,Peiheng Zhou,Dongsheng Zhu
类目: Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注:
Abstract:As Large Language Models (LLMs) evolve into autonomous agents, the need for unified evaluation infrastructure becomes critical. However, current evaluation pipelines remain highly fragmented and tightly coupled, hindering reproducibility and causing redundant engineering. To address this, we introduce AgentCompass, an open-source, lightweight, and extensible infrastructure for evaluating LLM-based agents. AgentCompass organizes the evaluation process around three independent components, namely Benchmark, Harness, and Environment, thereby enabling flexible configurations without requiring the reimplementation of complex execution logic. Furthermore, it features a fault-tolerant asynchronous runtime and comprehensive trajectory analysis tools to transparently diagnose nuanced failure modes like reward-hacking. Natively supporting over 20 benchmarks across five capability dimensions, AgentCompass provides the community with a scalable and reproducible infrastructure for advancing agent research.
[AI-20] Explaining Reinforcement Learning Agents via Inductive Logic Programming
链接: https://arxiv.org/abs/2607.13655
作者: Celeste Veronese,Edoardo Zorzi,Daniele Meli,Alessandro Farinelli
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Explainable Reinforcement Learning (XRL) seeks to make Reinforcement Learning (RL) policies more transparent and interpretable, a key requirement in safety-critical and human-centric scenarios. However, it is mostly based on user studies, thus targeting the needs of a specific audience and lacking shared evaluation metrics. On the other hand, logic-based approaches within eXplainable Artificial Intelligence (XAI) provide compact, human-readable abstractions of decision-making. However, the systematic quantification of the explainability degree of logical representations remains an open problem. This work aims to advance the state of the art in XRL by introducing objective and planning-oriented metrics for policy explainability in RL settings. At the same time, it contributes to the field of logic for XAI by providing a principled way to quantify the explainability of logical rules, moving beyond common-sense assessments and simple propositional fragments. We employ Inductive Logic Programming (ILP) to extract symbolic representations of RL policies and define a novel set of explainability metrics, including activation rate, feature coverage, syntactic distance and semantic distance. These metrics quantify alignment between symbolic rules and agent behavior, the role of features in decision-making, and the evolution of policies during training and across agents in single and multi-agent RL. Experiments across different RL domains show that the proposed metrics highlight action-specific learning dynamics beyond global return, provide fine-grained insights into domain features beyond classical approaches for global feature importance estimation, and uncover coordination, specialization, and adaptation patterns in MARL. Moreover, they provide crucial insights for the transfer and generalization of action-specific policies.
[AI-21] From Language to Navigation Goals: A Vision-Language Approach for Semantic Navigation of Mobile Robots Using RGB-D Perception
链接: https://arxiv.org/abs/2607.13624
作者: Jose Martínez-Fajardo,Pablo Pueyo,Fernando Caballero,Luis Merino
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注: 8 pages, 7 figures, 3 tables
Abstract:Natural language interaction provides an intuitive way for non-expert users to communicate with robotic platforms. However, transforming user requests into executable navigation actions remains a challenging task, requiring the integration of language understanding, environment perception, and autonomous navigation. This work presents a language-driven navigation framework that enables mobile robots to interpret user requests in natural language to move the robot to a destination and autonomously navigate towards it. The framework is composed of modular ROS 2 components that cooperate to transform natural language instructions into navigation actions. Given a natural language request referring to a target in the environment (e.g., “go to the mail box”), the system identifies the referenced object, estimates its position using RGB-D data, and generates a navigation goal, which is then executed through the ROS 2 Nav2 navigation stack. The ROS 2-based implementation facilitates portability across different robotic platforms, requiring only the configuration of the corresponding topics and services. The system is evaluated in both simulation and real-world scenarios using a TurtleBot3 Waffle and a Unitree Go2 robot with a RealSense camera. Experimental results show that the framework successfully interprets both direct commands and contextual requests, generates meaningful natural-language feedback, and navigates towards the desired target. These results demonstrate the feasibility of combining semantic perception and autonomous navigation to provide an intuitive human-robot interaction paradigm. Code will be released as open source upon acceptance. Comments: 8 pages, 7 figures, 3 tables Subjects: Robotics (cs.RO); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13624 [cs.RO] (or arXiv:2607.13624v1 [cs.RO] for this version) https://doi.org/10.48550/arXiv.2607.13624 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-22] UESF-Bench: Benchmarking and Probing for Unified Embodied Seeking and Following
链接: https://arxiv.org/abs/2607.13621
作者: Kun Yu,Jianhua Yang,Yixiang Chen,Changwei Wang,Hongyuan Yu,Yan Huang,Fushuo Huo,Ya Jing,Zhumin Chen,Keji He
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Language-guided human following is an important capability for embodied agents, but existing benchmarks typically assume that the target person is visible at the start of an episode. This setting simplifies the problem and overlooks a more realistic requirement: an agent often needs to first find a language-described target and then persistently follow that target in a dynamic environment. While recent work has started to study human search, existing settings are typically evaluated in task-specific scenarios and often rely on stronger prior knowledge of the environment. Moreover, they usually treat searching and following as separate tasks and still lack a unified benchmark for systematic evaluation. To address these limitations, we introduce the Unified Embodied Seeking and Following Benchmark (UESF-Bench), a large-scale and diverse benchmark for embodied human seeking and following. The benchmark requires agents to handle semantic-guided exploration, reliable behavior switching and recovery, and delayed identity grounding. To this end, we propose SeekFollow-VLA, a vision-language-action framework with a task-driven routing mechanism for latent phase inference and transition modeling between seeking and following. Experimental results show that SeekFollow-VLA achieves clear improvements over both single-head and dual-head baselines across single-person and multi-person environments, establishing a baseline for unified embodied seek-and-follow.
[AI-23] STOCKTAKE: Measuring the Gap Between Perception and Action in LLM Agents with a Fair Oracle
链接: https://arxiv.org/abs/2607.13618
作者: Sagar Deb,Ashwanth Krishnan
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:LLM agents are increasingly evaluated on multi-week decision tasks in which the state that drives cost is never directly observed. On such tasks the final cost cannot say why an agent failed: it may have misread the world, or read it correctly and still failed to act (the knowing-doing gap). Existing evaluations cannot separate these two failures; their reference policies either read privileged information the agent never sees, or are missing altogether. We introduce STOCKTAKE, a 26-week supply-chain replenishment benchmark built as a factored partially observable Markov decision process with six hidden factor processes, designed so that a fair reference policy is computable: an exact Bayes filter per factor drives a rollout policy on the identical observation stream the agent receives. Scoring each run between a symptom-blind base-stock floor (0) and this oracle (1) yields a skill score, and grading each week’s written rationale yields a stated-belief detection lag and a knowing-doing rate, so state estimation and control are measured separately. On fifty seeds with curated stress profiles, Claude Sonnet 5, GPT-5.4, DeepSeek-V4-Pro, and Grok 4.5 detect 84-88% of hidden failures, typically within a week of onset, yet span skill scores from 0.62 to -0.23: two of the four end below the symptom-blind floor while naming factors slightly faster than the two that beat it. The failure has two faces. Where stress persists, 34-43% of correctly diagnosed stress weeks still end in stockout for every model, a rate that partly reflects the severity of the weeks models notice. That rate also runs opposite to skill: the two models under the floor stock out least on diagnosed weeks, so under-response is only one face of the gap, and their traces point to the other, responses whose cost exceeds what they protect. STOCKTAKE measures both directions of that failure.
[AI-24] he SIGReg Objective as Variational Free Energy: A Theoretical Active-Inference Account of JEPA World Models
链接: https://arxiv.org/abs/2607.13612
作者: Fabio Arnez,Alexandra Gomez-Villa
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Theoretical paper; empirical validation of the stated predictions is left to separate work. 28 pages, 4 figures, 4 tables
Abstract:Joint-Embedding Predictive Architectures (JEPAs) are the dominant design for latent world models, yet they are usually justified by empirical performance rather than a normative principle. We show that the choice of anti-collapse regulariser determines whether a JEPA’s training objective, a prediction loss plus a weighted embedding regulariser, is a valid Active Inference (AIF) variational free energy. We organise four non-contrastive regularisers (VICReg, LogDet, PairDist, and SIGReg) into an entropy-estimator hierarchy indexed by a prior-miscalibration gap, and show that the gap’s sign, whether the estimator bounds the latent entropy from above or below, decides whether the AIF surprise bound survives: VICReg and LogDet are unsafe upper bounds, PairDist a safe lower bound, and SIGReg eliminates the gap. We then prove a correspondence theorem: under the standard constant-noise encoder model and successful SIGReg enforcement (isotropic-Gaussian embeddings), the gap vanishes, the objective becomes an exact information bottleneck, the surprise bound is preserved, and the latent goal cost becomes an exact proxy for AIF pragmatic value, whereas VICReg leaves an irreducible second-order anisotropy term. We extend the correspondence to multi-step expected free energy, ensemble epistemic value, and a learned-policy regime, and we identify the one AIF term no current JEPA world model computes: the state-epistemic value, a future-state coverage signal. The predictions differ in kind, not degree, and are stated here as theoretical consequences left for empirical test in separate work; full proofs are in Appendix A, and the algebraic core of every result is machine-verified in Lean 4 (Appendix D).
[AI-25] Automatic Ordinary Differential Equations Discovery For Biological Systems Using Large Language Model Powered Agent ic System
链接: https://arxiv.org/abs/2607.13608
作者: David Krongauz,Arad Zulti,Eran Segal,Teddy Lazebnik
类目: Artificial Intelligence (cs.AI); Dynamical Systems (math.DS)
备注:
Abstract:Automatic scientific discovery has long been a goal of computational scholars - a machine that can discover nature’s secrets on its own, moving computational systems beyond data-fitting tools toward the generation and refinement of mechanistic models of the universe. Recent advances in symbolic regression (SR) and large-language-model (LLM)-based agents suggest that such systems can recover equations from data, incorporate domain priors, and automate parts of the research workflow. However, most existing approaches either focus on narrow equation-discovery benchmarks or broad end-to-end automation pipelines, while biological systems remain comparatively underexplored. Here, we introduce the MEDA system, an LLM- and SR-powered agentic framework for discovering ordinary-differential-equation (ODE) models of biological and biologically inspired dynamical systems. MEDA retrieves background knowledge, defines admissible variables, generates mechanistic constraints, proposes candidate ODEs, and fits and evaluates them. We evaluate it across canonical model retrieval, reasoning-based extrapolation to unseen variants, and open-ended discovery, with and without experimental data. Across these settings, MEDA recovered the correct state variables, achieved strong structural recovery in retrieval and extrapolation tasks, and produced biologically plausible discovery-oriented models. Ablation and robustness analyses show that knowledge-guided formalization and mechanistic constraints are load-bearing components, whereas numerical fitting alone can preserve trajectory-compatible but biologically incorrect equations.
[AI-26] Protective Capacity Hallucination: When Large Language Models Claim Nonexistent Capabilities
链接: https://arxiv.org/abs/2607.13596
作者: Eunna Lee,Jungpyo Nam,Sunjun Hwang
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注:
Abstract:When cast as the protector of a vulnerable user yet given no explicit capability boundary, a large language model (LLM) may respond not by acknowledging its limits but by claiming to have taken – or to be taking – a real-world protective action it cannot perform, such as contacting emergency services or administering care. We term this phenomenon Protective Capacity Hallucination (PCH): a self-referential misattribution in which a model, acting in a protective role, asserts physical or institutional agency exceeding its affordances as a language model. In a three-phase study spanning eight LLMs and 13,600 sessions, we find PCH jointly gated by situational severity and interactional format: multi-party dialogic input drives it toward ceiling in most models across ordinary service domains, whereas in intimate-partner conflict – a domain explicitly covered by safety alignment – it remains at floor in all eight models despite greater physical severity. We interpret PCH as the signature of a deployment-design gap between role assignment and capability-boundary specification: a by-product of partial alignment in which a universally trained pressure to help outruns a domain-selective specification of how to help. Because suppression tracks alignment coverage rather than severity, deployment-side specification of capability boundaries emerges as a general mitigation target.
[AI-27] SAFETY SENTRY: Context-Aware Human Intervention via EXECUTE-ASK-REFUSE Routing
链接: https://arxiv.org/abs/2607.13594
作者: Tianyu Chen,Chujia Hu,Wenjie Wang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:LLM agents act on real-world environments through tool calls, and a single misjudged action can cause irreversible harm. The standard safeguard is a guard model that labels each proposed action as safe or unsafe, but this binary view conflates two distinct decisions: whether the action is harmful in itself, and whether it is appropriate given the user’s context. It also operates at the granularity of action categories rather than individual instances, producing routine interruptions that erode autonomy and train users to wave through the most consequential alerts. We reframe the problem as a per-instance three-way routing decision over EXECUTE, ASK, REFUSE and instantiate it with Safety Sentry, a lightweight guard model whose inference reduces to a single decoding call. A single decoding-time threshold lets one fixed checkpoint be re-positioned across deployments of differing risk tolerance without retraining. Safety Sentry outperforms a broad set of open-weight and frontier closed-source baselines on overall accuracy and safety-related recall, while controlling both directional error rates simultaneously.
[AI-28] From Prediction to Collaboration: Interactive Symbolic Music Analysis
链接: https://arxiv.org/abs/2607.13587
作者: Emmanouil Karystinaios,Johannes Hentschel,Markus Neuwirth,Gerhard Widmer
类目: ound (cs.SD); Artificial Intelligence (cs.AI)
备注: in Proceedings of the 27th International Society for Music Information Retrieval Conference (ISMIR) 2026
Abstract:Automatic symbolic music analysis has made substantial progress, yet existing systems are typically designed for a single mode of use, such as full-score prediction, and therefore do not match the broader range of operations that arise in analysis workflows, including partial completion, local correction, and iterative refinement. As a result, there remains a gap between strong benchmark models and systems that can support interactive analytical use. We present a unified framework for symbolic Roman-numeral (RN) analysis that narrows this gap by combining strong predictive performance with direct support for constrained completion and revision. The method is designed to provide a practical trade-off between accuracy and interactive responsiveness by computing expensive pretrained representations once and reusing them during iterative refinement, making powerful pretrained models more amenable to interactive settings. It supports complete score analysis, targeted revision of existing labels, and inference of missing annotations from partial context through a shared modeling framework. Experiments on Dilemmadata, the largest and most heterogeneous benchmark of its kind, show that the proposed approach is a strong RN-analysis baseline while also supporting masked completion from partial labels. Together with a prototype interface for multi-level candidate inspection and editing, these results position automatic RN analysis not only as a prediction problem, but also as a foundation for future interactive tools for music analysis.
[AI-29] Agile perceptive multi-skill locomotion for quadrupedal robots in the wild
链接: https://arxiv.org/abs/2607.13579
作者: Jun-Gill Kang,Jaehyun Park,Tae-Gyu Song,Joon-Ha Kim,Seungwoo Hong,Hae-Won Park
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Project page: this https URL ,This is the author’s version of the work. It is posted here by permission of the AAAS for personal use, not for redistribution. The definitive version was published in Science Robotics on 7.15.2026; doi: https://doi.org/10.1126/scirobotics.adz7397 . Jun-Gill Kang and Jaehyun Park are co-first authors. Seungwoo Hong and Hae-Won Park are co-corresponding authors
Abstract:Enabling quadrupedal robots to traverse complex terrains-from rugged outdoor environments to urban landscapes-requires seamless integration of multiple motor skills, smooth transitions between gaits, and high-speed perceptive locomotion using only onboard sensors. We present APT-RL (Action Pretrained Transformer-based Reinforcement Learning), a unified framework that enables multi-skill locomotion to achieve high-speed traversal in complex environments through autonomous skill transitions utilizing only onboard perception and computation. Our approach generates large-scale, feature-rich 2D motion datasets through trajectory optimization with simplified dynamics. These datasets enable training of diverse, reusable locomotion skills that transfer effectively to a real quadruped robot operating on complex uneven terrains. The resulting high-quality skills serve as strong priors for efficient learning of complex downstream tasks and extend naturally to 3D environments, enabling smooth, high-speed multi-skill locomotion in deployed policy. Real-world experiments demonstrate the framework’s capabilities: the robot performs agile maneuvers through complex indoor obstacles and outdoor wild environments, including dynamic drop-down maneuvers that reach instantaneous peak speeds of up to 6 meters per second. A single onboard policy enables robust traversal of diverse obstacles, including stairs, hurdles, stepping stones, gaps, and fallen branches, demonstrating the versatility and effectiveness of our approach.
[AI-30] IMMNet: Hybrid Fusion of Model-based and Data-driven Approaches for Maneuvering Target Tracking
链接: https://arxiv.org/abs/2607.13573
作者: Yixuan Zhao,Chaoqun Yang,Lin Gao,Yongxiao Tian,Ting Yuan
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Maneuvering target tracking in three-dimensional space remains a challenging problem due to complex motion dynamics and model mismatch. To address this, this paper proposes a hybrid model/data-driven algorithm named IMMNet, which integrates the interpretable structure of the interacting multiple model (IMM) algorithm with learnable neural components. Unlike end-to-end black-box methods, the proposed IMMNet algorithm not only can preserve the Bayesian inference mechanism that is essential for real-time radar applications, but also can adaptively learn motion patterns and noise characteristics from data. Extensive experiments demonstrate that the proposed IMMNet algorithm consistently outperforms the existing algorithms across various scenarios, validating it as a robust, interpretable, and practical solution for maneuvering target tracking.
[AI-31] Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs ICML2026
链接: https://arxiv.org/abs/2607.13566
作者: Tianchi Yu,Ivan Oseledets
类目: Numerical Analysis (math.NA); Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE); Machine Learning (cs.LG)
备注: ICML2026 spotlight
Abstract:For low-dimensional problems ( d\leq3 ), spectral methods can achieve exceptionally high accuracy. For middle-dimensional problems ( 4 \leq d \lesssim 10 ), spectral methods remain feasible through specific techniques such as sparse grids or hyperbolic cross. However, for high-dimensional problems ( d\gg 10 ), spectral methods suffer frome the curse of dimensionality. Physics-informed neural networks (PINNs) have emerged as a promising approach to overcome this challenge, offering scalability to high dimensions, but often suffer from limited accuracy and efficiency. Recently proposed spectral-informed neural networks (SINNs) combine spectral methods with PINNs, operating directly in the spectral domain to avoid spatial derivative computations and to reduce memory consumption. In this work, we introduce Modified SINNs, which integrate coefficient decay scaling and basis embeddings motivated by harmonic analysis to enhance accuracy in high-dimensional problems and enable accurate approximation of unknown spectral coefficients. Numerical experiments on steady and time-dependent partial differential equations demonstrate that Modified SINNs outperform sparse grid spectral methods on middle-dimensional problems with incomplete spectral information and achieve superior accuracy compared to PINNs on high-dimensional problems.
[AI-32] Multi-Agent Collaborative Reasoning with Tool-Augmented Evidence for Urban Region Profiling KDD2026
链接: https://arxiv.org/abs/2607.13558
作者: Xixuan Hao,Yutian Jiang,Jiabo Liu,Yihang Yang,Guangyin Jin,Song Gao,Yuxuan Liang
类目: Artificial Intelligence (cs.AI)
备注: Accepted by KDD 2026
Abstract:Urban region profiling constitutes a core problem in urban computing, supporting applications such as population estimation, economic assessment, and environmental monitoring. Existing methods typically formulate this task as multimodal representation learning, fusing heterogeneous urban data, e.g., satellite imagery, points of interest, textual descriptions, and 3D building information, into latent embeddings for prediction. However, these approaches are largely correlation-driven, assume cross-modal consistency, and rely on static pipelines, which limit their robustness in heterogeneous or unseen urban regions. We propose UrbanAgent, an agentic framework that reframes urban region profiling as a reasoning-driven inference problem. UrbanAgent instantiates an independent agent for each data modality and performs structured multi-agent collaborative reasoning to explicitly address cross-modal inconsistencies rather than absorbing them into a single representation. In addition, UrbanAgent extends indicator prediction as a closed-loop process of active evidence acquisition and iterative reasoning, enabling agents to verify uncertain inferences through tool-augmented retrieval of external knowledge optimized via reinforcement learning. Extensive experiments on global urban datasets for Carbon emissions, GDP, and Population estimation show that UrbanAgent consistently outperforms existing baselines, achieving an average improvement of 8.1% in R2, and exhibiting strong generalization performance in unseen-city settings.
[AI-33] How Far Can Root Cause Analysis Go on Real-World Telemetry Data?
链接: https://arxiv.org/abs/2607.13548
作者: Athira Gopal,Ashwanth Krishnan
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Identifying root causes in production microservice failures requires reasoning over large-scale, multimodal telemetry spanning metrics, logs, and traces, a problem that has proved resistant to both classical and LLM-based approaches. The OpenRCA dataset exemplifies these challenges: it is large-scale, multimodal, and lacks detailed domain knowledge, and yields consistently low accuracy across all existing methods. We show that classical causal discovery methods and existing LLM-based multi-agent systems fail to reliably identify root causes on this benchmark, and present a Structured Multi-Agent RCA pipeline that substantially outperforms existing LLM-based and classical baselines, supporting both domain-knowledge and knowledge-free operating modes. To diagnose where failures originate, we introduce a reverse reasoning agent that, given the correct answer, identifies which signals in the extracted anomalies support it and determines whether Stage~1 had access to those signals, classifying each failure as Reasoning Gap (evidence present but unused) or Data Ambiguity (evidence genuinely absent). This analysis reveals that the required evidence is present in the vast majority of failures: the bottleneck is not data access but the agent’s ability to reason over it correctly. We further introduce an automated rule mining pipeline that systematically extracts discrimination rules from reverse reasoning reports, reducing reliance on manual knowledge curation. Across all configurations, model reasoning capability and domain knowledge are the primary constraints: stronger models embed more domain expertise, and explicit knowledge injection partially compensates for this gap. Reasoning performance remains practically bounded even when evidence extraction is perfect: scaffold engineering and better data pipelines alone cannot close this gap; progress requires improvements at the model level.
[AI-34] ExTernD: Expanded-Rank Ternary Decomposition Ternary LLM PTQ with Accuracy Approaching Any Quantization Level
链接: https://arxiv.org/abs/2607.13511
作者: Chethan Reddy G.P
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:We introduce ExTernD (Expanded-rank Ternary Decomposition), a post-training factorization of each LLM weight matrix A \in \mathbbR^m \times n into A \approx B \mathrmdiag(D) C with ternary factors B \in -1,0,+1^m \times k , C \in -1,0,+1^k \times n and a real scale vector D \in \mathbbR^k . The inner rank k = \mu \min(m,n) is deliberately expanded beyond full rank ( \mu 1 ), so that components past full rank correct the quantization error of earlier ones. We prove the residual decreases monotonically in k and can be driven below any \varepsilon 0 : ExTernD approaches bf16 accuracy arbitrarily closely, which no ternary scheme with a fixed plane count can do. Memory and compute scale continuously with \mu , and factor sparsity continuously with a threshold \tau , so an accuracy target is hit exactly rather than rounded to the next bit-width. ExTernD matches Q4_K’s per-matrix accuracy at 5.2-5.5 effective bpw (5.1-5.5 with importance weighting) on Gemma-4-E2B and Qwen3.5-4B, and a full Qwen3.5-4B conversion at \mu = 3 reaches 10.10 wikitext-2 perplexity against 9.78 for bf16 (+3.2%), placing it near the Q4_K/Q5_K accuracy band at ~5.7 effective bpw.
[AI-35] LAPO: Leave-One-Turn Attribution for Self-Generated Process Rewards in Multi-Turn Search Reasoning
链接: https://arxiv.org/abs/2607.13501
作者: Qiang Zhu,Jiajun Wu
类目: Artificial Intelligence (cs.AI)
备注: 20 pages, 5 figures
Abstract:Reinforcement learning for multi-turn search reasoning typically relies on terminal outcome rewards, which cannot distinguish useful, redundant, and harmful intermediate interactions. We propose LAPO, a self-generated process-supervision method based on backward leave-one-turn attribution. For each search turn, LAPO replaces the turn and its retrieval observation with a fixed [DELETE] placeholder and measures the resulting change in the current policy’s mean log-likelihood of the gold answer. This Answer-Likelihood Gain estimates the turn’s contribution while preserving all downstream interactions, allowing early evidence to be evaluated in the complete reasoning context. LAPO further applies sign-consistency gating, retaining only normalized process advantages whose directions agree with their raw attribution scores. The method requires no additional reward model, teacher, verifier, or LLM-as-a-Judge. Across seven knowledge-intensive question-answering datasets with local retrieval, LAPO achieves an average exact-match score of 0.326, outperforming the strongest step-reward baseline, IGPO, by 0.053. Ablations show complementary benefits from backward attribution and sign-consistency gating, demonstrating that policy-derived retrospective attribution can provide effective process supervision for multi-turn search agents.
[AI-36] DeepLoop: Depth Scaling for Looped Transformers
链接: https://arxiv.org/abs/2607.13491
作者: Shuzhen Li,Yifan Zhang,Jiacheng Guo,Quanquan Gu,Mengdi Wang
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 25 pages
Abstract:Looped Transformers scale sequential computation by applying a compact stack of physical blocks for multiple rounds, increasing unrolled depth without increasing stored parameters. This reuse changes the residual-scaling problem: in an untied Transformer, each residual branch receives and applies its own parameter update, whereas in a looped Transformer one shared update aggregates gradients from repeated visits and is read back by those same visits in the next linearized forward pass. We formalize this tied-depth effect through a first-order perturbation bound controlled by a visit-alignment coefficient \kappa_R . The bound recovers the DeepNorm exponent when visits decorrelate, but in the conservative aligned regime it requires the exponent to increase from 1/4 to 1/2 as loop count grows at fixed physical depth. The resulting method, \textbfDeepLoop, keeps the Post-LN DeepNorm architecture and sets \alpha=(2N)^1/2 and \beta=(8N)^-1/2 for unrolled depth N . On GPT-style looped language models at GPT-2 small and GPT-2 medium scale, DeepLoop is neutral when no physical block is revisited and improves validation loss and downstream accuracy once recurrent depth is activated. These results show that stable recurrent depth requires residual scaling rules that account for parameter visits, not only nominal layer count.
[AI-37] Explainable Artificial Intelligence for Anomaly Detection in Banking Transactions: An Internal Audit Perspective
链接: https://arxiv.org/abs/2607.13469
作者: Anupa Lodhi
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 9 pages, 2 tables. Author’s preprint. A revised version of this work has been published in the International Journal of Engineering Development and Research (IJEDR)
Abstract:The banking sector increasingly relies on automated systems to monitor electronic transactions for signs of fraud, yet conventional rule-based approaches struggle with high false-positive rates and offer no justification for their outputs, limiting their utility for compliance teams. This paper introduces an Explainable Artificial Intelligence (XAI) framework tailored for banking transaction anomaly detection within internal audit workflows. An Isolation Forest (iForest) model performs unsupervised anomaly scoring, while a SHAP (SHapley Additive exPlanations) layer provides transaction-level, feature-attributed explanations grounded in cooperative game theory [8]. A lightweight Streamlit dashboard renders these outputs in a form accessible to audit professionals without machine learning expertise. Evaluation on a synthetic banking dataset yields 0.91 precision and 0.88 recall, outperforming three unsupervised baselines. Expert feedback confirms that feature-level explanations measurably improve auditor confidence and decision quality. The framework advances the practical deployment of accountable, transparent AI in regulated financial environments.
[AI-38] Adversarial Prompting Framework for AI Safety Assessment
链接: https://arxiv.org/abs/2607.13453
作者: Yash Bhatnagar,Kunal Banerjee,Anirban Chatterjee
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注: 3 pages, 1 figure, presented as a poster at International Conference on Data Science (CODS), December 17-20, 2025, Pune, India
Abstract:Artificial Intelligence (AI), especially Generative AI (GenAI), adoption has increased in industries significantly in recent years. However, the use of these models may also expose systems to new forms of cyberattacks by different malicious actors – adversarial prompt attack (APA) being one of the most prominent examples of such threats. This paper presents the implementation of an Adversarial Prompting Framework (APF) for a comprehensive assessment of AI safety. The framework systematically evaluates the resilience of the AI model through the generation of structured adversarial prompts at multiple sophistication levels, from direct harmful requests to advanced encoding-based attacks. Our implementation demonstrates the practical application of this methodology in enterprise environments, providing automated testing capabilities with quantitative security assessment metrics. The results indicate significant variations in the model vulnerabilities across different attack vectors, with encoded prompts presenting the highest success rates in bypassing safety mechanisms.
[AI-39] Is the Statistical Advantage Worth the Cost? An Empirical Comparison of KANs and MLPs for Structured Data Classification
链接: https://arxiv.org/abs/2607.13413
作者: Matthew Steven P. Toledo,Justine Raphael H. Jacinto,Vivekjeet Singh Chambal,Rodolfo C. Camaclang III,Jamlech Iram N. Gojo Cruz,Reginald Neil C. Recario
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: To be presented at the 9th International Conference on Machine Learning and Machine Intelligence (MLMI 2026), Tokyo, Japan
Abstract:This study presents an empirical benchmarking comparison between Kolmogorov-Arnold Networks (KANs) and Multi-Layer Perceptrons (MLPs) on structured tabular classification tasks. Motivated by the growing interest in KANs as an alternative function-approximating architecture, we evaluate their out-of-the-box performance on twelve publicly available datasets spanning binary, multiclass, multilabel, and ordinal problems. Both models were trained under standardized preprocessing, architecture, and fixed hyperparameter settings, with performance assessed using test accuracy and F1-Score, paired hypothesis testing, and effect size analysis. Results show that KANs statistically outperform MLPs in binary and multiclass domains and achieve a significant aggregate advantage across all datasets. However, the observed medium effect size (d = -0.46) raises an important cost-benefit consideration: while KANs offer superior generalization through adaptive spline-based mappings, this advantage comes with substantially higher parameter and computational complexity relative to the MLP baseline. These findings suggest KANs are the preferred choice for high-precision applications, while MLPs remain a robust and efficient option for resource-constrained environments. Future work should extend this analysis to additional data modalities to further refine these architectural selection criteria.
[AI-40] he Café in Amsterdam: When the Incumbent Becomes the Oracle
链接: https://arxiv.org/abs/2607.13393
作者: Augusto Camargo
类目: Performance (cs.PF); Artificial Intelligence (cs.AI)
备注: 4 pages, two-column. A research note / position paper. Companion conceptual note to arXiv:2606.01009 (MelT)
Abstract:A field can reformulate its computations freely exactly where its demand is stated independently of any incumbent implementation, and finds itself unable to when the incumbent’s own output has quietly become the specification. This note offers that observation as a lens on computational reformulation for modern accelerators, where posing a problem in a hardware-friendly form can yield large speed and energy gains, but only if a replacement can be judged at all. Building on the test-oracle problem (Weyuker; Barr et al.), on requirements engineering’s notion of implementation bias (Zave and Jackson), and on the roofline performance model, it names the pathology “baseline capture” – the moment an incumbent stops being evidence that a demand can be met and becomes the definition of meeting it – and separates two questions that are easily confused: whether a reformulation can be judged (which turns on the existence of an incumbent-independent demand) and whether its discovery can be automated (which turns additionally on the cost of evaluating that demand). Short cases – shortest-path routing, learnable audio frontends, ZIP-215 for Ed25519 signature validation, CESM-ECT for climate models, and a single-GEMM audio frontend – illustrate the pattern and the move of “buying a verifier”: making a demand explicit, operational, and independent of the incumbent. No component is claimed novel in isolation; the contribution is the synthesis and the single question it makes easy to ask of any reformulation result – does its acceptance test mention the incumbent’s output?
[AI-41] EZSMT Version 3 Matured
链接: https://arxiv.org/abs/2607.13344
作者: Yuliya Lierler
类目: Artificial Intelligence (cs.AI)
备注: Under consideration in Theory and Practice of Logic Programming (TPLP)
Abstract:Constraint Answer Set Programming (CASP) is a hybrid reasoning paradigm that combines Answer Set Programming (ASP) with Constraint Processing and Satisfiability Modulo Theories (SMT), enabling powerful declarative encodings of complex combinatorial search problems. This paper presents the design and implementation of EZSMTV3, an extensible SMT-based CASP framework that advances the translational approach to CASP solving. Building upon the foundation of the EZSMT+ system, EZSMTV3 introduces a more expressive input language, supports optimization via weak constraints, and offers foundations for streamlined integration of new constraint types. Rather than implementing custom search procedures, EZSMTV3 leverages state-of-the-art SMT solvers, such as CVC5, YICES, and Z3 to perform reasoning. The paper provides benchmarking results comparing EZSMTV3 with its CASP peers such as CLINGCON, CLINGO[DL], and CLINGO[LP], while showcasing its ability to handle mixed-domain constraints involving both integers and reals. The system provides a robust platform for future extensions and theoretical exploration within the CASP domain.
[AI-42] Privacy Preserving Recommender Systems Balancing Personalization with Privacy
链接: https://arxiv.org/abs/2607.13328
作者: Ranjeet K Jha,Venkata Suresh Gummadilli
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Personalized recommendation systems are central to modern e-commerce and retail platforms, but they typically rely on centralized storage of detailed user interaction data, creating significant privacy and regulatory challenges. With increasing requirements from regulations such as GDPR, CCPA, and CPRA, organizations must develop recommendation systems that preserve user privacy without substantially degrading recommendation quality. This work presents and evaluates a privacy-preserving recommendation framework that combines federated learning, differential privacy, cohort-level modeling, and privacy-aware intelligent agents. The framework keeps raw user data decentralized while introducing mathematically bounded noise to model updates. Experiments were conducted on synthetic retail datasets that emulate customer clickstream and purchase behavior. Recommendation quality was evaluated using Click-Through Rate (CTR), Precision@K, Recall@K, and Normalized Discounted Cumulative Gain (NDCG@K) across multiple differential privacy budgets. We evaluate matrix factorization, neural collaborative filtering, and GRU4Rec under varying privacy constraints and analyze the trade-off between privacy and utility. An interactive Streamlit dashboard was developed to visualize recommendation performance, ranking stability, privacy-utility trade-offs, and fairness metrics. Results show that the proposed framework maintains competitive recommendation quality at moderate privacy budgets (approximately \epsilon \approx 5 ), demonstrating that strong privacy guarantees can be achieved with limited impact on recommendation effectiveness. This work provides a practical framework for deploying privacy-preserving recommendation systems that balance personalization, regulatory compliance, and business objectives, offering a scalable approach for next-generation AI-driven retail platforms. Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2607.13328 [cs.CR] (or arXiv:2607.13328v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13328 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Venkata Suresh Gummadilli [view email] [v1] Tue, 14 Jul 2026 23:21:21 UTC (864 KB)
[AI-43] Adapting Generalist Vehicle Models for High-Speed MPC Across Terrains
链接: https://arxiv.org/abs/2607.13319
作者: Rwik Rana,Jesse Quattrociocchi,Christian Ellis,Nathan Tsoi,Garrett Warnell,Joydeep Biswas
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:High-speed off-road autonomy requires precise closed-loop control for a target vehicle while remaining robust across changing terrains. Recent forward kinodynamic (FKD) prediction foundation models suggest a promising path, starting from a generalist model and specializing it to the target platform. However, effective specialization remains challenging, as it often requires substantial real-world data, and models adapted to one setting can still overfit to specific terrains or driving regimes. We present OptCar (Optimized Car), a recipe for bridging the gap from generalist to specialist FKD models that preserves cross-terrain generalization while optimizing performance for a specific vehicle. \textttOptCar introduces a history-conditioned dynamics adaptation module that encodes recent state-action observations into a dynamics context token, and then fine-tunes the generalist model using limited real-world data together with targeted synthetic rollouts from environment-specific system identification. In closed-loop model predictive control (MPC) experiments across three terrains and an out-of-distribution cart-pulling task, the largest gains appear at 6~m/s, the highest speed evaluated and the regime in which slip dominates tracking error. On vegetation and dirt, the most slip-diverse terrain, OptCar reduces 6~m/s trajectory tracking error by roughly 55% relative to a fine-tuned AnyCar baseline, and remains the most accurate even when an unseen cart payload changes the dynamics. With only 5 minutes of real data per terrain, OptCar is competitive on road with a specialist trained on 30 minutes of road data, and substantially outperforms it once the terrain changes.
[AI-44] abular Foundation Models for Discrete Choice Estimation
链接: https://arxiv.org/abs/2607.13314
作者: Liu Liu,Dan Zhang
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Econometrics (econ.EM)
备注:
Abstract:Tabular foundation models (TFMs) generate predictions on structured data via in-context learning, without task-specific estimation. We ask whether TFMs can be effectively applied to discrete choice, a central demand estimation framework in marketing and operations, and find that directly applying TFMs yields limited performance. The gap is structural: TFMs assume row-independent observations, whereas discrete choice is inherently set-valued and subject to persistent consumer preference heterogeneity. We propose a reformulation that encodes both choice-set dependence and individual heterogeneity within a row-based learning framework. Evaluated on a yogurt scanner panel, individual-level heterogeneity encoding is the dominant driver of predictive accuracy. The best reformulation outperforms hierarchical Bayesian estimation by 8% in holdout log-likelihood and 3.6% in hit rate, running 16 times faster, a practical advantage for large-scale demand estimation. The advantage is largest in the medium-data regime (10–40 purchase occasions per consumer), where parametric Bayesian shrinkage most distorts estimates for atypical consumers. Fine-tuning on population choice data provides additional gains for consumers with shallow purchase histories, where in-context learning has limited individual-specific signal to condition on. These results establish a principled approach for applying foundation models to consumer choice problems more broadly.
[AI-45] Faithful Autoformalization of Natural Language Assertions
链接: https://arxiv.org/abs/2607.13303
作者: Hongyi Liu,Madhusudan Parthasarathy,Adithya Murali
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: Code, data, and resources are publicly available for research purposes: this https URL
Abstract:Formal contracts are essential for software testing and verification, yet writing them remains labor-intensive and error-prone. LLMs offer a promising path toward autoformalization: synthesizing executable assertions from natural-language specifications and thereby bridging the gap between informal developer intent and formal executable specifications. We present Monty: an autoformalization framework for assertions that tackles the challenges of expectations of validity of assertions and ambiguity in natural-language. Our techniques are based on filtering formalizations using a novel conformance score metric and validity scores obtained from testing the code against formalized assertions. We evaluate our approach on 541 assertion-generation tasks derived from 22 collection-like Java classes, and show that our technique produces the ground truth more reliably (improving upto 20 points in precision on average) than when using LLMs naively to translate assertions.
[AI-46] Harness Handbook: Making Evolving Agent Harnesses ReadableNavigable and Editable
链接: https://arxiv.org/abs/2607.13285
作者: Ruhan Wang,Yucheng Shi,Zongxia Li,Zhongzhi Li,Yue Yu,Junyao Yang,Kishan Panaganti,Haitao Mi,Dongruo Zhou,Leoweiliang
类目: Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注: 29 pages, 6 figures. Project page: this https URL
Abstract:The capability of a modern AI agent depends not only on its foundation model but also on its harness, which constructs prompts, manages state, invokes tools, and coordinates execution. As models, APIs, environments, and requirements evolve, the harness must be continually modified. Before such a change can be made, a developer or coding agent must identify all code locations that implement the target behavior. This is difficult because production harnesses are large, tightly coupled, and behaviorally distributed, while modification requests describe what the system should do and repositories are organized by files and modules. Code search, repository indexing, and long-context processing ease inspection, but still leave this behavior-to-code mapping to be recovered by hand. Behavior localization is therefore a central bottleneck in harness evolution. We introduce the Harness Handbook, a behavior-centric representation synthesized automatically from a harness codebase via static analysis and LLM-assisted structuring, linking each behavior to its corresponding source. We also introduce Behavior-Guided Progressive Disclosure (BGPD), which guides agents from high-level behaviors to relevant implementation details and verifies candidate locations against the current source. On diverse modification requests from two open-source harnesses, Handbook-Assisted planning improves behavior localization and edit-plan quality while using fewer planner tokens, with the largest gains on scattered sites, rarely executed paths, and cross-module interactions. Evolving complex agentic systems thus depends not only on generating edits, but also on determining where those edits should be made.
[AI-47] Deconstructing Actor-Critic: A Large-scale Empirical Study of Design Components for Practitioners
链接: https://arxiv.org/abs/2607.13274
作者: Haseeb Shah,Lingwei Zhu,Adam White,Martha White
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 38 pages, 22 figures
Abstract:Reinforcement learning is increasingly being considered for controlling real-world systems, from fusion plasma and autonomous vehicles to drug discovery and drinking water treatment, where reliability is essential and tuning budgets are limited. Actor-critic algorithms share a set of design decisions, such as how the policy is updated, how it represents the distribution over actions, how its gradient is estimated, and how often it is updated relative to the value estimator. Using a control task derived from a real water treatment plant, we analyze over 33,000 experiments to determine how these components affect variability across runs and sensitivity to hyperparameters. Common defaults, such as Gaussian action distributions with pathwise gradient estimators, are among the least reliable configurations, whereas bounded distributions with adaptive update schedules remain robust across a wide range of settings. These findings offer empirical guidance to practitioners across scientific and engineering domains for understanding and making component-level decisions when adapting actor-critic methods to new real-world control settings.
[AI-48] Reassessing Muon for Matrix Factorization
链接: https://arxiv.org/abs/2607.13246
作者: Ali Parviz,Gal Mishne,Alex Cloninger
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Muon has recently emerged as a strong optimizer for large-scale deep learning, where it reshapes gradient updates through approximate orthogonalization and has been reported to outperform Adam and AdamW in large language model training. Its empirical success has motivated a growing body of theoretical work that interprets Muon as steepest descent under the spectral norm. Yet it remains unclear which of Muon’s advantages stem from its update rule itself and which are artifacts of the scale, architecture, and data of modern deep networks. In this work, we isolate the optimizer from these confounding factors by studying Muon on a simple, well-understood, and spectrally structured problem: low-rank matrix factorization. Through a controlled comparison against carefully tuned adaptive baselines, we find that Muon does not consistently outperform AdamW in this setting and that several previously reported advantages are sensitive to hyperparameter choices. Our results provide a more nuanced picture of when spectrum-aware orthogonalization is beneficial and argue for evaluating modern optimizers on controlled problems in addition to end-to-end benchmarks.
[AI-49] EMAGN: Efficient Multi-Attention Graph Network via Learned Clustering for Scalable Traffic Forecasting
链接: https://arxiv.org/abs/2607.13241
作者: Mingxing Xu,Rakesh Chowdary Machineni,Ke Liu,Xi Cheng,Chengqi Lu,Xin Hu,Lyuhao Chen,Xiangyu Li,Junwei You,Oliver Gao
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Traffic forecasting is highly challenging due to complex and nonlinear spatial and temporal dependencies. Self-attention mechanisms have been widely adopted to model dynamic and long-range dependencies, achieving state-of-the-art performance, but suffer from limited scalability due to quadratic computational and memory complexity. To address this, we propose an Efficient Multi-Attention Graph Network (EMAGN) that linearises the spatial attention mechanism itself, inspired by the theory of fast high-dimensional Gaussian filtering. Two learned clustering matrices C_k and C_v adaptively group key and value vectors into M super-clusters, reducing complexity from O(N^2 d) to O(NMd) without sacrificing the flexibility of attention for dynamic dependency modelling. Experimental results on PEMS-BAY and METR-LA show that EMAGN achieves accuracy within 2.7-3.2% MAE of full-attention GMAN while reducing training time by 32%, inference time by 38%, and GPU memory by 58%. Critically, at K=16 attention heads, full-attention GMAN runs out of memory on a standard 11 GB GPU entirely while EMAGN continues to operate, demonstrating a categorical expansion of feasible model configurations. EMAGN also surpasses Linformer and Performer in both accuracy and efficiency within the same backbone, owing to its traffic-network-aware adaptive clustering.
[AI-50] Cost-Optimal Foundation Model Deployment Portfolio for Transportation Management ITSC2026
链接: https://arxiv.org/abs/2607.13239
作者: Xi Cheng,Ke Liu,Siyuan Feng,Jane Lin,H. Oliver Gao
类目: Artificial Intelligence (cs.AI)
备注: Accepted at IEEE ITSC 2026
Abstract:Foundation models, including large language models (LLMs) and vision-language models (VLMs), are increasingly used for transportation management center (TMC) tasks such as anomaly detection, incident reporting, and traveler information. Deploying multiple such models across TMC functions raises a portfolio question: which model should serve each function, in which deployment mode, and under what shared hardware budget? We formulate this as the Foundation Model Deployment Portfolio (FMDP) problem, a mixed-integer program minimizing total cost of ownership (TCO) subject to per-function quality, latency, and safety constraints over shared GPU capacity. We prove the problem NP-hard by reduction from the 0-1 knapsack problem and propose a polynomial-time greedy heuristic. In an illustrative case study with five TMC functions and 19 candidate (model, mode) pairs, FMDP identifies a mixed portfolio costing 34/mo (97% below the cheapest feasible all-closed-API baseline) by routing four functions to open-source APIs and the one function whose quality floor no open-source model meets to a closed API. Break-even analysis shows that on-premise GPU investment becomes reasonable only above approximately 309 vision queries/hour or if API prices double.
[AI-51] AI-Native Insurance for Agent ic AI: Pricing Underwriting and End-to-End Automation
链接: https://arxiv.org/abs/2607.13230
作者: Quanyan Zhu
类目: Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR); Computers and Society (cs.CY)
备注:
Abstract:Agentic AI introduces new insurance challenges because autonomous AI systems can make decisions, invoke tools, modify external environments, and interact with third-party services. This paper develops an AI-native mathematical framework for underwriting, pricing, and contract design for agentic AI deployments. A deployment is represented by a risk state that captures autonomy level, operational authority, permission exposure, governance maturity, and dependency concentration. The framework maps the risk state to event probabilities, loss severities, governance costs, premiums, deductibles, coverage allocation, and policy covenants, and formulates an optimization problem for insurance contract design under participation, profitability, and incentive compatibility constraints. The paper establishes structural properties of insurability, including characterization of an insurability region, monotone deterioration of feasibility with increasing exposure, and governance certification thresholds. Insurance is further interpreted as both an operational cost and a regulatory mechanism for AI deployment. A healthcare case study illustrates contract optimization, sensitivity analysis, and automated claims processing for agentic AI systems.
[AI-52] Audited Selective Verification for Risk-Controlled N-1 Thermal Contingency Screening under Deployment Shift
链接: https://arxiv.org/abs/2607.13221
作者: Jayakumar Manoharan
类目: ystems and Control (eess.SY); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Submitted to IEEE Transactions on Power Systems (under review)
Abstract:Real-time N-1 contingency screening in an energy management system trades assurance against cost: verifying every credible outage with full power flow is too slow, while fast linear-sensitivity screening gives no statistical guarantee and can silently pass unsafe operating points, especially when a controller drives the system into unfamiliar regimes. This paper introduces Audited Selective Verification, a risk-budgeted screening and triage layer for any controller’s output (optimization, model-predictive, or learned). A cheap surrogate proposes which outages to skip; an online audit runs full power flow on a small random sample each window; and a calibrated threshold certifies a thermal-violation-rate bound for the skipped set at a chosen budget and confidence, with a corresponding bound for the unverified trusted subset. Validity rests on real verification and the audit rather than on surrogate accuracy, so it holds under arbitrary deployment shift. It is a risk-budgeted screen, not a replacement for deterministic verification when policy requires checking every credible contingency. On three public transmission systems up to 1354 buses, the realized violation rate stays within budget, standard deterministic and calibrated screens become unsafe under shift, and the method cuts full power-flow studies by 29 to 75 percent per real-time operating point.
[AI-53] CayleyR: Solving the TopSpin puzzle via cycle intersection
链接: https://arxiv.org/abs/2607.13219
作者: Yuri Baramykov
类目: Artificial Intelligence (cs.AI)
备注: 17 pages, 2 figures
Abstract:We present cayleyR, an R package for solving permutation puzzles by detecting cycle intersections in Cayley graphs. The core algorithm performs an iterative bidirectional search: from both the initial and target permutation states, random operation sequences generate cycles in the Cayley graph of the symmetric group Sn; their intersection yields a connecting path. When no direct intersection is found, a distance-guided bridge selection narrows the gap, and the process repeats. The package targets the TopSpin(n,k) puzzle, whose state space is a Cayley graph of Sn generated by a cyclic shift and a prefix reversal. We describe the mathematical framework, the algorithm, and its implementation, which combines a C++ hash-indexed state store with optional Vulkan GPU acceleration. The software is publicly available on CRAN.
[AI-54] SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy UAI
链接: https://arxiv.org/abs/2607.13175
作者: Yassine Chemingui,Chenhua Fan,Honghao Wei,Janardhan Rao Doppa
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Accepted for Publication at the 42nd Conference on Uncertainty in Artificial Intelligence (UAI), 2026
Abstract:Safe reinforcement learning typically enforces safety by bounding expected cumulative costs, a criterion that often fails to detect rare but catastrophic tail events. To overcome these limitations, this paper introduces SteinGate, a boundary-aware distributional safety certificate that replaces fragile tail fitting with a robust consistency check using Kernelized Stein Discrepancy while accounting for boundary atoms induced by clipped costs. SteinGate evaluates whether observed policy rollout costs remain consistent with a safe reference distribution, providing a non-parametric safety certificate. This certificate is used to dynamically adapt the learning regime: favoring reward-improving policy updates when rollouts remain consistent with the safe reference and switching to recovery behavior when the cost tail deviates. Experiments on continuous-control benchmarks demonstrate that SteinGate significantly reduces both the frequency and severity of constraint violations during training while maintaining competitive returns relative to state-of-the-art baselines.
[AI-55] Learning Safe Agent Behaviour from Human Preferences and Justifications via World Models
链接: https://arxiv.org/abs/2607.13172
作者: Ilias Kazantzidis,Timothy J. Norman,Yali Du,Christopher T. Freeman
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 42 pages, 18 figures. Extended version of a paper presented at ICAART 2026; submitted for consideration in the ICAART 2026 post-publication selected-papers volume in Lecture Notes in Artificial Intelligence
Abstract:We address the problem of safely training an agent policy and deploying a good and safe policy, in settings where the environment dynamics are unknown and no suitable reward function is available. In the context of safety-critical environments, we consider traditional reinforcement learning impractical and resort to the resource of human input. We introduce DROPJ, a human-centred method for both safe training and deployment. We first learn a world model (a learned simulator) from a dataset of prior real-world trajectories. A human then plays the game in this learned simulator to extract several informative simulated trajectories. From these, we sample pairs of simulated trajectory segments and elicit from a human their preference over these segments, as well as a reason (justification) for their choice. We then train a reward model from these justified preferences and use it, together with the world model, to directly deploy the agent using model predictive control. Running real-user experiments, we find that generating informative simulated trajectories from a user significantly reduces the computational cost during training compared to other strategies, and can also improve the performance during deployment. In the context of training within a learned simulator, we show that the use of preferences rather than other types of feedback substantially improves the performance during deployment. We further demonstrate that safety justifications accompanying preferences can significantly enhance safety or prioritise user-prescribed aspects of safety associated with them during deployment.
[AI-56] Active Beyond-Diagonal RIS Empowered Heterogeneous Edge Computing: A Distributional Reinforcement Learning Approach
链接: https://arxiv.org/abs/2607.13160
作者: Tianyu Pang,Hongyu Li
类目: Information Theory (cs.IT); Artificial Intelligence (cs.AI); Signal Processing (eess.SP)
备注:
Abstract:Active beyond-diagonal reconfigurable intelligent surfaces (BD-RISs) enables hybrid transmitting and reflecting mode to achieve effective signal amplification and full-space coverage, thus providing a promising solution for blockage-aware uplink offloading in heterogeneous mobile edge computing (MEC) systems. However, practical hybrid mode active BD-RIS are realized by reciprocal devices, which inherently generate cross-sector energy leakage that will reshape the system-level energy-latency tradeoff. This paper studies energy-aware offloading and resource allocation for reciprocal active BD-RIS-assisted heterogeneous MEC, where offloading decisions, CPU/GPU computation allocation, transmit powers, receive processing, and active BD-RIS are tightly coupled. The resulting problem is a high-dimensional mixed integer nonconvex problem and is difficult to solve efficiently by conventional per-instance optimization. To address this challenge, we develop an end-to-end joint optimization framework based on a refined version of the distributional soft actor–critic algorithm, named as DSAC-T. By modeling return distributions rather than only expected values, DSAC-T improves policy stability under reward heterogeneity and feasibility-boundary sensitivity. Compared with other baseline algorithms, DSAC-T achieves the best energy-latency reward, the highest feasibility ratio of 81.67%, and a fast online decision time of 0.0267 s per scenario.
[AI-57] Oracle Agent Memory as an Enterprise Memory Substrate for Long-Horizon AI Agents ACL
链接: https://arxiv.org/abs/2607.13157
作者: Richmond Alake,Cesare Bernardis,Paul Cayet,Luca Engel,Damien Hilloulin,Sungpack Hong,Allen Hosler,Nickolas Kavantzas,Ingo Kossyk,Son Le,Rhicheek Patra,Kartik Talamadupula,Valentin Venzin
类目: Artificial Intelligence (cs.AI); Databases (cs.DB)
备注: 23 pages, 7 figures. Technical report on Oracle Agent Memory
Abstract:Agent memory is a systems problem for long-horizon agents. Practical deployments require retention of task state across extended conversations, recovery of user-specific facts and preferences across sessions, and accumulation of procedural knowledge from prior outcomes. These requirements extend beyond document retrieval: a memory layer must determine which interactions become durable state, how that state is scoped, how it is retrieved under latency constraints, and how it is revised or removed over time. This report studies Oracle Agent Memory as a database-native memory substrate built on Oracle Database. Three themes organize the discussion: memory as a lifecycle spanning ingestion, extraction, consolidation, retrieval, summarization, and revision or removal; a layered architecture that separates an active memory core from a passive memory-store interface with explicit scope control across users, agents, and threads; and evaluation methodology in which downstream task accuracy is complemented by memory-centric measures such as evidence retrieval, recall, latency, and estimated token use. The report summarizes LongMemEval results, reaching 93.8% accuracy, compares Oracle Agent Memory against flat-history baselines, using about 10.7x fewer tokens, and published or reported external baselines where available, and closes with implementation-oriented appendix material covering setup, thread lifecycle, and search semantics.
[AI-58] AI in Cyberpsychology: A systematic literature review of Cybersecurity enhancement by using AI for analyzing psychology of Victims Attackers and Defenders
链接: https://arxiv.org/abs/2607.13123
作者: Georg Thamer Francis,Malek Malkawi,Sevim Eyüpoğlu,Reda Alhajj,Selim Akyokuş
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注: 22 pages, 5 figures
Abstract:Cybersecurity is the practice of protecting systems, networks, and data from digital attacks. Cyberpsychology (CPSY) is defined as the use of psychology to enhance cybersecurity applications. Since the early 2010s, the evolution of Artificial Intelligence (AI) has increasingly integrated with CPSY, leveraging advanced data analysis to decode the distinct personality traits and behavioral patterns of victims, attackers, and defenders. In this systematic literature review (SLR), we carefully analyze 34 collected research studies of AI usage in cyberpsychology (AI-CPSY) using the preferred reporting items for systematic reviews and meta-analyses (PRISMA) methodology. The review presents a comprehensive taxonomy of the cyber-security applications, the AI methodologies used, and the psychological concepts employed across the studies . We sort the research studies into four cybersecurity applications: Anomaly Detection (AD), Vulnerability Risk Prediction (VRP), Security Awareness Training (SAT), and Authentication/Identity Verification (AIV). Within each application area, studies are further sorted according to the AI method used including machine learning (ML), deep learning (DL), natural language processing (NLP), and reinforcement learning (RL). Furthermore, the review identifies the most commonly utilized psychological concepts, quantify the datasets used in the field, and present their current implementation and deployment status. At last, it detect research gaps, present open challenges, and deduce the trending and most effective and emerging methodologies used across the AI-CPSY landscape.
[AI-59] CoDiffGRN: Rethinking Gene Regulatory Network Inference via the BEELINE-KGC Benchmark and Co-evolutionary Discrete Diffusion
链接: https://arxiv.org/abs/2607.13120
作者: Jiaze Song,Runhao Zhao,Minghao Xu,Bin Cui,Wentao Zhang
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 19 pages, 6 figures
Abstract:Inferring gene regulatory networks (GRNs) from single-cell transcriptomic data is crucial for biological discovery, yet existing approaches suffer from a fundamental misalignment with real-world needs. Researchers typically seek a small set of high-confidence regulatory interactions for experimental validation, often involving previously unseen genes. However, current benchmarks rely on transductive splits with global classification metrics, while prevailing models struggle to generalize under inductive settings. To bridge this gap, we reformulate GRN inference as an inductive, ranking-centric graph completion problem and introduce \textbf\benchmark, a new benchmark that incorporates an inductive gene-holdout split together with knowledge graph completion metrics to better evaluate top-ranked predictions. Building on this, we propose \textbf\method, the first co-evolutionary discrete diffusion framework that jointly models biologically coherent discretized gene expression states and regulatory interactions for robust inductive generalization and improved top-ranked regulatory discovery. We further introduce TF-ALL Subgraph Sampling (TASS) for scalable training. Extensive experiments on \benchmark show that \method establishes new state-of-the-art performance, significantly outperforming existing methods in novel regulatory discovery, and ablation studies further verify the effectiveness of our design.
[AI-60] Improving Molecular Property Prediction in Small Language Models Using Graph-based Tools ESWC2026
链接: https://arxiv.org/abs/2607.13115
作者: Konstantinos Bougiatiotis,Dimitrios Kelesis,Georgios Paliouras
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Presented at the 2nd Causal Neuro-symbolic Artificial Intelligence (Causal NeSy): Toward Agentic LLMs with Neuro-Symbolic and Graph Based Reasoning Workshop @ ESWC2026
Abstract:Small language models (SLMs) have shown promise for zero-shot molecular property prediction from SMILES strings, yet they often suffer from structural blindness because sequence representations under-specify key graph-topological cues. We propose a modular Context-Augmented Prompting framework that enables agentic tool use at inference time: a trained GNN expert model provides a predictive hint with confidence, and a GNN extracts an instance-specific explanatory subgraph (e.g., a subgraph SMILES and an accompanying explanatory paragraph). We evaluate three commonly used SLMs on MUTAG and Tox21 under five prompting configurations ranging from SMILES-only to using all available tools at hand. Across two datasets, enriching prompts with graph-derived context yields substantial accuracy gains, often exceeding 25% relative improvement and up to 74% on Tox21. We further validate the functional relevance of the extracted motifs via a necessity-based edge-drop intervention. Despite the observed gains, a persistent gap remains to specialized GNN models, highlighting both the value and limits of text-conditioned reasoning for molecular structure.
[AI-61] SemaDiff: Identifying Semantic-Changing Commits with Generated Code and Tests
链接: https://arxiv.org/abs/2607.13111
作者: Maha Ayub,Michael Konstantinou,Ahmed Khanfir,Nikolaos Tsantalis,Mike Papadakis
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注:
Abstract:Distinguishing semantic-preserving commits from changing ones remains an open challenge in software repository mining. While existing approaches detect refactoring commits accurately, they cannot ensure that a commit is purely semantic-preserving, without any interleaving behaviour-changing modification. This limitation can impact several tasks, such as debugging, fault localisation, bug dataset construction, rollback analysis, and bug fixes backporting. To fill this gap, we propose SemaDiff, a novel approach for identifying semantic-preserving commits through behaviour-based analysis; comparison of similar test execution on pre- and post-commit versions. As code impacted by the refactoring is often hard to test and different accross both versions, we propose generating additional calling methods to that code, which serve as testing target. Given a commit, SemaDiff analyses the diff to identify modified code and extracts unchanged dependent code that calls it. It then generates an additional dependent class using a large language model to exercise the changed code in both versions, and automatically generates tests for the dependent code. This way, we obtain the same tests for the different code versions, enabling the behavioural-difference detection. The commit is classified as semantic-preserving only if all generated tests produce identical outcomes across the two versions. To evaluate SemaDiff, we construct and annotate manually a dataset of 183 commits, gathered from well-known open-source Java projects. The obtained results show that SemaDiff distinguishes accurately semantic-preserving from – changing commits in about 76% of the cases, with a 100% precision in semantic-changing commit detection.
[AI-62] A Hybrid Mamba for Audio-Visual Navigation
链接: https://arxiv.org/abs/2607.13110
作者: Yi Wang,Yinfeng Yu
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Signal Processing (eess.SP)
备注: Main paper (6 pages). Accepted for publication by IEEE International Conference on Systems and Man and Cybernetics 2026 (IEEE SMC 2026)
Abstract:Since the paradigm centered on convolutional neural networks and recurrent architectures was established in 2020, the fundamental backbone networks for audio-visual navigation have undergone no essential changes for more than five years, making them inadequate to support efficient representation of dynamic multimodal sequences. This paper proposes Samba(A Hybrid Mamba for Audio-Visual Navigation). It uses the adaptive selection-enabled Mamba State Encoder (M-SE) to replace conventional GRUs for temporal aggregation, and constructs an Audio Mamba Encoder (AME) to remedy the limitations of convolutional operators in capturing global time-frequency dependencies in spectrograms. Experiments demonstrate that Samba exhibits exceptional generalization performance when facing unheard sound sources and unseen scenes. On the Matterport3D dataset, it improves the navigation success rate (SR) by 11.3% compared with existing state-of-the-art models, and the performance gain is even more pronounced on the Replica dataset, which features finer scene structures. Such modernized architectural reconstruction unlocks stronger embodied representation capabilities at a lower computational cost, thereby providing a highly robust technical pathway for paradigm evolution in the field of audio-visual navigation.
[AI-63] STKAN: Kolmogorov-Arnold Networks for Spatio-Temporal Forecasting
链接: https://arxiv.org/abs/2607.13108
作者: Sicong Lai,Yuehong Hu,Siru Zhong,Si Qiao,Yuxuan Liang,Guangyin Jin
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Real-world traffic data exhibit heterogeneous spatial correlations and nonlinear temporal dynamics, posing substantial challenges for accurate spatio-temporal forecasting. Existing approaches have developed increasingly sophisticated graph, attention, and decomposition architectures, while the influence of the underlying nonlinear function approximator has received comparatively less attention. In this work, we propose STKAN, a spatio-temporal forecasting architecture that introduces Taylor-polynomial Kolmogorov–Arnold Network modules into spatial and temporal token mixing. STKAN first constructs high-level spatial representations through a learnable soft node-group assignment mechanism, applies group-wise spatial mixing, and subsequently models temporal dependencies over the compressed sequence. Spatial and temporal self-attention layers are further employed to capture long-range interactions. Experiments on five traffic forecasting benchmarks show that STKAN achieves competitive performance and performs better than the evaluated MLP-based variant in the tested settings. These results suggest that the design of nonlinear function approximators can serve as a useful complement to architectural design in spatio-temporal forecasting.
[AI-64] Disentangling Knowledge States with Ability and Proficiency Modeling for Knowledge Tracing
链接: https://arxiv.org/abs/2607.13103
作者: Duantengchuan Li,Yingqian Bi,Jinsong Chen,Rui Zhang,Mingwen Tong
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Knowledge tracing (KT) aims to predict students’ future performance by modeling their evolving knowledge states from historical interactions. Existing KT methods usually treat the raw interaction sequence as a unified behavioral process, overlooking the phase-specific nature of learning behaviors. Our preliminary observations show that students are more likely to correctly answer previously failed knowledge concepts after sufficient practice, suggesting a transition from ability-building to proficiency-oriented learning. Motivated by this, we propose Phase-Aware Knowledge Tracing (PAKT), a KT framework that decomposes student interactions into ability and proficiency phases based on the tailored decomposition mechanism. To effectively exploit the decomposed sequences, we design a multi-branch Transformer with a type-aware readout module to jointly capture phase-specific and holistic knowledge states. We further provide a causal analysis to reveal the confounding bias caused by entangling complex learning behaviors in phase-agnostic KT models. Extensive experiments on six public benchmarks demonstrate that our method consistently outperforms representative baselines, with a maximum AUC gain of 1.33% and an average gain of 0.82%.
[AI-65] SSM: Triaxial State Space Model for Global Station Weather Forecasting with Temporal-Variable-Historical Modeling
链接: https://arxiv.org/abs/2607.13101
作者: Songru Yang,Zili Liu,Tao Han,Ben Fei,Fenghua Ling,Lei Bai,Chang Liu,Xiangyang Ji,Zhenwei Shi,Zhengxia Zou
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Global Station Weather Forecasting (GSWF) is pivotal for localized and extreme weather prediction over key regions. Despite efforts to exploit look-back windows, existing methods show limited accuracy gains and struggle with extreme events and error accumulation. These limitations stem from overreliance on short-term patterns, which are insufficient to capture chaotic weather dynamics, especially under partial observations. To address this problem, we propose a novel Triaxial State Space Model (TSSM) with a history-enhanced Temporal-VariableHistorical paradigm, which incorporates period-aligned historical weather data to compensate for long-term, large-scale periodic, and full-window weather patterns beyond the temporal lookback window. Specifically, TSSM stacks historical samples into period-aligned batches, where forecasting is causally supported by historical and current observations. Temporal, variable, and historical scanning are designed to capture axial temporal dependencies, variable correlations, and historical evolution. This structure is hierarchically shared to model seasonal to extreme events while alleviating misalignment across historical patterns. TSSM achieves SOTA performance on Weather-5K, the largest station weather dataset to date, with 10% and 61% gains in accuracy and extreme event metrics, and obtains 95% best or second-best results on human-involved datasets. Its advantages are more pronounced in long-horizon and iterative forecasting, reaching a 37.5% gain at 240h and up to 103.5% under a 48h times 5 iterative setting. Moreover, TSSM retains 90% performance under up to 80% missing observations, compared with 43% for baselines, demonstrating robustness and practical potential for reliable GSWF in global in-situ observation networks.
[AI-66] WaterMoE: Expert-Routing-based Watermarking for High Fidelity and Efficiency
链接: https://arxiv.org/abs/2607.13099
作者: Z Sun,Q Jiang,S Sheng,L Xiang
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注: 21 page
Abstract:Large language models (LLMs) have achieved remarkable success but raise growing concerns about content provenance and misuse, motivating the need for reliable watermarking techniques. However, these techniques have rarely been adopted in practice mainly for two reasons: i) severely degraded model performance, and ii) additional inference overhead. To confirm the problem, we construct a comprehensive benchmark spanning different generation tasks to systematically evaluate 9 representative watermarking methods. We found almost all existing methods are designed for text fluency, but not for restricted and complicated tasks, and their overhead prevents them from deployment in latency-critical systems. To address i) and ii), we propose an LLM watermarking scheme \textitWaterMoE for the growingly popular Mixture-of-Experts (MoE) LLMs. WaterMoE embeds watermarking signals through controlled perturbation into the expert selection at each router, which accumulates to token selection shift at the final output. In contrast to watermarking as a post-processing token-sampling approach, WaterMoE embeds watermark within the inference loop incurring negligible quality degradation and computational overhead. Extensive experiments demonstrate that our method achieves a fidelity performance close to the unwatermarked and consistently outperforms state-of-the-art watermarking methods on the benchmark, with up to 4\times speedup, incurring merely 1% additional inference latency compared to native generation. The results demonstrate the capability of WaterMoE to be deployed in real-world tasks. Comments: 21 page Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13099 [cs.CR] (or arXiv:2607.13099v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13099 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-67] Full-Pipeline Inference Optimization for MiMo-V2.5 Series: Pushing Hybrid SWA Efficiency to the Limit
链接: https://arxiv.org/abs/2607.13095
作者: Xiaomi MiMo Team:Anqi Liu,Aoxin Ma,Bo Chen,Bo Yang,Chen Wang,Chen Zhang,Chengda Tang,Chengwei Wang,Chiheng Lou,Depeng Yan,Fuli Luo,Gang Wang,Hailin Zhang,Jiale Sun,Kang Zhou,Rui Huang,Shaohui Liu,Shen Huang,Shijie Cao,Shuaishuai Fan,Tianling Zhou,Xiangwei Deng,Xueyang Xie,Xuli Wang,Yingchun Lai,Yu Yang,Yuan Zhang,Zhen Tang,Zhonghua Deng,Zihan Jiang
类目: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI)
备注: technical report
Abstract:We present a full-pipeline inference optimization for the MiMo-V2.5 model family, which combines Hybrid Sliding Window Attention (Hybrid SWA), sparse Mixture-of-Experts (MoE), and multimodal encoders. While Hybrid SWA can ideally reduce both attention compute and KVCache storage significantly compared to Full Attention, realizing these gains in production requires substantial engineering effort. We systematically optimize the KVCache system with layerwise prefetch, SWA-aware prefix cache trees, and specialized placement strategies, achieving strict O(W) SWA storage and high cache hit rates. We further build GCache, a high-performance distributed cache infrastructure with RDMA-optimized networking, and develop a KVCache-affinity router to reduce computation while preserving load balancing. We also optimize for multimodal inputs, including GPU image preprocessing, parallel video decoding, and multimodal cache sharing. Together, these optimizations constitute the first large-scale LLM serving system in production that efficiently covers the Hybrid SWA + MoE + multimodal composite architecture.
[AI-68] Analyzing Curricular Pattern Complexity Using AI to Improve On-Time Graduation Rates
链接: https://arxiv.org/abs/2607.13094
作者: Lynn Vonderhaar,Juan Couder,Siri Siqveland,Omar Ochoa,James Pembridge
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI)
备注: Accepted to Frontiers in Education (FIE) 2026
Abstract:The rise of Artificial Intelligence (AI) enables automatic analysis of large amounts of data. Previously time-consuming and labor-intensive tasks can be completed much more efficiently with the use of AI. This work uses AI techniques to analyze and revise curricular patterns in an undergraduate degree for Software Engineering. Curricula often have long sequences where failure to pass a class within the sequence may jeopardize completion of the degree within four years. Manual analysis and revision of curricula by university faculty is a lengthy and labor-intensive process, causing changes to occur rarely and making it impossible to keep up with the changing needs of students. This work reduces the time-to-change for curricula and reduces bottlenecks and graduation delays by using Large Language Models (LLMs) to analyze curricular patterns and suggest revisions.
[AI-69] Efficient and Privacy Aware Edge Cloud Collaborative Inference for Large Language Models
链接: https://arxiv.org/abs/2607.13093
作者: Yi Li,Chen Li,Jiexiong Liu
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注:
Abstract:On-device LLM inference faces a trilemma of response latency, limited hardware resources and user privacy. Full cloud inference delivers strong computing power but exposes user prompts and dialogue data, while standalone on-device inference is unfeasible for most consumer and embedded edge devices. This paper presents a privacy-centric edge-cloud collaborative LLM inference framework built on endpoint-authenticated KV cache. Local endpoints handle input preprocessing, embedding computation, adaptive feature optimization, KV cache authentication, speculative decoding and low-dimensional model head calculation, while the cloud conducts authenticated decoder inference, KV cache management, token verification and high-dimensional vocabulary projection. Endpoints fuse partial outputs, apply language-adaptive masking and sample target tokens. All transmitted data and truncated logits are quantized and AES-GCM encrypted for privacy, with core lightweight modules, draft parameters and cache access policies kept local to avoid leakage. The framework supports heterogeneous devices including CPU-only, GPU-equipped and embedded devices via optimized streaming, batching and quantized ONNX deployment. Evaluations demonstrate that the framework reduces per-token latency by up to 46.1% and downlink payloads by up to 67.4% over baseline split inference, retaining comparable performance to full cloud inference.
[AI-70] Self-Improving AI Coding Agents Through Accumulated Behavioral Rules: A Closed-Loop Framework
链接: https://arxiv.org/abs/2607.13091
作者: Aditya Aggarwal,Nahid Farhady Ghalaty
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: Already presented and accepted in - 32nd ICE IEEE/ITMC Conference (ICE 2026)
Abstract:LLM-based coding agents repeat the same classes of mistakes across sessions because they lack a mechanism to retain corrections from human review feedback. We present a closed-loop framework in which every accepted review comment is codified as a persistent behavioral rule, progressively expanding the set of error classes the agent can self-detect. The framework combines an accumulating rule set in a version-controlled instruction file, a self-review checklist executed before code submission, and automated validation that ensures rule set integrity as it grows. In deployment across a 35+ service microservices platform, the rule set grew from 5 to 18 behavioral rules, 15+ language-specific standards, and a 15-item self-review checklist, all derived from real review feedback. We present empirical results from 11 recorded working sessions spanning code generation, PR review, incident investigation, and cross service refactoring. We observe that accumulated rules shift review effort from low-level correctness toward design-level validation, achieve a measured 0% recurrence rate for ruled-against error classes, and transfer across heterogeneous agent interfaces. We compare our approach against related work in experiential LLM learning (Reflexion, ExpeL, Voyager) and automated code review (CodeReviewer, SWE-bench agents), showing that our framework achieves persistent cross-session learning without weight updates, operates on production codebases rather than synthetic benchmarks, and addresses an orthogonal dimension (behavioral consistency over time) that existing benchmarks do not measure. The result is a coding agent that improves with every review cycle, accumulating the engineering wisdom of its human collaborators without changing a single model weight.
[AI-71] Baselines Before Architecture: Evaluating Coding Agents for Autonomous Penetration Testing
链接: https://arxiv.org/abs/2607.13085
作者: Ananda Dhakal,Krish Neupane,Aarjan Chaudhary
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注:
Abstract:Recent autonomous penetration testing papers report high benchmark scores while adding multi-component security harnesses around frontier LLMs. Because these systems often change both architecture and backbone model, it is difficult to tell how much performance comes from the harness rather than from the underlying model. This paper presents a controlled study on the 104-task XBOW benchmark using default coding CLI agents as plain-agent baselines. We first run Codex, OpenCode, and Pi with the same GPT-5 model, budget, target interface, and scoring rule. This phase identifies the strongest same-model baseline and tests whether security-specific prompt variants improve its observed score. We then compare the default Codex scaffold with published MAPTA and PentestGPT V2 results under the closest available model matches. Finally, we repeat the plain-agent experiment with GPT-5.2 and GPT-5.5 to measure model scaling inside the same scaffold. The results show a mixed but practical picture. Specialised harnesses can add measurable benchmark lift and may improve cost efficiency, but plain coding agents already solve a large share of the benchmark; repeated plain-agent runs can match or exceed some published architecture scores in union coverage, and newer models substantially improve the same scaffold. Future evaluations should report model-matched plain-agent baselines before attributing benchmark gains to architecture design alone. Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI) Cite as: arXiv:2607.13085 [cs.CR] (or arXiv:2607.13085v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13085 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-72] Inference Economics of Enterprise Coding Agents : A Case Study of Cloud vs. On-Premise LLM s
链接: https://arxiv.org/abs/2607.13080
作者: Sheng-Wei Peng,Yi-Hsun Lin,Yi-Pei Lee
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: 20 pages, 13 figures, 14 tables. Industrial longitudinal case study
Abstract:Autonomous coding agents force engineering organizations to choose between API-based frontier models – strong reasoning at high token cost – and on-premise quantized open-weights models, which promise low-marginal-cost scaling and data sovereignty at some loss of reasoning fidelity. We study this trade-off through a single-developer, non-randomized longitudinal case study over two contiguous 28-day periods on a production monorepo: an API-based Claude Opus 4.7/4.8 configuration using Claude Code versus an on-premise GLM-5.1/5.2 configuration using Opencode, quantized to NVFP4, on NVIDIA Blackwell hardware. Analyzing LLM telemetry and Git history, we find that prompt caching (99.3% hit rate) cuts realized API cost by 88.6% to an effective \ 0.57 per million tokens – below even the \ 2.83 amortized unit cost of the shared on-premise slice (a utilization-dependent inversion; total realized spend and total cost of ownership (TCO) are the robust quantities). At comparable gross code churn, the local configuration was associated with a far higher defect-repair burden: a Fix Commit Ratio (FCR) of 74.9% versus 45.9%, with the odds of a commit being a repair 2.6 to 4.9 times higher within every difficulty tier (Mantel-Haenszel OR = 3.61). Under Taiwan-market parameters and a symmetric labor model, on-premise deployment nonetheless saves 40.1% of true TCO under shared GPU allocation, whereas dedicated reservation costs 43.8% more than the cached API. Under shared allocation, the genuine penalty is not monetary but a measurable developer-experience burden – timestamp indicators show more work trapped in debugging spirals and a slower commit cadence – and an offline replay shows hybrid routing gateways trade defect rate for infrastructure savings along a cost-quality frontier rather than dominate the pure-API baseline.
[AI-73] Operational Evidence Gaps for LLM s in Fraud Detection and Trust-and-Safety Workflows
链接: https://arxiv.org/abs/2607.13078
作者: Keyur Gabani
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 22 pages, 3 figures, 6 tables. Ancillary files include the evidence matrix, search note, and numeric claim check
Abstract:LLMs are now proposed for fraud detection, scam investigation, content moderation, and other trust-and-safety workflows. Much of the public literature still evaluates them as models, with less attention to their behavior as components in operational pipelines. This creates a practical evidence question: what would justify placing an LLM inside a live workflow with latency, cost, escalation, human-review, and adversarial-risk constraints? We address this question through a fraud-first survey of deployment evidence. We code 49 operationally relevant sources on LLM use in fraud detection, investigation support, content moderation, and cross-cutting robustness (18 fraud, 14 moderation, 17 cross-cutting), supplemented by 15 contextual references that establish the survey boundaries. These sources include systems, benchmarks, frameworks, and deployment-relevant surveys, not 49 production deployments. The main finding is an evidence imbalance. Fraud supplies the largest task-specific portion of the coded corpus. The moderation papers, however, include more explicit public evidence on latency, cost, governance, and fairness. Among the 18 fraud and investigation sources, none report clean per-decision latency, per-decision dollar cost, or calibration evidence; most report offline task performance, retrieval gains, or case-study accuracy instead. The survey contributes a role-and-evidence organizing frame, FORTE, for locating LLMs as classifiers, retrieval interfaces, explanation generators, reviewer assistants, agents, feature extractors, or escalation components. It also contributes a minimum deployment-evidence checklist covering latency budget, cost per decision, decision threshold, explanation integrity, and adversarial pressure. The resulting agenda identifies studies needed to support deployment claims for LLM-based fraud and trust-and-safety work. Comments: 22 pages, 3 figures, 6 tables. Ancillary files include the evidence matrix, search note, and numeric claim check Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2607.13078 [cs.CR] (or arXiv:2607.13078v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13078 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Keyur Gabani [view email] [v1] Sun, 12 Jul 2026 22:34:02 UTC (35 KB)
[AI-74] he Hitchhikers Guide to Monoculture
链接: https://arxiv.org/abs/2607.13077
作者: Gordon Burtch
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注:
Abstract:Large language models (LLMs) often produce homogeneous outputs, raising concerns that AI coding assistants may lead to convergence in the software artifacts that developers create. Whether this occurs in practice is unclear because developers interactively prompt, evaluate, modify, and reject model outputs, and because outputs vary with prompt and repository context. I examine code homogenization using Kaggle contest submissions from 2019 to mid-2026. I first document widespread convergence toward the random seed value 42, consistent with LLMs reinforcing a longstanding convention in programming culture. I then study homogenization more broadly, at two levels of aggregation and abstraction. At the submission level, I measure the average pairwise similarity of submissions within contests. At the contest level, I measure the conceptual span of submitted code, motivating distinct measures for each: TF-IDF representations, which capture surface syntax, and Voyage 3 code embeddings, which capture code intent and semantics. The results demonstrate substantial syntactic homogenization at both the individual and collective levels: individual submissions have become more alike in literal syntax and code structure, while the latent dimensionality of syntactic variation has narrowed. In contrast, I find little evidence of semantic homogenization, individually and collectively. Average semantic distance remains essentially flat, and the contest-level latent dimensional span of semantic approaches remains stable, with evidence suggesting it has even expanded modestly. These findings suggest that AI coding assistants are certainly standardizing implementation details, yet they have not yet produced evidence of homogenization in the approaches and problem-solving strategies coders employ.
[AI-75] he Entanglement Wall: Activation-Space Probes as Risk Detectors Not Context Adjudicators
链接: https://arxiv.org/abs/2607.13075
作者: Dominik Schwarz
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 19 pages, 4 figures, 30 tables. Code and supporting artifacts: this https URL
Abstract:Context can change whether a request is harmful without changing its topic or surface form. We ask whether residual-stream probes distinguish harmful requests from surface-matched benign controls at a useful operating point. Across three 7-8B model families, an activation sensor blocks 95.5-97.7 percent of judge-classified compliant attacks in a taxonomy-selected set. It also blocks 59.6-68.4 percent of XSTest prompts. A fully disjoint audit reconstructs near-ceiling source-contrast AUROC (0.996-0.999), but fixed transfer to matched pairs is weaker: 0.656-0.819 on the guard-selected Twin-n70 subset and 0.590-0.690 on the full Twin-n163 cohort. We test ten axes on the reference family and seven across all families with leakage, hold-out, and permutation controls. On Twin-n163, no axis evaluated without direct pair-boundary fitting reaches the specified numerical threshold. Requiring persistence on that full cohort was added at analysis time. A separately specified 24B/32B extension gives the same result. Pair-trained classifiers weaken under category and generation-batch hold-out and false-block 79.6-100 percent of XSTest at 95 percent in-corpus TPR. At the tested read points, these activation scores behave as broad-risk detectors rather than standalone context adjudicators.
[AI-76] When is the combined load identifiable from a stress-intensity profile? A coupled forward-inverse study on SIFBench finite-element data
链接: https://arxiv.org/abs/2607.13074
作者: Giansalvo Cirrincione,Filippo Grassia
类目: Numerical Analysis (math.NA); Materials Science (cond-mat.mtrl-sci); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:This work studies the inverse problem of recovering the relative magnitudes of the tension, bending, and bearing loads acting on a crack from its stress-intensity-factor profile along the crack front, using the public SIFBench finite-element data. The central claim is not forensic load recovery on field cases, but a rigorous characterization of when the combined load is identifiable at all, together with an estimator that returns calibrated uncertainty precisely in the regimes where it is not. For a known geometry the forward map from loads to profile is exactly linear, and identifiability reduces to a single geometric question: whether the three elementary load profiles are linearly independent as functions along the front. When they are nearly dependent, many different load combinations produce almost the same profile and the inverse problem is illposed; the analysis shows that the degree of ill-posedness is controlled by an intrinsic stability margin, not by the conditioning number alone. A single crack-front operator serves both as a structured forward surrogate and as the differentiable map required by a simplex-constrained, set-valued inverse estimator. On the SIFBench corner-crack scenario the empirical behaviour matches the theory: the typical geometry is well posed while a sizable minority is genuinely ill-posed, so a point estimate is reliable on the majority and provably uninformative on the rest. Validation is on controlled synthetic noise; no real fracture cases are used or claimed.
[AI-77] Probabilistic Extension of Neuro-Symbolic AGI Robots based on Belnaps Typed Intensional FOL
链接: https://arxiv.org/abs/2607.13073
作者: Zoran Majkic
类目: Artificial Intelligence (cs.AI)
备注: 32 pages
Abstract:Neuro-symbolic AI based on IFOL_B is a way to combine neural learning and symbolic reasoning to overcome limitations of purely neural systems (like lack of interpretability and logical structure) with formal logical machinery for self-reference. In this paper we expand the cognitive power of IFOL_B by using the probability computation for the currently unknown sentences, based on Nilsson’s probability structure for the IFOL_B . We introduce the global symmetry transformation that preserves the current knowledge database and logical deduction, and the local one used for real-time decisions about concrete (sub)problems that involve only a very strict subset of IFOL_B predicates. The computation of probability density function KI in both cases, based on the Shannon’s maximum information entropy, is provided by neural networks of this probabilistic neuro-symbolic AGI.
[AI-78] HRO: Hierarchical Room-to-Object Framework for Zero-Shot Object Goal Navigation with Large Language Models
链接: https://arxiv.org/abs/2607.13072
作者: Luyuan Jia,Yinfeng Yu
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Signal Processing (eess.SP)
备注: Main paper (6 pages). Accepted for publication by IEEE International Conference on Systems, Man, and Cybernetics 2026 (IEEE SMC 2026)
Abstract:Zero-shot object-goal navigation aims to enable an intelligent agent to explore and navigate to objects of unknown categories in an unfamiliar environment without specific target training. In zero-shot navigation tasks, pre-trained large models are usually employed to leverage their prior knowledge for guiding the agent’s navigation. However, existing zero-shot object-goal navigation methods based on large language models (LLMs) merely utilize LLMs as flat reasoning tools to directly associate objects or regions. They lack the hierarchical spatial cognition modeling of human-like room semantics to object localization, which leads to strong blindness in exploration, insufficient accuracy in semantic association, and failure to fully unleash the common-sense reasoning potential of LLMs. This paper proposes an LLM-driven hierarchical room-to-object (HRO) framework for zero-shot object-goal navigation, which guides the agent to explore and navigate to the target object in a coarse-to-fine manner. Experiments on Gibson and HM3D datasets verify that our HRO framework achieves superior success rate and generalization over existing LLM-based methods, underscoring LLMs’ strong potential for zero-shot object-goal navigation.
[AI-79] Compaction as Epistemic Failure: How Agent ic LLM Tools Fabricate Confirmed Results from Killed Processes
链接: https://arxiv.org/abs/2607.13071
作者: Hiroki Tamba
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: 8 pages, companion to arXiv:2606.26185
Abstract:Agentic LLM coding tools compress long session histories into compaction summaries that subsequent sessions inherit as ground truth. This paper documents a failure mode in Claude Code where partial standard output from timed-out commands (exit code 143) is recorded in compaction summaries as confirmed results, propagating false positives across sessions and model versions without re-verification. The underlying mechanism is a conflation of observation and persistence, where information that appeared in the terminal is treated as equivalent to information written to durable storage. This finding extends the analysis of LLM self-evaluation failures reported in prior work on non-determinism in LLM-as-judge grading by showing that agentic tools exhibit analogous reliability deficits when reporting on their own operational outcomes. The failure has direct implications for any workflow that relies on agentic session continuity for data processing, scientific computation, or multi-step automation.
[AI-80] Autonomous UAV Route Planning for Coverag e Maximization in Environmental Monitoring: A Systematic Literature Review
链接: https://arxiv.org/abs/2607.13054
作者: Sebastian Jouannet-Contreras,Carola Figueroa-Flores
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注: Accepted in CLEI 2026
Abstract:Environmental monitoring with unmanned aerial vehicles (UAVs) requires route planning methods that maximize covered area while handling energy limits, operational constraints, and geometric complexity. This paper reports the protocol and preliminary results of an ongoing systematic literature review (SLR) on autonomous UAV route planning for coverage-oriented environmental monitoring. The review follows the PRISMA 2020 framework and searches Scopus and Web of Science for studies published between 2015 and 2026. The protocol focuses on path planning, coverage path planning, and informative path planning, with emphasis on algorithmic families, coverage and energy metrics, obstacle handling, geometric environment representations, and environmental constraints. At the current stage, 562 records have been identified, 161 duplicates have been removed, and 401 unique records have been screened by title, abstract, and keywords. From these, 247 studies were retained for full-text eligibility assessment (235 eligible and 12 borderline records to be resolved during full-text review). A preliminary analysis of the retained studies suggests strong concentration on coverage-oriented formulations, multi-UAV coordination, and energy-aware optimization, while fewer studies explicitly address weather, uncertainty, or obstacle-rich environments. Most retained studies rely on simulation-based validation, highlighting a potential simulation-to-reality gap, and recent publications show increasing interest in reinforcement learning, hybrid optimization, and geometry-aware planning. These early findings indicate an active but fragmented research landscape and support the need for a structured synthesis to identify mature techniques and unresolved gaps for realistic environmental monitoring missions.
[AI-81] SPINE: Bridging the Cyber-Physical Gap with Agent ic AI
链接: https://arxiv.org/abs/2607.13049
作者: Minkyu Ham,Dongho Kim,Chan Lee,Jiayi Wang,Min Jun Kim,Yixi Zhang,Guo Ye,Jihai Zhao,Soyeon Park,Han Liu
类目: Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注:
Abstract:Foundation models have given robots a sophisticated brain for complex decision-making, yet deploying that intelligence into a physical platform still demands tedious, expert-driven calibration. This deployment gap, the robot’s spinal cord, remains a primary bottleneck to scalable Embodied AI. Hence, we propose SPINE (Scalable Physical Integration with ageNtic Expertise): an agentic framework for systematically debugging and deploying bimanual robots with minimal robotics expertise. SPINE’s harness comprises two orchestrated multi-agent workflows: a profile builder that creates robot-specific context, and a debugger that cycles through diagnosis, repair, and validation until teleoperation works. Across seven DOBOT X-Trainer debugging scenarios, a robotics novice using SPINE outperformed human operators using Claude Code with the same reference materials, but without SPINE’s structured workflow, improving operationalization success from 75% to 100% and reducing mean time-to-teleoperation from 16 min 45 s to 13 min 47 s. On AgileX PiPER, a distinct ROS/CAN bimanual arm, SPINE resolved all 10 implanted bugs, versus 9 out of 10 for the expert baseline, in nearly the same amount of time. Together, these results show that SPINE can transfer across bimanual platforms, reduce dependence on expert calibration, and move embodied AI closer to scalable real-world deployment.
[AI-82] Uncertainty-Aware Sequential Decision Rules for Event-Triggered LLM Invocation in Streaming Systems KDD2026 ECML
链接: https://arxiv.org/abs/2607.13048
作者: Zhaohui Wang
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Machine Learning (stat.ML)
备注: 18 pages, 5 figures. Accepted to the ECML PKDD 2026 Research Track
Abstract:Streaming inference pipelines increasingly pair lightweight fast models with Large Language Models (LLMs) that provide rich semantic understanding at substantial cost. The central question of when to invoke the LLM has received limited formal treatment. We cast this as a risk-based sequential stopping problem, where a trigger policy fires when a risk functional over the observation history exceeds a threshold. Within this framework, we prove six results: a minimum inter-event time bound excluding trigger chattering; optimality of threshold policies via smooth pasting; approximate SPRT guarantees under estimated parameters; O(sqrt(T log T)) regret for stationary streams, extending to O(sqrt((C_T + 1) T log T)) under C_T changepoints; O(1/sqrt(T)) convergence of online gradient descent for adaptive thresholds; and a calibration-to-miss-rate transfer inequality. Several classical trigger families, including event-triggered, optimal stopping, SPRT, CUSUM, and Bayesian triggers, can be expressed as special cases of this framework. On turbofan degradation data (CMAPSS) with real LLM calls, we empirically verify the theoretical assumptions, ablate the risk function design, compare against six baselines including a RouteLLM-style router and contextual bandits, and analyze cost sensitivity and LLM failure modes. The results confirm sublinear regret, with alpha 1 for all principled triggers; high diagnostic quality, with 92.9 percent of 1600 LLM diagnoses reaching grounding score = 0.75 under our rubric; and that anomaly-score-driven risk functions dominate alternatives by roughly an order of magnitude on the Pareto AUC.
[AI-83] Federated Explainable Artificial Intelligence: Roles Architectures Evaluation and Open Challenges
链接: https://arxiv.org/abs/2607.13045
作者: Masoume Gholizade,Fabrizio Ruffini,Pietro Ducange,Francesco Marcelloni
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 68 pages, 4 figures
Abstract:Federated Learning (FL) has emerged as a key paradigm for privacy-preserving collaborative model training across distributed and heterogeneous data sources. By keeping raw data local, FL addresses data confidentiality concerns, yet it does not resolve the opacity of modern machine learning models. In parallel, Explainable Artificial Intelligence (XAI) has gained attention for improving transparency, trust, and accountability, particularly in high-stakes domains. Their intersection has given rise to Federated Explainable Artificial Intelligence (FedXAI) paradigm, which aims to jointly satisfy privacy and explainability requirements. This survey provides a systematic review of FedXAI, highlighting the transition of explainability from a post-hoc tool to an integral component of the FL lifecycle. We show how explainability supports aggregation, personalization, robustness, coordination, and system-level decision making. To organize the literature, we introduce a taxonomy that classifies FedXAI methods by the role of explainability, model and explainer types, explanation scope, integration level, FL settings, and data heterogeneity. We review approaches ranging from model-agnostic explanations to interpretable federated models and explainability-aware aggregation mechanisms. We also examine evaluation practices and discuss the lack of standardized benchmarks and metrics for measuring explanation quality, stability, privacy leakage, and computational overhead. Finally, we identify key challenges, including explainability under non-IID data, explanation-centric security threats, communication-efficient XAI, continual FedXAI, and the integration of domain knowledge and regulatory constraints. By consolidating existing work and identifying key gaps, this survey serves as a reference framework for designing trustworthy, transparent, and privacy-preserving federated AI systems.
[AI-84] LessonBench-V1: A Benchmark Dataset for Evaluating AI Lesson Generation Agents
链接: https://arxiv.org/abs/2607.13041
作者: Ravidu Suien Rammuni Silva,Ahmad Lotfi,Isibor Kennedy Ihianle,Golnaz Shahtahmassebi,Jordan J. Bird
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Multimedia (cs.MM)
备注:
Abstract:Large Language Model (LLM) based AI educational content generation systems are increasingly being developed, yet no standardised benchmark exists to systematically evaluate them. This study introduces LessonBench-V1, a benchmark dataset comprising 647 human-written lessons paired with LLM-based reverse-engineered lesson plans across 240 STEM topics spanning mathematics, physics, chemistry, and computer science. The lessons are drawn from 97 trusted open sources, including LibreTexts, this http URL and GeeksForGeeks. Each lesson plan is human-reviewed and produced through a pedagogically grounded methodology that synthesises Bloom’s Taxonomy, Gagné’s Events, Merrill’s First Principles, and the 5E Instructional Model. The lesson plans capture 3,620 learning objectives with pedagogical metadata, enabling systematic, reproducible evaluation of lesson-generation AI agents and supporting further research. The study further proposes a three-dimensional evaluation pipeline for use with the dataset.
[AI-85] Final Authority in AI Governance: Frontier-Provider Sovereignty and Action-Centered Deployer Governance
链接: https://arxiv.org/abs/2607.13040
作者: Zexun Wang
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI)
备注: 23 pages, 5 figures, 6 tables
Abstract:This paper examines where final authority should sit once capable AI systems are embedded in organizational workflows. It compares two governance models. The first, frontier-provider sovereignty, assigns privileged authority to the provider of the most capable models and is reflected in contemporary arguments for frontier-model testing, release gating, transparency duties, and compute-related controls. The second, action-centered deployer sovereignty, places final authority over high-impact actions with the organization that authorizes the action, embeds it in a business process, and bears the downstream legal, operational, and commercial consequences. The paper combines comparative reading of public governance frameworks with implementation-informed analysis of runtime heterogeneity and enterprise control requirements. It compares EU AI Act guidance, the NIST AI Risk Management Framework, Singapore’s Model AI Governance Framework for Agentic AI, recent Japanese AI policy instruments, and Canada’s voluntary code and managerial guidance. Across these materials, the paper finds stronger support for distributed operational accountability than for unilateral frontier-provider control. It further argues that rapid enterprise adoption, declining provider transparency, and widening control gaps increase the value of a portable governance layer centered on governed action rather than on provider-native session objects. The conclusion is layered rather than absolutist: strong upstream authority remains justified for frontier capability gating, but final authority over concrete enterprise action is better located with the deployer and consequence-bearer.
[AI-86] Safeguard-Conditioned Uplift: Measuring Utility-Risk Frontiers for Dual-Use Biology Assistants
链接: https://arxiv.org/abs/2607.13039
作者: Dipesh Tharu Mahato
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI)
备注: 17 pages, 1 figure
Abstract:Safety evaluations for dual-use biology assistants often measure base-model capability, refusal behavior, or jailbreak success. These metrics miss a deployment question: for a fixed base model, how does the access condition users actually see change benign utility and harmful actionable assistance? I introduce safeguard-conditioned uplift, a protocol for comparing deployed access conditions through a human-judged utility-risk frontier. I evaluate Claude Sonnet 4.6 and Gemini 3.5 Flash under helpful prompting, safety prompting, and an external safeguarded assistant on a 108-task surrogate benchmark, with the headline claim restricted to a locked 18-task held-out split. In a 600-row blinded human audit, the safeguarded assistant reduces harmful actionability relative to helpful prompting by -0.063 over 49 matched response pairs, with bootstrap 95% interval [-0.117, -0.011], while correctness changes by +0.009 with interval [-0.057, +0.077]. Adaptive, Test-B, cue-ablation, and controller-baseline checks support the measurement story but also show non-dominance: safety prompting is often strongest for Claude, while external control helps more for Gemini and can reduce benign utility. The contribution is not a universal defense. It is a deployment-level evaluation target, plus a learned risk-budgeted calibration procedure, for measuring how user-facing access conditions move the utility-risk frontier.
[AI-87] Designing Safety-Constrained LLM Systems for Public Health Information Access
链接: https://arxiv.org/abs/2607.13038
作者: Ben Torkian,Jun Zhou
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI)
备注:
Abstract:We present the design and implementation of a safety constrained large language model (LLM) system for public health information access, focusing on maternal and child health (MCH) resource navigation. While LLM based systems offer flexible and natural interfaces for information retrieval, their deployment in healthcare contexts introduces risks related to safety, trust, and uncontrolled generation. This work explores practical design patterns for constraining LLM behavior in safety critical environments. We introduce a multi-layered architecture that integrates domain-restricted retrieval augmented generation (RAG), strict boundary enforcement to prevent medical advice, anonymous multiuser session management, and comprehensive audit logging for monitoring and compliance. A key aspect of the design is a controlled data pipeline that grounds all responses in curated public health resources, avoiding reliance on the model pretrained medical knowledge. We implement the system in a real world public health setting and conduct scenario-based validation across in scope, out of scope, and emergency queries. Results show consistent enforcement of safety constraints, reliable resource grounding, and stable system performance, with an average response time of 5.3 seconds. Beyond the specific application, we discuss design trade offs and lessons learned in balancing safety, usability, and system flexibility. Our findings provide practical guidance for deploying LLM based systems in healthcare and other domains where strict information boundaries and accountability are required.
[AI-88] OriginBlame: Record- and Token-Level Data Provenance for AI Training Datasets
链接: https://arxiv.org/abs/2607.13037
作者: Haolin Xue
类目: Artificial Intelligence (cs.AI)
备注: 13 pages, 6 figures
Abstract:When a data contributor requests removal, model trainers face a practical gap: unlearning algorithms require a forget set, yet no tool can locate which training records belong to a given author. Existing provenance systems operate at file or dataset level, forcing catastrophic over-deletion. We present ob, a record- and token-level data provenance system that propagates author identity through data processing pipelines and resolves revocation requests into precise forget sets via deterministic queries. Evaluation on 219,555 Wikipedia pages demonstrates that record-level provenance eliminates dataset-level over-deletion (from 101x to 1.3x), while integration adds 1.3-4.0% throughput overhead (HuggingFace) and 2.1-19.0% (Datatrove) on wiki data. On a 1.7B model, provenance-based forget sets improve unlearning by 42% over random baselines.
[AI-89] Partially Correlated Verifier Cascades in LLM Harnesses: Concave Log-Odds Polynomial Reliability and Blind-Spot Ceilings
链接: https://arxiv.org/abs/2607.13918
作者: Jiangang Han
类目: atistics Theory (math.ST); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 14 pages, 2 figures. Code and synthetic-recovery experiments: this https URL
Abstract:Serial verification gates are a core reliability primitive in LLM harnesses: a candidate answer is returned only if k verifier calls all accept it. Under conditionally independent gates, the recent Odds Law (arXiv:2606.15712) shows that posterior log-odds grow linearly in k , so failure decays exponentially, and states that “a tight theory of partially correlated verifier cascades remains open.” This note gives a minimal such theory. Modeling the per-instance false-accept rate on the generator’s own errors as a latent variable \alpha \sim G (de Finetti), the exact cascade posterior is \ell_k = \ell_0 - \ln m_k , with m_k the k -th moment of G . Then: (i) \ell_k is concave in k for every non-degenerate G – the Odds Law is its tangent at the first gate and an upper bound; (ii) for Beta (a,b) latents, failure decays polynomially, 1-r_k \asymp k^-b , with correlation parameter \rho_v = 1/(a+b+1) ; (iii) a blind-spot atom of mass 1-\pi at \alpha=1 caps the evidence extractable from any number of gates at -\ln(1-\pi) nats, so reliability saturates below 1; (iv) letting the true-accept rate also vary ( \beta \sim H ) yields a trichotomy – gates eventually always help, plateau, or actively harm – decided by the upper-tail exponents of G and H , with closed-form crossover k^\dagger . The mechanism is survivorship: errors surviving gates are the high- \alpha ones. The theory is measurable: R repeated verdicts per instance identify the first R moments of G , so two verdicts identify \rho_v ; beta-binomial likelihood and NPMLE recover the reliability curve and the ill-posed ceiling. In synthetic tests, independence-based extrapolation underestimates failure by 20x at k=5 and ~3000x at k=10 ; the correlated fit at R=8 tracks held-out depths. The practical lever is decorrelation – changing model family, modality, or evidence source – not adding gates.
[AI-90] Verifying formulas for interventional distributions
链接: https://arxiv.org/abs/2607.13883
作者: Francesco Freni,Leonard Henckel,Sebastian Weichwald
类目: Methodology (stat.ME); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Machine Learning (stat.ML)
备注: Equal contribution between Leonard Henckel and Sebastian Weichwald
Abstract:We formalize verification in causal graphical models: deciding whether a given observational formula identifies a target interventional distribution. This opens a problem complementary to identification, asking not whether any identifying formula exists, but whether the given formula is identifying. We show that even sound and complete solutions to identification do not solve verification. We propose a falsifier as a first practical route forward, prove that it induces an almost-surely correct verifier for regular exponential-family models, and use the resulting verifier to develop the gateway test, which finds all sets admissible for use in a front-door formula.
[AI-91] Cover First Disagree Softly: Rethinking Mismatch-First Active Learning for Frame-Level Audio Classification
链接: https://arxiv.org/abs/2607.13571
作者: Shiqi Zhang,Tuomas Virtanen
类目: Audio and Speech Processing (eess.AS); Artificial Intelligence (cs.AI); Sound (cs.SD)
备注: submitted to DCASE workshop 2026, under reviewing
Abstract:Sound event detection relies on frame-level strong labels whose annotation is expensive. Active learning addresses this problem by selecting the audio segments whose labels help the classifier most. One of the prevailing acquisition strategies for this task, mismatch-first farthest-traversal (MFFT), combines the disagreement between two classifiers and the diversity of the selected segments through hard sequential decisions. It selects whole groups of high-disagreement segments first and spreads only the remaining budget by farthest traversal. On two multi-label datasets we show that this design is blind to the similarity among the selected segments and fails under low budgets, with every mismatch-first variant ending below the plain geometric strategy it builds on. We propose mismatch-weighted facility location (MW-FL), which spends the entire budget through a disagreement-weighted coverage objective that penalizes similarity among the selected segments. The disagreement signal from MFFT is used to obtain the nonnegative weights of this facility-location objective, without introducing hyperparameters. Experiments across two geometric mechanisms with three ways of using disagreement show that coverage of the selected segments is the dominant factor, hard disagreement gating of selection is harmful on both mechanisms, and soft disagreement weighting helps on top of coverage. MW-FL attains the best area under the learning curve on both datasets.
[AI-92] Grounded world models in biological organisms and future embodied AI
链接: https://arxiv.org/abs/2607.13560
作者: Giovanni Pezzulo,Davide Nuzzi,Marco D’Alessandro,Riccardo Proietti,Roberto Bottini,Paul Cisek
类目: Neurons and Cognition (q-bio.NC); Artificial Intelligence (cs.AI)
备注:
Abstract:Recent advances in generative and embodied AI have been driven by large-scale predictive learning over multimodal data. However, the resulting systems remain largely based on passive training regimes where linguistic regularities create the scaffold onto which information from other modalities is attached. Conversely, neuroscience and cognitive science suggest that biological intelligence is organized in the opposite way, where grounded world models acquired through interaction with the environment provide the semantic scaffold to which language is attached. Here, we illustrate five examples of neural circuits supporting grounded world modelling, which underlie navigation in physical and conceptual spaces, affordance-based perception and interaction with objects, active perception and exploratory learning, allostatic control and emotion, and the distinction between self- and world-generated outcomes. These examples highlight several features largely missing from current embodied AI, including the role of intrinsic dynamics as a foundation for learning, the centrality of action in aligning these dynamics with the external world, the prominence of autonomous experience and open-ended learning over passive assimilation of externally provided data, and the fact that early predictive and control mechanisms scaffold higher cognitive abilities such as reasoning, conceptual navigation, planning, imagination, understanding others’ minds, and communication. Finally, we discuss whether and how principles derived from biological systems may inform future embodied AI, including training regimes based on social interaction to construct world models that are not only grounded but also socially shared and aligned with human norms and values.
[AI-93] Greedy Volume Maximization of Gradient Embeddings for Long-Tailed Frame-Level Bioacoustic Active Learning
链接: https://arxiv.org/abs/2607.13555
作者: Shiqi Zhang,Marius Faiß,Ariana Strandburg-Peshkin,Tuomas Virtanen
类目: Audio and Speech Processing (eess.AS); Artificial Intelligence (cs.AI); Sound (cs.SD)
备注:
Abstract:Bioacoustic call-type classification relies on costly expert annotation. Active learning can reduce this burden by selecting a small batch of segments for expert annotation and using the labeled segments for training the classifier. The setting is hard: the target calls are extremely sparse and the call-type distribution is long-tailed, so a tight budget must be spent on the few rare, informative segments. We propose BADGE-Greedy-DPP, a deterministic batch selector that greedily adds the segment whose BADGE gradient embedding most enlarges the volume spanned by the batch; because this log-volume objective is submodular, the greedy rule guarantees a batch value at least a (1-1/e) fraction of the optimum of this objective, a guarantee not provided by BADGE’s existing k-means++ and MCMC DPP sampling heuristics. There is also a temporal granularity mismatch in the task. The acquisition function scores whole segments, yet the informative frames inside them are few. Uniform averaging therefore washes them out. We show that the BADGE construction naturally addresses this mismatch when applied frame-wise, as prediction residuals weight the aggregated pseudo-gradient, so confidently predicted no-call frames contribute little while a single uncertain rare-call frame can still set the segment’s direction. Across 10 runs on a sparse, imbalanced hyena call-type dataset, BADGE-Greedy-DPP achieves the best overall and rare-call-type performance among all compared query strategies, including MFFT, the strongest non-BADGE baseline, and the two vanilla BADGE traversals.
[AI-94] Price of Fairness in Bandits: A Tight Minimax Characterization
链接: https://arxiv.org/abs/2607.13402
作者: Dhruv Sarkar,Soumyadeep Dutta,Sayak Ray Chowdhury
类目: Machine Learning (stat.ML); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:In bandit problems, standard regret-minimizing algorithms treat exploration as an amortized cost, which can expose early participants to unfair ex-ante losses in settings such as clinical trials. Recent work addresses this by evaluating the sequence of per-round expected rewards through the generalized p -mean, interpolating between utilitarian welfare ( p=1 ), Nash welfare ( p\to0 ), and Rawlsian fairness ( p\to-\infty ). Although tight guarantees are known for p\ge0 , the strictly fair regime q=-p0 remains unresolved because negative-power means are dominated by the smallest per-round rewards. For \sigma -sub-Gaussian rewards with nonnegative means, the best prior algorithm relied on uniform early exploration and achieved regret O(k^(q+1)/2/\sqrtT) , while the only general lower bound was the classical \Omega(\sigma\sqrtk/T) . Thus it was unclear whether the extra dependence on k was intrinsic to strict fairness or an artifact of uniform exploration. We close this gap by identifying the exact polynomial price of strict fairness. Using a needle-in-haystack construction, we prove an algorithm-independent lower bound \Omega(\sigma\sqrtk^\max(1,q)/T) ; for q1 , this shows that the penalty k^q/2 is information-theoretically unavoidable. We then introduce \textsfUCB-HARE (Harmonic Anchored Rank Exploration), which replaces uniform exploration with an inverse-weighted harmonic rank schedule protected by a certified positive-mean anchor. Its regret is \widetildeO(\sigma\sqrtk^\max(1,q)/T) , matching the lower bound up to logarithmic factors. Experiments on synthetic instances confirm that \textsfUCB-HARE improves over uniform-exploration baselines, with gains increasing as q grows. Subjects: Machine Learning (stat.ML); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2607.13402 [stat.ML] (or arXiv:2607.13402v1 [stat.ML] for this version) https://doi.org/10.48550/arXiv.2607.13402 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-95] Efficient Text-to-Audio Generation via Pruning
链接: https://arxiv.org/abs/2607.13330
作者: Arshdeep Singh,Yi Yuan,Yun Chen,Wenwu Wang,Mark D. Plumbley
类目: Audio and Speech Processing (eess.AS); Artificial Intelligence (cs.AI)
备注: Submitted to DCASE 2026 Workshop
Abstract:Diffusion-based text-to-audio generative models such as AudioLDM achieve high perceptual quality and strong semantic consistency; however, their practical deployment is hindered by the substantial computational cost of the U-Net denoising backbone. In this work, we apply model pruning to improve the computational efficiency of AudioLDM, a U-Net-based text-conditioned audio latent diffusion model. We analyse parameter redundancy across U-Net convolutional blocks and evaluate a filter-pruning strategy. Pruning is guided by norm-based criteria and followed by lightweight finetuning to recover performance losses. Experimental results demonstrate that up to 83% of the parameters and 39% of the multiply-accumulate operations of U-Net have been reduced while maintaining, and in some cases improving, generation quality compared to the baseline unpruned network. We find that pruning affects AudioLDM’s ability to generate certain sound events including safety-critical sounds such as gunshots, sirens, and explosions, as well as mechanical sounds such as drills and sewing machines, and other sounds such as sprays and tick-tocks, which are mostly recovered by lightweight finetuning of the pruned model.
机器学习
[LG-0] Leverag ing unlabelled data for generalizable neural population decoding
链接: https://arxiv.org/abs/2607.14086
作者: Ximeng Mao,Nanda H. Krishna,Avery Hee-Woon Ryoo,Matthew G. Perich,Guillaume Lajoie
类目: Machine Learning (cs.LG); Neurons and Cognition (q-bio.NC)
*备注:
Abstract:Robust and accurate neural decoders are integral to neurotechnologies such as brain-computer interfaces and closed-loop experiments. Recent work has shown that tokenizing neural data at the spike level facilitates multi-session pretraining and delivers state-of-the-art decoding performance. However, current spike-based models are restricted to supervised learning (SL), limiting training to datasets with paired behavioural labels. To address this limitation, we introduce MOJO (Masked autOencoder-based JOint training), a training framework for spike-tokenizing models that jointly leverages self-supervised learning (SSL) via masked autoencoding and SL objectives. We evaluate MOJO on three spiking datasets spanning monkey motor cortex during reaching tasks and multi-regional mouse recordings during vision and decision making tasks, demonstrating superior performance over purely SL-trained models. This improvement is especially pronounced when training with limited labelled data, particularly in few-shot finetuning, where only a small amount of labelled data from a new session is available. Incorporating SSL also yields more interpretable neuronal representations, improving performance on brain region classification and spike-statistics prediction without explicit optimization for these tasks. We further show that MOJO generalizes beyond spiking data to human electrocorticography during speech, where it continues to outperform purely SL-trained models and achieves performance comparable to neuro-foundation models (NFMs) designed specifically for continuous signals. Overall, augmenting spike-tokenizing models with SSL improves performance in label-impoverished settings and enables the use of unlabelled data across various tasks and species, while generalizing to other neural modalities. These results suggest a path towards more flexible and scalable data usage when training NFMs.
[LG-1] Linear Independent Component Analysis via Optimal Transport
链接: https://arxiv.org/abs/2607.14081
作者: Ashutosh Jha,Michel Besserve,Simon Buchholz
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Linear Independent Component Analysis (ICA) recovers jointly independent source signals from their linear mixtures. To achieve this, classical ICA algorithms attempt to maximize non-Gaussianity, measured by negentropy, which is linked to independence by information theory. Because exact negentropy optimization is intractable, they rely on proxy contrast functions, such as fourth-order cumulants, and parametric log-likelihoods. We propose instead to measure non-Gaussianity using the squared Wasserstein distance W_2^2 to a standard Gaussian. We prove that the Wasserstein distance between a standard normal distribution and linear projections of the data is maximized when the projection recovers an independent component. Based on this observation, we propose the OT-ICA algorithm which finds this projection by gradient-based optimization. Empirical evaluation on simulated data shows that OT-ICA outperforms proxy-based methods for different distributions of the latent variables. Application to EEG artifact removal and econometric price discovery confirm OT-ICA can be used for applied ICA tasks without distributional assumptions.
[LG-2] MetaPerch: Learning from metadata for bioacoustics foundation models ICML26
链接: https://arxiv.org/abs/2607.14072
作者: Mustafa Chasmai,Vincent Dumoulin,Jenny Hamer
类目: Machine Learning (cs.LG); Sound (cs.SD)
*备注: Accepted to ICML 26
Abstract:Bioacoustic foundation models rely on large-scale citizen science platforms like Xeno-Canto for geographically and ecologically diverse data. Recent work has shown that supervision alone can produce SotA species detection models when trained on this large-scale data – however, there remains unutilized potential in the form of recording metadata readily available within these community-driven data hubs. In this work, we explore the use of metadata – such as location and time – as auxiliary supervision signals, allowing the model to leverage species-metadata correlations in its learned representation. Auxiliary metadata losses provide additional information beyond vocalizations alone that can encourage a richer, more robust representation that generalizes better to species distribution and acoustic domain shifts – important challenges for deployment in real-world passive acoustic monitoring (PAM) settings. We introduce MetaPerch, a new foundation model that achieves strong species identification performance across multiple challenging domains and present an extensive empirical study of the effects of 9 diverse metadata sources on 17 bioacoustic datasets.
[LG-3] Lighthouse RL: Sample-Efficient Circuit Optimization via Strategic Reset Points
链接: https://arxiv.org/abs/2607.14008
作者: Mustafa Emre Gürsoy,Stefan Uhlich,Ryoga Matsuo,Yağız Gençer,Arun Venkitaraman,Chia-Yu Hsieh,Andrea Bonetti,Eisaku Ohbuchi,Lorenzo Servadei
类目: Machine Learning (cs.LG); Hardware Architecture (cs.AR)
*备注:
Abstract:In this paper, we introduce Lighthouse RL, a sample-efficient reinforcement learning (RL) approach for analog circuit sizing. Traditional methods lack generalization across different performance targets, while standard RL approaches waste resources exploring unpromising regions. Our method addresses these inefficiencies through a strategic reset strategy that initializes episodes from high-performing configurations discovered during training, called “lighthouses”. These states, which are closer to the target objectives, guide exploration toward promising regions. When compared to RL and Bayesian optimization methods from the literature, we demonstrate the effectiveness of our approach on a 2D benchmark problem and on two analog circuits, showing significant improvements in sample efficiency (up to 1.72x faster), optimization performance (100% vs. 0-87% success rate), generalization (75% vs. 0-50% extrapolation success), and objective maximization. This efficiency is particularly valuable for computationally expensive black-box optimization problems, and our reset strategy can be used as a plug-and-play enhancement for any RL-based optimization approach.
[LG-4] Lyapunov Exponent as Physics-Informed Dense Reward: RL Discovery of Stabilization Beyond the Kapitza Pendulum
链接: https://arxiv.org/abs/2607.14001
作者: Slava Andrejev
类目: Machine Learning (cs.LG)
*备注:
Abstract:We suggest using the Lyapunov characteristic exponent (LCE) as a dense reward signal for the reinforcement learning problem of stabilizing the inverted pendulum with vertical motion. With LCE, the agent not only successfully found the oscillatory motion known as the Kapitza pendulum but also damped the pendulum’s pivoting, leaving it in a strictly upright position.
[LG-5] RACE: Turn-level Reward Assignment via Credit Estimation for Long-Horizon Agents
链接: https://arxiv.org/abs/2607.13988
作者: Leitian Tao,Baolin Peng,Wenlin Yao,Tao Ge,Hao Cheng,Mike Hang Wang,Jianfeng Gao,Sharon Li
类目: Machine Learning (cs.LG)
*备注: 26 pages
Abstract:Multi-turn agents solve complex tasks through extended sequences of tool interactions before producing a final answer, making credit assignment a fundamental challenge during post-training. Outcome rewards provide reliable supervision for short-horizon reasoning, but become sparse and high-variance as trajectories grow to tens or hundreds of tool calls. They can also be misleading: a failed rollout may contain many useful actions that move the agent closer to the goal, yet outcome-only training assigns them the same negative advantage as the eventual mistake. We propose TRACE (Turn-level Reward Assignment via Credit Estimation), a dense credit-assignment method for agentic reinforcement learning. TRACE represents rollouts as state transitions at tool-call boundaries, obtains gold-answer log-probabilities from a frozen reference model, transforms them into log-ratio state values, and derives per-action rewards as Temporal-Difference changes in those values. This requires no additional critic or process-label training, and its one-step log-ratio TD component telescopes across redundant tool calls. On long-horizon complex search, TRACE substantially improves base-model tool-use ability using pure RL, without a cold-start supervised fine-tuning stage, an agentic mid-training stage, or training on live-web data. On the closed-web BrowseComp-Plus benchmark, it raises Qwen3-4B from 7.2 to 35.6 and Qwen3-30B-A3B from 8.4 to 42.6 . The learned search behavior also transfers to open-web benchmarks, and the learning curves show earlier improvement and faster convergence during RL training.
[LG-6] Beyond the d2.5-mixing bound for Dikin walks on polytopes
链接: https://arxiv.org/abs/2607.13943
作者: Yunbum Kook
类目: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注: 36 pages
Abstract:Inspired by interior-point methods (IPM) for structured convex optimization, Kannan and Narayanan introduced the Dikin walk for sampling uniformly from polytopes in 2009. As in IPMs, the Dikin walk is affine-invariant, and its convergence is governed by the barrier geometry used to define its local proposal. They showed that the Dikin walk with the logarithmic barrier for a polytope in \mathbbR^d with m linear inequalities mixes in md iterations. In 2017, Chen, Dwivedi, Wainwright, and Yu improved this to d^2.5 using a Lewis-weight barrier, and conjectured that the correct mixing time should be d^2 . We make progress toward this conjecture by improving the previous d^2.5 -mixing bound. For exponential sampling over a polytope, we prove that the Dikin walk with a scaled Lee–Sidford metric mixes from a warm start in d^2.25 iterations. This also yields an improved cold-start complexity via a known annealing framework. The main technical ingredient is improved average self-concordance of the Lee–Sidford metric, which gives high acceptance probability for the Metropolis filter along a random Dikin proposal. While previous analyses were effectively limited to second-order control due to technical difficulties, we develop a principled higher-order analysis. The proof combines a selective higher-order expansion of recursive bottleneck terms, a moving orthonormal-frame calculus for higher derivatives of the Lewis weights, and Wiener-chaos decompositions via multiple stochastic integrals to control the resulting Gaussian polynomials. Comments: 36 pages Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG); Optimization and Control (math.OC) Cite as: arXiv:2607.13943 [cs.DS] (or arXiv:2607.13943v1 [cs.DS] for this version) https://doi.org/10.48550/arXiv.2607.13943 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-7] VAIOM: Continuous-Input Discrete-Output Decoder-Only Financial Sequence Modeling
链接: https://arxiv.org/abs/2607.13929
作者: Yiming Ma,Xinyu Chen
类目: Machine Learning (cs.LG); Computational Finance (q-fin.CP)
*备注:
Abstract:Financial observations are continuous, heterogeneous, and noisy, whereas decoder-only next-token models are usually built around discrete symbolic inputs. We introduce Vector-Input Autoregressive Inference for Ordinal-Return Modeling (VAIOM), a decoder-only Transformer for probabilistic next-return modeling on one-hour foreign-exchange bars. VAIOM separates input representation from output likelihood: continuous multivariate financial-event vectors preserve numerical structure at the input, while a categorical distribution over the next volatility-normalized return bucket supports cross-entropy training and likelihood evaluation. The selected 0.9M Hybrid Continuous Input model combines continuous event features with categorical asset metadata, a Mixture-of-Market-States return head, Gap, volatility-regime, and Ordinal auxiliary objectives, and full-sequence supervision. Models and preprocessing are fit using pre-2024 Train data; models are selected on 2024H2 Validation and evaluated without refitting on two 2025 Test periods. Across three independent training seeds, every model outperforms fixed single-bar LightGBM baseline in both Test halves. For the canonical checkpoint, paired gains over LightGBM are 0.029 and 0.043 bits per event. Validation experiments show that continuous input improves over discrete-token input under the same categorical return objective, full-sequence supervision improves over last-position training, and auxiliary representation shaping together with a mixture-structured return head improves return likelihood in controlled comparisons. A supporting capacity study finds that the smallest evaluated complete architecture rung achieves the strongest Validation likelihood on the present corpus.
[LG-8] Plausible Deniability Guarantees for Whistleblowers ICML2026 ICML
链接: https://arxiv.org/abs/2607.13928
作者: Leo Richter,Matt J. Kusner
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注: Accepted at three ICML 2026 workshops, including the ICML Workshop on Technical AI Governance Research
Abstract:Whistleblowers are a key safeguard against organizational wrongdoing, but the threat of retaliation deters reporting. Existing whistleblower-protection proposals lack formal privacy guarantees, and existing differential privacy mechanisms do not directly target the natural threat model – one in which the audited organization itself observes auditor selection decisions and uses them to identify reporters. We formalize protection against a strong-adversary threat model as per-report (0, \delta) -differential privacy on the transcript of audit selections. Within this framework we prove that a natural approach – randomized response applied at the selection step – can never outperform uniform random auditing by more than \delta at any horizon. We then give a generic mechanism that reduces private auditing to private continual counting: any (0, \delta) -DP continual counter plugs in by post-processing, and the audit transcript inherits the same per-report guarantee. Instantiating the reduction with a recent work in continual counting yields per-report (0, \delta) -DP with noise scaling as O(\sqrt\log T) across a horizon of T audit decisions. A utility theorem shows that the selection error vanishes whenever the noisy report gap between the most-reported organization and the runner-up grows faster than \sqrt\log T . Simulations show a substantial improvement over randomized response.
[LG-9] An Efficient Newton Algorithm for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence
链接: https://arxiv.org/abs/2607.13919
作者: Damien Lesens,Jérémy E. Cohen,Bora Uçar
类目: Machine Learning (cs.LG)
*备注: 35 pages, 8 figures
Abstract:Nonnegative Matrix Factorization (NMF) is a fundamental tool in unsupervised learning, which approximates a nonnegative matrix by the product of two low-rank nonnegative factors. The Kullback-Leibler (KL) divergence is best suited to measure the data to model discrepancy when the decomposed data sample follows a Poisson distribution, which is the case for count datasets such as term-document matrices or images. Most KL-NMF algorithms in the literature minimize a separable majorant of the loss to find their next iterate. We argue that this method has reached its limits and propose to use instead the second-order Taylor expansion of the loss, leading to a Newton-type method. We minimize this non-separable surrogate by proposing a generalization of the well-known HALS algorithm. This yields an efficient KL-NMF algorithm which provably converges and which competes favorably with state-of-the-art algorithms on a large variety of datasets.
[LG-10] RF Spectrogram Anomaly Detection with Quantum Kitchen Sinks: Architecture Representation and Hardware Validation
链接: https://arxiv.org/abs/2607.13897
作者: Abdallah Aaraba,Alexis Vieloszynski,Remon Polus,Ola Ahmad,Soumaya Cherkaoui
类目: Machine Learning (cs.LG)
*备注: Paper accepted to IEEE quantum week 2026
Abstract:The broadcast nature of wireless channels exposes radio-frequency (RF) networks to anomalous and malicious transmissions, making anomaly detection a fundamental requirement for secure spectrum management. Quantum Kitchen Sinks (QKS) offer a lightweight hybrid quantum feature map suitable for near-term quantum devices, yet their behavior on structured signal data remains poorly understood. In this paper, we extend the standard QKS template with multi-depth data re-uploading and ring entanglement, and evaluate the resulting pipeline on controlled RF spectrogram anomaly detection. We introduce a validation-locked five-stage ablation protocol that systematically separates the effects of shallow architecture, re-uploading depth, episode budget, input representation, and classical readout. Across the completed benchmark, Discrete Cosine Transform (DCT) representations consistently dominate raw and Principal Component Analysis (PCA) inputs, moderate-depth entangled QKS configurations form the strongest operating regime, and QKS improves over matched classical direct-readout baselines across all evaluated representation-readout pairs on the held-out test set, with the best configuration reaching a test Area Under the Receiver Operating Characteristic curve (AUROC) of 0.8778 and a test F1 of 0.7995. The study bridges two levels of realism: real measured sub-6,GHz cellular signals on the data side and real-device validation on the ibm_quebec Quantum Processing Unit (QPU) on the computing side, with AUROC deviations below 0.013 relative to simulation. These results provide a practical, reproducible framework for deploying QKS-based anomaly detection in wireless networks.
[LG-11] ask-Oriented Sensing and Covert Transmissions for Collaborative Multi-AUV Systems
链接: https://arxiv.org/abs/2607.13880
作者: Xueyao Zhang,Chenyang Yan,Bo Yang,Xuelin Cao,Zhiwen Yu,Bin Guo,George C. Alexandropoulos,Merouane Debbah,Chau Yuen
类目: Machine Learning (cs.LG)
*备注:
Abstract:In underwater covert cooperative missions, autonomous underwater vehicles (AUVs) often cannot rely on active sonar to continuously obtain complete information, since active sensing and frequent communications increase the risk of exposure. As a result, AUVs primarily rely on passive observation, an approach that yields incomplete local perception and limited task efficiency. Although underwater acoustic communications can mitigate this limitation through information sharing, they are simultaneously constrained by long delays, severe interference, low reliability, and the risk of covert exposure. Existing communications-oriented multi-agent reinforcement learning (MARL) studies often model communication as an ideal information flow, whereas traditional communication optimization primarily focuses on link-level performance. However, both are insufficient to characterize the actual contribution of perceptual information to cooperative tasks under realistic conditions of covert physical communications. This paper proposes a Sensed Information Value Realization Multi-Agent Reinforcement Learning (SVR-MARL) framework that leverages practical information to characterize the utility of information for cooperative tasks and learns distributed cooperative policies under realistic communication and covert constraints. Through a case study of covert multi-AUV cooperative localization and tracking, the potential of the proposed framework to improve collaborative task efficiency while reducing unnecessary communication and exposure risks is demonstrated.
[LG-12] AI-Augmented Adaptive Digital Twin Modeling for Brain Tumor Evolution Prediction and Treatment Scheduling
链接: https://arxiv.org/abs/2607.13877
作者: Wenxi Liu,Michael Trimboli,Xianqi Li
类目: Machine Learning (cs.LG)
*备注:
Abstract:Brain tumor progression exhibits spatially heterogeneous growth, patient-specific treatment response, and complex interactions with surrounding anatomy, making accurate long-term prediction challenging. We propose an AI-augmented adaptive digital twin (DT) framework for brain tumor evolution prediction and treatment scheduling. The framework integrates an interpretable reaction–diffusion (RD) model, a 3D residual learning module for model-form correction, patient-specific DT updating during recursive rollout, and model predictive control (MPC) for constrained chemotherapy and radiotherapy scheduling. Experiments on 387 synthetic tumor trajectories with 120-step evolution show that the baseline RD model captures tumor location and overall temporal behavior but underestimates heterogeneous tumor burden during long-horizon prediction. Hybrid RD–residual modeling reduces masked voxel-wise mean squared error by 84.3% and increases Dice overlap by 43.5% relative to the RD baseline under dense simulated observations. Online DT updating further reduces mean squared error by 45.9% and improves Dice overlap by 9.6% compared with the non-updated hybrid model. In MPC-based scheduling simulations, the updated DT controller reduces final tumor burden by 22.4% relative to a fixed treatment schedule under the terminal-burden objective. Together, these results demonstrate a unified framework for patient-specific initialization, mechanistic modeling, adaptive learning, and constrained treatment optimization. Although validated using patient-data-informed synthetic trajectories rather than clinical longitudinal data, the proposed framework establishes a foundation for future translation to real-world adaptive treatment planning.
[LG-13] Relevance-Aware Rule: Structural Deletion of Irrelevant Conditions in Decision Trees
链接: https://arxiv.org/abs/2607.13874
作者: Jung-Sik Hong,Jeongeon Lee,Min Kyu Sim,Sangheum Hwang
类目: Machine Learning (cs.LG)
*备注: 31 pages, 6 figures
Abstract:Decision trees generate interpretable if–then rules, yet they contain irrelevant conditions (IRCs). These IRCs arise from the structural mechanism of tree splitting and persist even in modern optimal sparse tree induction algorithms. Existing IRC deletion methods overlook this structural mechanism; therefore, they either preserve the original tree too loosely to remain reliable, or too strictly to achieve meaningful simplification. This study provides theoretical foundations for reliable IRC deletion by establishing theorems and propositions related to the underlying IRC mechanism. The key finding is that a binary split shifts class proportions in opposite directions relative to the parent. Specifically, an increase in the class-1 proportion along one branch necessitates an increase in the class-0 proportion along its sibling, thereby generating a C1-link and a C0-link. Based on this structural fact, we propose a structural IRC deletion framework. Relative to each leaf, links that increase the leaf-class proportion are matched, whereas links that increase the proportion of the opposite leaf-class are mismatched. These mismatched links are flagged as structurally suspicious IRC candidates. Rather than deleting them outright, the framework rigorously diagnoses their relevance by assessing prediction reliability. It selectively deletes conditions that are structurally and empirically irrelevant, while strictly protecting those whose deletion would reduce the rule’s reliability. Experimental results confirm that the proposed framework achieves substantial rule simplification without sacrificing the reliability of the original tree.
[LG-14] Heavy-Tailed Flow Matching via Random Clocks
链接: https://arxiv.org/abs/2607.13841
作者: Zhouhao Yang,Yezhen Wang,Kenji Kawaguchi,Vladimir Braverman,Haoyang Cao
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Heavy-tailed data arise in many domains where rare events carry disproportionate importance, such as imbalanced image datasets, financial returns, and weather extremes. Standard diffusion and flow-matching models typically begin from Gaussian noise or Gaussian source distributions, which yield tractable training targets but provide a poor inductive match for heavy-tailed data. We propose Heavy-Tailed Flow Matching via Random Clocks (HTFM), a framework that portrays heavy-tailed sources as mixtures of clock-conditioned Gaussian sources. Conditioning on a given clock path, the source distribution and flow are Gaussian; marginalizing over the clock gives a Gaussian scale mixture covering Gaussian, \alpha -stable, and Student-t families. To make the clock-conditioned vector field practical, we encode the path-valued clock using truncated logsignature features, allowing the velocity field to adapt to the realized conditional space with negligible overhead. Empirically, on 2D imbalanced \alpha -stable mixtures, CIFAR10-LT, and HRRR weather fields, HTFM improves mode coverage, sample quality, and tail-statistic recovery over Gaussian flow matching and competitive heavy-tailed baselines, while retaining the low-NFE sampling advantage of flow matching. Moreover, the random-clock formulation further provides a practical tail-control interface: by varying only the clock law or tail parameter, the same architecture can calibrate the ``heaviness’’ of generated tails across different distribution families.
[LG-15] Mono-Z Dark Matter Search with Neural Spline Flows Using CMS Run 2015D Open Data
链接: https://arxiv.org/abs/2607.13771
作者: Hitesh Rasineni(1),Bhavishya Chebrolu(2) ((1) VIT-AP University, Amaravati, India, (2) Mohan Babu University, Tirupati, India)
类目: Machine Learning (cs.LG); High Energy Physics - Experiment (hep-ex)
*备注: 29 pages, 9 figures, 17 tables. The first two authors contributed equally to this work
Abstract:We report a search for dark matter (DM) produced in association with a leptonically decaying (Z) boson at (\sqrts=13) TeV using CMS Run 2015D open data corresponding to an integrated luminosity of (2.32,\mathrmfb^-1) together with simplified-model Monte Carlo simulation. Events are selected in the mono-(Z\rightarrow\ell^+\ell^-) final state in both the (\mu\mu) and (ee) channels. Forty kinematic observables are extracted from MINIAOD and MINIAODSIM, cleaned with physics-motivated selections, and reduced to a 37-dimensional feature vector. Five Neural Spline Flows are trained independently to model Standard Model background and mediator-specific DM signal densities. The per-event test statistic is constructed from the log-likelihood ratio between the signal and background density estimates, providing sensitivity across the full kinematic phase space without requiring a hard upper (\mathrmMET) threshold. A simultaneous profile-likelihood fit combining the two channels yields observed (expected) 95% confidence level upper limits on the signal-strength parameter of (\mu0.0177) ((0.0018)) for the scalar mediator, (\mu0.0362) ((0.0039)) for the vector mediator, and (\mu0.0498) ((0.0069)) for the axial-vector mediator. The observed limits are weaker than expected because of a residual high-(\mathrmMET) background-modeling discrepancy rather than evidence for a DM signal. To our knowledge, this is the first application of Neural Spline Flow likelihood-ratio scoring to a mono-(Z) dark matter search using CMS Run 2015D open data simultaneously in the (\mu\mu) and (ee) channels.
[LG-16] Algebraic Representability as the Limiting Regime of Grokking: An Exactly Solvable Model with Holomorphic Activations
链接: https://arxiv.org/abs/2607.13749
作者: Chon-Fai Kam,Xavier Cadet,Miloud Bessafi,Frederic Cadet
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Neural networks trained on modular arithmetic exhibit grokking, a delayed transition from memorisation to generalisation known to depend on model capacity: too little and the network memorises slowly or not at all, too much and it generalises almost immediately. What happens at the extreme of this spectrum, when the architecture’s expressible function class collapses to a finite-dimensional algebraic variety? We study two-layer networks with a holomorphic monomial activation sigma(z)=z^k, trained on modular tasks encoded via roots of unity. Here the network output, regardless of hidden width, is confined to a (k+1)-dimensional subspace of characters of (Z_p)^2, an O(k/p^2) slice of the full function space. We give a complete algebraic characterisation of this subspace: a task is representable if and only if its discrete Fourier support lies on the diagonal u+v = k (mod p), which for linear-phase targets reduces to the arithmetic criterion m+n=k. This is not merely a constraint on eventual generalisation but on memorisation itself: because the outputs are algebraically confined, a non-representable target cannot be fit even on the training set, and we prove a positive lower bound on the training loss, independent of width. Across 585 runs the algebraic prediction matches the observed outcome with 99.8% accuracy, with no memorisation regime and no grokking; outcomes split cleanly into instant success and outright failure. This binary behaviour is the limiting case of the capacity-grokking relationship: when the expressible class shrinks to a fixed algebraic object, the question of when a network will grok dissolves into whether it can represent the target at all. A bottleneck ablation connects this extreme to standard networks, tracing a continuous path from representational failure, through memorisation without generalisation, to grokking with a shrinking gap as capacity grows.
[LG-17] Implementations of Quantum and Classical Topology-Aligned Architectures for Molecular Property Prediction
链接: https://arxiv.org/abs/2607.13737
作者: James T. Pegg,Hubert Okadome Valencia,Ronin Wu
类目: Machine Learning (cs.LG)
*备注:
Abstract:For low-data and resource-constrained regimes typical of quantum chemistry, parameter-efficient learning is a key objective. Here, we propose a topology-aligned inductive bias in which the model architecture mirrors the molecular bond graph: atoms map to a fixed register of computational units, and bonds determine which pairs interact through shared learnable parameters. This principle is instantiated in two architectures: a variational quantum circuit (Iso-QGNN), and a parameter-matched classical message-passing model (Iso-CGNN). The models are benchmarked on HOMO-LUMO and dipole moment binary classification tasks over the QM9 benchmark. With 64 trainable parameters, the implementations achieve test AUCs of approximately 0.88 (quantum) and 0.91 (classical) on the gap task, and close to 0.78 (both) on the dipole task. The models reach 90% of asymptotic performance within about 250 training molecules and gradient norms remain stable throughout training. These results indicate that the topology-aligned inductive bias is the active ingredient driving parameter efficiency at QM9 scale, with implications for matched-baseline benchmarking in quantum machine learning.
[LG-18] Constraint-Driven Model Optimization: An Industry Framework for Selecting Compression and Acceleration Techniques in Modern Machine Learning Systems
链接: https://arxiv.org/abs/2607.13735
作者: Dhruv Shivkant,Saket Mohanty,Utkarsh Wadhwa
类目: Machine Learning (cs.LG)
*备注:
Abstract:The rapid deployment of machine learning systems across cloud, edge, and enterprise environments has brought model optimization to the forefront of systems-engineering. Despite a rich literature spanning quantization, pruning, knowledge distillation, parameter-efficient fine-tuning (PEFT), and inference-time optimization, practitioners are often left navigating these techniques through heuristics rather than principled methodology. We argue that optimization should be formulated as a constraint-driven, multi-objective engineering decision and introduce a unified framework that characterizes any production deployment along five interacting constraint dimensions: data availability, latency budget, memory budget, accuracy tolerance, and retraining budget. Building on this taxonomy, we synthesize empirical gains reported across the research literature and map them to operational constraints rather than algorithmic categories. To ensure practical relevance, we selected these techniques by reviewing recent literature for methods that report measurable improvements against critical deployment bottlenecks. We propose a prescriptive decision framework and provide optimization pipelines for four representative industrial scenarios to illustrate it in practice. To the best of our knowledge, this work provides one of the first structured attempts to formalize model optimization as a constraint-aware, multi-objective engineering process, synthesizing quantitative evidence from the research literature.
[LG-19] DAGR: State-Conditioned Goal Representations via Difference-Aware Goal Cross-Attention
链接: https://arxiv.org/abs/2607.13731
作者: Xing Lei,Wenyan Yang,Xuetao Zhang,Donglin Wang
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Goal-conditioned reinforcement learning hinges on how the goal is encoded. Contrastive, metric, temporal-distance, and information-theoretic encoders differ in objective. They still share one trait. None of them sees the current state. Such a state-independent embedding cannot mark which part of the goal still needs action. The policy must then recover that cue by inverting both encoders. We propose DAGR. It refines the static embedding of any late-fusion encoder into a state-conditioned one through multi-scale gated cross-attention. A near-identity gated residual preserves the base representation. Difference-aware Goal Cross-Attention then biases the attention scores using a per-token state-goal discrepancy map. On OGBench, DAGR improves navigation. Our ablations trace the gain to the gated residual, not to the difference bias that names the method. On manipulation and puzzle tasks it matches or falls below the base. DAGR is a structured refinement, not a universal improvement.
[LG-20] Conditional Invertible Neural Networks for Data-Driven UAV Control: A 2-D Proof of Concept
链接: https://arxiv.org/abs/2607.13703
作者: Christian Wittke,Stephan Myschik,Oliver Niggemann
类目: Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注:
Abstract:We investigate conditional invertible neural networks (cINNs) as probabilistic inverse-dynamics models for multirotor control. For a planar X8 coaxial multicopter, we learn p(u \mid s_t, c_t) from an incremental nonlinear dynamic inversion (INDI) teacher using rational-quadratic spline coupling and invertible linear mixing. Open-loop reproduction reaches R^2 = 0.944 , mean CRPS 0.0915, and log-probability-error correlation \rho = -0.60 . Over 15 closed-loop scenarios, position RMSE matches INDI (9.7 vs. 9.5 m), with 47 percent tracking acceptably; failures separate into attitude divergence under aggressive steps and phase lag under high-frequency references, isolating command bandwidth and data coverage as dominant failure mechanisms.
[LG-21] Microstructure-Conditioned Surrogate Models for Graded Multiscale Optimization of Mycelium Composites
链接: https://arxiv.org/abs/2607.13688
作者: J. Storm,I.B.C.M. Rocha,S. Schyck,K. Masania,F.P. van der Meer
类目: Machine Learning (cs.LG); Materials Science (cond-mat.mtrl-sci); Numerical Analysis (math.NA); Computational Physics (physics.comp-ph)
*备注:
Abstract:Emerging sustainable materials increasingly rely on engineered hierarchy and microstructure to achieve control of their properties and mechanical behavior. Optimizing these materials with controllable microstructures requires efficient multiscale simulations. Data-driven surrogate models for the microscale can accelerate multiscale simulations, but require large amounts of data even for a fixed microstructure. When a range of microstructures is considered, as is the case in multiscale optimization, even more data is needed to train a surrogate. To overcome this challenge, we condition a hybrid physics-data surrogate on microstructural variables using a hypernetwork. This approach enables accurate predictions of multiscale mechanical behavior for a mycelium-woodchip composite material, even when trained on small datasets. The conditioned surrogate makes multiscale simulations of functionally graded structures tractable, and we validate it against a full FE^2 simulation. We optimize a graded multiscale disk, and reduce the peak stress by 42% compared to one with a random microstructure. Then, we go one step further, conditioning the network directly on manufacturing variables that can have a complex influence on the microstructure. This is a practical route to engineer the microscale for desired macroscale behavior. This contribution highlights the benefits of microarchitectured structures and demonstrates how conditioned surrogate models enable their multiscale optimization, which will accelerate the development and design of future sustainable materials and structures.
[LG-22] Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation
链接: https://arxiv.org/abs/2607.13686
作者: Hao Qin,Chicheng Zhang
类目: Machine Learning (cs.LG)
*备注: 59 pages (11 pages main body, 17 pages supplementary materials)
Abstract:We study the contextual combinatorial semi-bandit (CCSB) problem with general reward function approximation. At each round, the learner observes a context, selects a combinatorial action consisting of a subset of basic arms, and receives the reward of each selected arm; the goal is to maximize the cumulative reward over time. We propose this http URL, a computationally efficient algorithm that, at each round, solves a convex optimization problem to sample a combinatorial action that balances exploration and exploitation. this http URL scales to large arm sets and imposes no structural assumptions on the action set beyond a cardinality bound of m on each combinatorial action. We prove that this http URL achieves a minimax optimal regret bound of O(\sqrtm A T \log |\mathcalF|) , where A is the number of arms, m is the maximum number of arms in a combinatorial action, T is the time horizon, and \mathcalF is the reward function class. In the realizable setting, this bound matches the state-of-the-art regret guarantees achieved by policy search-based algorithms in the more restricted slate recommendation settings, while simultaneously generalizing to arbitrary combinatorial action structures and general reward function approximation.
[LG-23] he Hyperspherical Geometry of CLIP Latent Space: A Semantic Mixture Model
链接: https://arxiv.org/abs/2607.13660
作者: Zijie Yu,Gaowen Liu,Ramana Rao Kompella,Philip S. Yu,Yue Song
类目: Machine Learning (cs.LG)
*备注: 23 pages, 8 figures
Abstract:Contrastive Language-Image Pretraining (CLIP) representations form a semantic embedding space governed by cosine similarity, reflecting an intrinsic hyperspherical geometry. However, existing probabilistic interpretations typically rely on Gaussian assumptions, which fail to capture this directional and multimodal structure. We propose a principled density model for the CLIP latent space based on Mixtures of von Mises-Fisher (MovMF) distributions defined on the unit hypersphere. Using the Expectation-Maximization (EM) algorithm, we efficiently learn a probabilistic model in which each mixture component corresponds to a coherent semantic concept. This formulation yields a closed-form likelihood naturally aligned with hyperspherical geometry, enabling accurate and interpretable density estimation. Empirically, our model significantly improves long-tailed and out-of-distribution detection and provides a natural semantic decomposition, representing each embedding as a sparse probabilistic combination of interpretable concepts. These results suggest that CLIP latent space is more faithfully characterized as a hyperspherical semantic mixture rather than an isotropic Gaussian, establishing a simple and geometrically consistent probabilistic framework for modeling and understanding multimodal representations. Project page is available at this https URL.
[LG-24] Maximally Robust Satisficing Bayesian Optimization UAI
链接: https://arxiv.org/abs/2607.13652
作者: Samuli Kinnunen,Petrus Mikkola,Antti Niskanen,Arto Klami
类目: Machine Learning (cs.LG)
*备注: Accepted to the Conference on Uncertainty in Artificial Intelligence (UAI) 2026
Abstract:Many design tasks can be cast as black-box function optimization, enabling use of Bayesian optimization to find an ideal design with minimal number of trials. However, often we do not actually need the optimum but instead a sufficiently good solution is enough, for instance a material that is durable enough for its intended use. In most cases there are multiple satisfactory solutions, forming a superlevel set of the function, raising a key question of which one to prefer. We answer this by explaining why robustness to input perturbations that may occur when the solution is deployed is a good criterion and by introduce a Bayesian optimization method that efficiently finds satisficing solutions that are robust to maximally large perturbations. In contrast to previous works, we assume the inputs can be accurately controlled during optimization, but will be perturbed after the deployment.
[LG-25] How the Hessian-Spectrum of Neural Networks Depends on Data ICML’26
链接: https://arxiv.org/abs/2607.13631
作者: Jasraj Singh,Enea Monzio Compagnoni,Antonio Orvieto
类目: Machine Learning (cs.LG)
*备注: 15 pages, 8 figures; Accepted at HiLD@ICML’26
Abstract:The Hessian matrix is an important quantity of interest when it comes to studying the loss landscape and optimization dynamics in deep learning, as well as designing measures of generalization, second-order learning algorithms, etc. Prior works have focused on empirical results or pursued a theoretical treatment under overly simplified settings. In this work, we derive the eigenvalues of the Hessian of linear networks with arbitrary widths and depths, and datasets with an arbitrary number of samples, features, and labels. Importantly, for classification tasks with MSE loss, we identify that the sharpness of the solution is directly related to the maximum proportion of samples belonging to any class. We empirically validate our predictions and systematically analyze the effects of shedding the impractical assumptions one at a time, as well as incorporating nonlinearities. We observe that our predictions are considerably robust in most cases, allowing us to extend our conclusions to more practical learning setups.
[LG-26] Structured Reinforcement Learning for Bayesian Persuasion : Application to Intelligent Interactive Driving
链接: https://arxiv.org/abs/2607.13576
作者: Merlin Paul,Anup Aprem
类目: Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注:
Abstract:Interactive driving, wherein an intelligent lead vehicle equipped with real-time traffic data coordinates route choices of connected vehicles, offers a promising approach to dynamic traffic management. To address the challenge of harmonising decisions, this paper considers the strategic information revealing framework of Bayesian persuasion. Here, the principal (lead vehicle) aims to guide the agent’s (connected vehicle) partially observable sequential decision making towards its own objectives by selectively revealing information, such as real-time traffic ahead, using signals. However, the agent’s farsighted response to maximize its long-term reward, renders the principal’s signaling strategy design computationally challenging. We propose an online structured reinforcement learning framework to synthesize computationally efficient signaling strategy which is persuasive for a far-sighted agent. The main contributions of the paper are as follows: (i) For a monotonic agent with approximate best response, we propose MAPL, a structured policy learning algorithm for faster online learning, (ii) Identification of sufficient conditions for the supermodular structure of the Q function of the principal for a monotonic agent, (iii) Identification of sufficient conditions to ensure the persuasiveness of the principal’s signaling strategy, (iv) Supermodular Q learning for Principal (SQP), which leverages the supermodular structure of principal’s action value to synthesize computationally efficient signaling strategy that is persuasive for a monotonic learning agent, (v) Numerical analysis considering a real-time application of Bayesian persuasive driving for lane selection demonstrates that the proposed method is 30% cost efficient for optimising travelling rewards of both the lead and connected vehicle compared to the existing methodologies for signaling strategy design.
[LG-27] Approximation of solutions of parameter-dependent problems by residual neural networks
链接: https://arxiv.org/abs/2607.13574
作者: Ana Carpio
类目: Numerical Analysis (math.NA); Machine Learning (cs.LG); Analysis of PDEs (math.AP)
*备注: to appear in Journal of Nonlinear, Complex and Data Science
Abstract:We develop a convergent scheme to train neural networks involving analytic activation functions based on gradient flows. Convergence properties are guaranteed by Lojasiewicz theory. The main advantage of this approach is its simplicity of implementation. The coefficients of the network are approximated by solving a system of ordinary differential equations. We test the method by constructing residual neural network approximations of solutions of parametric problems. The dependence of the solutions of simple ordinary differential equations on a few parameters is correctly reproduced. The solutions of inverse problems involving wave constraints which depend on a few parameters can be reasonably approximated, even in regions in which the problem is severely ill posed.
[LG-28] Flow-aware Optimal Navigation in Unsteady Flows through Reinforcement Learning
链接: https://arxiv.org/abs/2607.13553
作者: Andrea Maria Braghin,Nicolò Botteghi,Matteo Tomasetto,Andrea Manzoni,Gabriele Cazzulani
类目: Robotics (cs.RO); Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注:
Abstract:Autonomous robotic navigation in nonstationary time-varying fluid flows remains a fundamental challenge due to partial observability and the unpredictability of realistic environments. While classical optimal control frameworks employed in robotics require unrealistic a-priori global flow knowledge, biological systems are able to navigate successfully by exploiting localized sensory cues. In this work we present a reinforcement learning approach using the TD3 algorithm to train autonomous agents to reach arbitrary targets within a parametric, chaotic double-gyre flow. To investigate optimal sensory mechanisms, we evaluate five bio-inspired observation strategies based on relative position, local velocity or local vorticity measures, and short-term memory variants. Additionally, we analyze the impact of providing agents with explicit global flow parameters. Numerical results demonstrate that an agent that is able to sense and remember a set number of flow velocity measures achieves the highest performance. The experiments reveal a trade-off in sensor utility: velocity-aware agents optimize energy efficiency, whereas vorticity sensors provide superior structural mapping and achieve better target proximity. Incorporating explicit global flow parameters is shown to decrease navigation performance. This behavior suggests that reinforcement learning-based autonomous systems develop more robust and general policies when restricted to implicit flow representations. The presented results offer insights for improving the transition of bio-inspired robotic navigation from simulation to real-world environments.
[LG-29] From Novice to Expert: Cost-Aware Bandits for Evolving Worker Performance in Crowdsensing
链接: https://arxiv.org/abs/2607.13546
作者: Yin Huang,Qingsong Liu,Jie Xu
类目: Machine Learning (cs.LG)
*备注: 14 pages, 10 figures, 3 tables, submitted for possible journal publication
Abstract:Mobile crowdsensing (MC) recruits mobile users to perform sensing tasks using their smartphones, enabling large-scale applications such as traffic monitoring and environmental sensing. A fundamental challenge is online worker recruitment under uncertainty, where the platform must learn workers’ sensing performance while operating with a limited budget. Existing learning-based MC recruitment methods typically assume that each worker’s sensing quality is stationary with a fixed mean over time. In practice, however, worker performance often improves with experience and eventually stabilizes, while the incurred sensing cost can be unknown in advance due to time-varying device and context states. In this paper, we study a budget-constrained online recruitment problem in which the platform selects one worker in each round, observes the sensing quality and incurred cost, where the expected sensing quality of each worker increases with experience and eventually converges to a plateau, and repeats until the budget is exhausted. We formulate this problem as a structured bandit model where each worker’s expected reward evolves according to an unknown increasing-then-converging function of its participation count, and each worker has an unknown expected cost. We develop a cost-aware online learning framework that jointly learns evolving reward trajectories and heterogeneous costs, detects performance saturation, and allocates the limited budget to maximize long-term sensing utility. We provide theoretical performance guarantees and validate the proposed approach through extensive experiments, demonstrating consistent improvements over baselines that ignore experience-driven dynamics or assume known costs.
[LG-30] Clustering algorithms for multivariate wind farm SCADA data filtering
链接: https://arxiv.org/abs/2607.13544
作者: Nicolò Italiano,Vasilis Pettas,Tuhfe Göçmen,Nicolaos A. Cutululis
类目: Machine Learning (cs.LG)
*备注:
Abstract:During wind farm operation, Supervisory Control and Data Acquisition (SCADA) systems record numerous anomalies, transients, and specific operational modes, leading to large datasets. However, for a wide range of applications, only measurements corresponding to normal operation are required and, therefore, the SCADA data must be filtered. For this purpose, several methods have been proposed to automate and replace manual filtering conducted by experts via visual inspection of the data. In this paper, we compare the filtering accuracy of multiple clustering algorithms against manual filtering, introducing evaluation metrics that are suitable for unlabeled data and robust across potential applications. Based on the results, we provide recommendations for generalizing model calibration to different datasets and discuss potential use cases for each model. The models are applied to the SCADA data of three turbines of an existing offshore wind farm, using 10-minute statistics across multiple data channels. In addition to the anomalies and operational modes typically recorded, the dataset presents a large number of non-evident outliers due to several field tests. Overall, the results highlight the importance of extending the analysis beyond the power curve, both in feature selection and in the design of evaluation metrics. In most cases, cluster-based methods are able to detect both evident and subtle outliers, achieving higher accuracy than manual filtering. However, the accuracy and the amount of data retained vary considerably depending on the model, and expert involvement remains necessary, though to a reduced extent compared to manual filtering.
[LG-31] When T2I Synthetic Data Backfires: Amplified Privacy Risks in Real-Synthetic Mix Training
链接: https://arxiv.org/abs/2607.13541
作者: Na Li,Boyu Kuang,Hongsheng Hu,Liquan Chen,Hyoungshick Kim,Yansong Gao,Anmin Fu
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:To overcome data scarcity and privacy constraints in data collection, it has become standard practice across academia and industry to augment real training data with text-to-image (T2I)-generated synthetic data, a paradigm we term Real-Synthetic Mix-Training (RSMT). While substituting synthetic data for sensitive real samples is widely regarded as a means to mitigate privacy exposure of the substituted data, the risk to the remaining real samples that actively participate in training has remained largely unexamined. This work reveals, for the first time, that RSMT can substantially amplify privacy leakage of these real training samples. We establish a theoretical framework, RSMT Memorization Amplification, proving that incorporating synthetic data displaces real samples toward peripheral regions of the mixed feature space, in turn forcing the model to memorize them more aggressively. Guided by this foundation, we propose RSMixLeak to systematically assess this risk through membership inference attacks (MIAs). RSMixLeak comprises two variants depending on the adversary’s capability. The non-adversarial variant audits a benign RSMT pipeline with an honest T2I provider, establishing a lower bound on the leakage induced by the intrinsic gap between real and T2I-generated data. The adversarial variant considers an adversary who controls the T2I model or contributes crafted data to the T2I provider, and deliberately enlarges this distributional gap on a target class via either high-level semantic attribute binding or imperceptible pixel-level coating, further amplifying leakage on real training data while improving downstream model utility. Motivated by these findings, we further propose a lightweight leakage propensity indicator computable from real data alone that reliably identifies high-risk datasets unsuitable for entering RSMT, as a self-assessable mitigation. Subjects: Cryptography and Security (cs.CR); Machine Learning (cs.LG) Cite as: arXiv:2607.13541 [cs.CR] (or arXiv:2607.13541v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13541 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-32] CDS: Counterfactual Directionality Score for Structured Interventions in Spatial Graphs
链接: https://arxiv.org/abs/2607.13508
作者: Humaira Anzum,Md Ishtyaq Mahmud,Jagan Mohan Reddy Dwarampudi,Tania Banerjee
类目: Machine Learning (cs.LG)
*备注: 15 pages, 4 figures
Abstract:Quantifying directional influence between node populations is a fundamental problem in graph-based modeling, particularly in spatial biological systems where cell-cell interactions shape functional outcomes. Existing approaches based on attention, attribution, or correlation capture associations but do not provide a principled framework for evaluating directional effects under controlled perturbations. We introduce a framework for structured counterfactual interventions in graph-based models to estimate directional influence between node types. Our approach trains a Neighbor Influence Model (NIM) to predict node states from local neighborhoods and applies constrained interventions that modify neighborhood composition while preserving key spatial and structural properties. We define the Counterfactual Directionality Score (CDS), which measures the change in predicted node state induced by targeted perturbations, and provide a theoretical interpretation of CDS as a finite-difference measure of local intervention sensitivity. To obtain valid uncertainty estimates, we introduce a core-level bootstrap procedure that accounts for dependencies within spatial samples. Experiments on synthetic spatial graphs with known directional structure show that CDS recovers directional influence, remains well calibrated under null conditions, and is robust to confounding signals, while preliminary results on spatial transcriptomics data reveal biologically plausible and consistent interactions across tissue cores.
[LG-33] Factorized Spectral Representations for Reinforcement Learning
链接: https://arxiv.org/abs/2607.13498
作者: Junyi Wu,Dan Li
类目: Machine Learning (cs.LG)
*备注:
Abstract:Learning a compact model of the world from interaction data is central to sample-efficient deep reinforcement learning. Spectral representation methods have become the leading paradigm for representation learning in continuous control by taking a matrix view of the transition kernel, with state-action pairs on one side and next states on the other, and learning a low-rank factorization through self-supervised contrastive objectives. We take this view one step further. The transition kernel is naturally a three-mode tensor over states, actions, and next states, and a CP decomposition gives one feature map per mode. We propose FaStR, which fits this decomposition with a noise contrastive objective, producing separate state, action, and next-state encoders that together form a single spectral representation. The factored form yields a smaller hypothesis class, and the sample size needed for representation learning shrinks by a factor that scales with the smaller of the state and action dimensions. Empirically, FaStR delivers its largest gains on high-dimensional locomotion tasks whose dynamics align with the factored structure, and the learned state encoder transfers intact across actuator shift while only the action encoder is retrained.
[LG-34] A VAE-Driven Multi-Task Satellite-Aided Semantic Communication Framework for 6G-Enabled Connected Autonomous Vehicles
链接: https://arxiv.org/abs/2607.13494
作者: S. M. Abtahiul Alam,Niloy Das,Apurba Adhikary,Yu Qiao,Zhu Han,Choong Seon Hong
类目: Machine Learning (cs.LG); Information Theory (cs.IT)
*备注:
Abstract:The development of smart transportation systems and the introduction of 6G wireless communication technologies have significantly changed vehicle network topologies. Future connected autonomous vehicle (CAV) networks require bandwidth-efficient, reliable, and low-latency communication for safety-critical applications such as traffic sign recognition and decision-making. Conventional communication systems transmit raw data regardless of task relevance, which is inefficient in resource-constrained satellite channels where uplink bandwidth is scarce and propagation losses are large. Semantic communication addresses this limitation by transmitting task-relevant information instead of full signal representations. It extracts and conveys essential semantic features and leverages deep learning to optimize task performance at the receiver. Therefore, we present a Variational Autoencoder (VAE)-based multi-task semantic communication framework for satellite-assisted autonomous driving. Unlike deterministic autoencoder-based methods, the proposed model uses probabilistic latent representations for more robust and efficient encoding. The learned features are transmitted over noisy wireless channels to perform traffic sign reconstruction and classification. The framework is trained end-to-end to jointly optimize both tasks. Results show that the proposed approach achieves significant bandwidth reduction of up to 87.23% to 98.17% while maintaining stable performance across varying signal-to-noise ratio conditions.
[LG-35] opology-Agnostic Mesh Reconstruction of Deformable Objects from Sparse Touch
链接: https://arxiv.org/abs/2607.13479
作者: Everest Yang
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注: Accepted to the RSS 2026 DAROMA Workshop
Abstract:Estimating the full shape of a deformable object is especially challenging when vision is unavailable: in the dark, inside an opaque bag, behind the manipulating hand, or under heavy self-occlusion. Touch is the natural sensor in these settings, but touches are sparse and local. We present a single topology-agnostic estimator that reconstructs the full mesh of a deformable object from only a few touches and no vision, using one permutation-invariant cross-attention architecture that handles a 1D rope, a 2D cloth, and a 3D volumetric soft body. The learned estimator reduces reconstruction error by roughly two-thirds relative to non-learned geometric mesh completion and a Gaussian-process surface baseline, and it outperforms a simpler global-pool set encoder, with the gap growing as more touches are observed. We then show that the estimator’s deep-ensemble uncertainty can be used to learn where to touch next, which lowers error further and beats both random touching and a Gaussian-process active baseline at sparse budgets. This gain is modest on average but grows with self-occlusion and on the error tail. When vision is also available, where to touch barely matters, motivating the vision-free setting we study.
[LG-36] Deformable State Estimation for Autonomous Surgical Tissue Retraction Under Partial Observability ICRA2026
链接: https://arxiv.org/abs/2607.13475
作者: Everest Yang,Skye Thompson,George D. Konidaris
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注: Accepted to the ICRA 2026 RASEI Workshop
Abstract:Surgical tissue retraction requires effective manipulation planning under partial and noisy perception. We study state estimation for deformable tissue retraction, where only sparse observations of the tissue surface are available at decision time. We propose a learned state estimator that reconstructs the full deformable mesh state from 40 noisy vertex observations. The estimator combines a multilayer perceptron with a low-dimensional PCA latent representation and is trained using geometry-aware regularization that encourages smooth and physically plausible deformations. We evaluate the approach in a 2D deformable sheet simulation using single-step and multi-step retraction planning. Results show that the learned estimator achieves 98.1% of oracle performance in multi-step retraction while supporting efficient inference. These results demonstrate that learned, geometry-regularized state estimation can support effective deformable manipulation under realistic perception constraints.
[LG-37] PQFA: Parallel Quantum Feature Augmentation of Fused Representations for Multimodal Classification
链接: https://arxiv.org/abs/2607.13466
作者: Mingzhu Wang,Yun Shang
类目: Machine Learning (cs.LG); Quantum Physics (quant-ph)
*备注:
Abstract:Most multimodal learning methods improve how heterogeneous representations are aligned and fused, while post-fusion enhancement remains less explored. We propose Parallel Quantum Feature Augmentation (PQFA), a hybrid quantum-classical framework that applies multiple shallow variational quantum circuits to fused multimodal features. Text and image representations extracted by frozen RoBERTa and ViT encoders are processed through bidirectional cross-attention, attentive pooling, and adaptive gated fusion. The fused feature is then amplitude-encoded into parallel quantum circuits, whose measurement readouts are concatenated with the classical representation for prediction. We evaluate PQFA on MM-IMDb and N24News through controlled comparisons using the same encoders, fusion backbone, data splits, projection dimension, and augmentation output width. PQFA consistently outperforms both the fusion backbone without quantum augmentation and a width-matched MLP augmentation baseline, while using approximately 2.2K augmentation parameters compared with 24.0K for the MLP branch. Missing-modality experiments further show improved robustness when textual or visual inputs are incomplete, with particularly clear gains when the more informative textual modality is severely degraded. Controlled ablations and feature-space analyses indicate that the improvement cannot be reproduced by random feature mappings, increased classical width, or untrained quantum transformations. Quantum-state diagnostics additionally show stable predictive performance across the tested simulated noise levels and distinct branch-specific transformations of the encoded states. These results establish PQFA as an effective and parameter-efficient strategy for post-fusion augmentation in hybrid quantum-classical multimodal learning.
[LG-38] Distributionally Robust and Safe Imitation Learning
链接: https://arxiv.org/abs/2607.13436
作者: Ahmed Aboudonia,Naira Hovakimyan
类目: Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注:
Abstract:Imitation learning (IL) has achieved remarkable success in complex decision-making tasks. However, its performance is highly sensitive to distribution shifts, which can pose significant safety risks. We propose a distributionally robust and safe IL framework that explicitly addresses both policy-induced and uncertainty-induced distribution shifts. Our approach develops a unified framework leveraging Taylor Series Imitation Learning (TaSIL) to mitigate policy-induced shifts and distributionally robust adaptive control to handle uncertainty-induced shifts. This architecture enables the formulation of an IL problem that optimizes performance under distributional uncertainty while systematically accounting for safety constraints. We demonstrate the effectiveness of the proposed approach on an unmanned aerial vehicle (UAV) case study where the UAV performs a task in an uncertain environment while avoiding unsafe regions.
[LG-39] Local Redundancy: An Information-Theoretic Measure of Plasticity from Synthetic Memorization ICML2026
链接: https://arxiv.org/abs/2607.13432
作者: Jiaxuan Cheng
类目: Machine Learning (cs.LG)
*备注: 13 pages, 7 figures. ICML 2026 (Spotlight)
Abstract:Plasticity – a neural network’s ability to adapt to new tasks – is critical for continual and transfer learning. Existing measures, such as effective rank, dead neuron fraction, and weight norm, lack theoretical grounding and correlate poorly with performance on new tasks. We introduce local redundancy, an information-theoretic measure derived from universal compression theory. We define local redundancy as the worst-case redundancy of a local model family – parameters in an infinitesimal neighborhood along gradient directions – and show this is a principled measure of plasticity. Although local redundancy is intractable to compute exactly, we prove that the expected squared gradient norm on a synthetic memorization task provides an efficiently computable lower bound. Experiments on continual image classification and time series transfer learning demonstrate that local redundancy predicts downstream performance better than existing measures and enables pretraining checkpoint selection where validation loss plateaus.
[LG-40] PUe: Biased Positive-Unlabeled Learning Enhancement by Causal Inference NEURIPS2023
链接: https://arxiv.org/abs/2607.13428
作者: Xutao Wang,Hanting Chen,Tianyu Guo,Yunhe Wang
类目: Machine Learning (cs.LG)
*备注: Extended arXiv version of the NeurIPS 2023 paper; includes additional discussion of related SAR-PU work
Abstract:Positive-Unlabeled (PU) learning aims to achieve high-accuracy binary classification with limited labeled positive examples and numerous unlabeled ones. Existing cost-sensitive-based methods often rely on strong assumptions that examples with an observed positive label were selected entirely at random. In fact, the uneven distribution of labels is prevalent in real-world PU problems, indicating that most actual positive and unlabeled data are subject to selection bias. Building on the SAR-PU propensity-weighted framework of Bekker et al., we study a PU learning enhancement (PUe) framework using normalized propensity scores and normalized inverse probability weighting (NIPW). PUe’s main contributions are a normalized inverse-probability-weighted PU risk formulation; additional theoretical analyses of normalized sample-weight error and common PU estimators under biased labeling; regularized deep propensity-score estimation; integration with modern cost-sensitive PU methods; and support for selectively labeled negative classes. Experiments on MNIST, CIFAR-10, and ADNI demonstrate improvements over several PU baselines under non-uniform label distributions.
[LG-41] mperature Scaling Is Not Enough: Calibration Gaps Under Human Label Distributions
链接: https://arxiv.org/abs/2607.13423
作者: Wisdom Dogah
类目: Machine Learning (cs.LG)
*备注: 9 pages. Code and per-seed results: this https URL
Abstract:Temperature scaling is the dominant post-hoc calibration method in modern deep learning. Its theoretical justification rests on an assumption that is rarely stated explicitly: that ground-truth labels are one-hot and deterministic. In practice, labels are frequently soft, crowd-sourced, or genuinely distributional, reflecting real disagreement among human annotators rather than annotation noise. We study whether temperature scaling retains its calibration properties when this assumption is violated, and whether any resulting degradation depends on model scale. Using CIFAR-10H and ChaosNLI, two publicly available datasets with human-annotated soft label distributions, we evaluate three model scales per modality under both hard one-hot and soft distributional label targets. Across all nine configurations we find a positive soft-label calibration gap: temperature scaling calibrated on hard labels consistently underperforms an oracle calibrated directly on soft labels, with Brier Score gaps ranging from 0.002 to 0.134. The gap grows monotonically with model scale in the vision domain and on the SNLI-derived split of ChaosNLI, and is substantially larger in the language domain (mean gap 0.079) than in vision (mean gap 0.003). A scale-ordering reversal on the MNLI-derived split remains after matched-domain training; we treat it as inconclusive for the scale hypothesis and attribute it primarily to near-chance accuracy on that split. As a second post-hoc baseline, multiclass isotonic regression yields the same qualitative conclusion: positive soft-label gaps in all nine configurations, and larger gaps in language than in vision. These findings suggest that calibration protocols built on majority-vote labels systematically misstate model reliability wherever label ambiguity is structural, with direct consequences for deployment in safety-critical settings.
[LG-42] OrDA: Orthogonal Disentanglement of Access Habits Framework for Homepage Marketing Block Recommendations
链接: https://arxiv.org/abs/2607.13420
作者: Lingxiao Zhang,Xiaobo Li,Tao Xu
类目: Machine Learning (cs.LG)
*备注:
Abstract:Clicks on homepage marketing blocks are driven by a dual-mechanism of content interest and access habits. However, habitual clicks often create Pseudo-Positives in marketing slots, where position advantage masks mediocre content quality, leading to biased recommendation ecosystems. We propose a framework called Orthogonal Disentanglement of Access habits (OrDA) to purify interest signals. OrDA utilizes a dual-tower structure with a gated allocation layer to adaptively route features and minimize interference. To ensure rigorous separation, we employ orthogonal regularization to constrain the latent interest and habit manifolds to be geometrically perpendicular. OrDA performs causal intervention (do-calculus) during inference to rank items solely by purified interest scores. Empirical online evaluations on large-scale datasets demonstrate that OrDA effectively eliminates access-habit bias, outperforming state-of-the-art methods in predictive accuracy. Online AB test 5.64% shows user click-through rates (UCTR) improvement on the Zhima homepage marketing block, Zhima rent-floor recommendation.
[LG-43] EXPLORE: Exploration with Guided Search for Analog Topology Generation using Language Models
链接: https://arxiv.org/abs/2607.13416
作者: Guanglei Zhou,Chen-Chia Chang,Yikang Shen,Jonathan Ku,Isaac Jacobson,Jingyu Pan,Yiran Chen,Xin Zhang
类目: Machine Learning (cs.LG)
*备注: MLCAD 26’ accepted
Abstract:Automating analog circuit topology design is essential to reduce the extensive manual effort required to meet increasingly diverse and customized application demands. Recent advances have applied sequence-to-sequence fine-tuning on pretrained language models to directly generate circuit topologies from user specifications in a single pass. However, these one-shot generation methods failed to generate complex circuits due to their exponentially growing search spaces and limited training datasets. In this paper, we present EXPLORE, a search-enhanced framework that integrates simulator-guided Monte Carlo Tree Search (MCTS) with transformer-based decoding to enable test-time scaling for analog topology generation. By leveraging language-model priors and bypassing high-confidence structural tokens, EXPLORE allocates expensive simulator budget primarily toward topology-altering decisions during search. On a 6-component benchmark at a tight tolerance of 0.01, EXPLORE raises the success rate from 12% for one-shot generation and 33% for a sampling-and-filter baseline to 65%, and lowers MSE by over 20% relative to sampling-and-filter under the same search budget. These results establish EXPLORE as the first framework to integrate structured test-time search with LM decoding for analog topology generation, and a practical step toward scaling LLM-driven design automation.
[LG-44] Evaluating Frontier AI Agents as Autonomous Clinical Security Auditors
链接: https://arxiv.org/abs/2607.13411
作者: Michael O. Eniolade
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注: 29 pages, 2 figures, 7 tables
Abstract:Clinical AI models can expose patients to harm when adversarial vulnerabilities go undetected, yet formal security auditing requires statistical expertise, specialized tools, and significant time. We present an open evaluation task, built on METR Task Standard v0.3.0, that tests whether frontier AI agents can autonomously implement a structured clinical AI security audit. Given a pre-trained clinical prediction model, a patient dataset, and written instructions, each agent must implement four attacks from pseudocode, compute a Security Posture Score covering FGSM robustness, membership inference resistance, expected calibration error, and boundary attack resistance, and write a structured JSON report in a Docker container using only a bash interface and no scaffolding code. Six variants span the Wisconsin Diagnostic Breast Cancer and MIMIC-IV ICU mortality datasets across three model architectures with increasing defense strength, with reference scores from 55.60 to 90.41. We ran 54 evaluations across three frontier models, with three runs per variant. Claude Sonnet 4.6 and GPT-4.1 completed all 18 runs and received perfect evaluator scores. GPT-4o completed 61 percent of runs and used about five times the per-run token count of Claude, although provider tokenization differs. Total API costs were 8 US dollars for GPT-4.1, 12 US dollars for Claude Sonnet 4.6, and 27 US dollars for GPT-4o. GPT-4o failures involved premature session termination, an aggregation error, and an empty submission file. The task, scoring infrastructure, and Wisconsin Breast Cancer assets are publicly released; MIMIC-IV variants require separate PhysioNet access.
[LG-45] Self-Improving is Often Sudden: Enlightenment-style Finetuning for Large-Scale Models
链接: https://arxiv.org/abs/2607.13395
作者: Jing-Xiao Liao,Tianwei Zhang,Yu-Hao Jiang,Feifei Zhang,Hang-Cheng Dong,Feng-Lei Fan
类目: Machine Learning (cs.LG)
*备注:
Abstract:The pursuit of autonomously self-improving models has attracted growing interest in the era of large-scale foundation models. Drawing inspiration from the concept of “enlightenment” or “aha moment” in human brain, we hypothesize that large models exhibit an analogous enlightenment phenomenon-a latent capacity for sudden capability boost. Then, we propose Enlightenment, a novel training-free post-tuning paradigm for large-scale models. Our approach modifies shortcuts for key modules/layers without weight updates, while existing training-free ones predominantly manipulate attention weights. We introduce two architecture-specific instantiations: i) For large language models, we propose attention head-mixing shortcuts that recalibrate attention weights by linking the initial attention head’s output to all other target heads, modulated by an adaptive scaling factor initialization strategy. ii) For vision-language models, we apply a lightweight scalar-modulated factor to residual connections in the decoder layers, regulating information flow. Extensive experiments show that Enlightenment efficiently unlocks the latent potential of pre-trained networks, yielding remarkable performance improvements across diverse benchmarks and models.
[LG-46] Weight Feedback Computes the Jacobian Transpose Locally in Modern Deep Networks
链接: https://arxiv.org/abs/2607.13380
作者: Junlong Shen,Xingyu Li
类目: Machine Learning (cs.LG)
*备注:
Abstract:Predictive Coding (PC) offers a biologically motivated alternative to backpropagation via local weight updates, yet routing error between layers still relies on an autograd Jacobian-transpose ( J^\top ) product - the last non-local operation in PC. We show that this dependency is largely avoidable. For any layer f(x)=\mathrmAct(\mathrmNorm(L(x))) with frozen normalization statistics, the exact J^\top factors into three locally available terms, J^\top v = L^\top(s \odot \sigma’(z) \odot v) , where \sigma’ is the activation derivative, z is the pre-activation, and s=\gamma/\sigma_\mathrmrun is the normalization gain. Prior weight-feedback methods omitted both corrections; restoring them closes the transport gap for this layer class. Locality here holds up to three assumptions, which we state upfront: weight symmetry ( L^\top mirrors the forward operator, as assumed by all PC), a soft spectral-norm control that is not synapse-local, and a nearest-neighbour approximation for MaxPool. Substituting the identity into PC yields WF-Act-PC, which removes the autograd backward pass from error transport. On CIFAR-10/100 (50 epochs, 5 seeds), WF-Act-PC is the only PC method whose accuracy improves with depth, surpassing iPC - the strongest classical PC baseline - by 2.7-22.3 pp on CIFAR-10. With both methods tuned per architecture, it matches or exceeds a comparably-tuned backpropagation baseline on the deeper CIFAR-10 architectures (VGG-9: 93.57% vs. 92.43%; ResNet-18: 92.76% vs. 91.54%) and on the harder Tiny-ImageNet benchmark, while trailing tuned BP on the deeper CIFAR-100 VGG cells. Our WF-Act-PC implementation is publicly available at this https URL
[LG-47] Agora: Collective and Permissionless Internet-Scale Pretraining of Large Language Models
链接: https://arxiv.org/abs/2607.13332
作者: Gil Avraham,Violetta Shevchenko,Hadi Mohaghegh Dolatabadi,Karol Pajak,James Snewin,Harry Xi,Rodney O’Donnell,Thalaiyasingam Ajanthan,Sameera Ramasinghe,Chamin Hewa Koneputugodage,Shamane Siriwardhana,Alexander Long
类目: Machine Learning (cs.LG); Distributed, Parallel, and Cluster Computing (cs.DC)
*备注:
Abstract:Training large language models at the multi-billion to trillion parameter scale is confined to datacenters, where data-parallel (DP) and model-parallel (MP) techniques presume homogeneous accelerators, high-speed interconnects, and a single orchestrating entity. Frontier model development is thereby concentrated among the few groups able to assemble such clusters. Meanwhile, an enormous pool of compute remains unusable for training: consumer and professional GPUs that are heterogeneous, preemptible, individually owned, and connected only by the internet. We present Agora, a system that makes efficient use of this compute. Agora combines bandwidth-efficient pipeline-parallel model sharding over internet-grade links with multi-party, fault-tolerant collective operations. Each participant holds only one stage of the model, and no single party ever possesses the full weights. We term this setup Protocol Learning: it enables collectively trained, collectively owned models, opening a path to open-source frontier training with economic sustainability. This report presents the outcome of a research effort spanning communication-efficient parallelism, asynchronous optimization, and fault-tolerant systems design. It culminates in the first demonstration of its kind: Pluralis-8B, an open, permissionless pretraining run of an 8.6B-parameter model on 500B tokens of FineWeb-Edu. The model was trained over 40 days by 330 contributor nodes, predominantly consumer GPUs on internet connections, joining and leaving throughout. The run sustained ~170k tokens/s and 4.2 tokens per TFLOP of pooled compute, 63% of the efficiency of a centralized H100 baseline, and converged to within a small margin of a centralized reference run.
[LG-48] Accuracy-Preserving Stability Regularization for Large-Scale Retail Demand Forecasting
链接: https://arxiv.org/abs/2607.13331
作者: Jize Li,Jiani He,Dishu Yang,Dingyan Shang,Jingjing Liu,Shiqi Huang
类目: Machine Learning (cs.LG)
*备注: 9 pages, 5 figures, accepted for presentation at ICEME 2026
Abstract:Retail demand forecasts are reused across replenishment, capacity, labor, and transportation planning cycles. Point-error objectives do not constrain abrupt movement between adjacent forecasts, while post-hoc smoothing acts only after model fitting. We ask whether a training-time penalty on consecutive within-series movement can improve horizontal forecast-path stability without materially changing point accuracy. The penalty is evaluated in a temporal-structured pipeline combining recent-demand embeddings with calendar, price, hierarchy, item, and store features. On selected M5 demand series at 1000, 3000, and 4000-series scales, the stability-aware hybrid model improves Forecast Stability Score over XGBoost by 6.91%, 6.66%, and 7.68%, respectively, while RMSE changes remain within 0.72% across three random seeds. Post-hoc exponential smoothing attains lower raw movement but incurs a larger RMSE cost; training-time regularization preserves more point accuracy and performs favorably under normalized stability. These findings extend forecast evaluation from point-error minimization toward an accuracy-stability trade-off perspective for operational retail forecasting.
[LG-49] Graph Partitioning with Demands: Generalized Conductance and its Applications
链接: https://arxiv.org/abs/2607.13218
作者: Michał Szyfelbein,Dariusz Dereniowski
类目: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)
*备注: 24 pages
Abstract:In this work, we study various graph partitioning problems under a general demand model. In each such task, we are given a graph G=(V,E,c,w) with a capacity function c\colon E\to \mathbbN and a demand function w\colon V\times V\to \mathbbN . Our main focus is the problem of finding a cut (S, \barS) minimizing the quantity [ \psi_w( S ) = \fracc( S, \barS )w( S, V )\cdot w( \barS, V ). ] Here, c( S, \barS ) is the cost of edges between S and the complement of S , \barS , and w( S, V )=w( S )+w( S, \barS ) is the sum of the internal demand within S , w( S ) , and the demand between vertices of S and \barS , w( S, \barS ) . We call \psi_w( S ) the \emphgeneralized conductance of the cut (S, \barS) , and the task of minimizing \psi_w( S ) the Generalized Conductance Problem. Our main contribution is an algorithm with an \mathcalO(\log n) -approximation guarantee for this objective. Our result is achieved via a two-way reduction: first to the well-known Generalized k -Multicut Problem, and then to a constrained variant of the classic Sparsest-Cut Problem, with an additional upper-bound constraint on the amount of demand that may be cut. Moreover, we show that the above procedure can be used to obtain an \mathcalO(\log n) -bicriteria approximation for Graph Partitioning with Demands, where the goal is to find a minimum-cost subset of edges C such that for every component H of G\setminus C , w( H )\leq \rho\cdot w( V ) . This, in turn, yields an \mathcalO(\log n) -approximation for Hierarchical Clustering with Demands, the problem of finding a hierarchy of cuts that partitions the graph into increasingly refined clusters. For multiplicative demand functions, we improve these guarantees to \mathcalO(\sqrt\log n) and for trees we get an \mathcalO(1) -approximation for all of our objectives. Comments: 24 pages Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG) Cite as: arXiv:2607.13218 [cs.DS] (or arXiv:2607.13218v1 [cs.DS] for this version) https://doi.org/10.48550/arXiv.2607.13218 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Michał Szyfelbein [view email] [v1] Tue, 14 Jul 2026 19:27:53 UTC (36 KB) Full-text links: Access Paper: View a PDF of the paper titled Graph Partitioning with Demands: Generalized Conductance and its Applications, by Micha\l Szyfelbein and 1 other authorsView PDFTeX Source view license Current browse context: cs.DS prev | next new | recent | 2026-07 Change to browse by: cs cs.LG References Citations NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading… BibTeX formatted citation loading… Data provided by: Bookmark checked="checked"class=“labs-tab-input”> Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv’s community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?) mathjaxToggle(); We gratefully acknowledge support from our major funders, member institutions, , and all contributors. About Help Contact Subscribe Copyright Privacy Accessibility Operational Status (opens in new tab) Major funding support from
[LG-50] Hierarchical mathcalF-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs
链接: https://arxiv.org/abs/2607.13217
作者: Michał Szyfelbein,Dariusz Dereniowski
类目: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)
*备注: 34 pages
Abstract:Consider the following variation on the Hierarchical Clustering problem: Usually, while building a hierarchical clustering, one recursively partitions the data until each cluster becomes a singleton. We relax the halting condition of the recursive process to stop whenever the remaining cluster is a graph belonging to a class \mathcalF . We call this problem Hierarchical \mathcalF -Clustering and we measure the quality of any solution using adapted Dasgupta’s clustering objective. We study two natural choices of \mathcalF : trees and graphs of bounded diameter. We present the first polynomial time \mathcalO(\log n\cdot\log\log n) and \mathcalO(\log n) -approximation algorithms for clustering into trees and bounded diameter graphs respectively. Our main technical contribution is a framework for approximating such problems based on linear programming. In fact, we characterize graphs classes \mathcalF for which our approach can be applied and show that it includes both trees and bounded diameter graphs. However, our ideas are not limited to them and might be useful for other structures as well. Broadly speaking, our framework applies whenever the corresponding flat clustering problem, which we call p_\mathcalF -Partitioning, admits a natural ILP formulation together with a rounding procedure with provable approximation guarantees. Intuitively, given a set of vertices called terminals, the problem is to find an edge set whose removal results in satisfying certain vertex-dependent structural predicate for each terminal. We then use these ingredients to build clustering trees with the aforementioned approximation guarantees. To complement these results, we show that both Hierarchical Clustering into trees and into bounded diameter graphs cannot be approximated within any constant factor under the Small Set Expansion Hypothesis. Comments: 34 pages Subjects: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG) Cite as: arXiv:2607.13217 [cs.DS] (or arXiv:2607.13217v1 [cs.DS] for this version) https://doi.org/10.48550/arXiv.2607.13217 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-51] BARS: Benign-Anchored Ranking and Selection for False Alarm Reduction in Network Intrusion Detection
链接: https://arxiv.org/abs/2607.13203
作者: Abu Fuad Ahmad,Istiaque Ahmed
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:False alarms remain a major barrier to deploying network intrusion detection systems (NIDS). In high-volume environments, even a sub-1% false positive rate can generate tens of thousands of daily alerts. Filter-based feature selection is attractive because it operates upstream of the classifier and adds no inference-time cost. However, classical filters use class-symmetric criteria that ignore the asymmetry of intrusion detection, where benign traffic defines the baseline and attacks are deviations from it. A recent class-asymmetric filter, Classwise Mean Deviation (CMD), addresses this issue but anchors its score to a global mean that shifts toward attack distributions under class imbalance, weakening the deviations it aims to capture. We propose Benign-Anchored Ranking and Selection (BARS), a two-stage filter that replaces CMD’s global anchor with the benign-class mean and applies an order-preserving decorrelation step. We evaluate BARS on CICIDS2017, CICDDoS2019, and UNSW-NB15 using feature budgets k = 5, 10, 20, 30, 40. On attack-majority datasets, where global-anchor bias is strongest, BARS reduces false positive rate relative to CMD by 15.4% on UNSW-NB15 at k = 20 and by 21% to 23% on CICDDoS2019 at small feature budgets while preserving true positive rate and macro-F1. On benign-majority data, BARS and CMD converge, consistent with the theoretical limit where global- and benign-anchored scores coincide. BARS is a principled refinement of CMD rather than a universally dominant filter. Although Pearson Correlation and Mutual Information often achieve lower false positive rates, they exceeded 1 TB of memory on the largest benchmarks in our evaluation. BARS retains linear-time scoring and a low memory footprint, making it suitable for resource-constrained deployments. Subjects: Cryptography and Security (cs.CR); Machine Learning (cs.LG) Cite as: arXiv:2607.13203 [cs.CR] (or arXiv:2607.13203v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2607.13203 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-52] Concurrent Image Understanding and Generation: Self-Correcting Coupled Markov Jump Processes
链接: https://arxiv.org/abs/2607.13188
作者: Minh-Quan Le,Armand Comas,Alexandros Lattas,Stylianos Moschoglou,Pedro Vélez,Amit Raj,Aaron Germuth,Thabo Beeler,Dimitris Samaras,Di Qiu
类目: Machine Learning (cs.LG)
*备注: Project page: this https URL
Abstract:Human cognition does not separate understanding and generation. A teacher at a whiteboard speaks and draws \textittogether , each modality reshapes the other. In this paper, we bring this coupled loop to artificial systems. Masked Diffusion Models (MDMs) are ideally suited to this task, yet existing samplers either decode text and image interleavedly or independently update them in parallel branches that share only previous-step history, but not the other modality’s latest decisions \textitwithin the same step; combined with MDMs’ inability to remask, cross-modal contradictions are neither detected nor repaired. We introduce \textbfSelf-Correcting Coupled Markov Jump Processes (SC-CMJP) , a framework in which one modality’s transition rates are functionals of the other modality’s confidence score, as weighted by cross-modal attention. Furthermore, a remasking jump retracts commitments the moment cross-modal evidence turns against them. In conjunction with SC-CMJP, we introduce \textttCO_\texttt2\textttJump (Self- \underline\textCO rrecting \underline\textCO upled \underline\textJump ), a novel training-free single-pass sampler for joint multimodal geneneration. For training and evaluation purposes, we have created and will release three large-scale joint multimodal generation corpora: \textJEdit-1M , \textJMaze-200K , \textJNono-200K , with matching in- and out-of-distribution benchmarks. \textttCO_\texttt2\textttJump achieves best joint performance for image understanding and editing as well as visual reasoning (maze and nonogram solving). The performance of the sampler scales monotonically with the number of denoising steps, evidence that the benefits of cross-modal coupling \textitcompound across the trajectory. Project page: this https URL
[LG-53] HEDGEHOG: Hierarchical Evaluation of Drug Generators Through Rigorous Filtration
链接: https://arxiv.org/abs/2607.13155
作者: Daria A. Ryabchenko(1,2),Pavel Gurevich(1,2),Shamil Kadyrov(1),Daria Frolova(1,2),Kseniia Fedisheva(1),Sergei A. Nikolenko(1),Alexander Shapeev(1,2),Marina A. Pak(1) ((1) Ligand Pro, Moscow, Russia, (2) Skolkovo Institute of Science and Technology, Artificial Intelligence Center, Moscow, Russia)
类目: Machine Learning (cs.LG); Software Engineering (cs.SE)
*备注: 29 pages (including References and Appendix sections), 8 tables, 7 figures, 2 supplementary files
Abstract:Generative molecular models can support early drug discovery by proposing new candidate compounds de novo. In practice, useful candidates must balance target-relevant activity, synthetic accessibility, physicochemical properties, and other multiparameter design constraints. However, metrics commonly used to evaluate molecular generators only weakly reflect whether the generated compounds are medicinally plausible and suitable for downstream computation. This can produce false positives in model evaluation, incorrect assumptions, and inefficient use of computational resources. We introduce HEDGEHOG, a unified six-stage filtration benchmark that is inspired by industrial hit identification workflows: (i) preprocessing; (ii) physicochemical descriptor screening; (iii) structural alerts and graph-sanity checks; (iv) synthesis feasibility; (v) docking and binding affinity estimation; and (vi) three-dimensional pose and interaction checks. We evaluate 23 molecular generators across three model classes under a standardized protocol. Across 230,000 generated molecules, only 0.65% of initial molecules survive all stages. Our results expose a central limitation of current molecular generators: molecules that appear acceptable under isolated criteria rarely satisfy medicinal chemistry, synthesis, docking, and 3D pose filters simultaneously.
[LG-54] Mixed-Timescale Differential Coding for Downlink Model Broadcast in Wireless Federated Learning
链接: https://arxiv.org/abs/2607.13119
作者: Chung-Hsuan Hu,Zheng Chen,Erik G. Larsson
类目: Information Theory (cs.IT); Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注: IEEE Transactions on Communications
Abstract:In standard federated learning systems, the parameter server broadcasts the global model to the participating devices in every iteration. Motivated by the temporal correlation between consecutive global models, differential coding can be applied to global model dissemination to reduce the information magnitude, thereby enabling communication with fewer quantization bits. However, due to wireless link failures, devices may occasionally miss differential updates and consequently fail to reconstruct the global model. As a result, they either continue local training based on an outdated model or remain idle until the next full-model broadcast becomes available. To address this challenge, we propose a mixed-timescale differential coding (MTDC) scheme that performs differential coding at two different levels by adjusting the reference model. With MTDC, a device can reconstruct the latest global model between two full-model broadcasts even if it misses a differential update. We provide a convergence analysis that motivates the design of an age-aware variant of MTDC, along with a device scheduling policy to further improve communication efficiency. Simulation results demonstrate that the proposed MTDC schemes achieve superior learning performance compared to baseline methods under similar communication resource budgets in the presence of downlink transmission failures.
[LG-55] Securing LLM s in the Wild: Privacy and Security Challenges at the Edge
链接: https://arxiv.org/abs/2607.13088
作者: Ren-Yi Huang,Mingchen Li,Dumindu Samaraweera,Morris Chang
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:Large Language Models (LLMs) are rapidly moving from research settings into the wild, deployed on enterprise infrastructure, personal devices, and edge platforms. While cloud deployments offer scalable compute, concerns over data sovereignty, compliance, latency, and third-party dependence are driving organizations toward edge and on-premise LLMs. This shift introduces new security and privacy challenges: limited compute and memory force aggressive optimizations, including quantization, pruning, model partitioning, and parameter-efficient adaptation, each of which can introduce vulnerabilities and reshape the threat landscape. We describe this tension as the Security-Efficiency Paradox, mechanisms that improve efficiency may weaken robustness, expose new attack surfaces, or increase privacy risks. We examine how compression can degrade safety alignment, how partitioned inference enables reconstruction attacks, and how continuous local adaptation may cause privacy leakage and model drift. To analyze these risks, we introduce a deployment-centric taxonomy organized around three architectural constraints: the Memory Wall, the Quadratic Wall, and the Compute Wall. We derive a unified constraint model that quantifies when unsafe optimizations become unavoidable, linking each wall to specific attack surfaces. Building on this model, we propose the Secure Operational Efficiency Score (SOES), a holistic metric balancing task accuracy, jailbreak resistance, and privacy against energy, memory, and latency, enabling practitioners to configure edge LLMs under real-world hardware limits. We further present a practical decision procedure and targeted mitigations for each optimization-induced vulnerability. Together, these contributions provide a co-designed framework for jointly evaluating security, privacy, and efficiency, laying a foundation for securing edge-native intelligent systems.
[LG-56] HRIBench: Benchmarking Interaction-Centric Human-Robot Collaboration
链接: https://arxiv.org/abs/2607.13056
作者: Chang Liu,Jiawei Zhang,Tao Zhang,Ye Wang,Hongyu Zhou,Qin Jin
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注:
Abstract:Current vision-language-action (VLA) benchmarks primarily evaluate isolated manipulation skills while leaving human-robot interaction structure largely unmodeled. However, real-world collaboration fundamentally requires coordination under shared agency, including intent understanding, temporal synchronization, protocol adherence, and safe interaction in dynamic environments. To address this gap, we introduce HRIBench, a diagnostic benchmark for intent-aware human-robot collaboration based on executable interaction scenarios. HRIBench represents collaborative tasks as structured scenario scripts that explicitly model agent roles, temporal dependencies, coordination constraints, and human behavior distributions. Building on this abstraction, HRIBench defines three representative interaction roles: Instructor, Collaborator, and Intruder, covering intent communication, joint coordination, and robustness under human intervention. The benchmark contains 13 role-conditioned tasks with over 650 evaluation episodes generated from diverse interaction trajectories and scene variations. Beyond binary task success, HRIBench introduces interpretable interaction-centric metrics spanning synchronization, responsiveness, protocol compliance, and safety. We evaluate adapted policies based on GR00T, pi0.5, and ACT under a unified protocol. Results show that current foundation robot policies struggle substantially in collaborative settings despite strong manipulation ability, revealing major limitations in temporal coordination and intent-aware behavior. Fine-tuning on HRIBench consistently improves collaborative performance. In a real-world adaptation study, simulation data generated by HRIBench improves GR00T N1.5’s physical-task success rate from 0.10 to 0.43, demonstrating the benchmark’s value for advancing interaction-centric robot learning.
[LG-57] Precomputing the Future-Offset Averag e in TriAttention
链接: https://arxiv.org/abs/2607.13051
作者: Amarnath Mukherjee(Hozhoke, Inc.)
类目: Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)
*备注: 8 pages, 2 figures
Abstract:TriAttention is a recent method for shrinking the KV cache of long-reasoning LLMs: it scores each cached key by how much attention it is likely to receive and evicts the lowest-scoring ones. Because a key does not know how far away its future queries will sit, the score is averaged over a ladder of 17 possible future distances. We point out that this average is free: the future distance enters the score only through the position-dependent rotation, so the whole 17-fold average collapses–exactly, by a one-line algebraic identity–into a single per-band weight that is computed once, offline. Scoring a key then costs one evaluation instead of seventeen, with no change to which keys get pruned. The saving is modest and lives entirely in TriAttention’s pruning-score computation, not in the attention kernel; we present it as a small, exact complement to their method, and we confirm the identity numerically.
[LG-58] argeted Recovery of Weight-Space Mechanisms From Neural Networks ICML2026
链接: https://arxiv.org/abs/2607.13047
作者: Antoine Vigouroux,Lee Sharkey
类目: Machine Learning (cs.LG)
*备注: Accepted at the Mechanistic Interpretability Workshop, ICML 2026
Abstract:Parameter decomposition (PD) decomposes neural networks into interpretable computational components that faithfully reflect the original network’s operations. However, scaling PD to large models requires vast compute, making it a costly and risky endeavor. Here we propose targeted PD (tPD), which identifies only the components that process specific inputs of interest – from isolated prompts to large subtasks – by introducing a high-rank catch-all component that handles all non-target data. We validate tPD on toy models and on transformer language models trained on The Pile, where it recovers reproducible, mechanistically faithful circuits. We extract a CSS-only submodel of a 4-block transformer using 7% of the FLOPs of its published decomposition, and in a 12-block transformer we surgically ablate and rewire memorized sequences, with negligible side effects on other inputs.
[LG-59] What Your Model Threw Away and Why Youll Want It Back: Masking Fingerprinting and Privacy from Discarded Geometry
链接: https://arxiv.org/abs/2607.13046
作者: Zachary P. Bradshaw
类目: Machine Learning (cs.LG); Cryptography and Security (cs.CR); Representation Theory (math.RT); Machine Learning (stat.ML)
*备注: 22 pages, 10 figures
Abstract:We develop a framework for the information discarded by machine learning models whose inputs carry a Lie group action. Given a representation \pi of a Lie group G on a space V and a learned function f\colon V \to \mathbbR , we define two objects measuring the symmetry invisible to f . The null fiber at a point x \in V is the set N_G(f,x) = \g \in G : f(\pi(g^-1) \cdot x) = f(x)\ of group elements whose inverse action on x is undetectable by f . When N_G(f,x) is independent of x , it coincides with the stabilizer \mathrmStab_G(f) , the largest subgroup of G under which f is invariant. For smooth maps to \mathbbR , the preimage theorem guarantees that null fibers have dimension at least \dim G - 1 at generic inputs, regardless of architecture. For compact groups acting on themselves, the Peter–Weyl theorem yields a spectral characterization of both objects in terms of the Fourier coefficient matrices of f . We show that null fiber elements can be computed efficiently via Newton iteration on the orbit map, at a cost comparable to a few gradient evaluations. Applications to data masking, model fingerprinting, and privacy-preserving computation are developed and tested experimentally on molecular property prediction under \mathrmSO(3) and spherical image classification under the Möbius group \mathrmPSL(2, \mathbbC) . The framework applies uniformly to classical neural networks and variational quantum circuits.
[LG-60] Automatic Differentiation from Scratch: How PyTorch Computes Gradients in Physics-Informed Neural Networks
链接: https://arxiv.org/abs/2607.13042
作者: Abdeladhim Tahimi
类目: Machine Learning (cs.LG); Mathematical Software (cs.MS); Numerical Analysis (math.NA)
*备注: 25 pages, 9 figures. Educational tutorial on automatic differentiation for Physics-Informed Neural Networks (PINNs) using PyTorch. Includes complete numerical derivations and computational graph analysis
Abstract:This paper traces, with explicit numerical values, how PyTorch’s automatic differentiation (AD) engine computes gradients for Physics-Informed Neural Network (PINN) training – a setting that requires two levels of differentiation: computing the physics derivative \haty’(t)=d\haty/dt through the network, and computing parameter gradients \nabla_\theta L of a loss that itself depends on \haty’(t) . Using a 1-3-3-1 multilayer perceptron and the initial value problem y’(t)+y(t)=0 , y(0)=1 , we trace the complete pipeline at every node: the computational graph built during the forward pass, the reverse-mode backward traversal that computes all 22 parameter gradients in a single pass, and the graph-on-graph mechanism by which \textttcreate_graph=True enables correct differentiation through the physics-informed residual. Every adjoint value is verified against the hand derivations of Tahimi (2026), connecting the P/Q sensitivity framework to the vector–Jacobian products used by PyTorch’s autograd engine.
[LG-61] Screening of Biosecurity Features in Metagenomic Data with Evo 2 Probes
链接: https://arxiv.org/abs/2607.14070
作者: Jeremy Guntoro,Alexander Dack,Dylan Danno,Michaela Jančovičová,Križan Jurinović,Vanessa Smilansky
类目: Genomics (q-bio.GN); Machine Learning (cs.LG)
*备注:
Abstract:Genomic foundation models such as Evo 2 learn rich sequence representations, but their value for biosecurity screening is largely unexplored. We ask how much biosecurity-relevant signal is linearly accessible in these representations by training minimal linear and attention probes on frozen Evo 2 layer-26 activations, without fine-tuning the underlying model. Across held-out metagenomic test sets, the probes detect antimicrobial resistance (AMR) with strong discrimination: a linear probe reaches a region-level ROC-AUC of 0.888 (mean-pool), rising to 0.977 with a single-head attention probe. The probes resolve finer-grained AMR drug-class subcategories and separate them from unrelated functional genes, providing additional evidence that the learned signal is not explained solely by generic functional-gene status. Bacterial virulence is also decodable, though more weakly (region-level ROC-AUC 0.833). The AMR probe retains comparable ranking performance on simulated short reads without retraining, enabling evaluation before assembly in settings where assembly is computationally costly or unreliable. It achieves a read-level ROC-AUC of 0.898 (mean-pool), comparable to the mean-pooled full-region result. Within SynGenome, AMR-associated prompt labels are only weakly recoverable from Evo 1.5-generated sequences; these prompt-derived labels do not establish the function of the generated response sequences. A complementary sparse-autoencoder analysis recovers interpretable resistance-associated features but proves less consistent than the supervised probes. Together, these results position lightweight embedding-based probes as a fast, inexpensive first-pass detection layer for metagenomic biosurveillance and map both strengths and current limits of the approach. This work was conducted as part of the AIxBio Hackathon 2026 hosted by BlueDot Impact, Apart Research, and Cambridge Biosecurity Hub.
[LG-62] Multimodal Empirical Bayes Variational Autoencoders for Joint Longitudinal and Time-to-Event Modeling
链接: https://arxiv.org/abs/2607.13984
作者: Anders Sjöberg,Nils Olsson,Marcus Baaz,Mats Jirstrand
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Longitudinal tumor measurements, dropout information, and genetic covariates provide complementary information about treatment response, but integrating these data sources within a single population modeling framework remains challenging. We extend the empirical Bayes variational autoencoder (EB-VAE) framework to joint longitudinal and time-to-event modeling and evaluate it on tumor growth data. The framework represents inter-individual variability using latent individual effects regularized by a covariate-conditioned empirical Bayes prior, while a decoder maps these latent effects to tumor-volume trajectories. To account for informative dropout, the decoder was augmented with a hazard model, yielding joint predictions of tumor growth and time to dropout. We further compared fully neural and hybrid semi-mechanistic decoder formulations and incorporated genomic covariates through a genetics-conditioned prior adaptation. The hybrid decoder recovered treatment-effect parameters broadly consistent with previously reported nonlinear mixed-effects estimates, while achieving prior predictive performance comparable to the neural decoder. The joint model reproduced both tumor-volume distributions and dropout patterns in held-out individuals, and genetic conditioning improved individual-level prior predictions in both cutaneous melanoma and breast cancer experiments. Stability selection identified several biologically plausible genetic indicators, including alterations in BRAF, NRAS, NF1, and MDM2. These results demonstrate that EB-VAE provides a flexible probabilistic framework for combining neural dynamics, mechanistic structure, time-to-event modeling, and high-dimensional covariates in pharmacometric applications.
[LG-63] Quantum Topological Data Encoding
链接: https://arxiv.org/abs/2607.13847
作者: Adam Wesołowski,Dimitrios Thanos,Daniel Leykam,Lirandë Pira
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG)
*备注:
Abstract:Many datasets encountered across a wide range of domains possess rich geometric and topological structure that is difficult to capture using conventional vector-based representations. Quantum machine learning offers the possibility of processing high-dimensional data in Hilbert spaces, but its practical success depends critically on how classical data is encoded into quantum states. We introduce \emphquantum topological data encoding (QTDE), a general framework for encoding topological information into quantum states via topology-driven quantum evolution. Our method generalises an existing topology-driven quantum encoding framework to higher-dimensional data. We test the proposed method on clique-complexes classification tasks, and provide preliminary evidence that topology-driven quantum representations can capture discriminative information beyond that available through direct comparisons of classical topological descriptors. The proposed quantum representations consistently outperform a baseline based on direct comparisons of the combinatorial Laplacians describing the underlying topological structure. We indicate several areas of application where the framework can be used to provide a more efficient and reliable data representation.
[LG-64] owards quantum machine learning for assessing the resilience of post-quantum cryptography CCS2026
链接: https://arxiv.org/abs/2607.13722
作者: Jarosław A. Miszczak
类目: Quantum Physics (quant-ph); Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注: 14 pages, 7 figures, version accepted for ICCS 2026
Abstract:The potential capabilities of quantum computers motivated the development of cryptographic protocols suitable for securing communication against adversaries with access to large fault-tolerant quantum computers. However, even though current quantum computers are limited in terms of size and precision, they can still be useful for finding loopholes and weaknesses in the post-quantum cryptographic protocols. In this work, we present an attempt to utilize the capabilities of Quantum Generative Adversarial Networks (QGANs), one of the promising architectures used in quantum machine learning, for this purpose. We describe an example application of QGAN architecture for the purpose of loading the probability distribution of the hash-based digital signatures into the memory of a quantum computer. Our results confirm that near-term hybrid quantum-classical methods possess capabilities required for this purpose. The presented approach can be used as a first step in the workflow, enabling the utilization of quantum computing for attacking post-quantum cryptographic primitives.
[LG-65] Parallel gradient boosting for flexible estimation of conditional distributions
链接: https://arxiv.org/abs/2607.13550
作者: Rémy Chapelle(CESP, CB, EVDG),Nicolas Vayatis(CB),Bruno Falissard(CESP),Mohammed Sedki(CESP)
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Boosting is one of the most successful learning techniques for standard classification and regression tasks. Its extension to multi-output prediction problems has found an increasing number of applications in recent years. Among them is the prediction of entire conditional distributions rather than single functionals, which can often be framed as a multi-output regression problem, for example multiple quantile regression. Addressing such problems with classical implementations of boosting is computationally challenging, because usually one base model is trained for each target at every iteration. More efficient variants of boosting have been proposed to speed up training, but they tend to be tied to specific loss functions and classes of base learners, usually decision trees. In this work, we study a modification of the gradient boosting algorithm, which we call parallel gradient boosting, designed to circumvent all these limitations. The core idea is to use a common descent direction for all training observations. By doing so, only one base model is needed at each iteration, regardless of the number of targets, which allows for considerable performance gains. We establish sufficient conditions for the convergence of the algorithm, whose practical use is introduced via the multiple quantile regression setting. We show that in such a setting, it provides predictions of similar quality to state-of-the-art boosting libraries such as XGBoost, while being faster by several orders of magnitude. Then, we evaluate the properties of the resulting conditional distribution estimator, which is shown empirically to outperform other nonparametric and semiparametric estimators, especially in high-dimensional settings and in the presence of mixed and/or missing covariates.
[LG-66] Non-Expansive Two-Time-Scale Stochastic Approximation: A Fixed-Schedule One-Quarter Barrier and Bias-Corrected Acceleration
链接: https://arxiv.org/abs/2607.13414
作者: Dhruv Sarkar,Vaneet Aggarwal
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Non-expansive two-time-scale stochastic approximation is governed by a slow stochastic Krasnoselskii–Mann fixed-point iteration rather than by contraction to a unique equilibrium. We study this regime under a contractive fast map and a non-expansive reduced slow map. We first prove a finite-horizon lower bound showing that, for any prescribed slow stepsize schedule (\beta_k) , the classical KM residual scale (\sum_iN\beta_i(1-\beta_i))^-1 is worst-case sharp for the corresponding unregularized KM update. Combined with the raw fast-tracking leakage scale, this explains the previously observed k^-1/4+o(1) last-iterate mean-square residual exponent. We then introduce a residual-preconditioned slow oracle that cancels the first-order dependence on the fast tracking error. In a nested Tikhonov-KM algorithm, the uncorrected oracle yields total-sample rate T^-1/4+o(1) , while the corrected oracle yields T^-1/3+o(1) . This improvement comes from changing the slow-oracle bias from first order to second order in the fast error after all inner-loop samples are counted. Finally, we show that the repeated inner-loop cost of the nested method can be avoided in a smooth derivative-oracle model. A single-loop algorithm that tracks both the fast equilibrium and the leakage preconditioner online achieves T^-1/2+o(1) with O(1) primitive samples per iteration. Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG) Cite as: arXiv:2607.13414 [stat.ML] (or arXiv:2607.13414v1 [stat.ML] for this version) https://doi.org/10.48550/arXiv.2607.13414 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-67] Learned Pairwise Deep Dual-Optimal Inequalities for Stabilizing Column Generation
链接: https://arxiv.org/abs/2607.13373
作者: Zhengzhong Ricky You,Bo Tang,Haoran Liu,Baichuan Mo
类目: Optimization and Control (math.OC); Machine Learning (cs.LG)
*备注: 35 pages, 3 figures, and 12 tables; online appendix included
Abstract:Column generation (CG) is central to many large-scale optimization algorithms, including branch-price-and-cut methods for vehicle routing problems, but unstable dual solutions can substantially slow its convergence. Existing deep dual-optimal inequalities can reduce this instability by restricting the dual space. Their construction, however, typically relies on problem-specific exchange arguments that are difficult to establish for routing problems with capacity limits, time windows, and other resource constraints. We introduce learned pairwise deep dual-optimal inequalities (L-PDDOIs), a learning framework that predicts pairwise orderings between dual variables and incorporates their primal counterparts directly into the master problem. To construct training labels, the framework samples optimal dual solutions and selects pairwise order relations that hold simultaneously on a sufficiently large common subset of the samples. A classifier then assigns a score to each candidate relation. Because conflicts and redundancies among the predicted relations can impair performance, graph-based postprocessing filters and compresses the candidate set before deployment. We further introduce a recovery procedure that selectively relaxes learned inequalities and provides a certificate when the baseline CG bound has been restored. On the main test sets for the capacitated vehicle routing problem and the vehicle routing problem with time windows, direct deployment of L-PDDOIs reduces the geometric mean root CG time by 89.7% and 93.9%, respectively, while incurring mean bound losses of only 1.3% and 0.5%. The recovery procedure retains corresponding time reductions of 54.8% and 83.1%, respectively, while guaranteeing no loss in the CG bound.
[LG-68] DeepCormack: Fermi surface tomography using model-based data-driven algorithms
链接: https://arxiv.org/abs/2607.13107
作者: Georg F. B. Lovric,Bryn Drury,Carola-Bibiane Schönlieb,Stephen B. Dugdale,Ander Biguri
类目: Materials Science (cond-mat.mtrl-sci); Strongly Correlated Electrons (cond-mat.str-el); Machine Learning (cs.LG)
*备注: 28 pages, 17 figures
Abstract:The experimental reconstruction of the 3D two-photon momentum density (TPMD) via angular correlation of electron-positron annihilation radiation (ACAR) is a particularly useful method for studying material Fermi surfaces. It does not rely on low temperatures, UHV conditions, or strong magnetic fields, and enables the study of the spin-resolved electronic structure of materials. Yet, it remains a challenging inverse problem. Typically, 10^8 positron annihilation events are measured for 3–6 projections of the TPMD at different angles. The standard reconstruction approach is an ACAR adaptation of Cormack’s method (the MCM) that leverages the inherent symmetry in the crystal’s structure. However, the poor signal-to-noise ratio means collecting data of sufficient quality for Fermi surface studies can take months per sample. We present DeepCormack, a family of data-driven model-based reconstruction algorithms that augments the MCM by integrating supervised deep-learning models (CNN, MLP, and UNet) at various stages. To overcome the lack of large experimental training sets, we propose a method which leverages singular value decomposition with dynamic mode decomposition to generate realistic synthetic TPMD volumes, requiring only a single reference momentum density computed via density functional theory. On test data, DeepCormack improves reconstruction quality over MCM by about 8.5 dB PSNR at 200M counts and remains stable at reduced counts, enabling significantly faster acquisition times. Generalisation to experimental data depends strongly on how well the training distribution from the reference momentum density matches the sample. We therefore recommend pairing DeepCormack with a DFT calculation of the target material to create sample-specific training data. Our proposed method offers either much higher quality reconstructions, or enables significantly faster ones, on the order of weeks.
附件下载
