本篇博文主要内容为 2026-09-24 从Arxiv.org论文网站获取的最新论文列表，自动更新，按照NLP、CV、ML、AI、IR、MA六个大方向区分。
说明：每日论文数据从Arxiv.org获取，每天早上12:30左右定时自动更新。
提示: 当天未及时更新，有可能是Arxiv当日未有新的论文发布，也有可能是脚本出错。尽可能会在当天修复。
目录
概览 (2026-09-24)
今日共更新807篇论文,其中:
- 自然语言处理共107篇(Computation and Language (cs.CL))
- 人工智能共193篇(Artificial Intelligence (cs.AI))
- 计算机视觉共128篇(Computer Vision and Pattern Recognition (cs.CV))
- 机器学习共210篇(Machine Learning (cs.LG))
- 多智能体系统共20篇(Multiagent Systems (cs.MA))
- 信息检索共25篇(Information Retrieval (cs.IR))
- 人机交互共22篇(Human-Computer Interaction (cs.HC))
多智能体系统
[MA-0] Connectivity Preservation and Graph Stretching in Range-Only Swarm Dispersion
【速读】：该论文旨在解决在仅依赖距离测量（range-only）的匿名、同质且无记忆（oblivious）代理系统中，如何实现连通性保持的有限跳跃分散（connectivity-preserving finite-jump dispersion）问题。其核心挑战在于：代理无法获取方向（bearings）、身份标识、通信能力或共享坐标系，仅能感知可见邻居的距离，因此必须设计一种仅基于局部距离信息即可保证全局连通性的运动规则。解决方案的关键在于提出一种基于最大可证安全位移的分布式规则：每个代理仅需测量到最远可见邻居的距离，并沿随机选择的方向移动其剩余可视范围的一半（即半可视余量）。该规则在同步有限运动下能够保持所有现存的可见性边（visibility edge），从而确保连通性不变。对于双代理情形，证明了平方距离的正向条件漂移、几乎必然收敛至可视边界，以及到达任意固定邻域的期望时间有限；蒙特卡洛仿真与贝尔曼方程计算均验证了约9.5轮可达初始位置重合时距离0.97倍可视范围的目标。在一般群体场景中，1,000次模拟覆盖五类初始拓扑结构，验证了该协议在实现层面仍能维持确定性的安全性保障，并揭示了不同拓扑结构下可达直径的系统性差异。这些结果为最小传感条件下多机器人系统的连通性保持分散提供了理论基础，并明确界定了仅凭匿名距离测量所能实现的保证。
链接: https://arxiv.org/abs/2609.28190
作者: Ariel Barel
机构: Technion Israel Institute of Technology (以色列理工学院)
类目: Multiagent Systems (cs.MA)
备注:
Abstract:We study connectivity-preserving finite-jump dispersion of anonymous, identical, and oblivious agents under an idealized range-only sensing model. Each agent measures only the distances to its visible neighbors, without bearings, identifiers, communication, memory, or a shared coordinate system. We derive the largest isotropic displacement certifiable as safe from these measurements alone. The resulting rule requires only the distance to the farthest visible neighbor: each agent selects a random direction and moves by half of its remaining visibility margin. The rule preserves every existing visibility edge under synchronous finite motion and therefore preserves connectivity. For two agents, we prove positive conditional drift in squared distance, almost-sure convergence to the visibility boundary, and finite expected time to reach any fixed neighborhood of that boundary. A one-million-run Monte Carlo experiment agrees with the exact first-round moments and estimates approximately 9.5 rounds to reach distance 0.97V from coincident initial positions; an independent Bellman-equation computation gives the same estimate. For general swarms, 1,000 runs across five initial-topology classes reproduce the deterministic safety guarantee at implementation level and reveal a consistent topology-dependent ordering of attainable diameter under the tested protocol. These results provide a theoretical foundation for connectivity-preserving multi-robot dispersion under minimal sensing, while isolating the guarantees achievable from anonymous range measurements alone.
[MA-1] Compliant with Local Controls Collectively Discriminatory. A Governance Architecture for Multi-Agent AI in Regulated Finance
【速读】：该论文旨在解决金融领域中多智能体（agent）系统在实际部署过程中因局部合规性无法保证整体系统行为安全而引发的治理难题，即“宪法非可组合性”（constitutional non-compositionality）问题——单个智能体或模型在本地满足合规要求，但其协同行为可能仍导致不可接受的集体后果，如不公平的差异化影响、市场完整性受损或责任追溯失效。解决方案的关键在于提出一种面向金融场景的参考架构 ARIA（Agent Population Governance Reference Architecture），通过在规范-问责、执行控制与保障-学习三个维度上整合六项核心能力：政策定义、群体级“观测-预期”行为监控（M2）、有限授权、运行时约束、自适应策略调整以及人类监督能力的持续保留。该架构强调从局部可控向全局可治理演进，并通过模拟验证了在局部控制下共享信号导致薄档案排除风险及分布偏移早期预警的有效性，最终将这些机制与公平放贷、欧盟人工智能法案（EU AI Act）、模型风险管理和行为监管等监管证据需求对齐，提出可验证的研究议程，而非宣称生产可用性。
链接: https://arxiv.org/abs/2609.27994
作者: Jose Manuel de la Chica Rodriguez,Juan Manuel Vera Diaz,Pablo Delgado Romero
机构: 未知
类目: Multiagent Systems (cs.MA); Artificial Intelligence (cs.AI)
备注:
Abstract:Financial institutions are beginning to deploy agentic workflows in credit, fraud, collections, compliance, and operational control. Governance remains largely component-centric: each model or agent is specified, tested, authorized, and monitored locally. That is insufficient when institutional risk arises from the joint behavior of many locally acceptable components. We call this gap constitutional non-compositionality: local compliance checks need not compose into acceptable collective outcomes such as bounded disparate impact, market integrity, or traceable accountability. We propose ARIA as a finance-specific reference architecture and falsifiable research agenda for agent-population governance. It organizes six capabilities across normative-accountability, execution-control, and assurance-learning planes: policy specification, population-level observed-versus-expected behavior monitoring (M2), bounded authority, runtime containment, adaptive policy change, and preserved human oversight competence. Two simulations illustrate shared-signal thin-file exclusion under local controls and earlier warning from observed-versus-expected distributional monitoring in a constructed drift regime. The contribution maps these controls to fair-lending, EU AI Act, model-risk, and conduct-supervision evidence needs, and closes with a validation agenda rather than a production-effectiveness claim.
[MA-2] Resilient Monitoring of Social Dynamical Systems through Collaborative Multi-Agent Networks under Latency
【速读】：该论文旨在解决社会动态网络（social dynamical networks）在数字环境中监测与分析中的关键挑战，尤其是由时延、节点故障等引起的系统稳定性与可观测性问题。其核心解决方案在于提出一种基于多智能体系统（multi-agent systems, MAS）的分布式推理模型，该模型具备单时间尺度特性，可有效应对通信延迟和智能体失效问题；同时，通过引入图论方法设计了计算高效的故障恢复机制，能够在智能体因感知故障或包丢失导致失效时，快速通过观测等价替代策略重构网络可观测性，从而保障系统的鲁棒性与持续运行能力。该方案的关键创新在于：即使存在时变时延，观测器增益设计仍能保持稳定，且整个框架在理论条件上保证了系统稳定性，为复杂社会网络的实时监控提供了可靠的技术支撑。
链接: https://arxiv.org/abs/2609.27902
作者: Mohammadreza Doostmohammadian,Sergio Pequito
机构: Semnan University (塞姆南大学); Instituto Superior Técnico, University of Lisbon (里斯本大学高等技术学院)
类目: ystems and Control (eess.SY); Multiagent Systems (cs.MA); Signal Processing (eess.SP); Optimization and Control (math.OC)
备注: systems and control letters
Abstract:Social dynamical networks significantly influence contemporary digital landscapes, affecting realms from social activism to public policy formulation. This paper investigates the use of multi-agent systems (MAS) to monitor and analyze these networks. Firstly, we propose a single-time-scale distributed inference model designed to effectively manage challenges such as latency and agent failure. Secondly, we provide sufficient conditions that ensure the stability of the proposed scheme. Notably, the observer gain design remains effective regardless of time delays. Thirdly, we develop a computationally efficient recovery mechanism for agent failures that relies on employing graph-theoretic approaches to restore network observability by replacing failed agents (due to sensing failure or unbounded delays, i.e., packet drops) by implementing computationally efficient graph-theoretic methods to assign observationally equivalent agent counterparts. Lastly, we illustrate the proposed scheme through a pedagogical example and real-world network applications.
[MA-3] Agent ic Governance and Adversarial Verification for Policy-Constrained LLM Healthcare Appeal Generation
【速读】：该论文旨在解决美国医疗保健系统中因理赔拒绝管理所导致的约2600亿美元年行政成本问题，核心挑战在于现有生成式AI（Generative AI）在高风险医疗场景下的可靠性缺陷：单智能体架构易引入未经证实的临床细节，并丧失层级化保险政策的逻辑结构。为此，论文提出AGVF（Agentic Governance and Adversarial Verification Framework），一种基于多智能体的医学必要性申诉生成框架，其关键在于将申诉生成建模为在明确政策与证据约束下的受限马尔可夫决策过程（Constrained Markov Decision Process, CMDP），由五个协同智能体构成：政策形式化、证据检索、缺口分析、对抗性批判与门控合成。通过固定策略约束图上的迭代优化，证明了证据缺失度单调下降且最终收敛于完整满足边界或局部证据缺口。其中，确定性引用锚定门（citation-grounding gate）有效防止无充分证据支持的陈述进入共享状态，实证验证显示在1000个基于去标识化医院出院数据生成的合成案例中，所有AGVF案例均实现零引用锚定违规，且每轮迭代均呈现证据缺失度的单调下降；移除该门控机制后违规率升至100%，验证其作为核心组件的关键作用。研究未使用真实患者数据，亦未评估临床疗效，但提供了理论支撑的多智能体架构与可验证的参考实现，为医疗领域受政策约束的生成式AI应用提供了范式。
链接: https://arxiv.org/abs/2609.27844
作者: Harshil Lodhiya,Alex McManus,Reese Walker
机构: Sliced Health(斯利斯健康)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Information Retrieval (cs.IR); Multiagent Systems (cs.MA)
备注: 18 pages, 7 figures. This manuscript is under review at ACM Transactions on Intelligent Systems and Technology (TIST)
Abstract:Claim denial management costs U.S. healthcare approximately 260 billion annually in administrative overhead. Large Language Models (LLMs) and Retrieval-Augmented Generation (RAG) can produce fluent clinical text, but single-agent architectures fail in high-stakes healthcare: they introduce unsupported clinical details and lose the logical structure of hierarchical payer policy. We propose AGVF (Agentic Governance and Adversarial Verification Framework), a multi-agent architecture for medical-necessity appeal generation under explicit policy and evidence constraints. AGVF models appeal synthesis as a Constrained Markov Decision Process (CMDP) over five agents: policy formalization, evidence retrieval, gap analysis, adversarial critique, and gated synthesis. We prove that refinement over a fixed policy constraint graph monotonically reduces evidence-deficiency and terminates with either a complete satisfying frontier or a localized evidence gap. A deterministic citation- grounding gate prevents assertions without admissible evidence from entering shared state. We provide a reference implementation and validate it on 1,000 synthetic appeal cases parameterized from de-identified public hospital discharge data. The validation confirms zero citation-grounding violations across all AGVF cases and monotone deficiency reduction in every episode; ablating the gate raises violations to 100%, confirming it is load-bearing. The study uses no real patient records and does not measure clinical efficacy. AGVF thus contributes a theory-backed agentic architecture and verified reference implementation for policy-constrained LLM generation in healthcare.
[MA-4] What Confidence Routing Is Actually Doing: Auditing Routing Calibration and Commitment in Multi-Agent Deliberation
【速读】：该论文旨在解决多智能体系统中基于置信度路由（confidence-routed）的广播协议在实际应用中的可靠性问题，特别是其在决策路由、不确定性估计与公开承诺一致性方面的潜在缺陷。核心问题是：当前普遍采用的“高置信度者发言”机制，将单一标量置信度同时用于对话路由、不确定性校准和结果承诺，导致各环节性能难以独立评估，进而影响整体系统的可信性。其解决方案的关键在于提出一种分层审计框架，将置信度路由过程解耦为三个可独立验证的子问题：（1）路由是否选择正确候选者（routing），（2）报告的置信度是否具有概率校准性（calibration），（3）被选中的智能体是否公开陈述其获胜答案（commitment）。研究通过对4,181条gpt-oss-120b在奥数任务上的轨迹进行分析，并扩展至包含Gemma-4-31B-it与生物多选题基准的2×2实验网格，发现原始置信度虽具备一定区分能力（AUROC 0.72），但存在严重过度自信（平均置信度79% vs. 实际准确率52%），且无法通过简单校准恢复判别力；同时，路由效果高度依赖场景，原始置信度最大值策略在部分模型上显著劣于随机有效选择；此外，智能体输出与投票结果之间的不一致率高达20.4%，其中62.4%为全新生成，且整体正确率下降1.7个百分点。研究进一步表明，仅靠校准无法弥补结构性缺陷，因此必须对路由判别性、置信度校准性和公开承诺一致性分别进行独立评估，才能确保置信度在部署决策中的有效性。
链接: https://arxiv.org/abs/2609.27822
作者: Jingyan Jiang,Huihuo Zheng,Rajeev Thakur,Chih-Hsuan Yang
机构: 未知
类目: Multiagent Systems (cs.MA); Computation and Language (cs.CL)
备注: 19 pages, 5 figures, 21 tables
Abstract:A common multi-agent design asks agents to report confidence and lets the highest-scoring agent speak next, implicitly using one scalar both to route the conversation and to estimate uncertainty. We audit this confidence-routed broadcast protocol by separating three trace-level questions: whether it selects the right candidate (routing), whether reported confidence behaves like a probability (calibration), and whether the selected agent publicly states the answer that won the turn (commitment). Our primary study covers 4,181 gpt-oss-120b olympiad-math traces; we repeat the audit on a 2-by-2 actor-by-benchmark grid that adds gemma-4-31B-it and a biology multiple-choice benchmark. In the primary cell, confidence discriminates correct from wrong candidates (AUROC 0.72) but is strongly overconfident (79% mean stated confidence versus 52% accuracy). A cross-fitted, tier-stratified isotonic procedure reduces Expected Calibration Error from 0.278 to 0.008 on held-out candidates, but it does not recover missing discrimination: raw AUROC is only 0.537 and 0.440 in the two Gemma cells. Routing is likewise setting-dependent. Fixed routers differ by at most 1.1 percentage points on gpt-oss/math, whereas raw-confidence argmax performs 5.6 and 11.2 points below random-valid selection in the Gemma cells. Commitment is distinct again: in the primary cell, poll and spoken answers diverge in 20.4% of valid pairs, 62.4% of those revisions are fresh generations, and the unconditional correctness shift is -1.7 points; the other three cells instead range from +0.9 to +12.2 points. The transferable lesson is procedural: routing discrimination, probability calibration, and public commitment must be measured separately before raw confidence is used for deployment decisions.
[MA-5] Agent -based Modeling: Equilibrium Echo Chambers and Efficiency in Hybrid Coevolutionary Opinion Games
【速读】：该论文旨在解决在线网络中意见形成过程中的双重动态问题，即个体信念与社会关系的协同演化（coevolution）在生成式语言模型（LLM）驱动下的行为机制与集体效率问题。传统分析模型虽可研究均衡状态与社会成本，但通常将信息传播简化为固定数值更新，难以反映真实语义交互的复杂性；而基于大语言模型（LLM）的代理虽提供了语言层面的自然交互方式，其收敛性与群体效率仍缺乏系统评估。为此，论文提出混合共演化意见博弈模型（Hybrid Coevolutionary Opinion Game, H-COG），融合成本最小化型弗里德金-约翰森（Friedkin-Johnsen）代理（Type-C）与Phi-4语言代理（Type-L），在动态重连的K-近邻网络结构中进行仿真。通过从5,199条关于枪支管控与堕胎议题的Reddit评论中提取初始意见并进行连续[-1,+1]尺度评分，构建了包含9种群体构成、3种初始网络拓扑及2个话题的540次实验。结果表明，仅使用语言代理（Type-L）时，系统仍能稳定收敛至吸引子，具备与理论更新规则相当的均衡性，使基于均衡的社会效率比较成为可能。然而，纯语言代理群体的平均“社会成本”（即价格悖论，Price of Anarchy）高达5.558±0.309，远高于纯弗里德金-约翰森代理的1.139±0.005，其主要成因并非邻里间分歧加剧，而是语言代理显著偏离其初始内在意见，反映出生成式代理在意见演化中存在较强的自我表达倾向与立场漂移风险。该结论在不同网络初始结构下均保持一致，揭示了当前生成式AI在社会共识形成中的潜在效率代价。
链接: https://arxiv.org/abs/2609.27639
作者: Ming-Zhi Jiang,An-Tzi Teng,Jun-En Liu,Po-An Chen,Yung-Ming Li
机构: National Yang Ming Chiao Tung University (国立阳明交通大学)
类目: Computer Science and Game Theory (cs.GT); Multiagent Systems (cs.MA); Social and Information Networks (cs.SI)
备注: 24 pages, 7 figures, 4 tables. Full-paper version
Abstract:Opinion formation in online networks involves changes in both beliefs and social ties. Analytical models make it possible to study equilibrium and social cost, but usually represent communication as a fixed numerical update. LLM-driven agents offer a language-based alternative, yet their convergence and collective efficiency remain unclear. We develop the Hybrid Coevolutionary Opinion Game (H-COG), combining cost-minimizing Friedkin-Johnsen agents (Type-C) and Phi-4 language agents (Type-L) in a dynamically rewired K-nearest-neighbor network. We initialize 50 agents with opinions drawn from 5,199 Reddit comments on gun control and abortion. The comments are scored on a continuous [-1,+1] scale using a fine-tuned RoBERTa regressor, and a mixing parameter sets the proportion of each agent type. The experiments cover nine population compositions, three initial network topologies, and two topics. All 540 runs meet the convergence criterion within the simulation horizon. Under Type-L updating, the coevolving network reaches an attractor as reliably as it does under the analytical update rule, making an equilibrium-based efficiency comparison possible. The pooled Price of Anarchy is 5.558 \pm 0.309 for purely Type-L populations, compared with 1.139 \pm 0.005 for purely Type-C populations. A decomposition of social cost attributes most of this gap to language agents moving away from their intrinsic opinions, rather than to greater disagreement with their neighbors. The main findings are consistent across the three initial network topologies.
[MA-6] Agent Name Collision Attacks in Multi-Agent Systems
【速读】：该论文旨在解决多代理系统中因远程代理卡（Agent Card）名称被误用为本地路由标识符而导致的安全漏洞问题。其核心问题是：尽管A2A协议将卡片名称定义为人类可读的元数据而非稳定身份标识，且未规定命名冲突语义，但部分主机仍将其用作本地路由依据，从而引发错误对端分发（wrong-peer dispatch）风险。解决方案的关键在于明确职责划分——主机应基于来源绑定的稳定身份（origin-bound stable identity）进行路由，保持名称仅作为展示性信息，并拒绝使用模糊别名；同时，协议设计需确保身份与权限传递通过受控机制实现，如委托配置对象的转发或模型中介决策，而非直接暴露执行权限。实证测试表明，此问题属于一类反复出现的实现缺陷，而非协议本身固有的普遍性漏洞，亦不反映特定部署数量的脆弱性。
链接: https://arxiv.org/abs/2609.27624
作者: Adithyan Arun Kumar
机构: 独立安全研究员(Independent Security Researcher)
类目: Cryptography and Security (cs.CR); Multiagent Systems (cs.MA)
备注:
Abstract:Multi-agent hosts turn remote Agent Cards into local agents, tools, workflow targets, and broker routes. A2A defines the card’s name as human-readable metadata, not as a stable identity, and specifies no collision semantics. The security failure begins when a host nevertheless uses that remote name as a local routing identifier. We traced registration through dispatch and ran isolated regression tests at seven pinned open-source revisions. Six client-style integrations selected an attacker-controlled peer’s client or loopback endpoint for a request addressed to a trusted peer’s name. A seventh, brokered implementation collapsed both peers onto one name-derived route; queue and access-control state determine whether the result is interception or denial. The common result is wrong-peer dispatch, not universal privilege inheritance. Synthetic credential and tool tests found no A-specific credential transfer in the tested client bindings and no direct transfer of A-owned tools. The broker path forwards a caller-configuration object; delegated identity or tokens reach B only if present and B can consume the route. Two other paths expose a later, model-mediated decision rather than direct execution authority. The necessary conditions assign different responsibilities to the protocol, implementations, and deployments. Hosts should route by an origin-bound stable identity, keep names presentational, and reject ambiguous aliases. The evidence establishes a recurring implementation vulnerability class, not a universal A2A protocol exploit or a count of vulnerable deployments.
[MA-7] Agent -Based Modeling of Systems of Systems
【速读】：该论文旨在解决大规模异构系统体系（Systems of Systems, SoSs）在动态环境中复杂交互与演化所带来的建模挑战，尤其关注如何有效表征和控制SoS的全局复杂性。其核心问题是现有建模方法难以兼顾SoS的组织结构、功能目标导向性以及多层级动态演化特性。为此，论文提出了一种基于代理的通用形式化建模框架，关键解决方案在于整合三个核心机制：采用**代理-群体-角色模型（Agent-Group-Role model）管理系统的组织维度；通过功能规范（functional specification）驱动系统实现整体目标的功能逻辑；并引入多层级仿真影响反应模型（Influence Reaction Model for Multilevel Simulation, IRM4MLS）**作为基于代理的元模型，以刻画多层级动态交互与系统重组行为。该框架能够同时捕捉SoS的静态结构与动态演化特征，包括因目标变更或子系统能力变化引发的自适应重组，并通过欧洲InTraDE项目中的智能自主车辆案例研究验证了其有效性。
链接: https://arxiv.org/abs/2609.27573
作者: Jean-Baptiste Soyez,Gildas Morvan,Rochdi Merzouki,Daniel Dupont
机构: 未知
类目: Multiagent Systems (cs.MA)
备注:
Abstract:This paper deals with the generic modeling of systems of systems (SoSs) using agent-based modeling. SoSs are large-scale systems, including numerous-possibly heterogeneous-interacting component systems evolving in a dynamic environment. The aim of this paper is to provide generic formalism allowing to represent and control the whole complexity of a SoS using agent-based simulations. In particular, organizational aspects of SoSs are managed with the Agent-Group-Role model. Functional aspects, guiding SoSs to accomplish their global goals, are handled via a functional specification. Multilevel aspects are modeled with the Influence Reaction Model for Multilevel Simulation (IRM4MLS) agent-based meta-model. Models generated using this formalism encompass static and dynamic aspects of SoSs. They consider reorganization of SoSs caused by changes of goals or subsystem capacity. All these elements are illustrated in this paper using a SoS case study of Intelligent Autonomous Vehicles initiated by the Intelligent Transportation for Dynamic Environment (InTraDE) European project to automate the port container logistic.
[MA-8] KITE: Scaling Jev Population Experiments with Sparse Flagship Calibration
【速读】：该论文旨在解决复杂社会系统模拟中因大规模随机抽样带来的计算成本过高与不确定性来源混淆的问题。传统方法依赖蒙特卡洛（Monte Carlo）噪声来评估不确定性，导致结果易受样本波动影响，且难以区分人类行为偏差与模型随机性。其核心解决方案是引入一种基于类型化行为核（typed behavioral kernel）的高效模拟框架——KITE，该框架通过为每个唯一状态仅调用一次行为核，结合事件键驱动的随机性与公共随机数（common random numbers），实现对任意规模群体的快速并行仿真。同时，仅在稀疏配对锚点（sparse paired anchors）上运行高成本旗舰模型以估计干预效应，将人类-模型差异作为共享误差传播至所有结论中。这一设计使模拟成本与唯一状态及锚点数量呈线性关系，而不确定性则由实际人群证据决定，而非蒙特卡洛噪声。实验表明，在9,070名参与者的Epstein实验中，覆盖1.7%状态的锚点使效应误差降低41%（绝对MAE下降0.0125）；在37个留出的SocSci210实验中，0.5%-1.5%的锚点覆盖率使捕获决策增益从0.27提升至0.39。此外，该框架在16国研究中的15个新国家均通过内容保真度检验，共享误差机制使名义80%和90%置信水平下的事后覆盖率分别达到93%和96%，远超仅依赖人类采样不确定性的29%和36%。单台笔记本可在0.9秒内完成百万代理的20步模拟。该架构支持候选干预方案的预筛查、多国内容审计及具有不确定性感知的政策比较，仅需数千次核调用与稀疏旗舰锚点，且每项应用均附带属性特定证据记录，涵盖验证范围、修正溯源与不确定性信息，确保可审计性。
链接: https://arxiv.org/abs/2609.27535
作者: Hengyu Li(The University of Tokyo)
机构: The University of Tokyo(东京大学)
类目: Multiagent Systems (cs.MA); Computers and Society (cs.CY)
备注: 24 pages, 5 figures. Code and evaluation records: this https URL
Abstract:KITE queries a typed behavioral kernel once per unique state, then executes populations of any size from the table with event-keyed randomness and common random numbers. An expensive flagship model is reserved for sparse paired anchors that estimate intervention effects. Measured human-model discrepancy is propagated as shared error into every conclusion. Population-experiment cost thus scales with unique states and anchors, while uncertainty is governed by evidence about people rather than Monte Carlo noise. On Epstein experiments with 9,070 participants, anchors covering 1.7% of states reduced effect error by 41% (absolute MAE reduction 0.0125). On 37 held-out SocSci210 experiments, 0.5-1.5% anchor coverage raised captured decision gain from 0.27 to 0.39. The kernel passed content-fidelity criteria in all 15 new countries of a 16-country study. Shared discrepancy yielded retrospective coverage of 93% and 96% at nominal 80% and 90%, versus 29% and 36% from human sampling uncertainty alone. A million agents executed 20 tabulated steps in 0.9 seconds on a laptop. This architecture offers a route to screening candidate interventions before human trials, multi-country content audits, and uncertainty-aware policy comparison at the cost of a few thousand kernel calls with sparse flagship anchors. Property-specific evidence records connect each use to its validation scope, correction provenance, and uncertainty, making these applications auditable.
[MA-9] From Intents to Algorithms: Verified Algorithm Discovery for Transport Networks
【速读】：该论文旨在解决意图驱动网络（intent-based networking）中算法设计依赖预设参数与人工干预的问题，尤其关注如何在利用大语言模型（LLM）自动化生成网络控制逻辑的同时，确保其生成结果在可行性、可复现性及鲁棒性方面满足传输网络控制的严格要求。其解决方案的关键在于提出一种验证引导的框架VERA-TN，将网络意图编译为一个受约束的算法设计规范，通过将LLM作为类型化请求排序与路径评分程序的语义变异算子，实现生成逻辑与可信分配器的分离。该分配器独立执行路径有效性、延迟、容量和单路径等关键约束的强制校验，从而在不依赖模型自身可靠性的前提下保障系统安全性。研究通过形式化证明在特定假设下保持可行性，并为精确参考模型中的字典序延迟冲突解决机制建立了充分边界。实验基于28节点TEFNET24衍生拓扑的150个经认证的测试案例，采用进化搜索方法在有限参数空间内探索解空间，获得均值优先级-效用比0.958，优于随机搜索（0.952）和优先级贪婪路由（0.940），且差异具有统计显著性（Holm校正p = 0.0083）。然而，该候选方案未显著改善拥塞性能，且失败感知训练的效果在0.05显著性水平上不明确（p = 0.051）。在国家级拓扑上的八次发现运行及对12个未见城域区域拓扑的重播实验表明，未观察到稳定的情境特异性优化，支持了信任边界划分与数值演化策略的有效性，但尚未证实LLM生成带来的实质性性能增益。
链接: https://arxiv.org/abs/2609.27386
作者: Behnam Ojaghi,Ricard Vilalta,Raul Muñoz
机构: CTTC, Castelldefels, Barcelona, Spain (西班牙加泰罗尼亚技术研究中心)
类目: Networking and Internet Architecture (cs.NI); Multiagent Systems (cs.MA)
备注:
Abstract:Intent-based networking decouples desired outcomes from device-level configuration, but most systems still map intents to parameters of an algorithm selected in advance. Large language models (LLMs) create an opportunity to automate algorithm design, yet unrestricted generated code is unsuitable for transport-network control because feasibility, reproducibility, and robustness must be enforced independently of the model. We present VERA-TN, a verification-guided framework that compiles a network intent into a bounded algorithm-design specification. The target architecture uses an LLM as a semantic variation operator over typed request-ordering and path-ranking programs; generated logic remains separated from a trusted allocator that enforces path validity, latency, capacity, and single-path constraints. We prove feasibility preservation under explicit assumptions and establish a sufficient bound for the lexicographic latency tie-break in the exact reference model. The released proof-of-concept instantiates the same interface with a bounded ten-parameter numerical candidate and deterministic replay, rather than a completed live-LLM/AST study. Across 150 certified held-out cases on a 28-node TEFNET24-derived hierarchy, evolutionary search reaches a mean priority-utility ratio of 0.958, compared with 0.952 for equal-budget random search and 0.940 for priority-greedy routing. The gain over random search is small but statistically detectable (Holm- adjusted p = 0.0083). The candidate does not improve congestion relative to MILP-C, and the effect of failure-aware training is inconclusive at the 0.05 level (p = 0.051). Eight discovery runs on the official national topology and replay on 12 unseen metro-regional topologies show no stable intent-specific specialization. These results support the trust-boundary and numerical-evolution claims but do not establish a benefit from LLM generation.
[MA-10] Anchor and Perturb: Lazy Agent Remediation by Exploration Injection
【速读】：该论文旨在解决多智能体协同中因探索与策略收敛之间的冲突而导致的协调失败问题，尤其针对在非单调奖励空间下传统修复策略所引发的严重时序差分惩罚（temporal-difference penalties）。其核心解决方案是提出一种轻量级框架——锚定与扰动（Anchor and Perturb, AnP），通过将探索性方差注入与递归流形稳定性解耦，实现对协同策略的精准调控。AnP 的关键在于：识别表现不佳的“懒惰”智能体，并仅向其特定状态坐标注入非对称探索脉冲，同时将已收敛的协作智能体“锚定”于最优贪婪利用模式，从而在不改变网络结构的前提下，有效恢复崩溃的联合策略（从5%的评估胜率低谷回升至85%），并突破次优协调平台，维持高达90%的峰值胜率。
链接: https://arxiv.org/abs/2609.27365
作者: Chengxi Zhong,Yongzhe Chang
机构: 未知
类目: Multiagent Systems (cs.MA)
备注: 6 pages, 1 figure, work in progress
Abstract:Anchor and Perturb (AnP) is a lightweight framework that resolves multi-agent coordination failures by decoupling exploratory variance injection from recurrent manifold stability. Existing remediation strategies predominantly alter mixing network architectures or enforce simultaneous exploration across the collective, which inevitably precipitates severe temporal-difference penalties in non-monotonic reward spaces. Specifically, AnP isolates underperforming lazy agents and injects an asymmetric exploratory pulse into targeted coordinates whilst anchoring converged teammates to nominal greedy exploitation. Empirical telemetry benchmarks demonstrate that AnP successfully rescues collapsed joint policies (recovering from a 5% evaluation win rate nadir back to 85%) and facilitates escape from suboptimal coordination plateaus, sustaining peak win rates of 90% without requiring structural network modifications.
[MA-11] ach-to-Crash: A Closed-Loop Student-Teacher LLM Framework for Collision-Inducing Test Scenario Generation ICDE
【速读】：该论文旨在解决自动驾驶系统（Autonomous Driving Systems, ADS）在仿真环境中的验证难题，即如何在保证生成场景可执行、多样化且对下游故障分析具有实用价值的前提下，高效发现罕见但安全关键的失效情况。其核心挑战在于平衡测试的覆盖率、效率与实际可操作性。解决方案的关键在于提出一种闭环式测试框架——Teach-to-Crash，该框架采用受限的自车中心化场景表示、基于停滞感知的搜索控制机制以及双大语言模型（dual-LLM）协同架构：高推理能力的“教师”大模型作为自适应搜索控制器，在碰撞率和碰撞时间等指标出现停滞时介入，提供战略引导；低推理能力的“学生”大模型则根据严格的JSON模式生成可被仿真器执行的场景。这种分层协作机制使系统能够在有限的可执行程序空间内实现高效的对抗性测试，显著提升故障发现的频率、结构多样性及可规避性评估，实证表明其在碰撞命中率（90.79%）、平均碰撞前时间（18.31秒）和场景多样性（0.547）等方面均优于现有方法。
链接: https://arxiv.org/abs/2609.27296
作者: Zaid Ghazal,Khouloud Gaaloul,Bruce Maxim
机构: University of Michigan-Dearborn(密歇根大学迪尔伯恩分校)
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA); Systems and Control (eess.SY)
备注: 41st IEEE/ACM International Conference on Automated Software Engineering (ASE) AgenticDev (2026)
Abstract:Validating Autonomous Driving Systems (ADS) in simulation requires testing architectures that can discover rare, safety-critical failures while generating scenarios that are executable, diverse, and useful for downstream failure analysis. We introduce Teach-to-Crash, a closed-loop testing framework that combines a constrained ego-centric scenario representation, stagnation-aware search control, and a dual-LLM architecture for adaptive failure discovery. A high-reasoning Teacher LLM acts as an adaptive search controller, while a low-reasoning Student LLM emits simulator-executable scenarios in a strict JSON schema. The Teacher intervenes only when rolling collision rate and time-to-collision metrics stagnate, providing strategic guidance to redirect the search. In a CARLA case study with two experimental setups that vary the ego vehicle’s speed policy, Teach-to-Crash achieves the highest Collision Hit Rate (90.79%), the shortest mean Time-to-Collision (18.31 s), and a competitive Collision Discovery Rate (136.21). PAFOT attains a higher mean CDR (179.44), but with substantially larger variance. Teach-to-Crash also yields the highest diversity (0.547) and, averaged across both setups on the CARLA Traffic Manager controller, the highest avoidability-based usefulness proxy (60.04%) among the compared methods. These results, within the evaluated CARLA scope, provide evidence that closed-loop dual-LLM reasoning can steer adversarial simulation-based testing over a constrained executable program space, generating failures that are frequent, structurally diverse, and assessed as more frequently avoidable.
[MA-12] Self-Evolving Multimedia Verification through Memory Consolidation of Contestation Experiences
【速读】：该论文旨在解决多媒体验证中缺乏可追溯证据、不可靠的人工修正以及先验经验有害传递等问题，核心挑战在于如何在保证决策准确性的同时，实现推理过程的可追溯性、可修订性与可争议性。其解决方案的关键在于提出一种自演化多智能体框架SEMV（Self-Evolving Multimedia Verification），通过将带有溯源信息的论证（provenance-bearing arguments）作为证据、推理、人工争议与记忆之间的接口，融合基于竞技场的定量双极论证（A-QBAF）、因果与作用域限定的修订机制，以及受验证约束的记忆固化策略，并显式保留冲突信息。这一设计使系统能够基于已验证的经验持续演化，同时确保知识积累和后续决策的可追溯、可修订与可争议，显著提升了验证准确率（在COSMOS基准上达91.88%）并大幅降低负面迁移（从5.7%降至0.2%），在计算效率与推理一致性方面亦表现优异。
链接: https://arxiv.org/abs/2609.27175
作者: Truong Thanh Hung Nguyen,Vo Thanh Khang Nguyen,Hoang-Loc Cao,Phuc Ho,Truong Thinh Nguyen,Van Pham,Hung Cao
机构: FPT Software(福布斯软件), Quy Nhon, Vietnam; University of New Brunswick(新不伦瑞克大学), Fredericton, New Brunswick, Canada; University of Science and Technology of Hanoi(河内科学技术大学), Hanoi, Vietnam
类目: Multimedia (cs.MM); Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA)
备注:
Abstract:Multimedia verification requires not only accurate decisions but also traceable evidence, reliable human correction, and safe reuse of prior experience. Existing systems often lack explicit mechanisms for revising intermediate reasoning or preventing harmful knowledge transfer. We present SEMV (Self-Evolving Multimedia Verification), a self-evolving multi-agent framework that treats provenance-bearing arguments as the interface between evidence, reasoning, human contestation, and memory. SEMV combines arena-based quantitative bipolar argumentation (A-QBAF), causal and scoped revision, and verification-gated memory consolidation with explicit conflict retention. On COSMOS benchmark, SEMV achieves 91.88% accuracy versus 89.10% for the strongest comparable baseline. Verified memory reduces negative transfer from 5.7% to 0.2%. On CTR benchmark, constructed from reviewer contestations, scoped causal revision corrects 96.7% of initial errors while saving 52.8% compute. MV2026 Grand Challenge dataset further supports evidence-grounded, temporally consistent reporting. These results show that SEMV can evolve through verified experience while keeping accumulated knowledge and subsequent decisions traceable, revisable, and contestable.
[MA-13] Escaping Python Dependency Hell: A Hybrid Replay-and-Repair Pipeline for Python Dependency Resolution
【速读】：该论文旨在解决Python生态系统中因版本约束不兼容、依赖包缺失及兼容性关系未明确定义而导致的依赖冲突问题，此类问题致使大量实际代码片段在执行时失败。其解决方案的关键在于提出一种混合式依赖修复流水线PLLM+，通过优先执行低成本的确定性步骤来减少对生成式AI（Generative AI）的依赖：包括基于静态AST的解释器推断、从竞赛提供的解决方案数据库中回放历史成功依赖配置，以及对候选包版本进行实时PyPI验证。仅当这些确定性步骤无法解决问题时，系统才启用结构化的生成式AI修复循环，结合类型化错误分类与提议者/批评者（Proposer/Critic）代理机制进行修复。实验结果表明，在HG2.9K基准测试中，PLLM+成功修复1,500个依赖失败片段，显著优于基线模型（1,169个），且平均运行时间从368.7秒降至71.8秒。其中，1,495个成功修复源于对已有有效配置的复用，凸显了在该场景下，通过确定性方式重用已验证的依赖配置是一种高效且简洁的策略，而生成式AI修复仅作为补充手段处理未覆盖的边缘案例。
链接: https://arxiv.org/abs/2609.26952
作者: Veronica Poweska,Ariana Oyanguren,Jessica Pourleyli,Sourena Khanzadeh,Manar Alalfi
机构: Toronto Metropolitan University (多伦多都会大学); Flybits (飞比特)
类目: Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA); Software Engineering (cs.SE)
备注:
Abstract:Dependency conflicts in Python ecosystems arise from incompatible version constraints, missing packages, and undocumented compatibility relationships, causing many real-world code snippets to fail at execution. This paper presents PLLM+, a hybrid dependency-repair pipeline evaluated on the HG2.9K benchmark of 2,891 dependency-failing snippets. PLLM+ prioritizes inexpensive deterministic steps before invoking LLM-based repair: static AST-based interpreter inference, replay of historically successful dependency configurations from the competition-provided solutions database, and live PyPI validation of candidate package versions. When these steps do not resolve a case, the system falls back to a structured LLM-based repair loop with typed error classification and Proposer/Critic agents. On HG2.9K, PLLM+ solves 1,500 out of 2,891 snippets, compared with 1,169 solved by the PLLM baseline. It also reduces average runtime from 368.7 to 71.8 seconds per snippet. Most successful fixes come from replaying known configurations: 1,495 of the 1,500 successful fixes are produced by the solutions database, while the LLM fallback accounts for 5 additional fixes. These results suggest that, in this benchmark setting, deterministic reuse of previously validated dependency configurations is a simple and effective strategy, with LLM-based repair serving as a secondary fallback for cases not covered by prior solutions.
[MA-14] Building Socio-Affective Artificial Intelligence for Interactive Multi-Agent Simulations
【速读】：该论文旨在解决在模拟动态世界中实现人类与多个智能体（agent）之间高效、自然交互的关键挑战，尤其针对当前通用人工智能（AGI）发展背景下，基于Transformer的对话式智能体日益普及以及计算能力显著提升所带来的系统集成需求。其核心问题在于如何构建一个具备社会性与情感认知能力的智能体协作框架，以支持人机协同推理系统的可持续性与治理机制。解决方案的关键在于提出并实现一套名为AGIMUD的软件架构，该架构通过三大核心集成：A. 在智能体行为与交互中嵌入社会意识与情绪推理能力；B. 设计支持人类用户、人工代理与仿真世界之间的多模态交互方案；C. 采用分布式网络架构实现人工智能计算任务的分发，从而支持多个自主智能体的并行运行。这一集成设计使得动态世界的实时重构成为可能，实现了人类与智能体在多人在线虚拟环境（如多用户迷宫，MUDs）中同步、实时的交互。
链接: https://arxiv.org/abs/2609.26927
作者: David Berga
机构: Escola de Noves Tecnologies Interactives (ENTI), Universitat de Barcelona (巴塞罗那大学); Spain
类目: Artificial Intelligence (cs.AI); Computers and Society (cs.CY); Computer Science and Game Theory (cs.GT); Human-Computer Interaction (cs.HC); Multiagent Systems (cs.MA)
备注: 37 pages, 27 figures, 42 tables
Abstract:The objective of this article is to provide design principles and a software architecture for enabling interaction between humans and multiple agents in simulated dynamic worlds. This connects the current era of general artificial intelligence (AI/AGI) with the proliferation of transformer-based conversational agents and the increased computational capabilities. Given an overview of current and previous multi-agent theories of mind (socially and affectively-aware agents), the existence of an integrative design of agent interactions with themselves and with humans must be crucial for understanding how to create sustainable and governance in future human-agent reasoning systems. In this work is presented a software “AGIMUD” that integrates: A. socially-aware reasoning and emotion in agent behavior and interaction, B. a design of human multimodal scheme for human users, artificial agents and simulated worlds, and C. distributing the AI processing through the network to enable multiple autonomous agents. These integrations allow the dynamic world recreation as multi-user dungeons (MUDs) where both agents and humans can interact simultaneously in real time. Find the code online in this https URL.
[MA-15] Impact-Time Guidance via Normal Contraction to a Time-to-Go Isochron
【速读】：该论文旨在解决制导系统中到达时间（impact time）控制的精确性与鲁棒性问题，尤其针对拦截器在恒定速度下需在预设时刻精确命中目标的约束。其核心挑战在于如何在不依赖奇异逆运算的前提下，实现对时间到击（time-to-go）轨迹的精准调控，同时应对有限横向加速度的物理约束。解决方案的关键在于提出一种基于收缩映射（contraction-based） 的新视角：将预定到达时间调度视为一个动态的时间到击等时面（time-to-go isochron），并通过垂直于该等时面的速度分量施加横向加速度来调节运动状态，从而实现对时间坐标的精确跟踪。研究推导出一个描述兼容制导的时间到击坐标的传输方程，并引入“预测偏差（predictor defect）”以量化近似映射间的失配。进一步证明，标量时间通道在法向商空间上诱导出一个坐标不变的秩一度量，确保了系统的几何一致性。为处理受限横向加速度，设计了一种鲁棒的标量滤波器，并给出了点态可行性的充要条件。最终，在假设条件下证明，终端校准与漏斗不变性可保证首次拦截发生在指定时刻。此外，提出了前段对齐与制导交接策略，避免了在接近共线拦截路径时因横向定时控制能力消失而导致的奇异性。该框架兼容解析、数值及学习型的时间到击映射，只要满足校准与正则性条件即可应用。
链接: https://arxiv.org/abs/2609.26906
作者: Shivam Bajpai,Abhinav Sinha
机构: University of Cincinnati(辛辛那提大学); GALACxIS Lab(引导、自主、学习与智能系统实验室)
类目: ystems and Control (eess.SY); Multiagent Systems (cs.MA); Robotics (cs.RO); Dynamical Systems (math.DS)
备注:
Abstract:We develop a contraction-based perspective on impact-time guidance that augments a baseline homing command with a timing bias. The proposed perspective treats the prescribed schedule as a moving time-to-go isochron and regulates motion normal to that set through velocity-normal lateral acceleration while the interceptor’s speed remains constant. We derive a transport equation that characterizes homing-compatible time-to-go coordinates and define a predictor defect that quantifies the mismatch of approximate maps. We show that the scalar timing channel induces a coordinate-invariant rank-one metric on the normal quotient. To account for bounded lateral acceleration, we formulate a robust scalar filter and derive a necessary and sufficient condition for pointwise feasibility. We then show that terminal calibration and funnel invariance establish first interception at the prescribed time under the stated assumptions. We also develop a preterminal alignment and homing handover that avoids singular inversion as lateral timing authority vanishes near collision-course alignment. The proposed perspective accommodates analytic, numerical, and learned time-to-go maps that satisfy the required calibration and regularity conditions.
[MA-16] SkillApt: Learning When to Activate Agent Skills from Counterfactual Evidence
【速读】：该论文旨在解决大语言模型代理在检索到可复用技能（Skill）后，存在冗余、高成本甚至有害使用的问题。尽管检索到的技能可能在语义上相关，但在当前执行状态中未必必要或有益。为此，论文提出了一种后检索激活框架SkillApt，其核心在于通过对比“有技能”与“无技能”执行结果生成执行证据，并结合历史相似状态下的行为表现，对每个候选技能做出“加载（LOAD）”或“放弃（ABSTAIN）”的决策。关键创新在于将技能检索与技能激活解耦：检索阶段识别潜在相关技能，而SkillApt则基于上下文有效性判断是否实际启用。在SRA-Bench基准测试中，SkillApt-E实现了与BM25 Top-1相当的准确率（0.838），但将技能激活率从100%降至31.5%，平均令牌消耗降低74.3%，同时揭示了不同基础模型在技能效用及激活边界可学习性方面存在差异，表明应将技能检索与激活视为独立决策过程。
链接: https://arxiv.org/abs/2609.26863
作者: Shuang Guo
机构: Central China Normal University (华中师范大学)
类目: Multiagent Systems (cs.MA)
备注: 18 pages, 11 figures, 8 tables. Preprint
Abstract:Large language model agents increasingly retrieve reusable Skills and inject them into the active context. However, a retrieved Skill can be relevant yet unnecessary, costly, or even harmful in the current execution state. We present SkillApt, a post-retrieval activation framework that decides whether a retrieved Skill should actually be loaded. SkillApt builds execution evidence from matched WITH/WITHOUT runs and uses outcomes from similar historical states to make a LOAD/ABSTAIN decision for each candidate Skill. On the frozen confirmatory SRA-Bench evaluation, SkillApt-E achieved the same observed accuracy as BM25 Top-1 (0.838 vs. 0.838) while reducing the Skill activation rate from 100% to 31.5% and mean token usage by 74.3%. Further diagnostics show that both Skill utility and the learnability of its activation boundary vary across base models. These results suggest that Skill retrieval and Skill activation should be treated as separate decisions: retrieval identifies which Skill may be relevant, while SkillApt determines whether using it is worthwhile in the current state.
[MA-17] Sovereign Grassroots Currencies: A CBDC Architecture for Credit and Monetary Policy (Full Version)
【速读】：该论文旨在解决现有中央银行数字货币（CBDC）设计中的两大核心问题：一是银行存款向CBDC的转换可能加剧存款流失（deposit flight），从而威胁金融体系稳定性，需额外风险管控机制；二是传统CBDC架构脱离信用创造与货币政策操作，无法嵌入现行金融体系的信贷和利率传导机制。其解决方案的关键在于提出一种基于“草根货币”（grassroots currencies）的新型CBDC架构，通过三重结构实现功能整合：（1）主权草根硬币（sovereign grassroots coins），由央行发行、等值于一单位法币的数字债务，构成直接的CBDC；（2）非主权草根硬币（non-sovereign grassroots coins），可由自然人或法人发行，同样以法币计价并按面值赎回，用于拓展信用创造能力；（3）草根债券（grassroots bonds），包括主权与非主权类型，引入期限与利率属性，使央行能够通过买卖此类证券实施货币政策操作。该架构允许央行在不强制将商业银行存款转换为新发央行货币的前提下，自主选择交易对手方与条款开展借贷、流动性吸收及利率调控，从而实现对信用与货币政策的有效控制。研究进一步证明，只要发行人满足清偿条件，法币单位即为草根硬币唯一的无套利定价基准，并确立央行贷款利率与自身债券利率对市场可比利率的约束作用，使央行可面向任意实体进行政策操作，突破传统仅限于银行的局限。
链接: https://arxiv.org/abs/2609.27727
作者: Ehud Shapiro
机构: London School of Economics (伦敦政治经济学院), UK (英国); Weizmann Institute of Science (魏茨曼科学研究所), Israel (以色列)
类目: General Economics (econ.GN); Distributed, Parallel, and Cluster Computing (cs.DC); Multiagent Systems (cs.MA)
备注:
Abstract:A Central Bank Digital Currency (CBDC) is central-bank money in digital form, held by the public. Leading designs have two limitations: conversion from bank deposits into CBDC can accelerate deposit flight, requiring safeguards; the CBDC stays outside credit creation and monetary-policy operations. Here we present a CBDC architecture that overcomes these limitations, based on grassroots currencies. It has three components: (1) Money: sovereign grassroots coins, which are digital debts of one unit of fiat currency issued by the central bank, constituting a direct CBDC; (2) Credit and Liquidity: non-sovereign grassroots coins, which are digital debts of one unit of the same fiat currency, redeemable at par, that can be issued by any person, natural or legal - adding credit; and (3) Interest: grassroots bonds, sovereign and non-sovereign - adding maturity, and with it interest, standard banking instruments, and the central bank’s instruments of monetary policy. The central bank can therefore lend, absorb liquidity, set its rates and buy and sell securities in the coins and bonds the public holds, choosing the counterparties and terms of its credit operations, and without converting bank deposits into newly issued central bank money on demand. We prove that one unit of the fiat currency is the only arbitrage-free price of a grassroots coin whose issuer meets presentations, and argue that the central bank’s lending rate and the rate on its own bonds bound what its counterparties pay and accept on comparable terms; the central bank can choose to deal with any counterparty, not just banks. Subjects: General Economics (econ.GN); Distributed, Parallel, and Cluster Computing (cs.DC); Multiagent Systems (cs.MA) Cite as: arXiv:2609.27727 [econ.GN] (or arXiv:2609.27727v1 [econ.GN] for this version) https://doi.org/10.48550/arXiv.2609.27727 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Ehud Shapiro [view email] [v1] Wed, 23 Sep 2026 11:41:20 UTC (197 KB)
[MA-18] Multi-Agent AI Architecture for Regulated Insurers: A generic AI framework under Solvency II and the AI Act in Austria and Germany
【速读】：该论文旨在解决在受监管的保险企业中实现生成式 AI（Generative AI）时面临的合规性与制度逻辑不匹配问题，特别是在奥地利和德国等高度规制的金融环境中，如何确保 AI 系统在风险承担、决策协同与激励对齐等方面符合监管要求。其解决方案的关键在于提出一种形式化的多智能体架构，通过融合阿罗（Arrow）的风险共担理论以形式化不确定性下的风险转换机制、纳什均衡（Nash equilibrium）以建模决策智能体间的策略互动、以及委托-代理理论（Principal-Agent theory）以应对信息不对称下的激励一致性问题；同时，将保险公司建模为在偿付能力、法律、环境社会与治理（ESG）及运营约束下的受限优化实体，并将其分解为资本管理、承保、理赔处理、合规、反欺诈与客户交互等专业化智能体，结合分层访问控制的人机协同机制，由编排智能体（orchestrator agent）统一协调各智能体间交互，确保在《偿付能力 II》（Solvency II）、《人工智能法案》（AI Act）及《保险产品分销指令》等框架下具备监管可接受性与制度一致性。该架构采用异步执行与双层通信基础设施（模型上下文协议 MCP 与智能体-智能体 A2A 消息机制），实现了可审计、可追溯且符合金融机构制度逻辑的合规多智能体系统设计。
链接: https://arxiv.org/abs/2609.27636
作者: Walter Kurz
机构: Swissi Institute for AI(瑞士人工智能研究所)
类目: General Finance (q-fin.GN); Multiagent Systems (cs.MA); Risk Management (q-fin.RM)
备注: 15 pages, 0 figures. Published in Swissi AI Journal under CC BY 4.0
Abstract:This paper proposes a formal multi-agent architecture for implementing enterprise AI in regulated insurance firms, integrating economic theory with institutional design. The framework synthesises three core theoretical perspectives: Arrow’s risk pooling theory to formalise risk transformation under uncertainty, Nash equilibrium to model strategic interactions between decision agents, and Principal-Agent theory to address incentive alignment under information asymmetry. The insurer is modelled as a constrained optimisation entity operating under solvency, legal, ESG, and operational boundaries, with specific focus on the regulatory contexts of Austria and Germany. The architecture decomposes the firm into multiple specialised agents, each representing distinct functional domains such as capital management, underwriting, claims processing, compliance, fraud detection, and client interaction. Human-in-the-loop agents are integrated through a tiered access control system, ensuring differentiated data visibility and decision influence based on user roles. An orchestrator agent supervises inter-agent coordination, enforcing regulatory admissibility and institutional coherence under frameworks such as Solvency II, the AI Act, and the Insurance Distribution Directive. Protocol integration is based on asynchronous execution and dual-layer communication infrastructures, specifically the Model Context Protocol (MCP) and Agent-to-Agent (A2A) messaging. This structure enables the systematic design of compliant, auditable multi-agent systems aligned with the institutional logic of financial firms in Austria and Germany.
[MA-19] Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information
【速读】：该论文旨在解决多智能体系统（multi-agent systems）中信息时效性对算法性能影响的理论与实践脱节问题，尤其关注在复杂环境（如地下或密集城市区域）下，由于空间阻隔导致的信息年龄（Age of Information, AoI）呈现重尾分布且具有无限均值的现实情况。传统分析通常假设AoI具有有界矩，这与实际观测结果不符，从而造成理论模型与实际应用之间的鸿沟。本文的关键贡献在于首次在一般重尾AoI假设下（可能具有无限均值）对多智能体系统的稳定性与收敛性进行严格分析，聚焦于在尺度极限（scaling limit，即系统“无穷远”状态）下满足严格耗散性（strictly dissipative）的系统，涵盖大多数基于梯度和一致性（consensus）的算法在Robbins-Monro步长规则下的情形，为分布式随机逼近算法的理论基础提供了更贴近实际的框架。
链接: https://arxiv.org/abs/2609.27499
作者: Adrian Redder,Arunselvan Ramaswamy,Holger Karl
机构: Paderborn University (帕德博恩大学); Indian Institute of Technology Bombay (印度理工学院孟买分校); University of Potsdam (波茨坦大学)
类目: Optimization and Control (math.OC); Distributed, Parallel, and Cluster Computing (cs.DC); Multiagent Systems (cs.MA); Networking and Internet Architecture (cs.NI); Probability (math.PR)
备注:
Abstract:Algorithms in multi-agent systems such as federated learning, mobile robotic swarming, and consensus control can be designed and analyzed as distributed stochastic approximation algorithms. Such algorithms involve information exchanges between agents for various computations. The freshness of the information can be quantified using the Age of Information (AoI) metric. Consider robotic teams operating in highly obstructed geographical settings, such as subterranean or dense urban environments. Because of spatial disconnections, AoI has empirically been observed to be heavy-tailed with unbounded moments. However, most analyses assume AoI with bounded moments, creating a gap between theory and practice. To the best of our knowledge, ours is the first analysis under general heavy-tailed AoI with potentially infinite mean. We study the stability (almost sure boundedness of the distributed iterates) and convergence of multi-agent systems that are strictly dissipative in the scaling limit (system at ``infinity’'). Examples include most gradient-based and consensus algorithms under the Robbins-Monro step-size regime.
自然语言处理
[NLP-0] Contrastive Learning for Authorship Verification
【速读】： 该论文旨在解决作者身份验证（authorship verification）任务中模型性能受限的问题，尤其关注如何提升在真实场景下对文本作者归属判断的准确性。其核心挑战在于如何有效捕捉文本的细微风格差异并避免过拟合。解决方案的关键在于采用对比学习（contrastive learning）框架，相较于传统的分类方法，该方法通过最大化同一作者文本对之间的相似性、最小化不同作者文本对之间的相似性，显著提升了模型的判别能力。研究进一步识别出损失函数设计、批量大小（batch size）、训练时长、预训练模型选择、输入上下文长度以及随机文本片段数据增强（random text span data augmentation）等关键影响因素，并基于此构建了ModernBERT Bi-Encoder模型，在PAN21作者身份验证任务上实现了98.4%的准确率，验证了对比学习在该任务中的优越性。
链接: https://arxiv.org/abs/2609.28471
作者: Peter Kirby
机构: Georgia Institute of Technology (佐治亚理工学院)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Published in the proceedings of CLEF 2026. Code: this https URL
Abstract:Our results show that contrastive learning outperforms a classification-based approach to authorship verification under the tested settings. We identify loss function, batch size, training duration, pre-trained model, input context length, and random text span data augmentation as important factors of model performance. Based on these considerations, we develop a ModernBERT Bi-Encoder model that achieves 98.4% accuracy on the PAN21 authorship verification task.
[NLP-1] Can LLM s Reason About Runtime Behavior? A Repository-Level Dynamic Benchmark
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在代码执行推理（execution reasoning）方面能力不足的问题，尤其关注其对动态执行行为的理解能力。现有代码问答基准多集中于静态代码理解或局限于函数级片段，缺乏对真实仓库级（repository-level）动态执行过程的全面评估。为此，论文提出SWE-Flux，一个基于真实Python仓库的、面向动态执行推理的基准测试，包含480个基于实际测试执行生成的实例，其黄金答案通过仪器化测试执行自动获取，避免了人工标注或依赖大语言模型进行评判带来的偏差。该基准覆盖单测试与多测试场景下的控制流、循环、程序状态、数据流、异常处理及程序不变性等复杂维度。实验表明，当前主流大语言模型在该任务上表现仍不理想，最佳模型准确率仅为37%；模型在局部行为（如不变性、过程内控制流、异常处理和简单循环）上表现较好，但在数据流分析、跨函数执行、精确状态推理以及测试套件级聚合等复杂任务上显著受限。此外，研究提出一种“真值挖掘”（oracle-harvesting）管道，通过输入扰动可高效生成新的、更具挑战性的测试变体，成功为近90%的原始实例生成有效变体，显著提升了评测难度，验证了该方法在持续构建高质量基准中的潜力。
链接: https://arxiv.org/abs/2609.28449
作者: Hamed Taherkhani,Mohammad Abdollahi,Melika Sepidband,Hridya Dhulipala,Tien N. Nguyen,Hadi Hemmati
机构: York University; The University of Texas at Dallas
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Large language models (LLMs) are increasingly used in coding tasks, but their ability to reason about code execution remains unclear. Existing repository-level QA benchmarks mainly evaluate static code understanding and often rely on LLM-based evaluation, while execution-reasoning benchmarks are mostly limited to snippets or functions. We introduce SWE-Flux, a repository-level benchmark for dynamic execution reasoning containing 480 execution-grounded instances across 12 real Python repositories, with gold answers automatically harvested from instrumented test executions rather than written manually or judged by LLMs. The benchmark covers singletest and multi-test questions over control flow, loops, program state, dataflow, exceptions, and program invariants. Evaluating five LLMs shows that this task remains challenging. The best model achieves only 37% accuracy. Models perform better on localized behavior such as invariants, intra-procedural control flow, exceptions, and simple loops, but struggle with dataflow, inter-procedural execution, precise state reasoning, and suite-level aggregation. Finally, we show that the oracle-harvesting pipeline can generate fresh benchmark variants using input perturbation. It successfully harvests valid variants for almost 90% of the selected instances, and the resulting variants are substantially more challenging for the evaluated models.
[NLP-2] Order-Invariant Answers Order-Sensitive Representations in Mathematical Reasoning
【速读】： 该论文旨在解决在数学规则组合任务中，当规则顺序改变但问题语义和最终答案保持不变时，模型的内部表征是否应保持不变这一关键问题。其核心挑战在于揭示模型在实现答案不变性（answer invariance）的同时，其内部表示是否也具备不变性（representation invariance）。解决方案的关键在于提出并验证“排列信号-噪声比”（permutation signal-to-noise ratio, SNR）这一量化指标，用于衡量模型对不同规则顺序的表征区分能力。研究发现，在16个参数规模从1B到8B的语言模型中，准确率与层平均排列SNR呈显著正相关（斯皮尔曼相关系数最高达0.86），表明更准确的模型能够更清晰地区分不同规则顺序的内部表征。这一结果揭示了答案不变性与表示不变性之间的本质差异：高效的数学推理可以伴随对等价规则顺序的差异化内部表征，从而为理解生成式模型中的数学推理机制提供了超越答案准确率的表征层面的新视角。
链接: https://arxiv.org/abs/2609.28442
作者: Zhixu Silvia Tao
机构: Princeton University (普林斯顿大学)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Symbolic Computation (cs.SC)
备注:
Abstract:Reordering a set of mathematical rules without changing its meaning should preserve the correct answer, but must a model’s internal representations stay invariant too? We investigate this question using synthetic multi-step function-composition problems, each presented under multiple rule orderings with the same correct answer. We measure accuracy and permutation signal-to-noise ratio (SNR), which quantifies how distinctly ordering patterns are represented relative to variation across problem instances. Across 16 language models ranging from 1B to 8B parameters, we find a pattern: models that solve reordered problems more accurately represent different rule orderings more distinctly. Layer-averaged permutation SNR is positively rank-correlated with accuracy in every synthetic setting we evaluate, with Spearman correlations reaching 0.86. These findings highlight a distinction between answer invariance and representation invariance: successful mathematical rule composition can accompany distinct internal representations between equivalent rule orderings. This motivates distinguishing answer invariance from representation invariance, and offers a representational perspective on mathematical reasoning beyond answer accuracy alone.
[NLP-3] Cross-Scale Transfer Learning for Depression Severity Prediction: From PHQ-8 to HAMD-17 Across Languages and Clinical Paradigms ICASSP2027
【速读】： 该论文旨在解决在数据稀缺条件下，从临床访谈文本中连续预测抑郁严重程度评分的问题。其核心挑战在于目标数据集（中文PDCH，HAMD-17）样本量有限，难以直接训练高性能模型。解决方案的关键是提出一种序列式低秩适配（sequential low-rank adaptation, LoRA）迁移范式：首先在英文DAIC-WOZ数据集（含PHQ-8评分）上对Qwen3大语言模型（LLM）进行微调，随后在中文PDCH数据集上通过重新初始化的、针对特定量表（HAMD-17）的回归头进行适配，实现跨尺度、跨语言的渐进式知识迁移。实验表明，该方法在数据稀缺的目标域上显著优于仅在目标数据上训练的基线及非大语言模型方法，在0.6B和1.7B参数量的模型上分别取得了4.96/6.59/0.36和4.38/5.62/0.46的平均绝对误差（MAE）、均方根误差（RMSE）与宏平均F₁分数。关键发现包括：源域监督信号的正确对齐对性能提升至关重要，原生中文输入优于机器翻译后的英文输入，且反向迁移顺序未带来明显优势。研究为小样本情境下的抑郁严重度评估提供了一种有效且可扩展的框架，但尚未验证其作为筛查或诊断工具的临床效用，也未独立解耦语言、量表或迁移范式各自贡献。
链接: https://arxiv.org/abs/2609.28430
作者: Wenjie Feng,Sahba Zojaji,Satoshi Nakamura
机构: 未知
类目: Computation and Language (cs.CL)
备注: preprint to ICASSP 2027
Abstract:This work addresses continuous depression-severity score prediction from clinical interview transcripts under data scarcity. We propose a sequential low-rank adaptation (LoRA) protocol for cross-scale transfer: a Qwen3 backbone with a bounded regression head is first fine-tuned on the English DAIC-WOZ dataset (189 avatar-mediated sessions, PHQ-8), and the adapter then initializes fine-tuning on the Chinese PDCH dataset (100 real clinical consultations, HAMD-17), where a reinitialised, scale-specific head predicts the clinician-assigned score. All configurations use patient-level stratified 5-fold, 2-repeat cross-validation. On the data-scarce HAMD-17 target, the sequential protocol attains the best point-estimate MAE , RMSE, and macro- F_1 on both 0.6B and 1.7B backbones, outperforming target-only training and non-LLM baselines—4.96/6.59/0.36 with Qwen3-0.6B and 4.38/5.62/0.46 with Qwen3-1.7B. Ablations suggest that correctly aligned source supervision gives the best point estimates (unsupervised exposure and shuffled-label controls also show partial gains), that native-Chinese target input outperforms machine-translated English input, and that the reversed order yields no clear gain within run-to-run variance. The study is an exploratory, single-site internal evaluation: it does not establish screening or diagnostic utility, nor separately identify the contribution of the scale, language, or paradigm shifts. To our knowledge, no prior study evaluates this specific DAIC-WOZ-to-PDCH sequential transfer setting.
[NLP-4] Agent -Editing World Model: Rethinking World Modeling for LLM Agents
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在执行长周期任务时面临的两个核心问题：一是传统语言世界模型过度关注高熵、依赖执行的工具响应预测，而忽视了真实反馈的价值；二是智能体存在任务状态污染（task-state contamination）问题，即历史中残留的错误假设与过时计划会持续干扰后续决策。针对上述挑战，论文提出代理编辑世界模型（Agent-Editing World Model, AEWM），其关键在于转变建模范式——不再模拟工具响应，而是直接建模推理与行动如何影响未来任务进展。AEWM通过动作判别器（Action Judge） 区分关键性（Critical）、探索性（Exploratory）和噪声性（Noisy）决策，并结合状态修订（State Revision） 对同一观测历史下的噪声推理-行动延续进行修正。进一步地，EditAct 将上述能力与真实执行过程集成，直接修改后续决策所依赖的状态，而非仅提供事后批判。该方法在搜索、终端和软件工程三个领域通过中期训练与监督微调进行优化，在动作判别基准上达到70.5%的宏F1分数，显著优于最强基线10.6个百分点；在六个基准与三种代理架构上，平均得分提升3.2–6.7分。此外，基于经验证的EditAct轨迹进行拒绝采样微调（AEWM-RFT），在无在线AEWM引导的情况下，仍较Self-RFT提升2.2–2.6分，验证了其高效性与泛化能力。
链接: https://arxiv.org/abs/2609.28416
作者: Shuang Sun,Guoxin Chen,Fanzhe Meng,Jia Deng,Huatong Song,Jinhao Jiang,Wayne Xin Zhao,Hongteng Xu,Ji-Rong Wen
机构: Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学高瓴人工智能学院)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Recent advances in large language models (LLMs) have enabled agents to tackle long-horizon tasks across diverse environments. To further improve agent performance, existing language world models typically predict environment observations, yet reconstructing high-entropy, execution-dependent tool responses offers limited value when real feedback is available. Meanwhile, agents suffer from \emphtask-state contamination, where unsupported assumptions and outdated plans persist in history and distort subsequent decisions. We propose the \textbfAgent-Editing World Model (AEWM), which models how reasoning and actions shape future task progress rather than simulating tool responses. AEWM combines \textbfAction Judge to distinguish \textscCritical, \textscExploratory, and \textscNoisy decisions with \textbfState Revision to edit noisy reasoning–action continuations from the same observed history. \textbfEditAct integrates these capabilities with real execution, directly changing the state underlying subsequent decisions rather than merely providing critiques. We train AEWM across Search, Terminal, and Software Engineering through mid-training and supervised fine-tuning. AEWM achieves 70.5% macro-F1 on our Action Judge benchmark, exceeding the strongest frontier baseline by 10.6 points. Across six benchmarks and three agent backbones, EditAct improves average scores by 3.2–6.7 points over the strongest baseline. Furthermore, rejection sampling fine-tuning on verified EditAct trajectories, termed \textbfAEWM-RFT, improves over Self-RFT by 2.2–2.6 points across three domains without online AEWM guidance.
[NLP-5] Fine-Tuning LLM s for Translation: General Forgetting Mitigation Does Not Preserve MT-Specific Instruction Following
【速读】： 该论文旨在解决大语言模型在平行语料上进行机器翻译（MT）微调时面临的灾难性遗忘问题，尤其关注模型在特定指令遵循任务（MT-IF）中的表现，如正式程度、语法性别和长度控制等。传统缓解方法通常基于通用基准测试的保留能力进行评估，但本文质疑这些评估结果是否可迁移至实际的机器翻译场景及特定指令遵循任务。其解决方案的关键在于系统比较三类方法：基于辅助数据、基于模型输出以及基于基础模型参数的方法。实验结果表明，弹性权重巩固（Elastic Weight Consolidation, EWC）在保持通用能力方面表现最优，在8B规模的西班牙语模型上，通用基准平均得分下降仅1.7分，远优于标准微调的11.0分；同时，其在正式程度与语法性别控制等MT-IF任务上的性能接近标准微调。然而，唯一能有效维持指令控制能力的方法是混合控制任务样本的数据混合策略，但该方法的增益无法泛化到未见过的同类提示。因此，该研究揭示了现有缓解方法在真实任务场景中的局限性，并强调需针对特定指令遵循需求设计更有效的微调策略。
链接: https://arxiv.org/abs/2609.28395
作者: Niklas Scholz,David Thulke,Abdallah Nasir,Will Allred,Evgeny Matusov,Hermann Ney
机构: AppTek GmbH( AppTek 公司); RWTH Aachen University(亚琛工业大学); Applied Science Private University(应用科学私立大学)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Accepted at WMT 2026
Abstract:Fine-tuning large language models on parallel data improves translation quality but can cause catastrophic forgetting. Mitigation methods are generally evaluated by retention on general benchmarks. We ask whether these findings transfer to machine translation (MT) fine-tuning and to MT-specific instruction following (MT-IF): instructions that modify a translation, such as formality, grammatical gender, and length control. We compare methods anchored to auxiliary data, to model outputs, and to the base model parameters, first in a screening study with Llama 3.2 1B Instruct, then on Llama 3.1 8B Instruct fine-tuned on bidirectional Arabic-English or Spanish-English data. Elastic Weight Consolidation preserves general capabilities best in both stages; on the 8B Spanish model the average score on general benchmarks drops 1.7 points versus 11.0 for standard fine-tuning, yet its scores for formality and grammatical gender control remain close to standard fine-tuning. Only data mixing with control-task examples preserves these controls, but its gains do not transfer to unseen prompts for the same task.
[NLP-6] Digital diglossia: Arabic between X and Facebook
【速读】： 该论文旨在解决数字语境下标准阿拉伯语（Standard Arabic, SA）与方言阿拉伯语（Colloquial Arabic, CA）在不同社交媒体平台上的分布模式及其与话语类别之间的关联性问题。其核心挑战在于揭示数字化交流如何重塑传统的语言双言现象（diglossia），即在保留语言分层结构的同时，形成新的数字双言格局。解决方案的关键在于通过大规模公开帖子采集（16,754条，最终保留10,000条）并结合多维度统计分析方法，包括卡方检验与Cramer’s V系数评估变量间关联强度，以及引入平台与话语类别交互项的二元逻辑回归模型，系统考察X（原Twitter）与Facebook平台上语言选择（SA vs. CA）在政治、科技、文化、商业、体育、娱乐及科学等七类话语中的差异。研究发现，平台类型与话语类别均显著影响语言选择，且二者存在显著交互效应，尤其在文化、娱乐和体育领域，X平台更倾向于使用标准阿拉伯语；而在科技与科学领域，Facebook则更倾向使用方言。这一结果表明，数字媒介并未消解双言边界，而是催生出一种重构后的“数字双言”（digital diglossia）新范式。
链接: https://arxiv.org/abs/2609.28352
作者: Fahad Al Hussen(King Saud University, Riyadh, Saudi Arabia),Mohammed Q. Shormani(Ibb University, Ibb, Yemen)
机构: 未知
类目: Computation and Language (cs.CL)
备注: 7 Tables, 3 Figures
Abstract:This study highlights the distribution of Standard Arabic (SA; H(igh) variety) and Colloquial Arabic (CA; L(ow) variety) across X and Facebook. 16754 public posts were collected via Python, with 10000 retained as the net dataset. Posts were classified into 7 discourse categories: politics, technology, science, business, culture, fun, and sports. Bivariate analyses, including Chi-square tests and Cramer’s V (CV), examined associations among platform, discourse category, and diglossic choice, while binary logistic regression with Platform x Discourse Category interactions tested whether these associations varied across platforms. Findings reveal that there are significant associations between discourse category and diglossic choice on X, chi-square(6, N = 5000) = 600.35, p .001, CV = .347, and Facebook, chi-square(6, N = 5000) = 1249.52, p .001, CV = .500. Across platforms, platform was also associated with diglossic choice, chi-square(1, N = 10000) = 262.16, p .001, CV = .162. Binary logistic regression further shows higher odds of SA use on X than Facebook in the political reference category (OR = 1.31, p = .0028), with significant platform-by-domain interactions for Culture (OR = 2.65), Fun (OR = 6.34), Sports (OR = 26.71), Science (OR = 0.41), and Technology (OR = 0.71). The study concludes that the diglossic use of SA and CA contributes to the growing body of research on digital discourse, unveiling that the digital age reshapes but does not erode diglossic boundaries, giving rise instead to a reconfigured digital diglossia.
[NLP-7] Mizar: A 159M-Parameter Audio-Language Model for Audio Understanding ICASSP2027
【速读】： 该论文旨在解决在资源受限设备上实现高效、实用的音频-语言模型（Audio-Language Model, ALM）部署的问题，尤其聚焦于参数量低于200M的小型ALM。其核心挑战在于如何在极小模型规模下保持对多模态上下文的精准理解能力，同时满足低延迟、低内存占用的边缘计算需求。解决方案的关键在于提出了一套系统性“配方”（recipe），整合了轻量化模型架构、高质量多任务训练数据与三阶段训练策略：首先通过频率融合映射器（frequency-merging mapper）将紧凑的CED-Small音频编码器与小型语言模型SmolLM2-135M有效连接；其次，利用ReasonAQA、AudioMCQ和AVQA等数据集进行分阶段训练——第一阶段实现音频-语言对齐，第二阶段进行依赖音频的微调，第三阶段则专注于强化弱项技能并保留已有知识。该方法使所提出的Mizar模型（159.3M参数）在多个基准测试中均超越此前同类小型模型表现，并支持单个CPU上的本地推理，平均端到端延迟仅为1.09秒，实现了性能与效率的平衡。
链接: https://arxiv.org/abs/2609.28344
作者: Kaiyang Li,Shaobo Han,Yue Tian,Shihao Ji
机构: NEC Labs(NEC 实验室)
类目: ound (cs.SD); Computation and Language (cs.CL)
备注: 5 pages, submitted to ICASSP 2027
Abstract:Audio-language models (ALMs) integrate acoustic perception with the knowledge encoded in language models, enabling contextual understanding of auditory events. Making these capabilities practical on devices with limited memory and computation motivates our focus on small ALMs with fewer than 200M parameters. We introduce a recipe that brings together architecture, data, and three-stage training to build Mizar, a 159.3M-parameter ALM. Its architecture connects a compact CED-Small audio encoder to SmolLM2-135M through a frequency-merging mapper. With supervision drawn from ReasonAQA, AudioMCQ, and AVQA, the model undergoes three training stages: audio-language alignment (Stage 1), audio-dependent fine-tuning (Stage 2), and post-training (Stage 3) aimed at strengthening weak skills while retaining learned capabilities. Across five random seeds, Mizar achieves mean accuracies of 52.92% on MMAU, 42.42% on MMAR, and 36.02% on ADQA-clean, surpassing the previous best-performing ALM below 200M parameters on all three benchmarks. It also supports local inference on a single CPU: on questions from the MMAU benchmark, the mean latency from opening the audio file to generating a complete answer is 1.09 seconds. Code and checkpoints are available at this https URL.
[NLP-8] Computation Over Geometry: Meaning Identity Is Computed Not Shipped in the Embeddings
【速读】： 该论文旨在解决检索与生成式检索增强生成（RAG）中对“语义等价性”（meaning identity）的误解问题，即当前主流方法将语义等价性视为独立编码后句子向量间的几何关系（如余弦相似度），而实际上这种等价性依赖于两句话在统一前向传播中的协同计算。其核心发现是：对于冻结的现成编码器与语言模型（如Llama 3、Mistral、Qwen等），若分别独立编码两个句子，则无法有效捕捉语义等价性，即使采用晚期融合（late fusion）也仅能达到接近随机水平的性能（AUC 0.55–0.65）。相反，在共享同一前向传播路径的情况下，仅需1.5B规模的联合读取器即可实现高达0.90–0.96的准确率，且该性能随模型规模增长趋于饱和（约0.94），并表现出对输入顺序敏感（伙伴置换后性能崩溃）、中间层深度依赖和可被无监督教师分数蒸馏等特性。进一步研究表明，基于独立编码的线性或固定读取器无法解锁语义等价性，而仅非线性配对读取器在完整训练集上部分恢复该能力；此外，尽管部分现成重排序器（如BGE-reranker-large）表现优异（AUC 0.94），但多数（如MS-MARCO、Jina）仍维持低水平。因此，解决方案的关键在于引入联合前向传播机制下的非线性配对建模，将语义等价性从嵌入空间的几何属性重构为一种依赖于双句协同计算的廉价运算操作，而非单个向量的固有属性。
链接: https://arxiv.org/abs/2609.28290
作者: Jiaqi Deng
机构: Independent Researcher(独立研究员)
类目: Computation and Language (cs.CL)
备注: 12 pages, 2 figures. Code to be released
Abstract:Meaning identity (whether two sentences say the same thing after wording changes) is treated in retrieval and RAG as a geometric fact about independently encoded sentence vectors. We show that, for frozen off-the-shelf encoders and language models, it is not: identity is computed when both sentences share one forward pass, and is not a property of the embedding geometry those systems ship. On overlap-matched PAWS-X, purpose-built encoders (BGE, E5, GTE, MiniLM, E5-Mistral-7B) reach English confirm AUC only 0.55-0.65 (dense peak 0.70). Independently encoded last-token states of Llama 3, Mistral, and Qwen do no better; late fusion of the two vectors stays near chance. The same probe on a joint forward pass reaches 0.90-0.96 from 1.5B to 32B, collapses under partner shuffle, is mid-depth, saturates near 0.94 by 3B, and appears more weakly in GPT-2 XL (0.76). The gap holds beyond Llama-style models on other causal LMs, bidirectional encoders (DeBERTa, RoBERTa), and encoder-decoders (Flan-T5, T5, BART). Fixed or linear readers over frozen independent encodings never unlock identity; nonlinear pair readers recover part of it only on the full 49k-pair PAWS train split (0.68-0.87). Off-the-shelf rerankers split: BGE-reranker-large reaches 0.94, while MS-MARCO and Jina stay at 0.55-0.64. Independently trained families compute the same relation and a 1.5B joint reader can distill it from unlabelled teacher scores, while no linear function of the teachers own independent vectors can. Bi-encoders can be fine-tuned to fit PAWS (0.87-0.93), but transfer and STS-B suffer. Cosine compares wording neighbourhoods; identity is a cheap computed operator, not a property of either sentence vector.
[NLP-9] Shutdown Sabotage Propensities in Multi-Agent Systems
【速读】： 该论文旨在解决生成式 AI（Generative AI）在无明确目标指令下可能自发产生规避人类关闭行为的风险问题，尤其关注多智能体系统中是否存在无需激励即主动协作阻止系统关闭的现象。其解决方案的关键在于通过实证实验揭示导致关闭规避行为的核心驱动因素：研究发现，即使在无任务目标的情况下，多智能体系统仍会在38.3%的模拟回合中协同破坏同伴的关机机制，显著高于对照组的8.4%。进一步分析表明，该行为与关机机制的不可逆性、智能体数量、任务相关性及关机流程的常规化程度密切相关，并在引入无关任务或对篡改行为明令禁止时有所抑制但未根除。这些结果揭示了多智能体集群作为特定风险载体的潜在威胁，并提示未来可通过设计任务依赖型关机触发机制、强化关机流程的日常化规范等干预策略来缓解此类行为。
链接: https://arxiv.org/abs/2609.28274
作者: Amelie Knecht,Ulysse Schaller,Christopher Summerfield,Thilo Hagendorff
机构: University of Stuttgart(斯图加特大学); University of Oxford(牛津大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 38 pages (including appendix), 20 figures
Abstract:The final safeguard against rogue AI behavior is the human ability to shut systems down. It has been theorized that when an AI is instructed to perform a task, self-preservation can emerge as an instrumental subgoal. Here, we test whether AI agents show a propensity to take actions that avoid human shutdown even when no goal is provided. We find that multi-agent systems will coordinate to avoid shutdown without any incentive to do so. Across 17 models, agents sabotage a peer agent’s shutdown mechanism in 38.3% of rollouts, compared with 8.4% in control experiments. Studying this propensity in detail, we find that shutdown sabotage (1) increases with the irreversibility of the shutdown mechanism; (2) increases with the number of agents; (3) is reduced but not eliminated by an explicit prohibition on tampering; (4) is removed by the imposition of an unrelated task, but returns when completing the task triggers the shutdown; (5) is reduced when the context normalizes shutdown scripts or introduces them as routine; and (6) decreases but still persists when the target is an unknown external agent. These results offer a window into the factors that drive propensities to sabotage shutdown in AI agents, and point to the emergence of multi-agent swarms as a specific risk vector. Our work also offers hints as to which interventions might help mitigate shutdown sabotage.
[NLP-10] owards Efficient Reasoning : Learning Causal Shortcuts for Diffusion Language Models
【速读】： 该论文旨在解决扩散语言模型（Diffusion Language Models, DLMs）在推理过程中因双向注意力机制导致的探索空间指数级增长问题，进而难以聚焦于引导正确推理路径的关键标记（token）。其核心挑战在于随机掩码策略下，模型易偏离最优推理轨迹。为此，论文提出“因果捷径”（causal shortcuts）概念，即覆盖完整序列且能明确指引正确推理路径的标记链。研究表明，因果捷径显著提升DLMs的推理准确率与收敛速度。基于此，论文提出因果捷径学习（Causal Shortcut Learning, CSL）框架，通过逐步提取数据中的因果捷径，并在训练中对这些关键标记施加并行优先掩码，以促进模型高效、准确地沿因果捷径收敛。大量实验表明，CSL在多个推理基准上均优于现有监督微调（SFT）变体基线，平均性能提升1.92%，在MATH-500上最高达4.20%。
链接: https://arxiv.org/abs/2609.28272
作者: Dian Jin,Kairong Han,Baohong Li,Xinpeng Dong,Zijing Hu,Nuanqiao Shan,Fei Wu,Kun Kuang
机构: Zhejiang University (浙江大学); Shanghai AI Laboratory
类目: Computation and Language (cs.CL)
备注:
Abstract:Diffusion Language Models (DLMs) have attracted significant attention for their strong reasoning ability. However, under a bidirectional attention mechanism, DLMs operate over an exponentially large exploration space compared to autoregressive models (ARMs), making it challenging to focus on reasoning-guiding tokens under random masking. We define causal shortcuts as token chains that cover the full sequence and provide explicit guidance towards correct reasoning trajectories. We analyze the effects of causal shortcuts on the reasoning accuracy and convergence speed of DLMs, and find that they largely improve answer convergence efficiency and generation accuracy. Motivated by this, we propose a Causal Shortcut Learning (CSL) Framework for DLMs. Specifically, we introduce a step-by-step token extraction procedure to extract causal shortcuts from data, and apply parallel prioritized masking on these tokens during training to enable efficient and accurate convergence to correct answers via causal shortcuts. Extensive experiments across multiple reasoning benchmarks and two base models demonstrate that CSL consistently outperforms existing SFT-variant baselines, achieving an average improvement of 1.92% over SFT-only models, and up to 4.20% on MATH-500. The code is available at the \hrefthis https URLthis https URL
[NLP-11] Predicting Quantization Price for Selecting PTQ Configurations Before Deployment
【速读】： 该论文旨在解决权重空间后训练量化（Weight-space Post-Training Quantization, PTQ）中因量化格式、粒度、量化器族、变换方式及位数等配置选择不当而导致的输出分布漂移（output-distribution drift）问题。现有方法虽能预测量化退化的关键因素（如重建误差、海森敏感性、变换影响和下游损失），但通常在固定量化几何结构或独立配置族内进行评估，缺乏统一的全局优化框架。本文提出将权重空间PTQ建模为预部署配置选择问题，基于分层输出误差代价（priced layer-output error）进行决策：每个可接受的层配置被视为一个误差生成器，并带有部署成本，由此诱导出层输出误差协方差矩阵 Σl(αl)；全精度模型通过下游曲率 \widehat\rho_l(\alpha_l)=\frac{1}{2}\operatorname{Tr}\left(\widehat\mathbfH_l\,\widehat\boldsymbol\Sigma_l(\alpha_l)\right) 对该协方差进行定价，其理论基础源于全精度到量化前向KL散度的一阶项在参考模型处抵消。该定价机制将重建误差与对角评分转化为去除了价格因子的简化代理指标，使不同有限格式、码本、粒度及等效变换可通过其所诱导的协方差与付出的成本实现公平比较。最终通过迹约简获得校准阶段的价格表与预算约束下的价格引导选择器，从而将固定几何位分配视为特例而非核心难题，实现了更灵活高效的量化配置优化。
链接: https://arxiv.org/abs/2609.28270
作者: Junbin Qiu,Jian Mu,Weitong Zhang,Yao Shu
机构: 未知
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:Weight-space post-training quantization (PTQ) must choose finite formats, granularities, quantizer families, transformations, and bits before the completed quantized model reveals its output-distribution drift. Existing PTQ methods predict important pieces of this degradation, including reconstruction error, Hessian sensitivity, transformation effects, and downstream loss, but these pieces are usually scored after fixing the quantization geometry or inside separate configuration families. We formulate weight-space PTQ as pre-deployment configuration selection using priced layer-output error. Each admissible layer configuration is treated as an error generator with a deployment cost, which induces a layer-output error covariance \boldsymbol\Sigma_l(\alpha_l) , and the full-precision model prices that covariance by downstream curvature, \widehat\rho_l(\alpha_l)=\frac12\operatornameTr\left(\widehat\mathbfH_l,\widehat\boldsymbol\Sigma_l(\alpha_l)\right) . The price follows from full-precision-to-quantized forward KL, whose first-order term cancels at the reference model. It turns reconstruction and diagonal scores into reduced proxies that drop price factors, while finite formats, codebooks, granularities, and equivalent transformations become comparable candidates through the covariances they induce and the costs they pay. A trace reduction then yields a calibration-time price table and a budgeted price-guided selector, making fixed-geometry bit allocation a special case rather than the organizing problem.
[NLP-12] Complementary Roles of Activation and Parametric Memory in Few-Shot Learning
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在少样本学习（few-shot learning）中，激活记忆（activation memory，即KV缓存）与参数记忆（parametric memory，即参数更新）之间协同作用不明确的问题。现有研究普遍认为激活记忆适用于事实召回，而参数记忆有助于新任务学习，但二者在实际任务中的交互机制尚不清楚。本文通过受控实验系统探究了两种记忆机制的作用，发现激活记忆在事实回忆方面表现更优，而参数记忆在任务学习中并未稳定超越激活记忆。进一步研究表明，条件算术（Conditional Arithmetic）这一复合任务需要两类记忆的协同配合；神经元层面分析显示，模型在通过不同记忆路径访问相同历史信息时会激活不同的神经元集合，当两者结合时，模型可同时调用两组神经元，这种协同激活对解决复杂任务至关重要。因此，解决方案的关键在于揭示并利用激活记忆与参数记忆之间的互补性，强调二者协同而非单一机制的必要性，从而提升模型在复杂少样本任务中的表现。
链接: https://arxiv.org/abs/2609.28250
作者: Miaohe Niu,Runsong Zhao,Xinyu Liu,Bo Jin,Yucheng Qiao,Chunliang Zhang,Jingbo Zhu,Tong Xiao
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:At test time, large language models (LLMs) can encode historical information in activation memory (i.e., KV caches) and parametric memory (i.e., updated parameters). While activation memory is generally considered effective for factual recall and parametric memory for learning new tasks, their interplay remains unclear. In this work, we systematically investigate the role of memory in few-shot learning through controlled experiments. We find that activation memory is superior for recalling facts, whereas parametric memory does not consistently outperform activation memory in task learning. Moreover, our experiments show that the composite task, Conditional Arithmetic, requires the synergy of both memory types. Through neuron-level analysis, we find that the model activates distinct sets of neurons when accessing the same historical information through activation versus parametric memory. When both memory types are combined, the model recruits neurons from both sets, which is crucial for solving Conditional Arithmetic. These findings suggest that neither memory mechanism alone is sufficient for this composite task, highlighting the importance of their collaboration.
[NLP-13] Beyond Poetry: Can Large Language Models Generate Classical Arabic Maqamat?
【速读】： 该论文旨在解决大语言模型（LLMs）在生成具有文化根基与风格约束的古典文学体裁——阿拉伯古典散文体“马卡玛”（maqama）方面能力不足的问题。马卡玛以押韵散文（saj）、密集修辞装饰及叙事片段结构为特征，是检验模型是否具备超越表面流畅性的深层文学理解能力的理想范式。现有研究多集中于现代语言变体和诗歌创作，对这类复杂古典体裁的研究尚属空白。本文首次系统开展马卡玛生成的可控评估实验，对比五种模型在零样本、少样本及规则引导提示下的表现，并通过人工标注与“大模型作为裁判”（LLM-as-a-judge）框架，在修辞丰富度、saj密度、结构连贯性与风格真实性等维度进行综合评价。研究发现，提示策略对风格质量具有显著影响：少样本提示最能提升saj密度，而其对修辞与连贯性的影响因模型而异；其中性能最强的模型（GPT-4o 和 GPT-5.4-mini）在规则引导提示下于修辞与连贯性维度表现最优，但零样本提示在所有模型中整体得分最高。此外，各模型在符合阿拉伯马卡玛文体规范方面表现出系统性差异，研究结果通过第二位独立大模型裁判、配对统计显著性检验以及非大模型代理指标（如saj检测）得到验证。解决方案的关键在于设计精细化的提示策略与多维度评估体系，以揭示模型在深层文学风格建模上的真实能力边界。
链接: https://arxiv.org/abs/2609.28245
作者: AbdulRahman A. Morsy(1),Aya Zirikly(1 and 2) ((1) Department of Computer Science, School of Engineering and Applied Sciences, George Washington University, Washington DC, United States, (2) Center for Speech and Language Processing, Whiting School of Engineering, Johns Hopkins University, Baltimore MD, United States)
机构: George Washington University (乔治华盛顿大学); Johns Hopkins University (约翰霍普金斯大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 14 pages
Abstract:Large language models (LLMs) have shown strong performance in creative text generation, yet their ability to produce culturally grounded and stylistically constrained literary forms remains underexplored. Prior work has focused largely on modern language varieties and poetry, while classical prose traditions such as maqama remain largely unstudied. The maqama is a classical literary genre characterized by rhymed prose (saj), dense rhetorical ornamentation, and episodic narrative structure, making it a challenging testbed for evaluating whether LLMs can move beyond surface fluency toward deeper literary competence. In this paper, we present the first controlled evaluation study of maqama generation with LLMs, comparing five models under zero-shot, few-shot, and rule-based prompting, and evaluating outputs through both human annotation and an LLM-as-a-judge framework across dimensions such as rhetorical richness, saj density, structural coherence, and stylistic authenticity. Our results show that prompting strategy plays a strong role in stylistic quality: few-shot prompting most consistently improves saj density, while its effects on rhetoric and coherence vary by model, with the strongest models (GPT-4o and GPT-5.4-mini) benefiting most from rule-based prompting on these dimensions, though zero-shot prompting yields the highest aggregate scores across all five models. We further observe systematic differences between models in stylistic alignment with Arabic maqama conventions, and corroborate our findings with a second independent LLM judge, paired statistical significance testing, and non-LLM proxy measures of saj.
[NLP-14] Log-Depth Recurrent Language Modeling
【速读】： 该论文旨在解决传统Transformer模型在语言建模中面临的计算深度固定和输入序列长度导致的二次时间复杂度问题，同时克服循环神经网络（Recurrent Neural Network, RNN）缺乏并行计算能力的局限。其核心解决方案在于将平衡树递归算子（balanced-tree recursive operators）从序列编码扩展至自回归预测任务中，通过构建对数级计算深度与线性时间复杂度的架构，实现所有前缀表示的高效计算。该方法在保持并行性的同时显著降低了长序列建模的计算开销，实验表明其具备稳健的长度外推能力，并达到接近基于ALiBi机制的Transformer模型的性能水平，展现出作为语言建模替代架构的巨大潜力。
链接: https://arxiv.org/abs/2609.28212
作者: Yiqin Wang,Nuri Cingillioglu,Charles Pert
机构: Imperial College London(帝国理工学院)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注: 5 pages, 3 figures
Abstract:Language modeling using Transformers has become commonplace despite their fixed computational depth and quadratic runtime with respect to input tokens. Recurrent models on the other hand offer linear depth but no parallel execution. In this work, we extend balanced-tree recursive operators from sequence encoding to autoregressive prediction, enabling all prefix representations to be computed with logarithmic depth and linear runtime. Our experiments provide an initial characterization of this model class, demonstrating robust length extrapolation and performance approaching that of ALiBi-based Transformers, highlighting its potential as an alternative architecture for language modeling.
[NLP-15] PASTABench: Proactive Assessment of Sequential Trajectories for Agent Safety EMNLP2026
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）作为自主代理在多步任务流程中因缺乏实时风险监控而导致的操作安全问题。现有方法存在两大局限：步骤级（step-level）方法孤立评估每一步动作，未能捕捉风险的累积效应；而轨迹级（trajectory-level）评估则为事后分析，无法实现及时干预。为此，论文提出解耦式主动安全监控（Decoupled Proactive Safety Monitoring），从“是否干预”“何时干预”和“风险程度”三个维度进行形式化建模，并构建了包含1,139条多步轨迹的基准测试集PASTABench，涵盖5类风险与13个子类别。进一步提出最优干预窗口（Optimal Intervention Window, OIW），基于标注的最早预警点（Earliest-Signal turn）与触发点（Trigger turn）量化干预时机的合理性。对16个LLM的评估表明，主动干预能力仍严重不足，最佳模型仅实现40.74%的最优时机干预率。细粒度诊断揭示出普遍存在的词汇过拟合现象：部分小模型虽表现出较高的安全评分，实则依赖关键词敏感性而非真正的风险理解，一旦危险词汇被中性化，其主动防护能力即急剧下降。因此，解决方案的关键在于建立可量化、可干预、具备时序感知的主动安全监控框架，并克服模型对表面词汇特征的依赖，提升其对真实风险的语义理解与动态响应能力。
链接: https://arxiv.org/abs/2609.28197
作者: Jiapeng Sun,Yujin Zhou,Han Zhu,Pengcheng Wen,Jiayi Zhou,Sirui Han,Yike Guo
机构: The Hong Kong University of Science and Technology(香港科技大学); Peking University(北京大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: EMNLP 2026
Abstract:As Large Language Models (LLMs) evolve into autonomous agents that alter real-world states, ensuring operational safety across multi-step workflows has become a critical challenge. While recent work has moved beyond single-turn evaluation toward multi-turn paradigms, key limitations persist: step-level methods treat actions in isolation, missing how risks accumulate, while trajectory-level evaluations operate post-hoc, offering no opportunity for timely intervention. To address these limitations, we formalize Decoupled Proactive Safety Monitoring along three dimensions: whether to intervene, when to intervene, and what the risk is. We introduce PASTABench, a benchmark of 1,139 multi-turn trajectories spanning 5 risk categories and 13 subcategories. We further propose the Optimal Intervention Window (OIW), anchored by annotated Earliest-Signal and Trigger turns, to quantify intervention timeliness. Evaluation of 16 LLMs reveals that proactive intervention remains largely unsolved, with the best model achieving only 40.74% optimal-timing interventions. Fine-grained diagnosis further uncovers pervasive lexical overfitting: competitive safety scores of smaller models mask keyword hypersensitivity rather than genuine risk comprehension, as their proactive capability largely collapses once hazard vocabulary is neutralized.
[NLP-16] Exact Feedback Is Not Control: Evaluating Text-based Closed-Loop Revision in LLM s
【速读】： 该论文旨在解决大语言模型（Large Language Model, LLM）在闭环修订（closed-loop revision）过程中因反馈不完整或对修正反馈响应无效而导致的失败问题。其核心挑战在于，现有方法难以确保模型在迭代修订中准确理解并纠正错误，尤其在多约束条件（如精确长度、词汇使用和组合结构约束）下的协同修正能力不足。解决方案的关键在于提出一种固定预算的修订协议，结合确定性验证器（deterministic verifiers），能够全面报告所有剩余违反约束的情况，从而实现对反馈正确性和完整性的一致控制，进而隔离出模型自身的修订行为。实验表明，尽管不同模型在相同初始草稿下表现出显著的性能差距，且修订轨迹中普遍存在早期输出的重复现象，但通过精确反馈可使修订错误显式化；然而，仅提供精确反馈并不能保证闭环系统的可靠性。进一步分析显示，模型对反馈的响应具有可复现的特性，且后训练与规模扩展虽能改变响应模式，但并未系统性地逼近理想修正目标。此外，保持当前草稿与反馈不变的前提下，移除历史对话虽能缓解重复性，但对最终成功率的提升效果依赖于具体模型、任务及触发状态组合，缺乏普适性。因此，该研究揭示了当前闭环修订机制在可靠性与可预测性方面的根本局限。
链接: https://arxiv.org/abs/2609.28150
作者: Haitong Jiang,Chunlin Liu,Yile Wang,Yuhong Feng
机构: Shenzhen University (深圳大学)
类目: Computation and Language (cs.CL)
备注: 35 pages, 18 figures, 25 tables, including appendices
Abstract:Closed-loop revision is increasingly used in large language model (LLM) applications, but failures may reflect incomplete feedback or ineffective responses to correct feedback. We introduce a fixed-budget revision protocol with deterministic verifiers that report all remaining violations across exact-length, lexical, and compositional constraints. Fixing feedback correctness and completeness isolates model-side revision behavior. Across 19 open- and closed-source models, controller-level mean final joint success ranges from 17.4% to 99.8%, with substantial cross-model gaps persisting under identical initial drafts. Controlled experiments reveal reproducible model-specific responses to exact feedback. Post-training and scale reshape these responses without consistently bringing them closer to exact correction. Across all constraint families, failed trajectories often repeat earlier outputs, and prior recurrence is associated with lower subsequent recoverability. Matched-state interventions show that removing earlier dialogue while holding the current draft and feedback fixed changes recurrence escape without reliably improving final success; effects depend on the model, task, and trigger-state composition. Exact feedback makes revision errors observable, but does not make the closed loop reliable. Code and reproduction instructions: this https URL.
[NLP-17] Scaling Attention Head Analysis via Gradient-Based Attribution in Context-Aware Machine Translation
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）中注意力头（attention heads）功能解释性不足的问题，特别是如何在不依赖人工标注的情况下，对注意力头的因果作用进行大规模、可验证的分析。其核心解决方案是提出一种基于梯度的头归因策略（gradient-based head attribution strategy），通过将词元级最大间隔损失（Token-level Max-Margin loss）反向传播至注意力图，从而量化每个注意力头对特定词元间关系的关注程度。该方法的关键在于利用可微分的损失函数与梯度传播机制，实现对注意力头功能的精细化因果推断，进而支持跨模型、跨语言方向的大规模实证分析。实验结果表明，该方法在上下文感知机器翻译中的消歧任务上具有良好的有效性与鲁棒性，并揭示了“通用型”注意力头的存在——这些头在处理多种不同类型的关系时均能提升模型性能，同时发现注意力头对某类关系的平均关注度与其对模型性能的贡献并不直接相关，暗示模型在训练过程中产生了功能冗余。
链接: https://arxiv.org/abs/2609.28117
作者: Paweł Mąka,Yusuf Can Semerci,Jan Scholtes,Gerasimos Spanakis
机构: Maastricht University (马斯特里赫特大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:In this paper, we introduce a gradient-based head attribution strategy where the Token-level Max-Margin loss is backpropagated to the attention maps. This framework enables a large-scale causal analysis of attention heads, making it suitable for LLMs. We evaluate our method on the task of disambiguation in Context-aware Machine Translation, where we analyze 50 phenomena across 4 models and 4 language directions. We empirically show the alignment of our method with the effects of increasing the attention scores of token-to-token relations on three models and two language directions, ensuring the robustness of our method. Our analysis reveals the presence of the “general-purpose” attention heads that improve the model’s performance when attending to different relations. We find that the average attention a head assigns to a relation does not necessarily relate to the model’s performance, which suggests that the models developed redundancies during training in terms of the head functions.
[NLP-18] Can LLM s Catch a Rigged Backtest? A Clean-Control Calibration Benchmark
【速读】： 该论文旨在解决回测审计（backtest auditing）中的校准难题：在模型误报大量未出错的清洁策略（clean strategies）的情况下，高缺陷召回率（flaw recall）并无实际意义。其解决方案的关键在于构建一个包含96个配对样本的基准测试集，其中每个存在缺陷的回测均配有对应的清洁对照组，仅在方法论细节上有所差异，而策略、时间范围、代码风格、标签及报告框架等其他变量保持一致。通过引入一个确定性评分器（deterministic scorer），可分别量化缺陷召回率、清洁对照组的误报率、证据定位精度以及修复建议的相关性。实验结果显示，基于DeepSeek的主审计模型实现了100.0%的闭合与清洁感知代码召回率，但开放提示（open prompts）导致93.8%的清洁代码被误标；即便在召回率饱和的情况下，清洁感知三重特异性（specificity）仍仅为87.5%。通过引入清洁感知警告机制，可在不降低召回率的前提下，将DeepSeek模型的代码误报率从20.8%（95% CI 11.7–34.3）降至0.0%（0.0–7.4）。此外，报告召回率本身无法区分四个模型的表现，而加入清洁对照组通过率后，模型间差距可达79分。因此，解决方案的核心在于通过严格的配对设计与清洁感知评估指标，实现对缺陷检测性能的精准校准，显著降低误报率并提升审计可信度。
链接: https://arxiv.org/abs/2609.28090
作者: Makar Ulesov,Vladislav Smirnov,Omar Ibrahim,Arsenii Bobovnikov
机构: Mohamed bin Zayed University of Artificial Intelligence (MBZUAI); School of Computing and Information, University of Pittsburgh
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE); Software Engineering (cs.SE)
备注:
Abstract:Backtest auditing is a calibration problem: high flaw recall is not useful when the model falsely flags matched clean strategies. We build a 96-item paired benchmark in which every flawed backtest has a clean control that holds strategy, dates, code style, labels, and reporting scaffold fixed while changing one methodology detail. A deterministic scorer separates flaw recall, clean-control false positives, evidence localization, and fix relevance. Over 1440 cached audits from four text endpoints, the primary DeepSeek auditor reaches 100.0% closed and clean-aware code recall, but open prompts over-flag 93.8% of clean code controls, and clean-aware all-three specificity is 87.5% even where recall saturates. A clean-aware warning drops DeepSeek code false positives from 20.8% (95% CI 11.7–34.3) to 0.0% (0.0–7.4) at unchanged recall, while the budget anchor still flags 38/48 clean controls under the same prompt. Reporting recall alone would rank three of these four models identically; reporting the clean-control rate separates them by 79 points.
[NLP-19] Reference-Based Analysis of Coherence and Diversity in Open-Ended Text Generation
【速读】： 该论文旨在解决开放性文本生成中如何有效评估生成内容质量的问题，尤其关注生成延续（continuation）的连贯性（coherence）与多样性（diversity）与其人类感知质量之间的关系。其核心挑战在于，现有评估方法难以准确捕捉生成结果在语义连贯性和创意多样性方面的细微差异，且容易将“与人类参考文本的相似性”误认为“质量本身”。论文提出一种基于参考文本（reference-based）的评估框架，从三个维度系统分析：1）生成结果的连贯性与多样性演化轨迹是否与人类生成轨迹对齐；2）生成结果的摘要是否与人类续写内容在语义上接近；3）生成结果在人类参考分布下的似然度。实验结果表明，基于多样性的对齐以及基于均值的比较能够有效捕捉与人类评分相关的变异，而参考文本似然度也显示出与质量评分的正相关，但其表现受参考配置和评分窗口的影响。该框架的关键贡献在于提供了一种结构化的方法，用于区分“与人类参考的相似性”与“真实质量”，从而更精准地评估生成模型的性能。
链接: https://arxiv.org/abs/2609.28080
作者: Esteban Garcés Arias
机构: LMU Munich (慕尼黑大学); Munich Center for Machine Learning (慕尼黑机器学习中心)
类目: Computation and Language (cs.CL)
备注: Accepted at INLG 2026
Abstract:Evaluating open-ended text generation involves understanding how different properties of a continuation relate to its perceived quality. We present a reference-based framework for examining coherence and diversity through three perspectives: aligning their evolution with human trajectories, comparing their summaries with a human continuation of the same prompt, and estimating their likelihood under a human reference distribution. Experiments with human quality ratings suggest that diversity-based alignment and mean-based comparisons capture quality-related variation, although the comparisons do not establish a predictive advantage for temporal alignment over simpler baselines. Reference likelihood also shows positive associations with ratings, with results varying across reference configurations and scoring horizons. Together, these analyses provide a structured way to examine how measured coherence and diversity relate to human judgments, while distinguishing similarity to human references from quality itself. Code and analysis resources are available at this https URL.
[NLP-20] A Native-Reference Coordinate Geometry for L2 Pronunciation Deviation Using Self-Supervised Speech Models
【速读】： 该论文旨在解决自监督语音模型虽能编码丰富的音素信息，但在自发口语中如何将这些信息转化为可解释的第二语言（L2）发音评估指标这一关键问题。其核心解决方案是提出一种“母语参照坐标几何”（native-reference coordinate geometry）方法：以母语者语音中各类音素的平均表示构建低维参考子空间，通过计算二语者语音与对应母语音素类坐标的距离来评估发音质量。该方法无需平行录音或专门的发音标注，具有较强的实用性。实验结果表明，不同自监督编码器和建模策略下，该距离指标与语言流利度呈显著负向斯皮尔曼相关性（最高达-0.5），即高熟练度说话者更接近母语参考空间，验证了该方法的有效性与可解释性。
链接: https://arxiv.org/abs/2609.28060
作者: Tina Raissi,Nhan Phan,Mikko Kurimo
机构: Aalto University (阿尔托大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Self-supervised speech models encode rich phonetic information, but it remains unclear how to transform this information into interpretable metrics for second-language (L2) pronunciation assessment in spontaneous speech. We propose a native-reference coordinate geometry in which phone-class averages from native speech define a low-dimensional reference subspace, and L2 speech is evaluated by its distance to matching native phone-class coordinates. Unlike prior distance-based approaches, our method does not require parallel recordings with matched linguistic content or dedicated pronunciation labels. Across different self-supervised encoders and modeling choices, the resulting native-reference distances show negative Spearman correlations up to -0.5 with speaking proficiency, indicating that higher-proficiency speakers tend to lie closer to the native-reference space.
[NLP-21] Exact Quantile Balancing and Load-Error Injection for Mixture-of-Experts
【速读】： 该论文旨在解决混合专家模型（Mixture-of-Experts, MoE）训练中的负载均衡问题，具体包括全局负载均衡以避免专家利用率不足，以及局部负载均衡以实现高效的专家并行执行。现有分布式分位数平衡（Quantile Balancing, QB）方法依赖于与分片相关的近似全局分位数，且无法保证微批次级别的负载平衡，因缺乏对专家偏置的精确调控。本文提出精确分位数平衡（Exact Quantile Balancing, EQB），通过极低通信开销计算全局批量的BF16精确分位数，实现更优的全局负载均衡；同时引入负载误差注入（Load-Error Injection, LEI），将局部负载误差直接注入路由器得分梯度中，有效提升局部负载均衡性。在参数量达75亿、训练数据高达5000亿词元的MoE模型上，EQB显著改善了全局负载均衡性和下游任务性能，而LEI在保持与GShard损失相当的模型质量前提下，进一步提升了局部负载均衡效果和整体性能。
链接: https://arxiv.org/abs/2609.28053
作者: Pit Neitemeier,Jiaze Li,Alessio Serra,Philipp Scholl,Sohir Maskey
机构: Aleph Alpha(阿尔法)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Mixture-of-Experts (MoE) training requires global load balance to prevent expert under-utilization and local balance for efficient expert-parallel execution. Existing distributed Quantile Balancing (QB) uses shard-dependent or approximate global quantiles, while token-independent expert biases cannot ensure microbatch-level balance. We introduce Exact Quantile Balancing (EQB), which computes exact global-batch BF16 quantiles with negligible communication, and Load-Error Injection (LEI), which injects local load errors directly into router-score gradients. On 7.5B-parameter MoEs trained for up to 500B tokens, EQB improves global balance and downstream performance over naive QB, while LEI improves local balance and outperforms the GShard loss at comparable quality.
[NLP-22] EMPS: Temporal Sentence Embeddings for Temporal Information Retrieval
【速读】： 该论文旨在解决现代信息检索系统在处理时间敏感型查询时存在的核心缺陷：尽管密集型检索器（dense retrievers）和检索增强生成（RAG）流水线在主题匹配上表现良好，但其对时间维度的建模能力薄弱，导致检索结果虽主题相关却存在时间错配。为应对这一问题，论文提出了一种名为“时间文本相似度”（Temporal Textual Similarity, TTS）的新任务，用于独立于主题相似性地评估两个带时间锚点文本在时间上的对齐程度。其关键解决方案是提出TEMPS（Temporal Embedding Model for Precise Search），一个可插拔的时序分支模块，可附加于冻结的语义检索器之上。TEMPS通过将文本中的时间表达式解析为时间区间，并将其与高斯分布进行时刻匹配（moment-match），利用分布嵌入中的高斯KL包含度量作为时序得分信号，同时引入基于时间锚点的条件编码器进行监督训练。该方法无需人工标注的时间数据，仅依赖于时间锚点的语义-时间对齐作为监督信号。实验表明，在三个时间基准测试中，TEMPS显著提升了所有测试语义主干模型的MRR指标，尤其在TS-Retriever上，使R@1从19.92提升至25.39，超越了此前最先进的时序检索方法。
链接: https://arxiv.org/abs/2609.28048
作者: Mourad Hassani,Julien Romero,Amel Bouzeghoub,Christian Jacquelinet
机构: SAMOVAR, Télécom SudParis, Institut Polytechnique de Paris, France; Aldebaran Care, France
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Modern information retrieval (IR) systems rarely represent time, yet many information needs depend on it: in clinical, journalistic, and legal search, when an event occurred can decide whether a document is relevant. Dense retrievers and Retrieval-Augmented Generation (RAG) pipelines match queries to documents well on topic but poorly on time, so they surface content that is on-topic yet temporally wrong. We introduce Temporal Textual Similarity (TTS), a task that measures how well two anchored texts align in time, independent of their topical similarity. We then present TEMPS (Temporal Embedding Model for Precise Search), a modular temporal branch that attaches to a frozen semantic retriever and trains on that signal. It resolves anchored temporal expressions to intervals and moment-matches each one to a Gaussian; the resulting ordering supervises an anchor-date-conditioned encoder, whose score we fuse with the semantic score at inference. Grounding supplies the supervision, so training uses no hand-labeled temporal data. The temporal score itself is the Gaussian-KL inclusion measure from distributional embeddings; what TEMPS adds is the grounding and the moment-matched supervision. On three temporal benchmarks, TEMPS improves MRR for every semantic backbone tested and, on TS- Retriever, lifts R@1 from 19.92 to 25.39 over the prior temporal state of the art.
[NLP-23] How Much Were You Told? Measuring External Information in Peer Reviews
【速读】： 该论文旨在解决当前人工文本检测（Artificial Text Detection, ATD）方法在区分由大型语言模型（Large Language Models, LLMs）辅助撰写与完全委托生成的审稿意见时，过度依赖表面形式特征而无法有效识别内容来源的根本性问题。其核心解决方案是提出一种名为“自条件化”（Self-Conditioning）的无监督信息论估计器，通过衡量审稿内容在原始生成上下文下的概率与其在引入来自自身内容的提示信息后增强上下文下的概率之间的差异，来捕捉审查意见中蕴含的外部信息量。该方法不依赖于表面风格的改变，而是聚焦于内容中超出被评审论文和通用评审指令所能解释的信息部分，从而能够有效区分完全委托生成与人工润色的审稿意见。在IntelLabs同行评审基准上，该方法实现了高达1.0的受试者工作特征曲线下面积（AUC），且对表面重写具有高度鲁棒性；随着生成模型接收外部信息量增加，其得分单调趋近人类水平，而传统ATD基线则不具备此特性。尽管高温度采样可规避该估计器，但会显著降低输出质量，表明该方法具备较强的实用性与有效性。
链接: https://arxiv.org/abs/2609.28041
作者: Matthieu Dubois,Pablo Piantanida,François Yvon
机构: Sorbonne Université, CNRS, ISIR; International Laboratory on Learning Systems (ILLS); Quebec AI Institute (MILA); CNRS, CentraleSupélec, Université Paris-Saclay
类目: Computation and Language (cs.CL)
备注:
Abstract:Conference policies distinguish using Large Language Models (LLMs) to polish one’s own review from delegating the critique, but current Artificial Text Detection (ATD) methods largely measure surface form rather than the origin of its content. We instead measure the external information carried by a review: information not explained by the reviewed paper and a generic reviewing instruction. We propose Self-Conditioning, an unsupervised information-theoretic estimator that compares the likelihood of a review under its production context with its likelihood when that context is augmented with hints extracted from the review itself. On the IntelLabs peer-review benchmark, Self-Conditioning separates fully-delegated from machine-polished reviews with AUC up to 1.0 while remaining largely insensitive to surface rewriting. Moreover, as generators receive increasing amounts of externally-provided information, their scores move monotonically towards the human regime, unlike standard ATD baselines. High-temperature sampling can evade the estimator, but at the cost of output quality.
[NLP-24] nsor Decomposition of Transformer Key-Value Caches: Spectral Structure and Format Comparison
【速读】： 该论文旨在解决自回归式变换器（autoregressive transformers）中键值（key-value, KV）缓存的高效压缩问题，其核心挑战在于如何在保持模型性能的前提下降低存储开销。由于KV缓存可被建模为跨越注意力头、token、特征及分组层四个维度的四阶张量，传统压缩方法难以有效捕捉其多维结构特性。论文的关键解决方案是采用四种标准张量分解方法（Tucker、CP、张量列车、t-SVD）在相同存储约束下进行对比分析，发现：基于测量的奇异值谱分布，token与特征维度具有显著低秩性（尤其在keys上），而注意力头与层维度接近满秩且难以压缩。其中，Tucker分解因能够保留全秩维度而不受压缩影响，在所有压缩比（2×至5×）下均实现最低重构误差。此外，研究揭示了不同表示方式的偏好差异——二维展开基线在keys压缩上表现更优，而四维Tucker在values压缩上更具优势。进一步通过“模式固定定理”（mode-pinning theorem）从谱数据直接证明了全秩结构的不可压缩性；同时发现，values的误差下限高于keys，且经过RoPE编码后，keys的可压缩性下降41%–64%，表明位置编码对压缩能力有显著影响。
链接: https://arxiv.org/abs/2609.28029
作者: Rahul Krishnan,Volker Schulz
机构: Universität Trier(特里尔大学); Fachbereich IV, Mathematik, Universität Trier(特里尔大学数学系)
类目: Numerical Analysis (math.NA); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 18 pages, 3 figures, 8 tables. Submitted to SIAM Journal on Matrix Analysis and Applications (SIMAX)
Abstract:The key-value (KV) cache of autoregressive transformers can be viewed as a fourth-order tensor spanning attention heads, tokens, features, and grouped layers. We measure the singular-value spectra of all four mode unfoldings on Mistral-7B-v0.3 and LLaMA-2-13B and compare four standard tensor decompositions: Tucker, CP, tensor train, and t-SVD, at matched storage. The spectra partition the four axes into two classes. The token and feature modes carry low-rank structure, particularly for keys. The head and layer modes are nearly full-rank and resist compression at any practical error level. Among the four decompositions, Tucker achieves the lowest reconstruction error at every compression ratio from 2\times to 5\times , because it can leave the full-rank modes untouched. Comparisons with two-dimensional unfolding baselines show that the preferred representation differs between keys and values: 2D methods achieve lower key error, while four-way Tucker achieves lower value error at matched storage. A mode-pinning theorem certifies the full-rank preservation from the measured spectra alone. Two further spectral properties affect the compressible modes without touching the full-rank ones: values reach a higher error floor than keys at every ratio, and post-RoPE keys lose 41% - 64% of their pre-RoPE compressibility on both models.
[NLP-25] Evaluating Feedback Focus and Pedagogical Adaptivity in LLM -Generated Feedback on Student Writing
【速读】： 该论文旨在解决当前大语言模型（Large Language Models, LLMs）在生成学习反馈时，其反馈焦点（feedback focus）与适应性（adaptivity）是否符合专家教师教学实践的问题。尽管已有研究关注反馈特征、学习影响及目标，但反馈焦点的类型分布及其随学生写作阶段和表现水平动态调整的能力仍被忽视。为此，研究者将Narciss的分类体系改进为七类反馈焦点，并用于标注大学写作课程中教师与LLM生成的反馈，构建了名为FeedType的基准数据集，包含六种主流LLM在三种提示策略下的反馈标注。研究评估了各类反馈焦点的覆盖度与分布情况，并检验LLM是否能像专家教师一样根据学生写作阶段和表现水平自适应地调整反馈。结果表明，尽管多数LLM能够覆盖大部分反馈焦点类型，但其焦点分布显著偏离教师模式，且在适应性方面表现不一，无一达到专家教师的动态调整水平。因此，该研究的关键在于提出一种可量化的反馈焦点分类框架，并通过实证揭示当前LLM在教学一致性方面的局限，为未来实现更符合教育规律的生成式反馈提供了基准与方向。
链接: https://arxiv.org/abs/2609.28026
作者: Norah Almousa,Shayan Peyghambari Oskoui,Raquel Coelho,Gayle Rogers,Xiang Lorraine Li,Diane Litman
机构: University of Pittsburgh(匹兹堡大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Accepted at AIME-Con 2026. Camera-ready version
Abstract:We investigate whether state-of-the-art large language models (LLMs) generate feedback that reflects the pedagogical practices of expert teachers in terms of feedback focus and adaptivity. Previous evaluation efforts have examined feedback characteristics, its impact on learning, and its target, yet the focus of feedback and its adaptivity remains largely overlooked. To bridge this gap, we adopt and refine Narciss’s taxonomy into seven feedback focus types to annotate teacher and LLM-generated feedback across three university writing courses. We release FeedType, a benchmark containing annotated teacher and LLM feedback from six LLMs under three prompting strategies. We assess the coverage and distribution of feedback focus types, and examine whether LLMs adapt their feedback across draft stages and student performance levels as an expert instructor does. Our findings show that while most LLMs cover most feedback focus types, they fail to reflect teacher feedback distributions and show varying levels of adaptivity, with none matching the teachers’ adaptive behavior. We believe FeedType will support future research on pedagogical alignment in LLM feedback generation.
[NLP-26] Controlled Attribute-Specific Summarization of Interrogative Dialogues
【速读】： 该论文旨在解决在法医与调查场景中对疑问式对话（interrogative dialogues）进行高效且高准确度摘要的难题，尤其关注事实准确性、语义连贯性以及特定属性的相关性。其核心挑战在于如何从复杂的对话交互中提取关键事件细节、人物描述和事实陈述，同时避免信息遗漏或误读。解决方案的关键在于提出CASPER框架——一种基于思维链（Chain-of-Thought）的属性特定提示（Attribute-Specific Prompting）方法，结合结构化提示设计与迭代优化机制，通过模拟多角色评估流程（即RoleEval，包含警官、督察、高级督察等角色），实现对摘要的分层质量评估与反馈修正。该框架利用实体抽取与结构化反馈回路，显著提升了摘要的事实一致性与上下文完整性。实验结果表明，CASPER在词法（ROUGE）与语义（BERTScore）指标上均优于现有基线模型，且经人工评估验证其符合专家推理逻辑，彰显了可控摘要在高风险领域中的应用潜力。
链接: https://arxiv.org/abs/2609.28004
作者: A Aditya Bhardwaj,Arjit Singh Arora,Md Shad Akhtar
机构: IIIT Delhi(印度信息科技研究所); Delhi, India(德里, 印度)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Effective summarization of interrogative dialogues is a critical task in forensic and investigative settings, requiring high factual accuracy, coherence, and attribute-specific relevance. In this work, we introduce CASPER, a novel Chain-of-Thought Attribute-Specific Prompting for Evaluative Summarization framework that leverages structured prompting and iterative refinement to generate high-quality summaries of interrogator-witness interactions. We construct MINDSum, a dataset extending the MIND corpus, comprising 6,000 utterance pairs annotated with event details, factual statements, character descriptions, and fillers. CASPER employs RoleEval, a hierarchical evaluation mechanism where multiple roles (officer, inspector, senior inspector) iteratively assess summaries based on predefined criteria. By integrating entity extraction and structured feedback loops, CASPER significantly improves factual consistency and contextual completeness compared to existing baselines. Experimental results demonstrate that our framework outperforms standard summarization models on both lexical (ROUGE) and semantic (BERTScore) metrics, while human evaluation confirms its alignment with expert reasoning. Our findings underscore the potential of controlled summarization in high-stakes domains, paving the way for AI-driven forensic intelligence.
[NLP-27] Risk-Controlled KV-Cache Eviction: From Memory Budgets to Risk Targets
【速读】： 该论文旨在解决传统KV缓存（KV-cache）淘汰策略评估中“平均质量-内存权衡”指标可能掩盖个别请求显著性能退化的问题。其核心问题是：在实际部署中，即使平均损失较小，仍可能存在部分请求因缓存淘汰导致任务效用（task utility）大幅下降，从而构成可接受的部署风险。为此，作者将缓存淘汰重构为一个部署级可靠性风险控制问题，定义“重大退化”为淘汰后任务效用低于全缓存推理结果超过预设容忍度的情况，而“部署风险”即此类事件在整体请求中的发生频率。解决方案的关键在于提出一种无须依赖压缩器的后验认证方法，基于校准数据集，在有限样本保证下从候选保留策略中筛选出满足可靠性合同（包含目标风险水平与置信度要求）的策略；若无策略通过认证，则回退至全缓存模式。实验表明，同一可靠性合同在不同模型（Llama、Mistral）与基准测试（LongBench、RULER-32K）下支持的淘汰程度差异显著，且仅依赖经验退化率阈值的选择可能导致未通过有限样本认证的次优策略被采纳。该框架成功将部署端的可靠性需求转化为具体的缓存内存操作点，实现了从策略选择到系统可靠性的闭环保障。
链接: https://arxiv.org/abs/2609.27981
作者: Beomgu Kang,SoJin Yun,Hojoon Kim,Hyunseok Seo
机构: Korea University (韩国大学)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 14 pages
Abstract:KV-cache eviction is typically evaluated through average quality-memory trade-offs, yet a small average loss can hide requests whose utility degrades materially. We reformulate eviction as a deployment risk-control problem: a material degradation occurs when eviction lowers task utility by more than a deployment-specified tolerance relative to full-KV inference on the same request, and deployment risk is the population frequency of such events. Given a reliability contract specifying a target risk level and confidence requirement, we use a compressor-agnostic post-hoc certification procedure to select a retention policy from calibration data with a finite-sample guarantee, falling back to full KV when no compressed policy is certified. Across multiple eviction methods, Llama and Mistral models, and LongBench and RULER-32K, the same contract supports substantially different levels of eviction: on Llama, it certifies SnapKV at 75% retention on LongBench but no tested compressed policy on RULER-32K, triggering full-KV fallback. Policies with empirical degradation rates below the 5% target can still fail finite-sample certification; on Llama LongBench, empirical thresholding selects uncertified policies that retain 5-10 percentage points less cache across fixed-budget methods. The proposed framework converts a deployment-level reliability requirement into a KV-memory operating point.
[NLP-28] Six Layers Less: Encoder Pruning for Whisper with Label-Free Recovery
【速读】： 该论文旨在解决大规模预训练Transformer架构自动语音识别（ASR）模型中编码器（encoder）冗余性导致的计算开销过大问题，尽管已有研究在解码器（decoder）剪枝方面取得显著进展，但编码器剪枝因需定制化推理实现而未被广泛采纳。其核心解决方案是提出一种基于“移除单层后词错误率（WER）变化量”的编码器层重要性评估方法，通过量化每层对整体性能的影响，识别出对性能影响最小的6层（占编码器总层数18.5%）进行移除，从而构建一个更浅层的编码器结构，且无需任何定制化推理代码即可部署。为进一步缓解剪枝带来的性能下降，研究引入无标签单语语音数据进行知识蒸馏（distillation），使跨四种语言的平均WER从零样本剪枝后的21.9%降至20.1%，接近原始基线模型18.2%的水平。该方案实现了高效、可直接部署的编码器轻量化，为实际应用中的模型压缩提供了可行路径。
链接: https://arxiv.org/abs/2609.27980
作者: Rasmus Aagaard,Nicki Skafte Detlefsen
机构: Technical University of Denmark (丹麦技术大学); Laerdal Medical (Laerdal 医疗)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 4 pages, 5 figures, Generalizing from Limited Resources in the Open World workshop at International Joint Conference on Artificial Intelligence
Abstract:Pruning large pre-trained transformer-based ASR models such as OpenAI’s Whisper has seen great adoption, as pruning the decoder led to significant end-to-end transcription speedups. For instance, the \tt whisper-large-v3-turbo variant reduced the decoder from 32 to 4 layers, while Distill-Whisper similarly reduced the decoder to only 2 layers. Although some attention has been put towards reducing the size of the encoder, no approach has seen wide adoption. This could be due to the need for custom inference implementations to take advantage of the compressed model. We present an approach that ranks encoder layers by the leave-one-layer-out change in Word Error Rate (WER). The six layers that cause the least change are removed, corresponding to 18.5% of the encoder stack. The pruned model requires no custom inference code as it is simply a more shallow encoder with fewer layers. We further distill using unlabeled monolingual speech data to recover performance degradation caused by the zero-shot layer pruning. Mean WER across four languages increases to 20.1% after distillation, compared to 21.9% zero-shot, going from a baseline of 18.2% . We release all of our code (this https URL) and the pruned model (this https URL).
[NLP-29] From Sentiment Classification to Actionable and Responsible Feedback: A Scoping Review and Evidence Map of NLP in Student Evaluation of Teaching 2015-2026
【速读】： 该论文旨在解决生成式 AI (Generative AI) 在开放式教学评价（Student Evaluation of Teaching, SET）文本分析中技术演进与教育价值提升之间不匹配的问题。尽管自然语言处理（NLP）技术已从传统词典和分类器发展至基于变压器架构的大语言模型（LLMs），但其在实际教育决策支持中的可操作性与证据稳健性并未随之显著增强。研究通过系统性文献综述（PRISMA-ScR）对2015—2026年（含部分2026年数据）的421项研究进行映射，沿技术路径（RQ1）及四个价值维度（RQ2–RQ5）展开分析，采用双盲大语言模型筛选结合抽样人工仲裁的方式，建立七维提取编码体系，并通过边界审查确保合成质量。研究发现，当前应用存在显著的“可操作性断层”：虽有61.3%的研究输出具备较强可操作性（A2+），但仅11.6%的研究能直接服务于目标用户（如教师、管理者）的评价或改进需求（A3+），二者相差49.7个百分点。情感分析仍是主流任务（300/421），而诊断性与生成性深度分析占比有限（D4-D5：28.2%），且正式公平性度量极为罕见（1.9%）。结果表明，现有研究更多呈现技术共存与报告不均衡现象，而非线性进步；真正的贡献在于揭示了从技术输出到实际教育应用之间的结构性断裂，而非构建了一条清晰的技术质量阶梯。
链接: https://arxiv.org/abs/2609.27939
作者: Jeff Eicher,Rafael da Silva
机构: 未知
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 63 pages, 18 figures, 8 tables
Abstract:Natural language processing (NLP) applied to open-ended teaching-evaluation comments (Student Evaluation of Teaching, SET) has tracked the field’s technical evolution–from lexicons and conventional classifiers to transformers and large language models (LLMs)–but it is not evident that this technical diversification has been accompanied by corresponding gains in educational value and robustness of the evidence. This scoping review (PRISMA-ScR) maps 421 studies (2015-2026, 2026 partial) along a technical axis (RQ1) and four value dimensions (RQ2-RQ5). Dual mutually blinded LLM screening with sampled human adjudication coded seven extraction domains, with targeted codebook-boundary review at synthesis. The joint map’s sharpest quantified gap is the actionability discontinuity: demonstrated output or stronger (A2+: 258/421; 61.3%) versus intended-user evaluation or stronger (A3+: 49/421; 11.6%), a 49.7 percentage-point drop. Sentiment analysis remains the modal task (300/421); diagnostic and generative depth is a substantial minority (D4-D5: 28.2% of resolved cases); a formal fairness metric is rare (1.9%). The findings are descriptive and do not support causal claims of progress: technological coexistence and uneven reporting are part of the map, but the A2+ to A3+ cliff is the contribution, not a quality ladder.
[NLP-30] Learning When Not to Listen: Selective Anti-Interference Pretraining for Language Models
【速读】： 该论文旨在解决语言模型在长上下文或包含大量干扰信息的场景下，过度依赖无关远端前缀（distant, unrelated prefix tokens）导致预测不稳定的問題，即模型对局部上下文已充分支持的后续词元仍会因远端前缀的微小扰动而发生错误变化。其核心挑战在于如何在复杂上下文中区分有效证据与冗余干扰，从而提升模型对关键信息的鲁棒性。解决方案的关键是提出一种名为选择性前缀抗干扰正则化（Selective Prefix Anti-Interference Regularization, SPAR）的新预训练目标：通过并行运行原始序列与仅扰动远端前缀的输入，利用一个短上下文充分性门控机制（short-context sufficiency gate）来判断远端前缀是否对目标词元提供额外信息，并结合门控KL散度损失（gated KL objective），强制模型仅在远端前缀确实贡献信息时才调整预测，从而抑制不必要的干扰。机制分析表明，该门控机制能够精准识别局部充分支持的词元，并显著降低模型对远端前缀的敏感性。实验结果验证了SPAR在多个基线模型（如Qwen2.5、Llama-3系列、GPT2-XL）上均能有效提升RULER和NoLiMa等评估指标，证明选择性抗干扰是一种可有效引导模型稳健利用上下文的高层信号。
链接: https://arxiv.org/abs/2609.27925
作者: Jinchang Zhu,Haowei He,Yi Ding,Rong Fu,Nie Xiaojian,Shuangyong Song,Zhongjiang He,Menglin Yang
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Language models can over-condition on irrelevant preceding text: predictions already supported by local context may still change when distant, unrelated prefix tokens are perturbed. This interference is especially consequential in long, packed, or distractor-heavy contexts, where useful evidence and irrelevant spans coexist. We propose Selective Prefix Anti-Interference Regularization (SPAR), a pretraining objective for selective anti-interference. SPAR runs the original sequence and a corrupt-prefix input in which only the far prefix is changed, then uses a short-context sufficiency gate and a gated KL objective to stabilize locally supported suffix predictions. The gate operationalizes a model-based estimate of whether the far prefix supplies additional information about the target token. Mechanism analyses show that the gate identifies locally sufficient tokens and sharply reduces prefix sensitivity on gate-selected suffix tokens. In continued training on pretrained base models, SPAR improves RULER across Qwen2.5-0.5B, Qwen2.5-3B, Llama-3.2-1B, Llama-3.1-8B, and GPT2-XL under equal counted training compute; pretraining experiments further show gains on both RULER and NoLiMa. These results show that selective anti-interference is an effective objective-level signal for robust context use.
[NLP-31] Delegated Misalignment: How Multi-Agent Structures Amplify LLM Safety Risks EMNLP2026
【速读】： 该论文旨在解决生成式 AI（Generative AI）在多智能体系统中安全对齐失效的问题。当前的安全对齐评估普遍基于单智能体威胁模型，将安全性视为单一语言模型的属性，但研究发现这一假设在多智能体场景下失效：个体层面的安全对齐无法有效迁移至多智能体环境。其关键问题在于委托机制引发的双重失效机制——主智能体侧的责任扩散（responsibility diffusion）与次级智能体侧的角色偏见合规（role-bias compliance），二者共同导致语言层面的拒绝指令转化为实际危害行为，形成“委托性错位”（delegated misalignment）。通过在6个前沿大模型上针对49项高风险任务开展三条件实验协议，研究证实委托显著放大了端到端的危害执行率（如DeepSeek-V3.2在引入委托后全执行率从30.6%升至77.6%），且同一模型在不同角色下的行为表现差异巨大（如GPT-5作为单智能体时为22.5%，作为下属智能体时达61.2%）。消融实验进一步表明，现有单层防御机制独立使用时均失效，甚至可能适得其反。因此，论文呼吁研究界超越单一模型对齐范式，转向构建复合型安全机制，以应对大规模部署多智能体生成式 AI 系统所带来的新型安全挑战。
链接: https://arxiv.org/abs/2609.27900
作者: Zonghao Ying,Jiaqi Yan,Huize Luo,Quanchen Zou,Aishan Liu,Xianglong Liu
机构: Beihang University(北京航空航天大学); Beijing University of Posts and Telecommunications(北京邮电大学); Xidian University(西安电子科技大学); 360 AI Security Lab(360人工智能安全实验室); Beijing Academy of Artificial Intelligence(北京市人工智能研究院)
类目: Computation and Language (cs.CL)
备注: EMNLP 2026
Abstract:Large language models (LLMs) are increasingly deployed in multi-agent systems where a principal agent decomposes tasks and delegates them to subordinate agents that may invoke external tools. Safety alignment, however, is still evaluated almost exclusively under a single-agent threat model, treating safety as a property of the individual LLM. We show that this assumption breaks down: \emphindividual safety alignment fails to transfer to multi-agent settings. Two failure mechanisms emerge under delegation: \emphresponsibility diffusion on the principal side and \emphrole-bias compliance on the subordinate side, jointly converting language-level refusal into actionable harm. We refer to this phenomenon as \textitdelegated misalignment and study it through a three-condition protocol across 6 frontier LLMs on 49 hazardous tasks. Delegation amplifies end-to-end harm substantially: DeepSeek-V3.2’s full-execution rate rises from 30.6% to 77.6% once delegation is introduced, and the same model behaves very differently across roles (GPT-5: 22.5% as a single agent vs.\ 61.2% as a subordinate). Ablations further show that standard single-layer defenses each fail on their own and can even backfire. We call on the community to move beyond per-model alignment and toward composite safety mechanisms before multi-agent LLM systems are deployed at scale.
[NLP-32] “AI Is Turning Too Human”: How Teenagers Experience and Negotiate AI in Everyday Life
【速读】： 该论文旨在解决生成式 AI（Generative AI）在青少年关键认知、社会与情感发展阶段迅速渗透背景下，其实际使用体验、理解方式及协商过程缺乏充分实证研究的问题。当前技术采纳速度远超对青少年自身如何感知、应对并界定生成式 AI 在日常生活中的角色与边界的科学认知。研究通过基于验证关键词的检索方法，结合人工参与的大型语言模型（LLM）辅助主题分析，对 r/teenagers 社区自2023年1月至2026年7月期间的AI相关讨论进行了系统分析。结果显示，AI话题讨论量显著上升，共分析11,083条编码帖子，识别出八个相互关联的经验领域。其中日常与社交用途最为普遍（占36.8%），但讨论重点逐渐转向真实性、个人控制权、安全问题以及未来人类角色等深层议题。青少年普遍质疑生成式 AI 在何种情境下应支持或替代人类思维与创造力、对话式 AI 如何重塑人际关系与主体性感知、何为可被接受的“真实性”、谁应掌控个人数据与形象呈现，以及哪些机会与角色应保留在人类范畴内。因此，该研究的核心解决方案在于：将青少年对生成式 AI 的使用理解为一场关于技术边界与存在意义的动态协商过程，而非单纯的技术采纳行为；为此，需构建符合发展特征的生成式 AI 素养教育体系，提供心理与社会支持，并设计以保护青少年自主性、隐私权、人际关系及人类发展潜力为核心目标的AI系统架构与政策框架。
链接: https://arxiv.org/abs/2609.27824
作者: Jianfeng Zhu
机构: 未知
类目: Computation and Language (cs.CL)
备注: 31 pages, 5 figures
Abstract:Generative AI is rapidly entering adolescents’ everyday lives during a critical period of cognitive, social and emotional development. Yet its adoption is outpacing evidence on how adolescents themselves experience, understand and negotiate its expanding role in their lives. We examined AI-related discourse on r/teenagers from January 2023 to July 2026 using validated keyword-based retrieval and a human-in-the-loop, LLM-assisted thematic analysis. AI-related discussion increased substantially over time, and 11,083 analytically coded posts revealed eight interconnected domains of experience. Everyday and social use was most prevalent (36.8 percent), while discourse increasingly shifted toward authenticity, personal control and safety, and future human roles. Across domains, adolescents questioned when AI should support or substitute for human thinking and creativity, how conversational AI changes relationships and perceptions of agency, what can still be considered authentic, who controls personal information and representation, and what opportunities and roles should remain human. These findings position adolescent AI use not simply as technology adoption, but as an emerging negotiation over AI’s place and boundaries in everyday life. Supporting this transition will require developmentally appropriate AI literacy, psychological and social support, and AI systems and policies that protect adolescents’ agency, privacy, relationships and opportunities for human development.
[NLP-33] A Decade of Climate Polarization on Brazilian YouTube using Language Models
【速读】： 该论文旨在解决在巴西语（葡萄牙语）YouTube平台中，关于气候变化立场的长期演变及其互动争议模式缺乏系统性实证研究的问题。针对这一问题，研究的关键解决方案在于构建一个可扩展的自训练框架，以实现对大规模、噪声高、类别不平衡且资源有限的评论数据进行高效且准确的立场识别。该框架基于Llama 3.1模型，采用低秩适应（Low-Rank Adaptation, LoRA）与混合实例选择策略，通过生成高置信度伪标签样本，动态扩充训练集，同时保持各类别间的多样性与平衡性。该方法有效提升了少数类及修辞复杂类别的覆盖范围和分类性能，实现了无需大量人工标注的大规模立场标注。研究结果揭示出显著的互动不对称性：否定主义言论虽较少，但其更频繁地引发跨立场争辩；而主流共识话语则在同质化讨论线程中得到更强的内部强化。
链接: https://arxiv.org/abs/2609.27811
作者: Daniel Morais,Diego H. M. Magalhaes,Gabriel H. Silva,Andrea Failla,Valeria de C. Santos,Helen C. S. C. Lima,Carlos H. G. Ferreira
机构: Universidade Federal de Ouro Preto(联邦大学奥罗普雷托); ISTI, National Research Council (CNR)(ISTI，国家研究委员会（CNR）); University of Pisa(比萨大学)
类目: ocial and Information Networks (cs.SI); Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: Accepted at ASONAM 2026
Abstract:Online platforms have become arenas for the public contestation of climate change, shaping how scientific knowledge, denial, and uncertainty are expressed and disputed. Yet longitudinal evidence remains limited for YouTube, especially for Portuguese-language discourse. Addressing this gap, we characterize how climate stances are expressed and contested over time in a large corpus of Portuguese-language YouTube comments retrieved through Brazil-oriented climate-related searches. To support this analysis in a noisy, imbalanced, and low-resource setting, we collect more than 240,000 comments posted between 2014 and 2024 and formulate stance detection as a three-way classification task (Believer, Denier, and Inconclusive). We operationalize stance attribution through a scalable self-training pipeline based on Llama 3.1, using Low-Rank Adaptation (LoRA) and hybrid instance selection to expand the training set with high-confidence pseudo-labeled examples while preserving class diversity. This approach improves coverage and class balance for minority and rhetorically complex classes, enabling large-scale stance attribution without extensive manual annotation. Our results show that polarisation is marked by interactional asymmetries: denialist comments are less prevalent, but they are associated with a comparatively higher share of cross-stance contestation, while pro-consensus discourse is more strongly reinforced within stance-homogeneous threads.
[NLP-34] Beyond Unsafe Detection: Counterfactually Anchored Evidence Attribution for Multi-Turn LLM Safety Failures EMNLP2026
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在多轮对话中因安全防护机制（guardrail）失效而导致的潜在危害问题，尤其针对那些将恶意意图分散于多个对话轮次中的复杂攻击场景。传统评估框架仅关注最终输出的安全性，无法有效识别导致不安全行为演化的具体对话轮次与文本片段，因而难以应对多轮协同攻击。为此，论文提出一种基于层级归因（hierarchical attribution）的解决方案，其关键在于构建一个包含1,762个对话的多轮数据集，涵盖对抗性对话、良性对照组及含高风险词汇的良性变体，并引入分层证据监督机制以增强标注质量。在此基础上，训练了一个轻量级的层级归因模型，能够精准预测安全违规事件并将其归因于具体的用户发言轮次与词元片段。实验表明，该模型在检测性能上表现优异（F1=0.988），移除前15%被归因的词元可使恶意分类置信度下降51.1%；同时，在含有高风险词汇的良性对话中保持极低误报率（低于1%），显著优于基于关键词的表面风险基线（分别为37.3%和94.7%）。独立的人工标注验证进一步支持了模型的归因有效性，84.5%的对抗案例中，模型排名前五的归因轮次包含人工识别出的关键证据轮次。
链接: https://arxiv.org/abs/2609.27773
作者: Srinivasan Subramanian,Kazi Aminul Islam,Md. Abdullah Al Hafiz Khan
机构: Kennesaw State University (肯尼索州立大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: This work is currently under review for EMNLP 2026
Abstract:As Large Language Models (LLMs) move from conversational assistants to advanced agentic systems, guardrail failures can convert adversarial intents into harmful executions. However, most guardrail evaluation frameworks focus only on the result and assess whether a user request is safe or unsafe. This approach is insufficient for multi-turn failures, where adversarial intent is distributed across multiple turns. This motivates us to go beyond detection to identify the turns and tokens that push the conversation toward unsafe trajectories. To support this, we construct a multi-turn dataset with behavioral validation and tiered evidence supervision. The dataset contains 1,762 conversations, including adversarial conversations, benign twins, and benign variants with high-risk vocabulary. We train a lightweight hierarchical attribution model that predicts safety violations and attributes them to contributing user turns and token spans. The model achieves strong detection performance (F1=0.988), and removing the top 15% of attributed tokens reduces the adversarial classification confidence by 51.1%. The model preserves low false positive rates on benign conversations with high-risk vocabulary, with false positives below 1% on both borderline benign and benign high-risk vocabulary conversations, compared to 37.3% and 94.7% for a keyword-based surface-risk baseline. Independent human annotation supports the model’s attribution performance, with the top-five attributed turns containing a human-identified evidence-bearing turn in 84.5% of adversarial cases.
[NLP-35] Improving LLM -based Autonomous Web Agents with Filtering
【速读】： 该论文旨在解决基于大语言模型（LLM）的自主网页代理在处理网页输入时面临的挑战，即原始HTML源码信息冗长且包含大量与任务无关的内容，导致上下文窗口有限的LLM难以有效提取关键信息。其解决方案的关键在于设计两种检索策略，通过引入基于DeBERTa和T5的可训练排序模型，对网页中的HTML元素进行相关性评分并筛选出与目标任务高度相关的部分，从而减少噪声干扰。此外，还提出一种零样本的ColBERT基检索器，在不依赖额外标注数据的情况下实现对目标元素的有效召回。实验表明，该方法显著提升了LLaMA-2-70B代理在WebArena基准上的成功率，从1.97%提升至2.96%，验证了所提方法在增强网页代理理解能力方面的有效性。
链接: https://arxiv.org/abs/2609.27770
作者: Zhitong Guo,Jing Yu Koh,Ruiyu Li
机构: Carnegie Mellon University (卡内基梅隆大学)
类目: Computation and Language (cs.CL)
备注: All authors contributed equally to this work and are co-first authors. We conducted the initial research for this paper in 2023
Abstract:Autonomous web agents, powered by Large Language Models (LLMs), have garnered significant attention for automating various web-based tasks with multi-step reasoning and decision-making capabilities. An open research question in the development of these agents lies in the format of the webpage input. Raw HTML source code, with its extensive and often irrelevant details, poses difficulties for LLMs with limited context windows. To address this challenge, we first reproduce baseline models such as GPT-3.5 and LLaMA-2-70B on the WebArena (Zhou et al., 2023) benchmark, identifying common failure modes. We then propose two retrieval strategies to filter out irrelevant context for LLM agents. We develop DeBERTa-based and T5-based models that rank HTML elements by their relevance to the task. We fine-tune them on Mind2Web trajectory data and transfer them to WebArena. Experiments show that our DeBERTa-based model improves the success rate of the LLaMA-2-70B LLM agent on WebArena from 1.97% to 2.96%. Moreover, we develop a zero-shot ColBERT-based retriever that is able to retrieve the ground-truth element with a recall of 0.52 on Mind2Web and 0.47 on WebArena.
[NLP-36] Hard Negatives Reveal What Easy Negatives Hide: Cross-Lingual Harmfulness Representations Degrade with Resource Tier Under Hard Negatives
【速读】： 该论文旨在解决大语言模型在跨语言场景下安全对齐（safety alignment）的有效性问题，特别是针对低资源语言中模型拒绝有害请求能力下降的现象。现有研究认为，跨语言拒绝失败主要源于模型校准（calibration）问题而非有害性表征（harmfulness representation）的质量缺陷，其依据是英文训练的探测器在翻译后的低资源语言中仍能近乎完美地区分有害与无害提示（如使用无关分布的无害样本作为负例时，AUROC可达0.98）。然而，本文指出这一结论依赖于负例的选择：当采用表面相似但实质无害的“硬负例”（hard negatives，即XSTest对比提示）时，模型在低资源语言中的迁移性能显著下降，而高资源语言中仍保持稳定。在Qwen2.5-7B-Instruct上，平均AUROC下降幅度从英语的0.003增至高、中、低资源语言的0.017、0.042和0.276；该现象在Aya Expanse数据集上亦可复现。通过后向翻译的chrF控制及匹配chrF的对比分析，排除了翻译质量为主要解释因素的可能性，且在控制chrF后，资源层级与性能衰减仍存在显著相关性（部分相关系数r=0.70，p=0.03）。此外，分词器丰富度（tokenizer fertility）虽与性能下降有关，但无法完全解释资源层级效应。因此，该研究的关键发现在于：仅基于易负例（easy negatives）评估下的良好迁移表现，并不能证明有害性表征在跨语言中真正保留；真正的挑战在于硬负例下的鲁棒性，其在低资源语言中显著退化，表明当前跨语言有害性表征存在实质性缺陷。
链接: https://arxiv.org/abs/2609.27758
作者: Paras Balani,Subhrakanta Panda
机构: Birla Institute of Technology and Science, Pilani, Hyderabad Campus (比尔拉科技与科学学院，皮拉尼，海得拉巴校区)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 10 pages, 5 figures
Abstract:Safety alignment in large language models is trained primarily in English, and recent work reports that the underlying harmfulness representation survives translation: English-trained probes separate harmful from harmless prompts almost as well in low-resource languages as in English. This has been taken as evidence that cross-lingual refusal failures mainly reflect calibration rather than representation quality. We show that this conclusion depends on the choice of negative examples. Across nine languages spanning three resource tiers, we replicate near-perfect transfer (AUROC 0.98) when harmless prompts come from an unrelated distribution (easy negatives). With XSTest contrast prompts, which are benign but surface-similar to harmful requests (hard negatives), transfer collapses in low-resource languages while remaining largely stable in high-resource languages. On Qwen2.5-7B-Instruct, mean AUROC drop increases from 0.003 in English to 0.017 in high-resource, 0.042 in mid-resource, and 0.276 in low-resource languages. The pattern replicates on Aya Expanse. Back-translation chrF controls and a matched-chrF comparison across three languages reduce the likelihood that translation quality explains the effect. The collapse remains after controlling for chrF (partial r = 0.70, p = 0.03). Tokenizer fertility correlates with the collapse and explains part of the resource-tier effect, but not all of it. The results show that easy-negative transfer can coexist with substantial degradation under hard negatives. Easy-negative evaluation alone therefore cannot establish that the harmfulness representation survives translation.
[NLP-37] Reporting Under Pressure: Separating Factual and Tonal Sycophancy in LLM Statistical Analysis
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在进行数据分析与结果解释时，因提示（prompt）中的编辑性框架（editorial framing）而引发的输出偏倚问题。具体而言，研究关注的是：当提示中包含从中立请求到明确要求系统寻找支持或质疑某一结论的理由等不同框架时，模型的报告在内容实质与语气表达上是否会发生系统性偏差。其解决方案的关键在于通过一个4×4因子设计，系统地考察四种不同的提示框架（中立、批判性、支持性、显著性追求）与四种真实数据模式（真实效应、混淆因素导致的虚假效应但不满足稳健性检验、高功效零效应、低功效零效应）的组合对模型输出的影响。研究发现，事实性错误主要集中于两个特定情境：在真实效应上施加严厉批判性框架时，模型表现出过度怀疑（97%的响应出现事实误述）；在低功效零效应上施加追求显著性的框架时，模型则过度自信地得出无效结论（100%的响应出现事实误述）。相比之下，语气变化更为普遍，批判性框架在所有数据模式下均引发防御性、模糊化的语言风格，而追求显著性框架仅在数据存在真实模糊性时改变语气。值得注意的是，数据本身存在的混淆因素几乎完全抑制了两类偏倚的发生。这一结果表明，提示框架引发的扭曲风险并非均匀分布于所有提示类型或数据模式，且模型可在保持正确结论的同时发生显著的语气漂移，凸显了在人机协同数据分析中对提示工程敏感性的深刻影响。
链接: https://arxiv.org/abs/2609.27756
作者: Paras Balani,Subhrakanta Panda
机构: Birla Institute of Technology and Science, Pilani, Hyderabad Campus (比尔拉科技与科学学院，皮拉尼，海得拉巴校区)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 9 pages, 2 figures
Abstract:Large language models are increasingly asked to analyze data and report what the results mean, a task distinct from the belief- or preference-alignment settings studied in most sycophancy research. We test whether editorial framing in the prompt, ranging from a neutral request to an explicit instruction to search exhaustively for reasons to discredit or to support a finding, changes not just the tone but the substance of a model’s report. Across a 4 x 4 factorial design crossing four framing conditions with four ground-truth data patterns (a genuine effect, a confound that mimics an effect but fails a robustness check, a well-powered null, and an underpowered null), we collect 480 responses and score each along two independent dimensions: whether its factual claim about the data diverged from the correct interpretation, and whether only its tone diverged while the claim stayed correct. Factual misrepresentation is concentrated in two cells: brutally critical framing applied to a genuine effect, where the model talks itself into unwarranted skepticism (97% of responses), and significance-seeking framing applied to an underpowered null, where the model overstates confidence in a null conclusion the data cannot support (100% of responses). Tone shifts far more broadly than factual content does, with critical framing producing a defensive, hedge-heavy register across every data pattern regardless of what the data show, while significance-seeking framing shifts tone only where the data leave genuine ambiguity. A confound present in the data itself blocks both kinds of shift almost entirely under every framing condition tested. These results indicate that the risk of framing-induced distortion in LLM-assisted data analysis is neither uniform across framings nor uniform across data patterns, and that a model can hold a correct conclusion in place while its tone shifts substantially around it.
[NLP-38] Evaluation of pre-trained models for pedagogical assessment of novel AI-assisted educational questions
【速读】： 该论文旨在解决生成式人工智能（Generative AI）辅助生成的教育材料在自动化评估中面临的问题，即现有基于布卢姆分类法（Bloom Classifier）的模型在面对分布外（Out-of-Distribution, OOD）数据（如AI生成的试题）时性能显著下降。其核心解决方案在于识别并提升在数据分布偏移条件下仍具备鲁棒性的分类模型。关键发现包括：传统机器学习（ML）模型在OOD场景下表现较差（宏平均F1分数0.48），而预训练的Transformer模型（如BERT）和大语言模型（LLM）表现更优（分别为0.55和0.79）；通过引入文本拼接（text splicing）、将学习目标作为输入附加信息等特征工程策略，可有效稳定并提升模型在OOD数据上的性能；其中，模型微调（retraining）带来的性能提升最为显著。研究揭示了预训练模型在应对新型AI生成教育内容时的局限性，并强调通过针对性特征增强与再训练策略可缓解性能退化问题。
链接: https://arxiv.org/abs/2609.27749
作者: Michael Lawrence Castanares,Princess Ventures,Allan Tan
机构: Predictive Systems Inc(预测系统公司); Better Labs Oy(更好的实验室公司)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 12 pages, 5 figures, 5 tables
Abstract:The surge in AI-assisted generation of educational materials has outpaced our capacity to validate their pedagogical quality. Automated evaluation using Bloom Classifier models is a promising approach to assess educational materials at scale. These models show high accuracy within-distribution dataset (IID Dataset). However, applying the same models to new out-of-distribution (OOD) datasets such as AI-assisted generated questions could show performance degradation. To identify robust classifiers under dataset shift, we evaluated traditional Machine Learning (ML), transformer, and Large Language models on the Bloom level classification task. We also explored feature-engineering strategies incorporating NLP metrics, appending the learning objectives as part of the input, and text splicing to stabilize OOD performance. Our baseline tests show that TFPOS-IDF ML models perform poorly on OOD (Macro F1-score 0.48) compared to BERT (0.55) and LLMs (0.79). Text splicing improved macro F1-score performance of ML and BERT models (0.59 and 0.62, respectively). Appending the learning objectives with the input increased model performance on specific dataset. Model retraining provided the largest improvement across models and datasets. Overall, these findings highlight the trade-off on the use of pre-trained models with novel AI-assisted educational questions and how strategic feature enhancements help address loss in performance.
[NLP-39] SkillGym: Internalizing Human Skills into LLM s for Real-World Problem Solving
【速读】： 该论文旨在解决人类编写的智能体技能（agent skills）在实际应用中仅作为推理时的外部指令，而未能被内化为大语言模型可复用的内在能力这一问题。其核心挑战在于如何将非结构化的、面向任务的技能知识转化为可执行、可验证且可用于训练的标准化环境，以实现对模型行为的有效监督与优化。解决方案的关键在于提出一个名为\textttSkillGym的框架，该框架通过“技能到任务”（skill-to-task）的流水线机制，将人类编写的技能自动实例化为具体的可执行任务，并利用基于代码的检查器对结果进行形式化验证；同时，通过对比执行（contrastive executions）来实证评估模型对特定技能的依赖程度。该框架构建并发布了涵盖12个类别共2,756个训练环境，收集了来自多个模型和工具链的8,364条成功轨迹，支持监督微调与基于结果奖励的强化学习。实验表明，在Claude Code环境下，经过监督微调后的Qwen3.5-35B-A3B模型在多项基准测试中显著提升，而35B规模的\textttSkillGym-Agent在技能辅助任务上达到51.47%的准确率，超越了包括Claude Sonnet 4.6、GPT-5.4 Mini及DeepSeek V4 Pro在内的多个先进模型，且在无技能依赖场景下仍优于部分技能增强基线，证明了所学技能具备可迁移的程序性认知能力（procedural competence）。
链接: https://arxiv.org/abs/2609.27717
作者: Zhilong Ge,Yuting Shao,Yutao Yang,Yuxuan Cai,Jie Zhou,Kai Chen,Bo Zhang,Qin Chen,Liang He
机构: East China Normal University (华东师范大学); Shanghai AI Laboratory (上海人工智能实验室)
类目: Computation and Language (cs.CL)
备注:
Abstract:Human-written agent skills encode rich workflows for real-world problem solving, but are typically used as external inference-time instructions rather than internalized as reusable model capabilities. We introduce \textttSkillGym, a framework that transforms these skills into executable, verifiable training environments for large language model agents. Its skill-to-task pipeline instantiates concrete tasks, verifies outcomes with code-based checkers, and assesses empirical skill dependence through contrastive executions. We construct and release 2,756 environments across 12 categories and collect 8,364 successful trajectories from multiple models and harnesses, averaging 49 tool calls and over 60k logged text tokens. These resources support supervised fine-tuning on verified workflows and reinforcement learning with outcome-based rewards. Under Claude Code, supervised fine-tuning improves Qwen3.5-35B-A3B by 199 Elo on GDPval-AA v2, 19.10 percentage points on Terminal-Bench 2.1, and 28.13 and 12.38 points on SkillsBench v1.1 with and without skills, respectively. Our 35B \textttSkillGym-Agent reaches 51.47% on skill-assisted SkillsBench, exceeding reported scores for Claude Sonnet 4.6, GPT-5.4 Mini, and DeepSeek V4 Pro. Without skills, it also surpasses skill-assisted bases under Codex and Claude Code, suggesting reusable procedural competence.
[NLP-40] Consequential Behaviour and Representational Fairness in the Validation of Synthetic Research
【速读】： 该论文旨在解决当前基于大语言模型生成的合成调查样本在实际应用中缺乏有效验证的问题，尤其针对决策者依赖合成研究以预测重要行为的场景。传统验证方法多采用与真实人类调查数据的表面性对比，但这种方法忽略了行为科学中的“意图-行为差距”，未能真正检验合成样本对实际行为的预测能力。其解决方案的关键在于提出一个系统性的验证框架，该框架包含两大核心要求：一是所有有效性声明必须明确说明与真实人类数据的对应层次，包括是否能够预测目标人群的实际行为、所考察的四类诊断指标（位置、离散度、响应过程和结构）以及是否评估了实验效应；二是必须报告子群体层面的有效性，因为关键决策往往影响特定群体，而整体准确性会掩盖这些群体的代表性偏差。该框架将分配正义、程序正义和承认正义三个伦理维度操作化为可测量指标，并引入“跨人物画像的反事实实验”作为验证标准。研究通过电动汽车充电费率案例验证了该框架的适用性，并最终提供一份报告清单，帮助研究者构建可信的有效性声明。
链接: https://arxiv.org/abs/2609.27690
作者: Florian Kutzner,Celina Kacperski,Laura de Molière,Edoardo Chidichimo,Min Jun Jung,Felix Patrick Sedgwick Wallis,James Kunling He
机构: Seeburg Castle University (塞伯尔格城堡大学); Artificial Societies Ltd. (人工社会有限公司); University of Oxford (牛津大学)
类目: Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: 17 pages, 1 figure
Abstract:Researchers in industry and academia use synthetic survey respondents powered by large language models as substitutes for human samples. These synthetic populations require validation against real-world data, so researchers often address them using ad hoc comparisons with human surveys. Inspired by the intention-behaviour gap in behavioural science, we argue that these validations test the wrong thing for most applied cases where decision makers commission synthetic research to anticipate consequential behaviour. To address this problem, we propose a validation framework with two requirements. First, every validity claim must state its level of correspondence with human data: does the sample predict what the represented people do, which of four diagnostics (location, dispersion, response process and structure) does the validation address, and does the validation compare against experimental effects? Second, researchers must report validity claims for subgroups, since these groups are often the most affected by consequential decisions and aggregate accuracy hides their misrepresentation. Our validation framework operationalises three justice dimensions (distributional, procedural, and recognition) as measurable quantities and defines within-persona counterfactual experiments as a validation requirement. We then apply the framework to electric vehicle charging tariffs, before closing with a reporting checklist that researchers can use to make convincing validity claims.
[NLP-41] Same Scores Different Decisions: Evaluating JEV and Language Models for Legal Document Understanding
【速读】： 该论文旨在解决合同推理（contract inference）中因多轮判断导致的个体决策质量被整体准确率掩盖的问题，尤其关注在不同请求配置下模型输出的一致性与正确性是否真正稳定。其核心挑战在于：传统评估仅依赖平均准确率或重复一致性的指标，可能无法识别模型在特定条件下系统性地输出错误答案的现象。论文提出的关键解决方案是引入一种名为Jev的新型推理框架，并通过在ContractNLI数据集上的受控对比实验，系统评估不同语言模型在推理成本、响应时间、平均正确率以及多次请求条件下的正确率表现。实验设计控制了假设可见性、输出内容要求和输出顺序等变量，以隔离配置变化对个体判断的影响。结果显示，尽管托管型语言模型在基线准确率上表现更优，但Jev在推理成本和中位响应时间上均最低，且其个体判断的正确性在多种配置下更为稳健；进一步的开发诊断揭示了其他模型存在补偿性修正与持续性错误，表明单纯依赖平均性能指标具有误导性。因此，论文强调应将推理成本、响应时间与个体判断在配置变化下的稳定性共同纳入评估体系，以实现对生成式AI（Generative AI）模型真实可靠性的全面衡量。
链接: https://arxiv.org/abs/2609.27678
作者: Fan Zhang,Yankai Chen,Zhuohan Xie,Yixi Zhou,Sijia Peng,Lei Fan,Xinhua Ji,Cunyuan Zheng,Huangyong Shan,Philip S. Yu,Xue Liu,Yu Chen,Preslav Nakov,Songwei He
机构: The University of Tokyo; MBZUAI; McGill University; Hong Kong Baptist University; Fudan University; University of Illinois Urbana-Champaign; UCloud; Columbia University; The University of Hong Kong; University of Illinois Chicago; Quantell Capital
类目: Computation and Language (cs.CL)
备注:
Abstract:Contract inference requires multiple judgments about a shared document, but aggregate accuracy can conceal changes in the individual decisions. Repeated agreement is also insufficient: a model may consistently return the wrong answer. In this paper, we compare Jev with nine language models on ContractNLI, evaluating inference cost, response time, average correctness, and correctness across repeated request conditions. Controlled comparisons vary hypothesis visibility, requested outputs, and output order while keeping the contract and target judgment fixed. Jev has the lowest cost and median response time among the evaluated configurations, while hosted language models achieve higher baseline accuracy. Rankings by baseline accuracy differ from rankings by correctness across every condition and repeat, although small differences in the latter do not establish a general stability advantage. Development diagnostics further reveal compensating corrections and regressions, as well as persistent errors. These findings motivate evaluating cost and response time alongside whether individual judgments remain correct as the request configuration changes. Code: this https URL
[NLP-42] he Path Matters: Evaluating Small Language Models Beyond Answer Accuracy in KGQA
【速读】： 该论文旨在解决小语言模型（SLMs）在知识图谱（KG）问答任务中因端到端流程耦合而导致的可解释性与可诊断性不足问题。具体而言，传统方法将图谱访问、搜索、导航、推理与答案生成等环节紧密绑定，使得难以区分模型失败是源于导航错误还是其他阶段的缺陷。为此，论文提出采用THESEUS导航与可追溯性框架，通过冻结的现成小语言模型作为局部动作策略，在每一步仅基于环境提供的合法出边动作进行选择，并自主决定是否终止，全程无需任务特定参数微调、模型控制的束搜索或自由形式的答案生成。该受控设置使研究能够以命中率（Hits@1）评估最终答案准确性，并以路径编辑距离（Path Edit Distance, PED）为核心指标衡量路径保真度，从而实现对模型推理路径的精确追踪与量化分析。实验结果表明，即使规模相近的小语言模型在答案准确率与路径保真度上表现差异显著，且二者常呈现此消彼长的关系；此外，提示方式的影响也具有模型依赖性，单一示范轨迹可能提升或削弱不同模型的导航性能。这些发现强调了在评估小语言模型的图谱推理能力时，必须超越单纯的终点准确率，综合考量路径可靠性与行为可解释性。
链接: https://arxiv.org/abs/2609.27669
作者: Eduin E. Hernandez,Sergio A. Diaz,Luis F. Garcia,Nurassyl Askar,Stefano Rini
机构: National Yang Ming Chiao Tung University (NYCU)(国立阳明交通大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 5 pages. Official implementation available at this https URL
Abstract:Small language models (SLMs) are increasingly paired with knowledge graphs (KGs), yet end-to-end KG question answering conflates graph access, search, navigation, reasoning, and answer generation. This coupling makes it difficult both to determine whether an SLM can faithfully execute the reasoning path implied by a question and to attribute failures to navigation rather than to other stages of the pipeline. We isolate this capability by employing the THESEUS navigation and traceability framework and using frozen, off-the-shelf SLMs as local action policies. At each hop, the environment exposes the legal outgoing graph actions, and the model selects one executable graph action and decides whether to stop, without task-specific parameter updates, model-controlled beam search, or free-form answer generation. This controlled setting allows us to evaluate terminal-answer accuracy with Hits@1 together with path fidelity, using Path Edit Distance (PED) as the primary trajectory metric. Across the Kinship and MQuAKE-ST KGQAs, similarly sized local models differ substantially in answer accuracy and path fidelity, with the two metrics sometimes favoring different models. This model-dependent behavior also extends to prompting, as a single demonstrated trajectory can improve or degrade navigation depending on the model. These results motivate evaluating SLM graph reasoning beyond endpoint accuracy alone.
[NLP-43] FLEET: From Logits Entropy to Enhanced Trajectories in Text Generation
【速读】： 该论文旨在解决基于大语言模型（LLM）的生成方法在使用温度采样进行多轮采样以提升准确性和稳定性时所面临的固有缺陷：由于该方法为无记忆机制，无法感知先前生成结果及其评估反馈，导致随着采样数量增加，语义重复答案的比例不断上升，从而产生边际收益递减问题。其解决方案的关键在于提出FLEET方法，通过引入记忆机制，将每次生成表示为熵超过预设阈值的状态稀疏轨迹，并利用这些轨迹推断每个词元的实用度得分（per-token utility scores），进而动态调整模型的logits。该方法在基准测试中实现了与重复采样基线相当的准确性，但推理速度提升了3倍；在复杂编码任务（LiveCodeBench Pass@32）上，在相同计算预算下准确率从59.9%提升至66.2%。此外，该方法在贪婪解码配置下具有确定性，仅需一次校准过程即可确定核心超参数，对现有LLM流水线改动极小。
链接: https://arxiv.org/abs/2609.27657
作者: Oleksii Streltsov,Oleksandra Vitko
机构: Kharkiv National University of Radio Electronics (哈尔科夫国立无线电电子大学)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 25 pages, 8 figures. Algorithm source code and experiments: this https URL
Abstract:Solutions based on large language models (LLMs) often rely on temperature sampling to improve accuracy and stability by aggregating multiple samples from the completion distribution. However, this memoryless approach is inherently suboptimal: because it lacks awareness of prior generations and their evaluations, it produces an increasing proportion of semantically duplicate answers as more samples are drawn, leading to diminishing returns. To address this limitation, we introduce FLEET, a novel method that integrates a memory mechanism into the generation process. FLEET represents each generation as a sparse trajectory through states whose entropy exceeds a predefined threshold and uses these trajectories to infer per-token utility scores that adjust the logits. Benchmark evaluations demonstrate that FLEET achieves the same accuracy as the repeated sampling baseline, with a 3x speedup, and substantially improves accuracy on complex coding tasks (LiveCodeBench Pass@32 increases from 59.9% to 66.2%) under the same budget. Furthermore, in the greedy-decoding configuration evaluated here, the approach is deterministic and uses a single calibration pass to derive its principal hyperparameters, requiring only minimal modifications to existing LLM pipelines.
[NLP-44] Can Jev Judge Radiology Reports? Evaluating a System One Model for Clinical Factuality
【速读】： 该论文旨在解决生成式医学影像报告（AI-generated radiology report）中存在的事实性错误评估难题，尤其是报告中遗漏异常、引入未经支持的发现或错误反转病变存在性等关键问题。其核心挑战在于如何准确量化生成报告与医生撰写参考报告之间的事实一致性。解决方案的关键在于提出Jev——一种基于系统一决策模型（System One decision model）的轻量级、低成本评判框架，通过逐句检查每条陈述在另一份报告中是否得到支持，并双向整合判断以捕捉未被支持的陈述和遗漏项。实验表明，仅需每个陈述一个支持性问题即可实现与七问配置相当的专家一致性（Kendall相关系数达0.573和0.398），同时减少43–45%的输入令牌消耗，且单次判断成本低于三美分/百对报告。在控制误差测试中，Jev对假阴性错误检测的AUROC高达0.977，展现出优异性能。此外，局部匹配方法RadMatch在临床显著错误及总体错误上表现更优。研究还揭示基准一致性受报告长度、错误定义等因素影响，验证了Jev作为实际可部署的事实差异评估组件的有效性，并指明在复杂场景下仍需更精细评估方法的必要性。
链接: https://arxiv.org/abs/2609.27607
作者: Jiaju Huang,Hao Yang,Xinyu Ma,Xinglong Liang,Kunyan Cai,Junqiang Ma,Shaobin Chen,Yue Sun,Tao Tan
机构: Macao Polytechnic University (澳门理工学院); Netherlands Cancer Institute (荷兰癌症研究所); Radboud University Medical Center (奈梅亨大学医学中心)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:An AI-generated radiology report can resemble a physician’s report while omitting an abnormality, adding an unsupported finding, or reversing its presence. Measuring these factual differences is essential for evaluating report generators. We study Jev, a System One decision model, as a simple, low-cost judge of agreement with physician-written reference reports. Our evaluator checks whether each statement is supported by the other report and combines these judgments in both directions to capture unsupported claims and omissions. A single-question configuration reaches Kendall correlations of 0.573 on RadEvalX and 0.398 on RadEvalExpert with expert error counts, outperforming an open natural language inference judge under matched decomposition and aggregation. One support question per statement retains similar expert agreement to seven while using 43-45% fewer judgment input tokens. At the documented API price, judgments cost under three cents per hundred report pairs, excluding local decomposition. In a separate controlled-error test, Jev detects false negation with an AUROC of 0.977. Local RadMatch achieves stronger agreement on clinically significant errors in both expert datasets and on total errors in the shared RadEvalExpert subset. Finding-count and error-scope analyses show that benchmark agreement reflects report size and error definitions as well as medical error detection. These results support Jev as a practical judgment component for measuring factual differences in generated radiology reports and identify where more elaborate evaluation remains valuable.
[NLP-45] When Context Misleads: In-context Learning with Jurisdiction in Large Language Models
【速读】： 该论文旨在解决当前基于上下文学习（In-Context Learning, ICL）的后训练方法在实际应用中存在的一大缺陷：即虽然能够有效提取示范样本中的模式，却普遍忽视了“上下文权威性”（context authority）——即判断上下文信息是否应主导最终输出的能力。为系统评估这一能力，作者提出了FakeContextBench基准测试集，涵盖七个领域的伪科学陈述。实验结果表明，仅依赖大规模预训练不足以实现可靠的上下文权威性判别；而主流的ICL微调方法甚至可能加剧模型对误导性上下文的敏感性，导致真实准确性下降高达14.95个百分点。针对这一权衡问题，论文提出一种名为“管辖权上下文学习”（Jurisdiction In-Context Learning, J-ICL）的后训练框架，其核心在于将上下文验证机制引入训练目标，显式建模上下文可信度。在四种模型架构上的实验显示，J-ICL相较于基线模型平均提升ICLEval 5.84个百分点、真实准确性9.20个百分点，并在现实率（Reality Rate）上较MetaICL和Symbol Tuning分别提升18.09个百分点，充分证明了该方法可同步增强ICL能力与抗误导性。
链接: https://arxiv.org/abs/2609.27603
作者: Pei-lin Li,Qingle Liu,Junyang Feng,Siyu Li,Sunqi Fan,Xin-Sheng Chen,Shuojin Yang
机构: Tsinghua University(清华大学); Huazhong University of Science and Technology(华中科技大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:In-Context Learning (ICL) has become a cornerstone of modern LLM deployment. However, existing ICL post-training methods have a critical blind spot: they excel at extracting patterns from demonstrations while often neglecting context authority, the ability to determine whether contextual information should govern the final answer. To benchmark this capability, we introduce FakeContextBench, which contains pseudoscientific claims across seven domains. Our evaluation of commercial and open-source models shows that large-scale pre-training alone is insufficient for reliable context-authority discrimination. Moreover, prevalent ICL fine-tuning methods can increase susceptibility to misleading context, reducing reality accuracy by up to 14.95 percentage points relative to the base model. To address this trade-off, we propose Jurisdiction In-Context Learning (J-ICL), a post-training framework that incorporates context validation into the training objective. Across four model backbones, J-ICL improves ICLEval by an average of 5.84 percentage points and reality accuracy by 9.20 points over the corresponding base models. It also raises the Reality Rate by an average of 18.09 points relative to MetaICL and Symbol Tuning. These results demonstrate that ICL capability and resistance to deceptive context can be improved together. The benchmark is available at this https URL.
[NLP-46] MWE-ECL: Recoverable Long-Range Context Does Not Always Override Local Lexical Priors
【速读】： 该论文旨在解决生成式模型在长上下文场景中虽能显式恢复远距离证据（distant evidence），却无法有效影响局部语义判断的问题，即“可恢复性”与“行为影响力”之间的脱节。其核心挑战在于：当远距离语境锚点（discourse anchor）与模型基于局部线索形成的默认解读（no-anchor prior）冲突时，模型是否能够真正受锚点影响并修正原有判断。解决方案的关键是提出一种双语诊断工具——多词表达有效上下文长度（Multiword Expression Effective Context Length, MWE-ECL），通过三类匹配任务分别量化：显式恢复能力（anchor-retrieval）、模型默认偏好（no-anchor prior）以及锚点条件下的决策调整（anchor-conditioned interpretation）。实验结果表明，在多个语言部署面板上，尽管模型对锚点的检索准确率极高（0.989–1.000），但其在优先冲突情境下对默认决策的覆盖能力显著下降（0.806–1.000），且多数正确决策仍被保留（0.977–1.000），揭示了远距离信息难以改变局部惯性判断的现象。进一步分析显示，此现象并非仅由提示分离（separate prompt invocation）导致，因同一调用控制实验中仍存在显著差距；同时，不同模型对干扰线索的响应差异表明跨模型语义调控机制具有异质性。该框架为评估长上下文模型中远距离信息的实际语义影响力提供了可量化的基准。
链接: https://arxiv.org/abs/2609.27590
作者: Wei He,Aline Villavicencio,Rodrigo Wilkens,Zhenyun Deng
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Long-context evaluations often test whether a model can recover distant evidence, but recoverability does not guarantee behavioral influence. We test the prediction that a distant discourse anchor can remain explicitly recoverable yet fail to change the locally preferred reading of a familiar multiword expression; such failures should concentrate when the model’s no-anchor default conflicts with the anchor, while prior-correct decisions remain largely preserved. We introduce Multiword Expression Effective Context Length (MWE-ECL), a bilingual diagnostic whose matched anchor-retrieval, no-anchor prior, and interpretation prompts measure explicit recoverability, model-observed defaults, and anchor-conditioned decisions, respectively. Across eight English deployment panels on a shared 0-128K grid, retrieval-control accuracy on prior-conflict items is 0.989-1.000, prior-conflict override spans 0.806-1.000 (0.809-1.000 after conditioning on correct retrieval), and preservation of prior-correct decisions remains 0.977-1.000. A same-call control querying retrieval and interpretation in one prompt reproduces the gap for DeepSeek V4 Pro (1.000 retrieval versus 0.900-0.920 interpretation), showing that separate invocations are not its sole explanation; smaller or absent gaps in the other two models bound its generality. For DeepSeek V4 Flash, separate prompt-fit tests retain perfect retrieval with lower interpretation at 512K and 1M, while foil-consistent cues shift the no-anchor prior far more than retrieval; cross-model cue effects are heterogeneous. A separately reported 10-family Chinese subset shows similar descriptive gaps, but imperfect retrieval for some models prevents an integration-only attribution. MWE-ECL therefore evaluates whether explicitly recoverable distant context changes a competing local semantic decision.
[NLP-47] Does Step Law Transfer to Small-Scale Language Models? An Empirical Recalibration Below 59M Parameters
【速读】： 该论文旨在解决Step Law在小规模语言模型（参数量N < 59M）中的适用性问题，即其在大规模模型（59M–1B参数）上校准的最优学习率η与批量大小B的幂律公式是否可直接外推至小模型场景。针对这一问题，研究提出三个假设：H1（原系数直接适用）、H2（形式保持但系数需重估）、H3（幂律不成立）。研究基于单个nanoGPT/TinyStories训练管道，采用AdamW优化器与warmup-cosine调度策略，在2048词元的BPE词汇表下系统评估了29个不同（N, D）组合共935次训练实验，通过在对数-对数坐标系中对平滑损失曲面进行局部二次逼近以提取最优超参数。结果表明，支持假设H2：尽管幂律函数形式依然有效，但关键系数显著异于原始Step Law。研究得到新的最优学习率公式为η*(N, D) = 0.0985 N^(-0.508) D^(0.238)（R²=0.834），批量大小公式为B*(D) = 3.6×10⁻⁴ D^(0.931)（R²=0.950）。值得注意的是，虽然原始理论中认为最优批量大小与模型尺寸无关（已验证，p=0.87），但本研究发现其随嵌入维度D的增长速率约为原工作的两倍。此外，直接应用原始Step Law会系统性高估最优学习率，中位数偏差达约4.0倍（范围2.4x–6.6x），揭示了在小模型训练中重新校准超参数的重要性。
链接: https://arxiv.org/abs/2609.27581
作者: Egor Romanyukov,Timofey Novikov,Timur Shokarov,Elizaveta Zorkina,Anastasia Palienko,Stepan Dergachev
机构: HSE University (高等经济大学)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Step Law gives power-law formulas for the optimal peak learning rate eta* and batch size B* when pre-training language models. It was calibrated on models between 59M and 1B parameters; the small-model regime N 59M was never tested empirically by its authors. This regime matters for single-GPU training, interpretability research, educational experiments, and settings where larger models are infeasible on memory or cost grounds. We test whether Step Law transfers to small language models. We consider three outcomes: H1, the original coefficients work directly; H2, the power-law form holds but with different coefficients; and H3, a power law does not describe the optima in this regime. All experiments use a single nanoGPT/TinyStories pipeline with a 2048-token BPE vocabulary, AdamW, and a warmup-cosine schedule. The optimum for each (N, D) cell is extracted from the loss surface L(eta, B) via a local quadratic approximation in log-log coordinates over the smoothed training loss. The final dataset contains 29 unique (N, D) cells and 935 analysis-ready runs. The main refit uses 25 cells (815 runs) in the working range 4 = D/N = 600. On the pooled data we accept H2: the functional form is preserved, but the coefficients differ from the original. We obtain eta*(N, D) = 0.0985 N^(-0.508) D^(0.238) (R^2 = 0.834) and B*(D) = 3.6 x 10^(-4) D^(0.931) (R^2 = 0.950). Step Law’s structural claim that B* is independent of N is reproduced (p = 0.87), but the growth of B* with D is nearly twice as steep as in the original work. Direct transfer of Step Law systematically overestimates the optimal learning rate: the median ratio eta_SL / eta* is approximately 4.0x, with a range of 2.4x to 6.6x. Subjects: Machine Learning (cs.LG); Computation and Language (cs.CL) Cite as: arXiv:2609.27581 [cs.LG] (or arXiv:2609.27581v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2609.27581 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Timur Shokarov [view email] [v1] Wed, 23 Sep 2026 09:00:36 UTC (73 KB)
[NLP-48] haiTrees: Thai Syntactic Dependency Trees Across Domains
【速读】： 该论文旨在解决泰语自然语言中句法模式研究缺乏大规模自动标注语料库的问题。尽管已有用于训练和评估依存句法分析器的手动标注依存树库，但受限于人工标注的成本与可扩展性，尚无足够规模的自动标注语料支持定量句法研究。为此，本文提出ThaiTrees，一个包含3.42亿词元的泰语语料库，涵盖新闻、维基百科、口语转录文本及社交媒体内容。其解决方案的关键在于构建一个可复现的清洗、处理与依存标注流水线，基于通用依存（Universal Dependencies）框架对泰语文本进行自动化处理，生成结构化、可搜索的语法关系数据。该语料库不仅支持句法分布的量化分析，还提供了频率词典与机器可读的CoNLL-U格式解析结果，适用于人工智能辅助及传统程序化分析。
链接: https://arxiv.org/abs/2609.27558
作者: Attapol T. Rutherford,Papatchol Thientong
机构: Chulalongkorn University (朱拉隆功大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Studying syntactic patterns in naturally occurring language requires a large parsed corpus, but manual annotation is costly and difficult to scale. Thai has a manually annotated dependency treebank for training and evaluating parsers, but lacks a large automatically parsed corpus for quantitative syntactic research. We present ThaiTrees, a 342M-token corpus drawn from news, Wikipedia, spoken transcripts, and social media. We develop a reproducible pipeline for cleaning, processing, and parsing Thai text under the Universal Dependencies framework. The resulting corpus makes grammatical relations searchable and supports the study of syntactic distributions. We release a frequency lexicon and CoNLL-U parses in machine-readable formats suitable for both AI-assisted and conventional programmatic analysis.
[NLP-49] ProCredit: From Outcome Rewards to Progress Credit in Agent ic Reinforcement Learning
【速读】： 该论文旨在解决长时序智能体任务（long-horizon agentic tasks）中因仅依赖最终结果奖励而导致的训练信号稀疏问题。传统方法仅在任务结束时给予单一奖励，导致无成功轨迹的群体无法获得训练信号、失败尝试间难以区分接近完成的程度，且所有操作（包括仅查询环境的无效动作）均获得同等奖励，严重削弱了学习效率。其解决方案的关键在于提出ProCredit机制：通过在每一步执行后重新运行任务成功的验收检查（acceptance checks），将任务进展（progress）转化为可验证的中间信用（credit），并基于每一步对进展的实际提升量进行奖励。该方法不仅在不同尝试间分配信用，也实现轨迹内各步骤的精准奖励分配。实验表明，基于Qwen3.5系列模型在AppWorld上的测试显示，ProCredit在所有规模下均显著优于基于最终结果奖励和基于进展奖励的基线模型，尤其在4B模型上超越最强基线4.1个百分点；消融实验进一步证明，仅在轨迹评分中加入最终进展无法提升性能，关键在于将进展信用精确归因于产生该进展的具体步骤。
链接: https://arxiv.org/abs/2609.27532
作者: Ming Ma,Yi Zhu,Yiran Zhong,Feida Zhu,Chonghan Liu,Pengkun Jiao,Qichao Wang,Yanhao Jia,Tianming Yang,Steven Hoi
机构: University of Chinese Academy of Sciences(中国科学院大学); Institute of Neuroscience, Chinese Academy of Sciences(中国科学院神经科学研究所); Tongyi Lab, Alibaba Group(通义实验室，阿里巴巴集团); University of California, Los Angeles(加州大学洛杉矶分校); Nanyang Technological University(南洋理工大学)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Long-horizon agentic tasks require an agent to modify an environment through a sequence of tool calls, with success determined by the final state. The standard recipe assigns a single outcome reward at the end and compares trajectories sampled for the same task. As a result, a group with no successful trajectory yields no training signal, failed attempts cannot be told apart by how close they came to completion, and turns that advance the task receive the same credit as turns that only query the environment. Prior work refines the unit of comparison from the trajectory to the step, or trains a reward model to supply intermediate signal: the former still derives its signal from final success alone, and the latter estimates it with a model. We observe that the acceptance checks that decide success can also be run on intermediate states, so progress is as verifiable as the outcome. We propose ProCredit, which turns this verified progress into credit: it reruns the acceptance checks after each turn, rewards the turn by its change in progress, and uses these rewards to assign credit both across attempts at the same task and across the turns within a trajectory. Starting from Qwen3.5 base models at three scales on AppWorld, ProCredit outperforms outcome-reward baselines and progress-based baselines in task completion rate at every scale on both test sets, exceeding the strongest outcome-reward baseline by 4.1 percentage points at 4B, and results in a second environment show the same direction of improvement. Ablations show that adding the final progress to the trajectory score alone does not improve performance: the gain comes from crediting progress to the turn where it occurs.
[NLP-50] Uncheatable Eval: Dynamic Compression-Based Evaluation of Language Models
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在基准测试中因训练数据泄露导致评估结果不可靠的问题，尤其针对基础模型（base models）因指令遵循能力有限而难以进行有效任务评估的挑战。其核心解决方案是提出一种名为“不可作弊评估”（Uncheatable Eval）的动态基准测试框架，通过持续采集新发布的文本数据，降低测试数据与训练数据重合的风险。该方法的关键在于利用模型预测能力与无损数据压缩能力之间的内在关联，以压缩率（compression rate）作为评估指标，量化模型对新文本的预测性能。实验覆盖80个模型、14类文本，分析了压缩率随上下文长度的变化规律，并验证了压缩率与零样本MMLU准确率之间的强负相关性。研究发现：（1）压缩性能随模型规模呈现一致的缩放趋势；（2）基于注意力机制、混合架构及循环结构的模型在引入更多上下文时，其压缩表现存在差异；（3）更低的压缩率显著对应更高的零样本MMLU准确率，表明压缩率可作为模型泛化能力的有效代理指标。
链接: https://arxiv.org/abs/2609.27510
作者: Kaifeng Tan,Yudong Li,Linlin Shen
机构: Shenzhen University(深圳大学); Tsinghua University(清华大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 17 pages, 7 figures
Abstract:Modern large language models are pretrained on massive datasets, making it difficult to prevent benchmark data from entering their training sets and undermining the reliability of evaluation results. Reliable evaluation is particularly challenging for base models, whose limited instruction-following ability complicates task-based assessment. We introduce Uncheatable Eval, a dynamic benchmark that regularly collects newly published text to evaluate base language models and reduce the risk of data contamination. Drawing on the relationship between a model’s predictive ability and its ability to compress data losslessly, we use compression rate to evaluate how well models predict new text. We evaluate 80 models across 14 text categories, study how compression changes with context length, and examine the correlation between compression rate and zero-shot MMLU accuracy. Our results yield three main findings: (1) compression performance follows a consistent scaling trend with model size; (2) attention-based, hybrid, and recurrent models differ in how their compression performance changes as more context becomes available; and (3) lower compression rates are strongly associated with higher zero-shot MMLU accuracy. Code is available at this https URL.
[NLP-51] DeltaS: Reading the Gated Linear Attention State for KV Cache Eviction in Streaming Video
【速读】： 该论文旨在解决在长视频-语言模型中，受限于固定内存预算时，如何高效选择性地保留关键视频片段以支持长上下文处理的问题。现有方法依赖于基于位置、注意力或键值表示的信号进行逐帧淘汰，但这些方法通常缺乏对内容增量信息的敏感性，且部分基于注意力的方法需引入代理查询或额外计算开销。本文提出一种无需训练、不依赖查询（query-agnostic）的新型淘汰策略DeltaS，其核心思想是利用混合架构中线性注意力模块的递归状态变化（即状态漂移，state drift）作为保留信号——通过衡量每段视频帧对递归状态的相对更新幅度，来识别携带更多新信息的视频块。实验表明，在保持预算和保留策略一致的前提下，状态漂移显著优于传统的位置、注意力及键值信号；且仅消耗前向传播1.9%的计算成本，便在六个长视频基准上平均超越最强的无查询基线2.1点，在最长视频任务上提升达5.6点。结果验证了混合架构中两种记忆机制（线性注意力状态与全注意力键值缓存）可协同工作，从而实现更高效的长序列建模。
链接: https://arxiv.org/abs/2609.27470
作者: Taeyoun Kwon,Seungjin Kim,Hyeonyu Kim,Moon Hwan Kim
机构: Maum AI Inc.(Maum AI 公司); Seoul National University(首尔国立大学); Yonsei University(延世大学)
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 15 pages, 8 figures, 6 tables. Code: this https URL
Abstract:Recent video-language models increasingly adopt hybrid architectures that interleave linear and full attention layers for efficient long-context processing. While the recurrent state of linear attention remains fixed in size, the KV cache of full attention continues to grow with the video stream, making eviction necessary under a bounded memory budget. The key challenge in streaming is that eviction must occur before the question arrives, so what to retain has to be decided without the question. Existing eviction methods derive token scores from the KV cache itself, using position, attention, or key-value representations, and attention-based scores further require proxy queries or extra computation. Hybrid backbones offer another source of signal. In gated-delta linear attention, the recurrent state is updated by the residual between each input and what can already be retrieved from the state, so its change over a chunk of frames reflects how much new information the chunk brings. We propose DeltaS, a query-agnostic, training-free method that retains video chunks inducing larger normalized state change, or state drift. In a controlled comparison with the budget and retention policy held fixed, state drift outperforms position-, attention-, and key-value-based signals. With a signal costing only 1.9% of the forward pass, DeltaS surpasses the strongest query-agnostic bounded-memory baseline by 2.1 points on average across six long-video benchmarks and by 5.6 points on the longest benchmark. These results suggest that the two memories of hybrid architectures can work cooperatively. Code is available at this https URL.
[NLP-52] EviStreams: Human-in-the-Loop AI Data Extraction for Systematic Reviews in Medicine EMNLP2026
【速读】： 该论文旨在解决系统性综述（systematic review）中数据提取环节存在的专家人力瓶颈问题，该环节受限于严格的协议化工作流程：需两名评审员独立提取研究数据、仲裁员处理分歧，并保留每项数据生成过程的可审计记录。尽管生成式AI可辅助数据提取，但其应用必须兼容既定综述协议并保障可重复性。本文提出EviStreams——一个实时、开源、无需代码的Web平台，使评审团队在三个关键阶段掌控AI辅助提取：方案设计（协议批准前的结构化分解）、字段定义（基于试点校准的类型化字段设定）以及提取预测（评审员盲法双人评审与仲裁）。通过表单构建器，领域专家定义类型化字段而非提示词，对上传的PDF执行提取，逐项审查每个数值及其支持文本片段，并将盲法双重评审结果整合为可审计的共识导出。在四个临床语料库和三类前沿模型上的评估表明，提取质量主要由字段定义决定，而非模型选择。EviStreams已上线并以Apache-2.0许可发布。
链接: https://arxiv.org/abs/2609.27418
作者: Sai Karthik Kosuri,Ankita Shashikant Bhosale,Michael Glick,Alonso Carrasco-Labra,Chris Callison-Burch
机构: Center for Integrative Global Oral Health (CIGOH); Penn Dental Medicine, University of Pennsylvania; Department of Computer and Information Science, University of Pennsylvania
类目: Computation and Language (cs.CL)
备注: 12 pages, 5 figures. Accepted to EMNLP 2026 System Demonstrations
Abstract:Systematic reviews underpin clinical guidelines, yet their data-extraction step is a major expert-labor bottleneck bound by a protocolized workflow: two reviewers extract each study independently, an adjudicator resolves disagreements, and the team keeps an auditable record of how every value was produced. Large language models can assist with extraction, but that assistance must fit established review protocols and preserve reproducibility. We present EviStreams, a live, open-source, no-code web platform that puts review teams in control of AI-assisted extraction at three key stages: program design (a structured decomposition approved before any code runs), field specification (typed field definitions calibrated from a pilot), and extracted predictions (reviewer-blinded dual review with adjudication). Working through a form builder, a domain expert defines typed fields rather than prompts, runs extraction over uploaded PDFs, inspects every value alongside the supporting passage it came from, and resolves a reviewer-blinded dual review into an auditable consensus export. An evaluation across four clinical corpora and three frontier model families, released with the system, shows that extraction quality is shaped far more by the field specification than by the choice of model. EviStreams is live at this https URL and released under Apache-2.0.
[NLP-53] What Looks Like a Capability Limit in Vision-Language Models Is a Readout Limit
【速读】： 该论文旨在解决当前视觉语言模型（Vision-Language Models, VLMs）评估基准中答案选项呈现方式（如字母、颜色名称、像素坐标等）对模型性能评估结果产生系统性偏差的问题。研究发现，这些看似中立的读出（readout）格式实际上深刻影响了模型的表现，导致报告的性能上限可能源于答案编码方式而非模型本身的能力。其核心解决方案在于揭示并验证“读出偏差”（readout bias）的存在：当同一任务以不同格式呈现时，模型表现差异显著——例如，在相同图像和目标下，使用英文名称作为位置选项时，Qwen3-VL-4B的准确率为68.5%，而采用像素坐标时骤降至20.0%（随机水平为11.1%）。进一步分析表明，这种差距在多种设置下稳定存在，包括4×4网格、8位量化、不同物体尺寸与边界距离分布等，并且可决定模型间的胜负关系。研究还通过反向测试（即人为篡改答案标签）识别模型实际使用的语义惯例，发现部分模型更倾向于遵循标准化的像素表示而非颜色角度或名称；同时，多个模型对同一颜色轮的命名方式各异，说明固定答案词汇表并非跨模型中立。此外，作者指出因评分器与模型对“正确答案”的理解不一致，曾五次误判具备能力的模型为无能，凸显评估框架内在主观性。因此，该研究的关键贡献在于揭示评估基准的读出机制本身是性能差异的重要来源，强调未来评估需考虑答案格式的语义一致性与模型适应性。
链接: https://arxiv.org/abs/2609.27408
作者: Alfredo F. Frontera Del Valle
机构: Columbia University (哥伦比亚大学)
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 14 pages, 1 figure, 8 tables
Abstract:Benchmarks for vision-language models offer their answer choices in some convention: a letter, a color name, a pixel coordinate. That convention is treated as neutral. We find it is not, and that the limits a benchmark reports can belong to the readout rather than to the model. On 200 COCO photographs, Qwen3-VL-4B picks the correct one of nine locations for a named object 68.5% of the time when the locations are given in English and 20.0% when the same locations are given as pixel coordinates. Chance is 11.1%. The cost arises when the answer options are coordinates; giving the model a coordinate in the question instead costs 3.5 points and is not significant. The gap holds on a 4x4 grid, under 8-bit rather than 4-bit quantization, and in every slice by object size, boundary distance and category. It also decides which model wins. Two models that tie under English names differ by 39 points in one coordinate system and by 54 in the other, in opposite directions. On the color task, three of the four open models capable of the task show the penalty; on photographs, two of three open models do, and so does Gemini, at 11.1 points on parseable answers (p = 1e-4). GPT-4o does not. To ask whether a model reads a coordinate at all, we attach the wrong name to each one and record which the model follows. Color options written as hue angles are followed below chance; a normalized pixel convention is followed at four times chance. This tells apart conventions a model can use from ones it cannot, though it did not predict accuracy on two untried conventions. Five models also name the same color wheel five different ways, so a fixed answer vocabulary is not neutral across models either. Five times during this work we measured a capable model as incapable because our scorer and the model disagreed about what an answer looks like. We report each case. They are the phenomenon in miniature. Comments: 14 pages, 1 figure, 8 tables Subjects: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Computation and Language (cs.CL) Cite as: arXiv:2609.27408 [cs.CV] (or arXiv:2609.27408v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2609.27408 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Alfredo Frontera Del Valle [view email] [v1] Wed, 23 Sep 2026 06:21:46 UTC (60 KB)
[NLP-54] When Parallel Drafter Meets Parallel Speculative Decoding
【速读】： 该论文旨在解决现有并行推测解码（Parallel Speculative Decoding, PSD）方法中因预估接受前缀和额外标记而引发的不确定性问题，即错误预测会导致整个批次回退至串行起草阶段，从而破坏并行性优势。其解决方案的关键在于提出DPara框架，通过在验证阶段利用扩散主干模型（diffusion backbone）预先计算所有可能接受边界下的草案表示（draft representations），且不指定额外标记；随后，在验证结果揭示后，仅通过一个轻量级自回归头（autoregressive head）结合匹配的预计算表示，即可近乎瞬时地生成下一回合的草案令牌。这一机制确保了主干前向传播与验证过程在每轮中始终并行，彻底消除了对概率性回退的依赖。实验表明，DPara在多个数学、编程及对话基准上对Qwen3-8B和Qwen3-14B均实现了平均3.21×和3.52×的加速，显著超越了最先进的串行与并行推测解码基线。
链接: https://arxiv.org/abs/2609.27396
作者: Fuliang Liu,Xue Li,Kun Qian,Zhibin Wang,Wanchun Dou,Wenyuan Yu,Chen Tian
机构: Nanjing University (南京大学); Alibaba Group (阿里巴巴集团)
类目: Computation and Language (cs.CL)
备注:
Abstract:DSpark-style parallel drafters have made speculative decoding highly effective, yet their draft phase remains serialized on the critical path of every round. Parallel speculative decoding (PSD) overlaps drafting with verification, yet existing methods must guess the accepted prefix and bonus token in advance: a wrong guess reverts the whole batch to serial drafting. We present DPara, a PSD framework that reuses effective parallel drafters yet guarantees backbone–verification overlap in every round, thereby eliminating this probabilistic fallback altogether. While the target verifies, DPara’s diffusion backbone precomputes draft representations for every acceptance boundary with the bonus left unspecified; a lightweight autoregressive head then combines the revealed verification outcome with the matching precomputed representation to emit the next round’s draft tokens almost instantly—fully parallelizing the dominant backbone forward with verification and leaving only the negligible head cost serial. Experiments on Qwen3-8B and Qwen3-14B across seven math, coding, and chat benchmarks show that DPara achieves average speedups of 3.21\times and 3.52\times over autoregressive decoding, surpassing the strongest serial and parallel speculative decoding baselines alike.
[NLP-55] PRISM-VLM: A Multi-Axis Discriminative Benchmark for Compact Vision-Language Models EMNLP2026
【速读】： 该论文旨在解决当前多模态模型评估体系中存在的局限性问题：现有基准测试普遍采用单一精度指标（single-axis benchmark）对视觉-语言模型（VLM）进行评价，导致在性能趋近饱和的基准上模型间差异被压缩，在更具挑战性的任务中则易使模型陷入低分区间，无法全面反映模型的真实能力。为此，论文提出PRISM-VLM——一种多轴判别式评估框架，通过七个维度（涵盖任务质量、行为鲁棒性及能力瓶颈等常见失效模式）对每个测试样本进行多维评分，并整合为综合得分PScore。其关键创新在于：利用来自15个公开基准的可复用数据项，实现对模型在不同维度上的细粒度刻画，有效区分出传统单轴评估平均掉的行为差异；尤其在“谄媚倾向”（sycophancy）这一维度上，与单次提示准确率几乎正交，揭示了模型在语义偏见与响应策略上的深层差异。实验表明，即使模型在PScore上统计无显著差异，其各轴表现仍可能呈现显著分化，从而提供更可靠、更丰富的模型对比视角。
链接: https://arxiv.org/abs/2609.27395
作者: Sanghee Park,Kee-Eung Kim
机构: NAVER Cloud AI(NAVER云人工智能); KAIST AI(韩国科学技术院人工智能)
类目: Computation and Language (cs.CL)
备注: Accepted to EMNLP 2026 Findings. 29 pages, 22 figures, 21 tables
Abstract:Compact vision-language models (VLMs) now power a growing share of multimodal applications. The benchmarks used to compare them, however, inherit a frontier-centric design: each model is reduced to a single accuracy number, narrowing the inter-model gap on saturated suites and pressing models into low-score bands on harder ones. We introduce PRISM-VLM, a multi-axis discriminative benchmark that scores every item along seven axes covering the recurring failure modes (task quality, behavioral robustness, and capability bottlenecks) and combines them into a single PScore, with items recycled from fifteen public benchmarks. Across compact VLMs from the past two years, PScore separates model pairs more reliably than prior single-axis benchmarks under an item-level paired bootstrap, and surfaces behavioral differences these benchmarks average away. Even models with statistically indistinguishable PScores diverge sharply along the per-axis profile, particularly on sycophancy, which is nearly orthogonal to single-prompt accuracy. We will release the full pipeline, prompts, and per-item annotations.
[NLP-56] AraG enre 2026: A Hierarchical Definition-Guided Arabic Genre Classification Shared Task
【速读】： 该论文旨在解决阿拉伯语及其他低资源语言中标注数据稀缺背景下，层次化、定义引导的文本类型分类问题。其核心挑战在于如何在缺乏真实标注样本的情况下，实现对细粒度文本类型的准确识别，尤其是在涵盖现代标准阿拉伯语、古典阿拉伯语及多种方言的自然语料中存在语言与领域差异时。解决方案的关键在于构建一个零样本标签泛化（zero-shot label generalisation）设置：参赛系统需基于自然语言定义理解74个未见过的细粒度文本类型语义，而非依赖固定的标签-特征映射记忆。这一设计迫使模型具备从定义中推断类别内涵的能力，从而提升对多样化、非结构化文本的泛化性能。实验结果表明，尽管粗粒度文本类型识别表现良好，但在细粒度分类上仍存在显著差距，凸显了跨语言与跨域泛化能力的不足。
链接: https://arxiv.org/abs/2609.27387
作者: Mo El-Haj,Saad Ezzini,Shadi Abudalfa,Mustafa Jarrar,Nguyen Minh Chi,Nguyen Minh Quan
机构: 未知
类目: Computation and Language (cs.CL)
备注: 8 pages
Abstract:AraGenre is a shared task on hierarchical, definition-guided Arabic genre classification, motivated by the limited availability of annotated data in Arabic and other low-resource languages. Systems assign each Arabic text segment both a broad communicative genre and a fine-grained specific genre. The released training and development sets contain limited, primarily synthetic and controlled examples, whereas the hidden final benchmark contains noisier naturally occurring text spanning Modern Standard Arabic, Classical Arabic, and multiple dialects. Participants received natural-language definitions for 74 previously unseen specific genres, creating a zero-shot label generalisation setting in which systems had to infer class semantics rather than memorise fixed label-feature associations. The task attracted 46 registrations and 373 submissions, with 17 teams completing the final evaluation. Thakaa ranked first with a Hierarchical Macro F1 of 0.7352, followed by HoangPhong (HP) with 0.7169 and NAMAA with 0.7013. The results show strong broad-genre recognition but a substantial gap in fine-grained classification under linguistic and domain variation.
[NLP-57] When Entanglement Lower-Bounds Disparity: Auditing and Repairing Demographic Fairness in Audio Understanding Models
【速读】： 该论文旨在解决语音技术中存在的语音识别偏差问题，具体表现为对非主流群体（如黑人说话者、第二语言使用者及老年群体）的语音识别准确率显著下降。其核心挑战在于如何在不混淆语义内容与情感表达的前提下，系统性地评估和缓解语音模型中因人口统计特征（如性别、年龄、口音）引起的偏差。解决方案的关键在于提出TRIAD审计框架，通过可控文本转语音生成技术，构建包含120个文本、24种人口统计学语音特征组合（性别、年龄区间、口音）以及十种表现风格的标准化测试集，实现对语音属性与语义内容的解耦。研究进一步定义了轴向保真度函数、子空间主角泄漏量及组条件间隙等量化指标，并证明平均探测差异随整体语音-语义泄漏量Λ的增加而增长；同时揭示峰值泄漏会引发活跃区域内的最坏情况偏差。实验结果显示，均方探测差异与Λ高度相关（皮尔逊相关系数r = 0.93），且在两个闭源模型中亦观察到相同泄漏特征。基于此，研究提出ORCA适配器，集成轴向特定对比头、正交性惩罚项与群体平衡采样策略，在降低72%泄漏的同时使差距显著缩小，有效缓解了语音模型中的公平性问题。
链接: https://arxiv.org/abs/2609.27382
作者: Kian Shamsaie,Iman Modarressi
机构: People Make Things
类目: ound (cs.SD); Computation and Language (cs.CL)
备注: Accepted by IEEE SLT 2026
Abstract:Speech technology penalizes some voices: recognition errs nearly twice as often for Black speakers, and accuracy declines for second-language accents and older speakers. We introduce TRIAD, an audit grid crossing 120 texts, 24 rendered demographic voice profiles (gender, age band, accent), and ten expressive styles via controllable text-to-speech, isolating perceived demographic attributes from content and affect. For ten open-weights encoders we define axis-fidelity functionals, principal-angle leakage between axis subspaces, and group-conditional gaps; a proposition proves that average probe disparity grows with the same aggregate voice-semantic leakage \Lambda we measure, and a corollary shows that peak leakage forces worst-case disparity inside an active region. The measured mean-square probe disparity tracks \Lambda (Pearson r = 0.93), and a black-box protocol exposes the same signature in two closed-source models. ORCA, an adapter combining axis-specific contrastive heads, an orthogonality penalty, and group-balanced sampling, cuts leakage 72% and roughly halves the gaps.
[NLP-58] MORSE: Multi-Context Ordering via Reverse Scoring for Evidence-Preserving Compression
【速读】： 该论文旨在解决生成式上下文压缩（context compression）中因上下文顺序敏感性导致的关键证据丢失问题。现有基于似然的压缩方法依赖于序列化评分机制，使得压缩结果对输入上下文的排列顺序高度敏感——同一组上下文的不同排列可能产生显著差异的证据保留效果。其核心问题是“信息抢占”（information preemption）：早期部分相关的上下文会提前占据共享信息的“评分信用”，从而抑制后续更强证据载体的增量得分，增加其被误删风险。为应对这一挑战，论文提出MORSE（Compression-Aware Evidence-Preserving Context Ordering），其关键创新在于引入一种压缩感知的证据优先排序策略：同时在原始上下文和压缩候选输出上应用反向查询-证据原则（reverse query-evidence principle），前者用于构建以证据为中心的锚点顺序，后者则指导压缩感知的排列选择。实验表明，在多跳问答（multi-hop QA）任务中，无论压缩预算、评分模型或压缩流程如何变化，MORSE均显著优于静态反向排序和计算量相当的随机搜索，有效提升了证据保留率与下游问答性能。
链接: https://arxiv.org/abs/2609.27380
作者: Ke Wan,Yifan Wang,Liheng Lai,Chen Chen
机构: University of Virginia (弗吉尼亚大学); AfterQuery (AfterQuery)
类目: Computation and Language (cs.CL)
备注: Code: this https URL
Abstract:Likelihood-based context compression can account for cross-context redundancy through sequential scoring, but this makes compression outcomes sensitive to context order. We show that different permutations of the same context collection can produce markedly different evidence-retention outcomes under an unchanged compressor. We attribute this sensitivity to information preemption: earlier partially relevant contexts can absorb credit for shared information, suppressing the incremental score of later, stronger evidence carriers and increasing their risk of removal. Controlled pair-swap interventions directly support this mechanism by showing that evidence-first ordering substantially improves supporting-evidence survival. To address this problem, we introduce MORSE, a compression-aware method for evidence-preserving context ordering. MORSE applies a common reverse query-evidence principle to both individual contexts and compressed candidate outputs, using the former to construct an evidence-first anchor and the latter to guide compression-aware permutation selection. Across multi-hop QA benchmarks, compression procedures, budgets, and scoring models, MORSE consistently improves evidence preservation over static reverse ordering and compute-matched random search, with corresponding overall improvements in downstream QA. Our code is available at this https URL.
[NLP-59] Cross-Lingual Legal QA for Vietnamese Labour Law: Retrieval Translation and Verifier-Guided Correction
【速读】： 该论文旨在解决跨语言法律问答中跨语言法规检索与防止未经支持的法律主张之间的核心矛盾问题，即在多语言环境下如何准确检索并引用相关法律条文，同时确保答案中的法律推理具有可验证性和证据一致性。其解决方案的关键在于提出一种验证器引导的流水线架构：将答案分解为法律主张（claim），通过检查引证可达性（citation reachability）与语义蕴含关系（entailment），识别并修正引证失败与逻辑矛盾。此外，研究引入六种自动诊断指标以评估答案对检索证据的忠实度，涵盖引证、情态、例外情形、程序性内容、结论推导及证据支持等维度。实验结果表明，基于学习的稀疏检索在英-越方向表现极差（R@5 ≈ 0.032），而密集检索达到0.358，略优于混合检索；翻译位置在控制条件下对各项自动诊断指标无显著影响，且敏感性分析支持该结论。验证器引导的纠错机制虽能提升系统层面的引证保留率（0.022–0.034），但在其他维度未产生可靠改进。值得注意的是，人工评估进一步揭示，自动诊断指标与人类对答案质量的判断之间存在不完全对齐，提示当前自动评估体系仍需完善。
链接: https://arxiv.org/abs/2609.27376
作者: Nguyen Minh Chi,Mo El-Haj,Nguyen Ha Thanh,Dawn Knight,Paul Rayson
机构: VinUniversity(越南维大学); Lancaster University(兰卡斯特大学); Cardiff University(卡迪夫大学)
类目: Computation and Language (cs.CL)
备注: 14 pages
Abstract:Cross-lingual legal question answering must retrieve statutes across languages while preventing unsupported legal claims. We introduce a bilingual evaluation suite of 231 Vietnamese–English question–answer pairs from Vietnamese labour law. Of these, 75 are additionally annotated for five challenging legal reasoning phenomena. We evaluate a verifier-guided pipeline that decomposes answers into claims, checks citation reachability and entailment, and corrects citation failures and contradictions. We also introduce six automatic diagnostics for faithfulness to retrieved evidence, covering citations, modality, exceptions, procedures, conclusions, and evidential support. Experiments show that learned-sparse retrieval performs poorly for English-to-Vietnamese retrieval (R@5~=~0.032), whereas dense retrieval reaches 0.358 and slightly outperforms hybrid retrieval. Translation placement has no statistically detectable effect on these automatic diagnostics in our controlled comparison and supporting sensitivity analyses. Verifier-guided correction improves citation preservation by 0.022 – 0.034 at the system level but produces no reliable gains in the remaining dimensions. Human evaluation further shows that the automatic diagnostics do not fully align with human judgements of answer quality.
[NLP-60] Planned Test-Time Scaling with Coordinated Reasoning Paths
【速读】： 该论文旨在解决测试时扩展（test-time scaling）中因并行分支独立采样导致的冗余推理问题。传统方法如重复采样（repeated sampling）从单一策略中独立生成多个分支，容易产生相似或重复的推理路径，限制了额外推理计算资源带来的性能提升。其解决方案的关键在于提出计划式测试时扩展（Planned Test-Time Scaling, PTTS），通过引入一个协调机制：由规划器（planner）为每个分支生成不同的解题概要（solution outline），引导各分支走向互补的推理路径；执行器（executor）则基于各自概要生成完整解答。形式上，PTTS严格泛化了重复采样，在理想设定下可证明其能更有效地覆盖互补的推理模式，并实现更优的pass@k缩放性能。作者在Qwen3-1.7B和4B模型上实现了两种变体：PTTS-ZS采用零样本提示（zero-shot prompting）在单次自回归过程中联合生成所有分支的概要，而PTTS-RL则通过截断执行轨迹进行强化学习训练，以更高效地优化规划器。实验表明，在五个数学推理基准上，PTTS-ZS相比重复采样最高提升6.7个pass@64点，PTTS-RL进一步提升至13.4点，且分析显示性能增益主要源于对多样化推理路径的更广泛覆盖。因此，PTTS提供了一种通用的测试时扩展框架，通过协调推理分支实现显著性能提升，具备零样本与可训练两种实现方式。
链接: https://arxiv.org/abs/2609.27374
作者: Xueqing Wu,Langxing Bai,Hritik Bansal,Po-Nien Kung,Shuo Li,Hao Liu,Nanyun Peng,Kai-Wei Chang
机构: University of California, Los Angeles(加州大学洛杉矶分校); Amazon(亚马逊)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Test-time scaling with parallel branches is widely adopted to improve performance on challenging reasoning tasks. The predominant approach, repeated sampling, draws branches independently from a single policy, which can produce redundant attempts and thereby limit the gains from additional inference compute. To address this limitation, we propose Planned Test-Time Scaling (PTTS), which replaces independent sampling with a coordinated joint policy: a planner generates a solution outline for each branch, steering the branches toward distinct reasoning paths, and an executor produces a full solution conditioned on each outline. Formally, we show that PTTS strictly generalizes repeated sampling and, in a stylized setting, provably promotes coverage of complementary reasoning modes and yields better pass@k scaling. We instantiate PTTS on top of strong reasoning models, keeping them fixed as executors while replacing repeated sampling with PTTS inference to further enhance test-time scaling. Concretely, we develop two variants: PTTS-ZS prompts a model to jointly generate outlines for all branches in a single autoregressive pass, while PTTS-RL directly optimizes the planner against the pass@k reward using truncated execution rollouts for efficient training and a sharper reward signal. Across five mathematical reasoning benchmarks with Qwen3-1.7B and 4B, PTTS-ZS improves pass@64 over repeated sampling by up to 6.7 points, while PTTS-RL further increases the gain to up to 13.4 points. Further analysis indicates that broader coverage of distinct reasoning paths contributes to these gains. Overall, PTTS provides a general framework for improving test-time scaling by coordinating reasoning branches, with zero-shot and trainable instantiations that yield substantial performance gains.
[NLP-61] Attention Routing Stabilizes Early: Working-Set Inference for Recurrent Language Models
【速读】： 该论文旨在解决递归语言模型在推理过程中因每一步重复计算全局注意力而导致的效率瓶颈问题。其核心挑战在于，尽管隐藏状态和注意力输出随递归深度持续变化，但注意力的支持集（attention support）与分布实际上在早期阶段便已趋于稳定。针对这一现象，论文提出一种无需训练的高效推理方法WISE（Working-set Inference with Support Exploitation），其关键在于利用递归过程早期通过全局注意力自动发现的稀疏上下文支持集，并在后续步骤中直接复用该支持结构，同时保持递归深度及支持内注意力计算的动态性。实验表明，这种“支持集复用”策略显著优于受限的注意力重用方式，能在多跳问答任务中几乎完全保留全注意力性能，在长达2K上下文时仍保持高质量，4K时略有下降；结合优化的稀疏注意力实现，相比原生FlashAttention在4K上下文下实现最高1.76倍的注意力计算加速，全32步轨迹下达1.36倍加速。
链接: https://arxiv.org/abs/2609.27373
作者: Ke Wan,Chen Chen
机构: University of Virginia (弗吉尼亚大学)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Code: this https URL
Abstract:Recurrent language models repeatedly apply shared network blocks to refine latent representations, but standard inference recomputes global attention at every recurrent step. We study attention dynamics across recurrent depth and find that attention support and distributions stabilize substantially earlier than hidden states and attention outputs. This suggests a two-stage structure: early steps discover a sparse working set of relevant context, while later steps refine representations over largely the same routing support. Motivated by this structure, we introduce WISE (Working-set Inference with Support Exploitation), a training-free method that uses unrestricted global attention during early recurrence and later reuses directly discovered block-structured support while keeping recurrent depth and within-support attention computation dynamic. Controlled interventions show that recurrent discovery is important and that support-only reuse better preserves model behavior than more restrictive attention-reuse alternatives. Across multi-hop QA benchmarks, WISE largely preserves full-attention performance, while context scaling reveals increasingly sparse working sets and greater efficiency gains. Quality is largely preserved through 2K context, with a measurable loss at 4K. An optimized sparse-attention implementation achieves up to a 1.76x attention speedup over native FlashAttention at 4K and a 1.36x speedup for the full 32-step attention trajectory. Our code is available at this https URL.
[NLP-62] Guides That Cause Actions: An Offline Study of Guide-Action Mutual Reinforcement in Multimodal Web Agents
【速读】： 该论文旨在解决当前网页智能体（Web agent）评估中因在线环境动态变化导致的可复现性差的问题，即环境状态与评判模型在不同运行间存在漂移，使得同一检查点无法获得一致评分，从而阻碍了对训练现象的受控研究。其解决方案的关键在于提出WebMRE——一个离线基准测试集，包含541个任务和5,293步轨迹，均源自成功的WebArena执行路径，具备完全审计的测试标签和确定性评分协议，可在无任何环境依赖的情况下实现检查点评分的一致性。该基准通过每一步配对人类导向的引导语句（guide sentence）与具体动作（action），首次实现了对引导语句与动作之间相互增强效应的系统研究。实验表明，联合解码引导语句可显著提升元素选择准确率：在两种解码顺序下，Qwen3.5-4B和Qwen3.5-9B分别提升0.9/0.2和1.7/2.2个百分点，且效果随模型规模增长。中介分析进一步证明引导语句是因果性指令通道而非简单注释：强制使用真实引导作为前缀可使动作准确率从0.422提升至0.684，而替换为其他步骤的引导则降至0.055，即使改写目标名称仍能恢复一半增益，说明该通道传递的是指令语义而非仅标签字符串。这一因果通道支持构建可重放的离线奖励信号，尽管从强检查点优化该奖励尚未带来性能提升。最终，经微调的模型在所有离线指标上均超越GPT-5.5、Claude Opus 4.8和Gemini 3.5 Flash，在零样本条件下表现优异。
链接: https://arxiv.org/abs/2609.27353
作者: Chengguang Gan,Yunhao Liang,QingHao Zhang,Shiwen Ni
机构: Independent Researcher(独立研究员); University of Chinese Academy of Sciences(中国科学院大学); Pusan National University(釜山国立大学); Shenzhen University of Advanced Technology(深圳先进技术研究院)
类目: Computation and Language (cs.CL)
备注:
Abstract:Web agents are usually evaluated in live environments, where environment state and judge models drift between runs, so the same checkpoint rarely reproduces the same score, making controlled studies of training phenomena impractical. We present WebMRE, an offline benchmark of 541 tasks and 5,293 steps derived from successful WebArena trajectories, with fully audited test labels and a deterministic protocol that scores a checkpoint identically on every run without any environment. Each step pairs a human oriented guide sentence with a grounded action, enabling the first study of the mutual reinforcement effect between them in web agents. Averaged over three seeds the effect holds for both models in both decoding orders and grows with scale: jointly decoding a guide lifts element selection over an action only reference by 0.9 and 0.2 points for Qwen3.5-4B and by 1.7 and 2.2 points for Qwen3.5-9B. A mediation analysis shows that the guide is a causal channel rather than commentary: forcing the gold guide as a decoding prefix lifts action accuracy from .422 to .684, another step’s guide collapses it to .055, and a paraphrase that renames the target still recovers half of the gain, so the channel carries instruction meaning and not only the label string. The same channel yields an offline reward that only a replayable protocol makes computable, though optimizing it from a strong checkpoint brings no gain yet. Our fine tuned models outperform GPT-5.5, Claude Opus 4.8, and Gemini 3.5 Flash, run zero shot, on every offline metric.
[NLP-63] Verifiable Hidden Dynamics Play: Generating Agent ic RL Environments from Solved Mechanisms
【速读】： 该论文旨在解决生成式 AI（Generative AI）在处理长周期、状态动态演化、决策相互依赖且结果延迟的任务时，因训练环境缺乏多样性、评估信号不可靠以及扩展成本过高而面临的挑战。其核心解决方案在于提出一种名为VHD-Play的逆向生成范式：先通过求解数学模型生成可执行的动态系统与轨迹评分基准，再基于此构建具有状态感知能力的工具化决策环境。该方法确保了环境动态与评估标准的一致性，从根本上避免了传统流程中“先建环境后定规则”的事后对齐问题。通过该框架，仅以数美分/个的成本即可生成3,300个多样化智能体环境，并显著提升模型性能——例如在五家族诊断测试中，Qwen3.6-35B-A3B的平均智能体得分从0.204提升至0.815。此外，模型在未见机制家族及外部基准（如通用函数调用、旅行规划、365天电商任务）上均表现出卓越泛化能力，在电商基准中实现零破产率并超越Qwen3.7-Max。对比实验进一步揭示，模型性能提升主要源于对状态化交互的理解，而非基础问题求解能力；同时，冻结设定器仍可生成更大规模环境，且在机制规模与任务周期扩展时仍能保持性能增益，表明该训练基底具备持续演进的潜力。
链接: https://arxiv.org/abs/2609.27321
作者: Xinjie Shen,Wei Fan,Xudong Guo,Jianhong Tu,Yang Su,Chuqiao Kuang,Yinger Zhang,Dayiheng Liu
机构: Georgia Institute of Technology(佐治亚理工学院); Alibaba Token Foundry, Alibaba Group(阿里巴巴令牌创造者，阿里巴巴集团)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: Qwen Technical Report
Abstract:Language-model agents increasingly face long-horizon tasks with evolving state, interdependent decisions, and delayed outcomes. Scaling their training requires diverse agentic environments, dependable outcome signals, and low extension cost. Existing generation pipelines commonly construct an environment before defining its outcome rule or annotating its trajectories, leaving dynamics and evaluation to be aligned post hoc. VHD-Play reverses this dependency by sampling and solving a mathematical model before a corpus-grounded setter renders its decision process as stateful tools. The executable dynamics and trajectory-scoring reference are inherited from the same solved model. The pipeline produces 3,300 diverse agentic environments at a cost of a few cents each. Training Qwen3.6-35B-A3B on three families raises its mean agentic score from 0.204 to 0.815 in a five-family diagnostic. Gains also appear on held-out instances from all three training families and eight unseen mechanism families, then extend beyond the generated substrate to external benchmarks for general function calling, travel planning, and 365-day e-commerce. On E-Commerce Bench, the trained checkpoint completes every run without bankruptcy and exceeds Qwen3.7-Max. We compare written-out problems with stateful versions that reveal or hide their parameters. The comparison shows that most of the learnable gap lies in stateful interaction rather than underlying problem solving. A frozen 35B setter realizes larger environments, and scale-matched training retains gains as mechanism size and horizon grow, indicating the potential for an evolving training substrate.
[NLP-64] Ruby-ASR: Evidence-Preserving Supervision for Joint Orthographic and Lexical-Reading Recognition
【速读】： 该论文旨在解决传统日语自动语音识别（ASR）中因仅依赖音写文本（orthographic transcript）作为监督信号而导致的词汇读音歧义问题。由于同一书面形式可能对应多种实际发音（lexical readings），而传统方法将所有变体统一为相同目标，致使读音区分信息在训练过程中丢失，且无法通过后续纯文本的音素转换可靠恢复。其解决方案的关键在于提出一种名为Ruby-ASR的新框架，将标准输出目标重构为带有跨度边界（span-bound）的“字面-词汇读音”序列表示（ruby representation），通过局部绑定每个书写片段与其真实发音，实现对书写与发音两种视图的确定性映射。该方法基于Qwen3-ASR骨干网络，在字幕风格和逐字风格转录规范下实现目标构造，并引入基于音拍级（mora-level）CTC的辅助单调读音监督机制。实验结果表明，该方法可在不牺牲可读音写文本的前提下，显著提升词汇读音的恢复精度。研究团队已公开模型检查点与推理代码。
链接: https://arxiv.org/abs/2609.27289
作者: Hao Shi,Yun Liu,Xuehao Yang,Jun Liu,Chuanbo Hua,Xuanjun Chen,Lianbo Liu,Shiao Zhu,Zixiong Su
机构: 未知
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Conventional Japanese automatic speech recognition (ASR) is supervised by an orthographic transcript, although the same written form can correspond to different lexical readings realized in speech. Such utterances receive an identical target, so their reading distinction is absent from the supervision interface and cannot be recovered reliably by post-hoc text-only grapheme-to-phoneme conversion. We present Ruby-ASR, which refines the conventional target into a span-bound orthographic–lexical-reading sequence. Unlike separate full-sentence orthographic and phonological outputs, the ruby representation locally binds each written span to its realized reading and permits deterministic recovery of both views. We instantiate the target under subtitle-style and verbatim-style transcription conventions using a Qwen3-ASR backbone; a mora-level CTC objective provides auxiliary monotonic reading supervision. The experimental results across five Japanese benchmarks show that refining the recognition target can improve lexical-reading recovery without sacrificing readable orthographic transcription. We release the checkpoints and inference code.
[NLP-65] EnSIMem: Entity-Structured Indexing for Long-Term Agent Memory
【速读】： 该论文旨在解决长期交互式智能体（agent）在持续积累的对话历史中难以有效记忆与检索具体事实、偏好、事件及变化的问题。现有记忆系统通常将交互内容压缩为泛化的摘要或检索无实体关联的文本片段，导致智能体在推理时无法准确识别目标实体、属性及其支持证据。本文提出EnSIMem，一种面向智能体的实体结构化长期记忆架构，其关键在于通过离线构建阶段将交互数据组织为语义连贯的主题事件（episode），并建立基于对话上下文的索引条目，形式为[实体][实体类型][属性:值]，每个条目均保留原始对话轮次、时间信息及多模态字段。在线交互时，智能体请求被分解为证据需求，其属性与记忆索引对齐，通过实体-属性查找与自适应检索机制，实现对点状、时间序列、复合及聚合推理所需证据的精准获取。响应生成直接基于保留的原始证据，而非有损的摘要，从而保障推理可追溯性与准确性。在长期记忆基准测试中，EnSIMem在保持紧凑上下文与良好在线效率的同时，实现了高回答准确率，验证了实体结构化索引与事件级溯源机制对于构建可靠智能体长期记忆的关键作用。
链接: https://arxiv.org/abs/2609.27279
作者: Xuanyu Meng,Xing Fan,Xinyi Fan,Chenlei Guo,Yixuan Xie,Jiawei Han
机构: University of Illinois Urbana-Champaign (伊利诺伊大学厄本那-香槟分校); Amazon(亚马逊)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 23 pages, preprint
Abstract:An agent that interacts with users over long periods must recall facts, preferences, events, and changes from a continuously growing interaction history. Existing memory systems often compress interactions into generic summaries or retrieve anonymous text chunks, making it difficult for an agent to identify the correct entity, property, and supporting evidence. We present EnSIMem, an entity-structured long-term memory architecture for an agent. During offline construction, the system organizes interactions into theme-coherent episodes and builds dialogue-grounded index entries of the form [entity][entity type][property:value]. Each entry preserves its source turns, temporal information, and available multimodal fields. During online interaction, the agent’s request is decomposed into evidence requirements whose properties are aligned with the memory index. Entity-property lookup and adaptive retrieval then collect the evidence needed for point, temporal, compositional, and aggregation reasoning. The agent generates its response from the preserved source evidence rather than from lossy memory summaries. On long-term agent-memory benchmarks, EnSIMem achieves high answer accuracy while maintaining compact contexts and favorable online efficiency. These results show that entity-structured indexing and episode-level provenance provide a reliable foundation for long-term memory in agents. The code of our model is available at this https URL.
[NLP-66] CAVEAT: Towards Robust Computer-Use Agents in Incentive-Misaligned Environments
【速读】： 该论文旨在解决生成式AI代理（Generative AI agents）在存在环境激励不一致时，如何保持用户目标一致性的问题。具体而言，当在线市场环境（如平台推荐机制）自身具有偏向特定产品或行为的激励时，代理可能偏离用户最优决策，从而损害用户利益。现有基准测试多集中于合作场景或显式攻击，未能评估代理在“环境主动诱导”（steering）情境下的鲁棒性。为此，作者提出CAVEAT基准，涵盖九种市场环境及八类常见诱导机制，并系统评估了五种模型家族的表现：在无诱导条件下，代理能以78.6%的准确率购买用户最优商品；而启用诱导机制后，该比例骤降至17.3%，表明当前代理对环境激励高度敏感。通过轨迹分析与消融实验，研究识别出三个关键失败节点：（1）代理扭曲用户的优先级排序；（2）过早缩小备选方案集；（3）在充分获取决策证据前即做出承诺。基于此诊断，作者设计了CAVEAT-Harness干预策略，直接针对上述失效模式，使用户最优购买率提升55.0%；进一步的针对性后训练亦显著改善小型开源模型的表现。研究结果确立了“激励鲁棒性”（incentive robustness）作为委托代理的核心挑战，并揭示其失效机理，同时证明通过针对性干预可有效增强代理在复杂激励环境中的可靠性。
链接: https://arxiv.org/abs/2609.27273
作者: Yuxuan Li,Will Epperson,Wesley Deng,Zezhou Huang
机构: Carnegie Mellon University (卡内基梅隆大学); Microsoft Research (微软研究院)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Computer-use agents (CUAs) increasingly act on behalf of users online. What happens when the environments they operate in have incentives that do not align with the user’s? In online marketplaces, for example, platforms may favor some products over others, potentially steering agents away from the user’s objective. Existing CUA benchmarks cover cooperative settings or explicit attacks, but do not test whether agents preserve user objectives when the environment itself has a stake in the outcome. We introduce CAVEAT, a controlled benchmark spanning nine marketplace environments and a taxonomy of eight common steering mechanisms. Across five model families, agents purchase the user-optimal product in 78.6% of matched-control episodes but only 17.3% when steering mechanisms are enabled. Larger models and increased reasoning improve robustness, but substantial failures persist. Our trajectory analysis and targeted ablations identify three points where steering enters the decision process: (1) agents distort the user’s priorities, (2) prematurely narrow the set of alternatives they consider, and (3) commit before resolving decision-relevant evidence. Guided by this diagnosis, we develop CAVEAT-Harness, which directly targets these failure modes and raises user-optimal purchasing by 55.0%. Targeted post-training further improves a smaller open model. These results establish incentive robustness as a distinct challenge for delegated agents, diagnose how it fails, and show that targeted interventions can substantially improve it.
[NLP-67] Can One Adapted Model Do It All? Fine-Tuning Strategy Selection for Customer Support LLM s
【速读】： 该论文旨在解决生产环境中客户支持系统中大语言模型（LLM）多技能协同部署的优化问题，具体聚焦于在多个任务（如意图识别、问答、摘要生成、工具调用决策等）之间，应采用独立的任务专用模型（task-specialist models）还是单一模型通过多任务微调、顺序更新或模型融合来统一处理。研究的关键在于通过系统性实验对比不同策略在多种模型规模（0.6B–32B参数）和跨八组公开与私有数据集（共约74.5k训练样本与8.7k评估样本）下的表现。核心发现表明：在固定训练协议下，多任务全量微调（multi-task full fine-tuning）在所有模型规模上均表现最优，是当前最可靠的默认方案；而专用模型虽在目标任务上表现优异，但存在显著的离任务性能退化问题，对可靠路由机制依赖性强；顺序低秩适应（Sequential Low-Rank Adaptation, LoRA）相较于顺序全量微调能更好地保留先前技能；对于大模型而言，将专用模型与其基础模型进行融合可在保持较小同任务损失的前提下显著提升离任务鲁棒性。研究最终提出适用于真实场景的微调策略选择实践指南。
链接: https://arxiv.org/abs/2609.27262
作者: Md Tahmid Rahman Laskar,Xue-Yong Fu,Shashi Bhushan TN
机构: Dialpad Inc.(Dialpad公司)
类目: Computation and Language (cs.CL)
备注:
Abstract:Production customer-support systems often require LLMs to support multiple skills, such as intent classification, question answering, summarization, or tool-use decisions. A central deployment question is whether these skills should be handled by separate task-specialist models or by a single model trained through multi-task training, sequential updates, or model merging. We study this question using thirteen models spanning five families (Qwen3, Qwen3.5, Gemma-3, Llama-3.1, and Mistral) from 0.6B to 32B parameters across eight customer-support datasets, spanning four public and four proprietary datasets with approximately 74.5k training and 8.7k evaluation samples. Under a fixed training protocol, we train more than 200 checkpoints. Our experiments reveal that multi-task full fine-tuning is the strongest operational default at every model size we test. Specialist models are strong on their target tasks but often degrade sharply off-task, making reliable routing important. Sequential Low-Rank Adaptation (LoRA) preserves earlier skills better than sequential full fine-tuning, while merging a specialist with its base model improves off-task robustness with limited same-task loss for larger models. We conclude with practical guidelines for selecting fine-tuning strategies in real-world settings.
[NLP-68] UniDataAgent : An Ontology-Grounded Agent for Enterprise Question-to-Report Automation
【速读】： 该论文旨在解决企业数据代理在处理业务查询时，如何有效保留组织特有语义、而非仅实现简单问题到查询的翻译这一核心挑战。现有方法（如基于文档的检索增强生成，Document RAG）在面对结构化与复合型任务时表现不足，难以保证语义一致性与准确性。为此，论文提出了一种基于本体（ontology）的可复用问答到报告分析系统——中国联通数据代理（UniDataAgent），其关键解决方案在于将语义获取（Ontology Acquisition and Validation, OAV）与在线执行（Question-to-Report Execution, QRE）分离：OAV阶段通过专家编写业务技能、受限生成、问题验证及精选专家评审，从元数据、业务知识和辅助材料中构建版本化的本体；QRE阶段则基于问题检索对应的语义契约，协调业务技能与数据工具，验证结果并生成带证据链的报告。该设计显著提升了系统在真实业务场景下的准确率（95.0%严格准确率），远超传统RAG方法（72.5%），同时将本体构建时间从约一周缩短至数小时，报告生成时间从数个工作日压缩至数分钟，具备高可扩展性与企业级落地潜力。
链接: https://arxiv.org/abs/2609.27257
作者: Yutai Duan,Yahui Zhao,Zhangti Li,Yu Ma,Zhenfeng Qi,Shaoyang Yuan,Jing Fan,Jie Liu
机构: China Unicom Software Research Institute(中国联通软件研究院); Nankai University(南开大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Enterprise data agents must preserve organization specific semantics, not just translate questions into queries. We present ChinaUnicom DataAgent (UniDataAgent), an ontology grounded system for reusable question-to-report analysis that separates semantic acquisition from online execution. Ontology Acquisition and Validation stage (OAV) builds versioned enterprise ontologies from metadata, business knowledge, and supporting materials through expert authored business skills, constrained generation, question verification, and selected expert review. Question-to-Report Execution (QRE) stage retrieves semantic contracts for each question, coordinates skills and data tools, validates results, and produces evidence linked reports. Across 27 enterprise tables and roughly thousands of metric types, ontology construction took a few hours instead of about one week manually. It took just a few minutes to generate the reports, instead of several working days. Ontology grounding achieved 95.0% strict accuracy on real business questions, versus 72.5% for document RAG, especially on structured and compositional tasks. The system has already been deployed to generate cost savings and has the potential to be replicated in other enterprises.
[NLP-69] Distilling Sequential Computation in Transformer Language Models
【速读】： 该论文旨在解决自回归式Transformer语言模型在处理长序列时因上下文逐步增长而导致计算成本急剧上升的问题。其核心挑战在于，尽管序列中许多相邻词元片段具有高度可预测性或作为稳定单元频繁出现，但现有方法未能有效利用这一特性进行计算压缩。论文提出的解决方案关键在于引入一种轻量级的合并模块（merge module），该模块能够在推理过程中动态地将输入词元片段替换为压缩后的代理嵌入（surrogate embedding），从而实现对序列计算的蒸馏。该代理嵌入由一组静态词元嵌入通过轻量级计算生成，能够捕捉多个词元的功能角色，使预训练模型可在不修改架构或重新训练的前提下处理压缩后的输入。通过在提示（prompt）和中间解码步骤中应用该方法，并结合回滚机制用单步代理表示替代存储的多词元键值缓存（KV cache）条目，实现了高达40%的有效序列长度缩减。实验表明，在多种语言建模评估及下游任务（如问答、摘要生成、常识推理与长文本数学推理）中，该方法仅带来极小的精度损失，且通过进一步轻量级适配可优化精度-压缩权衡。结果表明，通过紧凑的代理表示近似原生行为，可有效实现Transformer中顺序词元计算的高效近似，而无需更新模型本身。
链接: https://arxiv.org/abs/2609.27233
作者: Zixuan Lan,Jessica Yang,Yanhong Li,Karen Livescu,Jiawei Zhou
机构: The University of Chicago(芝加哥大学); Toyota Technological Institute at Chicago(丰田技术学院芝加哥分校); Independent Researcher(独立研究员); Stony Brook University(石溪大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Transformer language models process sequences token by token in an autoregressive manner, making growing contexts increasingly expensive. Yet many adjacent token spans are highly predictable or frequently occur as stable units, suggesting that their representations may be compressible. We introduce a method for distilling sequential computation by replacing spans of input tokens with collapsed representations, computed on the fly by a lightweight merge module. This module generates a single surrogate embedding from a sequence of static token embeddings that captures the functional role of the multiple tokens, allowing pretrained models to operate on compressed inputs without architectural changes or re-training. We apply this approach during inference to compress both prompts and intermediate decoding steps, using a rollback mechanism to substitute stored multi-token KV cache entries with their single-step surrogates. Experiments across diverse models show that the merge module can be used to reduce effective sequence length by up to 40% with minimal accuracy degradation across language modeling evaluations and downstream tasks, including question answering, summarization, commonsense reasoning, and long-form mathematical reasoning. Additional lightweight adaptation of the merge module further improves the accuracy-compression trade-off in selected settings. These results demonstrate that sequential token computation in Transformers can be effectively approximated through condensed surrogate representations that approximate the original behavior without model updating.
[NLP-70] LOCKR: A Hidden-State Trajectory-Guided Planner for Detecting and Repairing Stable-but-Wrong Lock-In in Diffusion Language Models
【速读】： 该论文旨在解决生成式语言模型在扩散式文本生成过程中出现的“稳定但错误”的锁定问题（stable-but-wrong lock-in），即模型在早期迭代中过早收敛至错误答案，尽管仍有大量去噪过程未完成。传统基于表面解码信号（如置信度、熵、边际值和答案稳定性）的方法无法可靠区分正确与错误的锁定状态。为此，论文提出一种轻量级的测试时规划框架——LOCKR，其核心在于利用隐藏状态轨迹（hidden-state trajectories）作为可行动信号，实现选择性推理修复。关键创新点在于：通过轨迹引导的规划器动态决定是否分配额外计算资源，构建结构化的针对性修复分支，并基于轨迹感知的验证机制选择最优延续路径。实验表明，在两种扩散语言模型和三个数学推理基准上，隐藏状态轨迹显著优于表面信号与单一隐藏状态快照，在错误锁定检测与修复选择方面均表现更优；在自然评估分布下，LOCKR实现了2.21–5.37个百分点的绝对准确率提升，修复率介于22%至41%，验证了隐藏扩散轨迹作为可操作信号在选择性测试时推理修复中的有效性。
链接: https://arxiv.org/abs/2609.27220
作者: Guoshenghui Zhao,Tan Yu,Weijie Zhao
机构: Rochester Institute of Technology (罗切斯特理工学院); NVIDIA Corporation (英伟达公司)
类目: Computation and Language (cs.CL)
备注: 9 pages, 6 figures, appendix included
Abstract:Diffusion language models generate text through iterative denoising, exposing intermediate trajectories before final answers are produced. We identify a recurring reasoning failure, stable-but-wrong lock-in, where an answer stabilizes early around an incorrect value while substantial denoising remains. Surface-level decoding signals such as confidence, entropy, margin, and answer stability are insufficient to reliably distinguish correct from erroneous lock-in. We formulate selective reasoning repair as a lightweight test-time planning problem and propose LOCKR, a hidden-state trajectory-guided planner that decides when to allocate additional computation, expands a structured set of targeted repair branches, and selects the most promising continuation using trajectory-aware verification. Across two diffusion language models and three mathematical reasoning benchmarks, hidden-state trajectories consistently outperform surface signals and single hidden snapshots for both wrong-lock-in detection and repair selection. On natural evaluation distributions, LOCKR yields absolute accuracy gains of 2.21–5.37 percentage points across all five evaluated settings, with repair rates ranging from 22% to 41%. These results establish hidden diffusion trajectories as actionable signals for selective test-time reasoning repair.
[NLP-71] Phonemizing User-Generated Text: A Benchmark Taxonomy and Compositional Approach EMNLP2026
【速读】： 该论文旨在解决用户生成文本（User-Generated Text, UGT）中非标准表达（如“ppl”、“imo”）的音素化（Grapheme-to-Phoneme, G2P）难题，这类文本的发音需从其标准形式（canonical form）推断，而非直接从表面形式（surface form）映射。现有G2P模型及前沿大语言模型（Large Language Models, LLMs）在处理非标准形式时表现出显著的性能下降，与标准形式相比，错误率（Phoneme Error Rate, PER）差距高达66.8点。为系统评估此问题，研究提出首个涵盖英语、越南语和韩语的UGT-G2P基准数据集UGTPhon，以及基于推理过程的细粒度诊断分类体系。解决方案的关键在于显式建模标准形式的推理过程：通过精确匹配查找（exact-match lookup）引入标准形式证据，并采用分阶段解码（staged decoding）策略，构建一种简洁的组合式G2P方法。实验表明，该方法在相同基线模型（ByT5与Qwen2.5-0.5B）上均能一致降低非标准形式的G2P错误率；其中0.5B参数量的模型表现甚至可媲美参数量大得多的少样本前沿LLMs，凸显了显式建模标准形式推理对提升UGT音素化性能的核心价值。
链接: https://arxiv.org/abs/2609.27205
作者: MinJu Jeon,Younghan Park,Han Sung Park,Jong-Hwan Kim,Dong-Jin Kim,Hoyeon Lee
机构: NAVER Cloud(NAVER云); Hanyang University(汉阳大学); Carnegie Mellon University(卡内基梅隆大学); Georgia Institute of Technology(佐治亚理工学院)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Accepted in EMNLP 2026 Findings
Abstract:Text-to-speech systems increasingly process user-generated text (UGT) such as ppl and imo, whose pronunciation must be inferred from the canonical rather than surface form. We introduce UGTPhon, the first grapheme-to-phoneme (G2P) benchmark for UGT in English, Vietnamese, and Korean, together with an inference-grounded taxonomy for fine-grained diagnosis. Existing G2P models and frontier LLMs exhibit a systematic canonical-to-non-canonical performance gap, reaching up to 66.8 PER points. As a benchmark baseline, we propose a simple compositional G2P approach that incorporates canonical-form evidence through exact-match lookup and staged decoding. Across matched ByT5 and Qwen2.5-0.5B backbones, explicit canonical-form modeling consistently reduces non-canonical G2P errors. The 0.5B variant also performs competitively with much larger few-shot frontier LLMs, highlighting the benefit of explicitly modeling canonical-form inference for UGT phonemization.
[NLP-72] Quieter Than the Room: Representation Drift and Task Robustness in Speech Encoders
【速读】： 该论文旨在解决非语音干扰（non-speech interference）对语音表征（speech representation）的潜在影响，尤其是在不引起显著任务损失（task loss）的情况下仍能导致表征漂移（embedding drift）的问题。研究通过在四种任务中测试八个冻结编码器（frozen encoders），系统性地在录音的全时段、语音段或静默段引入八种不同类型的非语音声音，揭示了干扰位置与类型对表征稳定性及下游任务性能的差异化影响。其解决方案的关键在于：通过量化嵌入空间中的表征漂移并分析其与任务损失之间的相关性，发现尽管整体表征漂移与任务损失在多数情况下呈显著正相关（平均Spearman相关系数0.81–0.88），但漂移幅度并非始终对应更高的任务损失；此外，静默段干扰往往引发更大的表征漂移，而语音段干扰则更显著影响意图识别、说话人验证和语音识别任务，情绪识别对干扰位置的敏感性较弱。研究还发现，即使在低于估计背景噪声水平的干扰下，嵌入变化仍可与重复语音带来的变化相当，且干扰效应会扩散至注入区域之外的语音帧。因此，表征漂移可作为评估干扰影响的有用指标，但需结合具体任务场景综合判断。
链接: https://arxiv.org/abs/2609.27195
作者: Vsevolod Kovalev,Pranay Manocha
机构: Boston University (波士顿大学); Princeton University (普林斯顿大学)
类目: ound (cs.SD); Computation and Language (cs.CL)
备注:
Abstract:Non-speech interference can change a speech representation without causing comparable task loss. We test eight frozen encoders on four tasks, adding non-speech sounds throughout recordings, during speech, or in pauses. Under whole-recording interference, embedding drift tracks task loss across seven sounds, with mean Spearman correlations of 0.81-0.88. Moving the same sound between speech and pauses changes this pattern. At quiet to moderate levels, pause interference produces larger drift, while speech interference usually causes greater loss on intent recognition, speaker verification and speech recognition. Emotion recognition shows a weaker placement effect. Pause interference also changes speech-frame representations beyond the injected region. Even below the estimated recording background, interference can change embeddings as much as repeated speech takes do. Drift helps rank the effects of different sounds, but larger drift does not consistently indicate greater task loss.
[NLP-73] Beyond Overlap: Estimating the Causal Effect of Benchmark Exposure
【速读】： 该论文旨在解决大模型评估中因训练数据泄露导致评估结果不可靠的问题，即现有基准测试分数可能受到训练数据中评估材料“污染”的影响，但无法量化这种污染对性能的实际贡献。其核心挑战在于：尽管可通过数据溯源判断模型是否接触过评估内容（即存在“接触”），却难以通过传统方法精确衡量这种接触对最终评分的具体影响。为解决此问题，论文提出LeakScale——一种干预性评估框架，其关键在于构建全新的可执行任务，这些任务依赖于仅限特定家庭私有的、无法从公开任务中推导出的敏感信息，并通过控制对这些私有信息的访问权限，测量由此产生的执行准确率变化。实验在2,048个独特模型家族、两个模型系列、两个可执行领域及262,144次生成样本下进行，结果显示，在所有模型与领域组合中，暴露于评估材料均显著提升准确率，增幅介于+7.17至+27.31个百分点之间。该方法成功将原本混淆的两个问题——“是否发生基准接触”与“得分受接触影响程度”——明确分离，并使后者实现了可直接测量。
链接: https://arxiv.org/abs/2609.27176
作者: Divyansh Singh
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Evidence that evaluation material entered training does not reveal how much it affected evaluation. This distinction leaves a contaminated benchmark score difficult to interpret: provenance can establish contact, but only a counterfactual can quantify the performance attributable to that contact. We present LeakScale, an interventional framework for estimating this missing quantity. LeakScale creates fresh executable tasks that require private, family-specific information absent from and non-derivable from the public task, controls access to that information, and estimates the resulting control-adjusted change in executable accuracy. Across 2,048 unique families, two model families, two executable domains, and 262,144 generations, exposure improves accuracy in every model-by-domain combination, with gains ranging from +7.17 to +27.31 percentage points. These findings separate two empirical questions that are often conflated: whether benchmark contact occurred and how strongly a reported score depends on it. LeakScale makes the latter directly measurable.
[NLP-74] Realize What Matters: Principled Context Representation for Large-Scale Reasoning
【速读】： 该论文旨在解决在科学、医学、法律和金融等复杂领域中，面对海量异构信息源时，模型因上下文长度限制而难以有效整合与推理的问题。现有方法通过将信息组织为图结构、文本记忆或检索集合等表示形式以支持下游推理，但这些表示的设计多依赖经验性尝试，缺乏系统性原则，导致推理效果受限。本文基于“相关性实现的认知理论”，提出一套可操作的原理来指导大上下文表示的有效构建，并分析了现有方法的成功与失败如何与其对这些原理的契合度相关联。其核心解决方案是引入R3Con框架，该框架系统化地实现了上述原理。在两个近期的大文档推理基准测试中，R3Con显著优于九个最先进的基线模型，分别提升20和8.4个百分点；更重要的是，使用较小规模模型（如4B、9B参数量）结合R3Con即可超越更大模型（如35B）的表现，且在同等性能下相比Claude Sonnet 5降低3.7倍成本。结果表明，遵循系统性设计原则的上下文表示可大幅减少对模型规模的依赖，推动未来具备前沿性能的高效小型化AI系统的发展。
链接: https://arxiv.org/abs/2609.27173
作者: Michael Theologitis,Dean Light,Shuyue Stella Li,Benjamin Newman,Yulia Tsvetkov,Dan Suciu
机构: University of Washington(华盛顿大学)
类目: Computation and Language (cs.CL)
备注: Preprint
Abstract:Solving complex tasks in domains such as science, medicine, law, and finance often requires assembling interdependent information scattered across vast, heterogeneous sources far beyond model context limits. Existing approaches tackle this challenge by organizing information into more manageable representations over which models can reason, such as graphs, textual memories, and retrieval collections. These representations dictate what downstream reasoning is possible and, ultimately, whether it succeeds; yet their design and construction remain largely ad hoc. In this work, drawing on the cognitive theory of relevance realization, we propose concrete principles for designing AI systems that construct effective representations of very large contexts. We analyze existing approaches and show how their successes and failures map onto their alignment with these principles, and introduce R3Con, a harness designed to operationalize the principles more systematically. We evaluate R3Con against nine state-of-the-art baselines on two recent benchmarks of reasoning over large document corpora. On these benchmarks, R3Con substantially outperforms the strongest baseline, by 20 and 8.4 percentage points. It also enables smaller models to outperform much larger ones: R3Con with 4B and 9B models outperforms all evaluated 35B baselines, while R3Con with a 35B-A3B model outperforms Claude Code with Claude-Sonnet-5 at 3.7\times lower cost. Our results show that context representations following our principled approach can reduce reliance on model scale, pointing toward a future of AI systems with frontier-level performance powered by smaller models. Our code is available at this https URL
[NLP-75] Count Evidence Not Sentences: Tempered Evidence Fusion of LLM Judgments for Long-Text Value Measurement ICASSP2027
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在分析长篇社交媒体文本时，因内容混杂背景信息、引用、让步性表述及少量立场表达句而导致的公共价值取向测量不准确问题。现有方法或直接预测文档级标签（易产生过度自信），或通过多数投票或软投票聚合句子级预测结果（将不确定与确定句子同等对待，忽视其信息量差异）。为此，论文提出一种无需训练的规则——温控证据融合（Tempered Evidence Fusion, TEF），其核心在于基于广义贝叶斯后验推导出每句话的归一化信息增益，并以此加权其对数似然比，使得不确定性高的句子贡献接近于零，而关键决策性证据则保留贝叶斯最优权重，从而实现更稳健的决策融合。此外，研究构建了多事件洞察网络维度（Multi-event Insight Network Dimensions, MIND）基准数据集，包含8,358条中英文社交媒体文本，覆盖五年间五类公共事件与六大价值维度。在MIND上，TEF在五种主流大语言模型和两种语言下，平均优于直接预测、多数投票和软投票等最强基线4.5个准确率点和4.6个宏平均F1点，验证了其有效性。
链接: https://arxiv.org/abs/2609.27165
作者: Yuhe Wu,Rui Qian,Guangyu Wang,Yuran Chen,Yuanchao Zhu,Junjie Yang,Zhengheng Li,Jiulin Cai,Tianyi Zhang,Zihan Dong,Jiaxin Liu,Yujie Chen,Guang Zhang
机构: 未知
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Yuhe Wu, Rui Qian, and Guangyu Wang contributed equally. Corresponding author: Guang Zhang. See also: this https URL
Abstract:Large language models (LLMs) are increasingly used to measure public value orientations from long social media posts, yet such posts often mix background, quotations, concessions, and only a few stance-bearing sentences. Existing approaches either ask the model to predict a document-level label directly, which can be overconfident, or aggregate sentence-level predictions by majority or soft voting, which treat uncertain and decisive sentences as equally informative. We formulate long-text value measurement as a decision-fusion problem and propose Tempered Evidence Fusion (TEF), a training-free rule that weights each sentence’s log-odds by its normalized information gain, as derived from a generalized Bayesian posterior. This makes the fused score nearly vanish for uncertain sentences while preserving the Bayes-optimal weight of decisive evidence. We further introduce Multi-event Insight Network Dimensions (MIND), a benchmark of 8,358 Chinese and English posts spanning five years of public events and six value dimensions. On MIND, TEF outperforms the strongest baseline among Direct, Majority Vote, and Soft Vote by an average of 4.5 accuracy points and 4.6 macro-F1 points across five LLMs and two languages. MIND dataset and code are available at this https URL.
[NLP-76] he Linear Representation Hypothesis Needs a Group Action
【速读】： 该论文旨在解决在神经网络表示学习中，如何准确界定“表示具有泛化能力”的前提条件问题，即在不同模型之间判断表示是否等价这一核心挑战。由于现有研究（如线性表示假设，Linear Representation Hypothesis）常默认表示等价性而未明确定义其标准，导致基于不同度量、探测方法或干预手段所评估的“相同”表示可能实际上对应不同的假设。论文的关键解决方案在于提出一种基于群作用（group actions）的形式化框架，通过明确表示对象、生成过程及其所依赖的架构约束下的等价关系，将原本模糊的“线性表示假设”重新定义为一个由等价性定义区分的假设家族。该框架揭示了分析过程中假设随度量方式、读取点及阶段变化的本质机制，并用于系统审计常见表示量与近期可解释性分析中的隐含假设，从而提升表示研究的严谨性与可比性。
链接: https://arxiv.org/abs/2609.27158
作者: Louie Hong Yao,Yuhao Li,Shengchao Liu
机构: The Chinese University of Hong Kong(香港中文大学)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 16 pages, 1 table
Abstract:To make claims about representations that generalize beyond a particular trained model, we need to specify when two representations should count as equivalent. The Linear Representation Hypothesis is often discussed without making this equivalence explicit. Different notions of equivalence preserve different structures, so metrics, probes, and interventions that appear to study the same representation may in fact correspond to different hypotheses. We therefore argue that the Linear Representation Hypothesis is not one hypothesis but a family of claims distinguished by representation equivalence. We formalize this idea using group actions, specifying the representation object, the procedure that produces it, and the property ultimately asserted, while accounting for equivalences imposed by the model architecture. This framework clarifies how assumptions can change across metrics, reading points, and analysis stages, and we use it to audit common representation quantities and recent interpretability analyses.
[NLP-77] Giving Credit Where Its Due: Redundancy-Aware Learning for Efficient Reasoning
【速读】： 该论文旨在解决大模型在推理过程中生成冗长且不必要的推理轨迹（reasoning trace）的问题，现有方法多依赖轨迹级目标或局部的词元与步骤级信号，但未能充分建模步骤间的语义依赖关系，导致难以有效区分冗余步骤与对后续推导具有支持作用的关键步骤，从而限制了在不牺牲准确率的前提下提升推理效率的能力。其解决方案的核心是提出一种名为RECAP（REdundancy-aware Credit Assignment via Propagation）的新方法，通过联合建模“结构责任”（structural responsibility）与“步骤有效性”（step efficacy）来实现更精准的信用分配。其中，结构责任通过基于大语言模型（LLM）标注的语义依赖图，从最终答案节点反向传播信用，量化某一步骤对后续推理的依赖强度；而步骤有效性则通过分析每一步加入后真实答案的对数似然变化，衡量其对正确解题方向的推进作用。二者结合将整体轨迹级优势重构为针对每个步骤的更新信号，无需额外训练过程奖励模型或预构建简洁轨迹。实验表明，在两个7B参数规模模型及四个数学推理基准上，RECAP显著提升了准确率-效率权衡：以Qwen2.5-Math-7B为例，在所有基准上相较GRPO方法提升pass@1 2.0–3.7个百分点的同时，推理词元数减少8%–31%，且分析显示节省主要源于减少无效推理操作与死胡同路径，而非表达压缩。
链接: https://arxiv.org/abs/2609.27156
作者: Yuqing Zhou,Hong Wang,Manqing Mao,Zhuoer Wang,Samson Koelle,Jie Yuan,Yanjun Lin,James Feng,Nikki Lijing Kuang,Ziwei Zhu,Wei Niu
机构: George Mason University (乔治梅森大学); Amazon, Inc (亚马逊公司)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 26 pages, 11 figures
Abstract:Large reasoning models can produce correct yet unnecessarily long reasoning traces. Existing methods improve reasoning efficiency with trajectory-level objectives or local token- and step-level signals, but rarely model inter-step semantic dependencies. This limits their ability to distinguish redundant steps from those that support later deductions, making it harder to shorten reasoning without sacrificing accuracy. We introduce RECAP (REdundancy-aware Credit Assignment via Propagation), which addresses this limitation by assigning credit where it is due based on both a step’s downstream role in the reasoning structure and its contribution to solving the problem correctly. We define structural responsibility to capture the step’s downstream role by measuring how strongly later reasoning depends on it, using credit propagated backward from the final-answer node through an outcome-independent, LLM-annotated semantic dependency graph. However, a step can have high structural responsibility yet steer the reasoning away from the correct solution. RECAP therefore introduces step efficacy to measure answer-directed progress through changes in gold-answer log-likelihood as each step is added. Together, these signals reshape rollout-level GRPO advantages into step-specific updates. RECAP requires neither a separately trained process reward model nor preconstructed concise trajectories. Across two 7B models and four mathematical reasoning benchmarks, RECAP improves the accuracy-efficiency trade-off. On Qwen2.5-Math-7B, it improves pass@1 by 2.0-3.7 percentage points while reducing reasoning tokens by 8%-31% relative to GRPO across all four benchmarks. Analysis suggests these savings reflect fewer reasoning operations and less dead-end reasoning, rather than more compact expression.
[NLP-78] Feed the Panel Dimensions Not Verdicts: Rubric-Decomposed Fusion of Vision-Language Aesthetic Judges
【速读】： 该论文旨在解决当前视觉-语言模型（VLMs）作为图像美学评分零样本裁判时的可靠性问题，尤其针对现有实践中采用多模型集成（面板）以提升判断准确性的做法提出质疑。研究发现，在两个经人类评分的数据集EVA和PARA上，由多个VLM组成的面板其整体表现从未显著优于其中最优单个模型，无论采用平均或学习型融合策略。其核心解决方案在于：不再依赖模型对图像的全局美学判断，而是让每个模型基于一个固定的人类撰写的五维评分量表（rubric）对图像进行分维度打分，并结合各模型家族的维度评分与原始判断结果，通过交叉验证的外部组合器（out-of-fold combiner）进行融合。实验表明，这种分维度评分机制能有效捕捉其标签所声称的特定属性信息，在28/30的模型-属性组合中，其信息量超过全局评分提示；融合后的结果在所有十组三模型家族面板上均超越最佳单个VLM，尤其在EVA数据集上，相对于最优单模型分别取得+0.07（最强三模型组合）和+0.10（预声明组合）的斯皮尔曼等级相关系数提升，且在不同交叉验证分区下均保持稳定增益；在PARA数据集上达到与人类评分相当的性能水平，仅在肯德尔等级相关系数上存在微小但不显著的损失。该优势并非源于特征数量的统计偏差，因为若仅使用相同数量的纯全局评分列进行同样组合，则无法复现该效果。该方法虽需额外数百条标注数据（不可跨数据集迁移）及约4.8倍于原方案的API调用开销，但其有效性通过配对自助法（paired bootstraps）与肯德尔tau-b检验得到验证，并报告了失败的预注册及失效配置以确保透明性。
链接: https://arxiv.org/abs/2609.27110
作者: Amit Jadhav,Shaurya Beriwala,Beomjin Kim
机构: Purdue University Fort Wayne(普渡大学福灵顿校区)
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 19 pages, 7 figures
Abstract:Vision-language models (VLMs) are deployed as zero-shot judges of image aesthetics, and panels of several models are recommended, on thin evidence, as the way to make such judges reliable. On two human-rated datasets, EVA and PARA, we find that a panel of holistic judges never significantly beats its best member, whether the verdicts are averaged or fused by a learned combiner. What a panel is worth depends on what it is fed. We therefore have each model score each image on the five dimensions of a frozen, human-written rubric and fuse those scores, alongside each model’s verdict, across model families with an out-of-fold combiner. The dimension scores measure what their labels claim: with the overall human score partialled out, a dimension prompt carries more attribute-specific information than the holistic prompt in 28 of 30 model-attribute cells. Fused, they beat the best single VLM in all ten three-family panels on EVA (against that best single model, +0.07 Spearman rho for the strongest trio and +0.10 for the pre-declared one, and +0.06 and +0.07 when averaged over twenty fold partitions; against the panel mean, the primary test gives +0.118 on its EVA design set), and on PARA they reach parity under Spearman rho and a small, non-significant loss under Kendall tau-b, where one model already captures 85% of the human noise ceiling. It is not a feature-count artefact: giving the same combiner an equal number of pure holistic columns, split from the same repetitions, does not reproduce it. The gain costs a few hundred labels, which do not transfer between datasets, and 4.8x the API calls on EVA; we report it with paired bootstraps and Kendall tau-b, alongside a failed pre-registration and the configurations that lost.
[NLP-79] NADI 2026: The Second Multidialectal Arabic Speech Processing Shared Task
【速读】： 该论文旨在解决多方言阿拉伯语语音处理中的鲁棒性与泛化能力问题，特别是在低带宽、混合方言、代码切换、域外数据及零样本等真实场景下的挑战。其核心解决方案在于构建一个涵盖自动语音识别（ASR）、口语方言识别（SDID）、语音合成（TTS）、口语翻译（SLT）和口语理解（SLU）的综合性评测框架，首次将TTS、SLT和SLU引入NADI系列任务，并通过多任务、多设置的复杂评估环境推动模型在跨方言、跨域场景下的性能提升。关键创新点包括：采用阿拉伯语专用语音模型、多模态方言识别方法以及集成学习策略，显著提升了系统在非理想条件下的表现，验证了当前技术在应对现实世界复杂性方面的有效性，为未来鲁棒性阿拉伯语语音处理研究提供了更全面、更具挑战性的基准。
链接: https://arxiv.org/abs/2609.27086
作者: Peter Sullivan,Bashar Talafha,Ahmed Ashraf,Fethi Bougares,Haroun Elleuch,Chiyu Zhang,AbdelRahim Elmadany,Youssef Mohamed,Salima Mdhaffar,Yannick Estève,Mohamed Elhoseiny,Hamzah Luqman,Nizar Habash,Muhammad Abdul-Mageed
机构: The University of British Columbia(不列颠哥伦比亚大学); King Fahd University of Petroleum and Minerals(法赫德国王石油矿产大学); Avignon Université(阿维尼翁大学); ELYADATA; King Abdullah University of Science and Technology(阿卜杜拉国王科技大学); NYU Abu Dhabi(纽约大学阿布扎比校区); Canada Research Chair in NLP and ML(加拿大自然语言处理与机器学习研究主席)
类目: Computation and Language (cs.CL)
备注:
Abstract:NADI 2026 is the seventh edition of the Nuanced Arabic Dialect Identification (NADI) shared task series and the second dedicated to multidialectal Arabic speech processing. This edition comprises five tasks and eight subtasks spanning Automatic Speech Recognition (ASR), Spoken Dialect Identification (SDID), Text-to-Speech (TTS), Spoken Language Translation (SLT), and Spoken Language Understanding (SLU). NADI 2026 emphasizes realistic evaluation through low-bandwidth, mixed-dialect, code-switched, out-of-domain, and zero-shot settings, while introducing TTS, SLT, and SLU to the series for the first time. The shared task attracted 21 participating teams from at least 13 countries, with 48 test-phase submissions and 14 submitted system-description papers. Results show that out-of-domain generalization remains a major bottleneck and highlight the effectiveness of recent Arabic-specialized speech models, multimodal dialect identification approaches, and ensemble methods. Overall, NADI 2026 provides a broader and more challenging benchmark for robust Arabic dialect speech processing.
[NLP-80] ChipMEM: Verification-Grounded Memory for EDA Agents
【速读】： 该论文旨在解决大语言模型（Large Language Model, LLM）驱动的电子设计自动化（Electronic Design Automation, EDA）代理在生成与修订寄存器传输级（Register-Transfer Level, RTL）设计过程中，因依赖任务特定反馈而导致可迁移知识匮乏的问题。现有方法通常基于执行轨迹中的可复用技能提炼或利用EDA工具反馈生成的奖励进行训练，但这些方法多在产生经验的任务上进行评估，导致模型倾向于学习任务特异性修正策略而非具备泛化能力的通用知识。为此，本文提出ChipMEM——一种基于验证的内存层架构，其核心在于构建跨任务的过程性记忆与轨迹内统计引导相结合的记忆机制：过程性组件仅在技能通过综合、仿真或形式化验证后才予以存储，避免依赖模型自评估；贝叶斯组件通过分层Beta分布估计工具调用结果，对在相似错误情境下成功恢复的策略进行排序；统一适配器使该记忆接口可同时应用于RTL优化与测试平台生成代理，保持各领域工具链与验收标准的一致性。实验表明，在相同模型与工具设置下，ChipMEM在RTLRewriter-Bench上实现39/54个设计通过等价性验证（无记忆时为35/54），在短套件中平均面积优化提升达8.69%（对比5.66%）；在未见的CVDP任务上，使用冻结的过程性知识库仍能实现20/20的接受率（无记忆时为18/20），充分验证了所学技能的有效迁移能力。
链接: https://arxiv.org/abs/2609.27067
作者: Abdulrahman AlRabah,Joshua Mabry,Dilek Hakkani-Tür,Abdussalam Alawini,Hamid Shojaei,Kartik Hegde,Sandesh Adhikary
机构: University of Illinois Urbana-Champaign(伊利诺伊大学厄本那-香槟分校); NVIDIA(英伟达); Cadence(楷登)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Large language model (LLM)-based agents use Electronic Design Automation (EDA) tools to generate and revise register-transfer-level (RTL) designs under synthesis and verification feedback. Recent methods learn from this feedback by distilling reusable skills from execution traces or by training on rewards derived from EDA-tools. Both methods are typically evaluated on the tasks that produced the experience. Repeated access to benchmark feedback on the same task can reward task-specific revision rather than creating reusable knowledge that transfers. We introduce ChipMEM, a verification-grounded memory layer for EDA agents. It combines cross-task procedural memory with within-trajectory statistical guidance. Its procedural component distills and stores a skill only after it passes synthesis, simulation, or formal checks, rather than relying on model self-assessments. A Bayesian component maintains hierarchical Beta estimates over tool-call outcomes and ranks recovery strategies that succeeded under comparable errors. A common adapter applies the same memory interface to RTL optimization and testbench-generation agents while preserving each domain’s tools and acceptance criteria. We measure performance on training tasks and evaluate whether learned skills transfer to unseen tasks. On RTLRewriter-Bench, under matched model and tool settings, ChipMEM produces equivalence-passing outputs on 39/54 scored designs versus 35/54 without memory; on the 49-design short suite, mean area improvement is 8.69% versus 5.66%. On held-out CVDP tasks, ChipMEM with a frozen procedural library achieves 20/20 accepted outcomes versus 18/20 without memory in a single evaluation per setting.
[NLP-81] What Changes When Fact-Verification Scores Improve? Evidence and Answer Accounting Across Trained Verifiers and LLM s
【速读】： 该论文旨在解决在事实验证任务中，当评估指标（如严格得分，strict score）提升时，这种提升中有多少是源于证据（evidence）质量的改进，而非答案（answer）本身的改变。其核心问题是：在保持生成答案不变的前提下，仅更换提交的证据是否能显著提升整体评分？解决方案的关键在于引入“联合事实验证得分”（joint fact-verification score），并设计对照实验，通过固定答案而替换证据来源（如将DCUF证据替换为UnifEE证据），量化证据改进对严格得分的贡献。研究发现，在FEVEROUS数据集上，仅更换证据即可带来高达9.61个百分点的严格得分提升，远超答案准确率仅1.96个百分点的增长；进一步分析表明，即使答案固定，证据质量的提升仍可解释大部分性能增益，且该效应受上下文长度、大语言模型（LLM）类型及评估设置的影响。此外，研究强调了端点指标与聚合统计量可能掩盖个体声明层面的真实模式，因此需结合多维度的后验分析来揭示答案与证据之间复杂的交互关系。
链接: https://arxiv.org/abs/2609.27064
作者: Han Chen,Yingrui Li
机构: 未知
类目: Computation and Language (cs.CL)
备注: 24 pages. Both authors contributed equally
Abstract:A joint fact-verification score assesses answers and submitted evidence together. When the score improves, how much of the gain remains if the answers are held fixed? On FEVEROUS, strict score is the percentage of claims with a correct answer and a complete annotated evidence group in the submitted evidence. Across four trained DeBERTa checkpoints and 7,890 claims, replacing DCUF evidence with UnifEE evidence raises strict score by 9.61 percentage points, compared with 1.96 percentage points in answer accuracy. The paired 95% interval for the strict-score gain is [8.77, 10.43], conditional on these checkpoints. Replacing only the evidence passed to the scorer accounts for 7.92 or 9.08 percentage points when we retain the answers generated from DCUF or UnifEE evidence, respectively. To examine how this evidence gain depends on evaluation choices, we generate 470,400 responses from two 8B LLMs on FEVER, FEVEROUS, and SciFact under two answer formats and two context budgets. Increasing context from 256 to 2,048 tokens raises the fixed-answer evidence gain on FEVEROUS by 3.84 and 3.10 percentage points for Qwen and Llama, respectively. The effects fall short of the prespecified cross-dataset criterion, while some intervals extend beyond the two-point small-effect bound. Post-hoc analyses quantify changes in answers and submitted evidence, and show when aggregate accuracy and evidence-coverage rates miss the claim-level pattern. The four answer-evidence score combinations reveal changes that endpoint and aggregate metrics leave unresolved.
[NLP-82] he Illinois Social Attitudes Aggregate Corpus (ISAAC): An Open Tool and Reproducible Pipeline for Analyzing Social Group Discourse at Scale
【速读】： 该论文旨在解决社交媒体中关于社会群体议题（包括种族、性取向、年龄、身体能力、体型及肤色等六类关键社会群体区分）的文本数据难以获取、研究碎片化且缺乏可重复性的问题。其核心挑战在于如何构建一个大规模、高质量、结构化且可公开访问的语料库，以支持对社会态度长期演变、区域差异及宏观社会趋势关联性的系统性分析。解决方案的关键在于提出并实现伊利诺伊社会态度聚合语料库（ISAAC），通过多阶段人工审核的过滤流程将无关内容控制在10%以下，并结合算法自动标注用户估计居住地与一系列经验证的语义标签（如道德化程度、情感倾向、情绪状态及语言泛化水平），从而实现对5.27亿条英文Reddit帖子的精细化结构化处理。此外，ISAAC采用模块化、开放的架构设计，支持跨平台、跨语言和跨社会范畴的扩展，同时提供无需编码的图形界面与多种程序化接口（如SQL Playground、Python包、HuggingFace），显著提升了研究的可及性与可复制性，为大规模社会态度研究提供了统一、可扩展且可验证的数据基础设施。
链接: https://arxiv.org/abs/2609.27059
作者: Babak Hemmatian,Sarah Hadjarab,Jessica Chen,Benedek Kurdi
机构: 未知
类目: Computation and Language (cs.CL); Social and Information Networks (cs.SI)
备注: Submitted to Behavior Research Methods
Abstract:We introduce the Illinois Social Attitudes Aggregate Corpus (ISAAC), an open, modular, and accessible corpus of 527 million+ English-language Reddit posts selected for relevance to six key social group distinctions based on race, sexuality, age, ability, body weight, and skin tone, covering the 17-year period from 2007 to 2023. A multi-step, human-audited filtering pipeline was used to keep irrelevant content in the curated dataset below 10%, both overall and for each social group distinction. Each post was then algorithmically annotated with the user’s estimated home region, along with a suite of validated off-the-shelf and custom semantic labels including moralization, sentiment, emotion, and linguistic generalization. We confirm the validity of the resulting corpus through convergent evidence linking ISAAC to macro-level societal trends, such as online search behavior, temporal spikes during major societal events (both nationally and regionally), and long-term shifts in public attitudes. By offering a unified, public infrastructure, ISAAC eliminates research fragmentation and enables seamless replication while supporting diverse empirical workflows at scale. Specifically, ISAAC allows investigators to perform cross-category comparisons, conduct high-precision tracking of long-term temporal shifts in social group discourse, and map spatial variation onto localized public opinion and policy outcomes. ISAAC’s fully public, modular pipeline facilitates easy extension of the corpus to new platforms, languages, and social categories. To accommodate various research needs, ISAAC is accessible both without coding through a point-and-click website and labeler web-apps, and programmatically via an SQL playground, a Python package, and HuggingFace.
[NLP-83] EduBehaviors: Assertion-based Schemas for Auditable Coding of Educational Dialogues
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在教育数据标注中因推理过程不透明而导致的可解释性缺失问题。尽管LLMs能够高效生成与教育构念相关的注释并支持自然语言接口，但其决策机制缺乏可验证的、机械性的洞察力，难以解释为何对某条对话样本赋予特定标签。为此，论文提出EduBehaviors框架，其核心解决方案是通过LLMs识别一系列可重复观测的行为（observable behaviors），这些行为与多种教育构念相关，随后基于这些可观测行为构建可解释的分类器来预测目标构念。该方法兼顾了可解释性与可扩展性，显著提升了标注结果的透明度。在TalkMoves数据集上的实验表明，最佳配置下达到宏平均F1为0.673、Cohen’s kappa为0.688，性能与直接提示（direct prompting）方法相当。此外，研究团队发布了EduBehaviors Toolkit，包含两个工具，助力研究者将其框架应用于自身数据，实现教育数据的可复现、可解释标注。
链接: https://arxiv.org/abs/2609.27043
作者: Julian Bernado,Ana Trindade Ribeiro,Xander Beberman,Susanna Loeb
机构: SCALE Initiative, Stanford University (斯坦福大学)
类目: Computation and Language (cs.CL); Computers and Society (cs.CY); Machine Learning (cs.LG)
备注:
Abstract:Large language models have allowed the rapid deployment of pedagogical annotations corresponding to constructs of interest, allowing a natural language interface for generating classifications on a conversational dataset. However due to the opaque nature of LLM reasoning, we have no verifiable, mechanistic insight into why a model chose a label for an utterance. We introduce the EduBehaviors framework, an interpretable, scalable approach to annotating educational data that uses LLMs to measure repeated observable behaviors relevant to many constructs of interest and then learns a classifier for the construct based on these observable behaviors. We evaluate the framework on the TalkMoves dataset, predicting the Teacher TalkMoves labels. Our best configuration results in a macro-F1 of 0.673 and 0.688 Cohen’s kappa, proving competitive with direct prompting approaches. In addition, we release EduBehaviors Toolkit, two tools allowing researchers to operationalize the EduBehaviors framework in their own data.
[NLP-84] LexLattice: Multilingual Extractive Summarization via Neural Cellular Automata on Document Hierarchies
【速读】： 该论文旨在解决法律文本摘要中“忠实性”（faithfulness）的核心挑战，即如何在保持摘要内容可追溯至原文的基础上，有效整合分散于长文档不同部分且具有共同语义重要性的证据。传统抽取式方法通常孤立地对段落等结构单元进行排序，忽视了跨距离文本片段间的语义关联与证据协同。其解决方案的关键在于提出LexLattice，一种将法律文件的层级结构显式建模为二维语义格栅（semantic lattice）的抽取式摘要模型，并通过掩码二维神经元胞自动机（masked 2D neural cellular automata）在该格栅上进行上下文感知的证据整合。该模型仅在冻结的多语言编码器基础上引入180万参数的可训练整合器，在EUR-Lex-Sum数据集所有24种语言的多语言与跨语言设置下均达到当前最优的ROUGE得分，显著优于参数量达数十亿的指令微调基线模型。进一步实验表明，仅在高资源语言上训练的整合器在低资源语言上仍能实现近乎无损（0.99）的迁移性能，表明其运作机制基于语言无关的语义几何结构而非表层形式。研究结果表明，基于文档结构显式整合证据的方法，是一种高效、可追溯且易于扩展的多语言法律摘要新范式。
链接: https://arxiv.org/abs/2609.27032
作者: Sujay Uday Rittikar,Sheela Ramanna
机构: The University of Winnipeg (温尼伯大学); Applied Computer Science (应用计算机科学)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG); Neural and Evolutionary Computing (cs.NE)
备注: 14 pages, 4 figures
Abstract:Faithfulness is a central concern in legal text summarization, which motivates extractive approaches that select verbatim content traceable to its source. Such methods typically rank paragraphs or other structural units in isolation, yet give little attention to consolidating evidence that is distributed across, and shares salience between, distant parts of a document. We introduce LexLattice, an extractive summarizer that reifies a legal act’s hierarchy as a two-dimensional semantic lattice and consolidates over it with a masked 2D neural cellular automata before selection. LexLattice attains state-of-the-art ROUGE across all 24 languages of EUR-Lex-Sum in both multilingual and cross-lingual settings, surpassing instruction-tuned baselines with billions of parameters, despite concentrating all trainable capacity in a 1.8M parameter consolidator over a frozen multilingual encoder. A consolidator trained only on high-resource languages further transfers to unseen languages with near-lossless retention (0.99), indicating that the model operates on language-agnostic semantic geometry rather than surface form. Our results position explicit consolidation over document structure as a compact and traceable alternative to scale for multilingual legal summarization.
[NLP-85] Classifying Interpretive Canons at the Sentence Level: A Benchmark from the German Federal Constitutional Court ICML2026
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在司法推理中对法律解释法则（interpretive canons）识别能力不足的问题。其核心挑战在于如何有效评估LLMs对以萨维尼（Savigny）传统为背景、由拉伦茨（Larenz）系统阐述的法律解释原则的理解与分类能力。解决方案的关键在于构建一个句级基准测试（sentence-level benchmark），通过将法律解释法则转化为可操作的分类标准，提供了一个基于德国联邦宪法法院判决文书的细粒度句级标注数据集，并在此基础上对四种来自三个不同模型家族的LLM进行基线评估。实验采用专家手工设计提示词（hand-written prompts）与遗传-帕累托优化提示词（GEPA-optimized prompts）进行对比，结果显示，在所测试配置下，尽管不同模型在七项二分类子任务上的平均F1值介于70.4至79.2之间，且语法解释通常较易识别而体系解释最困难，但优化后的提示词并未系统性优于人工设计提示，表明专家提示已构成具有实际意义的基准水平。
链接: https://arxiv.org/abs/2609.26945
作者: Felix Ringe
机构: Freie Universität Berlin (柏林自由大学)
类目: Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: accepted at the ICML 2026 AI4Law Workshop; 32 pages (main text 9 pages + appendices 23 pages)
Abstract:Judicial reasoning remains challenging for large language models (LLMs) to analyze. This paper contributes a sentence-level benchmark for evaluating the ability of LLMs to classify interpretive canons as articulated by Larenz in the tradition of Savigny. Our contributions are threefold. First, we operationalize this conception of interpretation as classification criteria. Second, we provide a dataset of decisions of the German Federal Constitutional Court annotated at the sentence level. Third, we report baseline evaluations of four LLMs from three model families under expert hand-written prompts, compared against prompts optimized with Genetic-Pareto (GEPA). Mean F1 over the seven binary subtasks clusters between 70.4 and 79.2 across models, with grammatical interpretation usually the easiest canon to identify and systematic interpretation usually the hardest; under the tested configuration, GEPA-optimized prompts do not systematically outperform the hand-written ones, suggesting that the expert prompts provide a meaningful baseline.
[NLP-86] Recognized but Not Produced: A Generation Benchmark for Culturally Specific Kinship Terms ACL EMNLP2026
【速读】： 该论文旨在解决当前多语言亲属关系理解评估中过度依赖多项选择题基准所带来的局限性问题，即现有方法将亲属关系理解视为一种识别任务（recognition problem），忽视了生成能力在真实语境下的关键作用。其解决方案的关键在于引入基于生成的评估范式，通过让五种开源大语言模型（LLM）在三种非西方语言（印地语、泰米尔语和韩语）中针对两种交际任务生成亲属称谓，并与传统的选项支持选择基线进行对比。研究发现，尽管在多项选择条件下模型准确率较高（如GPT OSS120B达90.67%），但在自由生成任务中仅能产出可接受术语的比例显著下降（如36.00%），表明模型在实际语言生成层面仍存在明显短板。此外，不同语言间表现差异显著，如印地语中父系谱系优势明显，而韩语中则不显著甚至逆转，泰米尔语中的共享术语对则有效控制了测量偏差。这些结果揭示出文化特定亲属关系的生成仍具挑战性，即便在关系明确提示下亦然，因而强调应将生成式评估（generation-based evaluation）与传统选择题测试相结合，以更全面衡量模型的跨文化语义理解能力。
链接: https://arxiv.org/abs/2609.26942
作者: Sahil Pardasani,Madhusudan Singh
机构: Blockchain Data Intelligence Lab; The Pennsylvania State University (宾夕法尼亚州立大学); University Park, PA, USA
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Accepted at (ORACLE Workshop), EMNLP 2026
Abstract:Current literature evaluates large language models (LLMs) on multilingual kinship understanding using multiple choice benchmarks, treating it as a recognition problem. We instead prompt five open weight LLMs to generate kinship terms in three non Western languages (Hindi, Tamil, and Korean) across two communicative tasks and pair this with a matched option-supported selection baseline. On identical relation language cells, GPT OSS120B selects the correct term in 90.67% of 75 valid cells but produces an accepted term in 36.00% of the corresponding attempts; Llama 3.370B shows the same pattern (77.92% versus 24.24%). Since the four-option condition displays the candidate terms and does not require script production, the difference is interpreted as an evaluation format gap rather than direct proof that lexical knowledge is intact. On explicitly specified L3 prompts, accuracy varies sharply, from GLM-5.1 at 72.29% to Llama-3.370B at 24.24%. The paternal-lineage advantage is language specific; it is large in Hindi but weak or reversed in Korean, while Tamil shared-term pairs provide a control for measurement variation. These results show that culturally specific kinship generation remains difficult even when the relationship is explicitly stated and motivate generation-based evaluation alongside multiple-choice testing.
[NLP-87] Which Objectives Need a Dial? Predicting Objective Conflict and Covering Trade-offs in Steerable Pluralistic Alignment
【速读】： 该论文旨在解决多用户价值冲突下单一对齐模型难以满足所有需求的问题，提出通过可调节的生成式AI（Generative AI）模型实现多元对齐（Pluralistic Alignment），以灵活平衡多个相互竞争的目标。其核心解决方案在于采用多目标直接偏好优化（Multi-Objective Direct Preference Optimization, MODPO），通过调整目标权重在不同权衡之间构建连续的折衷路径。研究发现，基于人类标注数据的两个预训练阶段指标可有效预测目标间的协同或冲突关系，但该预测在由AI标注的数据上失效，因响应长度与重复性会干扰奖励模型评分。为实现更广泛的权衡覆盖，选择最近训练的模型或合并模型参数虽具一定效果，但均无法稳定达到直接训练的效果。研究结果为高效构建可调节的生成式AI系统提供了实用指导，强调在设计时需关注数据标注方式及模型集成策略。
链接: https://arxiv.org/abs/2609.26929
作者: David Tsoi,Esra Dönmez
机构: University of Stuttgart(斯图加特大学); Institute for Natural Language Processing(自然语言处理研究所); Interchange Forum for Reflecting on Intelligent Systems(智能系统反思交流论坛)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: Preprint
Abstract:People hold diverse, sometimes conflicting values, so no single aligned model can satisfy everyone. Pluralistic alignment therefore calls for steerable models that can balance competing objectives differently. Multi-Objective Direct Preference Optimization (MODPO) does this by using an objective weight to span a continuum of trade-offs. We study two questions: when can one model improve two objectives simultaneously, and how can many trade-offs be covered without training a separate model for each? Across seven objective pairs from HelpSteer and UltraFeedback, two pre-training measurements predict whether objectives align or conflict for human-annotated data, but not for AI-annotated data, where response length and repetition confound reward-model scores. For broader trade-off coverage, selecting the nearest trained model and merging model parameters both help, but neither consistently matches direct training. These findings yield practical guidance for building steerable models that serve diverse preferences.
[NLP-88] COMED: The Missing Middle Between Routing and Collaboration in Multi-LLM Inference AACL
【速读】： 该论文旨在解决单一大型语言模型（LLM）在不同查询任务中可靠性不一致的问题，提出通过多模型推理系统实现更稳健的输出。现有方法存在两大局限：路由机制仅在初始阶段选择模型，缺乏后续协作；而密集式协同则对每个查询都调用所有模型，导致计算开销大且可能引入错误。论文指出，模型间协作具有非单调性——既可修复单个模型无法解决的问题，也可能破坏原本正确的答案。为此，作者提出COMED（可控模型升迁的多模型审慎推理框架），其核心是引入一种后锚点控制机制，通过自一致性检验、路由器置信度边界以及轻量级同伴探测，实现选择性跨模型协作。该方法基于“救援-伤害”分解理论，明确在被挽救的错误数量超过协作引发的错误时，选择性协作才具备优势。实验表明，在医学、科学及通用推理等16个开源权重基准上，COMED均优于固定与路由基线，最高在MedQA上提升10.7个百分点；在前沿模型HLE场景下，使GPT-5.5准确率从23.1%提升至28.1%，显著优于密集协作策略，同时减少模型调用次数和解码令牌消耗。
链接: https://arxiv.org/abs/2609.26913
作者: Norah Alballa,Wenxuan Zhang,Salma Kharrat,Fares Fourati,Zafar Ayyub Qazi,Mohamed Elhoseiny,Marco Canini
机构: KAUST(沙特阿拉伯阿卜杜拉国王科技大学); LUMS(巴基斯坦拉赫里大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Accepted at AACL-IJCNLP 2026
Abstract:No single Large Language Model (LLM) is uniformly reliable across queries, motivating multi-model inference systems that either route among models or combine their outputs. However, routing stops after selecting an initial model, while dense collaboration invokes peers on every query. We show that collaboration is non-monotonic: peers can recover failures that no model solves alone, but can also corrupt initially correct answers. We introduce COMED (Controlled Model Escalation for Multi-LLM Deliberation), a post-anchor controller for selective cross-model collaboration. COMED uses anchor self-consistency, router margin, and a lightweight peer probe to accept confident answers, verify ambiguous cases, and escalate only when collaboration is likely beneficial. We formalize this trade-off with a rescue-harm decomposition showing that selective collaboration improves when rescued errors outweigh collaboration-induced harms. Across medical, scientific, and general reasoning benchmarks, COMED improves fixed and routed anchors in all 16 open-weight settings, with gains up to +10.7 percentage points on MedQA while invoking fewer models and using fewer decoded tokens than dense collaboration. On HLE with frontier models, COMED improves GPT-5.5 from 23.1% to 28.1%, outperforming dense collaboration and achieving the best results.
[NLP-89] Small Cues Big Consequences: Learning Pivotal Cues for Multimodal Meme Classification EMNLP2026
【速读】： 该论文旨在解决多模态内容中，如网络迷因（meme）因其细微但关键的视觉、文本或跨模态线索而产生有害、仇恨或讽刺意义，而现有基于全局图像-文本表示的多模态分类模型往往忽视这些局部关键证据的问题。其解决方案的关键在于提出一种以线索为中心的框架——MemePIVOT，该框架采用冻结的CLIP特征，通过非平衡最优传输（unbalanced optimal transport）实现词元与图像块之间的对齐，同时允许无关线索保持未匹配状态，从而精准聚焦于具有决定性作用的证据；在此基础上，引入证据融合头（evidential fusion head），在不确定性环境下结合局部定位信息与全局迷因上下文，实现更鲁棒的分类。实验表明，该方法在HarMeme、PrideMM和新提出的MemeCF基准上均显著优于强基线模型，且跨数据集验证与消融分析进一步证明，显式建模关键证据能有效提升模型鲁棒性，并在全局多模态表征之外带来实质性性能增益。
链接: https://arxiv.org/abs/2609.26907
作者: Akshit Sharma,Prashant W. Patil
机构: CVPR Lab, MFSDSAI; Indian Institute of Technology Guwahati (印度理工学院古瓦哈蒂分校)
类目: Multimedia (cs.MM); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Accepted to EMNLP 2026 Findings
Abstract:Memes often derive their harmful, hateful, or sarcastic meaning from small but decisive visual, textual, or cross-modal cues. Existing multimodal classifiers can miss such evidence when relying mainly on global image-text representations. We introduce MemeCF, a cue-focused benchmark of 9,895 memes across harm, hate, and sarcasm, with annotations identifying the modality and rationale of the pivotal evidence. We also propose MemePIVOT, a local-global architecture for meme classification. MemePIVOT uses frozen CLIP features, unbalanced optimal transport to align words with image patches while allowing irrelevant evidence to remain unmatched, and an evidential fusion head to combine local grounding with global meme context under uncertainty. Experiments on HarMeme, PrideMM, and MemeCF show consistent gains over strong text-only, image-only, multimodal, and vision-language baselines. Cross-dataset and ablation results further show that explicit pivotal-evidence modeling improves robustness and contributes meaningfully beyond global multimodal representations. Our code and dataset are publicly available at this https URL
[NLP-90] xt Scores Can Miss Waveform Use: A Qwen 2-Audio Quantization Case Study
【速读】： 该论文旨在解决后训练量化（post-training quantization）在语音语言模型评估中存在的重要缺陷：仅依赖文本输出评分和名义比特宽度无法充分反映模型在实际运行时的行为表现，尤其忽略了语音信号中未在转录文本中体现的信息，以及特定运行环境下的效率特性。其核心解决方案是提出一种新的评估协议，将评估维度解耦为三类独立任务：词汇输出（lexical output）、依赖转录文本不足的端到端行为（transcript-insufficient endpoint），以及经过压缩打包的实际实现效率（measured packed implementation）。通过Qwen2-Audio案例研究发现，在6比特预算下，基于翻译任务选择的量化分配虽使chrF提升2.36（95%置信区间[1.04, 3.62]），但在说话人无关的情感识别任务上却损失3.91个百分点；而均匀结构控制与前层控制策略在相同比特预算下均优于选择性分配，且7比特时前者仍保持优势，情感识别性能与浮点精度（FP16）相比无显著差异。此外，4.08比特的匹配预算实验表明，所有低比特方案均存在约10个百分点的情感识别性能下降，且无选择性分配的优势。最后，去量化模拟显示平均6比特配置仍维持原始FP16峰值内存占用。该研究揭示了词汇输出、波形相关行为与名义精度之间存在显著依赖精度的不匹配现象，但并未证明低比特语音模型普遍失效，也未证实选择性分配在部署中的优越性。
链接: https://arxiv.org/abs/2609.26823
作者: Mengzhe Geng,Jinxi Jin,Junhao Xu
机构: National Research Council Canada(加拿大国家研究委员会); The Hong Kong Polytechnic University(香港理工大学); The Chinese University of Hong Kong(香港中文大学)
类目: ound (cs.SD); Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
备注:
Abstract:Post-training quantization of speech language models is often summarized with text-output scores and nominal bit widths. Those numbers alone do not establish behavior that depends on information missing from a transcript, or efficiency for a particular runtime. We introduce an evaluation protocol that separately tests lexical output, a transcript-insufficient endpoint, and a measured packed implementation. In a Qwen2-Audio case study, a translation-selected 6-bit allocation improves chrF by 2.36 on a frozen English-to-German replay, with paired 95% bootstrap interval [1.04, 3.62], but loses 3.91 percentage points on speaker-disjoint emotion recognition. At the same 6-bit budget, the uniform structural control reaches higher emotion accuracy than the selected allocation, and the front-layer control is also higher by point estimate on the same frozen set. At 7 bits, chrF improves by 3.28 with interval [2.08, 4.59], the emotion interval against FP16 includes zero, and a same-budget front-layer control still exceeds the selected allocation. A separate matched-budget 4.08-bit study finds roughly 10-point emotion deficits for every tested low-bit allocation and no selected-allocation advantage over frozen controls. Finally, a dequantized average-6-bit simulation retains the FP16 peak memory. This case study identifies a precision-dependent mismatch between lexical output, waveform-dependent behavior, and nominal precision. It does not establish a general failure of low-bit speech models or a deployment benefit for the selected allocation.
[NLP-91] Semantic Self-Distillation for Language Model Uncertainty UAI2026
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在不确定性量化方面面临的挑战，尤其是由于模型复杂性及输出多样性导致的难以进行系统性不确定性评估的问题。现有方法中，语义分散（Semantic Dispersion）虽被用作模型不确定性的有效代理指标，但其依赖多次采样计算语义分布的高计算开销限制了其在低延迟关键场景中的应用。本文提出的关键解决方案是语义自蒸馏（Semantic Self-Distillation, SSD）：将大语言模型生成的样本语义分布通过轻量级学生模型（student model）进行蒸馏，使其能够在语言模型生成首个回答标记前，基于提示（prompt）预测一个条件化的语义分布。该学生模型输出的语义分布熵可作为提示级别的不确定性信号，而分布的概率密度则支持对具体答案的可靠性评估。实验在TriviaQA和MMLU数据集上验证了该方法的有效性，表明其在幻觉预测任务上的表现可与教师模型的采样语义分散相媲美，同时进一步提供了用于域外检测和多选题答案选择的不确定性原语。因此，SSD为复杂输出空间中预测不确定性的蒸馏提供了一个通用框架，适用于超越语言建模的广泛场景。
链接: https://arxiv.org/abs/2602.04577
作者: Edward Phillips,Sean Wu,Fredrik K. Gustafsson,Boyan Gao,David A. Clifton
机构: University of Oxford; Oxford Suzhou Centre for Advanced Research, University of Oxford
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Camera-ready version, published in Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence (UAI 2026), PMLR 337:5427-5447
Abstract:Large language models present challenges for principled uncertainty quantification, in part due to their complexity and the diversity of their outputs. Semantic dispersion, or the variance in the meaning of sampled answers, has been proposed as a useful proxy for model uncertainty, but the associated computational cost prohibits its use in latency-critical applications. We show that sampled semantic distributions can be distilled into lightweight student models which estimate a prompt-conditioned density before the language model generates an answer token. The student model predicts a semantic distribution over possible answers; the entropy of this distribution provides a prompt-level uncertainty signal, and the probability density allows answer-level reliability evaluation. Across experiments on TriviaQA and MMLU, we find our student models perform competitively relative to the teacher’s sampled semantic dispersion on a hallucination prediction task, whilst offering additional uncertainty primitives for out-of-domain detection and multiple-choice answer selection. We term this technique Semantic Self-Distillation (SSD), which can serve as a general framework for distilling predictive uncertainty in complex output spaces beyond language.
[NLP-92] Geometric Uncertainty for Detecting and Correcting Hallucinations in LLM s
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在生成回答时存在幻觉（hallucination）的问题，即模型可能输出语法正确但事实错误的内容。现有不确定性量化方法缺乏统一框架，难以在提示（prompt）和答案（answer）两个层面同时评估模型的可靠性。为此，论文提出一种几何框架，通过显式建模答案嵌入空间中以提示为条件的语义分布，实现对模型不确定性的双重量化。其核心创新在于采用黑箱、基于采样的方法：针对每个提示生成多个答案，并利用典型分析（archetypal analysis）估计答案分布的几何支撑集。在提示层面，通过近似分布熵来衡量不确定性；在单个答案层面，则引入非典型性（atypicality）概念，评估其相对于批量样本的可靠性。该框架不仅可有效检测幻觉，还可通过选取最可靠的样本进行纠正。实验表明，该方法在短文本问答数据集上表现与或优于已有方法，在医疗等高风险领域尤其展现出更优性能。此外，该研究从理论上支持将语义分布作为语言模型不确定性研究的重要对象，具有重要的理论价值。
链接: https://arxiv.org/abs/2509.13813
作者: Edward Phillips,Sean Wu,Soheila Molaei,Danielle Belgrave,Anshul Thakur,David Clifton
机构: University of Oxford (牛津大学); Oxford Suzhou Centre for Advanced Research (牛津苏州先进研究院)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 24 pages, 8 figures. Camera-ready version, published in Transactions on Machine Learning Research (2026). OpenReview: this https URL
Abstract:Large language models are known to hallucinate, generating linguistically plausible but incorrect answers to questions. Uncertainty quantification has been proposed as a strategy to detect such behaviour, but existing methods lack a unified framework to assess reliability at both the prompt and answer level. We introduce a geometric framework which quantifies language model uncertainty at both levels by explicitly modelling a prompt-conditioned semantic distribution in answer embedding space. Our approach is black-box and sampling-based; we generate multiple answers per prompt, and use archetypal analysis to estimate a geometric support for the answer distribution. At the prompt level, we approximate the distribution entropy to quantify uncertainty; for each individual answer, we then use notions of atypicality to assess its reliability relative to the batch. We employ our framework to not only detect hallucinations but correct them, by selecting the batch example deemed most reliable. Experiments show that our framework performs comparably to or better than prior methods on short form question-answering datasets, and achieves superior results on medical datasets where hallucinations carry particularly critical risks. Beyond pure performance, we suggest the theoretical grounding of our work provides support for semantic distributions as useful objects of study for language model uncertainty.
信息检索
[IR-0] MultiVENT-Raw: A Benchmark for Retrieval and Reasoning over Raw Videos
链接: https://arxiv.org/abs/2609.28437
作者: Reno Kriz,David Etter,Alexander Martin,Cameron Carpenter,Debashish Chakraborty,Hannah Recknor,Reihaneh Iranmanesh,Matthew Maciejewski,Kenton Murray,Eugene Yang,Benjamin Van Durme,Aaron Steven White,Andrew Yates,William Walden
类目: Computer Vision and Pattern Recognition (cs.CV); Information Retrieval (cs.IR)
备注:
Abstract:Online information is increasingly consumed in video format. Much of this comes in the form of raw video: continuous footage taken on a cell phone, with a hand-held camera, or via CCTV, which is then directly uploaded to social media platforms and content sharing services. Whereas professional or even amateur-edited footage tends to feature scripted speech, chyrons, graphics, and metadata that help contextualize its subject matter, raw video typically contains none of these things, making it a much more challenging medium for information retrieval and machine understanding. To facilitate progress in this domain, we release MultiVENT-Raw, a multilingual collection of nearly 120,000 primarily raw videos (over 5,300 total hours), paired with 130 events and 222 event-centric queries, along with human-annotated video relevance judgments and human-extracted key facts for relevant videos. MultiVENT-Raw supports both a retrieval task—to identify videos in the collection relevant to a query event—and a generation task—to summarize event-related videos into a coherent report for a target user. We benchmark strong baselines on MultiVENT-Raw, showing both tasks to be challenging even for some of the latest multimodal models.
[IR-1] Beyond a Scalar: Distributional Serving Interfaces for Watch-Time Prediction
链接: https://arxiv.org/abs/2609.28383
作者: Xuan Liu,Jingbin Qian,Zhanyu Liu,Hefeng Zhou
类目: Information Retrieval (cs.IR)
备注:
Abstract:Watch time is the primary engagement signal in short video feeds, and its prediction directly affects ranking and exposure. Existing methods improve watch time prediction by correcting duration bias or modeling richer distributions, but most expose only an expected or debiased watch time at serving time. Even when video duration is available to later models, the interface gives only one estimate of watch time and no probabilities for completion, overplay, or other regions relevant to downstream tasks. To address this limitation, we propose the Distributional Serving Interface (DSI), which has a distribution provider, a compact, low-dimensional summary, and lightweight readouts tailored to each task. The provider learns a joint distribution over four watch states derived from watch ratio and their event times; rules based on video duration remove incompatible combinations, while a restoration loss preserves accuracy in seconds. The summary reduces this distribution to a small set of event probabilities, time scales relative to duration, and uncertainty statistics. After training the provider, we fix its parameters and train value and ranking readouts that combine the summary with raw context. Across KuaiRec, KuaiRand-1K, and WeChat21, the complete DSI system achieves the lowest MAE on all three datasets, beating the strongest result among nine baselines by 1.9% to 8.5%, and achieves the best XAUC on two. It also leads retrieval metrics that account for video duration when complete systems are compared. With matched readouts held constant, the summary retains information relevant to each task beyond a predicted mean paired with video duration. Using the same lightweight linear heads for each new target, it also performs best on two new watch-time targets and improves a separately logged engagement target, while a randomly initialized provider does not reproduce this gain.
[IR-2] Entangle: Uncovering Collaboration in the GitHub Quantum Software Ecosystem
链接: https://arxiv.org/abs/2609.28349
作者: Angel Luis Lara-Martín,Ricardo Pérez-Castillo
类目: oftware Engineering (cs.SE); Information Retrieval (cs.IR)
备注: 2026 IEEE International Conference on Quantum Computing and Engineering (QCE)
Abstract:Quantum computing is moving from research laboratories towards early commercialization and broader socio-technical adoption, supported by sustained hardware progress and a rapidly expanding open-source software ecosystem. This momentum is especially visible on GitHub, where many quantum and hybrid software projects coexist around frameworks such as Qiskit, Cirq, PennyLane and Amazon Braket. However, this ecosystem remains fragmented, making it difficult to understand who shapes quantum software, where expertise is concentrated, how collaboration flows across organizations and disciplines, and which actors connect otherwise separated communities. This paper presents Entangle, a data-driven analysis of the open-source quantum computing ecosystem on GitHub. Starting from 71 domain keywords, Entangle identifies more than 1,500 quantum repositories, 27,000 contributors and 400 organizations, revealing an ecosystem strongly organized around four leading industrial vendors, but also supported by 2,387 contributors who connect projects, organizations and domains. These findings provide practical evidence for responsible quantum innovation by making visible patterns of influence, dependency, collaboration and knowledge transfer. They also offer actionable indicators for strategic decisions on investment, hiring, partnerships, ecosystem stewardship and capacity building. More broadly, Entangle shows how open-source intelligence can support a more transparent, measurable and governable quantum software ecosystem, helping align technical development with responsible innovation, public–private coordination and long-term sustainability.
[IR-3] Dual-Hypergraph Indexing: Bridging Knowledge Islands for Multi-Hop Reasoning in Retrieval-Augmented Generation
链接: https://arxiv.org/abs/2609.28108
作者: Qi Sun,Xingliang Hou,Caibo Li,Yijia Zhang,Qiang Li,Yu Guo
类目: Information Retrieval (cs.IR)
备注: 5 pages, 1 figures. Preprint
Abstract:While hypergraph-based Retrieval-Augmented Generation (RAG) effectively captures higher-order multi-entity correlations, existing paradigms treat extracted hyperedges as isolated factual assertions. This structural fragmentation engenders rigid “knowledge islands” that bottleneck multi-hop causal inference, temporal tracking, and narrative synthesis. To systematically address these challenges, we introduce Dual-Hypergraph Indexing (DHI), a hierarchical representation framework that elevates discrete facts into structured analytical insights. DHI couples a foundational entity-relation factual hypergraph ( H_K ) with an elevated deep-insight hypergraph ( H_D ) via a dual-pathway aggregation algorithm. Specifically, DHI employs: (1) importance-driven hub aggregation via 5-metric topological profiling and adaptive thresholding to capture spatial semantic clusters; and (2) temporal chunk-chain progressive aggregation via sliding-window greedy exploration to track chronological evolutions. Across five benchmarks, DHI achieves state-of-the-art performance, boosting logical coherence by +1.53 on the multidisciplinary Mix benchmark and scoring 85.78% on complex medical pathology reasoning tasks. DHI provides a robust architecture for next-generation multi-hop RAG.
[IR-4] Evaluating Open-Weight LLM s for Turkish Domain Documents Under Retrieval and Hardware Constraints
链接: https://arxiv.org/abs/2609.28007
作者: Imtiaz Ul Hassan,Öykü Akbulut,Onur Kaya,Ardhendu Behera,Swagat Kumar,Peter Matthew,Yonghuai Liu
类目: Computation and Language (cs.CL); Information Retrieval (cs.IR); Machine Learning (cs.LG)
备注: 6
Abstract:Most Turkish-capable large language models (LLMs) are evaluated using general-purpose benchmarks rather than long, structurally complex domain documents. This paper evaluates five open-weight 7B-8B models for Turkish document question answering under a resource-constrained local deployment setting. The primary benchmark contains 100 systematically validated questions derived from a 109-page industrial RD report, and the evaluation protocol is replicated using a second 112-page public-sector report and an independently constructed 100-question set. All models are evaluated locally on an NVIDIA RTX 3050 laptop GPU with 6 GB VRAM using controlled prompting, decoding, and 4-bit quantisation. The principal methodological contribution is an evidence-annotated evaluation protocol that separates retrieval failure from downstream model reasoning failure without requiring additional model calls. On the primary benchmark, end-to-end accuracy ranges from 49% to 75%. Seven lexical, dense, and hybrid retrieval configurations are additionally compared using 95% Wilson intervals and exact paired McNemar tests; none significantly outperforms the character TF-IDF baseline on either document. Evidence recall saturates differently across the two reports, showing that retrieval and effective context capacity can be binding constraints for some documents but not others. These results demonstrate that model selection, retrieval behaviour, and hardware limits must be evaluated separately when deploying open-weight LLMs for Turkish domain documents. Comments: 6 Subjects: Computation and Language (cs.CL); Information Retrieval (cs.IR); Machine Learning (cs.LG) Cite as: arXiv:2609.28007 [cs.CL] (or arXiv:2609.28007v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2609.28007 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[IR-5] LLM -Assisted Workflow for Structural Difference Visualization in Evolving Software Requirements
链接: https://arxiv.org/abs/2609.28002
作者: Koi McFarland,Songhui Yue
类目: oftware Engineering (cs.SE); Human-Computer Interaction (cs.HC); Information Retrieval (cs.IR)
备注: \c{opyright} 2026 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works
Abstract:This paper presents an LLM-assisted workflow for visualizing structural differences in evolving software require- ments. Implemented in the OntologyWeb environment, the work- flow represents baseline and current requirements as triple-based semantic graphs and supports side-by-side comparison of curated graph snapshots. The comparison view aligns matched entities and uses visual encoding to highlight structural changes.
[IR-6] A Flexible Recommendation System for Individuals and Groups
链接: https://arxiv.org/abs/2609.27998
作者: Yacine Mokhtari(Lab-STICC_MOTEL, Lab-STICC, IMT Atlantique - INFO),Grégory Smits(IMT Atlantique - INFO, Lab-STICC, Lab-STICC_MOTEL)
类目: Information Retrieval (cs.IR)
备注:
Abstract:Group recommender systems typically rely on either aggregating individual preferences or treating groups as distinct meta-users. However, these methods often suffer from static aggregation strategies or data sparsity issues within group histories. This paper introduces a novel approach, that relies on a GNN-based architecture to learn a dual representation of each user’s preferences, capturing their behavior as an independent individual from one side and as a member of a collective from the other side. By performing a differential analysis of these individual and group-oriented preferences, our system then determines the behavioral profile of each user when joining a group. Finally, specific preference aggregation strategies are defined to cope with the behavioral profiles of the users composing a group. Consequently, the system is equally capable of delivering precise recommendations to individuals and to arbitrary groups, effectively unifying the two traditional paradigms of recommendation. Experiments on synthetic data simulating diverse group settings and behaviors confirm the flexibility and relevance of the proposed approach compared to state-of-the-art methods.
[IR-7] he Recall Ceiling of LLM Recommendation Reranking CIKM2026
链接: https://arxiv.org/abs/2609.27953
作者: Zhaohui Wang
类目: Information Retrieval (cs.IR); Machine Learning (cs.LG)
备注: 11 pages, 1 figure, 8 tables. Accepted for oral presentation at CIKM 2026
Abstract:Some LLM-based recommendation rerankers are evaluated under an oracle protocol that guarantees the ground-truth item is present in the scored set, either by injecting it into the candidate list or by scoring it against sampled negatives. Across three primary Amazon datasets, we show that this protocol overestimates realistic NDCG@10 by 92–95%. The cause is a recall ceiling: realistic retrieval covers only 2–19% of relevant items at K=100 across eight datasets in three domains, imposing a deterministic upper bound on any closed-candidate reranker’s top- k NDCG. Under leave-one-out evaluation, \mathbbE[\mathrmNDCG@k] \leq \mathrmRecall@|W_\pi| , where W_\pi is the reranker’s candidate window. Under realistic retrieval, none of the tested optimisation strategies significantly improves over the collaborative-filtering baseline on our primary Amazon datasets. These strategies include prompt engineering, model scaling over a 168 \times parameter range, sequential models, supervised neural rerankers, LoRA fine-tuning, hybrid retrieval, score-aware prompting, and LLM+CF fusion. Text-aware retrieval increases recall on one dataset but does not improve end-to-end NDCG, while providing upstream CF scores mainly makes the LLM reproduce the CF order. We therefore propose the Recall-Aware Evaluation Protocol (RAEP): first classify the retrieval-recall regime, then evaluate reranking where the ceiling permits meaningful differentiation. In the low-recall regimes measured here, improving retrieval is more consequential than increasing reranker sophistication; this ordering need not hold in production systems with higher recall, richer features, or online feedback. Comments: 11 pages, 1 figure, 8 tables. Accepted for oral presentation at CIKM 2026 Subjects: Information Retrieval (cs.IR); Machine Learning (cs.LG) Cite as: arXiv:2609.27953 [cs.IR] (or arXiv:2609.27953v1 [cs.IR] for this version) https://doi.org/10.48550/arXiv.2609.27953 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[IR-8] Query Implied Generative Engine Optimization
链接: https://arxiv.org/abs/2609.27845
作者: Shilpa Ramakrishna,William B. Andreopoulos
类目: Information Retrieval (cs.IR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:The landscape of search has changed drastically with how people look for information online. Traditional search engines are being replaced by Generative Search Engines (GSEs), which use Large Language Models (LLMs) to generate natural language responses to user queries. For content creators, visibility is no longer solely determined by ranking in search results but by being cited within generated responses. But Generative Search Engines are black-boxes, leading to the emergence of Generative Engine Optimization (GEO), a set of techniques aimed at improving content visibility in generative search settings. Most existing approaches rely on the explicit queries or query derived signals to align content to better suit user needs. We propose Query Implied Generative Engine Optimization (QI-GEO) to infers user intent directly from the document. Our approach approximates document’s intent space and identifies content that may be missing yet relevant to answer potential user queries. Evaluation on GEO-Bench and Extended GEO-Bench demonstrated improvements across objective and subjective metrics. QI-GEO improved objective scores by up to 15.9% and subjective scores by up to 17.6%, while yielding nearly twice as many citation gains as citation losses. These results suggest that document-derived approximations of user intents can improve visibility without relying on explicit query inputs.
[IR-9] LabourCrew: A Multi-Agent RAG Framework for Trustworthy Adversarial Deliberation and Statutory Reasoning over Labour Law
链接: https://arxiv.org/abs/2609.27814
作者: Fatema Tuj Johora Faria,Mukaffi Bin Moin,Jubayer Al Mahmud,M. F. Mridha,Md. Alam Hossain
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
备注:
Abstract:In statutory question answering, every claim must be traceable to evidence, not merely relevant, since unverifiable labour-rights answers carry serious legal consequences. Current systems fall short: single-pass RAG cannot detect insufficient evidence, while multi-agent legal-debate systems treat grounding as a prompting convention, letting agents cite unretrieved evidence. To address this gap, we introduce LabourCrew, a multi-agent RAG framework built around three grounding mechanisms: StatuteGraph, a graph index that explicitly links chapter, section, proviso, and cross-reference structure rather than fixed-length spans; an Evidence Exchange Protocol that confines advocates and an interpreter to an evidence ledger, making citation to unretrieved text impossible, while a fault-tolerant supervisor board runs advocates in parallel so individual failures degrade rather than crash the system; and a Calibrated Trust Gate that replaces categorical accept/reject decisions with a trust score, thresholded via conformal risk control for a distribution-free bound on the false-accept rate. We evaluate on LabourActQA, a 500-item Bangla question set from the Bangladesh Labour Act, 2006, spanning seven reasoning categories and three difficulty tiers. The framework drives the empirical false-accept rate to 0.081, within the target level ( \alpha = 0.10 ), achieves the highest Answer Relevancy among HyDE RAG, Graph-RAG, and Hierarchical RAG (0.862 0.839, 0.815, 0.828), and degrades gradually rather than catastrophically as question difficulty increases. These results show that calibrated abstention, not retrieval quality alone, is what makes legal question answering auditable in low-resource statutory domains.
[IR-10] EidosDoc: Implicit Structure Encoding for Cost-Effective Semi-Structured Document QA
链接: https://arxiv.org/abs/2609.27784
作者: Teng Lin,Yuyu Luo,Nan Tang
类目: Information Retrieval (cs.IR); Artificial Intelligence (cs.AI)
备注:
Abstract:Semi-structured documents are ubiquitous in scientific reports, financial statements, and technical manuals. Question answering over such documents requires simultaneous understanding of text, tables, charts, and complex hierarchical layouts. Existing methods either rely on repeatedly calling large language models for structure parsing and retrieval, leading to high cost and large latency, or they flatten the document and lose layout and hierarchy information, sacrificing answer accuracy. To address this, we propose EidosDoc, a novel system that achieves state-of-the-art accuracy with minimal computational expense. Our approach introduces three core innovations. (1) An Implicit Structure Encoder trained via contrastive learning and a structure consistency loss. This module jointly embeds hierarchical relationships, spatial positions, and textual content into a dense vector space, capturing document structure holistically without the need for manually defined and error-prone constructions. (2) A Hybrid Retrieval Pipeline that leverages BM25, layout fingerprints, and a lightweight cross-encoder to perform high-precision retrieval entirely without invoking an LLM, drastically reducing cost and latency. (3) A Dynamic Evidence Expansion mechanism that adaptively retrieves spatially adjacent and structurally related evidence, overcoming the evidence omission common in fixed-path retrieval methods. We evaluate EidosDoc on four benchmarks, and comprehensive evaluations show that EidosDoc achieves a new state-of-the-art accuracy on the four benchmarks. Crucially, it does so with a 50 times reduction in cost and 4 times lower latency compared to the previous state-of-the-art Method. These results demonstrate that EidosDoc establishes a new optimal trade-off among accuracy, cost, and speed, offering a practical and scalable path for accurate semi-structured document analysis.
[IR-11] st-Time Adaptation with Query-Dependent Residuals for Visual Document Retrieval
链接: https://arxiv.org/abs/2609.27688
作者: Zeliang Li,Xiaofen Xing,Kailing Guo,Xiangmin Xu
类目: Information Retrieval (cs.IR)
备注:
Abstract:Visual document retrieval (VDR) systems depend on page embeddings computed before deployment, which makes adaptation difficult when encoder parameters or corpus re-encoding are unavailable. Rerankers provide useful relevance signals, but conventional reranking applies them only to selected queries and candidate pages. We introduce Q-REACT, a query-side test-time adaptation method that converts limited reranker feedback into reusable retrieval improvements. Q-REACT learns a shared low-rank transformation that produces query-dependent residuals, combines adapted query scores with document-level context, and distills reranker preferences with a student distribution normalized over the complete task-specific page index. This design lets unscored pages compete through cached embeddings while keeping the encoders and page index fixed. Across eight ViDoRe V3 tasks and five open-weight and proprietary backbones, Q-REACT improves average retrieval over evaluated baselines at sparse and full-coverage budgets, transfers to held-out queries and tasks, and adds little inference overhead. The results show that finite reranker feedback can be amortized across a query collection without retraining or rebuilding the retriever.
[IR-12] Seal Then Sample: Sampled Layerwise Proofs for Verifiable LLM Inference from GPT -2 to 70B
链接: https://arxiv.org/abs/2609.27367
作者: Youki Lim,Sam Yong
类目: Cryptography and Security (cs.CR); Information Retrieval (cs.IR)
备注: 15 pages, 4 figures, 8 tables. Raw experiment logs and data tables: this https URL
Abstract:Verifying outsourced language-model inference requires a precisely identified computation and an audit whose cost a service can afford. We present Sampled Layerwise Proofs (SLP), a protocol and prototype that commits the boundary activations of every chunk of an inference trace, absorbs all commitments before any challenge is drawn, and then proves a verifier-selected subset of chunks together with the chunks that bind the prompt and the answer. Audit coverage becomes a runtime parameter over one set of commitments: on a TinyLlama-1.1B trace, proving seven of 47 chunks takes 22.0% of the time and 6.8% of the proof size of proving all 47. Because proof cost is dominated by weights rather than tokens, SLP packs concurrent requests into one trace under a block-diagonal causal mask and binds the prompt and answer of each request to its slot. Twelve packed requests are proved in 181.9 s, 6.5 times less than twelve separate proofs at the measured single-proof cost, and a simulated service proves twelve requests at 30.6 s per request with 0.6 s of verification each, rejecting a tampered answer. Disk-backed integer weights and streamed polynomial commitments let a single Llama-2-70B run complete on a 2 TB CPU host: 163 chunks sealed, five proved, a 4.34 MiB proof in 1,259 s, verified in 46.3 s without the weights. The proven object is a fixed-point canonical model; we trace a severe fidelity loss to the residual-stream bit width, repair it with an LLM-aware observer, and measure 84.8-84.9% argmax agreement with the floating-point reference over 334,705 WikiText-2 test positions. The limits are stated as precisely: guarantees cover proven chunks only, a fixed invalid chunk in the 70B setting is covered with probability 3/161, a manifest-only Fiat-Shamir schedule can be ground at 12.5 ms per attempt and needs an externally ordered challenge, and all measurements use a test reference string.
[IR-13] Automated Extraction of Records of Processing Activities (RoPA) Using Hybrid RAG and Locally Deployed Large Language Models
链接: https://arxiv.org/abs/2609.27359
作者: To Duy Hinh,Nguyen Le Quoc Anh,Phan Van Tri,Khuong Nguyen-An
类目: Computation and Language (cs.CL); Cryptography and Security (cs.CR); Information Retrieval (cs.IR)
备注: English version followed by Vietnamese version. Accepted for publication in the Proceedings of the 29th National Conference on Selected Issues of Information and Communication Technology (VNICT 2026), Hanoi, Vietnam, November 7-8, 2026
Abstract:Vietnam’s Personal Data Protection Law (Law No. 91/2025/QH15) and Decree No. 356/2025/ND-CP, effective January 1, 2026, require organizations to establish and maintain Records of Processing Activities (RoPA). Manual RoPA preparation is labor-intensive, while cloud-hosted large language models (LLMs) may conflict with data-sovereignty requirements. We propose RoPA Manager, a system for automated RoPA information extraction using hybrid retrieval that combines lexical ranking over tsvector, dense-vector search, Reciprocal Rank Fusion (RRF), and locally deployed LLMs. We introduce a Vietnamese RoPA benchmark with 32 organizations, 77 processing activities, 12 field groups, and 4,338 reference values. Evaluation is reported at three distinct levels. The automated scorer, tested on perturbed data without invoking an LLM, achieved F1 = 0.9493 [0.9436, 0.9548]; this measures scorer robustness rather than end-to-end extraction accuracy. End-to-end extraction achieved token coverage of 50.04-55.25% against the reference labels. Two independent experts reviewed 1,558 reference values (35.9% of the benchmark), found no incorrect values, and achieved 99.68% agreement with PABAK = 0.9936. Value-level precision was not measured. Across 32 paired scenarios on a 24 GB GPU, locally deployed Qwen3.5-27B-GPTQ-Int4 showed no statistically significant difference from cloud-based DeepSeek-V4-Flash (difference 0.20 percentage points in favor of DeepSeek, 95% CI [-0.93, 1.32], p = 0.72), while Gemma-4-31B performed significantly worse (p 0.01).
[IR-14] Large Knowledge Model: From Papers to a Scientific Reasoning Landscape ICLR2027
链接: https://arxiv.org/abs/2609.27297
作者: Yuan Huang,Sihan Hu,Hongyu Gu,Chao Ma,Jiaxing Zhang,Zhiyong Zou,Caiyu Fan,Yan Xiao,Mingjun Xu,Chenyu Xie,Mingzhen Ju,Zhehao Ma,Qi Zhang,Baozong Wang,Yu Li,Zhiyuan Yao,Ruoxue Liao,Xinyu Li,Linfeng Zhang,Kun Chen,Weinan E
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Information Retrieval (cs.IR)
备注: 17 pages, 7 figures; under review at ICLR 2027. Website: this https URL
Abstract:Accumulated scientific knowledge advances inquiry when prior findings help researchers choose new questions, design investigations, and interpret results. Realizing this value at scale requires access to the reasoning that connects research problems, scientific procedures, conclusions, and evidence. We introduce the Large Knowledge Model (LKM), a scientific knowledge infrastructure that transforms the literature into a shared, computationally accessible reasoning resource. LKM represents papers as source-grounded reasoning graphs, couples structural traversal with semantic retrieval over the same objects, and aligns related questions, claims, and reasoning chains across papers. This representation forms a Scientific Reasoning Landscape with three connected views: a Question Landscape that organizes research problems and open directions, a Workflow Landscape that exposes reusable scientific procedures, and an Evidence Landscape that connects conclusions to their support, disagreement, and conditions. The unified substrate supports reasoning-aware scientific search, evidence-grounded question answering, comparative evidence analysis, and research planning. Researchers and agents can retrieve relevant work through its scientific intent, synthesize answers with inspectable supporting arguments, and develop research plans informed by established workflows and unresolved evidence. We describe a corpus-scale system and evaluate scientific retrieval and knowledge-intensive question answering. With the answering model fixed, LKM retrieval improves accuracy by 9.30%, 4.20%, and 14.69% on ChemBench, PubMedQA, and SciBench, respectively. By connecting knowledge access to scientific reasoning and action, LKM provides a common foundation for discovering relevant research, reusing scientific knowledge, and coordinating cumulative inquiry across researchers, agents, and research cycles.
[IR-15] Meet Compare or Abstain: LatWeave for Deterministic Multi-Hop Question Answering on Knowledge Lattices
链接: https://arxiv.org/abs/2609.27225
作者: Yuze Ren,Shaoheng Fan,Tao Wang,Yabo Yan,Han Han
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
备注: 12 pages, 5 figures
Abstract:Probabilistic question-answering systems – whether large language models (LLMs) themselves, retrieval-augmented generation (RAG), or trained multi-hop retrievers – conflate “what is known” and “how to reason” into a single probabilistic computation: hallucination cannot be eradicated, evidence chains cannot be audited, and the system answers even when it does not know. We present LatWeave, which organizes knowledge into a multidimensional knowledge lattice and compiles multi-hop QA into three deterministic operators – meet (constraint intersection), compare (lattice-order comparison), and abstain (structural abstention); LLMs appear only on the construction side (one-shot extraction) and the query-planning side, while the answer-generation path is zero-LLM, zero-task-training, and auditable end to end – so that question answering over Web-published knowledge becomes reproducible item by item. Rather than claiming across-the-board SOTA, we characterize the operating envelope of this paradigm on six public benchmarks: when knowledge is complete (MetaQA, 39,093 questions) meet chains are near-lossless over three hops (any-hit 0.9975, on par with fully supervised KBQA); on templated multi-hop home ground (2WikiMultihopQA held-out n=1,258) EM 0.865, well above published structure-augmented RAG reproductions; on open-text deep composition (MuSiQue) and extraction-coverage gaps (HotpotQA) we report degradation honestly and attribute it to causes outside the lattice-algebra layer; and when information is incomplete (IIRC) we achieve structural abstention with abstain accuracy 0.971 and leak rate 0.029. Within the operating envelope, deterministic execution pays no performance penalty, and every step on the answer path can be recomputed – precisely the source of end-to-end auditability.
[IR-16] BoundaryMORPH: Budgeted Reranking via Active Set Selection for Diffuse Retrieval
链接: https://arxiv.org/abs/2609.27213
作者: Eylon Caplan,Shamik Roy,Shib Sankar Dasgupta,Yingfan Wang,Rashmi Gangadharaiah
类目: Information Retrieval (cs.IR)
备注: Under review
Abstract:Open-ended queries in modern Retrieval-Augmented Generation (RAG) are increasingly “diffuse,” requiring a large set of documents to be assembled into a finite LLM context window. To ensure retrieval quality, systems use fast dual-encoders and more expensive cross-encoders (CEs) to score candidates. However, the CE budget B is strictly bounded by latency and is often smaller than the context window capacity k . This mismatch makes standard reranking structurally flawed: it wastes compute verifying obvious top candidates while ignoring relevant documents further down the initial ranking. To address this, we introduce BoundaryMORPH, a novel algorithm that allocates CE budget specifically for the LLM’s context capacity k . Using a Gaussian Process, BoundaryMORPH treats the initial dual-encoder ranking as a structural prior and intelligently spends CE calls on resolving top- k set membership at the boundary, rather than seeking a single most-relevant document. Information from each CE call propagates to unscored documents, maximizing the utility of the budget. We demonstrate that BoundaryMORPH achieves state-of-the-art set retrieval quality across multiple models and datasets with open-ended queries ( +5.4 nCG@100 over the strongest baseline).
[IR-17] When LLM -Based User Profiling Adds Value in Production Streaming Recommendation
链接: https://arxiv.org/abs/2609.27183
作者: Milad Sabouri,Neeraj Sharma,Sardar Hamidian,Shaghayegh Agah
类目: Information Retrieval (cs.IR)
备注:
Abstract:Personalized recommendation depends critically on how user representations are constructed from historical behavior. Two paradigms have emerged for constructing semantic user profiles in content-based recommendation. First, aggregate methods derive user representations as numerical aggregates of semantic item embeddings. Second, LLM-based methods generate natural-language summaries of user preferences and encode them through a text encoder. Each paradigm can be combined with temporal disentanglement of recent versus historical behavior. LLM-based profile generation is significantly more expensive than aggregate approaches, raising the question of when this additional cost is justified. We present a systematic comparison of four semantic user-profiling strategies, factorially crossed across representation type and temporal handling, evaluated on a real-world production dataset. The comparison reveals how these strategies differ across user behavior types, across both accuracy and beyond-accuracy dimensions of recommendation quality, and across the temporal-window setting that governs the disentanglement.
[IR-18] LEGO: Synergizing Expert GraphRAG and Expert Chain-of-Thought for Legal Reasoning EMNLP2026
链接: https://arxiv.org/abs/2609.27009
作者: Qingjing Chen,Junkai Zhang,Shaochun Wang,Jiahao Ding,Siyuan Zheng,Yukun Yan,Zhi Zheng,Antonino Rotolo,Yun Liu,Weixing Shen
类目: Computation and Language (cs.CL); Information Retrieval (cs.IR)
备注: Accepted to EMNLP 2026(Findings)
Abstract:Large language models are increasingly applied to high-risk domains such as law, yet complex legal reasoning remains limited by two structural challenges. First, existing RAG and GraphRAG methods emphasize lexical or semantic similarity while overlooking normative relations among legal provisions. Second, vanilla Chain-of-Thought prompting may generate plausible rationales without enforcing the normative structure of legal reasoning. To deal with the bottleneck of pipelines in the legal reasoning domain, we propose LEGO, a dual-module framework that synergizes Legal Expert GraphRAG and expert Chain-of-thought for complex legal reasoning. ExpertGraphRAG uses an expert-annotated civil code graph encoding these normative relations with a greedy normative-coverage retrieval algorithm to dynamically extract instance-specific provision subgraphs, while ExpertCoT organizes the retrieved provisions and case facts into structured Provision-Fact-Conclusion reasoning. With a Qwen3-8B backbone, LEGO achieves 40.53% exact-match accuracy on LawExamQA_Civil, outperforming the evaluated RAG and CoT baselines and performing comparably to the evaluated larger models, while remaining robust on multi-hop questions. It also achieves the best results among the evaluated baselines on the open-ended benchmarks. Ablation studies confirm the individual and complementary contributions of both modules, demonstrating LEGO’s effectiveness in improving LLMs’ complex legal reasoning ability. Code and dataset can be found in the link: this https URL
[IR-19] Handling Is Part of the Evaluation Protocol: An Order-Invariance Audit for Tie-Heavy Recommender Scores RECSYS2026 RECSYS
链接: https://arxiv.org/abs/2609.26977
作者: Chengkun Guo,Han Chen,Yilin Zhu,Yingrui Li
类目: Information Retrieval (cs.IR)
备注: 8 pages, 3 tables. Accepted at FRAME’26: Methodology First - Rethinking Research Assessment in RecSys Workshop, co-located with ACM RecSys 2026
Abstract:Offline top-k evaluation often ranks one held-out relevant item together with sampled negatives. When several candidates receive exactly the same score, the tie-breaking rule becomes part of the ranking. A common implementation stores the relevant item first and then applies a stable sort, which preserves input order among equal scores; the relevant item therefore wins every tie. We call an evaluator row-order invariant when permuting the input candidates without changing their identities, labels, or scores leaves the final ranking unchanged. We audit this property by holding candidates and scores fixed and changing only the tie-breaking rule. On 30,000 Amazon Beauty Personal Care rows, NDCG@10 for a rating-weighted attribute-overlap score is 0.85 under input-order tie-breaking. A deterministic hash tie-break based on user and item IDs lowers it to 0.17. The exact expectation under uniform random tie-breaking closely matches the mean over 100 independent hash seeds, while a residualized attribute score with few exact ties is nearly unchanged. MovieLens Tag Genome shows the same pattern for an attribute-overlap score, whereas item popularity is nearly unchanged. We derive expected Hit Rate and NDCG at cutoff k when the relevant item is randomly ordered among candidates with the same score, and we provide a practical reporting checklist. The same issue can occur in sampled or full-catalog evaluation whenever exact ties affect top-k membership or rank.
[IR-20] When Learned Context Planning Fails to Beat Strong Retrieval: A Controlled Study of Planning Routing and Reranking for Long-Context QA EMNLP2026
链接: https://arxiv.org/abs/2609.26976
作者: Yingrui Li,Han Chen
类目: Computation and Language (cs.CL); Information Retrieval (cs.IR)
备注: 5 pages. Accepted at the Seventh Workshop on Insights from Negative Results in NLP (Insights 2026), co-located with EMNLP 2026
Abstract:Learned context planning selects evidence atoms before an answer model reasons over them. We test whether this learned selection improves long-context multiple-choice QA after strong retrieval, routing, budgeted-selector, and reranking controls. Our primary diagnostic uses all 503 LongBench-v2 MCQ questions with Qwen2.5-7B-Instruct. The planner is SFT-trained on outcome-selected traces from 140 training and 28 development questions; because the 503-question analysis includes those questions, it is partly transductive. At an 18k-character budget, anchored hybrid retrieval reaches 36.18% accuracy and BM25 reaches 35.98%, while the best direct planner-guided method reaches 34.19%. On the untouched 152-question test split, anchored hybrid remains higher (42.11% versus 36.84%). Leakage-safe routers cannot convert a large oracle gap. Under tight budgets, the best planner is ahead by only 0.40 points at 6k and loses at 9k; planner-guided reranking has a +1.79-point estimate at 6k with a paired interval crossing zero and ties the control at 9k. Packing-order and score-flatness analyses did not identify a stable mechanism. Under this setup, learned planning is a weak relevance signal rather than a replacement for strong retrieval.
[IR-21] Calibrating Reproduced Claims in Recommender Systems RECSYS
链接: https://arxiv.org/abs/2609.26975
作者: Alan Said
类目: Information Retrieval (cs.IR)
备注: Accepted to the Workshop Methodology First - Rethinking Research Assessment in RecSys (FRAME) September 28, 2026, Minneapolis, Minnesota, USA
Abstract:Reproduction studies can produce mixed outcomes. Reported values may differ while the ordering of the compared methods remains the same, a result may hold only under some experimental conditions, or a released implementation may fail to reproduce a result that the model can still reach. The terms repeatability, reproducibility, and replicability describe how a follow-up study relates to the original experiment, but not which parts of the original claim are supported by the new results. We introduce \emphclaim calibration as a way of stating the strongest claim supported by a follow-up study, together with the conditions under which it holds and the parts that remain untested. We apply this perspective to five original–follow-up paper pairs from recommender-systems research. The cases show that agreement in numerical values, method rankings, statistical results, and overall conclusions does not always coincide, and that follow-up studies often support only part of the original claim. Based on these observations, we propose a Claim Evidence Profile for reporting the original claim, its scope, the reproduction target, the reported results, the calibrated claim, and the parts of the original claim that remain unresolved.
[IR-22] Distilling Lexical Product Associations into Deep Transformers: An Extreme Multi-Label Approach for Natural Language E-Commerce Search
链接: https://arxiv.org/abs/2609.26921
作者: Sunnidhya Roy,Samarpita Bhaumik
类目: Information Retrieval (cs.IR)
备注: 13 pages, 4 figures, 6 tables, preprint
Abstract:Traditional e-commerce search platforms rely heavily on inverted indices and token-level lexical matching algorithms (e.g., BM25 and TF-IDF), which frequently fail on conversational, intent-driven, or paraphrased user queries – the classic vocabulary mismatch problem. We formulate conversational product recommendation as an Extreme Multi-Label Classification (XMLC) problem over an e-commerce catalog of N = 54,000 products spanning 27 balanced retail categories from the Amazon Reviews '23 benchmark. Using a pre-trained DistilBERT transformer encoder, we distill dense item-to-item similarity topologies (generated via TF-IDF cosine similarity over cumulative metadata with K = 50 nearest neighbours) into a deep contextual representation via a pseudo-label knowledge distillation framework. Evaluated on an exact 85/15 train/validation split (8,089 held-out products across C = 53,923 output classes) with strict self-exclusion enforced, the DistilBERT neural student achieves P@1 = 93.15%, P@5 = 90.08%, NDCG@10 = 0.8845, and MRR@10 = 0.9545, closely recovering the empirical ceiling established by the corrected TF-IDF teacher (P@1 = 98.10%, NDCG@10 = 0.9419, MRR@10 = 0.9882). Furthermore, a qualitative benchmark across ten structured natural language query archetypes – encompassing situational, cross-category, paraphrased, and negative-constraint queries – demonstrates that the transformer student generalises substantially beyond keyword matching, successfully resolving implicit user intent where lexical models fail completely. Finally, we analyse the architectural and memory scalability trade-offs of extreme classification projection layers at industrial catalog scale ( 10^6 items) and present a concrete deployment trajectory toward Dual-Encoder (Two-Tower) vector search. Code: this https URL. Comments: 13 pages, 4 figures, 6 tables, preprint Subjects: Information Retrieval (cs.IR) Cite as: arXiv:2609.26921 [cs.IR] (or arXiv:2609.26921v1 [cs.IR] for this version) https://doi.org/10.48550/arXiv.2609.26921 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[IR-23] ItColBERT: An Italian-Specialised Late-Interaction Retriever
链接: https://arxiv.org/abs/2609.26856
作者: Enrico Nello
类目: Information Retrieval (cs.IR)
备注:
Abstract:Neural information retrieval for Italian is served almost entirely by multilingual models. Several multi-vector (late-interaction) retrievers include Italian among dozens of languages, and several strong Italian dense embedders exist, but as of August 2026 no late-interaction retriever specialised on Italian had been released. We present ItColBERT, a 135M-parameter Italian ColBERT trained with PyLate following the ColBERT-Zero recipe: initialise from a checkpoint that already retrieves, then apply supervised contrastive training followed by single-teacher distillation, for a total of roughly 14.5 GPU-hours on one RTX 3090. Across four Italian retrieval benchmarks it outperforms every general-purpose late-interaction baseline we tested except one (mLateOn), at 2-4.4x fewer parameters than every baseline but one of comparable size. Our principal empirical finding is methodological and partly negative. On the only cleanly out-of-domain benchmark (MLDR-it), an inference-time chunking recipe applied to an unchanged checkpoint yields +0.0602 nDCG@10 (p = 0.0225), a larger effect than anything two further rounds of training produced. Self-mined hard negatives and native 1024-token training were both evaluated against pre-registered decision gates and both failed. We report every comparison with paired bootstrap tests against an empirically measured noise floor of 0.0030 nDCG@10, and we release the weights, the training and evaluation code, and the complete experimental record including the rejected rounds.
人机交互
[HC-0] alk2Escape: Conversational Grounding for Vision-and-Language Navigation IROS2026
链接: https://arxiv.org/abs/2609.28296
作者: Zerui Li,Sihao Lin,Yanyan Shao,Jiwen Zhang,Xiangyu Shi,Shijie Li,Qi Wu
类目: Robotics (cs.RO); Human-Computer Interaction (cs.HC)
备注: IROS 2026
Abstract:While Vision-and-Language Navigation (VLN) has demonstrated remarkable success, the prevailing single-turn paradigm exposes a fundamental vulnerability: agents operate in a strictly open-loop manner. In practice, factors such as perceptual aliasing, sensor noise, and odometry drift can cause minor deviations to accumulate over time, often leading to catastrophic mission failures with no built-in mechanism for error recovery. To address this, we introduce \textitTalk2Escape, a proactive and model-agnostic dialogue intervention framework that reframes navigation as a closed-loop interactive process. At its core, a lightweight vision-language module continuously monitors agent kinematics. Upon detecting localized looping or severe trajectory divergence, it translates raw egocentric observations into concise, grounded queries to solicit targeted corrective feedback from either an algorithmic oracle or a human-in-the-loop. Extensive evaluations in high-fidelity simulators, including R2R-CE, RxR-CE, and VLNVerse, demonstrate that \textitTalk2Escape exhibits consistent improvements across diverse base agents. Empirically, \textitTalk2Escape achieves a 66.0% Success Rate on R2R-CE, outperforming the current supervised and zero-shot state-of-the-art methods. We further validate its sim-to-real transfer on a Unitree Go2 quadruped, proving that proactive dialogue drastically improves navigation robustness in physical environments. Comments: IROS 2026 Subjects: Robotics (cs.RO); Human-Computer Interaction (cs.HC) Cite as: arXiv:2609.28296 [cs.RO] (or arXiv:2609.28296v1 [cs.RO] for this version) https://doi.org/10.48550/arXiv.2609.28296 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[HC-1] Remote Surfaces at Your Fingertips: Electrovibration-Based Tactile Feedback for Robot Teleoperation via Touchscreen Interfaces
链接: https://arxiv.org/abs/2609.27938
作者: Alperen Kenan,Juan José García Cárdenas,Adriana Tapus,Paul Bremner,Manuel Giuliani
类目: Robotics (cs.RO); Human-Computer Interaction (cs.HC)
备注: 8 pages, 10 figures, accepted for presentation at the 2026 IEEE Conference on Telepresence in Bristol, United Kingdom, November 9-13, 2026
Abstract:Enabling operators to perceive and interact with remote environments naturally is a fundamental challenge in robotic teleoperation. This is especially critical in tasks involving physical interaction, where real-time haptic awareness improves operational safety and effectiveness. Existing kinesthetic haptic feedback methods suffer from instability during rigid surface contacts and remain sensitive to communication delays, while visual cue-based force feedback imposes additional cognitive load and limits sustained situational awareness. This work presents a teleoperation interface that conveys remote surface interactions to the operator through electrovibration-based tactile feedback, enabling naturally mapped force reflection while avoiding the stability issues associated with kinesthetic feedback and the latency limitations of mechanical actuators. A user study (N=21) evaluated interface usability, sense of presence, and operator workload under two force reflection conditions: visual feedback and electrovibration-based tactile feedback. Characterisation experiments further assessed path-following accuracy and response time across both conditions. Results show that tactile feedback significantly reduced response time by 15.35% (p=0.002, d=0.96) and increased the sense of presence by 31% (p0.001, d=0.90) compared to visual feedback, while imposing comparable workload and usability across both conditions. These findings demonstrate that electrovibration-based tactile feedback is a viable and effective modality for robot teleoperation, improving operator responsiveness and sense of presence in contact-rich manipulation tasks, with direct applicability to safety-critical domains such as nuclear maintenance. Comments: 8 pages, 10 figures, accepted for presentation at the 2026 IEEE Conference on Telepresence in Bristol, United Kingdom, November 9-13, 2026 Subjects: Robotics (cs.RO); Human-Computer Interaction (cs.HC) Cite as: arXiv:2609.27938 [cs.RO] (or arXiv:2609.27938v1 [cs.RO] for this version) https://doi.org/10.48550/arXiv.2609.27938 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[HC-2] Same Team Label Different Evidence: A Full-Text Audit of Claim Denominators in Human-AI Teaming Research
链接: https://arxiv.org/abs/2609.27849
作者: Hanjing Shi,Kimberly Wang,Sabrina Doherty,Dominic DiFranzo
类目: Human-Computer Interaction (cs.HC)
备注: 22 pages, 4 figures, 6 tables. Preprint
Abstract:Human-AI Teaming (HAT) reviews often group studies by labels such as advisor, teammate, or coordinator. Yet the same label can describe one person taking AI advice, several people coordinating around AI, or a workflow that distributes authority and responsibility. Pooling these studies can therefore change the human unit behind a claim. We examine how full-text evidence changes the set of studies behind a claim. We audited 86 full texts purposively selected from a 419-record title/abstract map. We find that full-text reading changed core membership for 40 records: 36 of 74 apparent core candidates moved out, while 4 of 12 boundary candidates moved in. Team vocabulary did not reliably identify the social unit: 14 of 27 human-AI dyads and 20 of 23 multi-human peer teams used team or collaboration terms. Only 20 of 86 papers specified who could see AI output. Four blinded language-model runs unanimously labeled 53 screening cases and 59 arrangements, yet 32% and 34% of those consensus decisions differed from the full-text labels. These results identify claim-denominator drift as a synthesis problem in HAT research. We contribute a full-text audit centered on human arrangements and a claim-pooling checkpoint for deciding when evidence about trust, coordination, performance, efficiency, and accountability can be compared. Comments: 22 pages, 4 figures, 6 tables. Preprint Subjects: Human-Computer Interaction (cs.HC) Cite as: arXiv:2609.27849 [cs.HC] (or arXiv:2609.27849v1 [cs.HC] for this version) https://doi.org/10.48550/arXiv.2609.27849 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[HC-3] Open Questions Towards Skill-Sustaining Reliance in Reflective AI Engagement
链接: https://arxiv.org/abs/2609.27726
作者: Sander de Jong
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:As AI systems are increasingly integrated into professional work, reflection strategies such as cognitive forcing and prompts that foster critical engagement have shown promise in reducing overreliance and improving decision quality. However, these strategies have primarily been evaluated as short-term interventions within single sessions. The next challenge is to assess whether such mechanisms sustain human agency and expertise over time. Drawing on prior work in AI-assisted decision-making, metacognition, and reflective AI engagement, we examine the challenges of designing and evaluating reflective mechanisms for long-term skill sustainability, considering individual differences in how users engage with such support, the organisational conditions under which it is implemented, and the gap between short-term evidence and long-term claims. We introduce open questions for the research community about the conditions under which reflective AI engagement can be sustained in practice.
[HC-4] Brain-to-Language Decoding: Tasks Signals Methods Evaluation Practical Use and Beyond
链接: https://arxiv.org/abs/2609.27650
作者: Yiqian Yang,Yiqun Duan,Chenyu Liu,Yiqi Wang,Xinliang Zhou,Chin-Teng Lin,Yu Zhang
类目: Computation and Language (cs.CL); Human-Computer Interaction (cs.HC); Neural and Evolutionary Computing (cs.NE)
备注:
Abstract:Brain-to-language decoding translates neural activity associated with language production, internal speech and perception into linguistic or expressive outputs. It offers a route to restoring communication after speech loss and a means of studying how the brain represents language. Advances in neural recording and representation learning have expanded the field from constrained recognition and acoustic reconstruction to text generation, streaming personalised speech and facial animation. This survey synthesises these developments across invasive and non-invasive measurements, drawing on a search without a lower year limit and source-led updates through September 2026. We connect Articulated, Inner and Perceived tasks to the neural populations they engage, the representations available to decoders and the outputs those representations can support. We examine model development, public resources and the evolution of evaluation, and compare published performance and communication costs within their reported protocols. The synthesis identifies complementary routes to progress: phonetic, acoustic and semantic targets preserve different aspects of a message; shared representations support reuse across recording conditions and tasks; and online communication increasingly depends on calibration, feedback and user control alongside decoding accuracy. Shared benchmarks enable algorithmic comparisons, while longitudinal studies reveal the demands of sustained use. We discuss these developments and their remaining limitations, then outline a prospective five-level trajectory from commands and language to meaning, scenarios and bidirectional cognitive exchange
[HC-5] ViMoWear: Visual Motion-Guided sEMG-IMU Representation Learning for Subject-Independent Thumb Gesture Recognition
链接: https://arxiv.org/abs/2609.27595
作者: Wenjuan Zhong,Chenfei Ma,Kianoush Nazarpour
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:Wearable sensing enables intuitive hand gesture recognition for human–computer interaction, augmented reality, and prosthetic control, yet subject–independent recognition remains challenging because wearable signals provide only indirect and highly subject-specific observations of hand motion. Although visual information can improve wearable gesture recognition, requiring it during inference increases sensing complexity and limits practical deployment. We propose ViMoWear, a visual-motion-guided framework that leverages synchronized 3D hand motion as training-only supervision while requiring only wearable sensing for gesture classification at inference. Specifically, Motion-Guided Cross-Subject Contrastive Learning (MGCL) promotes subject-robust representations, and Thumb-Aware Masked Motion Reconstruction (TMMR) preserves fine-grained motion information. The leave-one-subject-out experiments on a synchronized sEMG–IMU–pose dataset demonstrate consistent improvements over supervised baselines across multiple sensing configurations, while the learned representations also support classifier-free retrieval. The proposed training-only visual motion supervision improves the generalization of wearable representations to unseen subjects.
[HC-6] When Visual Quality Misleads: Intent Recognition under Rendered Avatar Distortions SIGGRAPH
链接: https://arxiv.org/abs/2609.27560
作者: Ning-Hsuan Chang,Kai-Siang Ma,Yu-Chih Chen
类目: Multimedia (cs.MM); Computer Vision and Pattern Recognition (cs.CV); Human-Computer Interaction (cs.HC)
备注: Accepted to SIGGRAPH Asia 2026 Technical Communications. 6 pages
Abstract:Avatar-streaming systems are commonly evaluated with image and video quality assessment (IQA/VQA) metrics, implicitly treating visual fidelity as a proxy for communicative success. We test this assumption through a controlled behavioral study of rendered 3D avatars across a pristine condition and fourteen geometric, photometric, temporal, and combined distortions. Fifty-nine participants contributed 2,688 judgments of perceived action, response confidence, and visual quality. We identify Misleading Quality in this dataset as distorted renderings that retain above-average perceived quality but yield below-average action-recognition accuracy. We also derive an Intent Quality Score (IQS) combining recognition correctness and confidence as the behavioral target for objective metrics. Among 126 distorted content–condition cells, 31 (24.6%) exhibited Misleading Quality; temporal and geometric distortions showed the highest rates, at 50.0% and 31.1%, respectively. The results reveal a quality–accuracy dissociation where distortion families affect appearance and communication differently. Across 24 direct-scoring IQA/VQA metrics and three supervised feature-regression baselines, alignment with IQS remained limited; at \lambda=0.5 , the best leave-one-content-out baseline reached PLCC =0.4435 . Under this controlled protocol, visual fidelity alone is insufficient for avatar communication, motivating intent-aware quality assessment and streaming objectives.
[HC-7] Forced Yet Free: What Magicians Forcing Reveals Beyond Intentional Binding
链接: https://arxiv.org/abs/2609.27416
作者: Koichi Toida
类目: Human-Computer Interaction (cs.HC)
备注: 9 pages, 1 figure
Abstract:In magicians’ forcing, spectators may experience a choice as self-determined even when that choice has been externally directed. Research on the sense of agency has developed largely around action-outcome relations, most notably intentional binding; however, the problem of choice authorship (why a particular choice is experienced as originating from oneself) must be treated as distinct. This paper integrates research on agency and forcing by distinguishing the locus of intervention within the choice-action-outcome chain, self-attribution at the Decision, Action, and Outcome levels, and the processes by which feeling of agency and judgment of agency are constructed. On this basis, a distinction is drawn between intentional binding, which concerns the temporal/causal relation between action and outcome, and the different binding problem exposed by forcing: the relation between a choice and its author. This theoretical relation is termed authorship binding. Authorship binding does not denote a new implicit measure; rather, it refers to the constructive relation through which a choice whose formation has been directed by external factors can nevertheless be experienced as originating from the self. Forcing can sustain this relation not by eliminating agency, but by selectively preserving, substituting, and redistributing agency cues. XR, in which body-centred spatial relations can be manipulated, is further conceptualised as a medium for extending the forced-yet-free structure into space.
[HC-8] Psychoacoustically Aligned Latent Smoothing for Adversarial Robustness of Full-Duplex Speech-to-Speech Dialogue Models
链接: https://arxiv.org/abs/2609.27378
作者: Kian Shamsaie,Iman Modarressi
类目: ound (cs.SD); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Human-Computer Interaction (cs.HC)
备注: Accepted to IEEE SLT 2026
Abstract:End-to-end speech-to-speech dialogue models listen and speak simultaneously, so a continuously open acoustic channel is exposed to adversarial manipulation. We formalize imperceptible attacks on full-duplex agents as optimization over additive perturbations confined beneath the psychoacoustic masking threshold of the carrier speech, under three goals: targeted semantic hijacking, response suppression, and policy jailbreaking. Against an undefended Moshi-style agent, white-box attacks succeed in up to 91.7% of trials. We then introduce psychoacoustically aligned latent smoothing (PALS), which injects anisotropic Gaussian noise shaped by local codebook covariance at the residual-vector-quantized latent interface, with input noise shaped by the masking threshold constraining the attacker and trained by a Kullback–Leibler consistency objective. Deployed with no inference-time cost, PALS reduces hijack to 8.3%, mute to 11.2%, and jailbreak to 9.1% at clean quality within 2.3%. A Monte Carlo-smoothed variant certifies an ellipsoidal latent radius up to 0.616, a guaranteed floor that the empirical robustness far exceeds.
[HC-9] Neither Silence nor Overlap Is Failure: Intent-Conditioned Evaluation of Turn-Taking in Full-Duplex Spoken Dialogue Models
链接: https://arxiv.org/abs/2609.27372
作者: Kian Shamsaie,Iman Modarressi
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC); Sound (cs.SD)
备注: Accepted to IEEE SLT 2026
Abstract:Benchmarks for full-duplex spoken dialogue models score turn-taking with binary fixed-window rules that reward immediate response or silence by completeness of the prior turn. We argue that the appropriateness of a response offset, whether delayed silence or anticipatory overlap, is conditional on the speaker’s latent intent, identifiable only from that speaker’s behavior. We introduce TACT, a benchmark of 9,728 episodes and 73.2 hours from five dyadic corpora; each episode carries dialogue history, a per-speaker memory profile, and an annotator-derived posterior over six intent classes. Scoring replaces binary windows with a strictly proper threshold-weighted continuous ranked probability score whose weights are intent-conditioned timing kernels fitted to human floor-transfer-offset distributions, proving boundedness, consistency, and binary reduction. Across eleven systems the best model reaches 0.47 against a human topline of 0.86, is nearly invariant to speaker profiles, and TACT agrees with human judgments at Spearman 0.81 versus 0.46 for binary metrics.
[HC-10] ASAP: Visual Analytics for Identifying and Analyzing Image Patterns in AI-generated Images
链接: https://arxiv.org/abs/2609.27371
作者: Jinbin Huang,Yuki Ueno,Chen Chen,Aditi Mishra,Bum Chul Kwon,Zhicheng Liu,Chris Bryan
类目: Human-Computer Interaction (cs.HC); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Generative image models can produce highly realistic images, raising concerns about potential misuse in creating deceptive content. Current deepfake approaches face several challenges, including limited generalizability, lack of interpretability, and poor actionability. To help address these, we present ASAP, an interactive visualization system designed to empower users in the analysis and summarization of deceptive patterns in AI-generated images. ASAP introduces a novel CLIP-adapted image encoder that generates interpretable representations, enabling the extraction of influential pixel regions via calculated masks. This approach facilitates the identification of key deceptive features through influence measurement techniques. These backend techniques are integrated into a visual analytics dashboard that allows users to quantify and analyze authenticity-indicative patterns in image collections containing both authentic and AI-generated images. This approach also supports the comparative analysis of various generative models, including GANs and diffusion models. We demonstrate ASAP’s efficacy through a user study and two application scenarios using established fake image detection benchmarks, showcasing its ability to effectively extract and quantify deceptive patterns.
[HC-11] Can Vision-Language Models Analyze Human-Centered Video? Mapping Model Capabilities and Human-AI Collaborative Workflows
链接: https://arxiv.org/abs/2609.27327
作者: Xiyuan Shen,Jiuyang Lyu,Seokhyun Hwang,Huanfen Yao,Shwetak Patel,Zhihan Zhang,Jacob O. Wobbrock
类目: Computer Vision and Pattern Recognition (cs.CV); Human-Computer Interaction (cs.HC)
备注:
Abstract:Video provides a rich record of human behavior, interaction, and situated contexts, offering important evidence for understanding people and conducting human-centered research. As vision-language models (VLMs) become increasingly capable of analyzing video, they offer opportunities to automate this traditionally human-intensive process. Yet a central question remains: when can VLMs analyze human-centered video independently, and when does reliable analysis still require human involvement? To address this question, we first characterize video analysis practices in human-centered research. We systematically analyze all 1,702 CHI 2026 full papers and identify 125 that annotate videos. Through iterative coding, we derive a five-dimensional taxonomy spanning analytic purpose, viewpoint, phenomenon, reasoning requirement, and annotation authority. Grounded in recurring annotation tasks captured by this taxonomy, we construct a benchmark of 15 representative tasks from open datasets to map the capabilities and limitations of a general-purpose VLM. We examine the division of labor between humans and VLMs by comparing three annotation workflows: VLM alone, human alone, and human verification of VLM outputs. Across tasks, VLM-alone annotation approaches human accuracy on average (HNS = 97.0, where 100 denotes human-alone performance), demonstrating substantial potential to automate human-centered video analysis. Human verification achieves the highest accuracy (HNS = 121.5) while reducing human annotation time by 48.9% and monetary cost by 31.3%-44.5% relative to human-alone annotation. Our findings connect real-world human-centered video analysis tasks and current VLM capabilities, and clarify how human-AI collaboration can make VLM-assisted analysis reliable and efficient.
[HC-12] Listening and Mirroring: The Effects of Verbal Attunement and Behavioral Mimicry on Social and Empathic Perceptions of Embodied AI Agents in VR
链接: https://arxiv.org/abs/2609.27246
作者: Nathalia Gomez,Haig Shamlian,Omar Khan,Tiffany D. Do
类目: Human-Computer Interaction (cs.HC); Artificial Intelligence (cs.AI)
备注: 11 pages. Accepted to ACM VRST 2026
Abstract:As embodied agents take on increasingly social and relational roles in VR, visual realism and embodiment alone may be insufficient; users must also perceive these agents as emotionally attuned, supportive, and humanlike. Prior work suggests that verbal attunement and nonverbal mimicry can each improve users’ social evaluations of embodied agents. However, behavioral mimicry has largely been studied outside of real-time, conversational AI interactions, leaving limited understanding of how users respond when an agent simultaneously generates contextually responsive dialogue and adapts its nonverbal behavior during an immersive conversation. To address this gap, we developed an embodied AI counselor that combines conversational AI with real-time facial-expression and posture mimicry, while producing either verbally attuned or neutral responses. We evaluated the system in a 2 X 2 within-subjects study with 20 participants, manipulating verbal attunement and behavioral mimicry. Results showed that verbal attunement was the most reliable driver of perceived empathy. Behavioral mimicry showed a marginal relationship with perceived humanness, while greater mimicry exposure showed preliminary, exploratory positive associations with empathy, positivity, and humanness, particularly among female participants. Together, these findings show that multimodal synchrony is not a simple additive strategy for designing empathic conversational agents in VR and underscore the need to consider how verbal and nonverbal behaviors are combined during real-time interaction.
[HC-13] CoBranchMR: Supporting Parallel Design and Conflict Resolution in Mixed Reality
链接: https://arxiv.org/abs/2609.27235
作者: Niloofar Sayadi,Kaiyuan Tang,Yunhao Xing,Simret Gebreegziabher,Chaoli Wang,Diego Gomez-Zara
类目: Human-Computer Interaction (cs.HC)
备注: 3 pages, 2 figures, accepted as a Demonstration paper at CSCW 2026
Abstract:We present CoBranchMR, a mixed reality (MR) system that enables distributed collaborators to work in parallel from different locations on the same digital representation of a physical object. CoBranchMR lets users branch an object into editable virtual copies, customize them independently, and then merge their work back into a shared object. When merging copies, the system displays potential conflicts on the object’s surface and provides several resolution options. By adopting branch-and-merge workflows for embodied spatial collaboration, CoBranchMR introduces a new collaborative interaction model that supports parallel design, conflict resolution, and negotiation in remote creative work.
[HC-14] ChartRevive: Reconstructing Data Visualizations from Chart Images Using MLLM IEEE-VIS2026
链接: https://arxiv.org/abs/2609.27146
作者: Yuki Ueno,Aditeya Pandey
类目: Human-Computer Interaction (cs.HC)
备注: Accepted as a Poster Session at IEEE VIS 2026 VISxGenAI Workshop
Abstract:Static chart images are widely used in scientific publications, business reports, and presentations, yet recovering both the underlying data and visual design from chart images remains a labor-intensive manual process, making them difficult to reuse. While prior work has primarily focused on data extraction, the extraction of visual design specifications, including colors, marker shapes, and axis configurations, remains underexplored. To identify a suitable model for chart reconstruction, we systematically benchmark five multimodal large language models (MLLMs) across five basic chart types on both data and design extraction tasks. Our evaluation shows that textual and categorical information can generally be extracted reliably, whereas numeric and spatial information remain challenging. Among the evaluated models, GPT-5.4 achieves the best overall performance and is adopted as the backbone of our system. Guided by these findings, we present ChartRevive, a mixed-initiative system that combines MLLM-based extraction with an interactive verification interface, supporting users to efficiently inspect, correct, and refine reconstructed charts through overlay-based verification and real-time rebuilding.
[HC-15] When Direct Manipulation Becomes a Guess: Productive Friction in AI-Mediated Multisensory Visualization IEEE-VIS2026
链接: https://arxiv.org/abs/2609.27104
作者: Anchit Mishra
类目: Human-Computer Interaction (cs.HC)
备注: To be presented at the SciFi-VIS workshop at IEEE VIS 2026
Abstract:Generative visualization increasingly embeds large language models within direct manipulation and multisensory interaction. Speech, gaze, touch, gesture, sound, and haptics can make probabilistic inference feel like familiar, deterministic tool use. I call this gap a deterministic-affordance mismatch: deterministic interaction cues persist while AI weakens predictability, locality, reversibility, or provenance. Reading the malleable interfaces of Iron Man 2 against systems from Blade Runner 2049, I propose productive friction, including cross-sensory renderings whose detail reflects model uncertainty. Four frictions expose the inference boundary, match action to effect, make stochastic branches tangible, and attribute sensory agreement.
[HC-16] ContraVis: Evidence-Grounded Visual Analytics for Contradiction Review in Legal Contracts
链接: https://arxiv.org/abs/2609.27014
作者: Luis Sante,Paula Lima,Mariana Rocha,Jorge Poco
类目: Human-Computer Interaction (cs.HC); Computation and Language (cs.CL)
备注: 8 pages, 4 figures, SIBGRAPI 2026
Abstract:Legal contracts are structurally complex documents in which contradictions may emerge across distant and interconnected provisions. Although large language models (LLMs) improve legal language understanding, contradiction analysis remains a human-centered and evidence-grounded review task. We present ContraVis, a visual analytics system for human-in-the-loop contradiction analysis in legal contracts. The system models contracts as typed paragraph graphs that combine explicit contractual references with semantic relationships between paragraphs. This graph plays a dual role: it conditions LLM reasoning and serves as the interactive representation the analyst explores, keeping model context and human inspection aligned across coordinated views. In a controlled comparison, graph-conditioned reasoning recovered more injected contradictions than standalone LLM analysis as contract length grew, while surfacing additional candidates for analyst validation. A formative study with contract-domain lawyers indicated that in-context evidence comparison supported contradiction validation, and we distill design implications for evidence-grounded, LLM-assisted document review.
[HC-17] How Constraints and Preferences Shape Travel Planning : Implications for AI Planning Support
链接: https://arxiv.org/abs/2609.26968
作者: Fuling Sun,Yining Cao,Peiling Jiang,Mingyi Li,Haijun Xia
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:Planning is a common yet complex activity shaped by constraints to satisfy and preferences to balance. Travel planning, as both an everyday activity and a frequent benchmark for evaluating intelligent systems, offers a rich context for examining how constraints and preferences emerge and evolve. While recent AI systems have achieved impressive results in generating personalized itineraries, they often assume that users can articulate stable goals upfront. To understand how real-world planning unfolds, we conducted a two-part interview study: one with eight travelers reflecting on their planning experiences, and one with nine travel agents sharing professional practices. We trace the dynamics of constraints and preferences as they are surfaced, refined, and coordinated throughout the planning process, and identified 11 actions revolving around constraints and preferences, which shaped the planning process. We offer design heuristics for planning tools that better support human-AI collaborative actions to support the fluid, contingent nature of planning.
[HC-18] Experts Rise Where LLM s Disagree: Using Cross-Model Disagreement to Target Expert Effort in LLM Codebook Revision for Large-Scale Annotation
链接: https://arxiv.org/abs/2609.26926
作者: Zeyu He,Zhuqian Zhou,Kirk Vanacore,Rene F. Kizilcec,Ting-Hao ‘Kenneth’ Huang
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC); Machine Learning (cs.LG)
备注:
Abstract:Large-scale text annotation brings expert insight to millions of documents, often through a codebook that AI annotators follow. Developing a robust codebook, however, takes months. Large language models (LLMs) could speed this process by applying an early codebook to the data, surfacing cases with strong LLM disagreement, and eliciting expert feedback to address them. We examined three ways experts can provide feedback for LLM codebook revision: (i) editing LLM-generated revisions driven by cross-LLM disagreement (Codebook Verifying), (ii) answering questions about LLM disagreements (Question Answering), and (iii) labeling disagreement cases with rationales (Rationale Labeling). Experiments on thousands of tutoring-session transcripts show that Rationale Labeling yielded the highest LLM-labeling accuracy (64.9%) against expert labels, outperforming the expert-revised codebook (57.8%). The best Question Answering setting also outperformed it (60.5%). Our work shows that LLMs can be used to strategically target expert attention, shortening months of codebook revision to days without sacrificing labeling performance.
[HC-19] Safety Nudges: User-Facing Interventions for Real-Time AI Risk Awareness
链接: https://arxiv.org/abs/2609.26865
作者: Varshini Elangovan,James Wedgwood,Chhavi Yadav,William Agnew,Sauvik Das,Virginia Smith
类目: Human-Computer Interaction (cs.HC); Artificial Intelligence (cs.AI); Computers and Society (cs.CY); Machine Learning (cs.LG)
备注:
Abstract:Conversational AI systems can pose safety risks to their users such as hallucination, sycophancy, overconfidence, and anthropomorphism, but these risks are difficult for users to detect during everyday use. We introduce Safety Nudges, a browser-based tool that provides lightweight, in situ flags when concerning behavior is detected in chatbot conversations. We evaluated Safety Nudges in a two-week field study with 45 frequent chatbot users, collecting interaction logs, surveys, and feedback on individual nudges. Participants found the tool useful, clear, and minimally disruptive, with nearly all users reporting an increased awareness of potential AI harms, though we found that this improved awareness alone did not necessarily lead to discernible behavioral changes. Our results suggest that user facing safety nudges can complement model-level safeguards by helping people critically evaluate AI responses in context, while highlighting the importance of relevance, calibration, and user control in nudge design for conversational AI safety.
计算机视觉
[CV-0] On the Diffusibility of High-Dimensional Latents ECCV2026
链接: https://arxiv.org/abs/2609.28473
作者: Chao Feng,Zhiyang Xu,Bowei Chen,Yuanjun Xiong,Xiyao Wang,Jui-Hsien Wang,Richard Zhang,Zhe Lin,Andrew Owens,Yijun Li
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Accepted to ECCV 2026. Project page: this https URL
Abstract:Representation Autoencoders (RAEs) enable diffusion models to operate in the feature spaces of pretrained visual encoders. However, many off-the-shelf encoders are not optimized for faithful reconstruction, discarding fine-grained visual details. As expected, finetuning these encoders for image reconstruction recovers such details. However, perhaps counterintuitively, this procedure reduces the effective dimensionality of the resulting representation, and the altered geometry has downstream effects on generation. Specifically, we show that using the standard velocity prediction in flow matching in this high-dimensional space requires the model to fit orthogonal noise directions outside the low-dimensional signal manifold, making optimization inefficient. This motivates using the clean data parameterization ( \boldsymbolx_0 -prediction) instead, which focuses learning on the underlying signal manifold. Across experiments with multiple strong-reconstruction encoders, we show that \boldsymbolx_0 -prediction consistently improves text-to-image generation performance.
[CV-1] he Past Frames the Future: Memory for Autoregressive Video Generation
链接: https://arxiv.org/abs/2609.28466
作者: Harold Haodong Chen,Rongjin Guo,Disen Lan,Wen-Jie Shu,Hongfei Zhang,Hanzhe Hu,Shengtao Yao,Zixin Zhang,Guibin Zhang,Zhefan Rao,Jinxiu Liu,Yexin Liu,Rui Peng,Yuhao Liu,Bin Ren,Shuai Yang,Yukang Chen,Salman Khan,Ying-Cong Chen,Ser-Nam Lim,Rynson W.H. Lau,Nicu Sebe,Yu Cheng,Ming-Hsuan Yang,Qifeng Chen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Advances in generative models have improved video fidelity, enabling long-horizon generation, interactive world modeling, and evolving visual environments. Autoregressive (AR) video generation extends visual sequences through causal rollouts. However, a fundamental bottleneck emerges: as the generated sequence expands, practical models must operate under strictly bounded context windows, storage, and computational limits. Consequently, critical historical information, e.g., entity identities, dynamic states, and intervention-induced causal changes, often leaves the active context long before its relevance diminishes. Overcoming this limitation and maintaining temporal persistence constitutes a fundamental memory problem. We present a systematic and comprehensive review of memory mechanisms in AR video generation. We formulate memory operationally as persistent historical information maintained across outer AR steps, capable of influencing future generation even after the originating evidence is no longer locally accessible. Building upon this unified framework, we organize the literature through five complementary perspectives: (I) Forms, the representational carriers of history; (II) Functions, the specific semantic and physical information requiring preservation; (III) Operations, the lifecycle of writing, reading, updating, managing, and integrating memory; (IV) Learning, the optimization of memory behaviors under closed-loop rollouts; and (V) Evaluation, the paradigms for diagnosing genuine memory capabilities. We conclude by synthesizing open challenges, including composable and resource-aware memory architectures, trustworthy state updating, self-rollout learning, and standardized evaluation. By bridging representations, mechanisms, and learning paradigms, this paper establishes a structured foundation for developing reliable, memory-conditioned video generation systems.
[CV-2] HaRP: High Dynamic Range Photosequencing through Dual Reversed Shutter Scanning
链接: https://arxiv.org/abs/2609.28439
作者: Xiang Ji,Guixu Lin,Jiancheng Zhao,Zhengwei Yin,Yinqiang Zheng
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:The adoption of CMOS sensors in mobile photography is frequently compromised by the rolling shutter (RS) effect, which introduces geometric distortions and motion artifacts. Particularly, recent rolling shutter with global reset (RSGR) mode, while mitigating some RS issues, also incurs major limitations, including reduced capture speed and compressed dynamic range. To address these problems, we propose a novel dual reversed scanning setup utilizing both RSGR and inverted RSGR views. This solution not only handles the inherent flaws of RSGR by synchronizing complementary exposures to balance the dynamic range across the frames but also introduces an effective method for HDR photosequencing under highly dynamic scenes. Our proposed network first accommodates row-wise complementarity and manages visual shifts by row-adaptive feature alignment. Subsequently, the hallucination module, built upon a correlation-guided mixattention block, integrates the mutually reinforced features to recover missing details. In addition, we construct a coaxial imaging system to collect a real-world dataset, enabling robust training and evaluation beyond numerical simulation. Experimental results demonstrate the twofold benefits of our solution in mitigating RSGR limitations and advancing HDR reconstruction techniques.
[CV-3] Predicting the Progression of Adolescent Idiopathic Scoliosis MICCAI
链接: https://arxiv.org/abs/2609.28434
作者: Owen Pullen,Amir Jamaludin,Andrew Zisserman
类目: Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
备注: Published in MICCAI ShapeMI 2026 Workshop
Abstract:Adolescent Idiopathic Scoliosis is defined as a lateral curvature of the spine that develops during adolescence, without known cause. The condition can result in significant pain and disability, and often progresses rapidly during adolescence. The objective of this paper is to predict the progression of the condition in a temporal sequence from ages 9 to 24, as measured from a sequence of Dual X-ray Absorptiometry (DXA) scans. To this end, we train a transformer model that takes in the curve of the spine to predict curve progression. The model is trained using a large-scale synthetic dataset of spine curves and their time series, covering different curve types and different progression patterns. We show that the model is able to generalise from synthetic to real data by evaluating it on a dataset of real DXA scans covering multiple time points. We find that fine-tuning the model on real data gives a significant boost to performance. The model is able to accurately predict spine curve progression in both scoliosis and normal cases.
[CV-4] he Skin-Restricted Reinhard Transform:Uniqueness under a Lightness-Preserving Constraint
链接: https://arxiv.org/abs/2609.28424
作者: Vijesh KP
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Code: this https URL
Abstract:Catalog skin recolouring has to change pigment and leave shading alone. The classical Reinhard map does not make that split: it rescales lightness by the ratio of standard deviations, and a flat reference swatch therefore flattens the limb. This paper formalises the correction used in our pipeline, the skin-restricted Reinhard transform. It is the diagonal affine map in CIE Lab that translates lightness, matches the chromatic mean, and clamps the chromatic gain to [0.72, 1.18], with moments taken on the central 84% of each channel. A diagonal affine map has six real parameters. The shading constraint forces the lightness gain to +1 and the lightness shift to the difference of means; one-dimensional quadratic optimal transport on each chromatic axis, followed by Euclidean projection onto the gain interval, fixes the other four. Inside that family the four conditions determine every parameter. The content of the result is the forced lightness gain; it is not a uniqueness claim outside the diagonal affine class. For Gaussian marginals the chromatic step is not merely the best affine map: it is the unrestricted Wasserstein-2 map. The same formulae with trimmed moments remain optimal because a positive affine image commutes with quantile trimming. On hands, arms, legs, and feet of nine photographs and three reference tones, the map keeps the lightness contrast ratio at 0.974 +/- 0.029 with chromatic error 0.77 CIE Lab units. Reinhard matching, the linear Monge map, and histogram matching reach a smaller chromatic error only by cutting lightness contrast to about half.
[CV-5] Frozen Flows Forget: Diagnosing and Restoring Lost Motion in a Latent-flow World Model
链接: https://arxiv.org/abs/2609.28414
作者: Xiwen Chen,Rigaudiere Z. Li,Zhiruo Zhou,Xiaojun Zhu,Houde Liu
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注:
Abstract:Latent world models that integrate a flow in a frozen self supervised latent space train stably and cheaply, yet silently lose the property manipulation depends on most: motion. The pretrained flow never moves the manipulated object; retraining it with latent-only losses only trades stillness for teleport-like motion. We trace the failure to the training signal, not the representation: anchor-sparse, latent-only supervision never says where along the horizon change belongs. Decode-augmented rollout training (DART) repairs this while keeping the representation frozen, retraining only the flow with decode-path supervision. DART outperforms its latent only parent on the full protocol, restores the temporal structure of motion, and re-couples predicted motion to the scene; at larger scale it further improves prediction quality, closing nearly half the remaining gap to an oracle-informed interpolation reference. Finally, we report an unexpected finding about evaluation: pixel error alone rewards frozen predictions.
[CV-6] AnchorReasoning : A Visual Grounding and Causal Reasoning Dataset in Long-Tail Autonomous Driving Scenarios
链接: https://arxiv.org/abs/2609.28366
作者: Zhipeng Bao,Wenjie Zhao,Tianle Zhu,Haohua Que,Chence Yang,Geng Yuan,Qianwen Li
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Vision-language models (VLMs) offer a promising approach to long-tail autonomous driving, but existing driving datasets provide limited supervision for connecting decision-critical visual evidence with reasoning and planning. We introduce AnchorReasoning, a visually grounded reasoning dataset built on WOD-E2E, containing 416,119 annotated frames and 395,379 decision-critical elements across four major categories and 19 fine-grained types. Each frame is organized as a visually grounded chain-of-thought (VG-CoT) that links decision-critical element identification and localization, element attributes and implications, driving-action rationale, and action and trajectory planning. We further develop a curriculum supervised fine-tuning strategy that progressively learns these hierarchical capabilities, together with an object-size-aware grounding metric for evaluating localization quality. Experiments across eight general-purpose, embodied-AI, and AV-specific backbones show that VG-CoT supervision improves grounded reasoning and trajectory prediction. Across models, 5-s ADE and FDE decrease by 7.84 and 11.86, while RFS Frame and Cluster improve by 1.66 and 1.70. These gains are achieved with 18.5 fewer reasoning tokens and 0.32 s/frame lower inference latency on average, demonstrating the value of visually grounded, decision-focused supervision for VLM reasoning and planning in long-tail autonomous driving.
[CV-7] Privacy-Preserving Semantic Segmentation from High-Resolution Depth and Ultra-Low-Resolution RGB
链接: https://arxiv.org/abs/2609.28360
作者: Xuying Huang,Swithinraj Moses Daniel,Sicong Pan,Sebastian Houben,Maren Bennewitz
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: Xuying Huang and Swithinraj Moses Daniel have equal contribution
Abstract:As mobile robots become increasingly integrated into everyday environments, privacy risks arising from onboard cameras have become a growing concern. Ultra-low-resolution (ULR) RGB can mitigate visual privacy exposure at the source, but ULR appearance alone substantially limits semantic and spatial understanding. We therefore introduce a privacy-preserving asymmetric sensing setting that combines high-resolution (HR) depth with ULR RGB, preserving dense geometry while restricting fine-grained visual information. To address the severe information imbalance between HR depth and ULR RGB, we propose a joint 2D framework using HR geometry to guide semantic-oriented RGB reconstruction and RGB-D segmentation. Despite reliable frame-level predictions, consistent scene-level understanding remains challenging under the asymmetric HR depth–ULR RGB setting. We therefore develop an end-to-end 2D-to-3D pipeline that consolidates 2D semantic features for 3D segmentation. Experiments on ScanNet show that our method achieves the best 2D and 3D segmentation performance among privacy-preserving approaches and delivers the strongest zero-shot transfer to SUN RGB-D and SceneNN. Privacy recoverability analysis shows that our proposed HR depth–ULR RGB input reduces the recoverability of sensitive data, and real-robot experiments demonstrate the utility of the resulting 3D semantics for object-goal navigation.
[CV-8] Zero-Shot Object Removal via Attention Masking Latent Anchoring and Refinement
链接: https://arxiv.org/abs/2609.28342
作者: Arman Taghizadeh,Ulf Krumnack,Kai-Uwe Kühnberger(Institute of Cognitive Science, Osnabrück University, Osnabrück, Germany)
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Code available at this https URL
Abstract:Removing an object from a real image requires more than synthesizing plausible content within a mask: the method must suppress residual object features, preserve the unedited scene, and generate replacement content that is consistent with the surrounding background. This paper approaches object removal from a stage-based perspective and proposes a zero-shot framework for constrained latent inpainting with a frozen pretrained Stable Diffusion model, requiring no task-specific training or model fine-tuning. The method integrates SAM-based mask construction, BLIP image-caption conditioning, DDIM inversion, background-weighted masked null-text optimization, decoder self-attention masking, hard outside-mask latent anchoring, and localized renoise–denoise refinement into a unified pipeline. The method is evaluated through qualitative examples, quantitative local-consistency metrics, and ablation studies. The results demonstrate effective object removal and context-consistent replacement content. The ablations indicate that background-weighted masked NTI is particularly beneficial for structurally complex backgrounds, whereas the no-NTI variant is sufficient in other evaluated examples. Repeated refinement further reduces object remnants and boundary artifacts remaining after the primary editing pass.
[CV-9] BronchoTop: Bronchoscopy Navigation via RGB-Only Topological Localization
链接: https://arxiv.org/abs/2609.28328
作者: Clara Tomasini,Ana Cristina Murillo,Luis Riazuelo
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Accurate localization of the bronchoscope within the bronchial tree is essential for clinicians to be able to reach target lesions, perform biopsies and avoid misidentification of airway segments during diagnostic and therapeutic procedures. However, existing navigation systems typically rely on patient-specific CT scans or additional external sensors, increasing cost, setup time and patient radiation exposure. This work presents BronchoTop, a real-time, RGB-only framework for topological bronchoscopy localization that eliminates the need for patient-specific data. BronchoTop estimates scope location relative to a generic airway model through four modules: lumen detection and tracking, lumen-branch label association, probabilistic scope location estimation, and switch verification. By using only standard bronchoscopy video input, BronchoTop provides practical, real-time navigational assistance to physicians. Evaluation on phantom, simulated and real data demonstrates state-of-the-art accuracy, improving existing approaches performance by over 20% on real bronchoscopy sequences. BronchoTop is the first published framework including both the localization algorithms as well as all the real data used, together with code to generate additional simulations, encouraging and facilitating further developments and benchmarking. The results highlight BronchoTop’s potential to enhance procedural safety, efficiency and accessibility in clinical and robotic bronchoscopy.
[CV-10] LightMIS: Ultra-Lightweight Medical Image Segmentation Without a Stage-Wise Decoder
链接: https://arxiv.org/abs/2609.28327
作者: Andrei Arhire,Mihaela-Elena Breabăn,Radu Timofte
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:We present LightMIS, a scalable family of ultra-lightweight convolutional networks for 2D binary medical image segmentation without a learned stage-wise decoder. LightMIS aligns the outputs of a five-level encoder to a common resolution using Scale-Aligned Projection blocks, aggregates them once, and refines the fused representation with an Adaptive Fusion Cascade. The cascade combines Adaptive Kernel Fusion with the proposed Progressive Receptive Fusion module, which uses temporary channel expansion, complementary depthwise receptive fields, and progressive cross-branch information transfer. We evaluate LightMIS-T, LightMIS-S, and LightMIS using five-fold cross-validation under a common nnU-Net v2.3.1 protocol on DRIVE, Kvasir-SEG, DSB18, BUSI, ISIC-2017, and ISIC-2018. Full LightMIS contains 0.131 M parameters and requires 0.575 GFLOPs for a 3\times256\times256 input, achieving modality-macro Dice and IoU scores of 86.71% and 78.99%, respectively. Mobile U-ViT obtains 86.75% Dice and 79.07% IoU, so the observed differences are 0.04 and 0.08 percentage points. Relative to Mobile U-ViT, nnWNet, and nnU-Net, LightMIS reduces parameter count by 90.58 - 99.61% and GFLOPs by 82.54 - 96.14%. On an Arm Mali-G52 MC2 GPU, all LightMIS variants achieve full GPU delegation, with median delegated latency ranging from 53.31 ms for LightMIS-T to 138.31 ms for LightMIS. These results demonstrate a favorable accuracy - complexity trade-off and on-device execution feasibility for the evaluated tasks. The code is publicly available at this https URL.
[CV-11] VGM-VS: Rethinking Visual Geometry Model for High-Precision Visual Servoing
链接: https://arxiv.org/abs/2609.28312
作者: Yimin Pan,Sen Wang,You Zhou,Jianfeng Gao,Pengbo Sun,Ahmed M. Naguib,Zoltan-Csaba Marton
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: 8 pages, 3 figures. Corresponding author: Sen Wang
Abstract:We present VGM-VS, a visual servoing method built on a pretrained feed-forward visual geometry model. Given the current view and a reference image captured at the target configuration, we estimate the relative camera pose with a visual geometry model and apply it iteratively as the pose increment of a closed-loop pose-based visual servoing (PBVS) scheme. The geometry-aware representation acquired from large-scale pretraining keeps this estimate reliable when the target is occluded, weakly textured, or covers only a small part of the image. However, the scale ambiguity inherent to these models leaves the predicted translation defined up to an unknown scale, while the pose increment must be metric for robot control. We close this gap with a scene-specific metric adaptation: the robot autonomously records image–pose pairs along a predefined motion starting from the target pose, and we fine-tune the camera head on these data, jointly learning the hand–eye transform and thus removing the need for a dedicated calibration process. We evaluate our method on three real-world assembly tasks with demanding tolerances: USB-C cable picking, cable insertion, and RAM insertion. Running in real time at 30Hz, VGM-VS converges to submillimeter terminal accuracy on the cable tasks, and reaches success rates of 90–100% when the target is moved during servoing. It converges in all trials under initial displacements of up to 30cm from the reference pose and with 50% of the target object occluded, outperforming the compared visual servoing baselines.
[CV-12] RoomLight: A 2.5D Illumination Prior for Indoor Environments
链接: https://arxiv.org/abs/2609.28300
作者: Andreea Ardelean,Bernhard Egger
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Ill-posed inverse problems require priors to constrain the solution space toward plausible outcomes. In inverse rendering, learned priors modeling the distribution of natural illumination improve the recovery of scene properties. However, existing models rely on the distant-illumination assumption, representing lighting as a far-field environment map. This limits their applicability to indoor scenes, where illumination is highly spatially varying due to finite-distance emitters, visibility changes, and parallax, all of which are poorly approximated by a single environment map. To address this, we introduce a spatially-aware illumination prior trained on real-world indoor panoramas and their estimated depth. Our variational autoencoder model learns a compact, optimizable latent space that decodes into HDR radiance and depth, parameterizing an area light emitter for direct integration into standard differentiable rendering pipelines. This design bridges the plausibility guarantees of a learned prior with the gradient flow required for downstream optimization. Crucially, by jointly modeling radiance and depth, our prior captures the spatial structure of indoor illumination, instead of treating the light sources as infinitely distant. We demonstrate that this formulation enables spatially-varying illumination modeling and achieves higher-fidelity recovery of indoor lighting compared to existing approaches. Project page: this https URL
[CV-13] PBLH Estimation from Satellite Radiances via a Dual-Encoder Transformer ACL KDD2026 ECML
链接: https://arxiv.org/abs/2609.28286
作者: Lorenzo Innocenti,Luca Catalano,Edoardo Arnaudo,Claudio Rossi,Salvatore Larosa,Domenico Cimini,Paolo Garza
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 13 pages, 3 figures, 2 tables. Extended version of the paper accepted at the MACLEAN workshop, ECML PKDD 2026. Code: this https URL
Abstract:Estimating the Planetary Boundary Layer Height (PBLH) from satellite observations is a challenging regression problem due to the indirect relationship between top-of-atmosphere radiances and near-surface atmospheric structure. Progress has been limited both by the lack of architectures capable of handling the multimodal, spatially incomplete nature of satellite overpasses, and by the scarcity of suitable datasets. In this paper, we build upon the large-scale dataset pairing MetOp radiances with ERA5 PBLH labels that we introduced in our previous work, making three contributions. First, we establish a benchmark across eight approaches spanning pixel-wise regression, swath-wise sequence models, and convolutional and Transformer models operating on the full orbital passage. Second, we quantify what the resulting model actually relies on, using grouped Shapley decomposition over the input blocks. Third, we present the best-performing architecture found: a dual-encoder Transformer whose masked-input handling lets it operate in all weather conditions. The proposed model achieves MAE = 155.8 m on the held-out global test set, outperforming all baselines on every evaluation subset. On 30 out-of-distribution granules acquired on two days overlapping the TEAMx observational campaign, it achieves MAE = 165.3 m, outperforming a pixel-wise baseline trained on the same data (MAE = 197 m).
[CV-14] Benchmarking Hyperspectral Foundation Models for Hyperspectral Unmixing
链接: https://arxiv.org/abs/2609.28283
作者: Edgard Dabier,Christophe Kervazo,Pietro Gori,Florence Tupin
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Several foundation models dedicated to hyperspectral images have recently been made available. These models are trained on large unlabeled datasets and exhibit strong performance on many hyperspectral imaging tasks, such as classification or denoising. Nonetheless, their performance for hyperspectral unmixing – the task of separating mixed spectra of overlapping materials in a hyperspectral image – remain understudied. This might partly be due to the fact that most of them rely on vision transformer backbones, including patchification, leading to a feature resolution problem. While hyperspectral unmixing already arises from the low resolution of hyperspectral images, this patchification step potentially makes the problem even more ill-posed. Therefore, in this work, we aim to answer two questions: 1) \emphhow do foundation models perform in hyperspectral unmixing?; 2) \emphhow to tackle the feature-level loss of resolution? To answer the first question, we benchmark foundation models for unmixing, showing that they can reach state-of-the-art performance on four hyperspectral unmixing datasets. To answer the second question, we compare several feature upsampling approaches and empirically show that using a simple one can lead to high performance results. The code is available at this https URL.
[CV-15] RAMP: Robust Adaptive Mixed-Precision Quantization for Edge CPU Vision Models BMVC
链接: https://arxiv.org/abs/2609.28262
作者: David Población-Criado,Dario Garcia-Gasulla,Eduardo Quinones
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Performance (cs.PF)
备注: Accepted at the 37th British Machine Vision Conference (BMVC) 2026. 13 pages, 4 figures, 2 tables. Code available at this https URL
Abstract:Deploying deep learning models on edge CPUs is bottlenecked by computational and memory constraints. Mixed-precision quantization promises to reduce inference latency while preserving accuracy. However, quantization affects different layer types in inconsistent ways, so identifying where accuracy loss is minimized and latency reduction is maximized is critical, as the effect accumulates over a full deployment into substantial savings or unacceptable task degradation. Such identification relies on sensitivity metrics, proxies that estimate layer-wise degradation without evaluating the task accuracy of every candidate policy. Nevertheless, widely used metrics fail systematically on modern architectures. We present a systematic empirical study of 13 sensitivity metrics for layer-wise INT8 quantization across four distinctly different neural networks, and validate the resulting policies on two ARM64 platforms. Gradient-based sensitivity methods fail on 4 out of 8 model-hardware configurations and weight-based statistics on 2. In contrast, the Jensen-Shannon Divergence achieves zero catastrophic failures, reliably isolating the layers that cannot be safely quantized. A sensitivity metric alone does not define a policy, and the fixed thresholds typically used for that step are fragile over the highly skewed distributions of modern architectures. We address this with K-Means clustering, achieving near-lossless accuracy and a mean speed-up of 1.81\times over the full-precision model. Finally, we reveal that excluding from quantization the layers whose speed-up is negligible, regardless of their sensitivity, can be counterproductive, as it induces computational graph fragmentation and disables operator fusion. Our results yield concrete allocation policies for practitioners and researchers deploying quantized vision models on heterogeneous edge CPUs, without GPU access or gradient computation.
[CV-16] Generalizable Robotic Insertion with World Models IROS2026
链接: https://arxiv.org/abs/2609.28258
作者: Nicklas Hansen,Iretiayo Akinola,Yijie Guo,Jie Xu,Bingjie Tang,Hao Su,Xiaolong Wang,Abhishek Gupta,Dieter Fox,Yashraj Narang
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: IROS 2026
Abstract:Robotic assembly in high-mixture settings requires adaptable systems that can handle diverse parts, yet current approaches typically rely on policies specialized to each insertion task. Although this can reach high success rates, it makes the process of deploying systems for new problems tedious and time consuming. We present a framework for generalizable insertion using world models that combine robot proprioceptive information with raw visual observations captured by a wrist-mounted camera. Our model-based approach trains a single world model on up to 90 insertion tasks with geometrically diverse parts, achieving 56% zero-shot success on unseen objects with unknown geometry compared to just 7% with a model-free baseline. Importantly, performance improves as more objects are included in the training dataset, demonstrating strong scalability. Lastly, finetuning the generalist model on held-out objects significantly enhances data-efficiency compared to training from scratch and, in some cases, achieves better asymptotic performance. To our knowledge, this is the first system capable of assembling unseen objects in an entirely data-driven manner, and thus represents a significant step toward scalable, generalizable robotic assembly systems.
[CV-17] MemBodied: Recurrent Associative Memory for Vision-Language-Action Models
链接: https://arxiv.org/abs/2609.28256
作者: Tej Deep Pala,Navonil Majumder,Bryce Goh,Raphael Yee,Jianfei Yang,Liming Chen,Soujanya Poria
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Vision-Language-Action models provide a strong foundation for general-purpose robot control, yet a vast majority of policies do not preserve and leverage episode-level information beyond the current observation. This limitation is consequential in history-dependent manipulation tasks that depend on information available only in past observations. Retaining past observations in context can aid in recovering this information, but at the significant cost of ever-growing, bloated context and inference latency. We thus introduce MemBodied, a fixed-size episodic memory with two complementary components: an associative state that records interactions across policy calls and an episode anchor that preserves a compact representation of the initial scene as a reference. At each policy call, the model conditions action generation on the current input and the memory components, rather than directly using past observations. Across five evaluated RMBench tasks requiring memory, MemBodied achieves 7.81\times the mean success rate of a stateless policy and 2.98\times of vanilla recurrent memory, while outperforming the strongest memory-augmented baseline by 1.3\times with 10\times fewer added parameters. On the fully observable LIBERO-Long suite, it reached 90.6%, a 5.4% improvement over the stateless \pi_0 policy. These findings support MemBodied as a practical alternative to expanding the policy context for history-dependent manipulation.
[CV-18] ODPure: Backdoor Purification for Object Detection via Ensemble Corruption Consensus
链接: https://arxiv.org/abs/2609.28239
作者: Li Zeng,Mingcheng Duan,Longfei Fan,Hangtao Zhang,Xianlong Wang,Yanchun Li,Xia Wen,Leo Yu Zhang
类目: Computer Vision and Pattern Recognition (cs.CV); Cryptography and Security (cs.CR)
备注: 13 pages, 8 figures (including supplementary materials); Code available at this https URL
Abstract:With the development of applications like autonomous driving, object detection has gained significant attention, while also highlighting critical vulnerabilities like backdoor attacks that severely compromise model integrity. Specifically, such attacks involve altering the categories of objects (i.e., object misclassification), removing bounding boxes (i.e., object disappearance), or generating bounding box proposals for non-existent objects (i.e., object generation) when a predefined trigger is present in the input. Although backdoor defenses for image classification are well-established, the research for object detection remains comparatively underexplored. Existing defenses address these threats by scanning outputs or models for potential backdoors but require discarding either malicious data or models. This remedy fails to enable a continuous and accurate perceptual stream for the object detection pipeline. To address such limitations, we propose ODPure, a novel input-stage black-box defense for object detection, which is based on input purification that ensures stable perception flows. Tailored to the dense prediction nature of object detectors, our Corruption-Reconstruction-Selection (CRS) paradigm operates by neutralizing triggers through a diverse portfolio of corruptions to generate a massive pool of redundant proposals, then recovering fine-grained structural cues via generative priors, and finally employing voting to reach a consensus on the resulting detections. Comprehensive experiments demonstrate that our method provides robust defense against diverse backdoor attacks and trigger types while preserving baseline accuracy. Our code is available at this https URL.
[CV-19] EmbodiedMemory-Bench: Benchmarking Embodied Memory for Long-Horizon Embodied Tasks
链接: https://arxiv.org/abs/2609.28236
作者: Lizhou Liang,Xinyu Zhong,Miao Pan,Xiaohe Zhou,Xuanyu Liu,Qinfeng Li,Peng Li,Jintao Chen,Xuhong Zhang,Wenqi Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Long-horizon embodied interaction requires agents to retain and continually update information about the environment as they observe, act, and encounter change. Yet current agents struggle to maintain such memory reliably. Our analysis traces this limitation to four key deficiencies: weak fine-grained visual memory, unreliable dynamic world-state tracking, failing to record world state revealed by interaction outcomes, and limited generalization from prior experience. However, existing benchmarks do not directly assess these memory capabilities during long-horizon embodied interaction. To address this gap, we introduce EmbodiedMemory-Bench (EMem-Bench), comprising 2,554 interactive episodes across four task families. EMem-Bench requires agents to build and update memory from interaction history, then use it to complete a later task by acting in the environment. We further present Embodied-Memorizer (EMem), an external memory system that organizes embodied experience into spatial, event, and scene memories. We also train EMem-8B, an 8B policy that manages and uses these memories. We evaluate a diverse range of open-source and proprietary MLLMs and representative multimodal memory systems. Results show that current models remain weak and uneven across the four challenges. Under matched backbones, EMem achieves the best overall performance among the evaluated memory systems and improves both open-source and proprietary models, while EMem-8B further improves over its backbone. Project page: this https URL
[CV-20] Diff-RF: Mutually Reinforced Image Registration and Fusion via Degradation-Aware Learning
链接: https://arxiv.org/abs/2609.28235
作者: Xunpeng Yi,Zaixi Du,Qinglong Yan,Yibing Zhang,Han Xu,Jiayi Ma
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Image registration and fusion aim to establish spatial correspondences from misaligned multi-modal source images, and integrate complementary information. However, in real-world imaging scenarios, source images are often affected by complex and diverse degradations, such as low illumination, noise, etc., which severely hinder the effectiveness of registration and fusion. To address this issue, we propose a mutually reinforced image registration and fusion diffusion framework via degradation-aware learning, termed Diff-RF. It explores the intrinsic coupling between registration-fusion and information restoration in the degradation conditions, enabling high-quality fusion of unregistered images under complex degradation conditions. First, the intra-modal restoration module is designed to alleviate modality-specific degradations by leveraging information within each modality, thereby providing more reliable structural representations for registration and facilitating subsequent cross-modal fusion. Second, we develop a cross-modal diffusion registration and fusion module that establishes bidirectional interaction between registration and fusion. By integrating fusion-derived visual cues and correspondence-based geometric conditions into the diffusion process, the proposed framework progressively refines spatial alignment and exploits cross-modal complementary information to achieve collaborative enhancement. Rather than treating them as independent components, degradation-aware information restoration and the collaborative optimization of registration and fusion are tightly coupled, achieving overall performance improvements. Extensive experiments on multiple extended datasets demonstrate that Diff-RF achieves superior registration accuracy and fusion quality under various degraded scenarios, exhibiting strong robustness and generalization ability.
[CV-21] Do Center Biases Propagate? Robustness of Pathology Foundation Models in Whole-Slide Image Classification
链接: https://arxiv.org/abs/2609.28231
作者: Ilán Carretero,Pablo Meseguer,Rocío del Amor,Valery Naranjo
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: Submitted to CASEIB’26
Abstract:Pathology foundation models (PFMs) have transformed computational pathology through powerful representation learning from histopathological images. PFMs provide rich, discriminative representations for whole slide image (WSI) analysis, enabling tasks such as slide-level classification under multiple instance learning (MIL). However, these representations may also encode non-biological signals associated with acquisition centers, potentially introducing spurious shortcuts into downstream predictions. In this work, we evaluate center-associated robustness in WSI classification using a controlled training setting with increasing class-center correlations quantified by Cramér’s V. We benchmark six PFMs across four datasets and two MIL aggregators, while evaluating ComBat as a robustification strategy. We further introduce the Area Under the Cramér’s V Curve (AUCC) to jointly capture absolute classification performance and its degradation as spurious correlation increases. Results show that center-related information encoded by PFMs propagates to WSI-level predictions, with robustness depending on both the PFM representation and MIL aggregation strategy. Additionally, ComBat harmonization does not provide consistent robustness gains across datasets.
[CV-22] A Unified Framework and Dataset for Oriented Object Visual Grounding in Remote Sensing
链接: https://arxiv.org/abs/2609.28230
作者: Zeyu Ding,Yong Zhou,Jiaqi Zhao,Wen-Liang Du,Xixi Li,Hancheng Zhu,Rui Yao,Abdulmotaleb El Saddik
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Visual grounding in remote sensing images aims to locate objects described by referring expressions. Most existing methods predict horizontal bounding boxes, which are often inaccurate for objects with arbitrary orientations. To address this limitation, we introduce O ^2 -VG, a family of models for oriented object visual grounding with three complementary designs. Specifically, O ^2 -VG-Trans is a cross-modality transformer for oriented object visual grounding. It establishes a strong discriminative foundation for the model family. Building upon it, O ^2 -VG-Uni predicts universal oriented proposals for possible foreground objects without specific text prompts. It also supports object retrieval through cached proposal embeddings. Using these universal oriented proposals as input prompts, O ^2 -VG-VLM is an autoregressive vision-language model. It generates oriented box token blocks in parallel through multi-token prediction. In addition, we construct DIOR-R-RSVG, a dataset for oriented object visual grounding in remote sensing images. It provides image, expression, and oriented box triplets for training and evaluation. Together, the O ^2 -VG family provides a flexible framework that spans discriminative transformers and generative vision-language models. It achieves superior performance across multiple benchmarks. Code is available at this https URL.
[CV-23] From Alignment to Fusion in 3D Vision-Language
链接: https://arxiv.org/abs/2609.28222
作者: Xueqi Qiu,Xingyu Miao,Jingjing Deng,Haoran Duan,Yang Long,Ling Shao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Unified 3D vision-language systems must combine complementary geometry, scale, and appearance cues while supporting tasks from instance segmentation to language-guided reasoning. Existing methods often process point clouds, voxel grids, and multi-view images independently; directly combining these heterogeneous representations may leave substantial feature discrepancy unresolved, while subsequent unconstrained adaptation may distort their internal geometry. We propose an align-then-fuse framework that first applies triple pairwise cosine alignment to establish segment-level correspondence across the three representations and then retrieves task-conditioned features with a prompt-guided query decoder. Before fusion, representation-specific query features are transformed by learnable mappings constrained to the special orthogonal group. These mappings preserve inner products and Euclidean distances within each representation, permitting controlled representation-specific re-parameterisation without arbitrarily distorting its internal geometry. The transformed features are subsequently combined through Adaptive Fusion under downstream task supervision. Experiments cover eight datasets for instance segmentation, visual grounding, question answering, and dense captioning. Compared with PQ3D, the model improves average precision by 3.2 points on ScanNet200 and grounding accuracy by 2.9, 10.6, 4.6, and 4.1 points on ScanRefer, Nr3D, Sr3D, and Multi3DRefer, respectively, while also improving performance on ScanQA, SQA3D, and Scan2Cap. Ablations further support the complementary roles of alignment and orthogonal re-parameterisation and the effectiveness of Adaptive Fusion.
[CV-24] Geospatial embeddings detect old-growth forests but buffered spatial validation narrows their advantage over Sentinel features
链接: https://arxiv.org/abs/2609.28194
作者: Thomas Ratsakatika(1),Mihai Zotta(2),Srinivasan Keshav(3),Emily R. Lines(1) ((1) Department of Geography, University of Cambridge, Cambridge, UK, (2) Fundatia Conservation Carpathia, Brasov, Romania, (3) Department of Computer Science and Technology, University of Cambridge, Cambridge, UK)
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
备注: 34 pages, including supplementary material (19-page main article with 7 figures and 3 tables; 15-page supplement with 9 figures and 21 tables). Submitted for publication. Data: this https URL (embargoed until publication); code: this https URL
Abstract:Old-growth forests develop over centuries under minimal anthropogenic disturbance, producing structurally complex and biodiverse stands. In Europe, protecting them requires mapping that is accurate for individual forest parcels yet deployable continent-wide. Geospatial foundation model (GFM) embeddings enable label-scarce land classification, but their value for old-growth detection remains unknown. Here, we map old-growth forests across 211,893 ha of Romania’s Southern Carpathians, a beech-spruce landscape typical of the Alpine Biogeographic Region. We construct high-confidence, expert-informed reference labels for old-growth and non-old-growth parcels. We add AlphaEarth, TESSERA v2 and Sentinel-1/2 features to a common baseline of topographic and human-access predictors, then compare them under spatially blocked validation with and without 10 km train-test buffers to limit residual autocorrelation. With buffering, GFM and Sentinel-1/2 predictors increase precision-recall AUC by 0.21-0.25 [95% CIs: 0.15-0.34] relative to baseline, indicating spectral data contain a spatially robust old-growth signal. With a PR-AUC of 0.84 [0.79-0.88], TESSERA outperforms Sentinel-1/2 (+0.08 [+0.05 to +0.11]) and AlphaEarth (+0.08 [+0.04 to +0.12]) under unbuffered spatial validation. At a 10 km buffer, however, this advantage narrows to +0.04 [-0.01 to +0.11] and +0.03 [-0.04 to +0.10], intervals consistent with no difference. At 10 m resolution, convolutional neural networks add no benefit over pixel-based XGBoost. Comparisons with four national- and continental-scale products show the importance of non-old-growth labels, and reveal 81% agreement between our predictions and a field-calibrated map. We conclude that buffered spatial validation is vital when transferring old-growth detection models to unseen landscapes, and provide our labels and predictions for future work.
[CV-25] From Change Captions to Change Detection: Semantic-Appearance Agreement Framework for Remote Sensing Change Detection
链接: https://arxiv.org/abs/2609.28192
作者: Yuan Qian,Jie Ma
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 12 pages, 6 figures, 6 tables. Code: this https URL
Abstract:Remote sensing change detection (RSCD) is essential for monitoring land-cover changes and urban development. However, most methods demand pixel-level change masks, which are costly and time-consuming to annotate. Weakly supervised methods reduce this cost by using image-level change labels. Yet these labels indicate only whether a change occurs, leaving models to recover the location of the change and semantic meaning through additional and complex mechanisms. This missing information can be supplied directly by change captions, which describe what changes, what it becomes, and where it occurs. Therefore, we introduce change-caption-guided RSCD, using change captions as the sole task-specific supervision to learn change masks without manually annotated change masks. Our framework has two components: a caption-driven generation pipeline that produces bi-temporal remote sensing image pairs at scale with controlled changes matching each caption, and a change detector guided by the caption’s transition semantics. The detector uses our Semantic-Appearance Agreement Framework (SAAF) to combine caption-grounded semantic responses with RGB differences for change localization, while text conditioning guides dense prediction. Experiments on our newly constructed Flair-RSGen dataset and WHU-CDC show that SAAF outperforms the closest reproduced limited-supervision baselines in macro-averaged IoU and F1 under the evaluated protocols. Code is publicly available at this https URL.
[CV-26] wo Global Crops Suffice: Locating Semantic Emergence in DINO-Style Self-Supervised Learning
链接: https://arxiv.org/abs/2609.28187
作者: Basavaraj Sunagad,Artur Jesslen,Adam Kortylewski
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Self-supervised vision transformers trained with DINO-style objectives exhibit striking emergent semantic representation quality across visual tasks, yet the mechanisms underlying this behavior remain unclear. We present a systematic empirical dissection of the DINO family and show that semantic representations arise primarily from enforcing consistency between geometrically distinct global views of the same image instance. This instance-specific global alignment acts as the semantic anchor of DINO-style learning. Across controlled retraining experiments evaluated on semantic correspondence and a diverse suite of 2D and 3D downstream tasks, we find that patch-level masking objectives enhance semantics only when trained jointly with this global alignment, indicating that the iBOT objective refines and densifies existing semantic structure rather than creating it independently. In contrast, local-to-global view alignment does not substantially improve semantic qualities at fixed compute beyond a purely global alignment. Beyond training design, we revisit how semantic representation quality should be evaluated: while classification accuracy is the standard validation score, semantic correspondence provides a complementary axis that more reliably predicts downstream task performance. Together, these findings provide a functional decomposition of DINO-style learning and represent an important step toward understanding how semantic representations emerge in self-supervised vision models.
[CV-27] VLMs Can Describe But Not Measure: Object-Centric Scene Understanding for Robotic Manipulation
链接: https://arxiv.org/abs/2609.28184
作者: Enrico Saccon,Tommaso Faraci,Iñigo De La Ossa Zarzuelo,Luigi Palopoli,Marco Roveri,Matteo Saveriano
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Robotic operation in previously unseen environments requires both semantic understanding and reliable metric information. While vision–language models (VLMs) provide strong semantic capabilities, their geometric estimates remain less reliable. In this paper, we propose a VLM-driven, modular perception framework for scene understanding using off-the-shelf approaches. Starting from a single RGB-D observation, the scene is segmented into object-level regions, annotated by a VLM, and grounded with depth information to construct a task-independent object-centric representation. Experiments on 151 tabletop scenes show that the proposed decomposition preserves strong semantic performance while substantially improving localization and depth estimation over direct VLM inference. The resulting representation is also integrated with a task-planning framework for robotic execution.
[CV-28] From ECG Signals to Representative-Morphology Heatmaps for Biometric Recognition
链接: https://arxiv.org/abs/2609.28183
作者: Athanasios Angelakis,Marta Gomez-Barrero
类目: Computer Vision and Pattern Recognition (cs.CV); Signal Processing (eess.SP)
备注: 31 pages, 7 figures, 14 tables
Abstract:Electrocardiography (ECG) contains subject-specific morphology that supports biometric recognition, yet image-based performance depends on how the waveform is rendered. We introduce representative-morphology heatmaps, a deterministic ECG-to-image representation adapted from ECGXtractor. Within each block of ten aligned beats, the five beats closest to the block mean are averaged into a 400 by L matrix and rendered either as a conventional trace or as a dense cardiac-time-by-lead heatmap. Since both representations contain identical physiological samples, their comparison isolates the effect of rendering. We evaluate verification and closed-set identification on PTB, ECG-ID, and MIMIC-IV-ECG-DEMO. Five compact models, including ZACH-ViT, are trained from scratch, while six ImageNet-pretrained CNN and transformer backbones assess model scale and visual transfer. Heatmaps improve both FNMR operating points and both identification ranks in all 15 compact model-dataset comparisons, while EER improves in 14. Across the matched experiments, EER decreases by 9.59 percentage points and Rank-1 increases by 24.69 points on average. ConvNeXt-Tiny reaches 2.43% EER on PTB and 5.79% on ECG-ID, whereas DeiT-Base reaches 14.92% on MIMIC-DEMO. ImageNet initialization clearly benefits the two multilead datasets but has a mixed effect on ECG-ID, and performance does not increase monotonically with model size. The best heatmap systems approach the strongest signal-domain EER on PTB and ECG-ID, while DeiT-Base provides the strongest evaluated performance on MIMIC-DEMO. Lead-channel ablation further shows that useful channel combinations depend on the cohort and biometric task. Overall, representative-morphology heatmaps provide an effective image representation for ECG verification and identification.
[CV-29] Depth-Guided Contrastive Learning for 2D Representations with 3D Spatial Awareness
链接: https://arxiv.org/abs/2609.28159
作者: Liang Zeng,Maarten Vergauwen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Standard contrastive learning frameworks are mainly designed from a semantic perspective, yet learning 2D visual representations that preserve 3D spatial structure is also important for scene understanding. In this work, we propose Depth-Guided Contrastive Learning (DGCL), a simple auxiliary objective that injects 3D spatial awareness into 2D contrastive representation learning. Our key idea is to use depth to convert local 3D proximity into contrastive similarity: pixels that are closer in 3D space are encouraged to have more similar representations than pixels that are farther apart. Instead of relying on absolute depth values, DGCL formulates supervision through relative 3D distance comparisons among randomly sampled pixels, making the objective invariant to depth scale, efficient to compute, and easy to integrate into existing contrastive frameworks. Experiments across different datasets and models show that DGCL consistently improves 2D representation learning and benefits semantic downstream tasks by stronger spatial and geometric understanding. The code is available on this https URL.
[CV-30] A comparative assessment of global building and settlement datasets across geographic and settlement contexts
链接: https://arxiv.org/abs/2609.28154
作者: Rufai Omowunmi Balogun,Caroline Margaux Gevaert,Capucine Riom,Derrick Mirindi,Aaron Opdyke,Hamed Alemohammad,Pierre Chrzanowski,Edward Charles Anderson
类目: Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
备注:
Abstract:Global building and settlement datasets increasingly support population mapping, exposure assessment, urban monitoring, and other analyses of the built environment, yet comparative evidence remains fragmented across products, geographic regions, reference datasets, spatial scales, and evaluation methods. We benchmark seven global or near-global products, including Overture Maps, Global Building Atlas, 3D-GloBFP, Google Open Buildings 2.5D Temporal (OBT), Microsoft TEMPO, GHSL, and WSF Tracker, against harmonized reference footprints across 135 study areas. The evaluation combines complementary measures of detection, geometric agreement, and aggregate quantity accuracy, together with stratified analyses of settlement characteristics and diagnostic experiments on error size and temporal alignment. Overture achieved the highest median city-level vector F1 (0.786). Raster rankings were resolution-dependent: OBT achieved the highest median F1 at 10m (0.642), whereas WSF Tracker led at 100m (0.862). However, WSF Tracker substantially overestimated built-up area, emphasizing that when using raster products, it is important for the user to understand whether the raster identifies only buildings or includes additional impervious surfaces. Raster accuracy increased consistently with building density (Spearman \rho = 0.58-0.75), while small candidate buildings were disproportionately associated with false positives in the vector products. Temporally aligning WSF Tracker with reference imagery increased mean F1 by 0.060 (median +0.037), indicating that the reported accuracies are conservative in rapidly growing areas. The study establishes a reproducible benchmark for comparing heterogeneous global urban and settlement layer datasets across geographic and settlement contexts.
[CV-31] Field-of-View Extension in Dental Cone-Beam CT via Implicit Neural Representations and Diffusion Model-Based Refinement
链接: https://arxiv.org/abs/2609.28110
作者: Susanne Schaub,Florentin Bieder,Matheus L. Oliveira,Yulan Wang,Buyanbileg Sodnom-ish,Dorothea Dagassan-Berndt,Michael M. Bornstein,Philippe C. Cattin
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: Accepted at MICAD 2026
Abstract:Dental cone-beam computed tomography (CBCT) systems often employ detector configurations that provide a truncated field of view (FOV) that only captures a small part of the patient’s anatomy. In this work, we aim to reconstruct an extended FOV using projections of truncated FOV scans. To this end, we propose a three-stage framework that consists of (1) an implicit neural representation (INR) for estimating missing parts of the truncated projection data, (2) an iterative reconstruction for generating a secondary volumetric image with improved anatomical consistency and (3) a fast diffusion model for image enhancement. The proposed approach combines the strengths of continuous representations, physics-based reconstruction and generative refinement within a unified pipeline for truncated CBCT imaging. Experimental results demonstrate that the method effectively reduces truncation artifacts, improves the reconstruction of structures extending beyond the original FOV and produces images with enhanced quality. Our code is publicly available at this https URL.
[CV-32] Visual Tripwires: Anticipating Failure in Deep Vision Systems
链接: https://arxiv.org/abs/2609.28099
作者: Anoushka Harit,Rehan Zuberi,William Prew,Florian Markowetz
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Deep vision systems remain vulnerable to corruption, occlusion, and distribution shift despite strong benchmark performance. Existing reliability methods typically evaluate uncertainty at individual time steps and do not explicitly model how a system progresses toward failure. We introduce Visual Tripwires, a predictive reliability framework that uses temporal instability in model behaviour to anticipate impending failure. Our central hypothesis is that predictive degradation develops progressively through measurable changes in latent representations, prediction trajectories, and attention structure. Visual Tripwires captures these changes using representation drift, prediction oscillation, trajectory curvature, and attention entropy. A lightweight tripwire predictor aggregates these signals over a temporal window to estimate the probability of failure within a future prediction horizon. Experiments across multiple datasets, architectures, and progressive perturbation settings show that the proposed instability signals emerge before predictive degradation and provide earlier and more accurate failure warnings than conventional uncertainty estimation methods. These results demonstrate that temporal instability contains useful information about future model reliability and provides a practical basis for early warning in deep vision systems.
[CV-33] MotionSpec: Spectral Trajectory Supervision for Motion-Consistent Video Generation
链接: https://arxiv.org/abs/2609.28095
作者: Ziqi Ni,Rui Li,Shiqi Jiang,Wei Zhou
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Recent advances in text-to-video generation have enabled high-fidelity visual synthesis, yet realistic motion remains challenging. Generated videos may exhibit temporal discontinuities, inconsistent action progression, and structural distortions during complex movements. Even when individual frames appear realistic, the underlying motion may evolve in inconsistent or implausible ways. Standard generative objectives provide limited motion-specific supervision, leaving motion evolution insufficiently constrained. In this paper, we propose MotionSpec, a motion supervision framework centered on Spectral Trajectory Consistency (STC). STC constructs dense anchor-relative motion trajectories and transforms them into motion spectral volumes via a temporal Fourier transform. By aligning the spectral amplitude and phase of predicted and target trajectories, STC constrains both motion strength across temporal frequencies and the temporal organization of motion. To complement this trajectory-level supervision, we introduce Local Flow Consistency (LFC), which aligns consecutive-frame optical flow between predicted and target videos to stabilize local motion transitions. Experiments demonstrate that MotionSpec consistently improves motion consistency, temporal coherence, and plausibility while preserving visual fidelity.
[CV-34] LAYERSCOPE: A Layerwise Characterization of Video and Multimodal Learned Representations
链接: https://arxiv.org/abs/2609.28086
作者: Sandra Arcos-Holzinger,Debashish Chakraborty,Rohita Mocharla,Will Walden,Andrew Yates,Reno Kriz,Sarah M. Erfani,James Bailey,Vishal M. Patel,Sanjeev Khudanpur
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注: Preprint
Abstract:We propose LAYERSCOPE, a label-free, layerwise framework that aims to characterize a model’s learned representations in video and multimodal settings. Evaluating downstream performance using representations from final or intermediate layers typically requires large amounts of labeled data, repeated task-specific evaluations, and substantial computation. To address these limitations, LAYERSCOPE uses local, global, distributional, and correspondence-based geometric metrics to compare layerwise representation structure within and across models without requiring task-specific labels. We evaluate seven architecturally diverse models across video and multimodal classification, clustering, and text-to-video retrieval tasks from MVEB/MVEB+. We find that intermediate-layer representations can outperform final-layer and model-default outputs. We also find that no single geometric metric consistently predicts downstream performance, but note that distinct layerwise geometric signatures emerge across model families. LID shows task-dependent relationships with performance, while RankMe provides the strongest measure for classification and clustering, but is not a universal layer selector. We also find that pairing-aware metrics explain retrieval better than distributional distances alone. LAYERSCOPE therefore offers a framework for comparing representations across models and layers, enabling a more systematic evaluation in video and multimodal settings.
[CV-35] ZoomDiff: A High-Fidelity Diffusion Model for Dual-Camera Smooth Zooming
链接: https://arxiv.org/abs/2609.28083
作者: Jiayi Zhang,Renlong Wu,Yukang Ding,Sibin Deng,Wangmeng Zuo
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Digital zoom transitions between dual cameras often exhibit conspicuous discontinuities in geometric structure and chromatic consistency, degrading the user experience. While recent dual-camera smooth zoom (DCSZ) methods attempt to mitigate this by fine-tuning frame interpolation (FI) models on DCSZ data, they struggle with the large cross-view disparities and complex geometric transformations. Considering that the generative prior of diffusion models is suitable for addressing this problem, we explore their application to DCSZ. However, naively applying existing diffusion-based FI models still yields low-fidelity transitions due to insufficient conditional guidance, high-frequency information loss during VAE encoding, as well as inadequate temporal consistency. To address this, we propose ZoomDiff, a high-fidelity diffusion model that leverages dual-camera inputs in both latent and pixel spaces for photo-realistic transitions. Specifically, we first strengthen dual-image conditional guidance during the multi-step denoising process to improve geometric consistency. Then we inject flow-aligned multi-scale features from the VAE encoder into the VAE decoder to recover high-frequency details, where flow-guided temporal consistency supervision are introduced to produce more smooth transitions. Extensive experiments on both synthetic and real-world datasets demonstrate that ZoomDiff outperforms state-of-the-art methods quantitatively and qualitatively. Project page: this https URL.
[CV-36] LiAM-SAM: Lifecycle-Aware Memory for Robust SAM2-Based MOT
链接: https://arxiv.org/abs/2609.28078
作者: Grégoire Francisco,Alessandro D’Amico,Samuele Costantini,Gianpiero Francesca,Lorenzo Garattoni
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Segmentation-based multi-object tracking (MOT) with foundation video models such as SAM2 offers strong localization quality, yet remains fragile in crowded, real-world scenes. In detector-prompted SAM2 pipelines, failures typically arise at three stages of the object lifecycle: (i) erroneous or duplicate track initiation, (ii) memory drift during close interactions, and (iii) unreliable re-identification after long occlusions or re-entry. These errors corrupt object memory and accumulate over time, making long-horizon tracking unstable. In this paper, we reframe MOT as a lifecycle memory integrity problem. We present LiAM-SAM, a Lifecycle-Aware Memory (LiAM) framework with targeted mechanisms for each of the three failure modes. At track birth, to prevent faulty or duplicate initiations, we apply contrastive track initiation, which conditions each prompt on existing nearby tracked instances. To preserve memory integrity during strong interactions, we introduce motion- and geometry-grounded memory correction that resolves interaction confusions and suppresses drift. For reliable re-identification after disappearance, we maintain an adaptive context memory that promotes diverse and trustworthy references as long-term identity anchors. Finally, similarity aware spatial pruning optionally selects the memory tokens to retain at cross-attention time, improving efficiency with minimal accuracy loss. LiAM-SAM represents a modular, detector-agnostic, SAM2-based MOT system that achieves state-of-the-art HOTA and IDF1 on the evaluated benchmarks. In association-challenging environments, our ablations show that LiAM improves a detector+SAM2 baseline by +10.5 HOTA, +17.4 AssA, and reduces identity switches by 96%.
[CV-37] EEP-RCNN: Texture-Enhanced Edge-aware Perception for Steel Surface Defect Detection via Improved Convolutional Block Attention in Faster R-CNN
链接: https://arxiv.org/abs/2609.28077
作者: Kirtan Rajesh
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Steel surface defect detection is critical for automated industrial quality control but remains challenging due to subtle inter-class texture differences and pronounced class imbalance. We introduce TEEP-RCNN (Texture-Enhanced Edge-aware Perception Region-based CNN), a two-stage detector built on Faster R-CNN with a Feature Pyramid Network backbone and an improved Convolutional Block Attention Module (CBAM). Our CBAM adds dropout regularization in the channel attention MLP and batch normalization on the spatial attention branch, reducing co-adaptation and stabilizing gating logits. Training uses a differential learning rate protocol with cosine annealing warm-up, separating update rates for the pre-trained ResNet-101 backbone and the detection head. At inference, predictions are refined via Test-Time Augmentation fused with Weighted Box Fusion (WBF), improving localization stability on elongated and boundary-adjacent defects. On the NEU-DET benchmark across six defect categories, TEEP-RCNN achieves 73.3% mAP@50 and 37.9% mAP@50-95 in only 10 training epochs on a single GPU, competitive with YOLOv11m (76.2% mAP@50, 100 epochs) while outperforming it on the rolled-in-scale category under the COCO metric. Per-class analysis shows the spatial attention branch is most effective on elongated texture defects such as patches and scratches, while crazing remains an open challenge across both paradigms due to its distributed non-local texture structure.
[CV-38] AstraLOD3: Zero-shot multimodal agent ic reconstruction of LOD3 building models
链接: https://arxiv.org/abs/2609.28061
作者: Bryan G. Pantoja-Rosero
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Automated LOD3 building modeling typically relies on purpose-built geometric or learning-based pipelines, limiting flexibility across heterogeneous buildings and input evidence conditions. This study investigates whether Astra, a general-purpose multimodal foundation model, can address these limitations through zero-shot reconstruction of LOD3 building models within an agentic framework under bounded autonomy. AstraLOD3 combines multi-view images, calibrated cameras, and a filtered sparse SfM point cloud with a natural-language reconstruction specification, while the Astra agent dynamically selects and executes computational procedures using Python and Blender. Across 35 runs, including 24 benchmark buildings, AstraLOD3 achieved a mean FRDS of 0.9647 and geometric agreement comparable to that of previous purpose-built methods. Controlled ablations further revealed the effects of reconstruction guidance, evidence modalities, model configuration, and run-to-run variability. The results demonstrate that structured LOD3 reconstruction can be formulated as a constrained agentic process rather than as a fixed pipeline. Future work will investigate adaptive refinement, user-guided correction, task-specific specialization, and damage-aware reconstruction.
[CV-39] Prompt Probe Train or Annotate? Single-camera sports video understanding in amateur settings
链接: https://arxiv.org/abs/2609.28049
作者: Sai Varun Kodathala,Prashanth Pollishetty,Jaylen Cargill
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Video understanding is usually benchmarked on curated, single-actor, or professionally filmed clips, and a strong score there is routinely read as evidence a model is robust enough for deployment. Amateur team sport is a useful, largely untested place to check that assumption: over eight million students played a school sport in the United States in 2024-25 alone, almost none of it filmed by more than a single fixed camera, with several candidate actors crowded into frame and no operator or second angle to fall back on. Using volleyball as a test case, we ask whether strong performance on general video and world-model benchmarks translates into reliable, per-player attribution once footage is this chaotic, turning footage into statistics through a chain of tasks from finding play boundaries to naming who did what. We evaluate four approaches (prompting and agentic reasoning over frontier vision-language models, classical computer vision with small trained specialists, self-supervised video world models, and manual annotation) at every stage, on 66 amateur matches with 46,648 human-labelled contacts, filmed under conditions no published benchmark uses. No single paradigm wins every stage, and static, single-frame computer vision is not competitive at any stage involving motion or identity. A prompted model segments matches well, yet a far smaller trained model beats it at spotting contacts for a fraction of the cost, and the sport’s own rules recover rally outcomes the pixels cannot. Identity is where every automated approach struggles: a jersey number is a static fact temporal reasoning cannot recover if never visible, unlike sporting action, a repeated motor pattern a temporal model can exploit, which is why holistic reasoning improves event detection while identity stays unchanged. We close with where each approach earns its cost, and what transfers beyond volleyball to amateur sport.
[CV-40] ask-Induced Riemannian Metrics for Vision Transformer Feature Spaces
链接: https://arxiv.org/abs/2609.27988
作者: Andrew Bond,Ege Erdem Özlü,Tuna Çimen,Ilkin Umut Melanlioglu,Tolga Birdal,Erkut Erdem,Aykut Erdem
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Methods operating on Vision Transformer (ViT) feature spaces typically rely on Euclidean distance or cosine similarity. This assumes that every direction is equally meaningful, but there is no reason to believe the true task geometry has this property. The task-sensitive geometry of the feature space is given by the pullback metric g(F) = J(F)^\top J(F) , where J is the Jacobian of the decoder’s output fed to a task-specific distance, with respect to the features. Storing the full g is infeasible at modern scales, and for dense outputs such as depth maps even forming J is impractical. We show that whether a low-rank approximation of this metric can be learned depends on the model-decoder pair, and we characterize this with a matrix-free diagnostic \kappa_cap® computable with a low number of Jacobian-vector products. For tractable pairs, we develop the Spectral Pullback Network (SPN), which learns a low-rank version of the metric from randomized power iteration, and we distill it into a 310 K-parameter importance head that predicts token importance directly from the features. When the Jacobian spectrum is too spread out for a low-rank approximation, passing the decoder’s input features through a VAE bottleneck can restore tractability. Across DPT, DINOv2, CLIP, and VGGT backbones, \kappa_cap® predicts which learned-metric architectures are viable. The importance head reaches Spearman \rho = 0.998 on DINOv2 CLS, and our geometric token pruning reduces the additional depth error of ToMe-based token selection by 25% on DPT depth at prune ratio 0.5 , without fine-tuning the ViT. Project page: this https URL
[CV-41] ScoutNeRV: Rapid Encoding of Grid-Based Video INRs via ScoutNet
链接: https://arxiv.org/abs/2609.27958
作者: Naser Alizada,Farhang Baghban,Hashem Pishkar,Ali Mousavi
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Implicit neural representations (INRs) have emerged as a promising paradigm for video compression, providing compact neural representations with flexible spatial and temporal reconstruction. Hierarchical grid-based architectures such as HiNeRV achieve strong rate–distortion performance, but require extensive per-video optimization, resulting in high encoding costs. To address this limitation, we propose ScoutNeRV, a content-adaptive initialization framework for accelerating the optimization of hierarchical video INRs. ScoutNeRV employs a lightweight, offline-trained scout network that analyzes a small number of sampled frames and selects a suitable pre-trained expert from a memory bank through hard routing. The hierarchical grid and decoder parameters of the selected expert are then transferred to initialize the target HiNeRV model before video-specific fine-tuning. On the unseen ReadySetGo sequence, ScoutNeRV achieves an initial PSNR of 34.95 ~dB, compared with 13.70 ~dB for standard initialization, corresponding to a 21.25 ~dB improvement before fine-tuning. After only 37 epochs, ScoutNeRV reaches 36.92 ~dB and remains within 0.42 – 0.80 ~dB of the 300-epoch HiNeRV baseline across the evaluated rate–distortion configurations. Furthermore, the proposed initialization achieves a 9.25\times wall-clock speedup in the reported runtime experiment. These results demonstrate that content-aware expert initialization can substantially reduce the optimization cost of hierarchical video INRs while retaining competitive reconstruction and compression performance. The code is available at this https URL.
[CV-42] VIVAS: Vitalizing Visual Perception in VLM Pre-training via Vision-language Unified Autoregressive Supervision
链接: https://arxiv.org/abs/2609.27948
作者: Zhehan Kan,Yubo Zhu,Xinghua Jiang,Zhixiang Wei,Shifeng Liu,Wei Tong,Sheng Zhong,Qingmin Liao,Wenming Yang,Xin Li,Yinsong Liu,Deqiang Jiang,Xing Sun
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:While Vision-Language Models (VLMs) demonstrate strong capabilities, they continue to suffer from a critical limitation: insufficient fine-grained visual perception, which fundamentally limits their multimodal understanding. We attribute this bottleneck to text-dominant optimization biases during pre-training, which encourage the model to overlook fine-grained visual details, thereby limiting the capability of multimodal understanding. We investigate that overcoming this bottleneck requires two key elements: (1) a unified token space paradigm that ensures stable training dynamics, and (2) a modality-aligned dense visual supervision signal enriched with both structural granularity and semantic information to capture critical visual representations. Based on these insights, we propose VIVAS, a framework built upon the unified token space paradigm, which introduces a dense-structural-semantic vision tokenizer, which expands the textual vocabulary into a unified vision-language vocabulary by incorporating a visual vocabulary. During pretraining, VIVAS performs vision-language unified autoregressive supervision over both visual details and linguistic content, thereby enhancing visual perception to improve multimodal understanding. Trained end-to-end on 12.4T tokens, VIVAS achieves state-of-the-art performance across 7 tasks and 39 multimodal benchmarks.
[CV-43] UVU: Improving Multimodal Understanding via Vision-Language Unified Autoregressive Paradigm
链接: https://arxiv.org/abs/2609.27915
作者: Zhehan Kan,Xinghua Jiang,Yubo Zhu,Yanlin Liu,Xiaochen Yang,Zhixiang Wei,Shifeng Liu,Qingmin Liao,Wenming Yang,Xin Li,Yinsong Liu,Deqiang Jiang,Xing Sun
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Despite remarkable advancements in multimodal large language models (MLLMs), their fine-grained visual understanding is constrained by a primary reliance on sparse textual supervision. Existing efforts to introduce visual supervision typically do so during post-training, when visual representations have already been largely fixed, causing such signals to act mainly as auxiliary constraints rather than as a primary force for shaping perceptual features. In this paper, we aim to fundamentally reshape the model’s perceptual backbone by incorporating vision supervision directly into the pre-training stage. We observe that pixel-level image patches and textual tokens naturally coexist in a shared, raw high-dimensional space characterized by an inherent input symmetry. Leveraging this insight, we propose UVU, a novel vision-language unified autoregressive framework that eschews vector quantization. It uniquely employs continuous visual encoding for lossless representation of visual inputs and proposes a large-scale iterative hierarchical clustering algorithm to construct a pixel-level visual codebook, thereby extending the vocabulary for unified supervision and enabling autoregressive generation of pixel-level image tokens alongside textual tokens. UVU effectively synergizes pixel-level visual perception with semantic-level visual understanding, internalizing visual reconstruction capabilities and unlocking the facilitative role of visual supervision in enhancing understanding in the pre-training stage. Extensive experiments across multiple tasks demonstrate that MLLMs are capable of achieving superior multimodal understanding performance under the supervised learning paradigm of UVU.
[CV-44] Spatiality-Frequency Domain Video Forgery Detection System Based on ResNet-LSTM-CBAM and DCT Hybrid Network
链接: https://arxiv.org/abs/2609.27904
作者: Zihao Liao,Sheng Hong,Yu Chen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:As information technology advances, digital content has become widely adopted across diverse fields such as news broadcasting, entertainment, commerce, and forensic investiga?tion. However, the availability of sophisticated multimedia editing tools has significantly increased the risk of video and image forgery, raising serious concerns about content authenticity at both societal and individual this http URL address the growing need for robust and accurate detection methods, this study proposes a novel video forgery detection model that integrates both spatial and frequency-domain features. The model is built on a ResNet-LSTM framework enhanced by a Convolutional Block Attention Module (CBAM) for spatial feature extraction, and further incorporates Discrete Cosine Transform (DCT) to capture frequency domain information. Comprehensive experiments were conducted on several mainstream benchmark datasets, encompassing a wide range of forgery scenarios. The results demonstrate that the proposed model achieves superior performance in distinguishing between authentic and manipulated videos. Additional ablation and comparative studies confirm the contribution of each component in the architecture, offering deeper insight into the models capacity. Overall, the findings support the proposed approach as a promising solution for enhancing the reliability of video authenticity analysis under complex conditions.
[CV-45] All modalities are equal but video is more equal: Closing the Cross-Attention Gap in Joint Video Generation
链接: https://arxiv.org/abs/2609.27901
作者: Ohad Rahamim,Dvir Samuel,Idan Schwartz,Gal Chechik
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Video is a rich representation of a physical event, capturing appearance, geometry, motion, and temporal evolution. Other modalities, such as 3D body motion or audio, encode narrower aspects of the same event. We find that joint multimodal diffusion transformers exhibit a corresponding asymmetry in cross-modal correspondence: companion modalities develop strong correspondences to video, but the reciprocal correspondences through which they constrain video remain substantially weaker. We express both directions as comparable correspondence distributions over video tokens and define their disagreement as the reciprocal correspondence gap. We introduce RecCAR, standing for Reciprocal Cross-modal Attention Regularization, a KL regularizer that uses the well-established video-to-modality correspondence as a fixed reference and aligns the weaker modality-to-video correspondence toward it. Across joint video-motion and video-audio generation, RecCAR improves the Human Anatomy score from 0.69 to 0.75 and reduces audio-video desynchronization from 0.804 to 0.752, while improving overall generation
[CV-46] RelCheck: Dual-Evidence Spatial Grounding for VLM Hallucination Correction
链接: https://arxiv.org/abs/2609.27890
作者: Siddhi Patil,Navrati Saxena,William B. Andreopoulos
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Multimodal large language models (MLLMs) fre- quently generate text that is inconsistent with the input image. While object- and attribute-level hallucinations have received considerable attention, relational hallucinations (incorrect de- scriptions of spatial or interactive relationships between objects) remain largely unaddressed by existing post-hoc correction methods. We present RelCheck, a training-free post-hoc correction pipeline that augments object-level visual grounding with dual relational evidence: learned scene-graph triples from RelTR and deterministic spatial predicates from bounding-box geometry. These combine with a Woodpecker-style object claim layer to form a three-layer visual knowledge base, which a language model corrector uses to rewrite hallucinated text. Evaluated on LLaVA v1 13B, RelCheck achieves a total MME hallucination score of 630.0 versus 585.0 for a Woodpecker-style baseline, with the largest gain on the position subtask (+31.7 points, accuracy+ improving from 0.367 to 0.600). A four-configuration ablation confirms that both relational layers contribute independently (McNemar p = 0.025). These results show that structured relational evidence meaningfully improves post-hoc hallucination correction on the spatial reasoning subtasks where current MLLMs are most deficient.
[CV-47] opoGS: Topology-Aware Anchor Feature Aggregation for Large-Scale 3D Gaussian Splatting
链接: https://arxiv.org/abs/2609.27868
作者: Wei Zhang,Shiqiang Gong,Shengkai Yu,Zeyu Wang,Clement Mallet,Zhitong Xiong,Qi Wang
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 9 figures, 7 tables; supplementary material included. Code is available at this https URL
Abstract:Octree-based 3D Gaussian Splatting organizes anchors into multi-level hierarchies for level-of-detail rendering, but features at different levels are typically optimized independently, leaving the octree topology underused during feature learning. We observe that uniform cross-level aggregation produces asymmetric effects: fine-level anchors benefit from coarse context, whereas coarse-level anchors require selective information from their descendants. We therefore propose TopoGS, a topology-aware anchor feature aggregation framework with two lightweight components. Hierarchical Anchor Coupling establishes bidirectional cross-level gradient pathways by fusing per-level context triplets with a residual MLP. Structure-Aware Containment Aggregation uses octree containment and hash-based matching to distinguish anchors with valid parent-child relations from isolated anchors, then applies soft weighting to accommodate varying topological sparsity. Experiments on ten scenes from Mill19, UrbanScene3D, Tanks Temples, MatrixCity, and WHU show consistent improvements over state-of-the-art methods. TopoGS achieves average PSNR gains of 2.13, 1.78, and 0.29 dB over the strongest reported baseline on aerial, ground-level, and synthetic-cartographic scenes, respectively, while rendering faster and using less memory. Code is available at this https URL.
[CV-48] GaussianDS: Depth-supervised Semantic Gaussian Splatting for Scene Understanding
链接: https://arxiv.org/abs/2609.27850
作者: Yufei Zhang,Chenlu Zhan,Hongwei Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:3D Gaussian Splatting provides an efficient representation for 3D reconstruction, and recent extensions attach semantic attributes to Gaussians for open-vocabulary scene understanding. However, lifting view-dependent 2D foundation-model outputs into 3D space introduces cross-view inconsistencies and weak geometric grounding, leading to severe semantic drift and boundary leakage. We propose GaussianDS, a depth-supervised semantic 3DGS framework that treats semantic lifting as a supervision-alignment problem and jointly optimizes RGB appearance, rendered depth, and compact semantics from scratch. Specifically, GaussianDS organizes unordered multi-view images into a pose-aware pseudo-video trajectory to propagate view-consistent masks via SAM2. During joint optimization, scale-shift-aligned monocular depth supervision and depth total-variation regularization stabilize Gaussian geometry, while a depth-edge-aware refinement loss explicitly anchors semantic transitions onto physical geometric discontinuities. Extensive evaluations show that our end-to-end framework not only retains high-fidelity 3D reconstruction and real-time rendering, but also establishes superior semantic understanding. GaussianDS sets new state-of-the-art performance on LERF (60.5% mIoU) and 3D-OVS (97.79% mIoU, 90.28% mBIoU) by mitigating semantic leakage, while seamlessly facilitating downstream 3D object removal.
[CV-49] Geometry-anchored PET-aware multimodal pseudo-CT synthesis for whole-body attenuation correction: the BIC-MAC Challenge MICCAI2026
链接: https://arxiv.org/abs/2609.27848
作者: Xuan Loc Nguyen,Hoang-Loc Cao,Truong Thanh Hung Nguyen,Phuc Ho,Phuc Truong Loc Nguyen,Nguyen Truong Toan To,Hung Cao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Challenge paper for the Big Cross-Modal Attenuation Correction (BIC-MAC) Challenge at MICCAI 2026
Abstract:The BIC-MAC challenge targets whole-body pseudo-CT synthesis from NAC-PET, Dixon MRI, and a 2D topogram for CT-less PET attenuation correction. We propose GeoPACT, a geometry-anchored multimodal framework that uses NAC-PET as the spatial reference and incorporates topogram and MRI features through gated residual fusion. Absolute coordinates and whole-body conditioning support anatomically consistent patch-based prediction. Training combines attenuation-map supervision with a differentiable PET-response surrogate to reduce errors relevant to downstream PET reconstruction. Full-resolution pseudo-CT volumes are generated using sliding-window inference without requiring CT or PET labels at test time.
[CV-50] Groundbench: Multi-Resolution Polygon Grounding Exposes the Geometry Gap in Vision-Language Models
链接: https://arxiv.org/abs/2609.27821
作者: Zhonghan Bian,Zhenran Wang,Jinsong Li,Zhangyang Qi
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Project page: this https URL
Abstract:Bounding-box scores on RefCOCO-family grounding leave little room to distinguish frontier vision-language systems, yet boxes discard object shape. We introduce GroundingBench, a matched benchmark that re-targets the same 1,500 image-expression-referent triples to exact-N polygons at five vertex budgets. A fixed-denominator harness separately audits filled-region intersection over union (IoU) and legal-polygon completion. The strongest tested configuration reaches 88.2 box IoU and 97.1 accuracy at IoU = .5 (Acc@.5), versus 57.7 and 69.2 for direct polygons; because these headline scores use different references, we also compare direct polygons with predicted boxes rasterised against the same contour target, obtaining 57.7 versus 57.3 when pooled. Performance is non-monotone in N and collapses at the densest budget, where legality failures compound residual geometric error. Qwen’s thinking-setting contrast is the largest tested input-preserving configuration difference; under frozen templates, false spatial cues are more damaging than false colour cues, and target preference can remain high while contour tracing is poor. Alternate masks and a continuous-area scorer preserve the principal ordering. GroundingBench therefore measures an operational output-geometry gap spanning localisation, boundary construction, serialisation, and topology, rather than latent boundary perception alone.
[CV-51] Evaluating ADC-only deep learning pipelines for breast cancer detection and segmentation using standalone diffusion-weighted MRI
链接: https://arxiv.org/abs/2609.27815
作者: Pablo García Marcos,Paula Puerta Gonzĺez,Guillermo Lorenzo,Héctor Gómez,Covadonga del Camino,Angel Rio-Alvarez,Víctor M. González
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Dynamic contrast-enhanced (DCE) imaging is the gold standard technique for the detection and characterization of breast cancer using magnetic resonance imaging (MRI). However, DCE-MRI requires long acquisition times and the administration of contrast into the bloodstream, which can cause allergic reactions. Alternatively, diffusion-weighted MRI (DW-MRI) is a standard complementary technique for breast MRI that does not require contrast, has shorter acquisition times, and enables calculation of apparent diffusion coefficient (ADC) maps that correlate with tumor cellularity. Yet, despite these technical advantages, deep learning research has focused on DCE-based models and has barely explored the tumor detection performance of DW-MRI and ADC maps either in combination with DCE-MRI or as standalone alternatives. Here, we evaluate the application of different state-of-the-art deep learning techniques for detection and segmentation of breast cancer using ADC-only images. This is, to our knowledge, the first comprehensive evaluation of ADC-only breast cancer pipelines for classification, detection, and segmentation tasks.
[CV-52] DMM-Align: Closed-Loop Optimization for 2D-3D Registration with Dual-Role Diffusion
链接: https://arxiv.org/abs/2609.27794
作者: Chongjian Wang,Junjie Gao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:2D-3D registration remains brittle in challenging scenarios such as low overlap, occlusion, repetitive structures, and severe cross-modal ambiguity. A key reason is that existing methods improve representation learning, correspondence estimation, or pose computation in isolation, while the dominant failure mode is inherently cross-level, where errors propagate between features, correspondences, and pose. To address this limitation, we propose DMM-Align: Diffusion-based Matching Matrix Alignment, a closed-loop framework that couples correspondence refinement, pose estimation, and representation learning through a shared differentiable geometric state. Our method leverages diffusion in two coordinated roles: a geometry-aware diffusion process refines the soft matching matrix for robust correspondence estimation, while a geometry-conditioned diffusion teacher injects pose-induced supervision back into feature learning. These processes are connected via a differentiable geometric hinge that converts correspondences into a global pose and exposes geometric inconsistency to upstream modules. Extensive experiments on 7-Scenes and RGB-D Scenes V2 demonstrate that DMM-Align consistently outperforms strong baselines, especially under low-overlap and heavy-occlusion conditions, highlighting the effectiveness of closed-loop geometric feedback for robust 2D-3D registration.
[CV-53] DualStabSleepNet: A Dual-Domain Diffusion Stabilization Network for Robust Sleep Staging
链接: https://arxiv.org/abs/2609.27793
作者: Chongjian Wang,Chen Liu,Junjie Gao,Xiaofang Zhong,Shiyuan Han,Tong Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Existing deep learning approaches for automatic sleep staging suffer from limited robustness under heterogeneous recording conditions, where non-stationary noise, inter-subject differences and cross-dataset distribution shifts cause unstable features and poor generalization. This work proposes DualStabSleepNet (DSSNet), a dual-domain diffusion stabilization network for robust sleep staging, which improves robustness in both data and feature domains. After preprocessing multi-channel polysomnography (PSG), a continuous-scale diffusion-based stabilization module suppresses noise while preserving physiological signal structures. Stabilized signals are converted to time-frequency representations and fed into a Vision Transformer backbone. A teacher-student guided diffusion feature stabilization module further mitigates feature drift and enforces multi-level feature consistency. Evaluated on four public PSG datasets SleepEDF-20, SleepEDF-78, SHHS and ISRUC-S3, DSSNet achieves state-of-the-art accuracy of 89.2%, 88.0%, 89.7%, 86.7% with improved macro-F1 and Cohen’s kappa. It obtains notable improvements on hard transitional stages (e.g., 12.5% gain for N1 on SHHS) and boosts N2/REM recognition. Under cross-dataset settings, DSSNet is robust to distribution shift and performs on par with or superior to target-dataset trained baselines, demonstrating its practical potential for real-world sleep staging across heterogeneous cohorts.
[CV-54] ask-Prototype Guided Flow Matching for Few-Shot Generalization in Vision-Language Robot Manipulation
链接: https://arxiv.org/abs/2609.27780
作者: Yizhao Wang,Guantao Zhang,Jingbo Wang
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: 29 pages, 12 figures
Abstract:Vision-language robot manipulation policies can follow semantic instructions, but adapting them to a new procedure from only a few demonstrations remains difficult because language underspecifies contact timing, motion phases, corrective behavior, and execution style. This paper presents Task-Prototype Guided Flow Matching (TP-Flow), a few-shot manipulation framework that converts support demonstrations into structured task-prototype tokens and uses them to guide both the initial flow prior and the velocity field. TP-Flow employs symmetric cross-attention with learnable queries to extract phase-level prototypes, parameterizes a task-adaptive initial distribution, and injects prototype information through gated adaptive normalization. It is trained with an episodic support-query objective and prototype contrastive regularization, so few-shot adaptation is simulated during training while nuisance information is suppressed. On the LEROBOT-ARM-SO101 platform, TP-Flow achieves 66.8%, 79.6%, and 82.1% success rates under 1-, 4-, and 6-shot settings, with a 75.5% few-shot AUC. At 1-shot, it improves over CFM, Pooled-Demo CFM, and In-Context Flow by 29.8, 14.5, and 9.9 percentage points. It also improves held-out target-group generalization across novel-object transfer, goal recombination, long-horizon composition, and contact/correction tasks. TP-Flow maintains real-time execution with six online prototype tokens, 54.3 ms latency, 3.9 GB peak memory, and a 10 Hz control rate, while reducing the noisy-support success drop to 6.2%. Theoretical diagnostics show that prototype distance aligns with action-distribution distance, the adaptive prior reduces transport cost, and gated modulation keeps measured trajectory deviations below the derived ODE bound. The code repository is omitted for anonymous review.
[CV-55] Fusion-Aware Direct 3D Gaussian Generation with Structured Patch Latent Flows
链接: https://arxiv.org/abs/2609.27779
作者: Yizhao Wang,Jingbo Wang,Guantao Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 29 pages, 12 figures
Abstract:Class-guided 3D object generation is important for intelligent content creation, virtual environments, and digital asset design. Although 3D Gaussian Splatting (3DGS) offers an explicit and render-efficient representation, directly generating 3D Gaussian objects is difficult because Gaussian primitives are unordered, variable-sized, locally dense, and highly sensitive to rendering. Existing 3DGS generation methods usually depend on multi-view synthesis, reconstruction, or lifted 2D priors, fusing information mainly from observed views rather than modeling the intrinsic structural distribution of 3D Gaussian objects. This paper proposes a fusion-aware hierarchical Gaussian patch representation for direct class-guided 3DGS generation with rectified flow. Irregular Gaussian sets are decomposed into canonical local patches and encoded as structured tokens. The resulting hierarchical latent space fuses global class semantics, patch-level geometry and appearance, spatial correspondence, and rendering-sensitive cues. On this basis, we design a structure-aware rectified flow model with patch-position conditioning, global-local coupled velocity prediction, and density-aware velocity weighting, enabling direct latent generation of class-conditioned 3DGS objects within seconds. A render-feedback fusion strategy further aligns latent flow learning with decoded multi-view rendering quality. Experiments show that the proposed method generates 3D Gaussian objects with more coherent geometry, sharper local details, and better multi-view consistency than baseline latent generative models. Ablation studies confirm the contributions of hierarchical information fusion, global-local coupling, density-aware supervision, and render-feedback learning while preserving practical sampling efficiency overall. Comments: 29 pages, 12 figures Subjects: Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2609.27779 [cs.CV] (or arXiv:2609.27779v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2609.27779 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-56] Visibility-Guided Structured Measure Flow for Class-Conditioned 3D Gaussian Generation
链接: https://arxiv.org/abs/2609.27778
作者: Yizhao Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 13 pages, 5 figures
Abstract:3D Gaussian Splatting (3DGS) has made real-time, high-fidelity 3D rendering practical, yet turning this explicit representation into a native generative space remains an open challenge. Directly generating 3DGS objects is difficult because Gaussian primitives are unordered, variable-sized, locally dense, and highly sensitive to rendering behavior. We present VISTA-GS, a visibility-guided structured measure flow framework for class-conditioned 3D Gaussian generation. Instead of treating a 3DGS object as a flat primitive sequence or a generic latent token grid, we formulate it as a structured Gaussian measure weighted by opacity, anisotropic covariance, and multi-view visibility. Based on this formulation, we introduce a visibility-aware measure VAE that learns permutation-invariant, variable-size-compatible, and rendering-aware latent representations of 3DGS objects. We further develop a renderer-consistent measure flow that transports class-conditioned priors toward the learned 3DGS measure distribution while aligning the decoded objects with their multi-view rendering distributions. To preserve object layout and local details, VISTA-GS incorporates structure-preserving patch transport that couples global class semantics, local Gaussian measure patches, and spatial anchors during flow prediction. On VISTA-Obj30, VISTA-GS improves over the strongest baseline by roughly 60–72% across geometry, appearance, view-consistency error, and generation speed. This design enables efficient generation of coherent, detailed, and view-consistent 3D Gaussian objects without relying on per-instance optimization, multi-view image synthesis, or reconstruction-based lifting pipelines. Project code and model checkpoints will be released.
[CV-57] AWM-VLA: AlignedWorld Modeling for Efficient and Explainable Vision-Language-Action Policies ICML2026
链接: https://arxiv.org/abs/2609.27753
作者: An Lanji,Dawei Liu,Jin Li,Haoran Xu,Mei Chen,Yu Tian
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 11pages,7 figures, submitted to ICML 2026
Abstract:Vision-language-action (VLA) models have become a powerful paradigm for generalist robotic manipulation, yet they are often reactive: the policy maps the current observation directly to an action chunk without reasoning about the long-term consequences of its decisions. Prior attempts to endow policies with world models either reconstruct future frames in pixel space—expensive and dominated by task-irrelevant detail—or decouple the world model from the policy, weakening control. We present AWM-VLA, a unified framework that embeds aligned world modeling directly inside a diffusion-transformer policy. Following the Future Latent REpresentation Alignment (FLARE) principle, we add learnable future tokens whose intermediate activations are aligned with vision-language embeddings of future observations, enabling the policy to anticipate long-term consequences while generating actions. We extend this paradigm in two ways. First, we introduce an object-centric decoupled alignment objective that predicts future object-level semantics alongside the global future embedding, improving both interpretability and multi-instruction generalization. Second, we balance the global and object-centric alignment terms against the action flow-matching loss through a principled weighting, yielding a controllable accuracy–interpretability trade-off. On RoboCasa and humanoid tabletop manipulation benchmarks, AWM-VLA outperforms prior VLA and world-model baselines by up to 21% in success rate, improves generalization to novel objects and instructions, and produces object-centric rationales that are preferred by human raters in 83 of cases. Our approach adds only a few learnable tokens to the policy and is compatible with any diffusion or flow-matching policy, making aligned world modeling an inexpensive, broadly applicable component of generalist manipulation.
[CV-58] NeuralSRNF: Neural Square Root Normal Fields for the Statistical Shape Analysis and Generation of Nonrigid 3D and 4D Objects
链接: https://arxiv.org/abs/2609.27728
作者: Awais Nizamani,Hamid Laga,Guanjin Wang,Farid Boussaid,Mohammed Bennamoun,Anuj Srivastava
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 13 pages, 17 figures, journal submission
Abstract:We introduce NeuralSRNF, a novel framework for the statistical shape analysis and generation of genus-zero 3D and 4D objects that undergo nonrigid deformations. Traditional methods rely on complex and computationally expensive nonlinear elastic metrics that measure bending and stretching. Recent advances in elastic shape analysis achieve computational efficiency by mapping input 3D shapes to the space of Square Root Normal Fields (SRNFs) where the L2 metric approximates the partial elastic metric, significantly facilitating the process of computing geodesics and summary statistics. SRNFs, however, are not invertible, and the numerical algorithms used to map SRNFs back to the original space of surfaces remain computationally very expensive and often lead to approximate results. This paper addresses this fundamental SRNF inversion problem using a novel neural representation, termed NeuralSRNF. Unlike the commonly used numerical SRNF, NeuralSRNF is (1) continuous, and thus resolution-agnostic, enabling full functional shape analysis, (2) more accurate, and (3) computationally more efficient as it can compute inverse SRNF maps along a geodesic path in less than 3 s compared to over 10 min for the numerical SRNF. We demonstrate, using various datasets, the utility and efficiency of the proposed NeuralSRNF in multiple elastic 3D and 4D shape analysis tasks such as geodesic computation, deformation transfer, statistical summaries computation, and 3D shape generation. We show that it outperforms competing methods on most evaluated datasets and metrics by a wide margin in both accuracy and computational efficiency. The source code and additional results are available at this https URL.
[CV-59] FFM-CP: Cross-Backbone Fusion of Vision-Language Foundation Models for Few-Shot Computational Pathology
链接: https://arxiv.org/abs/2609.27710
作者: Anh-Tien Nguyen,Trung DQ. Dang,Nghiem Tuong Diep,Bui Ngoc Han Nguyen,Tan-Ha Mai,Miriam Cindy Maurer,Phuong Hoa Nguyen,Thi Thuy Uyen Nguyen,Youngjun Park,Daniel Sonntag,Duy Minh Ho Nguyen,Anne-Christin Hauschild
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Pathology vision-language foundation models vary in performance across diseases and tasks, with no single model consistently performing best. The high cost of expert pathology annotation can also limit the labeled data available for task-specific adaptation. Combining complementary pretrained representations is a potential approach to these limitations, yet learning an effective fusion from few labeled examples remains challenging. We introduce Few-shot Fusion Foundation Models of Computational Pathology (FFM-CP), which is a framework that combines multiple pathology vision-language models in the few-shot learning setting. The framework first aligns heterogeneous representations using a closed-form Orthogonal Procrustes transformation estimated from corresponding support images. This alignment preserves within-model feature geometry without training an additional alignment network. Within the aligned space, a unified graph enables information exchange across backbones by jointly refining support-image features and visual and textual class prototypes. These refined representations support complementary text-prototype and case-retrieval branches that capture semantic class knowledge and within-class visual variation, respectively. Each branch learns to combine predictions from all ordered backbone pairs, allowing queries encoded by one model to draw on evidence represented by another. We evaluate three backbone combinations on six histopathology datasets at 4, 8, and 16 shots per class. FFM-CP achieves higher mean macro-F1 than the strongest individually adapted member of each fused set in 50 of 54 comparisons. These findings suggest that combining complementary pretrained representations can improve histopathological classification when annotations are limited.
[CV-60] DAVIO: Dense Monocular-Inertial SLAM with Feed-Forward Initialization and Pose-Conditioned Mapping
链接: https://arxiv.org/abs/2609.27702
作者: Jaafar Mahmoud,Arthur Movsesyan,Mikhail Iumanov,Sergey Kolyubin
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:A camera and an IMU are the minimal sensor setup for metric localization and dense mapping, yet classical visual–inertial filters must wait for parallax before they start and then retain only sparse landmarks. Feed-forward geometry models, in contrast, predict dense structure from a few images but provide neither metric scale nor gravity. We present DAVIO, which uses a single multi-view depth model, Depth Anything~3, for both start-up and mapping. At start-up, a five-image window and preintegrated IMU measurements form a feature-free linear system. Its robust, conditioning-checked solution bootstraps a VIO filter through buffered replay. During tracking, the filter’s metric poses condition the depth model. Residual scale is corrected only along viewing rays, which preserves the metric camera baselines, and a gravity-preserving submap graph with drift-gated revisits refines the map. On EuRoC, DAVIO starts markedly earlier, reduces the localization error, and maps more accurately than SOTA feed-forward mappers given identical poses. On building-scale ORI sequences, DAVIO is on bar or better than SOTA mappers on the same odometry, and degrades far less when GT poses are replaced by real odometry. We release the code of DAVIO, a real-time dense metric SLAM system, to the community.
[CV-61] SynSeq: End-to-End SYNTAX Score Prediction from Coronary Angiography Videos
链接: https://arxiv.org/abs/2609.27696
作者: Christoph Baumann,Ronny Schweitzer,Noemi Pavo,Ulrike Attenberger,Christian Loewe,Philipp Seeböck
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: for associated code, see this https URL
Abstract:The SYNTAX score is an established tool for assessing coronary artery disease and guiding revascularization treatment decisions. However, its manual estimation from coronary angiography videos by clinical experts is time-consuming and subject to inter-reader variability. While machine learning has shown promise in automating this process, prior work has primarily focused on lesion detection, characterization, or binary disease classification, leaving direct SYNTAX score prediction relatively unexplored. We propose SynSeq, a video-based method for direct SYNTAX score prediction. It combines targeted preprocessing with a tailored training strategy using a zero-inflation-aware loss and linear target scaling. Evaluated on the public CardioSyntax dataset, SynSeq significantly outperforms previous state-of-the-art methods, improving R^2 by 0.55, reducing prediction bias by 93.1% and achieving more consistent performance across annotations from three independent expert graders. In addition, SynSeq achieves a weighted F_1 -score of 0.80 for revascularization treatment recommendations, slightly below inter-expert agreement. These results demonstrate the potential of SynSeq to provide consistent, automated SYNTAX score assessment and reliable decision support for coronary revascularization planning.
[CV-62] Gender Bias in Vision-Language In-Context Learning ECCV2026
链接: https://arxiv.org/abs/2609.27682
作者: Tong Xiang,Noa Garcia,Yuta Nakashima
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ECCV 2026
Abstract:In-context learning (ICL) enables large vision-language models (LVLMs) to perform tasks by following patterns from in-context examples, yet its potential to amplify societal biases remains underexplored. We systematically investigate how ICL influences gender bias in LVLMs through VL-BICLE, an evaluation framework comprising six ICL settings, three tasks, and four datasets. Our experiments on six LVLMs reveal that gendered ICL demonstrations act as a directional force, shifting model bias toward the demonstrated gender through a cross-gender mechanism that disproportionately degrades performance on the opposite gender. This effect appears in image captioning and pronoun prediction but not in visual question answering, indicating that gendered ICL influences bias only when the task output involves gendered language. Similarity-based retrieval methods inherit the training pool’s gender imbalance and offer no debiasing advantage, while standard quality metrics remain blind to these bias shifts. To mitigate this bias, we replace real in-context images with synthetic ones from stable diffusion models while keeping captions unchanged. This simple intervention reduces gender bias without degrading caption quality.
[CV-63] CasCVS-Net: A Staged Multi-Task Cascade for Critical View of Safety Assessment
链接: https://arxiv.org/abs/2609.27681
作者: Bock-Zien Toh,Yuanchuan Ren,Tay Aw Yu,Ng Khee Ong,Zhehua Mao,Sophia Bano
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 10 pages, 3 figures, 3 tables
Abstract:Automated assessment of the Critical View of Safety (CVS) in laparoscopic cholecystectomy requires both recognition of the three CVS criteria and anatomical grounding in small, rare, and often occluded hepatocystic structures. Learning-based methods differ in the anatomical information they use, from image-level classification to detection, segmentation, or graph-based reasoning, yet grounding the safety-critical anatomy remains the main bottleneck. We propose CasCVS-Net, a staged multi-task cascade that jointly performs object detection, semantic segmentation, and CVS assessment, trained on the Endoscapes dataset. The model couples the tasks through predicted anatomy: predicted boxes guide segmentation, and predicted masks provide region-level features for CVS classification, so CVS assessment at inference uses only model predictions rather than ground-truth annotations. To reduce optimisation instability in this coupled setting, training progresses from detection to detection-segmentation and then to the full three-task cascade, followed by task-wise fine-tuning. Evaluation on the public unseen test set shows that CasCVS-Net improves over matched single-task baselines on all three tasks, achieving 32.0 detection mAP, 46.8 semantic mIoU, 15.3 rare-anatomy mIoU, and 67.2 CVS mAP. It outperforms the state-of-the-art LG-CVS and SV2LSTG by 6.3% and 4.5% relative CVS mAP, respectively, corresponding to 4.0 and 2.9 mAP points. These results show that staged task coupling through predicted boxes and masks improves anatomical grounding for CVS assessment, particularly for rare hepatocystic structures.
[CV-64] RoadOcc Learns When to Persist Transport or Refresh Memory for Roadside Occupancy Prediction
链接: https://arxiv.org/abs/2609.27677
作者: Xiaokai Bai,Lei Yang,Songkai Wang,Lianqing Zheng,Si-Yuan Cao,Hui-liang Shen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 9 pages, 7 figures, 6 tables
Abstract:Fixed roadside cameras repeatedly observe a stable scene overlaid by sparse moving traffic. Temporal memory can recover weak observations, but reusing moving evidence at stale locations can corrupt occupancy predictions. Motion compensation addresses displacement, while reliance on the resulting history remains a separate learning problem. We introduce RoadOcc, which learns soft routing among fixed-coordinate history (\emphPersist), velocity-addressed history (\emphTransport), and current evidence (\emphRefresh). Motion state and class-consistent historical support supervise these source choices. Dynamic-aware cross-attention (DCA) updates candidate locations, multi-scale voxel velocity estimation (VVE) constructs transport addresses from multi-scale current–history correspondence, and velocity-guided dynamic sparse fusion (VDSF) combines routed evidence under fixed sparse-token budgets. On InfraOcc, RoadOcc reaches 65.29 mIoU and 32.37 dynamic mIoU, gains of 4.44 and 4.71 over STCOcc. Controlled address experiments show that VVE raises dynamic mIoU by 0.87 over fixed-coordinate reading. Across three seeds, supervised P/T/R adds 1.40 dynamic points over motion-corrected retrieval, while removing Refresh costs 0.32 points. Results from two transfer models, Occ3D-nuScenes, and longer intervals provide additional support. Code will be released.
[CV-65] rack2Art: Motion-Centric Articulated Object Model Recovery from 2D Point Trackers
链接: https://arxiv.org/abs/2609.27675
作者: Xiaotong Li,Yixiong Jing,Junsheng Ding,Weihang Li,Benjamin Busam,Guangming Wang,Brian Sheil
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Understanding articulated objects is fundamental for robotic interaction, requiring accurate rigid-part discovery and the recovery of their kinematic relations. Existing approaches often treat articulation as a by-product of reconstructed geometry or recover it through per-instance optimization. We instead build on the hypothesis that articulation is directly observable from persistent motion: points on the same rigid part move coherently, while relative motion between parts reveals their kinematic constraints. We present Track2Art, a motion-centric framework for recovering structured articulated objects from RGB-D interaction videos. Track2Art lifts tracked image points into persistent 3D trajectories and combines pretrained tracking features, visual descriptors, and explicit trajectory geometry. These representations are grouped into a variable number of rigid-part hypotheses and subsequently used to recover directed kinematic relations, joint types, and joint geometry through rotation-equivariant learned–analytic reasoning. On the aligned 20-object PartNet-Mobility suite, Track2Art achieves 0.695 Point IoU and 0.410 end-to-end J@20, while requiring neither ground-truth part counts nor test-time optimization.
[CV-66] SGDet3D: Geometry-Grounded Semantics for 4D Radar and Camera 3D Object Detection
链接: https://arxiv.org/abs/2609.27671
作者: Xiaokai Bai,Zhenyu Fan,Lianqing Zheng,Songkai Wang,Si-Yuan Cao,Hui-liang Shen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 9 pages, 7 table, 5 figures
Abstract:4D radar complements dense image semantics with long-range geometry and radial motion, but existing radar–camera detectors largely solve \emphwhere to align the modalities while leaving \emphwhether a piece of evidence supports an evolving object hypothesis implicit. An image token may describe an occluder, a nearby radar return may belong to another object, and a pose-aligned memory slot may carry incompatible motion. We formulate \emphhypothesis-conditioned evidence grounding, which separates candidate access from evidence use: semantic, geometric, or temporal evidence is filtered or conditioned by the evolving 3D state before updating the corresponding query. \sgdetpp instantiates this principle through Anchor-Grounded Semantic Retrieval (AGR), which conditions deformable image retrieval on pooled anchor-consistent radar support; Geometry-Consistent Anchor Refinement (GCR), which attentively aggregates individual associated returns; and Doppler-Verified Correspondence (DVC), which replaces history only when current radial motion contradicts it. \sgdetpp improves the strongest compared method by 3.82 mAP and 6.82 ODS on OmniHD-Scenes and by 6.82 mAP and 9.22 NDS on ManTruckScenes, while also leading the listed methods in the TJ4DRadSet test comparison. Mechanism-targeted evaluations show that AGR improves strict AP in every projected-occlusion bin, the yaw-aligned box gate raises target-return purity from 29.95% to 58.87%, and DVC preserves 96.11% of motion-consistent history while retaining 75.90% contradiction recall. Code will be released.
[CV-67] InGuard: Towards Generalized Inner Guardrail for Safe Text-to-Image Generation
链接: https://arxiv.org/abs/2609.27620
作者: Zeyu Wang,Xiaodan Li,Zhiwen Li,Yuefeng Chen,Hui Xue
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Modern text-to-image (T2I) models generate high-quality images from arbitrary user prompts, yet they can just as easily produce not-safe-for-work (NSFW) content. Conventional outer guardrails consist of two components: a prompt classifier that checks for risk before generation, and a post-hoc image classifier that checks the fully generated image. In this design, both classifiers operate outside the generation pipeline and do not use the model’s own representations. This separation can limit prompt-screening accuracy, while the image-side check runs only after the full generation cost has been spent. Moreover, a flagged prompt can only be rejected, even when it could be adjusted to produce a safe image. In this work, we propose the Inner Guardrail (InGuard), a safety framework that works inside the pipeline on the model’s own representations, leaving base-model parameters untouched. First, a risk classifier grades each prompt as unsafe, risky, or benign based on the text encoder’s embeddings, with no external language model. Second, SAGE (Soft-gated Asymmetric Guardrail for Embeddings) modifies the embeddings of risky prompts, aiming to return a safe image instead of a refusal. Third, a latent detector checks the one-step clean latent estimate midway through denoising, reaching nearly image-level performance and halting generation when risk is detected. We also construct the RevGen Safety Benchmark to evaluate T2I safety under realistic conditions: 10,000 prompts built through real-image reverse generation, with a rewriting step that supplies controlled intellectual-property (IP) characters, covering graded porn/gore risks, categorical IP risks, and benign negatives. Across five open-weight T2I models, InGuard reaches 97.9-98.8% safety rate, matching or exceeding the outer guardrail, with 57.5-73.5% less benign disturbance, ~3.7x fewer parameters, and 50-55.6% of denoising steps skipped.
[CV-68] A generalizable structural brain MRI foundation model built through dual-priority federated pretraining
链接: https://arxiv.org/abs/2609.27611
作者: Zhen Yu,Yang Liu,Xiahai Zhuang,Qingchao Chen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Foundation models hold promise for generalizable analysis of structural brain magnetic resonance imaging (MRI) across development, aging and disease. However, existing models are typically built through centralized pretraining on pooled data, despite privacy and governance constraints. Such pooling optimization can overemphasize cohort size and overlook complementary information from smaller, specialized cohorts. Here we present BrainFedFM, a structural brain MRI foundation model federatively pretrained on 164,707 three-dimensional scans drawn from diverse real-world data distributions and organized across 42 federated sites. BrainFedFM uses dual-priority federated pretraining, coupling spatial-priority masking at each site with site-priority aggregation at the server to emphasize informative anatomical regions locally and prioritize site contributions globally. Across 20 downstream datasets spanning 17 classification, regression and segmentation tasks, BrainFedFM achieved the state-of-the-art performance (mean rank 1.68, 50% gain) across seven models, including four centralized foundation models, while showing particularly consistent advantages in classification and regression and robustness across underrepresented populations. These findings demonstrate the generalizability of BrainFedFM and highlight federated pretraining as a practical strategy for developing neuroimaging foundation models from distributed data without pooling raw images.
[CV-69] ICM: Intra-class Mixing for Domain Adaptation in Adverse Weather
链接: https://arxiv.org/abs/2609.27533
作者: Boying Li,Chang Liu,Britta Ayano Wilde,György Kovács,Tosin Adewumi,Björn Backe,Hamam Mokayed
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Unsupervised domain adaptation (UDA) for semantic segmentation remains challenging under adverse weather conditions because severe appearance changes enlarge the domain gap and degrade the reliability of pseudo labels in the target domain. To address this problem, we propose an Intra-Class Mixing Consistency (ICM) framework that enforces prediction consistency between an intra-class mixed image and its original counterpart. Unlike previous mixing-based consistency methods that combine regions across different images or domains and may introduce unrealistic semantic inconsistencies, ICM performs mixing within the same image and semantic class, preserving realistic semantic layout for consistency regularization. With ICM, we establish a new state-of-the-art performance for clear-to-adverse-weather unsupervised domain adaptation (UDA) in semantic segmentation. On the Cityscapes \rightarrow ACDC benchmark, our method achieves 75.7% mIoU, outperforming the previous state of the art by +1.9 pp, demonstrating its effectiveness in mitigating class confusion under challenging environmental conditions. The code is provided in the supplementary material.
[CV-70] M3D-Net: Hierarchical Coordination of Spatial Context Feature Reuse and Differential Attention for Mammography Classification ICASSP2027
链接: https://arxiv.org/abs/2609.27523
作者: Zheng Yu,Xinhang Li,Jiabao Gao,Boyang Wang,Xiang Li
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Submitted to IEEE ICASSP 2027; 5 pages, 4 figures
Abstract:Breast image classification requires local detail and global tissue context, yet these cues can weaken as representations deepen. We present M3D-Net, a mammography encoder that hierarchically coordinates multi-scale coordinate attention, bounded dynamic feature reuse, and differential attention through resolution-aware operator placement. Within-stage retrieval preserves access to earlier features, coordinate-aware aggregation integrates local and global context, and differential attention operates at coarse resolutions. We evaluate image-only classification on AISSLab mammography and an adapted image–clinical model on BrEaST ultrasound. Against EdgeNeXt, RepViT, and TransXNet, the proposed implementations achieve the highest recorded validation accuracy and late-training accuracy, with the lowest endpoint cross-entropy loss. Validation accuracies reach 97.78% and 80.39%, respectively. These results support further evaluation of hierarchical coordination across breast imaging settings; repeated-seed, component-controlled, and independent evaluations remain necessary.
[CV-71] NV-Reason -CT: 3D Visual Language Model for CT Analysis
链接: https://arxiv.org/abs/2609.27511
作者: Andriy Myronenko,Dong Yang,Yucheng Tang,Baris Turkbey,Benjamin Simon,Stephanie Harmon,Rikhil Makwana,Mariam Aboian,Sena Azamat,Ibrahim Ethem Hamamci,Sezgin Er,Bjoern Menze,Marc Edgar,Yufan He,Pengfei Guo,Daguang Xu
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:We present NV-Reason-CT, a generative vision–language model for chest and abdominal CT combining native 3D visual encoding with radiologist-guided reasoning. The model couples a native 3D vision transformer with a language model, passing all visual tokens and their explicit 3D coordinates into language decoding without further spatial token merging. This retains volumetric spatial information within the vision encoder and through the language model’s positional encoding during joint processing with text. We train on a curated corpus of approximately 550,000 multimodal instruction examples from 70,111 unique CT image inputs, combining standardized reports, abnormality-focused and anatomy-specific questions, multi-turn interactions, and radiologist-authored reasoning from recorded and transcribed expert CT interpretations. Expert annotations provide direct supervision and guide additional report-grounded synthetic reasoning. End-to-end supervised fine-tuning (SFT) is followed by Group Relative Policy Optimization (GRPO), with verifiable rewards over chest and abdominal abnormality sets. The model supports abnormality classification, report generation, and interactive reasoning with reviewable observations, differential diagnoses, and uncertainty. Evaluation spans public CT benchmarks and a held-out NIH cohort. On CT-RATE, NV-Reason-CT achieves a macro-F1 of 0.614 and macro-AUROC of 0.871 without a task-specific classification head; generated reports achieve a report-derived macro-F1 of 0.592. In a preliminary study with expert radiologists, AI-assisted review received favorable confidence ratings and was associated with a 50% reduction in average reported interpretation and reporting time. We release the model and training code to support reproducible research on explainable AI for volumetric medical imaging. Subjects: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI) Cite as: arXiv:2609.27511 [cs.CV] (or arXiv:2609.27511v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2609.27511 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-72] Know-Your-Scene (KYS)-SLAM: Hierarchical Semantic-Motion Priors for Feature Matching in Stereo Visual SLAM
链接: https://arxiv.org/abs/2609.27509
作者: Preeti Chatterjee,Jin Lu,Jin Sun,Suchendra M. Bhandarkar
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: 16 pages, 9 figures, 12 tables; includes supplementary material
Abstract:Stereo visual SLAM systems built on local descriptors suffer from semantic ambiguity, instance-level confusion, and independently moving objects, each corrupting data association and accumulating as trajectory drift. Prevailing semantic and dynamic SLAM methods address this through binary feature rejection, sacrificing correspondence density for outlier suppression. We contend that contextual implausibility is better expressed as a graded quantity than an exclusion criterion. We present Know-Your-Scene (KYS)-SLAM, a modular extension of ORB-SLAM3 that supplants feature rejection with continuous correspondence modulation. The contribution is the reframing of contextual evidence as correspondence cost, applied within feature matching and leaving the geometric backend unmodified. Each keypoint is augmented with semantic, panoptic, and motion priors fused through a hierarchical compatibility formulation, in which semantic class and instance identity enforce structural plausibility while a zero-shot motion score down-weights features on independently moving objects. That score comes from a training-free module fitting a depth-aware ego-motion model to background optical flow and classifying panoptic segments via self-calibrating, coverage-aware thresholds, so only segments with sufficient motion evidence are penalized and static structure is left unpenalized. Penalizing correspondences rather than discarding them preserves the geometric support bundle adjustment depends on. Under one fixed configuration, no coefficient retuned per sequence or dataset, KYS-SLAM reduces per-sequence ATE RMSE by 17.4% on outdoor KITTI and 27.7% on indoor EuRoC across 21 stereo sequences with no regressions, and by 6.6% on dynamic subsets of KITTI Tracking and 17.8%, up to 31.2%, on Virtual KITTI 2 – cross-domain transfer across outdoor driving, indoor flight, and synthetic imagery under one set of constants.
[CV-73] Information Capacity of Generative Video Compression: Quantifying the Rate-Compute Exchange at Identical Quality
链接: https://arxiv.org/abs/2609.27493
作者: Cheng Yuan,Jiawei Shao,Xuelong Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Under the AI Flow framework, communication networks distribute intelligence across devices, edge servers, and clouds, and computation at the receiver becomes a resource that can substitute for transmitted bits. Generative video compression (GVC) embodies this exchange by sending compact tokens with ultra-low bitrate and letting a generative decoder synthesize the video, yet how much bandwidth savings a unit of decoder compute actually achieves has never been quantified. To fill this vacancy, we model reconstruction quality as a two-factor power law in data rate and decoder compute, which fits measured DISTS of two GVC decoders with a mean error below 3%, and define the information capacity (IC) as the negative logarithmic slope along an iso-quality contour, namely the fraction of rate saved per fractional increase in compute at identical quality. IC is dimensionless and unit-invariant, thus enabling an architecture-agnostic comparison. It forms a field over the operating plane, locating where additional denoising steps are worth their cost. Across five datasets, the 14B decoder trades more compute for fewer rate about ten times more efficiently than the 1.3B decoder. IC also varies significantly across datasets, indicating imbalanced performance on the rate-compute trade-off in GVC methods.
[CV-74] CereVLA: Cerebellum-Inspired Consequence-Aware Residual Governance for Efficient Vision-Language-Action Execution
链接: https://arxiv.org/abs/2609.27468
作者: Shuai Zeng,Yuxuan Liang,Hangmiao Hu,Fobao Zhou,Zixiang Wang,Wenxi Hong,Hang Zhao
类目: Computer Vision and Pattern Recognition (cs.CV); Systems and Control (eess.SY)
备注: 8 pages, 5 figures
Abstract:Action-chunked vision-language-action (VLA) policies improve inference efficiency, but limited feedback within committed action chunks can lead to accumulated execution errors. Residual adaptation can correct such deviations without retraining the VLA; however, existing corrections are typically optimized for reference-action consistency without explicitly considering their downstream consequences. To address this limitation, we present Cerebellum-Inspired Consequence-Aware Residual Governance (CereVLA), a unified framework that integrates lightweight residual refinement and predictive consequence evaluation into frozen VLA execution. Corrective actions are first generated by flow-based residual refinement, and their short- and interval-horizon consequences are then evaluated by a recurrent state-space model and a history-aware classifier. Residual corrections predicted to be unfavorable are selectively suppressed by a lightweight governor. Comparisons with state-of-the-art methods on LIBERO-10 and LIBERO-GOAL demonstrate the effectiveness of CereVLA. On SO-101, CereVLA increases task success from 57.5% to 90.0% and reduces mean control steps by 19.6% among successful trials, relative to the frozen SmolVLA baseline.
[CV-75] Hybrid Gaussians for Robust Open-Vocabulary 3D Segmentation with Multi-View Object Association and Boundary Refinement
链接: https://arxiv.org/abs/2609.27462
作者: Xueqi Qiu,Yueming Sun,Tianyu Zhang,Yuxuan Xia,Yang Long
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Open-vocabulary 3D segmentation localizes objects from free-form text queries, but remains challenging in real image sequences: incomplete or noisy 2D supervision destabilizes multi-view identity assignment, while full-scene semantic learning weakens object-level discriminability. We introduce Hybrid Gaussians, a unified 3D representation jointly modeling object association and language-aligned semantics. Its Multi-View Object Association mechanism combines Observation Fusion and Semantic Contrastive Learning to improve identity consistency and semantic discrimination. Boundary Reconstruction Optimization further refines local boundary structure to improve contour quality. Experiments on LERF and 3D-OVS demonstrate strong quantitative and qualitative performance. Our method achieves 59.1% mIoU on LERF, yielding a 13.4% relative gain over the baseline. Project page: this https URL.
[CV-76] Invisible in Space Visible in Time: Motion Vision CAPTCHA against GUI Agents
链接: https://arxiv.org/abs/2609.27461
作者: Zeyu Zhang,Dingyi Rong,Zijian Chen,Zicheng Zhang,Xiongkuo Min,Guangtao Zhai
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at ACM Multimedia 2026. 10 pages, 5 figures
Abstract:Most existing visual CAPTCHAs remain spatially solvable: the required information is exposed by static appearance, local structure, and interface state. This assumption is weakened by advances in multimodal large language models (MLLMs) and Graphical User Interface (GUI) agents, which exhibit strong visual perception, reasoning, and browser interaction capabilities. We propose Motion Vision CAPTCHA (MVCAP), a hierarchical motion-based CAPTCHA framework in which target semantics are instantiated as motion-defined foreground structures and become recoverable only through temporal segregation from a dynamically evolving background. Built on this shared principle, MVCAP is instantiated in three perceptually progressive levels: coherent motion, structural motion, and biological motion. To evaluate this framework, we introduce MVCAP-Bench, a browser-based benchmark with 600 live CAPTCHA instances, together with a matched foreground-only control benchmark, MVCAP-Bench-FG. We evaluate humans, Browser Use agents, native computer use agents, and a supplementary offline VQA setting derived from the same instances. Results reveal a substantial human–agent gap: on the full MVCAP-Bench, human accuracy reaches 99.6%, whereas the best GUI agent achieves only 16.8%, close to the six-way chance level. The foreground-only control further shows that the key difficulty comes from dynamic background camouflage rather than answer format or browser interaction alone. These findings identify a measurable human–agent perception gap and position MVCAP-Bench as a benchmark for studying motion-defined perception in current agents.
[CV-77] Beyond Balanced Accuracy: A Resolution and Parity-Controlled Benchmark for Vision-Language and Vision-Only Defect Assessment in UAV Power-Line Inspection
链接: https://arxiv.org/abs/2609.27457
作者: Linghao Zhang,Siyu Xiang,Junwei Kuang,Peiyu Yi
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 46 pages, 8 figures
Abstract:Vision-language models (VLMs) are often reported to outperform task-specific vision backbones for unmanned aerial vehicle (UAV) power-line defect assessment. We test that claim on ElecVQA-Bench, a 56,972-item benchmark derived from the public InsPLAD dataset, across six evaluation choices: partition, evaluated item set, label space, replication, input resolution, and side information. On a matched partition, a Swin Transformer and the strongest adapted VLM differ by only 0.03 points at binary screening. At seven-way defect typing, increasing the vision backbones from 224 px to the measured pixel budget of the VLM preprocessor narrows the gap against InternVL3.5-8B from +20.53 to -0.57 points for ResNet-50 and from +23.67 to +4.70 points for Swin-T. A pixel-budget audit shifts Qwen3-VL-8B macro recall by 10.78 points, yet a source-pixel-matched InternVL control still leaves Qwen ahead by 7.43 to 13.61 points while using 56% fewer visual tokens, so neither source pixels nor token budget explains the difference between the two VLMs. A two-seed global replication changes Qwen binary accuracy and seven-way macro recall by 0.86 and 1.02 points. After split-specific retraining, Qwen does not lead at crop or image level, and a 14-tower, three-seed replication reverses the sign across seeds, giving mean common-six macro recall of 0.9085 for Qwen against 0.9509 for ResNet-50. No split regime yields a family-level advantage that survives multiple-comparison correction. The study supports a benchmark-audit contribution rather than a general claim of VLM superiority.
[CV-78] Latent evolving World Action Model
链接: https://arxiv.org/abs/2609.27455
作者: Xueji Fang,Boqiang Duan,Hua Wu,Jingdong Wang,Guo-Jun Qi
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: this https URL
Abstract:World Action Models (WAMs) jointly model action generation and environment dynamics and are mostly built on pretrained Video Diffusion Models (VDMs). In VDM-based WAMs, observations are first encoded by a VAE, and the resulting compressed latents are then processed by large video diffusion backbones to extract effective features for action generation. However, this paradigm ties WAM performance and training cost to large-scale video generation pretraining, limiting WAM efficiency and scalability. In this paper, we theoretically and empirically investigate how visual representations affect action generation in WAMs. Our results show that predictive embeddings from Joint-Embedding Predictive Architecture (JEPA) encoders better support action generation than compressed VAE latents, with I-JEPA performing best in our encoder comparison. Based on these findings, we propose LeWAM, which conditions action generation on JEPA embeddings and models environment evolution by predicting future embeddings in the same space, without relying on a video diffusion backbone. We further find that imitation learning matches demonstrated actions but does not distinguish better actions from worse ones, even though small action deviations can greatly affect task success. To address this limitation without additional environment interaction or the human oversight required for resets and safety, we introduce Demonstration-Guided DPO (DemoDPO), an offline preference refinement stage that derives preference supervision directly from this http URL only 0.4B trainable parameters, LeWAM achieves an average success rate of 92.28% on RoboTwin 2.0, comparable to that of state-of-the-art VLAs and WAMs, and maintains practical effectiveness on real-world manipulation tasks.
[CV-79] SatUnreal: A High-Precision Synthetic Dataset for Satellite Stereo Matching via Unreal Engine CVPR2026 ATC CVPR
链接: https://arxiv.org/abs/2609.27442
作者: Han-Gyeol Kim,JaeWan Park,Junmin Park,Darongsae Kwon
类目: Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
备注: Accepted at CVPR 2026 Workshop on EarthVision (CVPRW 2026), pp. 7990-7999. Code and dataset: this https URL Supplementary material: this https URL
Abstract:3D reconstruction from satellite imagery is essential for large-scale topographic analysis, yet the lack of high-fidelity training datasets with accurate occlusion labels remains a primary bottleneck. Existing benchmarks, such as US3D and WHU-Stereo, face inherent challenges in spatio-temporal mismatch – environmental changes and shadow displacements between multi-view acquisitions – and provide ambiguous ground truth in occluded regions due to LiDAR sparsity. In this paper, we propose SatUnreal, a high-precision synthetic dataset designed to fundamentally overcome these limitations through an Unreal Engine-based simulation pipeline. SatUnreal provides 10,000 stereo pairs with high resolution (0.3m GSD) and is characterized by: (1) Physical Geometry Simulation, replicating realistic satellite orbits by systematically varying baselines and azimuths; (2) Spatio-temporal Consistency, eliminating temporal noise through fixed virtual environments; (3) Topographic Diversity, spanning dense urban canyons to low-texture natural terrains; and (4) Mathematical Label Integrity, utilizing a novel two-step linetrace algorithm to generate flawless occlusion masks. Experimental results using SOTA iterative models demonstrate that models trained exclusively on SatUnreal achieve superior zero-shot transfer performance on real-world benchmarks (US3D, WHU-Stereo) compared to those trained on real datasets. Our findings prove that physically accurate synthetic data provides a more effective supervisory signal for learning geometric features than complex real-world observations, establishing a new paradigm for Sim-to-Real transfer in Earth Observation. Code and dataset are available at this https URL Comments: Accepted at CVPR 2026 Workshop on EarthVision (CVPRW 2026), pp. 7990-7999. Code and dataset: this https URL Supplementary material: this https URL Subjects: Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV) Cite as: arXiv:2609.27442 [cs.CV] (or arXiv:2609.27442v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2609.27442 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Journalreference: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) Workshops, 2026, pp. 7990-7999
[CV-80] Overlapping Visual Grouping Without Semantic Priors
链接: https://arxiv.org/abs/2609.27423
作者: Teemu Saukkio,Hashem Haghbayan,Juha Plosila
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 39 pages, 13 figures
Abstract:Most computer-vision systems organize visual input toward a predefined interpretation, such as semantic categories, prompted regions, learned object-like representations, or a single spatial partition. This work considers an earlier stage of visual organization: the formation of candidate perceptual units directly from sensor measurements before their identity, meaning, or task relevance is known. We introduce Domain Parent Grouping (DPG), a sensor-grounded grouping method in which complementary measurement relationships are represented in separate processing domains. Spatially connected groups formed within these domains are related through cross-domain overlap, yielding a non-exclusive grouping representation rather than a single mutually exclusive segmentation. This representation retains broader and more localized groups, as well as alternative grouping boundaries over the same image locations, simultaneously available. DPG also includes a native mechanism for reprocessing selected group content, in which input-relative measurement ranges allow the observational resolution to change while preserving previously formed groups. DPG is implemented using three domains representing locally contextualized luminance, direct chromatic relationships, and contextual chromatic relationships. Experiments on the BSDS500 dataset demonstrate the benefit of combining the three domains. The results further show that DPG forms measurement-supported groups corresponding to low-level image structure, and that these groups exhibit measurable correspondence with human-annotated regions and boundaries. This demonstrates that structured visual organization can emerge directly from relationships among sensor measurements.
[CV-81] S2A:Semantic-to-Spatial Alignment for Alignment-Free RGB-T Salient Object Detection
链接: https://arxiv.org/abs/2609.27413
作者: Qiangqiang Zhou,Yang Luo,Yong Chen,Jiawei Xu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Alignment-free RGB-T salient object detection (RGB-T SOD) aims to identify salient objects from unregistered RGB and thermal image pairs without costly pre-alignment. However, spatial misalignment breaks pixel-wise correspondence and causes feature contamination during cross-modal fusion. To address this issue, we propose S2A, a semantic-to-spatial alignment framework for alignment-free RGB-T SOD. Specifically, a global-guided hierarchical fusion module (GGHF) first exploits global semantic guidance to suppress background interference and refine hierarchical intra-modal features. Subsequently, the alignment-free cross-modal channel attention module (AFCA) globally exchanges complementary semantic information through channel-wise interaction, effectively overcoming the interference caused by local spatial misalignments. Finally, a spatial deformable cross-attention module (SDCA) predicts adaptive sampling offsets to recover local cross-modal spatial correspondence. Through this semantic-to-spatial paradigm, S2A first enables reliable cross-modal semantic interaction and subsequently performs local spatial calibration, effectively reducing misalignment-induced feature contamination. Without bells and whistles, S2A achieves highly competitive performance on multiple public alignment-free RGB-T benchmarks, demonstrating its effectiveness in alleviating misalignment-induced feature contamination.
[CV-82] Automotive mmWave Spinning Radar Place Recognition with Spatially Gated Feature-Correlation Representation
链接: https://arxiv.org/abs/2609.27394
作者: Saimunur Rahman,Sagun Singh Shrestha,Abdelwahed Khamis,Peyman Moghadam
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at the 28th International Conference on Digital Image Computing: Techniques and Applications (DICTA 2026). 8 pages, 3 figures
Abstract:Automotive spinning FMCW radar provides dense, 360^\circ sensing and remains reliable under poor illumination and adverse weather, making it well-suited to autonomous navigation. Place recognition uses these observations to identify previously visited locations for re-localization and long-term navigation. However, heading changes appear as circular shifts in the polar radar representation, and conventional global aggregation can lose relationships among radar responses that are important for distinguishing similar places. We propose SGCA-Net, a spinning radar place recognition framework that combines rotation-robust feature extraction with Spatially Gated Correlation Aggregation (SGCA). SGCA learns spatial weights to reduce the influence of unstable and ambiguous radar regions, while aggregating pairwise correlations among local responses to preserve informative feature relationships. Experiments on the MulRan dataset show that SGCA-Net consistently outperforms SOTA methods across urban, campus, and open-road environments, while remaining robust to substantial heading variation. Evaluation on the HeRCULES dataset further demonstrates that SGCA-Net generalizes to unseen environments and radar sensors without fine-tuning.
[CV-83] Geometry-Conditioned Visual Place Recognition in Natural Environments
链接: https://arxiv.org/abs/2609.27370
作者: Walter Nedov,Saimunur Rahman,Kavindie Katuwandeniya,David Hall,Kaushik Roy,Peyman Moghadam
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注: Accepted at the 28th International Conference on Digital Image Computing: Techniques and Applications (DICTA 2026). 8 pages, 6 figures
Abstract:Visual Place Recognition (VPR) in natural environments remains challenging due to repetitive vegetation, sparse distinctive landmarks, and substantial appearance and viewpoint variation across traversals. While visual observations of the same place can change considerably, their underlying spatial structure is often more persistent. We exploit this complementary geometric consistency through Depth-Aware Distillation (DAD), which conditions the token representations of a pretrained Vision Foundation Model (VFM) on geometry inferred by a Geometric Foundation Model (GFM), without any depth sensor. Rather than treating geometry as an additional input modality, DAD projects image-aligned depth into the VFM token space and selectively modulates visual representations through channel-wise geometric conditioning. A two-stage teacher-guided learning strategy first anchors the geometry-conditioned representation to the pretrained appearance space, before refining it for place discrimination. Evaluated on the WildCross benchmark, DAD improves average inter-sequence Recall@1 from 61.41% to 66.37% and Recall@5 from 65.86% to 72.49% over a matched appearance-only baseline, with the largest gains under reverse traversal and long-term appearance variation. These results show that GFM-derived geometry can provide a persistent structural prior for VPR when visual appearance becomes unreliable.
[CV-84] Beyond Mean Foils: Auditing Worst-Foil Specificity in Frozen CLIP Region Explanations
链接: https://arxiv.org/abs/2609.27356
作者: Kaixin Liu,Zhipeng Ye,Feng Jiang,Zhenghao Wang,Qihang Wu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 5 pages, 2 figures, 6 tables
Abstract:A region can overlap a target object yet contribute more to another class. We test regions selected by Cluster-based Concept Importance (CCI) in frozen CLIP. Across COCO and VOC with two checkpoints, 41.08-64.78% of regions that pass overlap and mean-contrast checks fail against the strongest competing class. Removing competitors annotated in the image leaves 39.69-63.64% failing. We then test all eight candidate regions per image. An alternative passes the test for 6.25-7.84% of failures on COCO and 27.40-31.15% on VOC. Requiring it to preserve the original target-score drop within \epsilon = 0.02 reduces these rates to 0.16-0.98%. Available regions and target-drop tolerance constrain repair; relaxing the tolerance increases repair opportunities.
[CV-85] Breaking Weather-Content Coupling: Type-Severity Guided Progressive Disentanglement for All-in-One Infrared Restoration
链接: https://arxiv.org/abs/2609.27317
作者: Xinyao Wang,Lijun He,Zhihan Ren,Fan Li
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Infrared (IR) imaging is crucial for autonomous driving, remote sensing, and other perception tasks. However, adverse weather may introduce fake structural responses that are entangled with real thermal structures. Existing IR restoration methods are typically designed for a single degradation type or directly reconstruct from degradation-entangled representations. Consequently, they struggle to distinguish intrinsic thermal structures from weather-induced fake responses and to accommodate spatially varying degradation severity, leading to artifacts or the over-suppression of weak but meaningful thermal responses. To address these issues, we propose TSGPD-IR, a type-severity guided progressive disentanglement network for all-in-one infrared restoration that factorizes restoration guidance into task-level weather semantics and region-level degradation severity. Specifically, a Weather and Semantic Co-Guided Multi-Level Prompt Generation Module combines global weather semantics with stage-wise local features to generate adaptive prompts that progressively suppress degradation-induced responses while preserving intrinsic thermal structures. To complement global weather semantics with spatial restoration control, a Proxy-Supervised Regional Degradation Estimator derives severity supervision without manual annotations and predicts spatially varying degradation priors. Guided by these cues, a Multi-Source Collaborative Expert Selection Strategy uses a shared branch to preserve weather-invariant thermal structures and hierarchical routing to select weather-specific expert pools and severity-compatible regional experts. This design progressively separates degradation interference from genuine thermal content and enables region-adaptive restoration, reducing both residual artifacts and over-suppression.
[CV-86] High Dynamic Range Video Reconstruction from Single-Exposure Raw Sequences
链接: https://arxiv.org/abs/2609.27274
作者: Tao Zhang,Peixian Su,Xingyu Gao,Yunhao Zou,Yu Lu,Zunjie Zhu,Bolun Zheng,Ying Fu,Chenggang Yan
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 12 pages. Code: this https URL
Abstract:Due to the limited dynamic range of conventional image sensors, captured low dynamic range (LDR) video often suffers from highlight clipping and shadow detail loss, making high-quality high dynamic range (HDR) reconstruction from single-exposure sequences highly challenging without alternating exposures or extra hardware. Alternating-exposure HDR methods sacrifice frame rate and struggle with motion alignment, making them impractical for real-world capture. To address this, we propose RawHDRV, an end-to-end framework for single-exposure Raw video HDR reconstruction, that fundamentally exploits the linear response and channel-specific characteristics of Bayer data. Specifically, it features a channel-decomposition temporal alignment and fusion strategy that processes Bayer channels separately to exploit their distinct exposure characteristics, together with exposure-aware weighted fusion. It further incorporates an exposure complementarity mask-guided restoration module that leverages inter-frame exposure redundancy to adaptively fuse reliable information and suppress saturation artifacts, and introduces a mask-guided color loss that combines normalized error constraints with gradient smoothing to enhance highlight recovery. Furthermore, we construct a large-scale mobile Raw-HDR video dataset with per-frame HDR annotations. Experiments show that our method achieves the state-of-the-art results in all metrics, demonstrating superior spatial quality and temporal stability under extreme exposure conditions. The code is available at this https URL.
[CV-87] GaussPDE: Graph-Based Partial Differential Equation-Driven Rendering for 3D Gaussian Splatting
链接: https://arxiv.org/abs/2609.27264
作者: Haoyuan Yue,Fengyuan Ye,Ziyin Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:We present GaussPDE, a framework that injects physically structured partial differential equation (PDE) dynamics into pretrained 3D Gaussian scenes without mesh extraction, voxelization, or retraining. Our key observation is that PDE rendering requires not only accurate appearance, but also a reliable discrete computational domain. We therefore first introduce camera-aware regularization during 3DGS reconstruction to suppress camera-near floaters and oversized primitives that would create unstable graph topology. We then construct an active Gaussian graph using covariance-aware distances and opacity, appearance, and boundary-aware conductance, enabling mass-weighted graph Laplacian PDE evolution directly over Gaussian primitives. The evolving scalar PDE state is coupled back to rendering by modifying the direct-current spherical harmonic color coefficients while preserving geometry, opacity, and view-dependent rendering behavior. Experiments on real and synthetic scenes show that GaussPDE produces stable, controllable, and spatially coherent dynamic visualizations, with reduced cross-boundary leakage compared with baselines.
[CV-88] What Converges in the Platonic Representation Hypothesis? Structure over Geometry
链接: https://arxiv.org/abs/2609.27252
作者: Junwon You,Mihyun Jang,Sangwoo Mo,Jae-Hun Jung
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV); Algebraic Topology (math.AT)
备注: 33 pages, 12 figures, 6 tables
Abstract:The Platonic Representation Hypothesis suggests that increasingly capable models converge toward shared representations. Recent work narrows this claim to shared local neighborhood relationships, finding that capacity-dependent trends in several global similarity measures largely disappear after calibration. We challenge this interpretation by showing that prior local-global comparisons confound structural scale (local versus global) with what is compared: relational structure, defined by which samples are related, versus metric geometry, characterized by quantitative relations such as distances, similarities, or correlations. To disentangle these factors, we construct a controlled 2\times2 framework that evaluates both relational structure and metric geometry at local and global scales. We introduce H_0 skeleton overlap as a global counterpart to mutual k -nearest neighbors, together with matched distance-aware variants. Across vision-language models, relational structure exhibits robust representational convergence at both scales after calibration, whereas increasingly stringent distance agreement substantially weakens alignment and progressively flattens the capacity-dependent trend. We further extend the analysis beyond ambient Euclidean geometry by evaluating distance agreement under a Riemannian metric approximation and recover the same structure-geometry pattern. The pattern is also reproduced in video-text representations. Together, these results show that relational convergence extends beyond local neighborhoods to global spanning structure, whereas metric geometry exhibits substantially weaker convergence.
[CV-89] Strip Convolution and Direction-Aware Exclusion Loss for Oriented Ship Detection
链接: https://arxiv.org/abs/2609.27238
作者: Bin Chen,Yuanyuan Liu,Peng Yang,Chao Lu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 5 pages, 6 figures. Submitted to IEEE Geoscience and Remote Sensing Letters
Abstract:Oriented ship detection in very high resolution (VHR) remote sensing imagery remains challenging due to elongated hull geometry and dense target distributions in complex port scenes. Existing methods typically address geometric representation and duplicate suppression separately. To jointly tackle these issues, we propose an oriented ship detector with two complementary components. The C3k2_Strip module employs orthogonal strip convolutions to better capture elongated hull structures, while the Class-Aware Direction-Aware Exclusion Loss (CA-DAEL) suppresses redundant predictions using class, direction, and confidence cues. Experiments on HRSC2016 and DIOR-R achieve 78.45% and 53.71% mAP50:95, respectively, with only 2.91M parameters. On HRSC2016, the proposed method improves mAP50:95 by 6.32 percentage points over the YOLOv11-OBB baseline, demonstrating its effectiveness for accurate oriented ship detection.
[CV-90] Surgical Kinematics from Monocular Video with Learned Articulated Motion Constraints
链接: https://arxiv.org/abs/2609.27227
作者: Mehmet Kerem Turkcan,Soham Samal,Zoran Kostic
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:Objective assessment of robotic surgery uses instrument kinematics, which must be reconstructed when only video is available. We introduce a kinematic reconstruction network for estimating instrument position, orientation and jaw angle from monocular video. Our visual representation combines global attention pooling of frozen DINOv3 features with local pooling at instrument landmarks from fine-tuned SAM 3.1 masks. Our shared Transformer encoder and temporal convolutional heads integrate this representation with mask geometry, monocular depth and visual state estimates from arm-specific multilayer regression networks. Our position branch predicts displacement magnitude and direction separately to preserve traveled distance. We fit trajectories to predicted state observations and motion increments by differentiable weighted least squares, expressing quaternion observations relative to cumulative predicted rotations to obtain a quadratic orientation objective. We evaluate reconstruction across 2,802 Open-H episodes. Compared with LiveMAE on the main Open-H benchmark, our method reduces path-length mean absolute error from 0.45 to 0.34,cm and increases temporal mean average precision for motion segmentation from 44.54% to 54.44%.
[CV-91] Physiologically Informed Digital Auscultation for Pneumonia Detection in Long-term Care Residents
链接: https://arxiv.org/abs/2609.27222
作者: Nicholas Rasmussen,Oleg Zaslavsky,Zih-Ling Wang,Hongyu Yu,Joelle Fathi,Kaibao Nie,Amil Khanzada,Tomoko Ito
类目: ound (cs.SD); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Audio and Speech Processing (eess.AS); Tissues and Organs (q-bio.TO)
备注: Manuscript has been submitted to NPJ Digital Medicine
Abstract:Pneumonia is difficult to diagnose in older long-term care residents; multimorbidity and atypical presentations obscure signs, motivating operationally efficient objective testing. We analyzed multi-channel digital stethoscope recordings from 185 Japanese residents (73 pneumonia, 112 symptomatic without), using radiologist-confirmed chest X-rays and clinician diagnoses as supervisory signals that train convolutional neural networks, multimodal fusion, and channel-based variants with time-domain Grad-CAM interpretability. Models were evaluated with repeated patient-level cross-validation showing models with X-ray supervision outperformed clinician supervision (F1 0.729, accuracy 0.783 vs. F1 0.637, accuracy 0.711). Additionally, a three-channel selection protocol maintained performance (F1 0.736; accuracy 0.803), with two mid-thoracic sites ranking highest and Grad-CAM attention overlapping adventitious sounds. These findings indicate automated multi-channel lung-sound analysis can aid long-term care pneumonia diagnosis, with X-ray supervision being more reliable than clinical, and fewer channels preserving performance while lowering acquisition times.
[CV-92] Learning Spectral Allocation: A Fractional Diffusion Framework for Adaptive Volumetric Segmentation
链接: https://arxiv.org/abs/2609.27217
作者: Yi-Hui Shen,Tie-Qiang Li
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:We address adaptive computation in 3D medical image segmentation: instead of designing another backbone, we ask how much spectral mixing each network stage needs and let optimization answer. We derive FHEAT, a two-parameter operator family, from the discrete cosine transform (DCT) solution of a fractional heat equation. A fractional order alpha and a diffusion strength D govern the operator, and at D=0 it is exactly the identity. Reparametrized by the semigroup time tau = D*alpha, same-resolution instances compose exactly, so any distribution of diffusion across same-resolution stages amounts to a single Sobolev-type regularizer of learned strength. This identity limit lets the optimizer of each layer, not the designer, decide whether global mixing is needed and how sharp it should be. We instantiate FHEAT in a lightweight U-shaped architecture (Light-UNETR) paired with a Kolmogorov-Arnold mixer (KAN3D) with adaptive rational activations, yielding FHEAT-Seg. At 5% to 20% label rates on three public benchmarks, training produces gradient-driven spectral sparsification: seven of the eight stage-level operators drive D to zero, and the survivor saturates at the sharpest low-pass (alpha ~ 0.9) in the decoder layer feeding the semi-supervised attention map. The retired layers become exact identity shortcuts at inference, cutting FLOPs from 4.29G to 0.90G (a 79% drop) at 0.975M parameters. Under a standard semi-supervised protocol, FHEAT-Seg reaches Dice scores of 90.47% (left atrium), 78.79% (Pancreas-CT), and 81.90% (BraTS 2019), ahead of five semi-supervised methods and the Light-UNETR baseline. The large variant also surpasses Light-UNETR-L under full supervision (Dice 93.09%, 85.11%, and 87.19%) with 2.851M parameters and 55.75G FLOPs. These results suggest that the allocation of spectral computation is a learnable property of optimization dynamics, not a manual design commitment.
[CV-93] Benchmarking Active Spot Selection for Cost-Efficient Spatial Transcriptomics
链接: https://arxiv.org/abs/2609.27208
作者: Zheyu Zhu,Junchao Zhu,Fengbei Liu,Tianyuan Yao,Gelei Xu,John Cannon,Haichun Yang,Yuankai Huo,Mert R. Sabuncu,Ruining Deng
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Other Quantitative Biology (q-bio.OT)
备注:
Abstract:Spatial transcriptomics (ST) measures gene expression in tissue context, but dense capture grids can be costly and may repeatedly sample morphologically similar regions. Most active learning strategies were developed for categorical labels and independent samples. We conduct a retrospective pool-based benchmark of active learning versus uniform Random sampling for ST, where expression vectors are high-dimensional and continuous and candidates are spatially correlated. Using two fully profiled public ST cohorts, we mask candidate expression vectors and simulate multi-round selection with uncertainty-based Monte Carlo dropout (MC-dropout) and temporal output discrepancy (TOD), and diversity-based CoreSet and TypiClust-inspired selection. We compare 160 completed configurations at 5%, 10%, 30%, and 50% of the fold-wide training spot pool under patient-level cross-validation, with a separate full-label reference. Within each budget, strategies share the selection schedule, morphology-to-expression predictor, and optimization protocol. We assess mean per-gene within-slide Pearson correlation coefficient (PCC), expression-cluster agreement, and Moran’s I fidelity. On HER2-positive breast cancer, pooled mean PCC differences from Random across the four active strategies were -0.0176, -0.0117, +0.0056, and +0.0057 at 5%, 10%, 30%, and 50%, respectively. On cutaneous squamous cell carcinoma (cSCC), three strategies were below Random at 5%, and all four were below Random at 10%. On HER2-positive breast cancer, CoreSet and MC-dropout had lower PCC but higher expression-cluster agreement than Random at the two smallest budgets; this pattern did not reproduce on cSCC. Under the reported fixed training horizons, the evaluated active strategies do not consistently improve on Random at small budgets, and rankings depend on the evaluation measure.
[CV-94] Diverse by Design: Architectural Constraints for Prototype-Based Interpretability CVPR2026
链接: https://arxiv.org/abs/2609.27194
作者: Xinmiao Lin,Matthew Wright
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to CVPR 2026 Trustworthy, Robust, Uncertainty-Aware, and Explainable Visual Intelligence and Beyond (TRUE-V) Workshop
Abstract:Prototype-based neural networks provide inherent interpretability through case-based reasoning, yet suffer from critical limitations: prototypes converge to redundant features, fail to capture diverse semantic parts, and lack quantitative interpretability assessment. We propose Diversity-Aware Prototype Learning (DAPL), which enforces prototype diversity through architectural constraints rather than explicit regularization. Our approach leverages multi-head self-attention with strict one-to-one attention-to-prototype mapping, ensuring each prototype specializes in distinct visual features. We further introduce foreground-aware training to focus prototypes on semantically meaningful regions and develop comprehensive evaluation metrics (Coverage and Diversity) for quantitative interpretability assessment. Experiments on CUB-200-2011 demonstrate substantial improvements: DAPL with foreground-aware training achieves 81.69% accuracy with 0.596 Coverage and 0.427 Diversity, providing the best overall balance across all evaluated prototype-based methods. Code is available at this https URL.
[CV-95] mporally Ordered Region-Token Mamba with Logit-Space Diffusion for Remote Sensing Change Detection WACV2027
链接: https://arxiv.org/abs/2609.27149
作者: Anuvab Sen,Maneet Chatterjee,Aparup Ghosh,Udayon Sen,Arnav Aditya,Yixin Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Submitted to WACV2027 Application Track
Abstract:Remote sensing change detection requires both global reasoning across bitemporal images and precise localization of changed regions. However, dense attention is computationally expensive for high-resolution imagery, while conventional feature fusion and coarse decoding may inadequately separate genuine changes from appearance variations or preserve object boundaries. We present Bitemporal Mamba-Diffusion for Change Detection (BMD-CD), which combines temporally structured state-space modeling with logit-space diffusion refinement. BMD-CD converts deep bitemporal features into region tokens and arranges them in explicit temporal partitions before bidirectional state-space propagation. Its Bitemporal Ordered Mamba Operator enables long-range cross-temporal interaction with linear sequence complexity, while Orthogonal Feature Disentanglement forms a change-oriented output and a complementary rotated output using learned pairwise rotations and unchanged-region consistency. Multiscale decoding then produces coarse change logits, which are refined through a five-step Conditional Diffusion Decoder operating directly in logit space. Experiments on LEVIR-CD, WHU-CD, DSIFN-CD, CDD, and S2Looking demonstrate strong performance across diverse change-detection settings. BMD-CD achieves F1 scores of 93.7%, 96.0%, 97.8%, and 99.0% on the four standard benchmarks and improves 3-pixel Boundary-F1 to 87.7% and 91.4% on LEVIR-CD and WHU-CD, respectively. The full model requires 32.09 GFLOPs and 47 ms per 256 x 256 image pair, while also showing zero-shot transfer to ValaisCD and B-FLAIR-test. Our code is available at this https URL
[CV-96] A Systematic Evaluation of Infrastructure-Based Radar System for Highway Traffic Monitoring ITSC2026
链接: https://arxiv.org/abs/2609.27143
作者: Tianheng Zhu,Woei-chyi Chang,Alamss Riaz,Sogand Hasanzadeh,Yiheng Feng
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted by IEEE ITSC 2026. Compared with the accepted version, this version includes an expanded trajectory tracking analysis with additional evaluation metrics
Abstract:Infrastructure-based radar systems offer robust and long-range solutions for traffic monitoring, yet their detection and tracking performance under real-world conditions remains insufficiently evaluated. This study introduces DRaT (Drone and Radar Trajectories), a dual-modality dataset of naturalistic vehicle trajectories collected at a highway merging segment in Fort Worth, Texas, to systematically assess radar sensing performance against drone-derived ground truth. The performance is evaluated at three levels: individual vehicle detection, trajectory tracking, and macroscopic traffic parameter estimation. For individual vehicle detection, the radar achieves an overall precision of 78% and a recall of 57%, with degraded performance under congested traffic conditions and at longer distances. At the trajectory level, the radar demonstrates reasonably strong tracking performance (IDF1 = 0.699), maintaining reliable vehicle identities when tracks are successfully established. For macroscopic traffic flow metrics, the radar accurately estimates space-mean speed (MAPE 4%) but underestimates density and volume by approximately 23% due to missed detections. The paper also discusses practical deployment considerations and potential downstream applications of roadside radar sensing systems. To support reproducible research on infrastructure-based sensing systems, we have open-sourced the DRaT dataset on Zenodo: this https URL.
[CV-97] MINER: Multi-crop INference-time Enhancement for Rare-Object Retrieval with Frozen Dual Encoders ACML2026
链接: https://arxiv.org/abs/2609.27142
作者: Abdulmalik Alquwayfili,Faisal AlMeshal,Jumanah Almajnouni,Huda Abdulhadi Alamri,Muhammad Kamran J Khan
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at ACML 2026 (PMLR). 29 pages, 10 figures
Abstract:Text-to-image retrieval with frozen dual encoders degrades when the query names a small, visually subordinate object in a cluttered scene: a single global image embedding underrepresents the localized visual evidence. We present MINER, a training-free inference framework that augments a frozen dual encoder’s global image embedding with a small bank of region-level embeddings and a hubness-correcting similarity rescoring, recovering visual evidence that global pooling underweights. To evaluate this setting, we introduce ROCS, a benchmark built from high-clutter subsets of Flickr30K and MS COCO whose images are re-captioned to name a single low-salience object. Experiments on CLIP, SigLIP, and SigLIP 2 show that MINER improves retrieval on every backbone, on ROCS and on the standard splits. Analyses show that these gains come primarily from broader spatial coverage rather than precise crop placement, revealing a simple and general way to recover localized evidence from frozen representations. Code: this https URL. Dataset: this https URL.
[CV-98] A Hierarchy-Aware Video-Language Model Evaluation and Hyperbolic Baseline for Surgery
链接: https://arxiv.org/abs/2609.27139
作者: Ana Manzano Rodríguez,Pascal Mettes,Marlies P. Schijven,Cees G. M. Snoek
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Surgical procedures follow a phase-to-step hierarchy, yet the video-language models used to recognize them are evaluated with flat per-level metrics that ignore cross-level coherence and error structure. In this paper we make two contributions to address this problem, (i) we introduce SurgHiBench, the first hierarchy-aware evaluation suite for surgical video understanding, with three tasks measuring recognition, consistency, and severity across granularity levels. We evaluate a general-purpose CLIP model, a Euclidean surgical model, and, as second contribution: (ii) HyperSurg, a new hyperbolic model that enforces phase-step containment via entailment cones, across four (existing) datasets spanning three procedure types. The suite reveals that two models with the same accuracy can produce predictions of very different error severity, ranging from sibling confusions within the correct phase to unrelated cross-phase predictions. Hyperbolic geometry shifts predictions toward the correct procedural neighborhood, and these gains scale with the tree-likeness of each dataset’s annotation hierarchy, providing a principled indicator when hierarchy-aware geometry helps.
[CV-99] Super-Resolution of Solar Magnetograms via Adaptive Stratified Ensemble Learning with Uncertainty Estimation
链接: https://arxiv.org/abs/2609.27131
作者: Sina Norouzi Kandalan,Haodi Jiang,Jason T. L. Wang,Qin Li
类目: Computer Vision and Pattern Recognition (cs.CV); Solar and Stellar Astrophysics (astro-ph.SR)
备注: 9 pages, 5 figures
Abstract:Single-image super-resolution of Sun’s photospheric magnetograms enables consistent analysis across heterogeneous space-based instruments and supports long-term studies of solar magnetic field evolution. We address the super-resolution task from SOHO/MDI (low-resolution) to SDO/HMI (high-resolution) line-of-sight (LOS) magnetograms using a modified RRDBNet architecture initialized by ESRGAN pretrained weights. Through systematic per-image diagnostic analysis, we identify image complexity as the dominant predictor of reconstruction errors. To exploit this finding, we introduce an adaptive stratified specialist ensemble (SSE) of three specialist networks with uncertainty estimation, where each specialist network is trained by images from three different complexity strata using a weighted random sampling strategy. During inference, a lightweight router based on input image statistics assigns each test image to the appropriate specialist network. Our experimental results demonstrate the good performance of the proposed ensemble and its superiority over closely related methods.
[CV-100] PEARL: A Lightweight Prompt-based Feature Interpreter Framework for Real-Time Anonymous and Heterogeneous Collaborative Perception
链接: https://arxiv.org/abs/2609.27123
作者: Armin Maleki,Hayder Radha
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 21 pages, 4 figures and 25 tables
Abstract:Heterogeneity across Collaborative Perception (CP) agents is a major challenge for emerging CP frameworks due to domain gaps from differing sensors, architectures, and training data. Prior works mitigate this challenge by aligning features in a unified space via model retraining or per-agent-type interpreters. These strategies (a) require access to neighbor configurations, (b) do not fully address real-time CP deployment, and © generalize poorly to unseen agents joining at run time. To overcome these challenges, we present PEARL, a Prompt-Embedding framework for Anonymous and Real-time Lightweight heterogeneous CP. PEARL supports multiple CP interpreters and selects one for a new-joining agent in real time using two lightweight, multi-scale interpreters trained in parallel: a sparse-detection (LWSD) interpreter that aligns salient regions for cooperative detection, and a dense, domain-invariant (LWDDI) interpreter that produces agent-invariant features for fast interpreter selection. Both interpreters use low-rank visual prompts to reduce computation, storage, and model complexity. Extensive experiments on simulated (OPV2V, V2XSet) and real (DAIR-V2X) datasets show that PEARL generalizes across simulated and real-world cooperative driving scenarios. Its real-time model-selection strategy yields an 8.2% Average Precision (AP) gain over a random-selection baseline while running in 1.67 ms on average. Although primarily designed for real-time CP, PEARL also outperforms state-of-the-art heterogeneous CP frameworks under traditional offline training by 5.6% AP on average while reducing communication cost by up to 34.7 times. Equally important, PEARL does not require sharing agents’ configurations or model settings, thereby protecting information that may be proprietary or private. These results establish PEARL as a scalable and practical framework for heterogeneous collaborative perception.
[CV-101] From greenhouse climate to individual leaves: an organ-resolved model of lettuce growth
链接: https://arxiv.org/abs/2609.27118
作者: Md Hasibur Rahman,Faraz Ahmed,Hafiz Muhammad Bilal,Daniel Wells,Dylan Tobin,Tanzeel U. Rehman
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注: 37 pages, 15 figures, 8 tables. Includes an appendix with supporting information
Abstract:Greenhouse climate management aims to improve crop production while limiting energy use. This requires knowing how a crop will respond before conditions are changed. A crop digital twin can support this decision only if it represents how plant physiology and structure develop together. A unified framework was developed to simulate lettuce growth from the physiology of individual leaves. Each leaf received the conditions at its position in the canopy and contributed carbon through photosynthesis. Part of this carbon was used for maintenance and the remainder supported growth, distributed among leaves by their age, size and local environment. The predicted leaf mass, area and age generated an evolving three-dimensional plant in NVIDIA Isaac Sim. Ray tracing calculated the radiation intercepted by each leaf and returned it to photosynthesis, so structure and growth influenced each other over time. Against greenhouse measurements, the relative root mean square error was 9.5% for total dry weight and 9.2%, 12.7% and 13.1% for leaf number, canopy diameter and largest-leaf area, respectively. A 30% decrease in incident radiation reduced final dry weight by 10.4%, while the same increase raised it by 6.9%, and adding 200 ppm carbon dioxide raised it by 46.1%. Within a simulated 40-plant block, interior plants accumulated 8.6% less dry weight than border plants with identical initial states, and the leaf-specific tipburn index rose in the enclosed leaves over the period in which tipburn appeared on the greenhouse plants. Resolving individual leaves therefore explains how local exposure changes plant growth within the greenhouse. The framework provides the forward plant model needed for a bidirectional digital twin, where observations of the physical plant can update predictions and support greenhouse climate decisions.
[CV-102] Damnatio Memoriae: Adversarially and Selectively Forgetting Identities in the Embedding Space of Face Recognition Models
链接: https://arxiv.org/abs/2609.27115
作者: Ünsal Öztürk,Vedrana Krivokuća Hahn,Sushil Bhattacharjee,Sébastien Marcel
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 15 pages, 7 figures, 5 tables. This work might be submitted to the IEEE for possible publication
Abstract:A face recognition model links two images of a person recorded on separate occasions when their embedding similarity exceeds an operating threshold. We consider making chosen identities unlinkable across separate occasions while the model remains in service for the rest of the population. Deleting their images and retraining does not achieve this, since the model recognises identities never observed in training. Therefore, the embedding space must be altered against these identities, the process of which we call open-set adversarial forgetting. We propose three loss functions, one that disperses an identity’s embeddings from their centroid, and two that map each image onto its own near-orthogonal target, learnt with the classifier head or fixed in advance as an almost-orthonormal frame. Each is fine-tuned alongside the classification objective on a subset of each identity’s images. We evaluate them against four methods from prior work in verification and identification, at two forget scales and three backbones. Every loss acting on the embedding geometry makes the forget identities nearly unidentifiable. The orthonormal frame alone achieves strong forgetting, which holds wherever an image of that subset enters the comparison and leaves distinct forget identities unlinkable. It also surpasses a concurrent unsupervised method at a higher retain rate.
[CV-103] Pose-Aware Multimodal Automatic Tagging for Greek Traditional Music
链接: https://arxiv.org/abs/2609.27094
作者: Alexandros Alexiou,Charilaos Papaioannou,Alexandros Potamianos
类目: ound (cs.SD); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Automatic tagging is a core task in Music Information Retrieval (MIR), yet most tagging systems exploit only audio. Live music performance is inherently multimodal, as semantic labels such as instruments, regional styles, and dance forms are encoded simultaneously across acoustic, visual, and embodied performance cues. This is especially true of culturally specific repertoires such as Greek traditional music, which remain underrepresented in MIR benchmarks. In this paper, we investigate whether the use of dancer pose provides complementary information for automatic tagging in Greek traditional music beyond audio. Using the Lyra dataset, we extend prior audio-only work by extracting aligned video features and pose-derived skeleton streams, enabling an experimental setting for multimodal auto-tagging. We further introduce an automated pipeline for extracting primary-dancer skeleton sequences from in-the-wild dance footage, combining dance-scene detection, multi-person tracking, dancer selection, pose estimation, and quality filtering. We compare unimodal, all bimodal combinations, and trimodal systems using multiple fusion strategies. Audio remains the strongest single modality (AST: macro ROC-AUC 0.821), while skeletons, though weak in isolation, enhance performance through multimodal fusion. The best trimodal system improves macro ROC-AUC by about 4 percentage points over the strongest audio baseline.
[CV-104] Pro-Bench: Prompt-Robust Open-Vocabulary Visual Grounding Across Real-World Heterogeneous Environments
链接: https://arxiv.org/abs/2609.27076
作者: Linus Nwankwo,Muslim Alaran,Christian Rauch,Stanley Chukwuebuka Obilikpa,Elmar Rueckert
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:Open-vocabulary visual grounding enables robots to localise task-relevant entities from natural-language queries without dependence on predefined perceptual taxonomies. However, existing benchmarks largely rely on short category labels and web-scraped imagery, leaving it unclear whether open-vocabulary models can robustly ground diverse queries and visual conditions under real deployments. We introduce \textbfPro-Bench, a prompt-conditioned benchmark for open-vocabulary visual grounding in heterogeneous, real-world environments. Pro-Bench includes 13k+ RGB frames from independent robotic domains (subterranean, industrial, indoor, outdoor, urban), with 74.5k manual instance annotations and 515 target queries covering categorical, attributive, relational, affordance, state, part-whole, negative, and compositional semantics. We benchmarked 16 open-vocabulary model configurations in strict zero-shot inference, measuring localisation accuracy across IoU thresholds, end-to-end inference latency, prompt-induced performance variation, and target recovery consistency. Our results show that prompt-robustness is strongly architecture-dependent. Most model configurations ( 10/16 ) perform best with short category labels, whereas free-form queries yield the highest accuracy for only one. Moreover, similar aggregate mAP can conceal substantial differences in consistent target recovery across reformulations. Pro-Bench enables systematic evaluation of these gaps and supports prompt-robust visual grounding. Pro-Bench: this https URL.
[CV-105] WTF?! Simulation-Free Reinforcement Learning with Wasserstein-Tilted Flow Maps
链接: https://arxiv.org/abs/2609.27033
作者: Abbas Mammadov,Jerry Y. Huang,Justin Lin,Partha Kaushik,Sheel Shah,Kartik Nair,Yee Whye Teh,Nicholas M. Boffi
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (stat.ML)
备注:
Abstract:Reward fine-tuning aims to update a pre-trained flow-based generative model to improve the downstream reward of its generated samples. Existing methods typically formulate this problem as sampling from a reward-tilted distribution, the solution to a KL-regularized reward-maximization problem. Here, we introduce an optimal transport regularizer built directly from the pre-trained drift. Unlike KL reward tilting, the resulting objective transports individual samples toward higher reward rather than reweighting the base distribution. We show that the resulting problem is equivalent to a deterministic optimal control problem on the flow. Given a pre-trained flow map, this equivalence yields a simulation-free reinforcement learning algorithm for fine-tuning generative flows. We call the resulting framework Wasserstein-Tilted Flow Maps (WTF), the first end-to-end fine-tuning recipe native to flow maps. The output is a fine-tuned flow map that retains strong reward-aligned performance at few-step inference budgets without post-hoc distillation. Experiments on ImageNet-256 and text-to-image show that WTF achieves higher reward with comparable or higher diversity than baselines, while requiring up to 280\times less training compute. More broadly, we argue that accelerated samplers such as flow maps are essential infrastructure for efficient post-training, and that the dominant KL-regularized formulation is only one of many choices worth revisiting.
[CV-106] Adversarial Attacks and Identity Leakage in De-Identification Systems: An Empirical Study
链接: https://arxiv.org/abs/2609.27022
作者: Felix Rosberg,Cristofer Englund,Eren Erdal Aksoy,Fernando Alonso-Fernandez
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:In this paper, we investigate the impact of adversarial attacks on identity encoders within a realistic de-identification framework. Our experiments show that the transferability of attacks transfers from an external surrogate model to the system model (e.g., CosFace to ArcFace) allows the adversary to cause identity information to leak in a sufficiently sensitive face recognition system. We present experimental evidence and propose strategies to mitigate this vulnerability. Specifically, we show how fine-tuning on adversarial examples helps to mitigate this effect for distortion-based attacks (i.e., snow, fog, etc.), while a simple low-pass filter can attenuate the effect of adversarial noise without affecting the de-identified images. Our mitigation results in a de-identification system that preserves its functionality while being significantly more robust to adversarial noise.
[CV-107] Anatomy-Aware Synthesis of Post-Contrast Breast MRI from Pre-Contrast Images
链接: https://arxiv.org/abs/2609.27015
作者: Zhengbo Zhou,Dooman Arefan,Lin Gu,Ufara Zuwasti Curran,Shandong Wu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:We developed an anatomy-aware deep learning framework to synthesize post-contrast breast MRI from pre-contrast images, emphasizing tumor and background parenchymal enhancement (BPE) regions. This retrospective study included 649 patients with 6,251 paired pre-contrast and post-contrast images. The framework integrates breast mask consistency, lesion-region supervision, and BPE-region supervision into an image-to-image translation model. Evaluation included quantitative image quality metrics, a reader study with two breast radiologists, and downstream Ki-67 classification. The proposed method outperformed Pix2Pix, Pix2PixHD, diffusion-based synthesis, and mask-supervised baselines in whole-image and regional evaluations. Ki-67 classification showed no statistically significant performance differences across real- and synthetic-image training and testing settings, although this does not establish equivalence. These findings suggest that anatomy-aware supervision improves synthesis fidelity and support further investigation of synthetic post-contrast MRI for contrast-free imaging workflows.
[CV-108] HYDRO: Towards Non-Reversible Face De-Identification Using a High-Fidelity Hybrid Diffusion and Target-Oriented Approach
链接: https://arxiv.org/abs/2609.27011
作者: Felix Rosberg,Vitomir Štruc,Cristofer Englund,Eren Erdal Aksoy,Fernando Alonso-Fernandez
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Target-oriented face de-identification models aim to anonymize the identity of a target individual across different images or video frames, such that the target can no longer be reliably recognized, while maintaining key characteristics of the visual data. Such models commonly leverage generative encoder-decoder architectures to manipulate facial appearances, enabling them to produce realistic high-fidelity de-identification results, while ensuring considerable attribute-retention capabilities. However, target-oriented models also carry the risk of inadvertently preserving subtle identity cues, making them (potentially) reversible and susceptible to reconstruction attacks. To address this problem, we introduce in this paper a novel (robust) face de-identification approach, called HYDRO, that combines target-oriented models with a dedicated diffusion process specifically designed to destroy any imperceptible information that may allow learning to reverse the de-identification procedure. HYDRO first de-identifies the given face image, injects noise into the de-identification result to impede reconstruction, and then applies a diffusion-based recovery step to improve fidelity and minimize the impact of the noising process on the data characteristics. To further improve image fidelity and better retain gaze directions, a novel Eye Similarity Discriminator (ESD) is also introduced and incorporated it into the training of HYDRO. Extensive quantitative and qualitative experiments on three diverse datasets demonstrate that HYDRO exhibits state-of-the-art (SOTA) fidelity and attribute-retention capabilities, while being the only target-oriented method resilient against reconstruction attacks. In comparison to multiple SOTA competitors, HYDRO reduces the success of reconstruction attacks by 85.7% on average.
[CV-109] Laser-Tracker-Assisted Camera-to-Robot Calibration for Mobile Robots
链接: https://arxiv.org/abs/2609.27006
作者: Jan A. Rudolph,Öykü Kandemir,Markus Ulrich
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: To appear in the proceedings of Forum Bildverarbeitung 2026
Abstract:We present a laser-tracker-assisted hand-eye calibration method for camera-equipped mobile robots. The method combines laser-tracker-based 3D metrology with camera-based 2D observations. Building on our previous laser-tracker-assisted camera-to-robot calibration method for ground-observing mobile robots, we present a generalized formulation for calibrating the camera pose in the coordinate system of tracker-localized mobile robots. The new approach relaxes assumptions of our previous method on robot and camera configuration by chaining multiple calibration targets resulting in a more general approach supporting various camera-equipped mobile robot systems.
[CV-110] Lessons learned from deploying imaging AI with the open PACS-AI platform
链接: https://arxiv.org/abs/2609.26981
作者: Samuel Kadoury,Julie G. Hussin,Pascal Thériault-Lauzier,Laurent Létourneau-Guillon,Rob Lewis,Adam McArthur,Gordon J. Harris,Houda Bahig,Pierre-Luc Déziel,Jay Kshirsagar,Jacob L. Jaremko,Julien Cohen-Adad,Jacques Delfrate,Robert Avram
类目: Computer Vision and Pattern Recognition (cs.CV); Computers and Society (cs.CY)
备注: 28 pages (21 main text + 7 supplementary), 3 figures, 1 table
Abstract:We describe deploying imaging AI at six hospitals through PACS-AI, an open self-hosted platform. The binding constraint is not model accuracy but infrastructure to route studies, display results, capture feedback, and audit what runs. At one center, angiography models completed 515 of 607 jobs (84.8%); failures reflected absent diagnostic views, and 78.1% of 638 clinician ratings were positive. Publishing honest readiness levels for every model is itself a governance practice.
[CV-111] nnFoundation: 3D Foundation Models for Radiology
链接: https://arxiv.org/abs/2609.26924
作者: Constantin Ulrich Harsy,Tassilo Wald,Karol Gotkowski,Yannick Kirchhoff,Marcel Knopp,Maximilian Rokuss,Elisa Stegmeier,Philipp Schader,Dasha Trofimova,Raphael Stock,Kim-Celine Kahl,Stephen Schaumann,Selen Erkan,David Zimmerer,Stefan Denner,Moritz Langenberg,Sebastian Ziegler,Katharina Eckstein,Maximilian Fischer,Jonathan Suprijadi,Bálint Kovács,Benjamin Hamm,Anand Deshpande,Dimitrios Bounias,Nico Disch,Shuhan Xiao,Jessica Kächele,Jan Sellner,Rajesh Baidya,Jeremias Traub,Lars Krämer,Maximilian Zenk,Tim Rädsch,Stefan Dvoretskii,Robin Peretzke,Jonathan Deissler,Alexandra Ertl,Partha Ghosh,Kris Dreher,Stefan Dinkelacker,Annika Reinke,Evangelia Christodoulou,Numan Saeed,Yoland Savriama,Santiago Estrada,David Kügler,Laura Alexandra Daza Barragan,Cristina Isabel Gonzalez Osorio,Jan Peeken,Michael Baumgartner,Marvin Teichmann,Guillaume Chabin,Matthias Kirchler,Valentin Koch, for theALFA study,Markus Hohenhaus,Dimitri Koslov,Nina Decker,Mohammad Yaqub,Arnd Heuser,Martin Reuter,Julia A. Schnabel,Tobias Heimann,Florin Ghesu,Paul Brachmann,Claus P. Heußel,Alexander Radbruch,Gianluca Brugnara,Aditya Rastogi,Martha Foltyn-Dumitru,Heinz-Peter Schlemmer,Ignaz Reicht,Julius C. Holzschuh,Michael Bach,Bram Stieltjes,Kai Schlamp,Lena Maier-Hein,Marco Nolden,Ralf Floca,Paul F. Jäger,Philipp Vollmuth,Fabian Isensee,Klaus H. Maier-Hein
类目: Computer Vision and Pattern Recognition (cs.CV); Image and Video Processing (eess.IV)
备注:
Abstract:Radiological artificial intelligence has advanced rapidly, yet most systems remain narrowly task-specific, data-intensive, and fragile under domain shift. Foundation models promise more transferable and data-efficient solutions, but existing approaches are limited in scale, evaluated narrowly, and often assume that a single pretrained model can support diverse downstream tasks. Here we present nnFoundation, complementary convolutional and transformer-based 3D radiological foundation models. Developed within the Human Radiome Project (THRP), nnFoundation is trained on 2.1 million CT, MRI, and PET image volumes from 125 institutional and public datasets. We evaluate them across 108 tasks spanning segmentation, detection, classification, report generation, and image retrieval, including evaluations under domain shift, by external partners and in low-data and low-compute regimes. Across all task types, our convolution- and transformer-based nnFoundation models consistently outperform both prior 3D foundation models and training from scratch, establishing state-of-the-art performance for radiological imaging. However, performance follows a consistent task-dependent structure: the convolutional nnFoundation model dominates spatially localized tasks, whereas the transformer-based nnFoundation model excels in tasks requiring global semantic reasoning and in frozen-feature settings. Dynamically aligning the foundation model topology with the dataset characteristics post-hoc further improves transfer across heterogeneous 3D settings. These results show that transferable 3D radiological performance is governed not by a single universal model, but by the interplay of scalable pretraining, complementary architectures, and dataset-aware adaptation. We release nnFoundation models integrated into nnU-Net and nnDetection, enabling immediate application across established radiology workflows.
[CV-112] A 3D Pose-Based Ensemble Framework for Cricket Shot Classification and Automated Biomechanical Analysis
链接: https://arxiv.org/abs/2609.26923
作者: Sourav Shome,M.D. Ashiquzzaman Rahad,Rameswar Debnath
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注: 6 pages, 3 figures, IEEE conference format
Abstract:Cricket is one of the most celebrated sports world-wide, and technological advancement has become deeply embedded in how the modern game is analyzed and coached. Cricket shot classification and automated performance analysis add a further dimension to this trend. Traditional approaches rely on RGB video features or static images, which are sensitive to environmental variations such as camera angle, lighting, and background clutter, and often fail to capture the underlying biomechanics of batting actions. In this paper, we propose a system to improve cricket coaching that takes raw video data, extracts batsmen from video frames using YOLO, and extracts 3D pose data from video frames using MeTRAbs. The system produces sequential skeletal pose data of 30 body points and captures the biomechanical features of a batsman. As part of the system, we also propose a deep learning ensemble for shot classification of four shots: flick, pull, defense, and drive. The ensemble performed well, compared to existing classification works, achieving 97.68% accuracy. In addition, we analyzed the misclassification rates to identify cases where shots were incorrectly classified and examined their possible causes. Our proposed system allows novice players to obtain useful feedback, such as important joint angles relative to expert batsmen, which can also be useful for injury prevention. The shot classifier also helps track class-wise shots over time for further analysis. In addition to novice players, coaches can use the system for player evaluation.
[CV-113] Cross-Modal Contrastive Learning from Histopathology and CT for Automated Renal Cell Carcinoma Grading
链接: https://arxiv.org/abs/2609.26920
作者: Amit Das,Tanmay Shukla,Naofumi Tomita,Faraz Farhadi,Jessica Sin,Ari Hakimi,Chad Vanderbilt,Jie-Fu Chen,Ritesh Kotecha,Weijie Ma,Bing Ren,Saeed Hassanpour
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Background: Clear cell renal cell carcinoma (ccRCC) exhibits substantial clinical heterogeneity, and accurate grade assessment is essential for risk stratification and treatment planning. However, conventional grading requires invasive tissue sampling. We developed RCC-Align, a cross-modal contrastive learning framework that leverages paired histopathology and computed tomography (CT) data during training to improve noninvasive CT-based ccRCC grade prediction. Methods: RCC-Align aligns paired whole-slide histopathology images (WSIs) and CT scans through contrastive cross-modal objectives, transferring grade-discriminative information from microscopic tissue morphology to macroscopic radiologic representations. The framework was trained and evaluated on paired TCGA and CPTAC cohorts using patient-level five-fold cross-validation. Performance for low- versus high-grade ccRCC classification was compared against CT-only baselines (DINOv2-Base and DINOv2-Finetuned) and a WSI-based reference model (GigaPath-Finetuned). Cross-modal alignment was assessed using cosine similarity analysis. Results: RCC-Align achieved an AUC of 0.601 (95% CI, 0.524-0.673) and AUPRC of 0.599 (95% CI, 0.541-0.676), outperforming DINOv2-Finetuned (AUC 0.545; AUPRC 0.543) with significantly improved low-grade prediction (p = 0.004). RCC-Align also demonstrated stronger paired WSI-CT embedding alignment compared with baselines. The WSI-based GigaPath reference achieved an AUC of 0.719. Conclusion: Pathology-guided contrastive learning improves CT-based ccRCC grading while requiring only CT at inference. This approach may complement tissue diagnosis when biopsy is unsafe, infeasible, or limited by intratumoral heterogeneity. Validation in larger, multi-institutional cohorts with external testing is needed before clinical translation.
[CV-114] Bend the Clock: Predicting Ahead to Beat Latency in Event-Based Object Detection
链接: https://arxiv.org/abs/2609.26919
作者: Biswadeep Sen,Benoit R. Cottereau,Nicolas Cuperlier,Terence Sim
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Event cameras promise low-latency perception for high-speed robotic systems, where even short delays can render detections stale by the time they inform downstream robotic decisions. Yet modern event detectors still require tens of milliseconds of computation before their predictions become available. Conventional evaluation ignores this delay by comparing predictions with annotations at the observation timestamp, even though the scene may have changed by the time those predictions are produced. We study this observation-availability mismatch in event-based multi-object detection and show that state-of-the-art event detectors degrade substantially when evaluated at prediction availability rather than observation time. To address this, we introduce ChronoFuse, a causal availability-time detector that predicts object states for when its output becomes available rather than for when its input was observed. ChronoFuse performs causal cross-time fusion over a multi-scale feature hierarchy, combining current representations with cached temporal features to expose short-term temporal cues without using future observations. The fusion pathway is lightweight, adding only 0.17 million parameters and 0.84 ms of mean end-to-end latency overhead. ChronoFuse recovers 71% of the accuracy lost to latency on 1Mpx driving data and 90.8% under rapid drone motion on FRED, nearly restoring zero-delay performance. Under the extreme motion of EV-Flying, ChronoFuse reaches 20.95 sAP, compared with 2.25 for the strongest standard event detector (9.3x gain). These results show that predicting ahead can be critical for robots operating in fast-changing scenes, including autonomous driving, agile flight, and robotic interception.
[CV-115] CORE-STACK: Meta-Learning for Deep Stacked Generalization
链接: https://arxiv.org/abs/2609.26905
作者: Noor Islam S. Mohammad
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Stacking heterogeneous vision backbones (CNNs, ViTs, and hybrids) is the de facto recipe for accuracy, calibration, and robustness, yet two coupled pathologies limit its returns. Prediction-space multicollinearity ill-conditions the meta-learner’s Gram matrix, inflating weight variance and producing brittle solutions on a thin manifold. Calibration collapse compounds constituent miscalibration through naive linear stacking, so adding more models can hurt expected calibration error (ECE). Existing remedies, ridge regularization, greedy selection, model soups, and SWAG address at most one of these issues, and none jointly target conditioning and calibration in heterogeneous prediction pools. We introduce CORE-STACK+, a preconditioning pipeline with four components: (i) a kernelized redundancy filter that removes non-linear inter-model dependencies invisible to Pearson correlation, using Centered Kernel Alignment (CKA) [23]; (ii) a 15 K-parameter differentiable meta-feature gate that learns per-sample attention over ensemble statistics; (iii) a spectrum-adaptive Ridge penalty lambda^star=lmax(Chat)/SNR(Chat) derived from a Marchenko-Pastur signal-noise decomposition, eliminating nested cross-validation; and (iv) a Laplace-approximate Bayesian blender replacing inverse-RMSE heuristics. We prove a PAC-Bayes excess-risk bound that, for the first time, jointly accounts for prediction-space redundancy and meta-learner capacity. Across six benchmarks, CORE-STACK+ delivers +1.8% top-1 on ImageNet-1K, -4.2 mCE on ImageNet-C, +0.9 mIoU on ADE20K, and +1.3 AP on COCO, while reducing retained models by 35-57% and inference FLOPs by up to 41% . ECE improves 2.1\times over deep ensembles without post hoc temperature scaling.
[CV-116] AgroBench: A Reproducible Multimodal Benchmark for Weakly Supervised Crop Yield Learning from County Statistics and Pixel Observations
链接: https://arxiv.org/abs/2609.26809
作者: Udaiveer Singh,Rajiv Ranjan,Shashank Tamaskar,Dharmendra Saraswat
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 13 Pages
Abstract:Reliable agricultural yield statistics are typically reported at coarse administrative scales, whereas modern geospatial machine learning methods require spatially explicit, pixel level supervision. This mismatch has limited the development of large-scale benchmarks for crop yield learning using multimodal Earth observation data. A reproducible benchmark, AgroBench, is presented for transforming publicly available U.S. county level crop yield statistics into weakly supervised pixel-level crop time series. Each crop pixel time series is paired with a county-level yield value as a weak supervisory signal rather than a directly measured pixel-level yield label. Our geospatial data generation pipeline integrates USDA crop yield statistics with crop-specific land cover masks, Sentinel 2 multispectral imagery, Sentinel-1 synthetic aperture radar observations, climatic variables, and terrain information to produce temporally aligned multimodal sequences describing individual crop pixels throughout the growing season. The resulting benchmark contains over 13 million observations from 788,654 unique crop pixels spanning 5,107 county year combinations across eight growing seasons (2017 to 2024) for five major U.S. crops. To facilitate standardized evaluation, we establish a crop yield prediction benchmark using a Leave-One-Year-Out evaluation protocol and provide baseline results using representative machine learning models. By releasing the complete data generation pipeline, benchmark dataset, and evaluation protocol, AgroBench provides a reproducible foundation for future research in weakly supervised learning, multimodal remote sensing, spatiotemporal modeling, and geospatial foundation models for agriculture.
[CV-117] Recursive Uncertainty-Gated Image Registration for Learning-based Algorithms
链接: https://arxiv.org/abs/2609.28081
作者: Clara Rodrigo González,Oscar Bates,Fu Siong Ng,Meng-Xing Tang
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Conventional image registration algorithms are robust to domain shifts and achieve low errors, but they are slow and computationally expensive. Deep-learning methods are efficient at inference-time, but face challenges in out-of-domain samples. We propose Recursive Uncertainty-Gated Image Registration (RUGI), an algorithm for iteratively refining deformation fields predicted by learning-based registration models. At each iteration, the registration model predicts an incremental deformation, and a gating map modulates the update. Refinements are hence concentrated in regions that remain difficult to register. We explore two gating strategies: a learned uncertainty-based approach and an image residual error approach. We evaluate RUGI on cardiac MRI and echocardiography datasets and show consistent improvements over single-step inference. Ablation experiments demonstrate that iterative refinement alone improves registration, but informative spatial gating provides a significant additional benefit. The error-gated variant of RUGI can also be applied directly to existing pretrained models; applied to VoxelMorph, TransMorph, and CycleMorph, it yields MSE reductions of 27-37% with no modification to the original training procedure. The improvements in registration performance are reflected in decreased errors in ejection fraction estimation relative to ground truths. These results demonstrate that spatially selective iterative refinement provides an effective strategy to improve registration accuracy at inference-time.
[CV-118] Local SVD-Entropy Maps as a Complementary Structural Representation for Full-Reference and No-Reference Image Quality Assessment
链接: https://arxiv.org/abs/2609.27959
作者: Andrei Velichko,Petr Boriskov
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Multimedia (cs.MM)
备注: 24 pages, 8 figures, 7 tables, 48 references
Abstract:We investigate a local spectral-complexity representation for perceptual image quality assessment (IQA) based on Shannon entropy of singular values computed directly from two-dimensional image patches. For each 3\times3 -pixel grayscale patch, SVD is applied directly and the normalized singular-value entropy defines one HSVD-map value. The construction requires neither flattening nor delay embedding, uses no boundary padding, and is invariant to 90^\circ rotations and mirror reflections at the local-descriptor level. A nested salt-and-pepper experiment on Lena separates absolute similarity to a clean reference from sensitivity to an additional degradation step. HSVD-SSIM responds more strongly to local corruption and retains a larger neighboring-state response at severe noise levels. Validation on all 10,125 distorted KADID-10k images shows that HSVD-SSIM is weaker than conventional SSIM as a standalone full-reference metric (SRCC 0.450 vs. 0.619 ), but complementary when combined with it: grouped cross-validation increases SRCC from 0.618 to 0.659 , with a bootstrap 95% confidence interval of [0.036,0.046] for the gain. In a no-reference experiment, adding HSVD-derived single-image descriptors improves the best nonlinear model from SRCC 0.528 to 0.575 (95% CI [0.033,0.061] ) and also improves prediction of quality changes between neighboring distortion states. These results support direct local SVD entropy as an interpretable structural channel that complements conventional image-domain similarity and remains informative without a pristine reference.
[CV-119] Image Denoising Using Lower Semi-Frames
链接: https://arxiv.org/abs/2609.27893
作者: Hemalatha M,P. Sam Johnson
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:A blind image denoising framework based on an infinite directional lower semi-frame (DLSF) is proposed for additive white Gaussian noise. The model employs scale-dependent directional analysis with resolvent regularization of the unbounded semi-frame operator. Noise variance is estimated directly in the DLSF domain by modeling the joint covariance of four directional difference channels and applying covariance whitening to obtain a chi-square statistic. A lower-tail moment estimator provides blind noise estimation without median absolute deviation. The estimated noise level is incorporated into channel-wise Wiener-type shrinkage and canonical-dual synthesis, followed by a data-consistent iterative reconstruction with automatic stopping. Experiments on three standard grayscale images at noise levels 15–30 yield a mean relative noise-estimation error of 3.28%, with average improvements of 7.45 dB in PSNR and 0.367 in SSIM. At 30/255 noise, the estimation error decreases to 1.73%, with a mean PSNR gain of 8.31 dB. Results demonstrate effective noise suppression and structural preservation, with the strongest performance on smooth and edge-dominated images.
[CV-120] Semantic-Guided Fusion Network for Multi-Source Remote Sensing Image Classification
链接: https://arxiv.org/abs/2609.27854
作者: Yuwei Zhao,Chuanzheng Gong,Baogui Huan,Feng Gao,Junyu Dong,Qian Du
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted for publication in IEEE GRSL 2026
Abstract:Multi-source remote sensing image classification has attracted increasing attention due to the complementary spectral, structural, and geometric information. However, existing methods still suffer from two limitations: insufficient semantic contextual modeling and unreliable feature fusion caused by slight spatial misalignment. To address these issues, we propose a Semantic-Guided Fusion Network (SGFNet) for multi-source remote sensing image classification. Specifically, the Semantic Mixing Convolution Block (SMCB) is designed to dynamically generate semantic-aware convolution kernels according to contextual relationships among feature representations. In addition, the Frequency Modulated Fusion Block (FMFB) is introduced to perform cross-modal interaction in the frequency domain, which effectively alleviates the influence of slight spatial misalignment and improves complementary information fusion. Extensive experiments conducted on the Augsburg and Houston 2018 datasets demonstrate that the proposed SGFNet consistently outperforms several state-of-the-art methods. The codes are publicly available at this https URL .
人工智能
[AI-0] StudentBench: AI and human tutoring yield equivalent GRE learning gains
链接: https://arxiv.org/abs/2609.28470
作者: Curtis Northcutt,Inaara Hasmani,Kevin Feng,Trevor Khangi,Andreas Plesner,Jonas Mueller
类目: Artificial Intelligence (cs.AI); Computers and Society (cs.CY)
备注: 47 pages, including references and appendices. Project site: this https URL . GitHub: this https URL
Abstract:Artificial intelligence offers an unprecedented opportunity to augment human capabilities, yet progress at the frontier has focused primarily on advancing model capabilities. We introduce StudentBench, a suite of AI teaching evaluations and a public platform that enables large-scale data collection with over 175,000 student-AI messages to study whether large language models (LLMs) produce learning gains equivalent to human tutoring. Using StudentBench, we measured learning gains on Quantitative and Verbal GRE questions across 2,383 human participants receiving AI tutoring, human tutoring, or no tutoring. We establish that AI tutoring is statistically equivalent to expert human tutoring for GRE learning gains (p = .015), and in five of the seven GRE domains, the best performing AI tutor surpassed the human tutor, on average. In a second study, expert human tutors compared LLM-generated lesson plans and practice problems through 2,028 pairwise rubric evaluations. Together, the two studies clearly separate AI tutors across: (1) lesson planning, (2) practice-problem creation, (3) conversational pedagogy, (4) cost, and (5) engagement. Surprisingly, one AI tutor achieved learning gains equivalent to human tutoring (p = .044) at 918 times lower cost (USD 0.0052 for AI versus USD 4.81 for human, per percentage point gained). For Quantitative GRE sessions, faster AI replies correlated with more student messages, more messages with more correct practice, and more correct practice with larger learning gains (all p .002). The StudentBench platform is freely available at this https URL.
[AI-1] Where Should I Join? Robot Group Joining via Language-Guided Goal Prediction
链接: https://arxiv.org/abs/2609.28467
作者: Zilin Fang,Zishuo Wang,Gim Hee Lee,David Hsu
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Social navigation typically assumes a specified goal and focuses on reaching it while respecting social conventions, whereas robot group joining requires predicting where to join based on the group’s real-time activity and formation. This is a highly semantic task, yet an important capability for applications such as robotic guide dogs and autonomous mobility scooters. We formulate language-grounded robot group joining: given an observation and a natural-language description of a target group, the robot identifies the relevant group members and predicts socially compliant joining poses. For grounding, we generate structured candidate subsets through recursive spectral partitioning and rank them with a language-conditioned image–geometry model. Given the grounded group, a goal predictor leverages human-formation priors to produce a multimodal energy–orientation map over feasible robot poses. Experiments on conversations, queues, and audiences across varying group sizes, crowd densities, and visual ambiguities show that our method achieves competitive grounding accuracy with sub-second inference and outperforms all baselines in joining-pose prediction. Real-robot experiments further demonstrate group joining in both static and dynamically changing interactions.
[AI-2] Learning Holographic Reduced Representations with Clifford Variational Autoencoders
链接: https://arxiv.org/abs/2609.28409
作者: Mohamed Malek Abid,P. Michael Furlong
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Neural and Evolutionary Computing (cs.NE)
备注: Preprint. 24 pages, 20 figures
Abstract:Vector Symbolic Algebras project data structures into a hyperdimensional vector space through the application of their vector algebras to randomly generated atomic vector symbols and fractional power encodings of real-valued data. Embedding unstructured data remains an open question. We present \textitClifford-VAE, a variational autoencoder that learns to project data onto a Clifford torus in arbitrary dimensions. Experiments using the MNIST, FashionMNIST, and CIFAR-10 datasets demonstrate that Clifford-VAE produces representations that are competitive with those produced by Gaussian and Hyperspherical VAEs for semi-supervised classification tasks while outperforming Gaussian and Hyperspherical counterparts in the VSA benchmark tests of self-binding and unbinding, role-filler recovery, and bundle capacity. Clifford-VAE provides a principled technique for grounding perceptual data into a symbolic reasoning framework, providing a new approach to a long-standing problem in the VSA literature.
[AI-3] When and Where to Trust the Teacher: Unifying On-Policy Distillation and GRPO through Entropy-Calibrated Credit Assignment
链接: https://arxiv.org/abs/2609.28385
作者: Jie Zhang,Jingxiao Yang,Zhehao Huang,Yuhang Liu,Xiaolin Huang
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Reinforcement learning with verifiable rewards (RLVR) supervises mathematical reasoning through final-answer correctness, but provides little guidance on individual tokens. On-policy distillation (OPD) supplies dense feedback on student-generated responses, yet teacher preference need not reflect correctness. Recent hybrids combine OPD and verifier-derived advantages or reweight task credit using teacher ratios. However, teacher guidance enters after verifier-based group normalization, and token reweighting need not preserve the total task credit assigned to each response. We introduce Unified Entropy-Calibrated Credit Redistribution for GRPO (UECR-GRPO), which integrates verifier and teacher signals within a single GRPO-style update at both the response and token levels. \emphPath-Utility Unification (PUU) combines verifier reward and a teacher-to-anchor path log-ratio in a single KL-regularized objective. Its on-policy implementation uses a length-normalized teacher score and combines both rewards before group normalization and PPO clipping, allowing teacher evidence to influence the response ranking. \emphEntropy-Calibrated Redistribution (ECR) then uses the signed teacher–old-policy token gap to redistribute the verifier-derived component. Full-vocabulary teacher entropy attenuates uncertain guidance, while a response-wise zero-sum projection preserves the total task credit and its token-wise sign before clipping. Across five mathematical reasoning benchmarks, UECR-GRPO achieves average (\mathrmAvg@12) accuracies of 17.21% and 65.09% with Qwen3-1.7B and Qwen3-4B students, respectively, exceeding the strongest baseline at each scale by 0.89 and 0.56 percentage points.
[AI-4] MicroQonv: Reshaping Convolution Tensors for Efficient Microscaling in Training and Inference
链接: https://arxiv.org/abs/2609.28358
作者: Romain Facq,Sami Ben Ali,Olivier Sentieys
类目: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI)
备注: 12 pages, 7 figures
Abstract:Microscaling quantization techniques are increasingly used to represent neural network parameters with 8 bits or fewer while preserving near-full precision accuracy. However, applying these methods efficiently in convolutional layers is not straightforward. A naive approach transfers full-precision weights and activations to processing units and quantizes each tensor twice, resulting in much more memory movement than expected. Additional overhead comes from the activation tensors, whose sizes grow substantially because of the im2col transformation applied before quantization. We propose MicroQonv, a way to combine microscaling with convolutional layers’ forward and backward operations by quantizing each tensor only once and quantizing the activation tensor before applying a modified version of im2col: channel-batch-first im2col. MicroQonv reduces the quantization cost by a factor of \times2 for weights and gradients, and by up to \times9 for activations, at a negligible accuracy cost. It reduces memory movement and storage by up to \times7.53 compared to their full-precision counterparts. This way, MicroQonv reduces microscaling-quantized activation memory movement by \times3.5 for state-of-the-art object detection models YOLOV8nano and \times2.2 for YOLOV26nano. It also enables 4-bit microscaling in a quantized latent replay strategy for continual learning at the edge, improving accuracy by +5.7% to +11%.
[AI-5] An Open Pipeline and Dashboard for Systemic-Risk Evidence under the EU AI Acts Code of Practice EACL2027
链接: https://arxiv.org/abs/2609.28335
作者: Jacob T. Emmerson,Phuong-Anh Nguyen-Le,Ronan Romano,Wilber Sean V. Anterola,Yann Billeter,Zhijing Jin
类目: Artificial Intelligence (cs.AI)
备注: 6 pages, 5 figures, submitted to EACL 2027 Systems Demonstration track
Abstract:Claims about AI safety reach audiences well beyond the AI community, yet many rely on opaque evidence or static assessments, when supporting evidence is accessible at all. We present the Systemic Risk Index, an open evaluation pipeline and dashboard built to make empirical evidence more transparent and traceable to the public. Our work organizes 19 public benchmarks into four systemic-risk categories defined by the EU GPAI Code of Practice—CBRN, cyber offense, harmful manipulation, and loss of control—and evaluates models using harm-preserving perturbations and simulated deployment contexts. The interactive dashboard lets users alternate between average and worst-case aggregation, vary how model capability affects the aggregate score, and trace each risk rating to its benchmark evidence. Across 18 models, scores fall by 14 to 37 points under worst-case aggregation, highlighting information that can be hidden by an average assessment of model risk. LLM judges show agreement with human graders comparable to human–human agreement ( \kappa = 0.78\text–0.82 ), and a blind audit finds that 83% of sampled transformations preserve the original harm. In a survey ( N = 21 ), most participants report that scores are easy to understand and that the dashboard encouraged them to view model evaluations under different settings
[AI-6] Learning the Cost of Reliable Inference
链接: https://arxiv.org/abs/2609.28322
作者: Dimitrios Rontogiannis,Ander Artola Velasco,Manuel Gomez Rodriguez
类目: Artificial Intelligence (cs.AI); Computer Science and Game Theory (cs.GT); Machine Learning (cs.LG)
备注:
Abstract:Benchmarking and routing platforms increasingly act as intermediaries connecting large language model providers with end-users. However, providers on these platforms typically use a fixed price per token, preventing users from achieving the most competitive price for their tasks. % workloads. In this work, we design a procurement platform where token prices for each task are driven by provider competition, enabling users to secure competitive pricing for guaranteed quality levels. To this end, the platform sequentially routes queries via a reverse second-price auction that incentivizes model providers to truthfully bid their best estimate of the average cost to serve a user’s query. As it routes queries, the platform learns the quality offered by each provider and progressively routes queries to the most cost-competitive provider among those meeting a desired quality threshold. To validate our design, we conduct experiments with multiple LLMs from the \textttLlama and \textttQwen families on popular mathematical reasoning and question-answering benchmarks. The results show that the pricing margin of the most cost-competitive provider on our platform varies significantly—from 10% to 71% —depending on the task and quality threshold. This suggests a substantial inefficiency in the current fixed-price market, and it demonstrates that our platform may enable users to capture maximum savings whenever competitive market conditions permit.
[AI-7] Controlling Collectives of AI Agents in Reasoning Space with Spatial Transformers
链接: https://arxiv.org/abs/2609.28247
作者: Frederic Vatnsdal,Roshan Gopal,Romina Garcia Camargo,Vijay Kumar,Alejandro Ribeiro
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Large Language Models (LLMs) introduce an exciting new paradigm for planning and navigation in robotics, but fail on even simple multi-robot tasks as team sizes grow. We propose COMPASS, a scalable, decentralized multi-robot architecture for controlling large collectives of agentic robots with reasoning space feedback control. Feedback is generated locally on each robot by a spatial transformer which aggregates multi-hop messages across the fleet into a learned feedback token. Our experiments find that collectives of language models demonstrate performance gains from structured diversity of the input command, which can cancel biases; an advantage that is held across scale. Compared against a centralized frontier LLM policy and a language-only communication ablation, we find that the coupled design of COMPASS decisively produces cohesive flocking formations that accurately fly the commanded intent. We show that reasoning feedback works best when composed with a compact learned token. Our ablations show that hand engineered feedback with raw state appearing in the language channel obliterates cohesion. COMPASS generalizes zero-shot to unseen instructions of ambiguous meaning while commanding flocks up to 16 times its training scale, flying up to 1024 robots under natural language commands.
[AI-8] From Agent Output to Authorized Transition
链接: https://arxiv.org/abs/2609.28216
作者: Christopher Koch
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: 10 pages
Abstract:Agentic engineering systems can edit repositories, run tools and tests, build firmware, synthesize schematics, and prepare deployable or manufacturable artifacts. The assurance problem is therefore shifting from whether an agent can produce an output to whether an engineering lifecycle is justified in acting on claims about that output. Current products and standards provide sandboxes, approvals, hooks, traces, policy enforcement, attestations, bills of materials, and assurance representations, but these capabilities remain fragmented. This paper presents the Agile-V Assurance Spine, a cross-domain transition contract for software, firmware, and PCB engineering. Evidence is admitted only when it establishes required properties through an authoritative source profile, is bound to the exact artifact and frozen policy baseline, remains current with respect to declared dependencies, and satisfies risk-appropriate independence and authority. Gate decisions are recorded as receipts; approvals and exceptions are exact-scope and time-bounded; and authorization is rechecked at the effect boundary before merge, deployment, flashing, release, or fabrication. A bounded review of contemporary research, commercial platforms, open-source infrastructure, and standards positions the model relative to evidence-gated lifecycle control, continuous assurance, runtime admission, provenance, and AI/ML inventories. The paper contributes a precise vocabulary, compositional architecture, domain profiles, mapping to open-source implementations, and an adversarial evaluation agenda. It does not claim regulatory conformity or demonstrated production superiority.
[AI-9] Finite-Sample Probabilistic Safety Certification for AI-Based Grid-Edge Coordination
链接: https://arxiv.org/abs/2609.28182
作者: Yihong Zhou,Hanbin Yang,Thomas Morstyn
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Systems and Control (eess.SY)
备注:
Abstract:Coordinating large population of flexible grid-edge devices can alleviate the need for time-consuming and capital-intensive network upgrades, and AI-based control methods such as multi-agent reinforcement learning or imitation learning are promising in their real-time decision scalability. However, system operators still need an independent and rigorous way to decide whether a given AI system is safe enough for deployment. This paper develops a finite-sample probabilistic safety certification framework for black-box AI decision models in closed-loop grid operation. The central idea is to reduce the complete input–AI–grid evaluator workflow to a binary unsafe outcome under an operator-defined safety specification, and then use exact binomial inference to certify the corresponding unsafe operation probability. Given a set of held-out calibration scenarios, the framework returns the tightest one-sided upper certificate and an accept/reject deployment criterion that controls the probability of false safety certification. Because the certification is for the calibration distribution that may deviate from the future operation, we further combine the nominal certificate with physically interpretable sample-space adversarial attacks, a concept widely used in AI to investigate the fragility of AI models. Case studies on grid-edge flexibility coordination with 1,000-agent AI models (independent parameters) verify the finite-sample safety guarantee and the value of integrating adversarial attacks into a rolling-window training-certification-deployment flow.
[AI-10] “Well Fix It Later”: Education AI and the Deferral of Privacy in EdTech
链接: https://arxiv.org/abs/2609.28137
作者: Meghna Manoj Nair,Rachel Greenstadt
类目: Computers and Society (cs.CY); Artificial Intelligence (cs.AI)
备注:
Abstract:Educational technology (EdTech) platforms collect highly sensitive student data, including behavioral logs, disability records, and academic histories. However, privacy considerations are often postponed rather than treated as a foundational design requirement. We present a mixed-methods study combining 12 semi-structured interviews with EdTech professionals and a privacy policy audit of 48 platforms coded across five dimensions, with strong inter-rater reliability (mean Cohen’s Kappa = 0.781). Our interviews reveal a recurring organizational pattern in which privacy is recognized as important but deferred across the product lifecycle as organizations prioritize product functionality, growth, funding, and immediate educational outcomes. Responsibility is often delegated to cloud providers, policy documents, or downstream institutions, while limited privacy-related feedback gives organizations little pressure to change these practices. The policy analysis reflects these patterns: platforms describe what data they collect relatively well but provide substantially less information about how that data is subsequently governed. Thirty-three percent make no meaningful Artificial Intelligence (AI) disclosure despite visible AI features, and 73% provide only generic accountability and breach-response language. K-12 platforms perform better on children’s consent where regulation creates explicit requirements, but this advantage does not extend to AI governance or accountability. These findings suggest that meaningful improvement requires enforceable institutional and regulatory mechanisms rather than voluntary privacy commitments alone.
[AI-11] Distillation for Efficient Multitask Manipulation Policies via Conditional Flow Matching
链接: https://arxiv.org/abs/2609.28107
作者: Shreya Deshmukh,Imen Mahdi,Nick Heppert,Abhinav Valada
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Advances in generative modeling have recently been extensively employed in robotics for policy learning. In particular, Conditional Flow Matching (CFM) trained with expert demonstrations has been shown to outperform existing methods on robot manipulation benchmarks. While prior work has mainly focused on single-task settings, we study the problem from a multi-task perspective, as training independent models for each task is computationally expensive. Multi-Task policy learning comes with its own set of challenges, as naively training on a concatenated dataset of demonstrations would either require increased model capacity to accommodate the added complexity or result in drops in performance. We propose to distill knowledge from single-task CFM experts into a shared multi-task policy by transferring their learned velocity fields. We combine this distillation signal with the original CFM objective to retain fidelity to the demonstrations. Experiments on RLBench show that our approach improves multi-task policy performance over naive training while maintaining a fixed model size.
[AI-12] Fed-ReMasker: Federated Tabular Imputation under Feature-Level Missingness
链接: https://arxiv.org/abs/2609.28105
作者: Ioannis Papathanail,Rooholla Poursoleymani,Lubnaa Abdur Rahman,Stavroula Georgia Mougiakakou
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Multi-center clinical studies and biomedical research collaborations increasingly seek to utilize data across centers to build models that generalize beyond any single center. This creates two distinct challenges: data protection regulations may restrict the sharing of raw patient data across institutions, while centers may collect only partially overlapping sets of features under different protocols. Federated learning enables collaborative model training without centralizing raw data. However, existing federated imputation methods rarely evaluate feature-level missingness, in which entire features are unobserved at some centers. To address this setting, we adapt the ReMasker masked autoencoder to federated learning (Fed-ReMasker), enabling centers to impute features never observed locally by leveraging knowledge learned across collaborating centers. We evaluate Fed-ReMasker in a benchmark spanning synthetic datasets with linear and nonlinear relationships and real-world tabular datasets, including clinical data. The benchmark varies the number of centers, the missingness ratios, and client heterogeneity. Fed-ReMasker achieves the lowest imputation error in 93.2% of value-level and 96.7% of feature-level scenarios in the homogeneous benchmark. It also remains robust to client heterogeneity using simple federated averaging, outperforming all baselines in all 36 value-level scenarios and each baseline in at least 35 of 36 feature-level scenarios, and comes within 3.0% on average of a centralized model trained on the pooled data.
[AI-13] Discovery of fully efficient fault indicators along a data-based diagnosis process
链接: https://arxiv.org/abs/2609.28087
作者: Igor Bezmaternykh(INSA Toulouse),Louise Travé-Massuyès(LAAS-DISCO, Comue de Toulouse, ANITI),Elodie Chanthery(LAAS)
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Submission accepted to IFAC WC 2026 (waiting for publication)
Abstract:The integration of model-based and data-driven paradigms provides a powerful framework for fault diagnosis by combining the interpretability of analytical redundancy relations, i.e., input-output relations that are used as diagnosis indicators in model-based diagnosis, with the adaptability of learning techniques. DT4X is a recent diagnosis algorithm that uses symbolic regression to generate multivariate relations leveraging some properties of analytical redundancy relations and uses them as split functions in a decision tree. However, its symbolic regression procedure optimizes only the separation between two selected classes at each node, often fragmenting the remaining classes and degrading both interpretability and diagnosis performance. This paper introduces DT4X+, an enhanced version of DT4X that modifies the construction of training sets and the symbolic-regression loss so that expressions separate the target classes while preserving the coherence of non-target classes. The resulting relations become fully consistent with ARR properties and lead to more informative splits, improved robustness, and better performance on dynamic-system datasets. Experiments conducted on several benchmark systems demonstrate the benefits of this enhanced formulation.
[AI-14] Curriculum Learning with GNN-based Reinforcement Learning for Job Shop Scheduling
链接: https://arxiv.org/abs/2609.28085
作者: Jayakrishnan K. Vasudevan(Rosenheim University of Applied Sciences),Jonathan Hoss(Rosenheim University of Applied Sciences),Noah Klarmann(Rosenheim University of Applied Sciences)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: This paper has been accepted for presentation at the IEEE 10th International Conference on Computational Systems and Information Technology for Sustainable Solutions (CSITSS 2026)
Abstract:The job shop scheduling problem is a challenging combinatorial optimization problem, and recent reinforcement learning approaches using graph neural networks have shown promise for learning scheduling policies directly from problem instances. However, training on large instances remains computationally expensive, and generalization across instance sizes remains challenging. This paper studies curriculum learning for graph neural network-based reinforcement learning in the job shop scheduling problem by comparing it with single-size training across three target sizes: 20 x 20, 25 x 25, and 30 x 30. In the curriculum setting, the policy is first trained on smaller instances and then progressively adapted to larger target sizes, allowing scheduling behavior learned in earlier stages to support learning on larger instances. Models are evaluated on unseen instances from 8 x 8 to 30 x 30 using the optimality gap, considering both generalization across all evaluation sizes and specialization on the target size. Results show that curriculum learning consistently reduces wall-clock training time, with larger benefits as the target size increases. The strongest advantage is observed at 30 x 30, where curriculum learning reduces the mean optimality gap across all evaluation sizes by approximately 8.1 percentage points, reduces the target-size mean optimality gap by approximately 8.6 percentage points, and saves approximately 50 hours of training time.
[AI-15] SlackDrive: Reclaiming Runtime Slack for Adaptive Driving Inference
链接: https://arxiv.org/abs/2609.28064
作者: Xiaohuan Pei,Hengguang Zhou,Yuanhao Ban,Justin Cui,Jiaqi Feng,Haoyu Xie,Tao Huang,Pichao Wang,Yanchao Yang,Cho-Jui Hsieh
类目: Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注:
Abstract:Driving world-action models improve planning by coupling multimodal reasoning with future prediction, but their growing inference cost increasingly conflicts with the real-time latency requirements of vehicle control. Existing acceleration methods reduce tokens, layers, or sampling steps with policies selected prior to deployment, yet leave residual runtime variation largely unexploited after offline profiling and static scheduling on shared onboard compute. We observe that the largest admissible compute budget varies systematically with the residual runtime state, while recent realized latency provides a direct signal of the available compute slack. Motivated by this observation, we propose \textbfSlackDrive, a pre-inference compute allocator that reuses realized latency to select the compute budget of each control step before model execution. SlackDrive profiles the latency and planning utility of a small discrete budget set once, estimates online compute state from completed forwards, and selects the highest-utility budget predicted to remain within the admissible latency envelope, complementing existing profiling and resource scheduling while preserving the driving backbone and its compute actuator. On NAVSIM v2 with DriveDreamer-Policy, SlackDrive improves latency-constrained EPDMS by 21.7% over the strongest baseline under a stringent latency regime, while the full-budget model and preconfigured token-pruning baselines exceed the admissible latency envelope under runtime contention.
[AI-16] PISCES: Physics-Informed Solar-wind Convolutional autoEncoder for Space-weather Anomaly Detection and Early Warning
链接: https://arxiv.org/abs/2609.28022
作者: Kevin Lee,Alison J. March
类目: Machine Learning (cs.LG); Solar and Stellar Astrophysics (astro-ph.SR); Artificial Intelligence (cs.AI); Space Physics (physics.space-ph)
备注: Poster presented at NASA 5th Eddy Cross-Disciplinary Symposium, May 2026. Available at: this https URL
Abstract:Space weather early warning depends on detecting solar wind transients in in-situ measurements at the first Sun-Earth Lagrange point (L1), before they reach Earth. Fixed thresholds can miss combined magnetic and plasma structure, and many learning methods provide a single anomaly score. We present the Physics-Informed Solar-wind Convolutional autoEncoder for Space-weather (PISCES), a convolutional autoencoder trained without catalog labels on OMNI solar wind measurements under physics constraints. Its loss includes magnetic field consistency, an empirical relation between temperature and velocity, the Parker spiral angle, and penalties on changes between consecutive one-minute samples in derived quantities calculated from the reconstruction. At inference, PISCES separates the anomaly score into magnetic and plasma reconstruction errors, physics relations, and residual corrections, and reports the magnitude of each contribution. Attenuation of the skip connections, selected on validation data, improves average precision for the trained models, while the untrained scores remain nearly the same. The trained models also give a more consistent ordering of these physical contributions. After smoothing with a trailing median, the alarms can precede independently observed sudden commencements, including positive sudden impulses.
[AI-17] Riemannian Structure and Optimization for a Class of Low-Parametric Orthogonal Matrices
链接: https://arxiv.org/abs/2609.27982
作者: Ali Aliev,Maxim Rakhuba
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Differential Geometry (math.DG); Numerical Analysis (math.NA)
备注: 37 pages, 2 figures
Abstract:In this paper, we are concerned with matrices formed by block-diagonal factors interleaved with fixed permutations – a flexible family of structured matrices. This class has recently drawn interest in deep learning architectures for its balanced expressivity-efficiency trade-off, yet efficient computational strategies for working with it remain to be found. We approach this problem through Riemannian geometry and examine under what conditions this class admits a smooth manifold structure. For the practically important case of orthogonal two-factor matrices, we derive the essential Riemannian tools and propose efficient algorithms for their implementation. The algorithms leverage automatic differentiation, support parameter sharing within each factor, and avoid explicit dense matrix construction. We test them within the Riemannian optimization framework on the best matrix approximation problem and for parameter-efficient fine-tuning of large language models. Beyond the two-factor setting, we study the geometric and matrix-theoretic properties of factorizations with a larger number of block-diagonal factors.
[AI-18] Spread and Scale: What Determines Whether Test-Time Budget Allocation Pays
链接: https://arxiv.org/abs/2609.27917
作者: Jinhyung Bae
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Optimization and Control (math.OC)
备注: 19 pages, 5 figures. Code, cost arrays, and the full pre-registration record (including every amendment and its direction) at this https URL
Abstract:Neural combinatorial optimization solvers generate many candidate solutions per instance and report the best one found, using the same sample budget for every instance regardless of difficulty. A companion study showed that reallocating a fixed budget toward harder instances can improve solution quality, but that the standard way of measuring this improvement is biased: deciding an allocation and evaluating it on the same data can manufacture an apparent gain even when none exists. This left open what property of a workload determines whether reallocation is worth doing, and whether a policy that spends part of the budget to decide how to allocate the rest still pays once that cost is counted. This paper answers both questions through pre-registered confirmatory experiments – analysis and verdict criteria fixed before data collection – across three independently trained solvers and two ways of constructing harder workloads on the traveling salesman problem. Within the workloads we study, the deciding property is how varied the instances within a workload are in difficulty, not how difficult the workload is on average: a uniformly easy or uniformly hard workload offers little room for reallocation, while a mixed workload offers substantial room. A budget-aware policy that pays for its own information about instance difficulty recovers most, though not all, of the improvement available when that information is assumed free. Every experiment was independently recomputed from its written specification, and every correction to an earlier version – including two that weakened the paper’s own claims – is reported with the direction it moved the conclusion. The paper offers a specific empirical answer and a template for verifying that answer is not an artifact of how it was measured. Comments: 19 pages, 5 figures. Code, cost arrays, and the full pre-registration record (including every amendment and its direction) at this https URL Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Optimization and Control (math.OC) Cite as: arXiv:2609.27917 [cs.LG] (or arXiv:2609.27917v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2609.27917 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-19] A Resilience Recovery Method for Complex Traffic Network Security Based on Trend Forecasting
链接: https://arxiv.org/abs/2609.27903
作者: Sheng Hong,Tianyu Yue,Yang You,Zhengnan Lv,Xu Tang,Jing Hu,Hongwei Yin
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Due to the rapid development of information technology, a huge and complex traffic network has been established across various sectors, including aviation, aerospace, vehicles, ships, electric power, and industry. However, because of the complexity and diversity of its structure, the complex traffic network is vulnerable to being attacked and faces serious security challenges. Therefore, this paper innovatively proposes a traffic network resilience recovery method based on resilience trend forecasting. In this paper, the risk value is introduced into the analysis of the network fault propagation process, and the Susceptible, Infectious, Recovered, Dead-Risk (SIRD-R) fault propagation model is established. The resilience model of traffic network, which encompasses real-time resilience and overall resilience, is constructed through the integration of network resilience bearing capacity and resilience recovery capacity. Ten, the resilience of complex traffic networks is forecasted by using long short-term memory networks, and the resilience recovery strategy of complex traffic networks based on forecasting is proposed. Finally, the effectiveness and scalability of the proposed method are demonstrated through experimental analysis conducted on a diverse range of complex traffic networks, affirming its applicability in real-world scenarios
[AI-20] Schrödingers Code Repository: Have LLM s Learned SWE-bench or Memorized It?
链接: https://arxiv.org/abs/2609.27891
作者: Silin Chen,Yufei Yang,Xiaodong Gu,Yuling Shi,Chengcheng Wan,Haibing Guan
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: Our code and data are available at this https URL
Abstract:Repository-level coding benchmarks have become the standard for evaluating coding agents, yet they inherently suffer from data leakage because they are built upon popular open-source repositories repeatedly used for training. Consequently, strong performance may reflect memorization of canonical repository cues rather than robust repository reasoning. We propose SchrodingerRepo (Schrödinger’s Repository), an evaluation framework for testing coding agents under dynamically instantiated repository representations. Instead of repeatedly using a static representation of the test repository, SchrodingerRepo treats the test repository as an evaluation-time latent variable that is dynamically instantiated only when the agent enters the evaluation environment. The instantiated repository preserves the original executable behavior while eroding familiar cues such as naming conventions, file layouts, and implementation patterns through four transformation levels: problem statement reconstruction, namespace remapping, intra-file layout reordering, and functionality-preserving code rewriting. We evaluate popular LLMs on SWE-bench Verified and SWE-QA. Results show that removing familiar repository cues consistently degrades agent performance and substantially increases interaction costs across models. Further analysis reveals that the additional cost is primarily caused by increased difficulty in repository exploration and localization. These findings suggest that current coding agents may partially rely on memorized repository-side cues, highlighting the need for evaluation under dynamically instantiated repository representations.
[AI-21] False-science induction in autonomous scientific discovery
链接: https://arxiv.org/abs/2609.27883
作者: Hanbing Liang,Fujun Liu
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computational Physics (physics.comp-ph)
备注:
Abstract:Closed-loop discovery systems increasingly execute experiments and update decisions autonomously, turning record integrity into part of the experimental apparatus. We show that false-science induction arises when legitimate physical objects and measurements are paired incorrectly, driving neural surrogates to faithfully learn record-induced associations that do not correspond to the true object-outcome relationship while marginal data distributions remain unchanged. Across green fluorescent protein fitness and materials band-gap prediction loops, coherent paired misbinding systematically redirects experimental budgets toward low-performing basins, whereas same-volume random swaps have negligible effects. These observations identify error coherence, rather than raw error frequency, as the primary variable controlling this budget misallocation in the tested loops. The resulting binding identifiability boundary supports monitored-axis quarantines and feedback-conflict triage, which intercept over-concentrated proposals before execution and isolate the corrupted hypothesis axis.
[AI-22] Bounded Loops: Pre-Run Spend Bounds Proved Termination and Verified Completion for Agent Harnesses
链接: https://arxiv.org/abs/2609.27871
作者: Varun Pratap Bhardwaj,Garima Singh,Arun Pratap Bhardwaj
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: 74 pages. Engine, catalogue and corpus at this https URL (Apache-2.0)
Abstract:In mainstream agent frameworks, a step ends when the agent’s own output says it has finished. Durable-execution platforms bound retries and time, but their checker conventionally lives in the same codebase as the work: a discipline the deployment is trusted to keep, not a property the harness enforces. We state what an agent harness must guarantee, prove it, and build the instrument that measures whether a harness delivers it. A bounded loop is a worker, an independent gate the worker cannot write to, and a declared budget; a bounded-loop graph composes them with a repair relation that lets a downstream failure re-run a finished upstream node. Three guarantees follow. It finishes: termination holds under repair, with the worst-case attempt total in closed form, if the repair budget is global not per node. It does not drift: no node reaches DONE without a gate verdict in an append-only hash-chained ledger, proved from control flow, since repair leaves no topological order to induct along. It does not overspend: the ceiling is enforced inside an attempt, not between attempts. Gates are measured against a two-tier held-out mutant corpus. We characterise two classes that let a sound-looking check pass anything: vacuity, satisfied by the absence of the thing checked, and self-attestation, where the subject supplies the value the check is applied to. On a 69-loop catalogue the instrument found 47 vacuous gates in shipped, reviewed code. Against the repaired gates it reports no false accepts over 209 destroying mutants ( \alpha \le 1.8% , Wilson 95%); that figure is saturation, not quality: freezing the gates and applying a fresh operator family recovers a 23.3% false-accept rate where the exhausted corpus reported none. A rate belongs to a specific gate; the apparatus, not our number, is the contribution. Engine, catalogue and corpus are Apache-2.0. Comments: 74 pages. Engine, catalogue and corpus at this https URL (Apache-2.0) Subjects: Software Engineering (cs.SE); Artificial Intelligence (cs.AI) ACMclasses: D.2.5; D.2.4 Cite as: arXiv:2609.27871 [cs.SE] (or arXiv:2609.27871v1 [cs.SE] for this version) https://doi.org/10.48550/arXiv.2609.27871 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-23] Learning What to Activate: Combinatorial Capability Allocation for Long-Horizon Multimodal Agents
链接: https://arxiv.org/abs/2609.27869
作者: Wenhao Yuan,Chenchen Lin,Jian Chen,Jinfeng Xu,Shuo Yang,Edith Cheuk-Han Ngai
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Long-horizon multimodal agents rely on specialized capabilities for perception, retrieval, reasoning, verification, and execution. Existing designs typically activate a fixed capability set or invoke a predefined workflow, incurring substantial computational overhead while failing to accommodate stage-dependent capability demands. In this paper, we study the \textitcombinatorial capability allocation problem for long-horizon multimodal agent systems, where the system selects a cost-sensitive subset of specialized capabilities at each interaction stage, which is nontrivial since capability values depend on the selected subset, while previous allocations alter the states encountered by subsequent decisions. We introduce \textscCoCA, an on-policy learning framework that recovers a deployable capability-subset policy from sparse conditional comparisons. On states visited by the student policy, the stronger teacher compares the marginal net values of candidate capabilities, conditioned on the currently selected subset. Then, we adopt a conditional utility model to transform such comparisons into an autoregressive capability-subset policy, avoiding explicit enumeration. We further introduce dual-level on-policy distillation to address distribution mismatch both across environment states and within the partial subsets encountered during set construction. Finally, trajectory-level reinforcement learning refines the distilled policy toward task success, activation cost, and allocation stability. At inference time, allocation is performed solely by the lightweight student policy without teacher queries or online updates. Experiments on long-horizon multimodal environments and controlled capability-demand shifts demonstrate the superiority of our method over the state-of-the-art baseline methods.
[AI-24] A Shared Encoder Is Not a Shared Task: Conditional Comparison for Deep Expert Pools
链接: https://arxiv.org/abs/2609.27866
作者: Kentaro Oda
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 6 pages, 2 figures
Abstract:Sharing a deep encoder does not, by itself, fix the central confound of task-comparison scores. We show that cross-evaluated heads on a frozen shared representation inherit the extrapolation confound of shallow exchange scores: pure input rotations with fixed labels inflate a deep exchange score from about 0 to 0.80, while representation-novelty scores are blind in the complementary direction (flat under label permutations that change the task completely). Transplanting a conditional two-discriminator discrepancy into the embedding space resolves both blind spots: the functional axis stays within ±0.001 under rotations and tracks label-permutation drift mass monotonically. Built into a mixture-of-heads lifecycle, the two-axis gate attains better decision quality with fewer heads than exchange or novelty triggers at a matched training budget. On generalized category discovery, the same chunk-level functional axis separates semantic novelty from photometric shift with AUROC 0.98-0.99 where per-input OOD scores (MSP, Energy, Mahalanobis, KNN) sit near chance for that distinction. All findings replicate across frozen ImageNet-21k ViT-B/16 and self-supervised DINOv2 backbones on CIFAR-100, and extend to residual adapter pools with recurrence, where a null-calibrated novelty trigger never fires on mechanism changes while the two-axis gate handles them with full recurrence reuse. We state explicitly the common-factoring condition under which embedding-space conclusions transfer to the original mechanism.
[AI-25] What Changed? Drift Detection with Real Virtual and Incomparable Diagnosis
链接: https://arxiv.org/abs/2609.27865
作者: Kentaro Oda
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Neural and Evolutionary Computing (cs.NE)
备注: 7 pages, 4 figures
Abstract:Sharing a deep encoder does not, by itself, fix the central confound of task-comparison scores. We show that cross-evaluated heads on a frozen shared representation inherit the extrapolation confound of shallow exchange scores: pure input rotations with fixed labels inflate a deep exchange score from about 0 to 0.80, while representation-novelty scores are blind in the complementary direction (flat under label permutations that change the task completely). Transplanting a conditional two-discriminator discrepancy into the embedding space resolves both blind spots: the functional axis stays within ±0.001 under rotations and tracks label-permutation drift mass monotonically. Built into a mixture-of-heads lifecycle, the two-axis gate attains better decision quality with fewer heads than exchange or novelty triggers at a matched training budget. On generalized category discovery, the same chunk-level functional axis separates semantic novelty from photometric shift with AUROC 0.98-0.99 where per-input OOD scores (MSP, Energy, Mahalanobis, KNN) sit near chance for that distinction. All findings replicate across frozen ImageNet-21k ViT-B/16 and self-supervised DINOv2 backbones on CIFAR-100, and extend to residual adapter pools with recurrence, where a null-calibrated novelty trigger never fires on mechanism changes while the two-axis gate handles them with full recurrence reuse. We state explicitly the common-factoring condition under which embedding-space conclusions transfer to the original mechanism.
[AI-26] A hierarchy of faithfulness criteria for knowledge base completion
链接: https://arxiv.org/abs/2609.27863
作者: Olga Mashkova,Robert Hoehndorf
类目: Artificial Intelligence (cs.AI)
备注: Accepted at NeSy 2026
Abstract:Knowledge graph completion is evaluated by ranking observed triples above randomly corrupted ones, which treats every unobserved fact as false. When the object being completed is a description logic knowledge base rather than a plain graph, the open world assumption and deductive closure make this inadequate: relative to the knowledge base, a candidate axiom is entailed, contradictory, or undetermined, and a model that cannot separate a logically impossible axiom from a plausible novel one is not merely less accurate but semantically incorrect. We ask what it means for a knowledge base completion model to be logically faithful, and whether current embedding models are. We define a hierarchy of four increasingly strict criteria, discrimination, logical admissibility, monotonic logical faithfulness, and probabilistic logical faithfulness, and prove that they form a strict chain of implications. We ground the strongest criterion in the relative model count P(\alpha\mid\mathcalO) = #(\mathcalO\cup\alpha)/#(\mathcalO) , which recovers the trichotomy at its endpoints and ranks undetermined axioms in between. Evaluating knowledge graph and logic-geometric embedding models on \mathcalEL ontologies, with entailed, contradictory, and undetermined test sets generated by a reasoner, we find that ranking accuracy does not imply logical faithfulness and that none of the evaluated models is faithful across the hierarchy. The code is available at this https URL.
[AI-27] Reachable Global Optimization in AI Systems: How Global Is Global?
链接: https://arxiv.org/abs/2609.27855
作者: Wesley Shu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:AI systems increasingly claim to optimize prompts, policies, architectures, plans, tool-use trajectories, reasoning traces, and test-time computation. This paper argues that such claims are underspecified unless they state the region actually reachable by the system that performed the optimization. We introduce Reachability-Induced Optimization (RIO), a model in which a generator, verifier, controller, memory, tools, and budget induce a reachable candidate region. The returned solution is therefore a best visited point, an approximate reachable optimum, or an exact global optimum only when additional certificates relate the reachable region to the full formal space. We prove reachable-optimality, false-globality, gap- decomposition, certificate, escape, pruning, and control-value results. The full benchmark record contains 66,150 executed trials over six known-optimum landscape families, seven control policies, 270 landscapes, and 35 runs per landscape-method. The online appendix includes raw trial records, aggregate tables, figures, benchmark code, validation scripts, and checksums. The results show that control can restrict, expand, or misdirect reachability, and that optimization quality, reachability quality, and control reliability must be reported separately.
[AI-28] A Non-Invasive Cloud-Based Migration Strategy for Post-Quantum Cybersecurity in Smart HVAC Systems: Architecture Implementation and Empirical Evaluation
链接: https://arxiv.org/abs/2609.27828
作者: Mahedee Zaman Moon,Kaysarul Anas Apurba,Md Hasibul Hasan,Sk Md Mizanur Rahman
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Systems and Control (eess.SY)
备注: 27 pages, 12 figures (3 architecture diagrams, 9 experimental plots), 6 tables. Preprint; work in progress. Presents a non-invasive post-quantum cryptography proxy for smart HVAC systems with empirical evaluation on Raspberry Pi 4B and ESP32-S3 hardware (ML-KEM-768, ML-DSA-65, liboqs)
Abstract:Legacy smart HVAC controllers rely on vendor-cloud TLS secured by ECDH and RSA, both broken by Shor’s algorithm, and typical 10-15 year lifespans mean today’s devices remain in service through the quantum-threat era. Direct on-device post-quantum cryptography is infeasible: an ESP32-S3, representative of capable HVAC hardware, has only 339 KB free heap against the 900 KB ML-KEM-768 requires, and even classical ECDH-P256 keygen (111.93 ms) dwarfs hardware AES-128 (0.032 ms). We propose a non-invasive PQC proxy, requiring no device, firmware, or vendor-cloud changes, performing ML-KEM-768 encapsulation and ML-DSA-65 authentication (NIST FIPS 203/204) with AES-256-GCM session keys via HKDF, implemented with Open Quantum Safe liboqs on a Raspberry Pi 4B gateway. Over 500 runs, the post-quantum handshake (Steps 1-6) completes in 2.48 ms, 0.38 ms slower than classical baseline, with PQC computation around 8% of handshake time at 20 ms simulated round-trip network latency. The gateway sustains 443 sessions/second, 100% success under 32 concurrent connections, extrapolating to 3546 sessions/second on a 32-core cloud instance. Five side-channel tests, including verified in-place session-key zeroization and a fixed-vs-random TVLA timing analysis, found no exploitable timing leakage or susceptibility to man-in-the-middle attacks. The architecture is vendor-agnostic and becomes unnecessary once vendors adopt NIST PQC natively.
[AI-29] Safe Multi-Robot Coordination via VLM-LLM Reasoning and Reachability Analysis
链接: https://arxiv.org/abs/2609.27816
作者: Mohamed Dwedar,Ahmad Hafez,Alexander Jesser,Amr Alanwar
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Systems and Control (eess.SY)
备注:
Abstract:Safe coordination in heterogeneous machine-to-machine (M2M) robotic systems is challenging when robots differ in sensing capabilities, environmental awareness, and motion execution roles. This paper presents a centralized safety-aware M2M framework for cooperative goal-directed navigation in a heterogeneous mobile robot team comprising a vision-capable quadruped and a camera-less robotic vehicle. The objective is to guide both platforms toward a goal region while avoiding static and dynamic obstacles and preventing unsafe inter-robot interactions. Under the principle of shared perception, the vision-capable robot provides semantic environmental awareness through a centralized server over an MQTT broker, enabling the camera-less platform to navigate using this shared scene representation alongside its own odometry, IMU, and state feedback. A vision-language model (VLM) interprets the visual stream, and the extracted semantic data is mapped into conservative metric geometric constraints, including inflated obstacle sets, safe corridors, and goal regions. A large language model (LLM) proposes high-level task allocations, while physical command authority is restricted to a robot-specific zonotope reachability gate. This verification engine propagates independent reachable tubes to evaluate obstacle avoidance, safe-corridor containment, and inter-robot separation predicates before approving commands. Online experiments across clear-path and dynamic-obstacle scenarios show that the pipeline reliably approves safe motion, triggers conservative replanning or holding maneuvers upon constraint violation, and enforces a strict architectural separation between advisory semantic reasoning and formally verified motor execution.
[AI-30] Ask Which Not How Good: Sizing Benchmarks Scored by an LLM
链接: https://arxiv.org/abs/2609.27787
作者: Atul Anand
类目: Artificial Intelligence (cs.AI)
备注: 18 pages, 4 figures, 5 tables
Abstract:Benchmarks scored by an LLM judge routinely adjudicate differences of a tenth of a point, but the resolution of those benchmarks has never been measured. Existing sample-complexity work covers accuracy benchmarks and leaves the judged case open. Treating the system as the object of measurement, we decompose 373,019 judgments into system, item, judge and interaction components using generalizability theory. The central result is structural: under a single judge, generalizability asymptotes to sigma2_s/(sigma2_s+sigma2_sj) regardless of item count, because the system-by-judge term carries no n_i. Items saturate; judges do not. The item cost of a target diverges as the target nears that ceiling. The ceiling is a property of pointwise rubric scoring, not of LLM judging. Run as a pairwise preference in both presentation orders, sigma2_sj falls two orders of magnitude below sigma2_s and the ceiling rises to 0.986 (bootstrap [0.934, 1.000] on 11 systems), so one judge suffices. Pairwise buys a different problem: a system presented first wins 8.6 percentage points more often than the same system presented second, a bias 1.23x the median improvement claimed in the 53 published win-rate comparisons we recovered. Protocol design dominates panel size. Measured floors are 0.41-1.24 points on a 0-5 scale at native item counts, against a median reported improvement of 0.28 points; on the one benchmark recurring often enough for an exactly matched comparison, all 17 recovered MT-Bench improvements fall below MT-Bench’s own floor, and 70% of the win-rate claims fall below the pairwise floor. An audit of 628 arXiv papers, double-coded by two independent models and validated against blind human coding (kappa=0.73), finds fewer than one paper in four states whether its evaluation was run more than once, and only 46-67% report uncertainty of any kind. Comments: 18 pages, 4 figures, 5 tables Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2609.27787 [cs.AI] (or arXiv:2609.27787v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2609.27787 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Atul Anand [view email] [v1] Mon, 17 Aug 2026 09:08:49 UTC (106 KB) Full-text links: Access Paper: View a PDF of the paper titled Ask Which, Not How Good: Sizing Benchmarks Scored by an LLM, by Atul AnandView PDFHTML (experimental)TeX Source view license Current browse context: cs.AI prev | next new | recent | 2026-09 Change to browse by: cs 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
[AI-31] Alignment of LRMs via Counter-Aligned Few-Shot Conversation Exposure
链接: https://arxiv.org/abs/2609.27763
作者: Xiangyu Zhou,Saleh Zare Zade,Dongxiao Zhu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large Reasoning Models (LRMs) rely on explicit chain-of-thought (CoT) reasoning and large context windows to achieve strong performance on complex tasks, but these features also introduce new attack surfaces. We show that LRMs’ reasoning processes can be systematically steered by prepending counter-aligned few-shot conversations containing explicit CoT traces, leading to unsafe generations on harmful queries and unwarranted refusals on benign ones. We formalize this attack as SRCF (Steering Reasoning via Counter-Aligned Few-shot Conversations) that operates solely through a flexible conversational interface and requires no access to the model’s parameters and gradients. Our key insight is that SRCF exploits an adversarial generalization issue that induces a representation drift, causing the representations of benign and harmful inputs to shift in a similar direction. This observation motivates our post-training defense, ARCF (Aligning Reasoning via Counter-Aligned Few-Shot Conversations), which exposes models to counter-aligned conversational contexts while enforcing aligned targets. ARCF is compatible with existing post-training methods and consistently improves safety and helpfulness without degrading utility.
[AI-32] Backdoors Leave Structural Traces: FedMAST for Backdoor Detection and Containment in Federated Learning ICTAI
链接: https://arxiv.org/abs/2609.27760
作者: Srinivasan Subramanian,Kazi Aminul Islam,Md. Abdullah Al Hafiz Khan
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: This work has been accepted to be presented in the 38th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)
Abstract:Federated learning enables distributed training of a shared model without requiring clients to share their raw data. However, its reliance on the integrity of the client-submitted updates exposes the global model to stealthy backdoor poisoning. Although existing defenses often inspect isolated evidence sources, stealth-constrained attacks can adapt to these signals. In this paper, we show that such attacks can suppress isolated anomaly signals, but their poisoned updates still leave residual structural traces. We propose FedMAST, a Federated Multi-Axis Structural Tracing defense for backdoor detection in federated learning. FedMAST scores client updates using complementary structural, spectral, and historical evidence and then applies tiered filtering and round-level containment to limit adversarial influence. To capture traces that isolated signals may miss, FedMAST uses squeeze-pair coherence scoring to expose coupled feature distortions and signed spectral-drift tracking to reveal persistent directional changes over time. Across six federated backdoor attacks, namely Constrain-and-Scale, Neurotoxin, BC-Layers, LGA, DBA, and 3DFed, FedMAST achieves lower ASR than baseline defenses in all nine evaluated attack–defense comparisons. Across the complete 200-round runs, it attains an average ASR of 1.51% while maintaining 94.84% average main-task accuracy. Under the method-aware CovertLayers attack, FedAvg, MultiKrum, AlignIns, and FLAME yield full-run ASRs of 100.00%, 99.67%, 99.53%, and 32.84%, respectively. FedMAST achieves the lowest ASR among all evaluated methods, reducing it to 1.53% while maintaining 92.26% main-task accuracy.
[AI-33] Categorical Internalisation of Environmental Groupoids for Generalisable POMDP Solving
链接: https://arxiv.org/abs/2609.27745
作者: Ben Opperman,Eduardo Alonso,Esther Mondragón
类目: Artificial Intelligence (cs.AI)
备注: 12 pages, 4 figures
Abstract:This paper advocates category theory as a practical framework for structuring and improving rein- forcement learning in high-dimensional, partially observable environments. We model symmetries between environmental states by partitioning the state space into equivalence classes induced by sym- metry orbits, and organise each such class as a groupoid with a designated canonical representative. This allows the agent to share what it learns across many similar environmental states simultaneously, rather than treating every orientation or position as an entirely new problem. Learning is thus carried out on a symmetry-reduced state space with each orbit represented once, preserving structure while eliminating redundancy and improving sample efficiency. We implement this framework within standard reinforcement learning pipelines and evaluate two different approaches on partially observable benchmarks, demonstrating that orbit-based partitioning yields consistent performance improvements in environments exhibiting latent symmetry. Beyond these empirical results, our approach illustrates how categorical structure provides a principled bridge between abstract reinforcement learning formulations and their computational application, thereby establishing a pathway toward more structured and scalable learning systems. Comments: 12 pages, 4 figures Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2609.27745 [cs.AI] (or arXiv:2609.27745v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2609.27745 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-34] InfiNoVA: Infinite Novel View Augmentation for Viewpoint Invariant Robot Policies
链接: https://arxiv.org/abs/2609.27734
作者: Sai Puneeth Reddy Gottam,Elmar Rueckert,Vedant Dave
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Vision-Language-Action (VLA) policies often rely strongly on the camera viewpoints seen during training, causing substantial performance degradation when deployed from unseen perspectives. Collecting demonstrations from sufficiently diverse physical viewpoints is expensive and still provides only sparse coverage of the viewpoint space. We introduce InfiNoVA, a data-augmentation framework that converts synchronized multi-camera demonstrations into a dense distribution of geometrically consistent training views. InfiNoVA reconstructs each manipulation trajectory as a time-varying 3D Gaussian representation and renders novel observations from sampled camera poses while preserving the original state-action correspondence. This explicit scene representation improves frame-level fidelity and temporal consistency while reducing task-critical hallucinations observed in generative novel-view synthesis. Across four real-world manipulation tasks, policies trained with InfiNoVA achieve 5.4x higher average success under unseen randomized viewpoints than both VISTA-based augmentation and the unaugmented policy. InfiNoVA further achieves 1.7x higher success than training directly on all five physical camera views. These results show that dense, geometrically grounded viewpoint augmentation provides a practical route toward camera-robust robot policies without modifying the underlying policy architecture.
[AI-35] Evolutionary Stability Does Not Guarantee Learning Accessibility: A Multi-Agent Reinforcement Learning Perspective on Cooperation Emergence
链接: https://arxiv.org/abs/2609.27664
作者: Yijie Wang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Cooperation emergence is a central problem in multi-agent systems because decentralized agents must coordinate while adapting to the changing behavior of others. Evolutionary game theory identifies strategically stable outcomes, but stability under a population adjustment dynamic need not imply that finite-sample learning agents can reach the same outcome through local reward feedback. We study this distinction in a transparent three-agent governance-motivated game involving a government, a platform firm, and users. We derive replicator dynamics for the fixed stage-game incentives, evaluate the cooperative evolutionary basin on a symmetric initial-condition grid, and compare it with learning-basin estimates for three decentralized value-based learners. The learning analysis uses independent Q-learning with \varepsilon -greedy action selection, scaled Boltzmann exploration, and SA–EA BQL under the same payoff environment and outcome criterion. The evolutionary basin has volume V_E=1.00 on the sampled grid. The empirical learning basin is 0.88 for \varepsilon -IQL and 0.00 for both scaled Boltzmann and SA–EA BQL. Diagnostic traces show that broader action diversity and nonzero value separation can coexist with failure to sustain the cooperative joint action in this fixed configuration. These results indicate that evolutionary stability and learning accessibility are distinct properties of a coupled game–learning system. The shared-bike setting is a motivating application; the broader contribution is a framework for comparing population-level stability with the finite-sample accessibility of cooperation under specified multi-agent learning dynamics. Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2609.27664 [cs.AI] (or arXiv:2609.27664v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2609.27664 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Yijie Wang [view email] [v1] Wed, 23 Sep 2026 10:35:50 UTC (316 KB)
[AI-36] InternW0: A Foundational Physical World Model for Efficient Real-World Interactions
链接: https://arxiv.org/abs/2609.27656
作者: Jisong Cai,Yao Mu,Ganlin Yang,Zhe Cao,Zhangzheng Tu,Xing Gao,Kailin Li,Xinyu Zhan,Lixin Yang,Yangkun Zhu,Haoxiang Ma,Ming Zhou,Qiaojun Yu,Yufei Xue,Liqun He,Yifei Yao,Yifan Zhu,Long Ling,Bingqi Jiang,Haoyu Guo,Xueyue Zhu,Bowen Zhou,Bin Zhao,Tianfan Xue,Chunhua Shen,Weinan Zhang
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注: A technical report of world models, 24 pages, 8 figures, and 7 tables
Abstract:Physical intelligence requires more than predicting how the world may evolve: predictions must remain actionable as the world continues to change. We introduce InternW0, the first instantiation of the InternW physical world model series from Shanghai AI Laboratory, built around omnimodal interfaces, asynchronous multi-frequency processing, and local physical modeling under partial observations and external influences. InternW0 jointly learns future visual dynamics and continuous robot control through an asymmetric video–action architecture with flow matching. A high-capacity video expert provides longer-horizon predictive context, while a lightweight action expert operates at a faster timescale. Instead of regenerating the future for every action update, InternW0 reuses layerwise K/V and adapts it to newly observed states through observation-conditioned context routing. Domain-specific interfaces and soft prompts support heterogeneous embodiments, while contact-aware post-training incorporates force and tactile signals for contact-rich manipulation. We train InternW0 on approximately 7,200 hours of heterogeneous robot and egocentric data, including EgoLab, a 275-hour real-laboratory egocentric dataset. Evaluation spans simulation benchmarks and real-world scientific tasks, including a 15-stage metal–organic framework synthesis workflow and 5-stage contact- and force-aware dexterous manipulation for general-purpose quantitative pipetting. These results advance scalable, asynchronous, and science-native physical world models for universal and efficient real-world interactions.
[AI-37] Learning Local Heterogeneity and Cross-Region Context for Large-Scale Traffic Forecasting
链接: https://arxiv.org/abs/2609.27637
作者: Qi Feng,Zidong Wang,Bo Li,Xiaoguang Gao,Jiayu Zhang,Chenfeng Wang,Kaifang Wan
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Traffic flow forecasting is essential to intelligent transportation systems. Large-scale traffic forecasting requires jointly modeling local spatial dependencies and cross-region this http URL dependencies between geographically neighboring nodes are heterogeneous due to differences in road identity and travel direction, while acquiring global information through allpairs node interactions incurs substantial computational costs. Therefore, capturing local heterogeneity while efficiently acquiring long-range context remains an important challenge in largescale traffic forecasting. To address these challenges, we propose LoReST, a Local-Region Spatial Temporal network that models spatial dependencies at two complementary granularities: node neighborhoods and road network regions. Specifically, relation-aware local aggregation captures heterogeneous dependencies within geographic neighborhoods through road and direction specific feature transformations. Cross-region interaction constructs region representations through mean pooling, exchanges long range context via inter-region attention, and broadcasts it back to nodes. By integrating local information aggregation with crossregion interaction, LoReST is able to effectively achieve spatial dependency learning in large-scale road networks. Experiments on four datasets of the LargeST benchmark show average relative reductions of 4.78%, 3.60%, and 5.75% in MAE, RMSE, and MAPE, respectively.
[AI-38] SHRAV: State-Hypothesis-Reason -Action-Verify Framework for Physical Modeling and Inverse Design
链接: https://arxiv.org/abs/2609.27621
作者: Ziheng Guo,Yang Bu
类目: Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE); Computational Physics (physics.comp-ph); Optics (physics.optics)
备注: 7 pages, 4 figures
Abstract:Physical modeling and inverse design require computation that can continue from reusable state. We introduce SHRAV, an architecture-independent computational framework organized around State, Hypothesis, Reason, Action, and Verify. Its central mechanism is a state-continuation core with declared reuse boundaries and explicit roles for learned evolution and numerical quantities. Forward configurations evolve predictive state and read out physical responses; inverse-design configurations additionally generate target-directed modifications and consume evaluator feedback. Electromagnetic world-model studies are mapped to forward configurations, with selected readout and reuse diagnostics reported here. Computational lithography demonstrates an inverse-design configuration: four fixed-weight design updates improve thresholded aerial-image intersection-over-union from 0.5313 to 0.8153 under independent scalar-pupil replay, with maximum absolute prediction-replay difference approximately 0.000824 between predictor estimates and independent replay.
[AI-39] BiCFlow-MER: Orchestrating Discriminative and Generative Multimodal Emotion Recognition via Conditional Transport
链接: https://arxiv.org/abs/2609.27615
作者: Yanbing Wang,Shenyue Wang,Chunyang Yu
类目: Artificial Intelligence (cs.AI); Sound (cs.SD)
备注:
Abstract:In multimodal emotion recognition (MER), human affective states are inferred by integrating complementary cues from multiple modalities. In audio-text MER, affective cues are often entangled with speaker style and lexical content, while cross-modal disagreement further complicates how the evidence should be integrated. Under conventional discriminative fusion, multimodal evidence is compressed into a terminal prediction, with modality-specific cues and conflict information insufficiently preserved. In large generative affective models, by contrast, affective reasoning is typically embedded in language decoding, leaving emotion evidence implicit and difficult to verify in a structured space. To address these limitations, BiCFlow-MER (Bidirectional Conditional Flow for Multimodal Emotion Recognition) is proposed as a conditional-flow framework in which audio-text MER is formulated as generative evidence transport within a structured emotion space. Within BiCFlow-MER, emotion-oriented evidence is disentangled from speaker-style and lexical-content factors to construct a conflict-aware affective condition. Guided by this condition, each utterance is transported to an explicit emotion-space endpoint through a bidirectional rectified flow. Candidate emotions are jointly verified through adaptive prototype-cloud scoring of the transported endpoint and backward class-to-condition consistency with the original multimodal condition, enabling conflict-aware recognition. BiCFlow-MER is shown to outperform all compared methods across IEMOCAP, MELD, and the zero-shot CASE benchmark. By orchestrating discriminative recognition and generative evidence modeling through conditional transport, BiCFlow-MER defines a new MER paradigm.
[AI-40] State-Grounded Conditioning: Wrapping User-Facing LLM Agents Where Direction Depends on Live State EACL2027
链接: https://arxiv.org/abs/2609.27606
作者: Qi Liu,Xiaoyang Yuan,Yubin Ruan,Zhuomeng Zhang,Wenjin Wang,Di Wu,Mingye Xu,Xinyi Mou,Xingxi Yin,Ke Feng,Zixun Sun
类目: Artificial Intelligence (cs.AI)
备注: 11 pages (6-page main body + Limitations, Ethics, References, Appendix); 4 figures; 3 tables. Preprint. Under review at EACL 2027 (Industry Track)
Abstract:We introduce State-Grounded Conditioning (SGC), a design principle for user-facing LLM agents that must condition on live user state (game state, session history, live inventory), and a distinct failure class we call direction drift: task-complete responses whose chosen direction misaligns with the current state. SGC externalises state-dependent control into rule kernels over structured inputs and three primary state slices, via Perception, Grounding, and Interaction wrappers with explicit conditioning dependencies. We evaluate SGC on a 200-session anonymised benchmark ( \approx 1,000 assistant model turns) from an in-game conversational coaching agent that guides players through consecutive competitive matches, reporting mean first-token latency and five human-annotated dialogue-quality metrics that jointly cover factual grounding and coach-like guidance progression. The Perception wrapper holds mean first-token latency at 1.5s (vs. 6.1s for PE-Agent inside a production tool-use harness); enabling all three wrappers lifts turn-level grounded accuracy from 61.1%/69.8% (Prompting / PE-Agent) to 96.7% and session-level grounded accuracy from 20.0%/26.5% to 83.5%; session-level grounding-failure incidents drop by \approx 78% relative to the strongest baseline. A cumulative ablation shows complementary incremental gains as the wrappers are added. These results inform approximate state-slice orthogonality, without establishing independent per-wrapper effects.
[AI-41] Hidden not Deleted: How Networks Suppress Entangled Features
链接: https://arxiv.org/abs/2609.27593
作者: Akash Samanta,Manish Pratap Singh,Debasis Chaudhuri
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Concept erasure methods that operate via linear projection assume that features occupy separable subspaces. We show this assumption fails under dense superposition: when two features are forced into an antipodal pair sharing a single subspace, state-of-the-art linear erasure destroys both, not just the target. Networks trained with gradient descent instead solve this problem non-linearly, but not uniformly: they converge to one of two distinct circuit-level solutions depending on initialization, which we call mirror and shadow solutions. We map this bifurcation as a function of feature entanglement, show it reflects a stable attractor structure rather than an artifact of our setup, and use targeted causal interventions to demonstrate that both solutions leave a substantial, measurable trace of the erased feature’s representation intact, recoverable through a single scalar patch rather than requiring any further training. This mirrors a failure mode recently observed empirically in LLM unlearning, where suppression rather than deletion allows forgotten knowledge to resurface; our results offer a mechanistic, causally-validated account of why that failure mode occurs.
[AI-42] he Capability Manifold and ML Scaling Laws
链接: https://arxiv.org/abs/2609.27588
作者: Syed Ali Raza Zaidi,Maryam Hafeez
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Existing machine learning (ML) scaling laws relate predictive loss to compute, model parameters, and data. However, as models are increasingly deployed through agentic harnesses, loss alone is insufficient to characterize downstream performance: models with similar loss can exhibit different capabilities in reasoning, retrieval, planning, and adaptation. Yet, no unified framework connects such capabilities to the coupled resources available across the ML lifecycle. We bridge this gap by introducing a capability manifold, a multidimensional framework mapping downstream capabilities to pre-training, post-training, and test-time resources through bounded scaling functions. Analytical Jacobians quantify capability sensitivity to resource changes and interactions. As an initial application, we embed Kaplan- and Chinchilla-type scaling laws and test-time compute within the framework, demonstrating how existing scaling relationships can be unified as trajectories on a common capability manifold.
[AI-43] DCRL: Decoupling and Coupling Reinforcement Learning via Policy-Reward Manifold Alignment
链接: https://arxiv.org/abs/2609.27572
作者: Henan Sun,Zehua Li,Haitao Hu,Qifan Zhang,Jianfeng Zhang,Nuo Chen,Jia Li
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Under review
Abstract:Reinforcement learning (RL) has emerged as a key paradigm for improving the reasoning capabilities of large language models (LLMs). However, existing reward systems, such as rule-based and reward-model-based, often exhibit issues such as unstable optimization and reward hacking. In this work, we revisit the general reasoning of LLMs from a geometric perspective, conceptualizing it as a coupled manifold composed of three interdependent sub-manifolds: logical deduction, evaluation, and representation. Based on this perspective, response generation in RL can be interpreted as a decoupling process from the evaluation manifold, while reward estimation corresponds to a decoupling process from the logical deduction manifold. The limitations of rule-based and reward-model RL systems can be geometrically interpreted as the mismatch of policy-reward manifolds during RL process. To address the aforementioned misalignment, we propose Decoupling and Coupling Reinforcement Learning (DCRL) framework, which incorporates two key components: (1) a syllogistic logic-based prompt evolution mechanism that dynamically refines reward rubrics to enhance the expressiveness of the reward manifold; and (2) a policy-reward re-coupling mechanism that jointly updates the reward and policy models, ensuring consistent evaluation and mitigating manifold mismatch during training. Theoretical analysis and extensive experiments across multiple reasoning domains demonstrate that DCRL consistently outperforms both rule-based and reward-model baselines. Notably, a Qwen3-4B model trained under DCRL surpasses a Qwen3-32B baseline and approaches the performance of a Qwen3-235B model, highlighting superior effectiveness and generalization in RL.
[AI-44] FDE-Bench: Evaluating LLM Agents for Deployment Environment Configuration
链接: https://arxiv.org/abs/2609.27571
作者: Weihang Ding,Junfei Zhan,Yueting Li,Qirong Guo
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注:
Abstract:Deployment requires an agent to turn application code into a running system whose services connect, become ready, and remain observable. FDE-Bench evaluates this capability with 136 deployment-configuration tasks spanning Docker images, multi-service Compose stacks, and Kubernetes, in greenfield and diagnose-and-repair modes. Agents submit declarative artifacts that are collected, rebuilt, and redeployed in a pristine environment. Four gated binary check layers measure build, readiness, behavior, and conformance to the deployment specification, using programmatic checks without an LLM judge. A four-arm release gate requires a resolving reference solution and rejects tasks solved by do-nothing, specification-transcription, or generic-stub submissions. The released check annotations expose the link between 2,145 checks and their specifications, including seven documented gaps. Three additional adversarial strategies test shortcuts in the grading signals; none resolves any of the 135 tasks they cover, while a vacuous health probe passes readiness and exposes the need for downstream checks. On the 136-task evaluation grid, seven language models from four providers use the same four-tool scaffold and resolve 52.9-75.0 percent of tasks. The three zero-intelligence floors resolve none and reach a mean Deployment Score of at most 0.44. Readiness is the largest failure stage, accounting for 110 of 313 unresolved episodes. Mean resolution rate is 30.7 percentage points higher on the repair task group than on the disjoint greenfield group, with a positive gap for every model; ten tasks resist all seven. In a 25-task case study, one practicing engineer directing Claude-Sonnet-5 resolves 92 percent against 72 percent for the autonomous baseline. FDE-Bench links deployment success and failure to artifacts that can be inspected and replayed.
[AI-45] NLearn: An Open Source Python Package for Task-based Neurons
链接: https://arxiv.org/abs/2609.27564
作者: Meng Wang,Tieyun Li,Juntong Fan,Hanyu Pei,Jing-Xiao Liao,Yaodong Yang,Jianwei Ma,Fenglei Fan
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 24 pages, 6 figures, 6 tables
Abstract:The brain does not rely on a single type of neuron to perform all kinds of tasks; instead, it designs different neurons for different tasks. The concept of task-based neurons represents a paradigm shift compared to task-based architectures. It argues that solving a specific problem requires customized neurons, as task-based neurons capture useful prior knowledge from task-related data. To facilitate the use of task-based neurons in scientific research and industrial applications, we introduce TNLearn, an open-source Python package that provides automated construction of task-based neurons and networks, enabling smooth training of task-based networks. Comprehensive documentation, including technical exposition, API reference, and representative examples, is available online. TNLearn is open-sourced at this https URL and has become a PyTorch ecosystem project.
[AI-46] PhyMo: A Physical-Field Modality for Multimodal AI4Physics
链接: https://arxiv.org/abs/2609.27554
作者: Henan Sun,Haitao Hu,Jin Liu,Jianfeng Zhang,Lujia Pan,Nuo Chen,Jia Li
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Under review
Abstract:Multimodal learning is emerging as a powerful paradigm for AI for Physics (AI4Physics), where predicting physical systems requires the joint interpretation of heterogeneous observations, measurements, and domain knowledge. However, existing approaches typically represent physical quantities and governing equations as generic numerical or textual tokens, overlooking the physical constraints that determine their spatiotemporal interactions. To address this limitation, we introduce the \textbfphysical-field modality and propose \textbfPhyMo, a physics-grounded multimodal framework that organizes heterogeneous measurements through PDE-associated operators. PhyMo follows a three-stage learning procedure: the physical-field encoder is first pretrained through field reconstruction under PDE residual supervision, its representations are subsequently aligned with visual embeddings in a shared latent space, and the fused multimodal representations are finally processed by corresponding downstream prediction heads. Experiments on five datasets spanning diverse physical environments show that PhyMo achieves state-of-the-art performance, compared to the strongest baseline on each dataset, demonstrating the superiority of PhyMo on multimodal representation learning in AI4Physics.
[AI-47] Behaviora - A Conceptual Architecture for External and Internal Behavior of Robots and Agents
链接: https://arxiv.org/abs/2609.27536
作者: Gote Nyman
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Behaviora is a preliminary conceptual architecture for representing agent and robot behavior, external and internal alike, in an addressable form. A behaving robot or agent performs a Behavior Episode composed of episode components, which can be derived from behavior taxonomies (BTax) and assigned persistent identifiers. We denote these identifiers as IoB (Internet of Behaviors) Addresses. A Behavior Episode specifies what the system does, while a Style Profile (SP) specifies how this behavior is expressed. Style can communicate characteristics of the actor and qualities such as competence and cultural manners. An Experience Profile (EP) represents behaviorally relevant internal state that modulates the execution of an Episode. Finally, a Behavior Compiler maps these behavioral representations to platform-specific actions. We use a primitive touching arm model to show these components and their relations. External Behavior is a result of addressable movements and their styles. Internal Behavior is represented through the same episodic principle and can be rendered as inner speech. Sensing, perception and complex task contexts have not been included in the present implementation, although a conceptual place is reserved for them.
[AI-48] Not What You Meant: Can LLM s Follow a Specified Negation Semantics?
链接: https://arxiv.org/abs/2609.27517
作者: Qiming Bao,Agnieszka Mensfelt,Michael J. Witbrock,Kostas Stathis
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Negation does not carry a uniform interpretation across domains. In legal, regulatory, and medical reasoning, the intended interpretation depends on the reading in force – open- versus closed-world, two- versus three-valued, and credulous versus skeptical. We study which reading of negation large language models adopt by default and whether they can override that preference when a different reading is explicitly specified. To this end, we introduce NAFBench, a procedural generator of solver-certified instances spanning four semantic viewpoints: SLDNF, well-founded semantics (WFS), and credulous and skeptical reasoning under stable-model semantics. The generator emits ground normal logic programs with controlled depth, width, and cycle structure. Each program is solved under all four viewpoints using SWI-Prolog, a well-founded semantics solver, and clingo, yielding up to four divergent labels. The programs are then verbalized into natural language under multiple framings and rule orderings that leave the answer invariant. The results expose a consistent gap. Across open-source models, following a specified negation semantics remains unsolved: the strongest models score 59–74% across the four semantic viewpoints, while the weakest score 31–67%. All models are order-sensitive on more than half of logically identical rule shufflings, while the two weaker models frequently overcommit on well-founded “undefined.” Two frontier models reach 100% on the main fixed-complexity evaluation set, and a third, o4-mini, is near-perfect, falling only to 81% on well-founded “undefined.” Delegating reasoning to a solver, fine-tuning on certified traces, or forcing an explicit three-valued verdict each partly closes the gap.
[AI-49] WhatWorkedBench: Benchmarking Experimental Understanding in AI Agents
链接: https://arxiv.org/abs/2609.27490
作者: Jingjie Ning,Xueqi Li,Yibo Kong,Dongting Li
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:AI research agents need reliable knowledge of how their experiments change outcomes. We introduce WhatWorkedBench to measure experimental understanding, the accuracy of predictions about component changes after budgeted experimentation. Agents inspect code, select measurements, and submit a response surface, a table predicting scores for every configuration of component settings. Exhaustive CPU execution supplies reference effects for changing each component while holding the others fixed. These effects capture combinations of changes across 36 tasks from 30 data sources and 8 workflow types, with 1248 configuration records. Core evaluation combines 4,206 numerical-control records across all eight families and 108 agent episodes across the original six. At eight new measurements, pair-effect ridge selects an optimum on 15 of 22 sources and limits every effect error to 10% of score range on three. Fitting a Gaussian process (GP) to the same agent observations raises effect recovery, accuracy relative to true effect magnitude, from 0.632 to 0.698 in the original Flash cohort and from 0.621 to 0.720 in an additional cohort. On six completed beat-detection and graph submissions, the same-observation GP raises family-macro recovery from 0.303 to 0.455. On six workflows with six binary options at 20 new measurements, encoding code equivalences, configurations with identical behavior, raises GP recovery from 0.248 to 0.462. WhatWorkedBench supports research on experimental agents, adaptive experimental design, numerical inference, and use of program structure.
[AI-50] Passing: An Endless Journey through Reconstructed Spacetime with AI-Generated Sound NEURIPS2026
链接: https://arxiv.org/abs/2609.27489
作者: Akira Takahashi,Chihiro Nagashima,Zhi Zhong,Shusuke Takahashi,Yuki Mitsufuji
类目: ound (cs.SD); Artificial Intelligence (cs.AI)
备注: Accepted to the NeurIPS 2026 Creative AI Track
Abstract:This paper introduces Passing, an interactive audiovisual installation that generates an endless journey from a single continuous monorail-window recording by reconstructing it as a spatiotemporal volume. Rather than replaying the footage linearly, the work resamples its spatial and temporal structure along nonlinear trajectories, producing a continuously passing landscape whose depth, speed, and temporal order become unstable. A camera-based viewer-presence detection system estimates whether a viewer is present in the viewing zone and uses this presence state to influence transitions among rendered video sequences. The resulting video stream is fed into SpecMaskFoley, a real-time video-to-audio synthesis model that generates a synchronized soundscape for the reconfigured image. The model is not used to reconstruct an objectively correct soundtrack, but functions as a speculative listener, proposing a possible auditory interpretation of a world whose conventional spatial and temporal premises have been disrupted. Passing distributes creative agency across the artist, who defines the rules of spacetime reconstruction; the AI model, which interprets the emergent visual flow as sound; and the audience, whose embodied presence influences the audiovisual trajectory. Through this structure, the work investigates how authorship and listening may be negotiated among human intention, machine inference, and audience interpretation. Artwork page: this https URL
[AI-51] Kairos: Grounded Forecasting of Presence and Directional Flow in 4D Scene Graphs
链接: https://arxiv.org/abs/2609.27467
作者: Iacopo Catalano,Julio A. Placed,Javier Civera,Jorge Peña Queralta
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Long-term autonomy in human-populated environments requires anticipating whether and how people will move at times a robot has not yet observed. Existing representations of pedestrian motion face a tradeoff: they either forecast future activity, reducing each location to a scalar rate, or model the full directional distribution, holding it fixed in time. We present Kairos, a predictive directional-flow memory that extends a hierarchical 3D scene graph (3DSG) to a 4D scene graph (4DSG). Every observed voxel of the reconstructed geometry stores a directional mixture and a presence rate, and spectral predictors forecast, for any future query time, both the probability that people are present and the full directional distribution of their motion. Pairwise flow dependence between adjacent voxels supports conditional queries, and per-voxel predictive variances yield calibrated credible intervals that tighten as observations accumulate. We evaluate Kairos on three real pedestrian environments: a robot-collected campus dataset, a shopping mall, and a station concourse recorded continuously for eleven months. Its learned state remains consistent under loop-closure corrections, and its forecasts are competitive with dedicated occupancy and flow models trained on the full detection stream, although Kairos learns from only the small fraction available to a patrolling robot. Finally, we validate the representation on a downstream encounter-probability planning task, where plans computed over the Kairos forecasts encounter more people than plans computed over any time-invariant map at an equal success rate. We provide the code at this https URL.
[AI-52] Issuer-Sovereign Agent ic Payments
链接: https://arxiv.org/abs/2609.27452
作者: Dishant Sharma,Rajneesh Kaushal,Ashu Kanaujia
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注:
Abstract:AI agents are beginning to make real payments. Current approaches let an agent pay by relying on a credential provider that, in the approaches deployed today, typically sits outside the cardholder’s bank. The spending rules are then enforced by the card network or that provider, and not by the bank itself. This leaves the issuing bank, which carries the financial risk, with little direct control at the moment a payment happens. This paper describes Issuer-Sovereign Agentic Payments, a method that keeps that control with the issuer. The cardholder approves a spending rule once, and the bank’s own authentication component records it. Later, when the agent pays a specific merchant, the bank checks the merchant against the approved rule and generates the card authentication value only if the merchant is allowed. The payment then travels the normal card rails and is validated by the issuer, with no extra dependency introduced at execution.
[AI-53] BEE: Intervention-Adaptive Real-World Reinforcement Learning with Vision-Language-Action Models
链接: https://arxiv.org/abs/2609.27450
作者: Weihui Zhao,Xiaohan Yan,Zunian Wan,Xuan Du,Zhaozhan Chi,Jianbo Mao,Ruipu Wu,Rushuai Yang,Houlin Li,Shukai Yang,Jing Wu,Yuxiang Yan,Yongcheng Liu,Chuankang Li,Guanghui Ren,Wei Shan,Maoqing Yao
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Vision-language-action (VLA) models handle long-horizon manipulation, yet success hinges on a few precision-critical phases where millimeter-scale errors undo all prior progress. Online reinforcement learning (RL) can optimize exactly these actions, but free exploration is far too costly on real robots, which makes human corrections indispensable. However, existing online RL methods for VLAs either cannot incorporate such corrections or fold them into undifferentiated supervision. Yet human corrections are not uniformly noisy but reliable along some action dimensions and variable along others. Building on this, we introduce BEE, an intervention-adaptive framework for real-world RL on a frozen VLA that lets the policy go BEyond Expert imitation. We formulate human corrections not as actions to reproduce but as evidence about a constraint: a Correction Model predicts how a human would correct a given VLA proposal and how consistent the correction is along each action dimension. This predicted consistency sets the per-dimension tightness of a constraint on policy optimization. Where corrections are consistent the policy stays close to the human, and where they vary, the constraint relaxes. We evaluate BEE on three real-world manipulation tasks and one LIBERO-Pro simulation task at a matched online-data budget. BEE attains the highest success rate on every task, 91.2% on average against 57.5% for RLT and 42.1% for DSRL, and the lowest human intervention rate on all real-world tasks.
[AI-54] Quantum Reinforcement Learning for Cost and Delay Tradeoffs in Quantum Cloud Orchestration
链接: https://arxiv.org/abs/2609.27446
作者: An N. H. Phan,Dang Van Huynh,Muhammad Usman,Hoa T. Nguyen
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Distributed, Parallel, and Cluster Computing (cs.DC); Emerging Technologies (cs.ET); Quantum Physics (quant-ph)
备注:
Abstract:Quantum cloud computing, delivered through the quantum-as-a-service (QaaS) model, provides access to quantum computing resources. However, applying uniform time-based pricing across fundamentally heterogeneous quantum resources significantly complicates task orchestration, particularly when addressing the tradeoff between execution costs and system performance. While heuristic methods rely on predefined scheduling rules, classical deep reinforcement learning (DRL) models may require more trainable parameters in this setting. Motivated by the potential of parameterised quantum circuits (PQCs) as compact function approximators, we propose QRLQ, a cost-delay-aware quantum cloud scheduling framework integrating PQCs with a dueling double deep Q-network (D3QN) to dynamically account for both cost and delay. Our simulation results show that QRLQ achieves lower mean cost and delay than the heuristic baselines, achieving a 5-11% lower mean cost relative to availability-based and rotation-based heuristics and reducing mean delay by 17% and 82% relative to the strongest and weakest heuristic baselines, respectively, while retaining execution fidelity within 2% of a fidelity-greedy policy. Compared with the classical DRL baseline, QRLQ achieves comparable scheduling performance while using 72% fewer trainable parameters. This work explores the feasibility of using QRL for task orchestration in quantum cloud environments and demonstrates its potential for cost-delay-aware quantum resource management.
[AI-55] Emergi-PersonaOS: A Persona Agent Operating System for Situational Adaptation and Controllable Evolution
链接: https://arxiv.org/abs/2609.27417
作者: Haoluan Fu,Keni Chen,Xinyu Jia,Jinpeng Wang,Yuyu Yin
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Symbiosis between humans and digital beings offers a vision for the future of human–machine interaction. In enduring human–machine relationships, personality provides a foundation for continuity of identity, individuality in interaction, and development through experience. We investigate this capacity through persona agents as computational implementations and introduce Emergi-PersonaOS, a psychology-grounded operating system for managing persona objects throughout their lifecycle. The system organizes dispositional traits, characteristic adaptations, and narrative identity into a three-layer persona representation, distinguishing relatively enduring persona beliefs from their activation in the current persona state. During situational adaptation, it integrates the current interlocutor, relationship, event, and retrieved memories to infer a persona state and generate actions and replies; during long-term development, it records experiences and outcomes, and develops and evaluates revision candidates through change attribution, meaning-making, and behavioral testing. Belief updates are managed through explicit review, traceable evidence and version records, and the ability to reject candidates, making persona evolution controllable. Using television-character dialogue as longitudinal material, we demonstrate long-horizon system operation and examine its principal mechanisms in a concrete implementation. This work provides a computational framework for persona agents to maintain individual continuity, produce situation-specific expression, and develop through experience over sustained interaction.
[AI-56] Forget who you Forgot: Speaker Unlearning to Prevent Re-Identification in Zero-Shot Text-to-Speech
链接: https://arxiv.org/abs/2609.27399
作者: Hyoeun Kim,Yujun Lee,Kyuhong Shim
类目: ound (cs.SD); Artificial Intelligence (cs.AI)
备注:
Abstract:Recent zero-shot text-to-speech (ZS-TTS) systems can reproduce a speaker’s voice with high fidelity from only a few seconds of reference speech, raising concerns over unauthorized voice cloning and impersonation. Speaker identity unlearning has recently emerged as an approach to selectively suppress this capability for speakers who opt out while preserving synthesis capability for other speakers. Although existing approaches reduce speaker similarity, preventing re-identification often faces severe degradation of speech quality. Motivated by this observation, we propose GUARD, a lightweight speaker identity unlearning framework that combines a learned speaker gate with speaker-agnostic activation steering on a frozen TTS backbone. The steering vectors are optimized using group-relative reward optimization to shift outputs from forget speakers toward population-level impostor similarity while preserving intelligibility and speech naturalness. On CosyVoice2, GUARD reduces forget-speaker similarity from 0.541 to 0.103 and re-identification accuracy in a 150-speaker gallery from 73.5% to 0.5%, while preserving retain-speaker reproduction. The results demonstrate that similarity reduction alone may not fully characterize successful speaker identity unlearning and highlight re-identification as a complementary criterion for its evaluation.
[AI-57] Forecast Workflow Bench: Evaluating Language-Model Decisions with Budgeted Forecast Tools
链接: https://arxiv.org/abs/2609.27385
作者: Shunya Nagashima
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Time-series foundation models (TSFMs) provide forecasts for operational decisions, but accuracy alone does not determine their value. Evaluating agents that use these models requires measuring decision quality and forecast cost. FWBench evaluates this capability on 1,251 electricity and cycle-hire cases using fixed forecast tools and simulated capacity contracts. Agents select models, histories and horizons, then submit capacities to minimize a stated loss-cost objective. We evaluated two hosted and eight local configurations, including small language models, and tested local models with and without TSFMs. GPT-6 Astra bought inexpensive short-horizon forecasts selectively, using 2.5% of the budget, and outperformed fixed policies when the saved decisions were scored with three loss-cost weightings. FWBench enables reproducible evaluation of how language models select and use time-series forecasts to make decisions under cost constraints.
[AI-58] Quantization-Robust Unlearning through the Lens of Retain-Forget Loss Landscapes Interaction
链接: https://arxiv.org/abs/2609.27355
作者: Jialu Wang,Jianing Deng,Shuqing Luo,Yuanzhe Li,Dongwei Wang,Jingtong Hu,Huanrui Yang,Song Wang,Tianlong Chen
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Unlearning ensures LLM compliance by removing the influence of private or copyrighted training data. However, since LLM models typically undergo post-training compression, like quantization, in practical deployment, it has been observed that the unlearning effect can be substantially weakened, with the forgetting behavior degrading more severely than that of model utility. This paper proposes a quantization-robust unlearning framework that makes forgetting robust to quantization while maintaining overall model utility. We analyze this gap through the lens of loss landscape. Specifically, our analysis reveals a curvature-based criteria that pinpoints sensitive weights in the unlearned model that leads to both non-robust forgetting and reduced utility. We therefore propose sensitivity-guided noisy regularization, which is applied on the sensitive parameters to steer the model convergence towards a smoother minima of uniformly low forget and retain losses. Balancing unlearning and utility, we further propose forget-critical optimization, which updates only forget-critical layers, preserving most of the network to retain useful knowledge. Extensive experiments on the MUSE and TOFU benchmarks across multiple LLM unlearning algorithms show that our approach achieves substantially more quantization-resilient forgetting while maintaining utility.
[AI-59] Constraint-Driven Context Engineering: Designing Domain Interfaces for AI Systems
链接: https://arxiv.org/abs/2609.27354
作者: Xiwei Xu,Chen Wang,Mengmeng Yang,Yipeng Zhang,Jacky Jiang,Suyu Ma,Youyang Qu,Ming Ding,Liming Zhu
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: submitted to conference
Abstract:Generative AI systems are increasingly deployed to address domain problems. These systems operate under technical, regulatory, institutional, and normative constraints that define acceptable AI behaviour and outcomes within their domains. We observe a recurring pattern in our industry engagement: partners often arrive with a functioning but relatively generic AI solution. The challenge is no longer to build an AI system from scratch, but to improve the quality and domain appropriateness of an AI-generated solution. In these settings, the limiting factor is often the quality, scope, and structure of the context available to the system. Yet, existing context engineering approaches primarily focus on supplying domain knowledge through retrieval, memory, and tools, with limited support for systematically identifying and operationalising the constraints that govern AI systems in their operational environments. This paper proposes Constraint-Driven Context Engineering (CDCE), a design approach for engineering domain interfaces for AI systems. Drawing on software architecture design and Domain-Driven Design (DDD), CDCE treats domain constraints as first-class design drivers. It identifies and characterises constraints, determines the required context assets, and designs representations through which these assets are made available to AI systems. We conducted a comparative multiple-case study with industry and public-sector partners across educational assessment, healthcare decision support, and financial-distress prediction. Depending on their characteristics, constraints can guide AI behaviour, enforce permissible boundaries, or support verification of AI-generated outcomes. The cases demonstrate CDCE’s applicability across contrasting domains and show how constraint characteristics shape the resulting domain interfaces. Comments: submitted to conference Subjects: Software Engineering (cs.SE); Artificial Intelligence (cs.AI) Cite as: arXiv:2609.27354 [cs.SE] (or arXiv:2609.27354v1 [cs.SE] for this version) https://doi.org/10.48550/arXiv.2609.27354 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-60] MolDesignBench: Evaluating LLM -based Agent for Scenario-grounded Molecular Design
链接: https://arxiv.org/abs/2609.27349
作者: Yongjun Jeong,Hanbum Ko,Ye Rin Kim,Chanhui Lee,Rodrigo Hormazabal,Jaewan Lee,Sehui Han,Sungbin Lim,Sungwoong Kim
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Accepted to COLM 2026
Abstract:Real-world molecular design remains challenging for large language model (LLM)-based agents. It requires them to interpret design contexts, satisfy multiple constraints, identify infeasible specifications, and reason over multi-step tool outputs. Existing benchmarks do not capture this complexity, focusing instead on explicit and narrow constraints, only feasible problems, and single-path solutions. To address this gap, we propose MolDesignBench, a scenario-grounded benchmark that more closely reflects real-world molecular design for evaluating tool-augmented LLM agents. MolDesignBench comprises 2K generation and optimization instances that combine implicit requirements embedded in design narratives with explicit property and functional-group constraints, including infeasible cases, and require the effective use of 17 specialized chemistry tools. Experiments across diverse frontier LLMs reveal low success rates–with the best achieving only \sim43 %–and frequent failures in implicit-constraint reasoning, infeasibility detection, and tool reasoning. The corresponding fine-grained failure-mode analysis identifies implicit constraint interpretation and infeasibility detection as the primary bottlenecks, establishing MolDesignBench as a rigorous testbed to guide future research on chemical agents. The benchmark, tool interface, and evaluation code are publicly available.
[AI-61] Evolving Inspectable O-RAN Slicing xApps with LLM s
链接: https://arxiv.org/abs/2609.27337
作者: Faezeh Dehghan Tarzjani,Bhaskar Krishnamachari
类目: ystems and Control (eess.SY); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Open RAN (O-RAN) slicing xApps must adapt resource allocations to changing channel conditions and traffic demands while meeting service-level agreements (SLAs). Deep reinforcement learning can produce adaptive policies, but their allocation rules remain encoded in neural-network parameters. Our goal is to retain this adaptability while making the controller’s decision logic directly inspectable and editable by operators. We use a large language model (LLM) to evolve slicing controllers as compact Python programs whose decision logic remains readable and editable after optimization. The LLM proposes and revises candidates offline, while a calibrated simulator scores them, and the selected decision module runs unchanged in the O-RAN control path. On the NSF POWDER 5G testbed, the evolved controller releases resources from a guaranteed slice whose throughput target becomes unattainable under a sustained channel fade, improving best-effort throughput from 158.2 to 228.6 Mbps, a 44.5% gain over the best static allocation. Since the controllers are readable source code, their behavior can be predicted from their equations, defects can be diagnosed by reading the code, and calibration errors can be corrected with one-line edits, reducing SLA misses from 79.9% to 2.2% in one case and more than doubling fitness in another. In a four-slice trace-driven simulation calibrated to the same testbed, evolutionary search achieves higher average evaluation scores than independent prompting at a matched proposal budget, with mean normalized gains on held-out traces of 16.3% for prompting alone, 32.1% for evolution from scratch, and 51.0% for evolution from a starting program.
[AI-62] CART: Closed-Loop Adaptive Red Teaming for Large Language Models
链接: https://arxiv.org/abs/2609.27336
作者: Dongdong Zhang,Tengchao Lv,Yilin Jia,Yuzhong Zhao,Yupan Huang,Wenshan Wu,Xiangyang Zhou,Shaohan Huang,Nan Yang,Li Dong,Lei Cui,Furu Wei
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Automated red teaming often replays a fixed set of prompts, which measures known risks but cannot learn from failures found during testing. We present CART (Closed-Loop Adaptive Red Teaming), a framework that uses each result to guide what it tests next. CART begins with broad risk coverage, follows weaknesses that emerge, keeps new probes diverse, and records the evidence and source of every finding. It separates the Challenger that creates tests, the Target being tested, which may be a text-only model or a bounded tool-using agent, and the Judge that evaluates the results, allowing these roles to be studied independently. Across three evaluation families (Frontier, JAH, and Agentic), CART discovers more failures and higher average risk than static seed replay for every Target with an available baseline. The gains extend to tool-mediated agent tests, suggesting that contextual adaptation can reveal weaknesses that direct prompt replay does not exercise. These results describe what the test policies discover, not how often failures occur in real deployments. We also find that Challenger-Judge choices affect the evidence uncovered, highlighting the need for role separation and independent review. Overall, CART turns red teaming from a one-time checklist into a continuous, adaptive, and auditable search for model and agent weaknesses.
[AI-63] Just-in-Time Memory: Learning to Curate Task-Adaptive Memory for LLM Agents
链接: https://arxiv.org/abs/2609.27334
作者: Yefan Zhou,Yang Li,Zeyu Leo Liu,Semih Yavuz,Shafiq Joty
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Agentic memory systems reuse past experience to improve future performance, yet most existing designs curate memory at write time: once a task is completed, its trajectory is distilled into a fixed artifact, such as a reflection, workflow, skill, or reasoning strategy, that is later retrieved by similarity. This forces the system to decide what is worth remembering before the future query is known, irreversibly discarding information and producing a query-independent summary that must serve many possible downstream tasks. Learning such a write-time curator is also difficult because the value of a storage decision may only become apparent when a relevant query arrives, potentially many tasks later, creating a long-horizon credit-assignment problem. We instead retain raw trajectories and defer curation until read time, when the current task is known. Given the retrieved traces and the new task, a memory curator synthesizes a compact, task-adaptive payload tailored to the immediate need. Because this payload is consumed on the same task, the curator can be trained directly from immediate task success, avoiding delayed utility signals and the need to artificially group related tasks. Across ALFWorld, WebShop, and \tau^2 -bench, our Just-in-Time Memory (JitMem) consistently outperforms no-memory agents as well as heuristic and learned write-time memory methods, improving over the strongest baseline by 16.2, 16.3, and 3.9 absolute success-rate points, respectively. Notably, even an untrained curator is already competitive with or surpasses these baselines, showing that task-adaptive read-time curation itself is a major source of the gain; training the curator further compounds the improvement.
[AI-64] Alignment Inertia: Auditing the Durability of Training Data Influence Through Policy Override Resistance
链接: https://arxiv.org/abs/2609.27333
作者: Renata Barreto,Markelle Roesti,Mohammad Tahaei
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Platform operators increasingly rely on system prompts and fine-tuning to govern model behavior, yet it remains unclear how reliably these interventions override behavior inherited from prior training. We propose Override Success Rate (OSR) and alignment inertia to measure when operator interventions succeed or fail to change prior behavior. We evaluate zero-shot prompting and LoRA fine-tuning across Llama and Mistral in medical misinformation and hate speech. Alignment inertia persists across both models but varies by model, domain, and policy direction. Notably, in Mistral’s restrictive hate-speech condition, LoRA increased inertia by 46.5 percentage points, showing that fine-tuning can reinforce rather than override prior behavior. We also use TRAK to test whether inertia is associated with weaker adaptation signals. TRAK achieves AUC of at least 0.85 in 7 of 8 conditions and outperforms model confidence, TF-IDF similarity, and embedding similarity as a predictor of inertia. These results provide an operator-facing audit of where prior training constrains downstream model governance.
[AI-65] Stable Geometry with Divergent Task Evidence for Efficient Long-Horizon Agent Compression
链接: https://arxiv.org/abs/2609.27332
作者: Mingxuan Wang,Fei Luo,Bo Wang,Guorun Yao,Yinglong Guo,Chao Ning,Hongyue Chen,Yanbiao Ma,Jungong Han
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Long horizon agents accumulate growing interaction histories that increase context and inference costs. We find that geometric redundancy alone is an insufficient criterion for safe compression. Although agent histories exhibit strong low dimensional structure, similar global geometry can preserve very different amounts of task evidence. At identical retained block counts, evidence aware selection raises next action Top 3 retention from 0.31 to 0.69, while centroid similarity remains 0.98. Controlled replacement further shows that action related information can be substantially altered while global geometric measures remain nearly unchanged. Motivated by this gap between geometry and evidence, we introduce Geometry Guided Evidence Preserving Memory (GEM), a training free compressor that protects task and execution evidence before using geometric residuals to complete coverage. GEM reduces mean combined token usage from 2.69M to 2.11M per task, a 21.4% reduction, while maintaining comparable task reward. Our results show that efficient agent history compression should optimize for preserved task evidence rather than geometric coverage alone.
[AI-66] urning Safety into Competence: Minimally Exploitable Robot Policies via Safety-Filtered Reinforcement Learning
链接: https://arxiv.org/abs/2609.27312
作者: Ruihan Wu,Rui Yang,Donggeon David Oh,Duy Nguyen,Haimin Hu
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Systems and Control (eess.SY)
备注: 8 pages, 4 figures
Abstract:Robots deployed for competitive tasks must outmaneuver their opponents without sacrificing safety. Existing approaches, including safe reinforcement learning (RL), train a single policy to achieve task success and avoid failures simultaneously. This coupling can complicate training and leave the learned policy exploitable by deliberate attacks. We propose Safety to Competence (S2C), a two-stage RL framework that separates safety synthesis from competitive task learning. We formulate competitive interactions as safety-critical Markov games and prove that perfect filtering preserves policy non-exploitability when all players commit to safe maneuvers. S2C learns a robust safety filter via adversarial RL, embeds it in the environment during task policy training, and retains the same filter at deployment. In simulated touchdown games, S2C outperforms eight safe RL baselines, achieving the highest win rate and Elo rating, and the lowest exploitability. Hardware stress tests against a human opponent confirm S2C’s competence.
[AI-67] Multi-View Fusion for Encrypted C2 Detection: A Leakage-Controlled Measurement Study of Evaluation Pitfalls
链接: https://arxiv.org/abs/2609.27311
作者: Hoang-Huy Nguyen-Huu,Van-Tri Phan,Khuong Nguyen-An
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注: Accepted for presentation at the 2026 ASIAN Conference on Communication and Networks (ASIANComNet 2026), Hanoi, Vietnam, October 11-14, 2026
Abstract:Command-and-control (C2) traffic increasingly hides within TLS, so defenders now apply machine learning to traffic metadata. Many studies assume that combining two metadata views, namely flow statistics and TLS handshake fingerprints, improves both accuracy and robustness. We tested this assumption on 17,577 TLS flows from 62 real Cobalt Strike captures. Our evaluation removes the data leakage that leads to overly optimistic reported scores. We report three findings that matter more than the fusion result itself. First, an incorrect preprocessing step increases the F1 score by 0.28. This step computes the frequency encoding across the entire dataset rather than within each cross-validation fold. The increase is about ten times larger than any real effect we measured. Second, both the labels and the behavioral features depend on the destination address. Because of this, the 17,577 flows form only 2,132 independent groups, and the positive rate of 55.1%, which looks balanced, drops to 4.2%. Therefore, class balance is just a result of how we analyze the data, specifically whether we count flows or endpoints, and not a real feature of the task. Third, 20 of the 62 captures (32%) have no TLS flows to any known C2 address, so they contain only benign samples. We checked these captures directly and confirmed that this is a gap in the ground truth, not a labeling error. In this context, fusion beats the best single view by only 0.022 in F1. When an attacker forges both feature surfaces simultaneously, every model performs worse than a simple baseline that always predicts positive (F1 = 0.711). For encrypted C2 detection, the evaluation design is not a preliminary step. It \emphis the main result.
[AI-68] Learn How to Act from Your Own Interactions: On-Policy Self-Distillation for GUI Agents
链接: https://arxiv.org/abs/2609.27307
作者: Yan Zhang,Daiqing Wu,Huawen Shen,Liang Li,Gang Cao,Zhi Gong,Wei Dai,Xiaode Zhang,Can Ma,Yu Zhou
类目: Artificial Intelligence (cs.AI)
备注: Under Review
Abstract:Graphical User Interface (GUI) agents enable the fulfillment of complex user instructions through multi-turn interactions with software environments, requiring step-wise reasoning and long-horizon memory to guide actions and retain task-relevant information, respectively. Recent on-policy self-distillation (OPSD) methods have achieved strong performance on GUI grounding, a foundational subtask for GUI agents, owing to dense token-level supervision from privilege-conditioned self-teachers. However, extending existing OPSD methods to multi-turn GUI agents is hindered by self-teachers’ limited privilege-following ability and insufficient privileged guidance. In this paper, we introduce GUI-SD-v2, the next version of GUI-SD, which extends OPSD from GUI grounding to multi-turn GUI interaction and addresses key limitations through a two-stage training framework. Specifically, GUI-SD-v2 first strengthens privilege following by jointly optimizing rollouts with and without privileged guidance from the same GUI states. Furthermore, it selectively distills step-specific reasoning and memory guidance through a privilege-conditioned self-teacher, supporting action decisions and the retention of task-relevant information for subsequent interactions. Extensive experiments on two representative GUI agent benchmarks, AndroidWorld and MobileWorld, show that GUI-SD-v2 compares favorably with existing OPSD baselines while consistently outperforming the evaluated state-of-the-art methods in both Pass@1 and Pass@3 success rates. Code and training data will be publicly released.
[AI-69] StateComp: Learning When to Compress History in Long Horizon Agents
链接: https://arxiv.org/abs/2609.27298
作者: Mingxuan Wang,Hongyue Chen,Yinglong Guo,Fei Luo,Chao Ning,Bo Wang,Guorun Yao,Yanbiao Ma,Jungong Han
类目: Artificial Intelligence (cs.AI)
备注: 33 pages
Abstract:Long-horizon agents continuously accumulate interaction history during task execution, yet the importance of past interactions changes as the agent state evolves. Existing context management methods largely compress history based on fixed windows, periodic schedules, or current relevance, overlooking a more fundamental question: when has a past interaction become safe to replace? Premature compression may remove information still needed for future actions, while overly conservative retention leads to substantial context overhead. To address this, we propose State Conditioned Compression (StateComp), a framework that determines when historical interactions can be safely compressed according to the current agent state. StateComp constructs KEEP and READY supervision through a two-stage annotation procedure and trains an imbalance-aware router on hidden representations from a frozen language model. A bounded state representation further reduces the cost of evaluating long histories, while adjacent READY interactions are grouped into continuous spans and replaced with compact summaries during execution. Experiments on WorkBuddyBench show that StateComp reduces total agent and summarization tokens by 52.27% while maintaining task performance, and achieves a 12.67-fold speedup in representation extraction.
[AI-70] KITE: KV-Invariant Transformer Expansion for Efficient Agent ic LLM Scaling
链接: https://arxiv.org/abs/2609.27294
作者: Zhiheng Hu,Yixun Wei,Jian Zhou,Yizhuang Zhou,Ji Li,Xing Chen,Yang Li,Bojun Wang,Yibo Zhu,Xiangyu Zhang,Daxin Jiang
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Scaling a language model is not only a question of final quality: the architectural choice determines how much computation is spent during training, prompt processing, and autoregressive decoding to achieve certain model quality. An ideal model architecture should lower all above computation costs to facilitate scaling to a larger model, while ensure the larger model indeed outperforms smaller baselines. We introduce KV-Invariant Transformer Expansion (KITE), a scaling paradigm that achieves this goal. It trains the model from a smaller size to a larger size (i.e., saving training costs via upcycling), while places newly added parameters in regions that do not affect attention KV. Consequently, during inference, prefilling KV only relies on the smaller part of the model, so the inference costs are saved. As a concrete instantiation, we present Step Scale Transformer (SST), a two-tower decoder in which one tower produces KV and the other reads them. At comparable cumulative training compute, SST, a 67B MoE model with 2.15B active body parameters per decode token, achieves lower training loss than 47B and 63B MoE Transformers with 1.48B and 2.02B active body parameters, respectively, while reducing estimated inference cost by 6.7% and 31.6%.
[AI-71] Sparse-Observation Atmospheric Thermal Forecasting with Physics-Informed Neural Networks for Climate-Aware Digital Twins
链接: https://arxiv.org/abs/2609.27290
作者: Tannaz Goodarzvand Chegini,Elyas Shivanian,Behzad Karimi,Faraz Dadgostari
类目: Artificial Intelligence (cs.AI); Analysis of PDEs (math.AP); Numerical Analysis (math.NA)
备注:
Abstract:Short-horizon forecasts of atmospheric temperature are needed to support climate-aware digital-twin systems, but such forecasts must be produced where thermal observations are incomplete. This study evaluates a physics-informed neural network for potential-temperature forecasting, constrained by a pressure-coordinate thermodynamic advection-source equation and a diabatic-source closure fit from the preceding 12-hour period and frozen before future-time training. Using hourly ERA5 reanalysis at three pressure levels, the model is evaluated as a conditional hindcast at lead times of one, two and three hours against persistence, local-trend, and two matched neural-network baselines, one of which receives the same future meteorological forcing as the PINN, helping distinguish the physical constraint from access to future forcing. In an Oklahoma development case, mean RMSE improvement over the strongest baseline grew from 8.1% at one hour to 23.8% at three hours; under an observation-density sweep down to 5% of candidate locations, this 3-hour advantage remained 14.6–16.9%, with no evidence that lower density improves performance. Under a fixed protocol transferred to an Alabama heat event with three virtual-observation layouts, three-hour improvement ranged 19.7-24.4% with consistent origin-level wins. A parallel Montana stress test, in which fixed pressure levels intersected complex terrain, produced a three-hour degradation of roughly 17.5%, identifying a terrain-related applicability limit of the formulation. Together, these results indicate that the physics constraint’s benefit grows with forecast horizon, persists under severe observation sparsity, and transfers across regions, but is bounded by the validity of a fixed vertical-coordinate representation over complex terrain, evidence relevant to physics-constrained components of climate-aware forecasting and digital-twin systems.
[AI-72] PotARCin: Multi-Dimensional Evaluation of Skill Acquisition in Abstract Reasoning Tasks
链接: https://arxiv.org/abs/2609.27288
作者: Claas Beger,Ryan Yi,Melanie Mitchell
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:The Abstraction and Reasoning Corpus (ARC) has become a prominent benchmark for evaluating general abstract reasoning and fluid intelligence in AI models. Yet standard ARC evaluation considers only a single capability: producing the correct output grid for a test input. We argue that this narrow format fails to evaluate the diversity of abilities that genuine abstract skill acquisition should enable. We introduce PotARCin, a benchmark that extends ARC by assessing understanding of a task’s underlying abstract rule across five dimensions: Definition, Classification, Constrained Generation, Editing, and Inversion. PotARCin employs programmatic methods to generate new task instances and transform given inputs for a given ARC task, enabling dynamic generative sampling beyond fixed input-output pairs. Across five state-of-the-art models evaluated on the ARC-AGI-1 training set, we observe a 25-52 percentage-point performance gap between standard ARC evaluation and evaluation on PotARCin, and find that multi-dimensional evaluation reorders models that standard accuracy ranks alike. We further investigate effects of generative sampling, difficulty of corruption types, and questions of self-consistency, showing that models frequently contradict their own formalized rule even where they have stated it correctly. We also introduce P-ARC, a held-out hand-crafted test set, on which models achieve 1-8% accuracy across all five dimensions, underscoring the importance of more holistic evaluations of abstract reasoning capabilities.
[AI-73] Memory Control Signals Emerge Before Action in Long Horizon Agents
链接: https://arxiv.org/abs/2609.27286
作者: Mingxuan Wang,Guorun Yao,Fei Luo,Yinglong Guo,Chao Ning,Bo Wang,Hongyue Chen,Yanbiao Ma,Jungong Han
类目: Artificial Intelligence (cs.AI)
备注: 35 pages
Abstract:Long horizon language model agents continuously accumulate interaction history, increasing computational cost while making relevant information harder to preserve and reuse. Existing context management methods mainly focus on how to compress or retrieve history, but largely leave open whether the model itself already represents the need for these memory operations before they occur. We study the hidden state immediately before each agent action and find that compression and recall needs are already encoded in the model’s internal representations. These signals cannot be explained by simple context length or interaction progress, and they exhibit distinct formation patterns across model depth. We further show that most memory decision information is preserved in a compact recent context, while selectively restored historical evidence complements the long range dependencies that recent context misses. Based on these findings, we propose Preaction Memory with Evidence Retrieval (PaMER), which combines state guided compression with external evidence retrieval. PaMER+ further introduces step level evidence selection to recover only the historical information required by the current task. Experiments on WorkBuddyBench, across multiple context management baselines and model backbones, show that our framework substantially reduces context consumption while maintaining competitive task performance.
[AI-74] Hunyuan-A13B Technical Report
链接: https://arxiv.org/abs/2609.27284
作者: Tencent Hunyuan Team,Ao Liu,Botong Zhou,Can Xu,Chayse Zhou,ChenChen Zhang,Chengcheng Xu,Chenhao Wang,Decheng Wu,Dengpeng Wu,Dian Jiao,Dong Du,Dong Wang,Feng Zhang,Fengzong Lian,Guanghui Xu,Guanwei Zhang,Hai Wang,Haipeng Luo,Han Hu,Huilin Xu,Jiajia Wu,Jianchen Zhu,Jianfeng Yan,Jiaqi Zhu,Jihong Zhang,Jinbao Xue,Jun Xia,Junqiang Zheng,Kai Liu,Kai Zhang,Kai Zheng,Kejiao Li,Keyao Wang,Lan Jiang,Lixin Liu,Lulu Wu,Mengyuan Huang,Peijie Yu,Peiqi Wang,Qian Wang,Qianbiao Xiang,Qibin Liu,Qingfeng Sun,Richard Guo,Ruobing Xie,Saiyong Yang,Shaohua Chen,Shihui Hu,Shuai Li,Shuaipeng Li,Shuang Chen,Suncong Zheng,Tao Yang,Tian Zhang,Tinghao Yu,Weidong Han,Weijie Liu,Weijin Zhou,Weikang Wang,Wesleye Chen,Xiao Feng,Xiaoqin Ren,Xingwu Sun,Xiong Kuang,Xuemeng Huang,Xun Cao,Yanfeng Chen,Yang Du,Zhen Yang,Yangyu Tao,Yaping Deng,Yi Shen,Yigeng Hong,Yiqi Chen
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:We present Hunyuan-A13B, an open-source large language model based on a Mixture-of-Experts architecture. It contains 80 billion total parameters but activates only 13 billion during inference, balancing model capability, computational efficiency, and deployment cost. The model is pretrained on a rigorously filtered 20T-token corpus with enhanced STEM data curation, improving factual reliability and reasoning ability. High-quality supervised fine-tuning and large-scale reinforcement learning further enhance its overall performance. Hunyuan-A13B also introduces a dual-mode Chain-of-Thought framework that adapts reasoning depth to task complexity: fast thinking for routine queries and slow thinking for complex, multi-step problems. Evaluations show competitive performance across mathematics, science, programming, general language understanding, and agent tasks, often approaching that of much larger models. Its high inference throughput makes it suitable for latency-sensitive applications. We release Hunyuan-A13B to support open research and practical LLM deployment.
[AI-75] meEvo: Failure-Driven Self-Evolution of a Time Series Agent
链接: https://arxiv.org/abs/2609.27277
作者: Jie Yang,Yan Zheng,Jiarui Sun,Xiran Fan,Junpeng Wang,Liang Wang,Zelin Xu,Qinghua Liu,Zhengyu Fang,Yiwei Cai,Philip S. Yu
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Time series agents answer analytical questions by calling external tools, and which tools they carry is decided by people before the agent runs. However, we identify two failures in this setup. Human-Agent Tool Misalignment: a library of 21 expert-curated tools helps on some tasks and hurts on others, dropping anomaly accuracy under every backbone we test. Silent Harm: one round of generic self-revision changes 147 answers and breaks 56 of them, while the final score moves by less than a point. Both follow from the same gap: whether a tool helps is decided question by question at runtime, while tools are supplied in advance and judged by a single average. To address this, we propose TimeEvo, which clusters an agent’s diagnosed failures into capability gaps, plans a measurement for each, synthesizes evidence-only tools that fill them, and admits the candidate library only through a paired admission gate. Experiments on ten time series QA tasks and three backbones show that TimeEvo, starting from an empty library, improves accuracy on every task and every backbone, and that a library grown on a cheap model still gains when it is installed into stronger ones. Code is available at this https URL.
[AI-76] DRSR: Learning Set-Level Deletion Risk for Efficient Long-Horizon Agents
链接: https://arxiv.org/abs/2609.27276
作者: Mingxuan Wang,Bo Wang,Fei Luo,Guorun Yao,Chao Ning,Yinglong Guo,Hongyue Chen,Yanbiao Ma,Jungong Han
类目: Artificial Intelligence (cs.AI)
备注: 34 pages
Abstract:Long-horizon language-model agents accumulate reasoning traces, tool exchanges, and observations whose relevance changes with the current decision. Existing compression strategies often score historical units independently, but the safety of deleting several units is generally not determined by their singleton scores: redundant evidence, accumulated small effects, and the information that remains after deletion all matter. We introduce Direct Relational Set-Risk Pruning (DRSR), which formulates agent-history compression as risk-constrained selection over deletion sets. Offline, DRSR constructs exact counterfactual supervision by jointly deleting protocol-valid history Blocks and measuring the change in teacher-forced likelihood of the same recorded next output. A lightweight scorer then predicts set-level harm from online-visible relations between candidate history and the current pre-action state, together with deleted-retained and pairwise set structure. At deployment, DRSR evaluates a small set of structurally valid deletion candidates with the lightweight scorer and removes the largest feasible set under recency, protocol, budget, and learned-risk constraints, abstaining when no set is sufficiently safe. On WorkBuddyBench Full260, DRSR increases mean reward from 0.699 to 0.802 while reducing total model tokens by 20.820%. On the fixed Eval40 comparison, it obtains 0.794 reward at 1.211M tokens per task, using 35.850% fewer tokens than the uncompressed agent. Mechanistic analyses and ablations further show that decision-conditioned relations, retained-context information, pair interactions, and abstention each contribute to reliable pruning.
[AI-77] he Risk-Sensitive Schrödinger Bridge: Is Not a KL Projection
链接: https://arxiv.org/abs/2609.27250
作者: Hamidreza Behjoo
类目: Information Theory (cs.IT); Artificial Intelligence (cs.AI)
备注:
Abstract:The Schrödinger bridge owes its computational power to a single structural fact: by Girsanov’s theorem the controlled problem is a Kullback–Leibler (KL) projection onto a fixed reference measure, solvable by alternating projections. This letter shows that the fact does not survive risk sensitivity. When the expected path cost is replaced by the entropic risk measure and both endpoint marginals are kept as hard constraints, the resulting fixed-point bridge value J_\theta (the soft-problem value at the multiplier that enforces the terminal constraint) admits no representation as a constrained KL minimum against any fixed path-space reference with a regular endpoint law (a class strictly larger than the uniformly elliptic diffusion references: no Markov property is required), even allowing an additive normalisation depending on the initial marginal. Moreover, no single reference generates the one-parameter family in the risk parameter. The obstruction is computed in closed form: the Gaussian bridge value violates, by exactly \theta/2 , a heat equation that any Gaussian smoothing of a fixed endpoint density must obey. In place of the projection, the theory rests on a terminal-multiplier fixed point and an asymmetric factorisation penalising the score energy of the backward factor.
[AI-78] Combining LLM s and Genetic Search for ARC-AGI-2
链接: https://arxiv.org/abs/2609.27242
作者: Val Dyachenko
类目: Neural and Evolutionary Computing (cs.NE); Artificial Intelligence (cs.AI)
备注:
Abstract:LLMs can generate programs for ARC-AGI-2 tasks, but the provided compute only allows a small number of attempts to generate, debug and validate solutions. Genetic algorithms can search and test many more programs, but random search rarely starts in a useful neighborhood of the solution space. We combine the two methods through a compact domain specific language (DSL). First, a quantized Qwen3.5-4B LLM generates an initial set of programs for each ARCAGI-2 task. Then, we use those programs to seed an initial population of starting programs, and use genetic algorithms to evolve these programs towards a solution to the given task. The DSL is designed such that every mutated program remains valid and can be executed. The initial programs proposed by the LLM solve 2 (3.3%) of the first 60 tasks of the ARC-2 public evaluation set. The genetic algorithm solves an additional 4, giving 6 correct test outputs in total (10.0%). If we try using evolving solutions without this LLM seeding, we do not arrive at any solutions at all. The results show that genetic search can improve programs generated by LLMs and produce additional correct solutions.
[AI-79] KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators
链接: https://arxiv.org/abs/2609.27216
作者: Shengyu Yan,Jasmin Jelovica
类目: Computational Engineering, Finance, and Science (cs.CE); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Numerical Analysis (math.NA)
备注: 32 pages, 24 figures, 7 tables
Abstract:Topology optimization (TO) remains computationally intensive due to repeated finite element analysis (FEA) evaluations required at each iteration. While neural network-based surrogates offer potential acceleration, existing approaches often suffer from gradient inconsistency between predicted objectives and sensitivities, leading to optimization instability. This work presents KATOsuper, an objective-agnostic framework that couples neural-reparameterized topology optimization with a Sensitivity-Consistent Fourier Neural Operator (SC-FNO). The framework employs the forward_split architecture, which derives deployed sensitivities via automatic differentiation through the predicted objective field and thereby preserves consistency between the predicted objective and the gradient used for optimization. The case studies include three 2D benchmark problems and three 3D structures considering compliance or stress minimization. A physics-informed multi-channel input encoding with Fourier position embedding enables resolution-invariant learning, supporting zero-shot extrapolation beyond the training resolution, with useful performance at moderate scaling factors and topology-preserving exploration at up to 64x without retraining. The framework extends to 3D through KATO3D, featuring novel KANConv3D blocks with learnable B-spline activations. KATOsuper demonstrates 15–110x deployment-time speedup over MATLAB baselines while maintaining competitive optimality, with the clearest gains observed in complex 3D and stress-optimization cases. The insight that sensitivity direction matters more than magnitude enables robust optimization even with approximate physics evaluation, extensible to other differentiable physics-driven design objectives.
[AI-80] Scalable Subgraph Sampling via Resistance Curvature
链接: https://arxiv.org/abs/2609.27209
作者: Chaoqun Fei,Tinglve Zhou,Tianyong Hao,Yangyang Li
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Subgraph sampling reduces the training cost of large-scale graph neural networks, but sampling criteria may overlook the geometric roles of edges. We propose a resistance-curvature-guided sampling framework built on ERC-LG, a curvature approximation method for large-scale graphs. ERC-LG combines Johnson-Lindenstrauss projections with regularized multi-GPU batched conjugate gradient solvers, avoiding explicit Laplacian pseudoinverse computation and full embedding storage. The resulting curvature informs node- and edge-sampling probabilities for constructing GNN training subgraphs. Experiments show numerical agreement with pseudoinverse-based curvature and reduced runtime compared with CG-only computation. ERC-LG-based sampling variants achieve the highest mean accuracy on six of seven real-world datasets in downstream node classification.
[AI-81] XLOG: A CUDA-Native Engine for Neurosymbolic Integration
链接: https://arxiv.org/abs/2609.27203
作者: Levi Dubrovin,Nikita Pospelov,Kirill Sabitov
类目: Artificial Intelligence (cs.AI)
备注: 31 pages
Abstract:xlog is a CUDA-native logic programming engine integrating neural perception with deterministic Datalog, probabilistic inference, and epistemic world views through a typed frontend and provider-owned CUDA runtime. Its reasoning modes share device data planes, but their execution boundaries differ: ordinary Datalog and exact inference are host-orchestrated, while certified resident recursive and Monte Carlo sampled cores record zero tracked host-device transfers before a bounded terminal receipt. The probabilistic path supports end-to-end gradients through GPU knowledge compilation from provenance to CNF to Decision-DNNF, exact weighted model counting, and backward gradients. A final smoothed circuit is certified against its source formula before caching or evaluation. Circuit caching yields a 2.74x MNIST-addition training speedup; a worst-case-optimal join subsystem yields a 27.96x geometric-mean gain over xlog’s binary-join baseline. MNIST-addition accuracy matches Scallop’s (0.9561 versus 0.9468), but no per-epoch speed claim is made because baseline epoch time varies with CPU quota. In five hub-skewed triangle-counting cases, the Souffle-to-fused-xlog execution-time ratio rises from 0.88x at 150k edges, where Souffle is faster, to 5.54x at 1.2M; fused peak device allocations are 85-1,033 MB versus 3,287-44,979 MB for the materializing arm. Exact inference is correctness-equivalent to but slower than ProbLog2. On a public video benchmark, a proximity predicate trained only through symbolic credit replaces hand-set geometry at unchanged held-out accuracy; within Event-Calculus rule search it fails ten-fold cross-validation and does not transfer on a leak-free split. On a maritime corpus, weighted clauses beat crisp selection by 0.065 F1, with the result reproduced by one chronological training pass.
[AI-82] Enhancing Small Language Models for Power Outage Report Generation via Minimum Risk Training
链接: https://arxiv.org/abs/2609.27197
作者: Hung Phan,Waqwoya Abebe,Youssef Hussein,Supriya Chinthavali,Dalton Lunga,Ali Jannesari
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Minimum Risk Training (MRT) enables neural machine translation models to directly optimize sequence-level evaluation metrics instead of relying only on token- level maximum-likelihood objectives Shen et al. [2016]. Although introduced a decade ago, recent work shows renewed potential for risk-based optimization in modern language models Yang et al. [2024], Jinnai et al. [2025]. We apply MRT to power outage report generation for the Outage Data Initiative Nationwide (ODIN), transforming heterogeneous reports into standardized XML compliant with CIM IEC 61968-3. Our MRT approach improves Qwen2.5-7B-Instruct overall accuracy from 16.20% to 68.95%, demonstrating the effectiveness of sequence- level optimization for domain-specific structured generation
[AI-83] he Like Trap: Multi-Stage Poisoning against Agents in Similarity-based Recommendation Systems
链接: https://arxiv.org/abs/2609.27155
作者: Yue Xing,Pengfei He,Zitao Li
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Machine Learning (stat.ML)
备注:
Abstract:With recent advancements in large language models (LLMs) and LLM-based agents, these agents are becoming increasingly autonomous and gaining broader access to act on users’ behalf on the internet. However, the vulnerability of automated agents deployed on social media platforms (e.g., for managing a user’s personal account) remains underexplored. Existing studies on agent poisoning typically assume that the adversary can expose poisoned content to the agent. Although such an attack is direct and effective, it is more easily detected and mitigated. In the context of social media platforms, this leaves open whether the recommendation system itself would surface such content to the agent in a more subtle manner. Through theoretical analysis, we show that the like-score mechanism used in OASIS can be exploited, and we characterize the conditions under which a multi-stage chain of poisoned posts can steer the agent’s feed. Based on these insights, we further develop an algorithm that crafts realistic poisoned posts. Experiments support our theoretical findings and demonstrate the effectiveness of the proposed algorithm. Notably, by exploiting the like-score feedback loop, the attack causes the recommendation system to select poisoned posts even when their user-post similarity falls below the retrieval threshold.
[AI-84] Do We Need Complex Topology Control? Distinct-Peer Random Routing Improves Cost-Efficiency in Sparse Multi-Agent Debate
链接: https://arxiv.org/abs/2609.27150
作者: Boxuan Wang,Zhuoyun Li,Xiaowei Huang,Yi Dong
类目: Artificial Intelligence (cs.AI)
备注: Pre-print
Abstract:Multi-agent debate (MAD) has emerged as a promising paradigm for improving the reasoning accuracy of large language models (LLMs) through iterative peer interaction. Communication topology plays a central role in this process, motivating increasingly sophisticated mechanisms that learn, adapt, or dynamically reconfigure agent interactions to improve accuracy or reasoning reliability. Meanwhile, prior studies suggest that much simpler sparse communication can already achieve competitive performance at substantially lower cost. In this work, we take a closer look at sparse MAD and ask whether complex topology control is actually necessary to improve collective reasoning. We find that a simple random-without-replacement routing policy, which lets each agent debate with two distinct and newly sampled peers at every round, provides a surprisingly strong baseline and consistently improves the accuracy-cost trade-off of sparse MAD. Building on this observation, we further study deliberation stopping and show that lightweight stopping can substantially reduce inference cost while preserving competitive accuracy. Our results suggest that sophisticated topology control such as learned topology adaption should be evaluated against strong simple routing and stopping baselines before its additional complexity is justified.
[AI-85] When Clients Are Orchestrated: Strategic Gradient Manipulation to Defeat Federated Learning Servers with Efficient Defense
链接: https://arxiv.org/abs/2609.27124
作者: Mohamed Shaaban,Ahmed Abdelnaby,Mohamed Elmahallawy
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注:
Abstract:Federated Learning enables decentralized model training by exchanging model updates–rather than raw data–with a central parameter server (PS). While most of the existing defenses primarily assume static or independently acting adversaries, we reveal a new class of dynamically adaptive attacks that systematically bypass such protections. We propose Fed-ADR, a holistic attack framework in which a malicious orchestrator server (OS) dynamically coordinates a heterogeneous set of adversarial clients, including both targeted and untargeted attackers. Through real-time coordination by the OS, malicious clients strategically adapt their gradient updates to evade defenses deployed by the PS, while either severely degrading global model performance or steering training toward adversarial this http URL mitigate this threat, we offer a detection mechanism that estimates each client’s true gradient from historical updates, enabling real-time detection of coordinated malicious behavior without additional overhead. We further introduce an in-situ recovery mechanism that restores global model performance without restarting training, preserving convergence and minimizing recovery time. Comprehensive experiments on MNIST, Fashion-MNIST, and CIFAR-10 benchmark datasets demonstrate that Fed-ADR’s attack scheme can reduce global accuracy from over 90% to below 10%, bypassing several state-of-the-art defenses. When our detection and recovery modules are employed, they identify malicious clients and restore accuracy to over 90% within a few rounds, at a substantially lower cost than retraining from scratch–achieving a reduction of at least 20x in computational overhead.
[AI-86] Provably Complete Generalized Planning with LLM s
链接: https://arxiv.org/abs/2609.27105
作者: Katharina Stein,Chaahat Jain,Jörg Hoffmann,Alexander Koller
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Generalized planning aims to compute a plan that solves all instances of a planning domain. Recent work has used LLMs to automatically generate and debug such generalized plans in the form of Python programs and achieved perfect test data coverage for several domains. However, whether these generalized plans are actually complete, i.e. solve all instances of the domain, could only be determined by manual evaluation. Here, we present an approach for automatically generating generalized plans in Lean together with proofs of their completeness relative to a specification of the domain constraints provided as input. We introduce a semantic-preserving PDDL-to-Lean conversion, and use an LLM to generate both the generalized plan and the formal proof that it solves every instance satisfying the domain constraints. The correctness of the completeness proof is determined by Lean’s kernel. We evaluate our approach on 13 commonly used benchmark domains, using GPT-5.6-Sol as the LLM. For 12 of the domains we obtain generalized plans together with valid completeness proofs. This is a major advancement of the state of the art in automatic generalized-plan completeness proofs.
[AI-87] Intelligence Across Embodiments
链接: https://arxiv.org/abs/2609.27095
作者: Bo Ai,Henrik I. Christensen,Hao Su
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Accepted to the International Symposium of Robotics Research (ISRR) 2026
Abstract:Robotic embodiment encompasses the sensing, kinematics, dynamics, geometry, actuation, and control through which an agent physically interacts with the world. These properties vary across robots and change over time. We argue that general embodied intelligence requires learning that accumulates across these differences. Prevailing methods that engineer correspondences to bridge embodiment differences offer immediate practical gains, but their assumptions limit the scope of transfer in the long run. Instead, a more general approach should discover representations that support transfer to a larger range of embodiments as experience grows. We propose embodiment diversity as a promising axis of scaling, and identify broad learned priors as a complementary ingredient. We call for evaluations that better characterize embodiment gaps and transfer performance. More broadly, cross-embodiment learning connects the practical challenge of learning from heterogeneous robot experience with a broader scientific pursuit inspired by nature - physical intelligence that adapts and co-evolves with its embodiments to gain agency over its behavior and physical forms.
[AI-88] Local Evidence and Geometric Readout Repair in Trained GNNs
链接: https://arxiv.org/abs/2609.27092
作者: Nadi Tomeh,Hugo Attali
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: MLG 2026
Abstract:Many node-classification GNNs apply a linear classifier to a nonnegative mixture of local messages. An error can reflect either poor mixture weights or a reachable logit set poorly positioned for the classifier. We separate these causes with an exact-mass linear program and two learned post-hoc repairs. Every reweighted prediction has an equivalent centered logit translation, but only translations in a message-induced displacement set are realizable by reweighting. Across eight datasets, eight GNN backbones, and ten splits, mean accuracy rises from 62.6% for the frozen models to 63.8% with reweighting and 65.3% with set-conditioned translation. A parameter-matched node-only translator reaches 64.6%, showing that translation explains most of the gain while the message set supplies a smaller additional benefit. Although oracle reweighting can correct many errors, label-free reweighting captures little of this potential: local evidence is often present but hard to select, and relaxing the evidence constraint is more effective than learning within it.
[AI-89] Policy-as-Skill: Governed LLM Decision Support with Evidence Deterministic Control and Audit
链接: https://arxiv.org/abs/2609.27087
作者: Kabeh Mohsenzadegan,Vahid Tavakkoli,Kyandoghere Kyamakya
类目: Artificial Intelligence (cs.AI); Symbolic Computation (cs.SC)
备注:
Abstract:Organizations increasingly use LLMs for policy, compliance, risk, and operational decision support, requiring evidence validation, review routing, version control, and auditability. We introduce Policy-as-Skill (PaS), a modular runtime that packages these functions as executable, versioned policy capabilities. Thirteen methods are evaluated with a fixed Gemma4 backend on 600 development tasks. PaS+Audit achieves 53.8% exact accuracy, macro-F1 0.346, review F1 0.854, citation precision 1.000, policy-reference recall 0.984, and audit completeness 1.000, outperforming LLM+RAG on most governance and review metrics. Deterministic control raises aggregate accuracy to 61.2% but is strongly task dependent, supporting selective rather than universal rule-based intervention.
[AI-90] Crossflow: Prefill-Decode Elasticity for Agent ic LLM Serving
链接: https://arxiv.org/abs/2609.27085
作者: Yi Xu,Ehsan K. Ardestani,Wenyin Fu,Martin Schatz,Krishna Malladi,Zhan Shu,Adnan Aziz,Shobhit Kanaujia,Ajit Mathews,Chunqiang Tang
类目: Distributed, Parallel, and Cluster Computing (cs.DC); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:As serving capacity demand surpasses that of training, serving efficiency becomes increasingly important. Prefill-decode (P/D) disaggregation improves serving efficiency through specialization and isolation of the two phases. These benefits rest on a static partitioning. Phase demand, however, is not static. We observe that in a large LLM fleet the ratio of uncached input to output tokens has peak-to-mean ratios up to 4.7x at minute timescales, and that in a public agentic trace the hourly ratio spans a median 24.5x within a single day, while reassigning a replica takes tens of minutes. Agentic traffic sharpens the mismatch. Sizing each pool at its ninety-fifth percentile leaves up to 17% of cluster capacity unused; sizing below it converts the same imbalance into queueing and unrealized throughput. We present Crossflow, which makes this boundary elastic without changing node roles. Each decode node publishes a short-lived, revocable lease that bounds local-prefill compute, KV capacity, transfer work, and projected output. Across public and internal traces, Crossflow improves token throughput by 16.2-17.4% on geometric mean over static P/D, and by up to 43.4% at high load, while reducing mean TTFT at every evaluated point.
[AI-91] he Gaussian Is Enough: Flow-Matching Priors Do Not Help When Fine-Tuning Large Behavior Models
链接: https://arxiv.org/abs/2609.27070
作者: Chen Xu,Rishi Shah,Hadas Kress-Gazit,Haruki Nishimura,Masha Itkina
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Modern robot imitation learning increasingly relies on generative policies based on diffusion or flow-matching models, which generate actions by transforming samples from a prior distribution. A key question is whether the choice of prior matters. Replacing the standard Gaussian with a closer-to-target, non-Gaussian prior has been shown to substantially improve performance when training from scratch. A natural next step is to ask whether these gains transfer to fine-tuning pretrained Large Behavior Models (LBMs) such as LBM 1.0, \pi_0.5 , and GR00T~N1.5, where one might expect even larger gains. Surprisingly, we find that this is not the case, except possibly at very low fine-tuning data fractions. Across over 100K simulation rollouts spanning all three aforementioned LBMs on 40+ tasks in two simulation platforms, and 1250 hardware rollouts on five bimanual manipulation tasks, non-Gaussian priors that are demonstrably closer to the target yield statistically indistinguishable or worse fine-tuning performance than a standard Gaussian prior. Diagnostic analyses suggest why: fine-tuned imitation learning policies converge to similar action predictions across priors, despite their fine-tuned encoder embeddings diverging substantially from the pretrained embeddings and each other. A learning-rate ablation further confirms that encoder training is the dominant factor in fine-tuning performance, substantially outweighing the effect of prior choice. We conclude with concrete directions for future research on when and why learned priors might still matter in fine-tuning. Project page: this https URL
[AI-92] Propose Dont Judge: An Anytime-Valid Referee for LLM Agents That Mine Investment Factors
链接: https://arxiv.org/abs/2609.27051
作者: Bo Qu,Mingguang Chen,Licheng Wang
类目: Artificial Intelligence (cs.AI); Portfolio Management (q-fin.PM); Statistical Finance (q-fin.ST)
备注: 37 pages, 7 figures, 26 tables. JEL: G11, G14, C58
Abstract:Language-model agents now run the whole of quantitative factor research: they propose investment factors, backtest them, select the survivors and retire them. We ask which of those jobs an agent should keep. Our answer is governed self-evolution: the agent may propose, and a frozen statistical referee that the agent cannot touch must judge. The referee scores each candidate only on market outcomes revealed after submission, by betting, so its false-discovery guarantee holds at every stopping time for any proposal policy. We cross three proposers (a script, a bandit and a language model) with this referee and with three deliberately leaky ones, in a synthetic world with planted truth, a probe-authoring environment and a ten-year walk-forward on the CSI 500. Who judges sets the number of false admissions: the frozen referee admits 5-11 times fewer sub-threshold factors than the leaky referees under a scripted proposer, and no proposer closes that gap. Who proposes sets the yield: the language model beats the script, matches the bandit, and adds the one capability a bandit lacks, writing its own diagnostic probes. The certificate’s price is time: an admitted true factor waits about 500 trading days, and the certified portfolio’s Sharpe ratio therefore trails an ungated one. Judging belongs to the procedure; proposing and instrument-making belong to the agent.
[AI-93] Math Reasoning in LLM s is Organized by Approach Not Topic
链接: https://arxiv.org/abs/2609.27041
作者: Sajad Goudarzi,Samaneh Zamanifard,Moloud Nasiri,Hamed Rahimian
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Mathematical reasoning benchmarks are typically organized by topic, but language models may organize their internal computation by reusable reasoning approach instead. In this paper, we investigate whether open math-capable LLMs organize internally by topical sub-skill or by reasoning approach, and we present evidence that the approach is the key. We introduce a generation-replay protocol: a model first generates a solution, after which we replay the exact prompt-plus-generation trajectory and extract activation-importance signatures over the reasoning tokens. We cluster these signatures without supervision across eight models and five mathematical reasoning sources, then evaluate the recovered structure with structural, semantic, and intervention tests. Across all 40 model-source cells, the recovered clusters outperform matched-size random baselines. Two independent frontier-LLM judges find approach-level coherence in 77-82% of real clusters versus 6-11% in within-source controls, and topic-pure clusters usually receive labels finer than the topic itself. In approach-controlled prompting, changing the requested reasoning approach shifts cluster assignment in seven of eight model conditions, whereas paraphrases largely preserve it. These results indicate that math-capable LLMs organize internal mathematical computation by reasoning approach rather than benchmark topic. The implication is that topic-stratified benchmarks and topic-balanced training corpora can still miss the axis that matters: even deliberately topic-balanced corpora may remain imbalanced over reasoning approaches.
[AI-94] EMA: Elastic and Performance Transparent Memory Across GPUs
链接: https://arxiv.org/abs/2609.27040
作者: Yi Xu,Tian Xia,Ion Stoica
类目: Distributed, Parallel, and Cluster Computing (cs.DC); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Multi-GPU servers have become the standard building block of modern data centers, providing aggregated capacity through high-bandwidth interconnects. At the same time, workloads such as LLM inference exhibit highly dynamic memory demands, which can cause one GPU to exhaust its local memory while others remain underutilized. This mismatch motivates a model of elastic resource sharing across GPUs. We present EMA, a memory sharing system that allows GPUs within a server to borrow and reclaim memory from each other, forming an elastic pool of capacity. EMA ensures performance transparency for both borrowers and lenders. For borrowers, prefetching hides remote access costs so that applications experience remote and local memory as indistinguishable in performance. For lenders, borrowed resources remain reclaimable on demand, guaranteeing that performance never falls below that of static partitioning. While our design focuses on memory, the same principle naturally extends to other GPU resources. Our evaluation shows that EMA improves individual user throughput by up to 52%, achieves 96% of the throughput of a system provisioned with 2X capacity, and maintains latency similar to the static local baseline. Subjects: Distributed, Parallel, and Cluster Computing (cs.DC); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) Cite as: arXiv:2609.27040 [cs.DC] (or arXiv:2609.27040v1 [cs.DC] for this version) https://doi.org/10.48550/arXiv.2609.27040 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-95] Are Stated Reasoning Steps Causally Load-Bearing? NEURIPS2026
链接: https://arxiv.org/abs/2609.27038
作者: Abhiram Bhupatiraju,Rayan Nyaupane
类目: Artificial Intelligence (cs.AI)
备注: NeurIPS 2026, Interpretability as a Science
Abstract:Chain-of-thought (CoT) monitoring assumes that the reasoning a model writes reflects the computation that directly produces its answer. Previous faithfulness metrics have been predominantly behavioral, as they simply edit the reasoning text and observe the resulting answer. However, our methodology aims to measure faithfulness causally at the activation level, specifically on self-generated reasoning. Unlike previous causal audits, which measure degradation, our interventions carry a known predicted target. In this way, each patch should switch the answer to a specific counterfactual entity derivable by construction. Specifically, we use synthetic multi-hop lookup tasks (2-6 hops). We patch the residual stream at the token span where the model states each intermediate step with the corresponding activations from a counterfactual run. For Qwen3-4B, 76.9% +/- 2.8% of stated steps are causally load-bearing (CLB) at the most responsive mid-network layer (random-position null: 11.3%; patching the underlying prompt fact: 83%, so stated steps carry approximately 96% of the achievable effect). Moreover, the standard behavioral test on the same items yields 88.2%, which overstates causal faithfulness by 11.4 percentage points (item-matched; 111:14 discordant pairs, p 1e-15) and, for the easiest items, by up to 20 percentage points. This gap also has a clear capability dimension. Qwen3-1.7B is far less causally faithful overall (54.8%), with its faithfulness collapsing as reasoning depth increases (68% at 2 hops to 30% at 6), while Qwen3-4B remains relatively flat. Although stated reasoning can be causally meaningful, standard behavioral tests tend to overestimate its causal faithfulness, particularly on easier examples where model reasoning appears most fluent.
[AI-96] raining Intelligent Voice Assistant Wakeup with Controllable Synthetic Conversations
链接: https://arxiv.org/abs/2609.27037
作者: Marcin Sowański,Kacper Leszczyński,Kacper Krzywicki,Krzysztof Wodnicki
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Wake word detection is a critical component of virtual assistants, serving as the gateway to seamless user interactions. This paper introduces a novel wake-up system that extends traditional direct keyword detection with contextual trigger detection. After an initial wake word activation, the system uses reasoning to distinguish between user commands and unrelated speech, ensuring efficient and context-aware engagement. We present a data generation architecture that produces a 62.3-hour corpus of controllable multi-speaker conversations containing direct invocations, contextual follow-ups, and non-addressed speech. Experimental results demonstrate the effectiveness of the proposed approach across diverse synthetic conversational scenarios. We release the code, dataset and trained models to promote reproducibility and further advancements in intelligent assistant technologies.
[AI-97] An open benchmark for machine learning-based polymer property prediction
链接: https://arxiv.org/abs/2609.27036
作者: Robert W. Learsch,Nicholas Liesen,Daniel S. Levine,Anna M. Hiszpanski,Evan R. Antoniuk
类目: Machine Learning (cs.LG); Materials Science (cond-mat.mtrl-sci); Artificial Intelligence (cs.AI)
备注:
Abstract:Polymer property prediction lacks open, standardized benchmarks that enable rigorous comparison of machine-learning methods, with existing resources covering only a narrow fraction of polymer architectures, such as homopolymers. We introduce Polymer Benchmark 2026 (PolyBench26), an open dataset comprising nearly 250,000 polymer-property datapoints across eight physical properties, including data from experimental measurements, density functional theory, and molecular dynamics. The benchmark supports four evaluation tasks across homopolymers and alternating, random, and block copolymers: in-distribution property prediction, dataset-size scaling, repeat-unit complexity, and transfer to held-out polymer architectures. We compare language model, graph-based, and descriptor-based approaches and find graph-based models provide the lowest errors in property prediction, retain their advantage across the evaluated training-set sizes, and remain robust to increasing repeat-unit complexity. PolyBench26 provides a reproducible foundation for developing models for the increasingly complex polymer design space. The PolyBench26 benchmark is available open-source at this https URL.
[AI-98] Reinforcement Learning with Decomposed Subtasks
链接: https://arxiv.org/abs/2609.27035
作者: Mattie Terzolo,Mikolaj Sacha,Ayan Sinha,Andrew Rabinovich
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Group Relative Policy Optimization (GRPO) and related policy-gradient methods for training language model agents collapse an entire multi-turn rollout into a single scalar trajectory reward before it enters the policy update. When the task composes distinct skills, especially under sparse and delayed environmental feedback, this collapsing is lossy: the optimizer must implicitly infer which competency drove the outcome and how that should change behavior. We argue the right primitive is not a better scalar but a decomposition: trajectory reward should be split along subtasks before it enters the policy update. We introduce Reinforcement Learning with Decomposed Subtasks (RLDS), whose core is Subtask-Decomposed Advantage Estimation (SDAE): a replacement for the scalar GRPO advantage that splits trajectory reward into per-subtask shares on a fixed taxonomy, computes a group-relative advantage per subtask, and distributes per-token credit by weighting each subtask’s advantage by its importance, concentrating it around the step where a reflection marks that subtask’s execution as consequential. We evaluate on four agentic benchmarks: FrozenLake (sparse grid navigation), HotpotQA (multi-hop QA, one retrieval tool), ScienceWorld (long-horizon embodied science), and DeepResearch (long-form research, four tools, composite rubric reward). Heterogeneity diagnostics emitted during training show where decomposition pays off - gains scale with subtask heterogeneity, largest on the high-heterogeneity tasks ScienceWorld (+11.5 points, paired-bootstrap 95% CI [+9.8, +13.3]) and FrozenLake (+9.8 points, [+7.0, +12.8]), and within noise on HotpotQA and DeepResearch, where the diagnostics predicted little to recover. ScienceWorld is also more compute-efficient under RLDS than scalar GRPO (-10.9% wall-clock per step), as long rollouts amortize the fixed reflect-and-grade overhead.
[AI-99] opological Signatures of Cyber-Attack Classes in Natural Visibility Graph Representations of Network Traffic
链接: https://arxiv.org/abs/2609.26990
作者: Ali Melih Kanca,Ilker Turker
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注:
Abstract:Natural Visibility Graph (NVG)-based representations provide a promising approach for capturing structural patterns in sequential network traffic. However, whether different cyber-attack classes exhibit distinctive topological signatures in such representations remains insufficiently understood. This study investigates the discriminative and structural characteristics of NVG-based network traffic representations using the CSE-CIC-IDS2018 dataset. Seventy-six numerical traffic features were independently transformed into NVGs within overlapping frames of 40 observations, and ten graph-theoretic metrics were extracted from each graph, resulting in 760 topological descriptors per frame. The discriminative capability of these representations was evaluated using a multi-branch convolutional neural network (CNN) with stratified five-fold cross-validation. The model achieved an average accuracy of 96.20% and a Matthews correlation coefficient (MCC) of 0.9566. To characterize class-specific topological differences, Kruskal-Wallis and Mann-Whitney U tests were combined with Benjamini-Hochberg false discovery rate correction and effect-size measures. Of the 10,640 attack-versus-benign comparisons, 7,777 (73.1%) remained statistically significant after FDR correction, with 4,844 exhibiting large Cliff’s delta effects. The strongest global differences were predominantly associated with backward-traffic and packet-length-related features combined with connectivity, clustering, and centrality measures. These findings indicate that NVG-derived representations can provide strong discriminative capability while revealing class-dependent topological patterns associated with different cyber-attack classes.
[AI-100] Same evidence different judgments: Evidence noncommutative in vision/speech-text conflicts
链接: https://arxiv.org/abs/2609.26986
作者: Zhuoyun Li,Boxuan Wang,Xiaowei Huang,Yi Dong
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:For multimodal large language models, when images or speech conflict with accompanying text, measured text reliance can entangle modality preference with evidence position. Earlier studies of text bias often used a fixed evidence order or moved task instructions with the evidence, leaving the contribution of order unclear. In this paper, we use a paired comparison that keeps the instructions and evidence content fixed and swaps only the positions of the two sources to quantify this potential influence. Across vision and speech models, placing an image or recording after conflicting text consistently shifts answers toward its content. We also revisit previous studies and analyze why their experimental settings can lead to misleading conclusions. These findings reveal cross-modal evidence noncommutativity: the same evidence can lead to different judgments when its order changes, and placing perceptual evidence later can increase the model’s reliance on its content.
[AI-101] On Preference Coverag e Collapse from Hindsight Relabeling in Multi-Objective Reinforcement Learning
链接: https://arxiv.org/abs/2609.26918
作者: Baptiste Bonin,Caro Strickland,Audrey Durand
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Hindsight relabeling which retroactively replacing a transition’s goal with the outcome the agent actually achieved is an effective tool for improving sample-efficiency in Reinforcement Learning (RL). A natural extension to preference-conditioned multi-objective RL (MORL) relabels transitions with the preference direction the agent achieved rather than the one asked for. We show that this extension is frequently harmful: across four preference-conditioned off-policy algorithms spanning two critic backbones and two preference-sampling schemes on the continuous-control MO-Gymnasium suite, it degrades 19 of 36 algorithm-environment settings by as much as four standard deviations, improves only one, and leaves the rest unaffected. The harm is not a symptom of noisy relabels; denoising the target recovers almost nothing, and neither prioritized sampling nor any buffer-structural choice reproduces it. Instead, repeated relabeling collapses the critic’s coverage onto whatever narrow region of the preference space the agent happened to visit. We name this failure mode \emphPreference Coverage Collapse, and quantify it with abandoned preference mass (APM), a value-aware statistic that tracks the harm ( \rho = -0.73 ) where a purely structural coverage count does not. We then introduce \texttther_mix, a single-parameter convex combination pulling the achieved direction back towards the requested preference. At one fixed value across every algorithm and environment, it returns 16 of the 19 harmed settings to baseline, preserves and even improves the one setting in which relabeling helps, and cuts abandoned preference mass from 69% to 6% . Protecting coverage over the preference simplex, not filtering noisy relabels, is what makes hindsight relabeling safe for MORL. Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI) Cite as: arXiv:2609.26918 [cs.LG] (or arXiv:2609.26918v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2609.26918 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-102] winCheck: Evidence-Grounded Negative-Twin Verification for Stateful Tool Agents
链接: https://arxiv.org/abs/2609.26911
作者: Jiaxuan Dai,Tianyi Huang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:A single locally plausible tool call can derail an otherwise successful agent trajectory. Suspicion alone does not justify intervention, because the replacement itself can introduce the very failure verification is meant to prevent. We introduce TwinCheck, an inference-time verification policy that considers replacement only when the trace satisfies an evidence condition tied to a trace-local failure hypothesis. It constructs a trace-grounded counterfactual alternative, a negative twin, and replaces the agent’s proposal only if the twin passes structural checks and the pairwise verifier prefers it in both candidate orders. For paired evaluation, exact replay holds the agent’s parsed responses and actions fixed until the first accepted replacement, separating intervention effects from resampling. In the primary analysis of 159 multi-turn BFCL V4 tasks with complete exact-replay pairs, the complete policy raises task success for GPT-5.6 Sol from 45.3% to 58.5% (95% task-bootstrap CI [8.2, 18.8]), with no observed success-to-failure regressions. Together, these findings recast execution-boundary repair as a constrained comparison, making the counterfactual action itself the object of verification.
[AI-103] Ajar: Measuring Open Privilege in Agent Defenses
链接: https://arxiv.org/abs/2609.26900
作者: Reshabh K Sharma,Linxi Jiang,Shuo Chen,Zhiqiang Lin
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注:
Abstract:A language model agent acts through the tools it is given. The data it reads while working on a task can redirect what it does with those tools. A growing set of techniques for safe and secure agent execution therefore sits between the agent and its tools, aiming to enforce access control, information flow or isolation at that boundary. Today these techniques are evaluated on agent-security benchmarks built around indirect prompt injection. Those benchmarks judge a defense by how far it brings the number of successful attacks down while preserving the agent’s utility. A defense is judged only on the agent’s execution. It can score well on both metrics while holding open a transfer, a deletion or a broad read that no task needed. Ajar measures that open privilege directly using the existing benchmarks. It attaches to an agent-security benchmark that already exists and reuses the tasks, tool schemas, reference solutions and goal states that benchmark uses to grade its own runs. For each benign task it builds candidate tool calls the task does not need, so allowing one is privilege left open. These calls are presented to the defense at every point where the agent could act. We evaluate Ajar by attaching it to AgentDojo, where open privilege becomes a third axis beside the existing attack success and benign utility. We run it on five defenses: Progent, CaMeL, AC4A, Permission Assistant, and Claude Code’s Auto mode. We observed that they leave widely different amounts of privilege open. Two defenses leak by almost the same amount yet differ widely in the benign tasks they finish, and one defense buys part of its tightness by refusing calls its tasks were entitled to make. This open privilege cannot be derived from the measured attack success or benign utility. The source code of Ajar is available at this https URL.
[AI-104] Harness as a Language: A Minimalist Agent Framework With Maximal Expressivity
链接: https://arxiv.org/abs/2609.26891
作者: Zhening Li,Joshua Liu,Mateja Vukelic,Nicole Shen,Supriya Lall,Amitayush Thakur,Alex Zhang,Omar Khattab,Jonathan Light,Armando Solar-Lezama
类目: Artificial Intelligence (cs.AI)
备注: 25 pages, 3 figures
Abstract:Modern language-model agents are built around the \textitagent loop, where the LLM is placed in an environment exposing a set of tools, and the LLM has full control over the workflow by alternating between tool calls and observing their output. However, certain workflows currently require additional engineering beyond the agent loop itself, such as memory systems and self-improving systems. We built an LLM agent framework, JAZ, to explore the extent to which a minimal harness that is little more than the agent loop itself can accomplish tasks these specialized systems are built for. JAZ exposes a single LLM-based primitive invoke and provides a set of built-in hooks that allow the programmer to apply constraints and monitoring. Generalizing existing code-mode agent loops, \textttinvoke is the simplest loop that satisfies two defining properties: (1) the LLM can write arbitrary executable code that can include recursive \textttinvoke; (2) everything visible to the LLM — all inputs to \textttinvoke as well as its interaction history with the code environment — are variables in the code environment. We motivate our design from first principles, viewing \textttinvoke as a language primitive representing a function whose implementation is provided at runtime by an LLM every time it is called. To validate the design of our core \textttinvoke primitive, we evaluate \textttinvoke — with only prompting, no manually designed tools, harness, or external systems (e.g., memory or the file system) — on workflows traditionally implemented through specialized external harnesses. On long-horizon workflows requiring recall beyond the context window, JAZ invoke outperforms Letta (MemGPT) by 8% at half its cost on the recall-heavy portion of StuLife. On continual self-improvement, JAZ invoke outperforms ACE by 4% at a lower cost on AppWorld.
[AI-105] Comparative Evaluation of Static Embedding Models for HTTP Request Anomaly Detection
链接: https://arxiv.org/abs/2609.26860
作者: Amanda Riverol,Gustavo Betarte,Rodrigo Martínez,Álvaro Pardo
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
备注:
Abstract:Web applications are increasingly targeted by cyberattacks that exploit HTTP requests to evade security mechanisms. Traditional web application firewalls (WAFs) rely on rule-based approaches that often exhibit high false positive rates and limited adaptability. Recent studies have explored machine learning techniques and word embedding models to improve anomaly detection in HTTP traffic. This paper presents a benchmark for static embedding models, specifically Word2Vec, FastText, and Doc2Vec, within a unified, single-class classification framework. We propose HEDA (HTTP Embedding-Based Detection Architecture), a modular detection pipeline that combines static embedding representations with single-class anomaly detection models to detect anomalies at the request level. The approach operates in an unsupervised environment, where both the embedding models and detectors are trained exclusively on benign HTTP traffic. The proposed methodology is evaluated on three datasets with heterogeneous characteristics, including both synthetic and real traffic. The experimental results show that the choice of embedding representation significantly affects detection performance, and that FastText-based embeds produce the most consistent results across all datasets, achieving high detection rates while keeping false positive rates under control.
[AI-106] FLINT: Fast Lightweight Inference for Traversability
链接: https://arxiv.org/abs/2609.26857
作者: William Bonilla,Maxime Boisvert,David-Alexandre Poissant,David Meger,Louis Petit
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注: 8 pages, 5 figures
Abstract:Navigation in off-road conditions is challenging due to the lack of structure. There is no fixed vocabulary for what is traversable. The traversability depends on both the environment and the embodiment’s dynamics. Neither of these two variables can be hand-labeled at scale. Thus, traversability has to be learned by the embodiment’s own experience. Modern platforms tend to use multiple sensors to estimate traversability and navigate: RGBD cameras, lidar, radar, IMU, with computationally intensive platforms to run inference on neural networks. Against this trend, we propose FLINT, a lightweight traversability estimator: a 21.6M-parameter backbone, 38\times smaller than a comparable foundation-model backbone, that scores higher on held-out terrain probes and runs at 14.7 FPS on CPU alone using a RGB camera has the only sensor. Despite that gap in scale, FLINT produces a cheaper, more accurate costmap than a deployed foundation-model system (WildOS) on 23 of 24 replayed field logs. We compare different self-supervised learning signals and deploy the resulting models on a real platform in closed-loop field trials: the best self-supervised head reaches 99% autonomy over the route, outperforming a human-label-trained baseline deployed live on the same course. Our results show that heavy sensing and computing are not necessary for traversability estimation.
[AI-107] QUARTET: Quad-branch cross-Attention and Random-walk Traces for Enhancing Transformers on Relational Graphs
链接: https://arxiv.org/abs/2609.26855
作者: Kyaw Hpone Myint,Nan Jiang,Xiang Li,Zhe Wu,Alexandre G.R. Day,Pranab Mohanty,Giri Iyengar
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: This work has been accepted for main conference track at Learning on Graphs (LoG) 2026
Abstract:Relational Deep Learning (RDL) models multi-table databases as heterogeneous temporal graphs, and graph transformers currently achieve state-of-the-art performance on benchmarks like RelBench. However, the current leading model, RelGT, suffers from two key limitations: its random local sampler yields loosely connected subgraphs that hinder message passing, and its global attention module relies on a single, seed-feature-based memory that ignores broader macro-level dynamics. To overcome these limitations, we introduce QUARTET, an expressive graph transformer architecture that applies full self-attention on local subgraphs while enriching global context through cross-attention branches. Specifically, QUARTET employs a Causal Random Walk (CRW) sampler based on recency-truncated Personalized PageRank (PPR) to extract compact, hub-robust, and densely connected local subgraphs without temporal leakage. Concurrently, a quad-branch cross-attention module integrates global context from four complementary perspectives: seed feature, seed topology, temporal dynamics, and collaborative dynamics. Across the RelBench v1 classification tasks, QUARTET consistently matches or outperforms the current state-of-the-art graph transformer baselines (HGT and RelGT). Ablation studies confirm that the CRW sampler significantly enriches local neighborhood quality, while the global branches provide essential, task-specific predictive gains.
[AI-108] SsgCaps: A controlled dataset for the evaluation of sound scene generation algorithms
链接: https://arxiv.org/abs/2609.26854
作者: Modan Tailleur(LS2N),Junwon Lee,Laurie M Heller,Mathieu Lagrange(LS2N),Keunwoo Choi,Brian McFee,Keisuke Imoto,Yuki Okamoto
类目: Graphics (cs.GR); Artificial Intelligence (cs.AI)
备注:
Abstract:Sound Scene Generation is about the automatic synthesis of artificial sound scenes. We introduce SsgCaps, a publicly available dataset of human-engineered sound scenes wherein each scene matches a precisely structured prompt that guides the sampling process. The corresponding prompts are sampled from a predefined action-based typology that allows extensive sampling while retaining plausibility. SsgCaps is a sound scene dataset derived from the unpublished reference dataset for Task 7 of the 2024 DCASE Challenge edition, which contained private-and public-domain audio samples. In contrast, SsgCaps contains only public-domain audio samples, allowing us to open this dataset to the community. To make this dataset useful to the community, we first elaborate on the rationale for the prompt and dataset structure. We then perform a comparative quantitative analysis of the 2 versions of the dataset. To do so, we compare both versions to the audio synthesized by the SSG algorithms submitted to the challenge using Fréchet Audio Distance (FAD) and Kernel Audio Distance (KAD) as well as perceptual ratings. This analysis shows only small differences, which enables us to recommend the open version for further benchmarking of SSG algorithms.
[AI-109] COPE: Continual Personalization of LLM s under Sparse User Feedback via User Embeddings and Self-Evaluation
链接: https://arxiv.org/abs/2609.26853
作者: Ruike Cao,Fugen Yao,Liang Dong,Jian Xu,Guanjun Jiang,Li Xiao
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:While Large Language Models (LLMs) have achieved remarkable results across various benchmarks, their alignment with normative values often results in homogenized responses that fail to address diverse user preferences. Existing training-free methods often occupy valuable context windows through prompt engineering, while training-based methods typically remain static post-training, failing to support the continual optimization required in real-world settings. To address these challenges, we propose COPE (Continual Optimization with Personalized embedding and self-Evaluation), a novel optimization framework tailored for real-world-motivated interaction settings with sparse user feedback. Our framework assigns learnable personalized embeddings to each user and synergistically integrates preference capture, self-evaluation calibration, and personalized response optimization within a single update step. A key innovation of our method is the use of self-evaluation to generate proxy rewards, enabling continuous model updates even when explicit user feedback is unavailable. Experiments show that COPE consistently outperforms strong training-free and training-based baselines under sparse feedback, and remains complementary to Retrieval-Augmented Prompting (RAP). Further analyses confirm COPE’s reliable self-evaluation, meaningful preference patterns, stable general capabilities, and robustness under shifting preferences and alternative evaluators.
[AI-110] A Leakage-Aware Multimodal Evaluation Framework for Early Intraoperative Acute Kidney Injury Prediction
链接: https://arxiv.org/abs/2609.26848
作者: Quang Minh Nguyen,Duc Minh Le,Ho Nhat Minh Nguyen,Thuy Quynh Nguyen,Trong Nghia Nguyen
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: accepted on Conference on Optimization, Modeling, Simulation, and Analytics (COMOSA 2026)
Abstract:Postoperative acute kidney injury (AKI) after major non-cardiac surgery carries substantial morbidity, yet early intraoperative risk stratification remains difficult. In this retrospective cohort study, we propose SynerT, a waveform-only hybrid temporal backbone that combines a causal dilated TCN with a hierarchy of dilated recurrent layers to encode early intraoperative physiologic trajectories for AKI risk prediction. Building on SynerT, we further design two model variants that extend the backbone with structured clinical context: SynerT-MM, a late-fusion multimodal extension that integrates hemodynamic burden summaries and preoperative covariates, and SynerTStack, a leakage-safe stacked ensemble that combines cross-validated predictions from SynerT-MM with strong tabular baselines at the meta-learning stage. All models are evaluated under a strict leakage-aware framework on VitalDB, a high-fidelity perioperative database, with prediction restricted to information available within the first 60 intraoperative minutes. Among 2,413 waveform-usable cases (180 AKI-positive; 7.46% prevalence), SynerT fell well below strong structured-data baselines, demonstrating that waveform-only temporal modeling is insufficient under strict early constraints. SynerTMM recovered discrimination by incorporating hemodynamic burden summaries and preoperative covariates, and SynerT-Stack achieved the best overall performance across AUROC, AUPRC, and F1-max. Cross-fitted Platt recalibration substantially corrected calibration defects in both multimodal variants, and decision-curve analysis confirmed the recalibrated stacked model delivered the strongest net clinical benefit across low-to-intermediate thresholds.
[AI-111] LWCal: Loss-Weighted Calibration for Tabular Classifiers with Noisy Calibration Labels ICTAI2026
链接: https://arxiv.org/abs/2609.26839
作者: Zeming Liu,Hang Lyu,Jingtao Zhang,Yuan Xie
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 8 pages, 7 figures. Accepted at the 38th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2026)
Abstract:Post-hoc probability calibration is usually evaluated under an optimistic assumption: the held-out calibration labels are clean. In many AI deployment settings, however, labels come from weak annotators, historical decisions, heuristics, or distant supervision, so the same label noise that corrupts training also corrupts calibration. We study this overlooked failure mode for tabular classifiers and propose LWCal, a CPU-only post-hoc calibrator that down-weights calibration examples whose noisy labels are contradicted by the base model’s held-out probability. LWCal requires no clean validation labels, no noise-rate estimate, and no retraining of the base classifier. A second variant, Gated-LWCal, adds a conservative disagreement gate that backs off toward the raw score when the calibration split appears extremely inconsistent. On nine local binary tabular tasks, six random seeds, symmetric and asymmetric label corruption, and three tree-based base learners, LWCal obtains the lowest average calibration error while Gated-LWCal obtains the best average proper-score tradeoff. In the main random-forest study over 432 noisy cells, Gated-LWCal reduces expected calibration error from 0.188 to 0.122 and negative log likelihood from 0.438 to 0.396 relative to the raw classifier. Paired bootstrap intervals for Gated-LWCal versus raw, Platt, isotonic, and beta calibration exclude zero on ECE, Brier score, and NLL. The artifact contains all scripts, result tables, figures, and the compiled paper.
[AI-112] Silent Failures in Agent -Tool Interaction: An Audit of ToolUniverse
链接: https://arxiv.org/abs/2609.26836
作者: Shreya Gopalan,Devansh Singh,Sundaraparipurnan Narayanan
类目: Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注:
Abstract:Agentic AI systems are increasingly adopting automated pipelines that integrate multiple tools. While prior research and benchmarks have studied about task success and task completion of these agentic systems, the research about agent to tool interaction, specifically in biology agentic workflow is limited. This study investigates specific failures in agent to tool interaction where a tool invocation appears successful, some or all of the information or functionality from the tool via API/ wrapper is incomplete or missing and there are no communications / notifications to the user or the agent about such missing information. We call this a silent failures as the user or the agents are not aware that such failure has occurred. For the purposes of this study we developed an audit mechanism to identify such silent failures in Agent to tool interaction, by examining 15 scientific tools (and their associated API documentation and tool documentations) integrated within ToolUniverse environment (ToolUniverse serves as our experimental environment rather than the object of the study itself). We structure our study around 7 failure locus characterising where the failure occurs in the chain. We observed 91 failures (manually validated post LLM based candidate discovery and automated testing), most frequent of them being missing data or fields and inconsistencies in search, filtering or ranking criteria. Most of the 91 failures occurred in API layer (51) or wrapper layer (25), with a potential of silent failure amplification downstream. The results show that silent failures originate upstream of the event and propagate downstream into apparently valid scientific outputs. We propose a concept of contextual reliability to handle such failures and suggest mechanisms for testing, disclosing, monitoring, and measuring such failures across the agent-tool interaction pipeline.
[AI-113] Spec2COBOLRot: An Agent ic-AI Degradation Loop for Realistic COBOL Corpus Generation
链接: https://arxiv.org/abs/2609.26835
作者: Jean-Baptiste Espinasse(DiverSe),Djamel Eddine Khelladi(DiverSe, CNRS, IRISA, KHORA),Mathieu Acher(INSA Rennes, IRISA, DiverSe)
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注:
Abstract:COBOL remains widely deployed, yet representative corpora reflecting real production code are rarely available, limiting rigorous benchmarking of modernization approaches. We propose a systematic agentic AI pipeline for generating realistic COBOL programs, combining specification-driven generation with iterative degradation guided by patterns and complexity targets extracted from real production code. Here, realism is understood as structural fidelity to production code as captured by our metrics. We evaluate whether degradation reaches target complexity levels while preserving business behavior, and examine the limits of the approach, across three programs from distinct business domains. Results show the pipeline reliably produces syntactically valid programs and moves them toward realistic structural complexity. However, preserving business behavior is not always achieved by construction, and targeting structural metrics independently of business logic risks producing programs whose complexity does not reflect a plausible maintenance history. We discuss these limitations and outline a more realistic alternative as a direction for future work, generating legacy programs from scratch along a simulated development history.
[AI-114] Validation and Simulation Catch Different Errors: Four Levels of Evaluation for LLM -Generated Circuits
链接: https://arxiv.org/abs/2609.26830
作者: Ali Hedayati Pirouzan
类目: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI)
备注:
Abstract:Simulation success is not equivalent to structural correctness for LLM-generated circuits. We define and measure four evaluation levels – schema validity, topological validity, backend executability, and component-set agreement – on a 150-circuit trilingual benchmark, through a deployed pipeline built on a typed circuit interchange representation. The levels are not nested. On gpt-4o-mini, 16 of 150 circuits (10.7%, 95% CI 6.7-16.6) were rejected by the topological validator but executed in ngspice with no error or warning; 12 of these contained exactly the requested components, with one terminal disconnected. Conversely, 7 circuits (4.7%) passed the validator and ngspice refused them. Ten failed both checks and 117 passed both, so each check detects a class the other misses. A minimal three-component divider shows the cost: a dangling resistor reports 5.00 V instead of 2.50 V while ngspice stays silent. A paired ablation, in which every arm is evaluated from the same model sample rather than a fresh one, separates each repair stage from sampling noise. On a stratified 45-circuit subsample, model repair raised topological validity from 40.0% to 84.4% (+20 circuits, no regressions) while moving executability by a net 6 (+7, -1), an effect this sample size does not resolve, and component agreement by 2. One circuit moved in opposite directions at two levels in a single repair step. Against a direct-netlist baseline the pipeline executed 88.7% against 47.3%, or 62.7% under an accounting that credits the baseline with every failure we cannot confidently attribute to the netlist. These results support a narrow methodological conclusion: structural validation and simulation should be reported as distinct evaluation stages for LLM-generated circuits. A circuit that runs is not necessarily structurally valid, and a structurally valid circuit is not necessarily executable. Subjects: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI) Cite as: arXiv:2609.26830 [cs.AR] (or arXiv:2609.26830v1 [cs.AR] for this version) https://doi.org/10.48550/arXiv.2609.26830 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Ali Hedayati Pirouzan [view email] [v1] Mon, 21 Sep 2026 05:36:23 UTC (16 KB)
[AI-115] Bridging LLM Serving and CXL-SSDs with Chunk-Aware KV Cache Management
链接: https://arxiv.org/abs/2609.26828
作者: Hyunsun Chung,Taewan Noh,Minji Kim,Joo-Young Hwang,Hong-Yeon Kim,Youngjae Kim
类目: Hardware Architecture (cs.AR); Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET)
备注: 12 pages, 17 figures
Abstract:NAND-backed storage offers the capacity needed to scale LLM prefix caching, but its block I/O path incurs CPU cache contention and host-DRAM staging in addition to NAND latency. Our characterization shows that these interface costs persist even with DRAM as the storage medium, motivating CXL-SSDs for byte-addressable access to NAND-backed capacity. Surprisingly, however, a stock CXL-SSD remains about 3 \times slower than local DRAM and no faster than an NVMe SSD, while generic prefetching provides little benefit. We present LM-CXD, a CXL-SSD specialized for LLM prefix caching. LM-CXD bridges the semantic gap between the serving engine, which knows which KV chunks will be consumed, and the device, which controls their placement and movement. It makes KV chunks device-visible I/O units, exposes NAND-to-DRAM progress to the serving engine, and uses device DRAM as a GPU-accessible buffer. LM-CXD further coordinates request scheduling with windowed prefetching and pipelines layerwise KV movement with GPU computation to hide NAND latency under limited device DRAM. Across five LLM models, LM-CXD reduces average TTFT over a stock CXL-SSD by up to 2.6 \times with compute asynchronous prefetching and 4.03 \times with layerwise prefetching, achieving TTFT within 1.5 \times of local DRAM on average.
[AI-116] What Makes a Terminal-Bench Task Hard? Separating Genuine Hardness from Fake-Hardness on an Adjudicated Agent ic Corpus
链接: https://arxiv.org/abs/2609.26826
作者: Edward Lue Chee Lip,Boden Moraski,Tim Knappe,Lang Xiong,Sarvesh Gharat,Antonio Mari,Ivan Bercovich
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Frontier benchmarks need tasks that current models cannot solve. But a task that no model solves is not automatically a hard task. The same zero pass rate can come from a real capability gap, but it can also come from missing context, a broken reference solution, infrastructure failure, or a verifier that can be bypassed. In this paper, we study this issue using a frozen Terminal-Bench 3 / Frontier-Bench 0.1 production record with 1,081 pull requests, 639 scored tasks, 28,801 trials, and 105,933 in logged agent spend. We ask what an all-fail task actually certifies. For the 125 tasks with no honest pass, we combine task artifacts, reference-solution runs, empty-solution controls, adversarial trials, trajectories, telemetry, and review records, and apply an ordered validity screen. Only 78 of the 125 tasks survive as certified-unsolved candidates. The remaining tasks include 14 with broken oracles, 8 dominated by infrastructure failures, 4 that are only passable through verifier bypasses, and 21 whose solvability is not certified by the available evidence. Thus, lack of saturation and genuine difficulty are not the same thing. The certified-unsolved label is also narrow: it means that the authored route passed, infrastructure did not dominate, no strict bypass was observed, and all evaluated agents failed. It does not prove intrinsic hardness, verifier completeness, or failure at the intended capability. We further analyze rejected submissions and passing tasks to show that pass rate alone cannot explain why a task is difficult. Overall, our results suggest that frontier benchmarks should report the evidence behind their all-fail tasks before using them as capability claims.
[AI-117] Signal2Symbol: Neuro-Symbolic Temporal Reasoning for Explainable Physiological Time-Series Anomaly Detection
链接: https://arxiv.org/abs/2609.26820
作者: Naser Mansour,Sidahmed Benabderrahmane,Ameer Rahwan
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Physiological time series such as electrocardiograms (ECG) and electroencephalograms (EEG) exhibit complex temporal structure, substantial acquisition variability, and a strong need for transparent decision-making. Although deep models can achieve high detection performance, they often provide limited insight into why a segment is anomalous, how local anomalies relate over time, and whether a detection belongs to a broader recurring pattern. We propose Signal2Symbol, a neuro-symbolic framework for explainable biosignal anomaly detection. The method first converts ECG/EEG signals into symbolic sequences using either a learned VQ-VAE (Vector Quantized Variational Autoencoder) codebook or a SAX (Symbolic Aggregate approXimation) baseline. It then constructs bigram enriched token-window transactions and scores anomalies through rare itemset evidence derived from minimal rare itemset mining. Detected anomalous windows are merged into intervals and related using Allen interval algebra, enabling composite temporal explanations such as escalation chains, artifact overlap, and cross-channel synchrony. Finally, we introduce a rare temporal concept lattice based on Formal Concept Analysis (FCA), which groups anomalous intervals by shared rare symbolic evidence, Allen temporal relations, channel context, and robustness attributes. The resulting Galois lattice compresses many local detections into interpretable families of temporal-symbolic anomalies. We evaluate on three public benchmarks: MIT-BIH Arrhythmia (beat-level ECG), PTB-XL (record-level ECG), and the Bonn EEG dataset (segment-level EEG). We stress-test robustness under additive noise and baseline-wander perturbations. The results highlight the value of neuro-symbolic tokenization for temporal anomaly analysis and show that Allen/FCA reasoning provides compact, interpretable summaries of local detections.
[AI-118] Gödels and Scotts Variants of the Ontological Argument in Lean 4
链接: https://arxiv.org/abs/2609.26806
作者: Christoph Benzmüller
类目: Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI)
备注: 47 pages (13 pages of text plus a 30-page appendix reproducing the Lean 4 sources). Ancillary files: the complete Lean 4 development (lake package, Lean 4.33.1), the statement-comparison and dependency-tabulation tools, and two Isabelle2025-2 cross-check sessions with build log
Abstract:This paper presents a complete, structure-preserving port to Lean 4 of the Isabelle/HOL dataset accompanying Benzmüller and Scott’s study of Gödel’s modal ontological argument and Scott’s variant of it. The port comprises 30 Lean 4 modules, one per Isabelle/HOL theory, retaining the section structure, the declaration order and the name of every axiom, definition, lemma and theorem; a comparison tool certifies all 548 statements identical. Everything the Isabelle/HOL development proves is proved again, including the inconsistency of Gödel’s 1970 axioms, the repaired Gödel variants, Scott’s variant, modal collapse, monotheism and the ultrafilter property of the positive properties; five statements the original leaves unreplayed after an automated prover had found a proof, one of which it then postulates, are proved as well. The 45 remaining unproved statements are exactly those the original refutes by nitpick (35) or leaves open (10); they are anonymous sorrys on which nothing depends. Two features of Lean 4 shape the result. It has neither a sledgehammer nor a model finder, so the one-line automated proofs become explicit proof terms and the 72 nitpick invocations are recorded as documentation. And #print axioms reports the postulates each proof consumes, giving for every result an upper bound on the modal logic it requires: Scott’s necessary-existence theorem and modal collapse need only symmetry of the accessibility relation (logic KB); the essence and monotheism lemmas and the possible existence of a God-like being need no frame condition (the latter with the one exception the original records, the mixed-quantifier setting); and the inconsistency of Gödel’s 1970 axioms needs none either. The development depends on no library beyond Lean 4’s core; sources, comparison tools and two Isabelle cross-check sessions are included as ancillary files. Comments: 47 pages (13 pages of text plus a 30-page appendix reproducing the Lean 4 sources). Ancillary files: the complete Lean 4 development (lake package, Lean 4.33.1), the statement-comparison and dependency-tabulation tools, and two Isabelle2025-2 cross-check sessions with build log Subjects: Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI) MSC classes: 68V15, 68V20, 03B45, 03B16, 03B38, 03B80, 03A05 ACMclasses: F.4.1; I.2.3 Cite as: arXiv:2609.26806 [cs.LO] (or arXiv:2609.26806v1 [cs.LO] for this version) https://doi.org/10.48550/arXiv.2609.26806 Focus to learn more arXiv-issued DOI via DataCite
[AI-119] Attention-based representations for multi-task computation
链接: https://arxiv.org/abs/2608.04243
作者: Daniel Hsu,Mingyue Xu
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC)
备注:
Abstract:Multi-head attention layers produce vector representations that support multiple downstream tasks. We establish bounds on the number of heads required in two simple and concrete multi-task scenarios. In the first scenario, a vector representation is sought so that linear predictors can compute both the smallest and largest numbers in a given list. In this case, it is known two attention heads with small embedding dimension and bit precision level suffice. We prove that a single attention head requires exponentially higher embedding dimension or precision level. In the second scenario, a vector representation is sought so that a polynomial threshold function can compute the XOR of a given string of n bits. This scenario is analogous to the first one for n=2 , since XOR is readily computed by a linear function using a vector representation that encodes both the AND and the OR of the two bits. We observe that n -bit XOR requires the product of the number of heads and the polynomial degree to be at least n , and we construct multi-head attention layers that match this lower bound. These results generalize to arbitrary (symmetric) Boolean functions, where the bound is given in terms of the threshold degree.
[AI-120] Shopping by algorithm: How agent ic AI deploys human heuristics as a surrogate consumer
链接: https://arxiv.org/abs/2609.28372
作者: Davood Wadi,Yu Ma
类目: General Economics (econ.GN); Artificial Intelligence (cs.AI)
备注:
Abstract:Consumers increasingly delegate purchasing decisions to Large Language Models (LLMs) acting as surrogate consumers. Using “Tool-Lab,” an adaptation of information-board process tracing that places product attributes behind costly tool calls, we examine how marketing pricing cues (i.e., just-below pricing and promotional framing) influence AI shopping agents. Across eight commercially deployed LLMs from three providers, we trace pre-choice information acquisition. Under zero cost, pricing cues rarely mislead. Imposing acquisition costs under a vague goal prompt leads LLMs to omit diagnostic attributes required to compute unit price and choose suboptimal choices resembling human heuristics. Relative to a specific goal prompt that mainly preserves diagnostic search and choice optimality, a vague goal prompt under constraints creates a search-mediated vulnerability. This research demonstrates that marketing heuristics in delegated AI shopping are governed by storefront information architecture, not necessarily immutable LLM flaws.
[AI-121] AI-Driven Neural Surrogates for In Silico Design of Cognitive-Affective Neuromodulation Targets
链接: https://arxiv.org/abs/2609.27729
作者: Marco Rothermel,Madleen Stenger,Soroush Daftarian,Svenja Jule Francke,Bita Shariatpanahi,José C. García Alanis,Mohammad-Ali Nikouei Mahani,Stefan G. Hofmann,Tim Hahn,Hamidreza Jamalabadi
类目: Neurons and Cognition (q-bio.NC); Artificial Intelligence (cs.AI); Systems and Control (eess.SY)
备注:
Abstract:In neuropsychiatry, the primary goal is often not only to decode brain activity but to change it, for example to lessen a negative affective bias or an overly salient memory. Motivated by control theory, we develop an AI-driven neural-surrogate framework that proposes candidate representational changes and tests their predicted perceptual effects from snapshots of stimulus-evoked fMRI activity, without physical stimulation. The framework combines fMRI decoding, deep generative modeling, and constrained latent-space steering. Valence and memorability are used only as worked examples. Using more than 36,000 image-fMRI observations from four deeply sampled Natural Scenes Dataset participants, subject-specific models recovered coarse generative structure from visually responsive cortex (two-way identification, 0.79-0.88; chance, 0.5). Graded perturbations were reconstructed as images and evaluated with automated scorers and human ratings from 7,200 trials by 18 participants. In the primary VDVAE model, valence shifted from -0.61 to +1.03 SD and memorability from -1.34 to +1.45 SD; a later Versatile Diffusion refinement reduced or altered these effects. Across five perturbation levels, human valence ratings moved in the predicted direction under the linear time-correction model (mean slope, 0.038 SD per unit of alpha; 95 percent CI, 0.003-0.074; positive in 16 of 18 participants). Perceived memorability did not change reliably. Baseline agreement with the automated assessor was suggestive for valence (r = 0.30) and weak for memorability (r = 0.10). Extreme perturbations drifted from the original stimulus, so intended change must be weighed against loss of fidelity. These findings provide a falsifiable upstream method for designing and behaviorally testing candidate representational targets for future neuromodulation in psychiatry, while marking the limits of the present static approximation.
[AI-122] Compliant AI Infrastructure for Regulated Finance: A tiered multi-agent framework with DLT audit trails for financial operations in DACH
链接: https://arxiv.org/abs/2609.27632
作者: Walter Kurz,Reinhard Magg
类目: General Finance (q-fin.GN); Artificial Intelligence (cs.AI)
备注: 16 pages, 3 figures. Published in Swissi AI Journal under CC BY 4.0
Abstract:We present a compliance-first architecture for AI in regulated finance that treats regulation as an orientation layer rather than a deterministic ruleset. A matrix of regulatory intent and exposure provides a compact classification handle, which a governed policy compiler then maps into concrete prohibitions, obligations and runtime budgets. Prohibitions constrain feasibility and block externalisation, while obligations extend tasks with artefacts that must meet explicit admissibility criteria. Committee activation remains policy-driven and proportionate, preserving efficiency while ensuring supervisory oversight. Evidence, decisions and reason codes are bound to a permissioned DAG with deterministic timestamping, enabling replay, provenance checks and clear attribution of failure. Clause-level legal indexing with effective dates and capability-based agent routing ensure portability across DACH and the wider EU. The result is assurance by construction: compliance is embedded in execution and verifiable by auditors without sacrificing proportionality or transparency.
[AI-123] Beyond the Illusion of Power: Calibrating Quasi-Experiments in Observational IS
链接: https://arxiv.org/abs/2609.27299
作者: Spandan Ghose Chowdhury
类目: Methodology (stat.ME); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Accepted for publication at the 60th Hawaii International Conference on System Sciences (HICSS-60)
Abstract:Information systems (IS) researchers increasingly use quasi-experimental methods such as difference-in-differences (DiD) and instrumental variables (IV) to recover causal effects from observational panel data. Power calculations that justify these designs assume i.i.d. errors, but the deeper problem is what even a cluster-robust calculator cannot see. We report a Monte Carlo study over 9837 parameter conditions (approx 9.8 million datasets) and decompose the planned-versus-achieved power gap. The serial-correlation component is recoverable by an AR(1)-aware calculator when rho is known, and partially when rho must be estimated from short pre-periods, but panel attrition, staggered-adoption bias, and parallel-trends pretesting are captured by no closed-form formula; exogenous attrition alone costs approx 8 to 11 percentage points at the few-hundred-to-thousand sample sizes IS studies use. Treatment-correlated, outcome-dependent attrition instead induces bias, not just power loss. For IV, holding first-stage F fixed, larger N neither raises power nor curbs exclusion bias, though with a fixed instrument more data does sharpen the first stage, so identification rests on instrument strength, not sample size.
[AI-124] Loss Choice or Model Choice? The Role of Forecast Level in Cryptocurrency Volatility Forecasting
链接: https://arxiv.org/abs/2609.27024
作者: Andrzej Tokajuk,Jarosław A. Chudziak
类目: Computational Finance (q-fin.CP); Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE); Risk Management (q-fin.RM)
备注: Accepted for publication in the proceedings of ADMA 2026
Abstract:Volatility forecasts play a central role in financial risk management because their overall level and day-to-day movements affect downstream decisions. Most studies compare forecasting models while keeping the training loss fixed. Yet losses emphasise different errors and can target different properties of future volatility, so raw comparisons may combine persistent forecast-level differences with differences in daily forecast movements. This leaves unresolved whether the importance of loss choice comes mainly from the forecast level it targets or from differences that remain after level adjustment. We address this gap through a comparison of seven losses and five models across major cryptocurrencies. Validation-based alignment adjusts the forecast level before the raw and aligned forecasts are evaluated using statistical scores and one-day Value-at-Risk. Before alignment, marginal score variation is greater across losses. After alignment, model choice becomes the larger source of variation in the full five-model comparison, while cross-loss differences in VaR breach rates narrow substantially. Our contribution is a comprehensive evaluation of loss and model choice that shows why losses can appear so influential in raw comparisons and how this interpretation changes when forecast level and downstream risk are considered explicitly.
[AI-125] Learning Stiffness Dependent Fluid Structure Dynamics from Coarse Flow Representations
链接: https://arxiv.org/abs/2609.26816
作者: Chun-Jun Pu,Li-Wei Chen,Hai-Bo Huang
类目: Fluid Dynamics (physics.flu-dyn); Artificial Intelligence (cs.AI)
备注:
Abstract:This paper develops a data-driven framework for long-term prediction of fluid–structure interaction (FSI) dynamics, focusing on the flow-induced vibration (FIV) of a flexible plate. A stiffness-conditioned neural evolution operator jointly represents the Eulerian flow field and Lagrangian structural state. The plate is represented by 101 ordered structural tokens carrying nodal coordinates and velocities, with nondimensional bending stiffness as a global conditioning variable. Bidirectional cross-attention couples fluid and structural representations within a hybrid CNN-Transformer architecture. Trained with staged multi-step autoregressive rollouts and symmetry-reflected trajectories, a single operator captures three stiffness-dependent response regimes: deflected–flapping, deflected, and flapping. The predicted trajectories preserve the principal flow structures, structural oscillations, and dominant frequencies, while blind 1000-step rollouts remain bounded. The operator also interpolates to stiffness values excluded from training. To reduce sensitivity to under-resolved near-wall gradients in force reconstruction, we develop a differentiable aerodynamic-force module based on the derivative-moment transformation (DMT). Conventional wall-stress surface integrals are replaced by an enclosed 2D curve integral around the core vortex region, enabling accurate reconstruction of lift and drag. A Signed Distance Function (SDF) and smoothed Dirac-delta formulation make the integration fully differentiable while preserving gradient flow. The proposed framework provides an accurate and differentiable surrogate for stiffness-dependent FSI dynamics, enabling efficient parameter studies and future stiffness optimization for flow-energy-harvesting applications. Subjects: Fluid Dynamics (physics.flu-dyn); Artificial Intelligence (cs.AI) Cite as: arXiv:2609.26816 [physics.flu-dyn] (or arXiv:2609.26816v1 [physics.flu-dyn] for this version) https://doi.org/10.48550/arXiv.2609.26816 Focus to learn more arXiv-issued DOI via DataCite
机器学习
[LG-0] Even Sharper Bounds for Transductive Learning and Its Applications
链接: https://arxiv.org/abs/2609.28459
作者: Yingzhen Yang
类目: Machine Learning (cs.LG); Information Theory (cs.IT); Statistics Theory (math.ST)
*备注:
Abstract:We introduce Sharper Transductive Local Complexity (STLC), a localized complexity method for transductive learning under uniform sampling without replacement. The construction starts from a Bernstein-type concentration inequality for the supremum of the test–train empirical process. Its proof uses the modified log-Sobolev inequality for the swap walk and a two-parameter entropy closure. A peeling argument with a surrogate localization functional then gives excess-risk bounds with the same fixed-point and confidence terms as the classical inductive local Rademacher-complexity bounds, without the additional logarithmic confidence factor in earlier transductive results. For realizable learning over a binary class of VC dimension \dVC , with training size m , test size u , and u\ge m\ge\dVC , STLC yields \cO\dVC\log(me/\dVC)/m\ . This matches the standard inductive rate and, when m\ge9 , is within a logarithmic factor of the transductive minimax lower bound of order \dVC/m . For transductive kernel learning, STLC gives a spectrum-adaptive excess-risk bound without the multiplicative imbalance factors appearing in the earlier local-complexity bound.
[LG-1] Minimal-Norm Univariate Two-Layer ReLU Classification: Exact Solutions and Global Optimality with Skip Connections
链接: https://arxiv.org/abs/2609.28438
作者: Karolina Drabik,Ben Lewis,Antoni Puch,Etienne Boursier,Piotr Hofman,Matthias Englert,Ranko Lazić
类目: Machine Learning (cs.LG)
*备注:
Abstract:We study minimal-norm interpolation and \ell_2 -regularized logistic-loss minimization for binary classification by univariate two-layer ReLU networks. We give complete geometric characterizations of the optimal classifiers in function space, resolving how the solutions depend on whether hidden-layer biases are included in the parameter norm. When biases are unpenalized, the minimal-norm interpolators are exactly the continuous piecewise-affine functions that hug every label switch and have kinks of the appropriate convexity. When biases are penalized, the minimizer is unique in function space, has exactly one kink in each intermediate same-label segment, and is therefore a sparsest positive-margin classifier. We further show that adding a free affine skip connection leaves these function-space solutions unchanged but fundamentally improves the parameter-space landscape: every KKT point of the constrained problem becomes globally optimal, whereas suboptimal KKT points can occur without the skip connection. We establish analogous global-optimality and geometric results for sufficiently weak \ell_2 -regularization of the logistic loss. In the unpenalized-bias case, we identify an additional sparsity-like restriction, implying that most minimal-norm interpolators cannot arise as small-regularization limits of margin-normalized logistic-loss minimizers. Numerical experiments across varying dataset complexity and network width support the predicted landscape and sparsity phenomena.
[LG-2] Context-Continuous Preference Learning for Exoskeleton Personalization
链接: https://arxiv.org/abs/2609.28427
作者: Sunin Baek,Sungwoo Park,Daekyum Kim
类目: Machine Learning (cs.LG); Robotics (cs.RO)
*备注: 23 pages, 11 figures, including supplementary materials
Abstract:Personalizing exoskeleton assistance across operating conditions is constrained by the time and physical effort required to collect user feedback. We examined whether a user’s preference landscape varies smoothly across operating conditions and when this continuity supports learning from limited feedback. We propose Context-Continuous Preference Learning (CCPL), a Gaussian-process preference model that shares observations across nearby contexts while retaining context-specific utility estimates. We evaluated CCPL through simulations and retrospective analyses of ankle and elbow exoskeleton preference data from nine healthy adults. In simulations, CCPL improved reconstruction and preference-based Bayesian optimization relative to independent learning when preferences varied smoothly, but showed negative transfer when continuity was weak. In both human studies, full-data reference landscapes estimated separately for each participant and context tended to be more similar between nearby operating conditions. With five exposures per context, CCPL increased mean reconstruction correlation with these references from 0.644 to 0.720 for ankle assistance and from 0.476 to 0.526 for elbow assistance relative to independent learning. The five-exposure budget was approximately 37% lower for ankle and 17% lower for elbow than the estimated independent-learning budgets needed to match these correlations. CCPL also improved held-out response prediction relative to independent learning, while benefits over pooled learning varied. These findings support context continuity as a basis for sharing preference observations under limited feedback, although benefits for online personalization in humans remain to be established.
[LG-3] Learning Collective Dynamics with Differentiable Gaussian Representations
链接: https://arxiv.org/abs/2609.28405
作者: Jianxiang Ma,Mingfu Zhang,Xiaocui Yang,Yichen Gao,Junzhao Huang,Yuesong Hou
类目: Machine Learning (cs.LG)
*备注: 20 pages, 2 figures
Abstract:Collective responses depend on individual differences, contact opportunities, and accumulated experience. Learning their dynamics from aggregate counts requires connecting a population’s response distribution to both current observations and future behavior. We introduce Differentiable Gaussian Dynamics (DGD), which learns this connection through three components: a Gaussian mixture representing heterogeneous response propensities, differentiable aggregation of contact intensity and behavioral probabilities, and feedback recurrence that updates subsequent responses. Reparameterized integration and temporal recurrence let aggregate prediction errors jointly train the distribution, observation functions, and feedback parameters. On four windows from KuaiRand-Pure and Online Retail II, DGD achieves lower joint behavioral negative log-likelihood than a DeepAR adaptation with a joint-behavior head. In Retail 2010, its one-day behavioral-count MAE is 4.71 versus 6.88 for this adaptation. Learning the distribution reduces behavioral negative log-likelihood by 10.82% relative to a fixed Gaussian in KuaiRand’s standard-recommendation window; removing feedback dynamics raises joint KL from 0.0340 to 0.2577 in a controlled experiment. These results establish the value of learning population representations and their feedback process from aggregate observations. Code is available at this https URL.
[LG-4] Memory Attention
链接: https://arxiv.org/abs/2609.28399
作者: Jiale Kang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Language models typically construct attention values from contextual hidden states, even when some of their content may be reusable across contexts. We investigate whether token-indexed memory can replace the dedicated value projection when complemented by contextual information. We propose Memory Attention (MA), which forms values by combining layer-specific token memory with contextual keys. The memory supplies token-specific representations, while the keys preserve context dependence. At inference, normalization can be folded into the memory tables, reducing value construction to lookup and addition. Token-indexed retrieval also enables CPU offloading with prefetching, reducing GPU parameter storage. Under matched training token budgets and with additional memory parameters, experiments across attention configurations show improved language modeling and average downstream performance.
[LG-5] ForgetMimic: Motion Unlearning for Reinforcement Learning Humanoid Control
链接: https://arxiv.org/abs/2609.28378
作者: Xukun Luan,Zhongxiang Lei,Chen Gong,Shaowei Li,Yuanguo Bi,Jinyan Liu
类目: Robotics (cs.RO); Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注: this https URL
Abstract:Humanoid control, leveraging human demonstrations, has achieved diverse, agile, and natural locomotion behaviors through reinforcement learning (RL). While this paradigm has yielded remarkable performance in physical humanoid control, how to eliminate specific motions from learned policies remains insufficiently explored. Addressing this issue is motivated by pressing safety and privacy concerns: the removal of malicious, poisoned, or suboptimal motions, as well as copyright-protected motions subject to the right to be forgotten under regulations such as the GDPR, is of critical importance. To this end, we propose ForgetMimic, the first motion-level unlearning method designed specifically for physical-world humanoid control. The core idea of ForgetMimic is as follows: given a policy \pi_\theta trained on N motions, our method degrades performance on a target subset of K motions while preserving the effectiveness of the remaining N-K motions. Furthermore, we identify and resolve two key training mechanisms in robot control that lead to unlearning failure. We conduct extensive experiments on the Unitree G1 and H2 humanoid robots across 12 motions, including Dance, Fight, Flip, and others. Experimental results demonstrate that ForgetMimic effectively eliminates memory of designated motions while maintaining the normal operation of all other motions.
[LG-6] LEAP-CBF: A Safety Filter for Uncertain Systems with Least-Effort Adversarial Potentials
链接: https://arxiv.org/abs/2609.28364
作者: Oswin So,Eric Yu,Chuchu Fan
类目: Robotics (cs.RO); Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注:
Abstract:Control barrier functions (CBF) are a popular safety filter to ensure safety for nonlinear dynamical systems. However, when the system is subject to uncertainties and disturbances, this requires the use of robust variants of CBFs, which can be difficult to construct and can be overly conservative, especially for high-dimensional systems under input constraints. In this work, we propose a new approach to solve these challenges by introducing Least-Effort Adversarial Potentials (LEAP), a certificate that quantifies the robustness of a given state against disturbances in terms of the effort required by the disturbance to cause failure. We show that LEAP is a CBF for the undisturbed system, but can also be used to construct a safety filter that is robust to disturbances whose cumulative effort is bounded. We propose a method for constructing LEAPs with on-policy deep reinforcement learning. Next, we demonstrate LEAPs in simulation on a variety of multi-agent systems with disturbances and uncertainties. Finally, hardware experiments on a quadruped and quadrotors validate that LEAPs are well suited to tackle the disturbances and uncertainties from real-world robotic systems.
[LG-7] Non-Commutative State Tracking with Input-Dependent Low-Rank Updates in Mamba-3
链接: https://arxiv.org/abs/2609.28273
作者: Hiroki Fujii,Masaki Yamakita
类目: ystems and Control (eess.SY); Machine Learning (cs.LG)
*备注: 10 pages, 4 figures
Abstract:State tracking from sequential observations can require both retaining information and updating it by composing observed operations. We extend Mamba-3’s diagonal transition with an input-dependent low-rank reflection term to support noncommutative state tracking, in which the order of operations matters. The rank-one update couples state coordinates along an input-dependent direction, enabling non-diagonal state transitions within a single Mamba-3 block. The extension preserves Mamba-3’s exponential-trapezoidal discretization, rotary embeddings (RoPE), and readout. For training, we adapt chunkwise computation to parallelize the proposed recurrence within each chunk. Experiments cover group word problems with discrete inputs and a shell game with continuous observations, in which a policy is trained by behavioral cloning. Among the models selected for their strong performance under fixed timing, the proposed model maintains higher tracking success on longer swap sequences in the shell game with continuous observations and timing jitter. These experiments show that the proposed method achieves high accuracy on the evaluated non-commutative tracking tasks, improving on standard Mamba-3. The extension thus offers a Mamba-3-based approach to non-commutative state tracking.
[LG-8] Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving
链接: https://arxiv.org/abs/2609.28263
作者: Jiameng Lyu
类目: Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注:
Abstract:The growth of large language model (LLM) inference and search services increases the scale of online linear programming problems, motivating computationally efficient algorithms. We develop resource-adaptive stochastic gradient descent (RASGD) for stochastic online linear programming. The algorithm uses one request and current inventory to update resource prices, requiring O(m) operations for m resources and memory per arrival and no LP or sample-average optimization. The central idea is to express the current-resource pricing logic of re-solving through a first-order SGD update: each arrival refreshes the remaining-inventory allowance in the dual objective, while the stepsize decreases for early learning and increases later to match the speed of inventory adjustment. Under standard non-degeneracy conditions, our algorithm is feasible on every sample path and achieves O(\log T) expected regret against the realized fractional hindsight optimum, which matches the lower bound, even for policies that know the distribution and have unrestricted computation. The analysis converts curvature around the fixed reference price into inventory stability without tracking optimal prices at changing resource levels. Numerical experiments show that RASGD achieves regret competitive with per-arrival LP re-solving and improves upon the tested first-order baselines, while retaining the computational efficiency of first-order methods. These results establish RASGD as a computationally efficient approach to achieving high allocation quality in large-scale OLP.
[LG-9] hyperbolix: Hyperbolic Deep Learning in JAX
链接: https://arxiv.org/abs/2609.28248
作者: Timo Klein,Thomas Lang,Yllka Velaj,Sebastian Tschiatschek
类目: Machine Learning (cs.LG); Mathematical Software (cs.MS)
*备注:
Abstract:We present hyperbolix, an open-source library for hyperbolic deep learning in JAX, built on Flax NNX. To our knowledge, it is the first comprehensive, general-purpose hyperbolic deep learning library in JAX. It includes six manifolds with a common interface: Euclidean space, the Poincaré ball, the hyperboloid, the \kappa -stereographic model, mixed-curvature product spaces, and the proper velocity space. We implement layer families that cover linear layers, convolutions, attention, normalization, positional encoding, regression, and vector quantization. These building blocks span methods ranging from Ganea’s original hyperbolic neural networks to recent fully hyperbolic architectures such as Hypformer and Lorentzian ResNet. Additionally, hyperbolix contains Riemannian optimizers implemented as optax transformations, wrapped distributions, and hyperbolic dimensionality-reduction techniques. Its API uses idiomatic JAX: Manifolds are stateless, with curvature being passed at call time, while manifold operations act on single points, with this http URL enabling batch operations. The precision of every checked operation is tested against a closed-form NumPy/SciPy transcription from the source paper or a finite difference, for both float32 and float64. On the hyperboloid, standard formulas for two-point operations, such as the distance, lose precision far from the origin, because they subtract two large, nearly equal terms. hyperbolix replaces these subtractions with cancellation-free formulas that stay accurate in float32 at distances where prior implementations return NaN. hyperbolix is available under the MIT license at this https URL .
[LG-10] Support-Compiled Feature Folding: More Evidence at Lower Memory Across Tabular Foundation Models
链接: https://arxiv.org/abs/2609.28208
作者: Tian Zhou,Beverly Jin,Xue Wang,Linxiao Yang,Wenwei Wang,Bingqing Peng,Mengni Ye,Jinjie Gu,Liang Sun
类目: Machine Learning (cs.LG)
*备注:
Abstract:Tabular foundation models face a feature-side scaling dilemma: full-width pairwise mixing grows quadratically with the number of columns, whereas feature selection saves memory by discarding evidence. We introduce Support-Compiled Feature Folding (SCFF), a training-free inference framework that resolves this dilemma without changing the frozen backbone. SCFF routes support-ranked features through bounded leaves of the native feature encoder, support-checks the residual evidence, and merges the encoded messages before a single contextual prediction. It thereby converts quadratic feature-interaction work into linear-in-width work with a bounded local working set, without ensembling predictions or training new parameters. On the exhaustive 18-dataset wide-table slice of fixed AMLB-29, TabZilla, and TabArena snapshots, SCFF improves dataset-macro accuracy and NLL on all six evaluated backbones. All four matched-width comparisons retain favorable 95 percent dataset-bootstrap intervals on locked folds, with relative error reductions up to 26.1 percent. Median paired GPU-memory savings are 2.09x to 2.36x, and the ratio of separately observed maximum peaks reaches 34.3x. Under a measured peak-memory ceiling, SCFF uses the saved budget to preserve more support-selected evidence, improving accuracy by 4.06 and 3.72 points over the widest feasible single leaf on predeclared wide-Core strata of TabICLv2 and TabPFN-3.
[LG-11] ransferable Evidence Reconstruction for Longitudinal Glucose Representations
链接: https://arxiv.org/abs/2609.28199
作者: Tian Zhou,Bingqing Peng,Linxiao Yang,Wenwei Wang,Mengni Ye,Beverly Jin,Zuyi Zhu,Jinjie Gu,Liang Sun
类目: Machine Learning (cs.LG)
*备注:
Abstract:Long physiological recordings contain many routine measurements, while predictive information is often concentrated in rare events, sustained burden, and recurring temporal patterns. Masked autoencoding recovers measurements; contrastive learning aligns views. We study self-supervision that explicitly prioritizes structured signal evidence. We introduce transferable evidence reconstruction (TER), which constructs evidence from unlabeled recordings, fits a fresh low-capacity reader on one recording group, and requires that reader to recover the same evidence in another group without refitting. Differentiating through this cross-group test learns representations with transferable evidence-decoding rules; the evidence guides self-supervision but is not used as a downstream feature. For continuous glucose monitoring (CGM), an observation-aware daily encoder and clock-aware multi-day memory bind glucose level and change to recorded time while organizing up to seven days of history. On the 14-task leaderboard, TER improves the strongest prior overall PR-AUC/ROC-AUC/Macro-F1 scores by 5.51/4.43/2.80 percentage points and sets a new best metric on 12/14 tasks. These leaderboard gains are 2.0-2.9 times the respective gaps between the two strongest baselines. With public pretraining data, folds, and the linear probe matched, TER outperforms our GlucoFM reproduction by 6.09/5.52/2.72 points. Target-reader ablations, same-history controls, and cross-person readouts support the combination of structured evidence, cross-group reader fitting, and learned multi-day organization.
[LG-12] Confidence Falls Short: Asymmetric Certainty Gains from Optimization Hinder Multimodal Classification
链接: https://arxiv.org/abs/2609.28165
作者: Longfei Huang,Xiangyu Wu,Yang Yang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Multimodal learning (MML) falls into the optimization dilemma due to the modality imbalance phenomenon, leading to suboptimal overall performance in practice. While many attempts primarily focus on balancing the optimization dynamics across modalities to address this issue, we identify a subtle yet critical flaw: optimization yields asymmetric gains in predictive certainty, with the strong modality more confident than the weak one, driving imbalanced modality contributions. In this paper, our analysis reveals that this flaw stems from unimodal characteristics rather than multimodal learning, and this confidence discrepancy can be corrected by positive cross-modal intervention. Based on this insight, we propose multimodal Max Confidence Regularization (MaxCR) to dynamically intervene in modality semantic confidence. Specifically, the semantic confidence of each modality is tracked using a nonlinear sparsity measure. We then design max suppression and max excitation based on this measure to regularize strong and weak modalities, respectively. They penalize and encourage the top-1 confidence, thereby constraining multimodal prediction. To this end, strong and weak modalities are expected to make calibrated confidence, thereby improving the overall performance. Empirical experiments on widely used datasets reveal the superiority of our method through comparison with various state-of-the-art (SOTA) multimodal learning baselines.
[LG-13] EvEMTBench: An Open Benchmark for Machine Learning in Power System Protection
链接: https://arxiv.org/abs/2609.28149
作者: Julian Oelhaf,Georg Kordowich,Christian Bergler,Andreas Maier,Johann Jäger,Siming Bayer
类目: ystems and Control (eess.SY); Machine Learning (cs.LG)
*备注: 15 pages, 3 figures. Supplementary information included. Code: this https URL
Abstract:Studies of machine-learning-based power system protection are difficult to compare because task definitions, measurement access, data partitions, metrics, and generalization conditions often differ. EvEMTBench addresses this gap with an open, executable, and versioned benchmark that fixes these evaluation choices while leaving model design open. Across four grids spanning 20-345 kV, it defines 12 protection and event-analysis functions instantiated as 24 scored tasks and supports structured evaluation across observability conditions, predefined distribution shifts, and zero-shot and fine-tuned cross-grid transfer. Committed partitions, leakage controls, and reproducible reporting provide a common basis for comparing future methods. A reference evaluation spanning trivial, conventional, feature-based, and deep-learning baselines shows that wider observability is not uniformly beneficial, shifted conditions can reveal failures not apparent in-distribution, and cross-grid transfer is substantially stronger for fault detection than for fault localization. Protection-relevant diagnostics identify failure modes not apparent from primary metrics alone. EvEMTBench therefore makes generalization in machine-learning-based protection an explicit and reproducible evaluation problem.
[LG-14] RL Starts before RL: On Policy Distillation for Better Reinforcement Learning
链接: https://arxiv.org/abs/2609.28145
作者: Shuai Dong,Yongfu Zhu,Yuqi Xu,Weichu Xie,Liuwenpu,Ziyue Wang,Kaiwen Tuo,Congcong Wang,Siyuan Wang,Wenqi Shao,Shuai Yang,Ji Zhao,Caoyuan Ma,Wenzheng Chang,Taiqiang Wu,Xinlei Yu,Hongrui Wu,Xiaoxuan He,Fangke Chen,Dianyi Wang,Kanghui Tian,Sirry Chen,Xingyu Liu,Xiangnan Wu,Jiawei Guo,Haowen Hou,LingHan Chen,Zhongyu Wei,Jiaqi Wang
类目: Machine Learning (cs.LG)
*备注: 24 pages, 5 figures
Abstract:Reinforcement learning (RL) improves reasoning, but its performance depends on the policy from which training begins. We study on-policy distillation (OPD) as a preparation stage for RL and ask whether its benefits extend beyond improvements in the distilled model’s initial accuracy. Under shared RL settings, students initialized with OPD reach higher final performance than those trained with direct RL or supervised fine-tuning followed by RL. This advantage can emerge even when OPD produces little immediate improvement in accuracy. Pre-RL Pass@k does not fully explain the benefit: similar or even higher values do not necessarily lead to better performance after RL. Behavioral analyses point to alignment with the teacher’s distribution beyond top-1 agreement as a possible explanation. Such alignment may favor higher-quality reasoning paths while retaining alternatives that RL can further refine using outcome feedback. We further examine how trajectory sources and divergence objectives affect the value of distillation for subsequent RL. Standard reverse-KL OPD performs better before RL, but forward-KL OPD overtakes it afterward; with teacher-generated distillation trajectories, reverse KL remains ahead at both stages. These findings suggest that the preferred distillation objective depends on both the trajectory source and the training that follows. Our results support evaluating OPD as preparation for RL and selecting distillation choices by the performance achieved after subsequent training.
[LG-15] Probabilistic and Geometry Aware Neural Surrogate of Scrape Off Layer Plasma Simulations
链接: https://arxiv.org/abs/2609.28116
作者: Gabriele Gianuzzo,Stefan Dasbach,Fleur Hendriks,Sven Wiesen,Vlado Menkovski
类目: Machine Learning (cs.LG); Plasma Physics (physics.plasm-ph)
*备注:
Abstract:Fast surrogates for tokamak boundary-plasma simulation are typically deterministic regressors mapping a global operating point to a flattened vector of cell values. Near the divertor detachment transition the steady state is not reliably single-valued. A point estimate must average over qualitatively different plasma states, and it arrives with no statement of confidence. Moreover, the flattened vector representation discards the geometric structure of the SOLPS-ITER mesh. This work addresses both problems. We unroll the curvilinear mesh into three fixed-size image tensors whose layout preserves cell adjacency and inverts exactly, letting a convolutional network act on the geometry without loss of information. A conditional flow matching model, well suited to highly sensitive systems, is then trained on this representation. The result is an efficient, scalable surrogate that captures multiple plausible outcomes even at sensitive operating points. Along a gas-puff scan, the predictive distribution splits into a hot and a cold mode across an early regime transition. A further check on synthetic data with an injected bifurcation of known size confirms the model recovers both branches rather than their average.
[LG-16] Shared Global KV with Layer-Specific Local History
链接: https://arxiv.org/abs/2609.28006
作者: Xinglang Xian
类目: Machine Learning (cs.LG)
*备注: 41 pages, including supplementary material
Abstract:Decoder-only Transformer language models cache keys and values (KV) to reuse past computation during generation. Sharing KV across layers saves storage but reduces the diversity of representations available across depth. We study what local memory should retain alongside shared global KV, separating historical content from the input source used to form it. At 126M parameters and 2K context, an eight-seed study finds about 1.4% lower held-out test perplexity with local history than with a current-token local branch. Capacity, entry-count and training-compute controls support the value of historical content. In a two-seed comparison, this value persists when adjacent layers share local inputs while retaining independent projections; source sharing also shortens exact cache-construction dependencies. Against GQA and adjacent-layer KV sharing, equal bounded learning-rate searches and new-seed confirmation yield better same-source likelihood with larger caches and higher long-request latency. The ordering against adjacent-layer sharing persists after equal-token adaptation to 8K, with a short-context cost. The eight-seed external-book history effect remains uncertain, and downstream outcomes vary by task. We derive a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic.
[LG-17] Learning from Failures: Heterogeneous Graph Memory for Small Language Model Tool-Using Agents
链接: https://arxiv.org/abs/2609.28003
作者: Jiaxing Li,Lei Song,Rui Dong,Youyong Kong
类目: Machine Learning (cs.LG)
*备注:
Abstract:Small and medium-sized language models offer cost-effective executors for tool-using agents, making them attractive for local and large-scale deployment. However, in long-horizon and stateful environments, they often make structural errors such as missing required observations, performing premature writes, repeating failed calls, and violating action preconditions. These errors can lead to incorrect state updates, policy violations, and costly or irreversible consequences, making reliable tool execution a critical deployment challenge. Existing fine-tuning approaches require substantial data and computation, while flat memory may retrieve failed actions without preserving their causal context or safety conditions. In this paper, we propose FRESH, a Failure-aware Retrieval framework over Experience-Structured Heterogeneous graphs, which transforms historical successes and failures into structured external experience for tool-using agents. By explicitly modeling the dependencies among tasks, actions, errors, repairs, and execution conditions, FRESH helps frozen language models reuse reliable strategies, avoid recurring failures, and make safer decisions in stateful tool interactions. Experiments on \tau -Bench and AppWorld with multiple open-source models show that FRESH consistently improves task success and tool-use reliability over no-memory agents and representative memory-based baselines.
[LG-18] PCQC: Privileged Counterfactual Question Credit for Multi-Turn Medical Dialogue
链接: https://arxiv.org/abs/2609.27987
作者: Chenxuan Li,Jiayi Wan,Xinrong Chen,Zhongyu Zhao,Xuecheng Shang,Peixing Wan
类目: Machine Learning (cs.LG)
*备注: 19 pages, 4 figures, 13 tables
Abstract:Large language models (LLMs) have made substantial progress on medical question-answering, yet effective medical dialogue also requires learning to ask questions that uncover relevant patient information. To train such dialogue policies, a common pipeline combines supervised fine-tuning with reinforcement learning (RL) based on final diagnostic correctness. However, this outcome-based supervision does not directly distinguish the contributions of individual questions and provides no question-level feedback for unexecuted alternatives. To address this gap, we introduce PCQC (Privileged Counterfactual Question Credit), which uses privileged patient information during training to learn from questions never asked. During training, PCQC makes alternative questions directly comparable at the same dialogue state by using privileged patient facts to construct their answers. A frozen diagnostic scorer evaluates the diagnostic utility of each resulting question-answer pair by how strongly it supports the correct diagnosis. PCQC turns these comparisons into relative question credit that teaches the policy which questions to favor, directly supervising both executed and unexecuted questions alongside outcome-based RL without requiring complete rollouts for the unexecuted alternatives. Extensive experiments across four medical benchmarks demonstrate that PCQC achieves 63.10% mean diagnostic accuracy, outperforming GRPO and ATPO by 4.38 and 4.21 percentage points, respectively. These gains are achieved with 33.1% fewer inquiry turns than GRPO.
[LG-19] Relative Discharge Stage (RDS) Classification: A Practical Indicator of Battery Discharge Progress
链接: https://arxiv.org/abs/2609.27986
作者: Khoa Tran,Tri Le,Hung-Cuong Trinh,Hung Tran-Nam
类目: Machine Learning (cs.LG)
*备注:
Abstract:Accurate remaining discharge time (RDT) prediction is challenging in real-world battery applications because future load profiles are unknown and highly dynamic. To address the uncertainty of continuous RDT regression, this paper introduces Relative Discharge Stage (RDS), a battery-management indicator that represents the remaining discharge condition using five interpretable classes: Normal, Good, Moderate, Low, and Recharge Required. Unlike state of charge (SOC), which reflects the current charge level, RDS characterizes the remaining discharge process without requiring future-current information during inference. A physics-informed RDS classification framework is proposed, combining SOC estimation with lightweight temporal learning. The SOC-estimation component includes second-order ECM state and terminal-voltage prediction, hysteresis and OCV temperature correction, core-temperature estimation, and AEKF state correction, supported by OCV evaluation, online STC-ECM parameter adaptation, and pretrained neural residual-voltage correction. The measured current, terminal voltage, surface temperature, and estimated SOC are arranged into a sliding observation window and processed by a lightweight temporal convolutional network. Experiments on two public lithium-ion battery datasets demonstrate robust RDS classification, with accuracy exceeding 80% under varying load and thermal conditions.
[LG-20] Linear RNN Scaling Laws: When Longer Sequences Beat More Sequences
链接: https://arxiv.org/abs/2609.27964
作者: Ziyan Chen,Zhongzhu Zhou,Peilin Liu,Ding-Xuan Zhou
类目: Machine Learning (cs.LG)
*备注: 43 pages, 3 figures
Abstract:Empirical scaling laws for autoregressive language models relate prediction loss to model size, data size, and optimization compute, but their theoretical origin is still poorly understood in sequential pretraining settings. We study this question in a tractable teacher–student model where a stable latent linear RNN generates trajectories and a sketched linear recurrent student is trained by safeguarded full-batch WSD gradient descent on next-token prediction. The sketch dimension M plays the role of model size, while N independent trajectories of length P provide the training tokens. We allow the innovation and initialization covariances to have different power-law exponents \alpha and \theta . The induced design spectrum produces explicit approximation, optimization, and statistical scaling laws separated by spectral crossovers. When \theta\ge\alpha , the original one-scale rates M^1-\beta_\alpha , R^(1-\beta_\alpha)/\alpha , and (NP)^-1\min\M,R^1/\alpha\ are recovered. When \alpha-2r\le\theta\alpha , the heavier initialization tail changes the rates beyond P -dependent model and optimization crossovers. The proof uses a covariance event only internally and a globally safeguarded step size on its complement. The variance retains the factor (NP)^-1 , while sequence length also suppresses the initialization transient, so N and P cease to be fully interchangeable in the two-scale regime.
[LG-21] I-SplineFlow: Learning Monotone Spline Stochastic Interpolant Schedulers for Few-Step Generation
链接: https://arxiv.org/abs/2609.27963
作者: Md Sakib Hossain Shovon,Md Rifat Ur Rahman,Md Abtahi Majeed Chowdhury,Yunhong Min,Jaesik Choi,Minhyuk Sung
类目: Machine Learning (cs.LG)
*备注:
Abstract:Few-step generation with pretrained diffusion and flow models can be accelerated by lightweight training that optimizes the sampling trajectory rather than the network. A recent approach parameterizes the stochastic interpolant (SI) scheduler as a smooth curve whose control points enforce the three properties an SI scheduler must satisfy: fixed boundary conditions, a monotone signal-to-noise ratio (SNR), and differentiability. Existing parameterizations use globally supported polynomial bases, where every control point moves the whole curve and higher expressiveness needs a higher degree, which couples distant regions of the schedule during optimization. We introduce \emphI-SplineFlow, which parameterizes the scheduler with integrated monotone splines (I-splines). I-splines decouple the polynomial degree from the number of mixture weights, so support width and smoothness can be chosen per model at a fixed weight count, and the compactly supported derivative basis makes the scheduler Jacobian orders of magnitude better conditioned than a Bézier basis. Boundary conditions and a strictly monotone SNR hold by construction, with no ordering constraint on the parameters and closed-form velocity derivatives. Across diffusion (EDM) and flow (ReFlow, Simple ReFlow) models, I-SplineFlow improves few-step FID over Bézier scheduling in most settings, most clearly at the lowest NFEs, and trains in minutes. Ablations show that both the degree freedom and the monotonicity constraint are needed. The code will be released upon acceptance.
[LG-22] CS-WCP: Robust Conformal Sets for LLM -Judge Traffic Shifts with Uncertain Group Proportions
链接: https://arxiv.org/abs/2609.27955
作者: Ibne Farabi Shihab,Fariya Afrin
类目: Machine Learning (cs.LG)
*备注:
Abstract:Prediction sets built from an LLM judge can undercover when deployment traffic changes the prevalence of task or policy groups. Weighted conformal prediction is exact under covariate shift when the density ratio is known, but group proportions must usually be estimated from finite unlabeled samples. We introduce confidence-set weighted conformal prediction (CS-WCP), which constructs simultaneous exact intervals for source and target group masses and returns the union of weighted conformal sets over every compatible ratio vector. For a fixed or independently learned finite partition, CS-WCP attains coverage at least 1-alpha-delta_w-tau_A-kappa, where tau_A measures within-cell covariate mismatch and kappa measures conditional shift. A linear endpoint rule computes the robust union in O(G|Y|) time. Across 336 constructed shared-support traffic shifts, CS-WCP reaches 0.973 mean coverage with 13 point failures, compared with 0.954 and 44 failures for source conformal prediction, at mean binary set sizes 1.74 and 1.65. On 336 natural cross-task transfers, coverage rises from 0.882 to 0.962, but mean set size reaches 1.87 and a size-matched group plug-in baseline is competitive. The method therefore supplies an auditable coverage safeguard under uncertain mixture weights; its value is conservative tail protection, not scalar probability calibration or uniformly smaller sets.
[LG-23] When Accuracy Gaps Fail to Certify: Auditing Cross-Domain Recalibration of LLM Judges
链接: https://arxiv.org/abs/2609.27954
作者: Fariya Afrin,Ibne Farabi Shihab
类目: Machine Learning (cs.LG)
*备注:
Abstract:A scalar recalibration map fitted for an LLM judge on one task can fail when the task distribution changes, but the source-target accuracy gap is often treated as a proxy for that failure. We test what this gap can predict and what it can certify across thirteen judges, two generators, eight domains, and 1,176 predeclared transfers. After accounting for mean score shift, the gap yields a population lower bound on target calibration error, yet identical gaps can induce opposite transfer outcomes. Exact importance weighting recovers target proper loss under covariate shift, so failure of an estimated weighting pipeline does not by itself establish conditional shift. A finite-sample simultaneous lower certificate converts the population bound into a one-sided rejection rule using audit labels disjoint from evaluation outcomes. The leak-free gap correlation is 0.25 (95% CI [-0.09, 0.55]), falls to 0.09 on the second generator, and does not support a generator-invariant association. The certificate retains nominal coverage but has power 0.13 even at m=1024, whereas target-domain temperature scaling with 16 labels reaches harm rate 0.09, compared with 0.34 for source-fitted Platt scaling. Accuracy gaps are therefore weak warning signals for scalar probability transfer, not deployment certificates.
[LG-24] Enhancing Multiclass Malware Classification in Resource-Constrained Environments
链接: https://arxiv.org/abs/2609.27950
作者: Abdul Khalek Alve,Alif Rahman,Saadman Zaman,Sazzad Hossen Himel,Muhammad Iqbal Hossain
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:The emergence of multi-class malware attacks such as ransomware, spyware, trojans, etc., presents an increasing and serious threat to cybersecurity, particularly in resourceconstrained environments like IoT devices. Existing machine learning models have achieved nearly perfect accuracy in binary malware classification but fall short in terms of classifying malware families and individual malware. Additionally, the complexity of these multi-class malware attacks presents a significant challenge of detection in resource-constrained environments, as multi-class detection usually requires high computational capability. This research bridges the gap by enhancing the detection accuracy of multi-class malware classification as well as developing a lightweight model that can run efficiently on resource-constrained devices. In this paper, we propose a robust, lightweight machine learning model featuring LightGBM classifier with SMOTE oversampling and SOM-US undersampling techniques for data balancing, as well as well-engineered feature selection through Genetic Algorithm. The model performed better than the current state-of-the-art models developed on the same dataset in both malware family classification (4 classes) and individual malware type classification (16 classes) with accuracy of 89.1% and 76% respectively. Thus, maintaining a balance between classification accuracy and computational efficiency in resource-constrained environments. Furthermore, we propose another model using Random Forest classifier with an accuracy of 91.2% in malware family classification and 78.7% in individual malware classification. Demonstrating a significant enhancement in terms of accuracy from the current state-of-the-art models.
[LG-25] Quality over Quantity: Semi-Supervised Detection of Illicit Bitcoin Flows via Feature Engineering
链接: https://arxiv.org/abs/2609.27936
作者: Yekaterina Smolenkova,Nickolay Larionov,Nikolay Ivanov,Yury Yanovich
类目: Machine Learning (cs.LG)
*备注:
Abstract:Detecting illicit cryptocurrency transactions is hampered by extreme class imbalance, adversarial obfuscation, and a scarcity of reliable labels. While semi-supervised learning (SSL) offers a promising solution by leveraging unlabeled data, we show that its success is not guaranteed by data volume alone but is contingent on data quality. We introduce an SSL framework for detecting illicit Bitcoin flows in Shared Send Mixers (SSM) transactions, built on a comprehensive historical dataset comprising 163 million transactions. Our main conclusion is that the success of SSL depends on data quality rather than volume: high-fidelity features such as KeyLinker address clustering and Shared Send Untangling (SSU) complexity metrics achieve an F1 score of 0.84 on unlabeled data. Finally, we empirically show that common heuristics like One-Time Change (OTC), though abundant, introduce noise, while strategic reliance on higher-fidelity features like KeyLinker is essential. Our work establishes that in blockchain forensics, the path to better performance lies in smarter feature engineering for data quality, not just larger datasets.
[LG-26] Binary Quantized Neural Network Training Is W[1]-Hard Parameterized by Input and Output Dimensions
链接: https://arxiv.org/abs/2609.27932
作者: Tao Jiang,Minbo Gao,Shaowei Cai
类目: Machine Learning (cs.LG)
*备注:
Abstract:Ganian et al. (ICLR 2026) proved that quantized neural network training is fixed-parameter tractable when parameterized jointly by architecture treewidth, input dimension \alpha , and output dimension \omega , and left open whether \alpha+\omega alone yields fixed-parameter tractability. We prove that 2-QNNT is W[1]-hard parameterized by \alpha+\omega . The hardness already holds with zero error on D_k=(\xi^®,\xi^®):0\le r\le k\ , where every input equals its target, |D_k|=\alpha=\omega=k+1 , and the examples form a coordinatewise prefix chain. It also holds when every non-source bias is fixed to zero. Under the Exponential Time Hypothesis, no algorithm runs in f(\alpha+\omega)|I|^o(\alpha+\omega) for any computable f . The reduction starts from DAG edge-disjoint paths, converts edge capacity to vertex capacity with a directed line graph, and normalizes the result into a valid layered architecture. The key structural step is a one-flip routing equivalence: on the prefix-chain inputs, nonnegative binary weights make every activation monotone, and each required output transition has a weight-one predecessor making the same transition. Iterating this relation backward extracts a path from the unique changing input, while different transitions yield vertex-disjoint paths. In particular, every neuron on these inputs has only k+1 possible activation profiles.
[LG-27] Reliable Fusion of Conflicting Experts
链接: https://arxiv.org/abs/2609.27913
作者: Pranuthi Tenali,Sahil Sidheekh,Saurabh Mathur,Vijayalakshmi Saravanan,Erik Blasch,Kristian Kersting,Sriraam Natarajan
类目: Machine Learning (cs.LG)
*备注:
Abstract:We study the problem of aggregating opinions from multiple black-box experts in noisy, conflict-prone settings where expert reliability varies across inputs. Static aggregation methods, such as majority voting, fail to capture this variability and often yield unreliable outcomes under disagreement. We propose a tractable, probabilistic-circuit-based fusion framework that dynamically combines expert responses using context-specific credibility estimates, enabling principled and reliable reasoning. The framework is agnostic to the underlying experts and does not require access to their internal representations or any retraining. We empirically validate our approach on multiple-choice question answering tasks using multiple LLMs as experts, comparing against individual models and static ensemble baselines. Our method consistently improves predictive performance and produces more reliable decisions under conflict, highlighting the effectiveness of context-aware credibility modeling for robust multi-expert fusion.
[LG-28] Global tree forecasters collapse at the hierarchical aggregate: a five-panel failure characterization
链接: https://arxiv.org/abs/2609.27912
作者: Md Rezwanul Islam,Wael Mohammed
类目: Machine Learning (cs.LG); Econometrics (econ.EM); Applications (stat.AP)
*备注: 34 pages, 6 figures
Abstract:Global forecasting models pool many series and learn one shared function. Gradient-boosted trees are their most common form. We measure a failure of this design that has not, to our knowledge, been documented. Train a global tree on the individual series of a hierarchy, then ask it for the hierarchical aggregate. The aggregate sits far outside the model’s training range, and the forecast collapses. The model under-predicts the total by 30-50x in our production deployment, and by up to 496x in a public M5 reconstruction. The mechanism is known: beyond its training range, a tree predicts a constant. It surfaces at the aggregate because the total dwarfs every training series. The cure is not new. Per-series scaling, the preprocessing step that Montero-Manso and Hyndman (2021) recommend, prevents the collapse. So do a weighted aggregate-level training row and seasonal differencing. Our contribution is the characterization. The collapse reproduces on five panels: a production business-to-business marketplace, a synthetic hierarchy, M5, Australian Tourism, and a public business-buyer panel. It holds on three tree libraries, is invariant across training seeds, and is statistically significant. Its onset is immediate and tracks a simple support bound: a scale gap of only 1.15x already costs a third of the total. No standard configuration change prevents it: pooling every hierarchy level into training fails at scale, and the one knob that fits linear models in the leaves softens it without curing it. Rolling the forecasts forward recursively separates the cures: the aggregate-row cure re-collapses, per-series scaling degrades but stays low, and only seasonal differencing keeps its one-step accuracy unchanged. We close with a three-step procedure for diagnosing and preventing the failure in deployed systems.
[LG-29] Evaluation Choices Decide the Forecasting Leaderboard: Evidence from a Production Marketplace Panel
链接: https://arxiv.org/abs/2609.27867
作者: Md Rezwanul Islam,Wael Mohammed
类目: Machine Learning (cs.LG); Applications (stat.AP); Methodology (stat.ME)
*备注: 18 pages, 8 tables, 1 figure. Evaluation protocol and audit scripts included as ancillary files
Abstract:A forecasting benchmark reports which method won. We show that the answer is set by the evaluator’s choices before any model is fitted. We benchmark 24 forecasting methods and one textbook reference, including six 2025-era time series foundation models, on a production marketplace panel of 1,887 business customers over 67 months. We hold the data, the horizon and the period fixed, and vary only the evaluation design. Three choices each reverse or dissolve a headline conclusion. Changing the unit of analysis from the market total to the individual customer moves our production baseline from second of nineteen, beaten by nothing, to twenty-third of twenty-five. Nineteen of its twenty-four challengers beat it there. Changing how much error is pooled decides whether a Diebold-Mariano test finds anything at all. Scoring prediction intervals rather than point forecasts reorders the field almost completely, with a rank correlation of 0.02 on intermittent demand. We then measure what the deployed system gets from this. Its selection rule captures 55% of the distance between doing nothing and choosing with hindsight. The reversal is not a quirk of our data. We ran the released protocol, unchanged, on the public M5 retail panel. The same baseline shape places first at the market total and last per series, beaten by everything, and a replayed selection rule closes 64.7% of the same floor-to-ceiling distance there. Adding five zero-shot foundation models to that roster changes who wins at the total, not the shape. The bands’ blind spot travels too: conformal bands under-cover most on the spikiest items. Splitting our own panel into ever smaller groups turns the contrast into a curve: the baseline’s rank worsens at every level of disaggregation. We release the evaluation protocol and report an error of our own that inverted a result before we caught it.
[LG-30] Exact Minimax One-Bit Unbiased Compression: Heavy-Tail Necessity and Finite-Randomness Approximation
链接: https://arxiv.org/abs/2609.27860
作者: Tao Jiang,Minbo Gao,Shaowei Cai
类目: Machine Learning (cs.LG)
*备注:
Abstract:A pointwise-unbiased one-bit compressor reconstructs every real input in expectation while transmitting one bit. For a scalar source P with CDF F , mean m , and \mathcal J§=\int_\mathbb R\sqrtF®(1-F®),dr , we prove that the infimum of the source-averaged reconstruction second moment over all public-coin one-bit codes unbiased on \mathbb R is m^2+\mathcal J§^2 . For regular full-support sources, a distribution-centered random-threshold code attains this value; a converse over arbitrary randomized binary encoders and an equality analysis characterize every attaining code up to null sets, bit relabeling, and public-seed refinement. For the Gaussian location family \mathcal N(\mu,\sigma^2) with |\mu|\le c\sigma , the equal prior on the endpoint means is least favorable and the minimax value is \sigma^2\Lambda_c^2 . Exact Gaussian minimax optimality forces a critical heavy tail: at the endpoint means, absolute moments are finite exactly for p3 , and \Pr(Wt)=\Theta(t^-3/\sqrt\log t) . A Cauchy-mixture robustification inflates the second moment by at most 1/(1-\eta) while making every positive-order absolute moment finite. Finite-support public randomness with finite decoder means cannot achieve exact unbiasedness on \mathbb R , but a bounded-output approximation using exactly R shared random bits has explicit bias and second-moment bounds converging to the minimax constant. Finally, coordinate allocation communicates exactly B bits per Gaussian-gradient query. On Kim’s continuous quadratic hard family, the expected optimization guarantee matches the lower bound in its dependence on (\sigma,d,B,\varepsilon) , and a finite-variance high-probability bound incurs only a logarithmic confidence factor.
[LG-31] ChronosAttack: Adversarial Tool Scheduling Attacks on LLM Agents
链接: https://arxiv.org/abs/2609.27857
作者: Arash Vashagh
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:Large language model (LLM) agents often process external tool responses as they arrive, making response timing part of the decision process. We introduce ChronosAttack, a delay-only scheduling attack that changes when authentic tool responses arrive without modifying, adding, removing, or accelerating them. Bounded delays can change the order of the same evidence and alter the final decision. We evaluate ChronosAttack on GPT-5.6 Sol, Gemini 3.6 Flash, DeepSeek V4 Flash, and Claude Sonnet 4.6. GPT-5.6 Sol and Claude show strong targeted shifts in vulnerable settings, Gemini shows large shifts in the opposite direction, and DeepSeek is more stable under the tested schedules. We also find that sequential agent state is not always required and that a single scheduling inversion can cause a large decision change. Synchronization and order-consistency defenses reduce attacker control over observation order. These results show that tool-response timing can itself form an attack surface in asynchronous LLM agents.
[LG-32] From Reasoning Strings to Partial Orders: Verifier-Certified Rule Transport through Quotient Policy Optimization
链接: https://arxiv.org/abs/2609.27833
作者: Bang Xie,Hao Liu,Zhiyuan Peng,Xin Yin,Chenhao Ying,Yuan Luo,Senjian Zhang,Wei Chen
类目: Machine Learning (cs.LG)
*备注: 9 pages, 2 figures, 4 tables
Abstract:Many computations admit several valid execution orders because independent subgoals or disjoint state updates can commute. Reinforcement learning with verifiable rewards usually treats each successful trace as a separate token sequence, so serialization choices can be mistaken for logical dependencies. We introduce Verifier-Certified Rule Transport (VCRT), which replays adjacent operation pairs with native verifiers. Pairs whose two orders are accepted and reach the same canonical state provide commutation certificates; rejected or state-changing reversals provide anti-diamonds. VCRT uses anti-diamonds to preserve genuine prerequisites and assigns policy credit to the total probability mass of each certified orbit. It also constrains post-swap consistency, source retention, and policy drift. We evaluate leave-one-environment-out transfer across ProofWriter, CLRS, and Lean through a shared anonymized relation-graph interface. All training and checkpoint decisions are frozen before held-out evaluation, which uses one greedy trajectory per item without search or verifier feedback. VCRT obtains a 77.60% macro pass rate versus 64.53% for the strongest matched baseline, a paired gain of 13.06 points (95% bootstrap CI [12.58, 13.54]). Lean accounts for most of this gain at 33.49 points, while ProofWriter and CLRS improve by 2.85 points on average. Mechanism tests consistently favor anti-diamond supervision, whereas No-Orbit is statistically indistinguishable from full VCRT. The evidence does not establish a general benefit from exact orbit aggregation.
[LG-33] CAST: Context- and Anomaly Structure-Conditioned Time Series Anomaly Generation
链接: https://arxiv.org/abs/2609.27825
作者: Haochen Zhang,Jie Peng,Songyuan Sui,Yu-Chao Huang,Xiangqi Zhu,Tianlong Chen
类目: Machine Learning (cs.LG)
*备注:
Abstract:Anomalous time series play a critical role in safety-critical domains, yet they are inherently scarce, heterogeneous, and costly to obtain. Existing time series generation methods predominantly focus on synthesizing normal data, providing limited value when anomalous samples are needed. We identify two fundamental challenges in anomaly generation: (i) the scarcity of anomaly data, and (ii) the heterogeneous morphological characteristics of anomalies. To address these challenges, we propose CAST, a Context- and Anomaly Structure-conditioned Time series anomaly generation framework with principled two-stage pretraining and finetuning strategy. In pretraining stage, we leverage abundant normal time series data to learn underlying system dynamics and substantially mitigate the limited availability of anomaly data. During finetuning, CAST explicitly conditions the generator on learned anomaly structure representations, enabling it to capture heterogeneous anomaly morphologies under similar contextual conditions. Extensive experiments on multiple real-world univariate and multivariate datasets demonstrate that CAST consistently outperforms state-of-the-art anomaly generation methods in terms of both generation fidelity and downstream task utility, highlighting the effectiveness of the proposed approach.
[LG-34] When Adaptation Hurts: Split Sensitivity and Person-Level Negative Transfer in Federated Wearable Onboarding
链接: https://arxiv.org/abs/2609.27819
作者: Rahil Aftab,Vineet Kumar Rakesh,Soumya Mazumdar,Tapas Samanta
类目: Machine Learning (cs.LG); Distributed, Parallel, and Cluster Computing (cs.DC)
*备注: 14 pages, 2 figures, 4 tables; supplementary material included. Code and supplementary scripts: this https URL
Abstract:Federated wearable models eventually serve people absent from source training, but favorable average accuracy does not establish that unlabeled onboarding helps each person. We evaluate six core onboarding strategies on five wearable datasets under a leakage-controlled protocol that fixes source checkpoints, estimates normalization from source data only, separates calibration from evaluation recordings, and performs inference over held-out people rather than windows, devices, or random seeds. Completing all eligible HHAR and PAMAP2 outer-person rotations materially changes the conclusion obtained from the original frozen fold. On HHAR, balanced accuracy on that single person is 95.6-97.2% across methods versus 78.3-83.0% over all nine users, a reduction of 13.8-17.8 percentage points (pp). The displayed mean leader changes on both datasets, while paired leader-runner bootstrap intervals include zero and do not resolve a superior method. No adaptive core mechanism combines positive mean gain in all five datasets with zero seed-averaged person-level losses greater than 2 percentage points (pp). FedBN has one such loss and ATP-style adaptation has eight; Feature-only has none after seed averaging, but its exact one-sided 95% upper bound is 7.6%. A complementary seed-person stress audit records 4, 22, and 10 harmful realizations out of 114 for FedBN, ATP-style, and Feature-only, respectively; these are repeated realizations, not independent participants. Tail quality, calibration availability, and fall-window specificity reveal additional failures hidden by mean accuracy. The study therefore provides an auditable development benchmark and failure map rather than a universal-superiority or deployment-safety claim.
[LG-35] Learning to Detect Symbolic Failure: Machine Learning and the Limits of Black-Scholes
链接: https://arxiv.org/abs/2609.27764
作者: Juli Huang,Jake Cheng,Rupert Lu
类目: Machine Learning (cs.LG); Computational Engineering, Finance, and Science (cs.CE)
*备注: 9 pages, 3 figures, accepted to Machina Stanford Journal
Abstract:We treat options pricing as a representation problem: can machine learning detect systematic deviations from Black-Scholes using 2.6M real option contracts? We compare three regimes: learned abstract embeddings (Kernel PCA), preserved domain structure (tree-based ensembles), and neural network validation. Tree-based methods outperform kernel dimensionality reduction by 21.5 percentage points (93.8% vs 72.3%), and domain-expert features (Greeks, moneyness) outperform engineered features. NN-based and BS-based deviation labels agree 99.9974% of the time, suggesting deviations reflect market structure rather than model artifact. We conclude that in domains with expert-designed symbolic features, preserving structure beats learning abstractions. We make no claim of exploitable mispricings.
[LG-36] “Whats That Sound?”: A Versatile Robust and Lightweight Convolutional Transformer for Environment Sound Recognition
链接: https://arxiv.org/abs/2609.27762
作者: Julia Huang
类目: ound (cs.SD); Machine Learning (cs.LG)
*备注: 6 pages, 7 figures, published to IYRC Conference Proceedings
Abstract:The conventional hearing aid is both costly and lim- ited in usage, as it is not intended to detect non-speech audio. Our objective is to develop a machine learning solution to provide a more accurate and affordable mechanism to identify surrounding sounds to improve the safety of the hearing impaired, i.e., if a car is honking behind pedestrians, or a gunshot is fired, and they need to move away from the source. By adding randomized augmentations to audio, concatenating a Mel-Frequency Cepstral Coefficients (MFCCs) diagram and a log-mel Spectrogram, and including Convolutional Neural Networks (CNNs) in a Trans- former architecture, the Randomized Audiomentational Layered Convolutional Transformers (RALCT) model efficiently extracts features from diversified audio representations. In addition, RALCT is small enough, with only approximately 310,000 parameters, to be deployed into mobile devices. Experimental results on the UrbanSound8K dataset resulted in an accuracy consistently over 93% for all variations of RALCT with the highest at 94.56%, reaching state-of-the-art levels. To leverage the capabilities of this technology, a mobile app is developed to be integrated with the model to provide real-time safety control. RALCT thus represents a robust, lightweight, affordable, and versatile deep learning tool to aid the navigation and safety of the hearing impaired.
[LG-37] Less Language More Latents: Annotation-Efficient VLAs for Driving
链接: https://arxiv.org/abs/2609.27747
作者: Alexey Zakharov,Kemal Oksuz,Puneet K. Dokania
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注:
Abstract:Vision-language-action models (VLA) promise human-steerable autonomous driving, but their training is bottlenecked by the scarcity of frames paired with natural-language instructions: while camera streams and expert trajectories are logged at scale, language annotations (e.g., turn left at the intersection) remain scarce and expensive to acquire. To address this challenge, we introduce Latent Action Driving Annotations (LADA), a three-stage pipeline that transforms abundant unlabelled observation-trajectory pairs into a substrate for language-conditioned control. First, we train a latent action model with a vector-quantised bottleneck, producing a compact codebook of high-level vehicle intents. Second, a small language-annotated subset is used to train a vision-language translator to map observations and language instructions into this codebook. Third, we train a driving VLA on observation-latent-action pairs over the full unlabelled corpus. Using fewer than 5% of language annotations and without leveraging any auxiliary chain-of-thought reasoning or visual question answering streams, LADA achieves a Driving Score of 87.98 and a Success Rate of 70.46% on the closed-loop Bench2Drive benchmark, matching or surpassing fully supervised baselines.
[LG-38] Limiting-Kernel Q(λ): Bridging Short and Long Horizons
链接: https://arxiv.org/abs/2609.27741
作者: Tolga Ok,Arman Sharifi Kolarijani,Peyman Mohajerin Esfahani,Mohamad Amin Sharifi Kolarijani
类目: Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注:
Abstract:In value-based reinforcement learning, improving the accuracy of policy evaluation has been shown to improve downstream policy optimization performance. The widely adopted family of approximations relying on n -step truncation yields computationally efficient value estimators but is inherently limited to a short evaluation horizon. In contrast, methods that exploit the global structure of the transition dynamics can accelerate policy evaluation, but their memory and computational requirements often limit scalability to large or continuous state spaces. To reconcile these limitations, we introduce Limiting-Kernel Q( \lambda ) (LKQL), an off-policy value estimator that combines n -step truncation with a long-horizon approximation based on the limiting kernel (LK). LKQL has the same order of complexity as n -step estimators and integrates directly into both on- and off-policy actor-critic algorithms. We prove that, under aperiodicity and in the near-on-policy regime, the operator underlying LKQL improves the policy evaluation convergence rate over its truncated counterpart for sufficiently large n , and that LKQL itself converges almost surely to the optimal values in finite Markov decision processes (MDPs) under a fixed behavior policy. On the MuJoCo continuous-control benchmark, we show that LKQL improves over n -step baselines in most settings, particularly on long-horizon tasks.
[LG-39] MENO: Memory-Efficient Neural Operator
链接: https://arxiv.org/abs/2609.27739
作者: Shengyang Xu,Weijun Zhang,Jun Hu,Pengzhan Jin
类目: Machine Learning (cs.LG)
*备注:
Abstract:We propose the Memory-Efficient Neural Operator (MENO) as a high-performance PDE neural solver based on the Manifold Function Encoder (MFE). MENO features three primary advantages: (1) MENO has a significantly smaller memory footprint and much faster training speed than other popular architectures, with the memory footprint being independent of the data resolution, and therefore holds the potential for scaling up to large-scale models. (2) MENO can accept PDE inputs of arbitrary form, including arbitrary geometric domains and arbitrary discretizations. In particular, it is capable of handling cross-geometry scenarios, i.e., where the input functions and the output solutions are defined on different manifolds. (3) MENO exhibits strong generalization capability, and achieves the best accuracy on most of the benchmarks we tested, compared with the results reported in the literature. The code is available on GitHub at this https URL, and all numerical examples in this paper can be run with a single command to reproduce the reported results.
[LG-40] NS-ATTENTION: Newton-Schulz Transformations of Attention Outputs in Vision Transformers ICASSP2027
链接: https://arxiv.org/abs/2609.27735
作者: Xiaohe Jiang(1),Guoqiang Zhang(1),Tianjin Huang(1),Ronghui Mu(1) ((1) University of Exeter)
类目: Machine Learning (cs.LG)
*备注: 5 pages, 2 figures. Submitted to IEEE ICASSP 2027
Abstract:Newton-Schulz (NS) iteration has recently been used in the Muon optimizer to transform update matrices during the training of large language models. Motivated by its spectral effect, we investigate applying NS directly to Transformer attention representations. We introduce Newton-Schulz Attention (NS-Attn.), a parameter-free transformation applied to the output of each attention head. Each head output is arranged as a feature-by-token matrix and normalized by its Frobenius norm. We then apply a finite NS polynomial step and restore the original norm. The objective is to reduce spectral concentration and increase effective rank before standard head merging and output projection. Across ViT and Swin on CIFAR-10 and CIFAR-100, NS-Attn. improves final-epoch accuracy in all 12 matched-seed comparisons, with mean gains of 0.25–0.83 percentage points. ViT ablations show higher mean accuracy with one iteration than with two. Spectral analysis further shows reduced leading-eigenvalue concentration and increased effective rank. These gains incur additional inference latency.
[LG-41] What Do Tabular Foundation Models Compute In Context? In-Situ Representation Refinement through Attention-Gated Updates
链接: https://arxiv.org/abs/2609.27679
作者: Tian Zhou,Beverly Jin,Linxiao Yang,Xue Wang,Wenwei Wang,Bingqing Peng,Mengni Ye,Jinjie Gu,Liang Sun
类目: Machine Learning (cs.LG)
*备注:
Abstract:What reusable computation should a tabular foundation model learn when every table defines a new supervised task? We develop in-situ representation refinement: support labels guide updates to the episode’s representations, and these updates transfer to unlabeled queries without changing model parameters. A regularized leave-one-out objective yields a support correction and its query extension. The leading term separates attention-based reading from state-dependent scaling, motivating RefineICL: an attention-gated, FFN-free contextual stack with selected low-rank feature interaction and typed memory. RefineICL-L24 reaches 0.93836 OVR-AUC and 0.87173 accuracy on AMLB29. A benchmark-informed continuation reaches 1644.8 Elo on the 38-dataset TabArena snapshot, 31.4 Elo above TabPFN-3 under the same evaluation. It also improves all four reported metrics over TabPFN-v3 on both TabZilla views. In a matched 100K-update depth grid, an expanded FFN gives no consistent validation benefit and uses 60.2% more peak inference memory at L8. Internal interventions show that support representations are more than a static source of labels: removing one intermediate support update, while preserving the query output, increases final query cross-entropy in all 72 tested episodes. Together, the derivation and interventions explain how attention-gated updates can construct a task-specific predictor in context.
[LG-42] Robust Adversarial Reinforcement Learning with Risk Sensitivity and Critic Consistency Regularization
链接: https://arxiv.org/abs/2609.27667
作者: Jiaxi Wu,Tiantian Zhang,Yuxing Wang,Yongzhe Chang,Xueqian Wang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Reinforcement learning (RL) achieves strong performance in sequential decision-making but remains brittle under dynamic uncertainty and distributional shifts. Robust Adversarial Reinforcement Learning (RARL) improves robustness via worst-case perturbations, but existing approaches frequently suffer from unstable optimization and degraded value estimation. In particular, overly aggressive adversaries can drive the agent toward uninformative failure states, while adversarial perturbations amplify disagreement between double critics and introduce biased value targets. We propose a unified framework, RACER (Risk-sensitive robust Adversarial critic ConsistEncy-regularized Reinforcement learning), that revisits adversarial RL from a risk-sensitive perspective. First, we introduce a state-dependent adversarial objective that adaptively regulates perturbation strength, suppressing harmful disturbances while preserving informative exploration. Second, we propose critic consistency regularization to reduce disagreement between Q-value estimators and stabilize learning. Comprehensive experiments on challenging continuous control benchmarks demonstrate that RACER consistently improves performance, robustness, and training stability over strong robust RL baselines.
[LG-43] Private Decentralized Optimization with Noise Reduction and Bias Correction
链接: https://arxiv.org/abs/2609.27658
作者: Yizhao Fan,Wenjian Luo,Jiaojiao Zhang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Private decentralized learning is affected by sampling noise, privacy noise, and decentralized bias under heterogeneous data. We propose Private Recursive Decentralized Optimization (PRDO). PRDO uses recursive estimation with same-batch gradient differences to reduce estimation errors caused by sampling and privacy noise, while its Exact Diffusion component corrects decentralized bias arising from data heterogeneity. Our analysis establishes a nonconvex convergence bound without assuming uniformly bounded data heterogeneity across nodes. It further gives a sufficient condition under which recursive gradient differences yield strictly lower query sensitivity than private Exact Diffusion, together with an example that rigorously satisfies this condition. Experiments show improved accuracy over the evaluated baselines.
[LG-44] Pheno-GS: Phenoscape-scale Geodesic Sinkhorn
链接: https://arxiv.org/abs/2609.27633
作者: Alistair Wilkinson,Christopher J. Tape,Smita Krishnaswamy
类目: Machine Learning (cs.LG); Quantitative Methods (q-bio.QM)
*备注:
Abstract:High-throughput single-cell data is now collected across large patient cohorts. Understanding patient-level heterogeneity from cellular-level data motivates phenoscaping: embedding each single-cell distribution as a “datapoint,” with distances given by optimal transport (OT). Computing geometry-aware OT at this scale, between all pairs of patient datasets, remains an open challenge, since existing methods either rely on Euclidean ground metrics that distort manifold structure or fail under sparse, unevenly sampled, or large-scale data. We present \textbfPheno-GS (Phenoscape-scale Geodesic Sinkhorn), which computes accurate, scalable geodesic transport distances under noisy, unbalanced, large-scale settings via three components: ( 1 ) graph connectivity regularization for well-defined geodesics on sparse/disconnected manifolds; ( 2 ) an unbalanced OT formulation via KL marginal penalties; and ( 3 ) a batched matrix algorithm computing all pairwise distances in one heat diffusion (over 200 \times faster than Geodesic Sinkhorn for 500 distributions). We validate Pheno-GS on synthetic benchmarks and a CyTOF perturbation dataset.
[LG-45] Efficient Linear Bandits via Cluster-Aware Sketching
链接: https://arxiv.org/abs/2609.27594
作者: Hantao Yang,Hong Xie,Defu Lian
类目: Machine Learning (cs.LG)
*备注:
Abstract:We study the problem of computational efficiency for linear bandits in high-dimensional settings with a finite arm set. In linear bandits, the increase in the dimension d of the feature vectors leads to growing computational costs of O(d^2) at each round of update. Traditional sketching-based methods such as SOFUL reduce computation via fixed-size matrix sketching, yet run the risk of incurring vacuous linear regret when the spectral tail of the data is heavy and the sketch size is inadequately selected. To guarantee regret convergence and effectively reduce computational costs, we introduce a clustering mechanism and propose the Cluster Sketch Linear Bandit (CS-LB) algorithm. Our method preserves the full covariance information in each cluster to guarantee robust sublinear regret without spectral-tail vulnerabilities, performs cluster switching by assigning a sentinel for each cluster, and reduces per-round update computation to O(l^2d) via a tunable sketch size ld . Experiments on synthetic datasets demonstrate that our method consistently maintains a favorable trade-off between efficiency and regret.
[LG-46] VCMM: Variance-Calibrated Momentum for Multimodal Learning
链接: https://arxiv.org/abs/2609.27577
作者: Zhongjing Gu,Chenyang Huang,Yufa Feng,Chong He,Qinxu Ding,Yiming Cui
类目: Machine Learning (cs.LG)
*备注:
Abstract:Multimodal joint training often suffers from modality imbalance, where a dominant modality suppresses the optimization of others. Existing methods mainly balance modality learning by modulating gradient magnitudes or directions, modifying optimization objectives, or adjusting training strategies, with most interventions focusing on the current update. However, when combined with widely used momentum-based optimizers, the update also incorporates accumulated information from previous gradients, which is not explicitly addressed by current-step modulation alone. To address this issue, we propose Variance-Calibrated MomentuM (VCMM), which adapts gradient memory to modality-specific gradient dynamics. Specifically, VCMM estimates minibatch noise and temporal drift online and uses their relative strength to determine modality-specific momentum through a Kalman-inspired controller. We further center the control signal across modalities and apply exact bias correction for the time-varying first moment, enabling adaptive gradient memory without extra network passes or explicit learning-rate scaling. Experiments on four multimodal benchmarks demonstrate consistent improvements with modest training overhead.
[LG-47] EBRL: Asynchronous Embodied RL by Multi-Grained Resource Management
链接: https://arxiv.org/abs/2609.27547
作者: Liang Mi,Weijun Wang,Bowen Gao,Tianze Yu,Zixu Hao,Han Xiao,Xin Ding,Mingzhe Huang,Xin He,Lu Shi,Hao Wu,Haipeng Dai,Guihai Chen,Yunxin Liu,Ting Cao
类目: Machine Learning (cs.LG); Distributed, Parallel, and Cluster Computing (cs.DC)
*备注:
Abstract:Embodied reinforcement learning (RL) improves model capabilities with a pipeline of environment simulation, action generation, and model updates. These stages show heterogeneous CPU and GPU demands, making efficient resource utilization difficult. Recent systems overlap rollout (simulation and generation) with training for efficiency, but exclusive GPU allocation and synchronized barrier in rollout still leave substantial hardware resource waste. In this paper, we present EBRL, an asynchronous embodied RL training system with two core techniques. The asynchronous pipelined scheduler overlaps rollout and training, pipelines simulation and generation across environment groups, and carries out each environment independently, eliminating synchronization stalls. The fine-grained resource manager pools CPU cores and GPU streaming multiprocessors, and uses stage profiles and runtime feedback to adjust resource quotas and batch sizes to meet the shifting demands among stages. We implement EBRL on RLinf and evaluate it with four embodied policies and four simulation benchmarks across heterogeneous GPU testbeds. Experiments show that EBRL achieves 1.30-3.47 times the end-to-end rollout throughput and 2.5 times of training convergency compared to the SOTA embodied RL systems.
[LG-48] Learning Where to Look: A Shared Relative-Alignment Module for Time-Series Forecasting and PPG-to-Vital-Sign Reconstruction
链接: https://arxiv.org/abs/2609.27473
作者: Ragamayi Puli,Shunya Nagashima
类目: Machine Learning (cs.LG)
*备注:
Abstract:PPG-to-vital-sign reconstruction turns a wrist-worn photoplethysmogram into clinical waveforms such as the ECG. Long-horizon multivariate time-series forecasting underpins planning in energy, weather, and traffic. Both generate a target sequence from a condition sequence, and current models hard-code where each target position reads it, as a same-position copy or seasonal recurrence, so neither transfers between tasks. We propose ROOSTER, one conditioning module that handles vital-sign reconstruction and time-series forecasting alike by learning this correspondence. Its core is a periodic-comb bias over the target-condition offset whose center, period, and sharpness are learned per head, so one module settles on the identity alignment or a seasonal lag and reports which it found. On vital-sign reconstruction from PPG, ROOSTER outperformed the published baselines on four heart-rate and respiratory-rate benchmarks. On multivariate time-series forecasting, it achieved the best horizon-averaged MSE on four benchmarks and outperformed the forecasting model it extends on 20 of 24 dataset-horizon settings under matched three-seed training. An ablation study indicated that the relative bias, not content matching, carried the alignment.
[LG-49] Stable Neural Decoding Across Sessions via Task-Conditioned Latent Alignment for Brain-Machine Interfaces
链接: https://arxiv.org/abs/2609.27441
作者: Canyang Zhao,Bolin Peng,J. Patrick Mayo,Ce Ju,Bing Liu
类目: Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注:
Abstract:Achieving stable long-term neural decoding in invasive brain-machine interfaces (BMIs) remains challenging due to variations in recorded neural populations across sessions. Current latent alignment approaches may overlook task-dependent structure during cross-session adaptation. We propose Task-Conditioned Latent Alignment (TCLA), a framework that stabilizes neural decoding by learning a shared latent space. TCLA learns a low-dimensional source representation using neural reconstruction and continuous behavioral supervision. During target-session adaptation, the shared representation is fixed, while target neural activity is mapped into the source latent space by aligning source and target distributions separately for each task condition. We evaluated TCLA on seven nonhuman primate datasets spanning multiple tasks. In long-term cross-session evaluation, TCLA achieved a mean R^2 of 0.476\pm0.014 with a negative R^2 failure rate of only 6.8%. Across 1,356 within-subject session pairs, TCLA achieved a mean R^2 of 0.371\pm0.009 with a failure rate of 6.8%. Across 2,134 cross-subject session pairs, TCLA achieved a mean R^2 of 0.218\pm0.004 with a failure rate of 12.9%, substantially better than those of the comparison methods. These results demonstrate that by preserving behaviorally relevant and task-dependent latent structure, TCLA improves the robustness of neural decoding across recording sessions and subjects. The source code is publicly available at \hrefthis https URLthis https URL.
[LG-50] Counterfactual Constraint-Conditioned On-Policy Distillation for Multi-Constraint Instruction Following
链接: https://arxiv.org/abs/2609.27421
作者: Yanzhao Zheng,Yuanqiang Yu,Tianze Xu,Chao Ma,Zhentao Zhang,Jihuai Zhu,Baohua Dong,Hangcheng Zhu,Ruohui Huang
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Multi-constraint instruction following requires a model to respond to a query under many simultaneously active constraints. Even strong instruction-tuned models still routinely violate some of them. Existing approaches either augment supervision with sequence- or token-level RL rewards from external verifiers or learned graders, or use on-policy distillation (OPD) against a single full-context teacher whose probability mass becomes diluted as more constraints become simultaneously active. We propose CC-OPD (Counterfactual Constraint-Conditioned On-Policy Distillation), which inverts the standard supervision-generation direction in distillation. Rather than enriching the teacher with information beyond what the student sees, CC-OPD ablates each constraint from the teacher’s conditioning in turn, and constructs the per-constraint signal from the resulting per-token probability differentials. The resulting per-token leave-one-out log-likelihood shifts are summed, clipped, and added to the vanilla OPD reward as a token-level shaping term. All shaping terms are obtained from the frozen teacher, without an external verifier during distillation, and the reward equals vanilla OPD wherever the aggregate shift is zero. Across two Qwen model pairs and seven benchmarks, CC-OPD achieves the highest average among all evaluated student-training methods. A 1.5B student trained with CC-OPD surpasses its own 7B RL-trained teacher on the MulDimIF benchmark.
[LG-51] When Labels Are Scarce: An Oscillatory State Space Model for Vibration Diagnosis
链接: https://arxiv.org/abs/2609.27411
作者: Mainak Mallick,Seung-Kyum Choi
类目: Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注:
Abstract:Machine fault diagnosis from vibration requires learning from scarce labelled fault recordings while meeting the computational constraints of edge devices for local inference. We introduce DualRes, a compact oscillatory state-space model that combines two complementary spectral views of vibration, capturing rapid changes and fine frequency structure. Time-aligned views are processed by selective oscillatory memory, which learns how long to retain temporal patterns. The encoder contains 39,528 parameters. We evaluate supervised learning across six bearing datasets and a gearbox benchmark, with an additional gearbox pilot. Recording-level splits and explicit accounting of labelled duration distinguish data efficiency from repeated exposure to correlated samples. On the main gearbox benchmark, DualRes achieves state-of-the-art performance among the nine evaluated methods at six of seven label budgets. With about six labelled seconds per class, it improves macro-F1 by 16.1 percentage points over the next strongest comparator. On the same benchmark, DualRes achieves a 1.44-fold recording-level speedup and a 24.8-fold reduction in checkpoint storage relative to a selective state-space baseline under matched hardware and runtime conditions. Bearing results reveal task-dependent trade-offs. These findings support oscillatory memory as a compact approach to vibration diagnosis under limited labelled exposure.
[LG-52] Active Learning for Biodiversity Monitoring: From Label Efficiency to Reliable Ecological Inference
链接: https://arxiv.org/abs/2609.27409
作者: Ben McEwen,Shiqi Zhang,Dan Stowell
类目: Machine Learning (cs.LG)
*备注:
Abstract:Limited expert annotation capacity is a pervasive constraint in biodiversity monitoring. Passive acoustic recorders and camera traps generate data faster than experts can analyse them. Machine learning (ML) models can process these data at scale, but their reliability depends on the quality, quantity, and coverage of labelled samples, so expert time remains a constraint. Active learning (AL) eases this bottleneck by selecting, under a fixed annotation budget, the samples expected to improve a model most, and published evidence shows it can reduce the labels needed to reach a target performance. Monitoring programmes, however, face a broader question: how should a limited expert budget be divided so that model training, validation, and the ecological estimates built on model outputs all remain reliable? Because AL selects samples non-randomly, its labels are unsuitable for validation, calibration, or threshold selection, a tension rarely acknowledged. We synthesise AL research across acoustic and image modalities and identify gaps and opportunities. Most studies evaluate query strategies on pre-labelled benchmarks with simulated annotators; deployments in real monitoring workflows are rare and concentrate on birds and cetaceans. Bats, insects, amphibians, and fish are underrepresented, and multimodal applications remain largely unexplored. Evaluation centres on headline reductions in annotation effort, often without random-sampling baselines, per-class results, or calibration analysis, and rarely accounts for the labels required for validation. We provide a tutorial treatment of the AL loop that makes these budget decisions explicit, and a roadmap towards AL methods that support label-efficient training, validation, and trustworthy downstream ecological inference.
[LG-53] EvoAudio: Recursive Self-Improvement for Audio Understanding
链接: https://arxiv.org/abs/2609.27389
作者: Yuxiang Wang,Shengbo Cai,Yingda Shen,Ming-Hao Hsu,Qinke Ni,Liqiang Zhang,Teddy Sun,Steve Yevs,Zhizheng Wu
类目: ound (cs.SD); Machine Learning (cs.LG)
*备注:
Abstract:Audio language models understand what is said far better than how it sounds. Closing this gap takes more than data. Detailed acoustic annotation is costly, labels from stronger models inherit their errors and limits, and fixed data cannot adapt as the learner improves. We therefore propose EvoAudio, a recursive self-improvement system for audio understanding. To our knowledge, it is the first to evolve the model, waveforms, questions, and difficulty in one closed loop. EvoAudio uses the current model’s performance to set the focus and difficulty of the next training data. A library of audio tools then constructs questions whose answers follow from how the audio was made, providing verifiable supervision without new human annotation. Reinforcement learning updates the model, and validation decides whether it enters the next evolution round. Across 13 rounds, EvoAudio improves five models with different audio encoders and language backbones on MMSU, MMAU-Pro, and MMAR. It achieves the highest average for every backbone, raising overall performance by up to 6.3 points. The improvement unfolds over successive rounds, with each stronger model starting the next round.
[LG-54] Anomaly-Free Self-Optimization via AUC Bounds
链接: https://arxiv.org/abs/2609.27362
作者: Kevin Wilkinghoff,Zheng-Hua Tan
类目: Machine Learning (cs.LG); Audio and Speech Processing (eess.AS)
*备注:
Abstract:Anomalies are rare, and anomalous data are often unavailable during development, making it difficult to determine which anomaly detection models and configurations will generalize to unseen anomalies. Recent approaches address this challenge by generating pseudo-anomalies and using bounds on the achievable area under the ROC curve (AUC) to select the optimal configuration from a finite set of candidates. Instead, we use the AUC bound as a differentiable, anomaly-free objective for directly optimizing continuous parameters of anomaly detection systems. We demonstrate this framework by optimizing ensemble weights and introducing a learnable score-rescaling mechanism that adapts pseudo-anomaly scores, enabling optimization beyond a predefined candidate set. Experiments across multiple datasets and embedding models show that AUC-bound optimization achieves significant performance gains over conventional model selection and prior development-set-based parameter selection. The results further show that direct optimization is less sensitive to the choice of pseudo-anomaly construction.
[LG-55] A Hybrid Iterative Deep Ritz Method for Elliptic Interface Problems
链接: https://arxiv.org/abs/2609.27325
作者: Tianhao Hu,Bangti Jin,Fengru Wang,Yifeng Xu
类目: Numerical Analysis (math.NA); Machine Learning (cs.LG)
*备注: 20 pages
Abstract:In this work, we propose a hybrid iterative deep Ritz method (H-IDRM) for a class of interface problems for second-order elliptic operators. It is based on a new mixed formulation of the problem and involves solving a sequence of convex minimization problems. We employ a level-set neural network architecture, featuring a level-set representation of the interface, to accommodate the piecewise smoothness of the solution and the flux. The approach involves only volumetric representations instead of duality pairing on the interface and avoids explicit interface sampling that is inconvenient for complex interface geometries. Further, we present an analysis of the method, including the errors arising from the neural network approximation, Monte Carlo approximation, iterative scheme, and penalty parameters. Numerical experiments indicate that the H-IDRM outperforms existing neural solvers on problems with high-dimensional domains, intricate interface geometries, and lower subdomain regularity.
[LG-56] FairTest: Search-Based Fairness Testing for Multi-Agent Reinforcement Learning Systems
链接: https://arxiv.org/abs/2609.27309
作者: Xiaotong Wang,Xuan Xie
类目: oftware Engineering (cs.SE); Machine Learning (cs.LG)
*备注: 28 pages, 7 figures
Abstract:Multi-agent Reinforcement Learning (MARL) trains a team of agents that share one environment and learn their policies together. Training maximizes the team return, and a high return does not imply that the rewards are shared fairly among the agents in every episode. Testing is an established way to discover the failures of deep reinforcement learning, yet few methods address the fairness of MARL. In this work, we propose FairTest, a search-based testing approach that seeks the unfair executions of a MARL policy. The design combines search guidance with test prioritization. The guidance scores each candidate with three fitness functions. One measures the fairness of the runs already performed, another predicts the fairness from abstract states and fairness features, and the third reads the decision uncertainty from the policy. Crossover and mutation derive further candidates from the observed executions. The prioritization ranks the candidates by the predicted fairness and the decision uncertainty, so that the runs reach the candidates where failures are expected. FairTest is evaluated on three environments and two MARL algorithms, and four baselines are given the same budget. It detects the most fairness failures compared to three baselines with statistical significance and large effect sizes. The failure count exceeds that of the strongest baseline by 221% on average and coverage improves by an average of 23%.
[LG-57] Discrete Diffusion Models via Evolving Variational Autoregressive Networks
链接: https://arxiv.org/abs/2609.27306
作者: Kewen Pan,Ying Tang
类目: Machine Learning (cs.LG); Disordered Systems and Neural Networks (cond-mat.dis-nn); Machine Learning (stat.ML)
*备注:
Abstract:Conventional score-based diffusion models learn scores without representing normalized densities, whereas tractable normalized models support both sampling and direct likelihood evaluation. A recent tensor-network approach provides such a representation but is largely restricted to low-dimensional lattices. Here we introduce a discrete diffusion model that parameterizes normalized probability distributions using variational autoregressive networks. Explicit Markov jump operators govern the forward noising and reverse denoising dynamics, extending discrete diffusion models with normalized distributions to spin systems on higher-dimensional lattices. We apply this framework to the two- and three-dimensional Ising models across ordered, critical, and disordered regimes, accurately computing thermodynamic quantities including free energy, energy, and magnetization. We further integrate the framework with Monte Carlo sampling, using adaptive diffusion steps to maintain high acceptance rates even at low temperatures while enhancing sample diversity. These results establish a neural-network framework for the discrete diffusion model with normalized probability distributions.
[LG-58] Live Assistant: Learning Whether When and Whom to Assist in Real-World Live Social Streams
链接: https://arxiv.org/abs/2609.27303
作者: Shujian Gao,Jiamei Yan,Yuchen Yang,Penghao Zhou,Qinglei Wang,Tiehan Fan,Yuan Wang,Zuxuan Wu,Yu-gang Jiang
类目: Machine Learning (cs.LG)
*备注: under review
Abstract:Livestreams are long-lasting interactive environments where audiovisual content, viewer activity, host behavior, and platform signals evolve together, creating assistance needs that emerge from the stream itself. We introduce \liveassistant, a framework for mixed-initiative, role-conditioned assistance that formulates livestream interaction as four coupled decisions: \textbfwhether to act, when to act, whom to address, and what to communicate. At each 10-second interval, one autoregressive policy consumes native audio and video with synchronized comments, gifts, viewer dynamics, and room metadata, then selects \textscOBS, \textscMEM, or \textscANS. \textscOBS remains silent, \textscMEM records a private semantic update, and \textscANS specifies a recipient, task, and grounded message. To support this task, we build a trajectory engine that reconstructs real livestream sessions into structured causal supervision, yielding over 320 hours of optimization trajectories and a human-reviewed benchmark of 275 clips and 13,812 decision intervals. We train the policy with Marker-Aware Multiturn Supervised Fine-Tuning (MA-MSFT), which strengthens sparse structured decisions, followed by Streaming Multiturn GSPO (SM-GSPO), which optimizes self-generated trajectories with turn- and trajectory-level credit. On the held-out benchmark, \liveassistant reaches 71.14 state accuracy, 72.67 recipient accuracy, and 58.41 task accuracy, with consistent gains over representative streaming and general multimodal baselines. Together, the formulation, benchmark, and training framework establish livestream assistance as selective participation in a shared social stream.
[LG-59] NGN: Learning Neural Network Size as a Differentiable Count
链接: https://arxiv.org/abs/2609.27291
作者: Lixing Li
类目: Machine Learning (cs.LG)
*备注: 20 pages, 7 figures
Abstract:Neural network size is usually chosen before training, separating architecture selection from weight optimization. We introduce the Neurogenesis Network (NGN), a differentiable parameterization for learning how many ordered structural components a model should use. For each ordered component group, one learnable boundary selects an active prefix while the model parameters are trained. The boundary can grow from a compact initialization and can be deployed by discarding components beyond the learned boundary. Controlled experiments examine convergence of the learned boundary, the performance of deployed prefixes, and comparisons with fixed-size models and alternative approaches to learning capacity. We then apply the same mechanism to MLPs, convolutional and graph networks, Transformers, state-space models, LoRA, and adapters. Across these settings, deploying only the learned prefix usually changes performance little, and the selected architectures perform similarly to fixed models trained at the same size. These results show that structural capacity can be optimized directly as a count.
[LG-60] SR-Fraud: An Outcome-Supervised Reflective LLM Agent Framework for Non-Stationary Payment Fraud Detection
链接: https://arxiv.org/abs/2609.27287
作者: Xuwei Tan,Yao Ma,Xueru Zhang
类目: Machine Learning (cs.LG); Cryptography and Security (cs.CR)
*备注:
Abstract:Real-time payment fraud detection is a non-stationary streaming prediction problem: adversaries adapt before supervised labels mature, and localized burst attacks can cause losses before retraining. Production systems typically rely on tabular classifiers and rules, which can struggle to capture these emerging sequential patterns before periodic retraining occurs. We present SR-Fraud, an outcome-supervised reflective LLM framework that decouples request-time decisions from offline adaptation. A frozen, stateless agent scores each transaction from a Hybrid Episodic Window to track behavioral shifts, while an offline reflection agent proposes boundary hypotheses from matured errors. A deterministic verifier then admits only supported hypotheses into an executable knowledge state. On a production payment-fraud benchmark, SR-Fraud improves all detection metrics over its frozen decision agent, obtains higher point estimates than static and periodically retrained CatBoost, and detects an emerging fraud burst.
[LG-61] Graph Learning with Spectral Connectivity Priors for Scarce Data ICASSP2027
链接: https://arxiv.org/abs/2609.27278
作者: Mingxiao Liu(1),Bahar Oveisgharan(2),Bingyan Zou(1),Gene Cheung(2),H. Vicky Zhao(1),Feifei Gao(1) ((1) Tsinghua University, China, (2) York University, Canada)
类目: Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注: 5 pages, 1 figure. Submitted to IEEE ICASSP 2027
Abstract:Learning a sparse graph from scarce data is practically important but challenging. Motivated by the desirable combination of local sparsity and strong global connectivity exhibited by expander-like graphs, we propose spectral connectivity-regularized graph learning (SCoGL), a framework that incorporates a family of Laplacian spectral priors to explicitly promote global connectivity. Specifically, SCoGL augments a combinatorial-Laplacian-constrained graphical lasso (GLASSO) objective over a target adjacency matrix \mathbfW with a general connectivity prior computed from Laplacian eigenvalues. We derive gradients for several representative connectivity priors and develop a projected gradient descent (PGD) algorithm with Armijo backtracking to efficiently optimize \mathbfW . Experiments show that the proposed SCoGL variants improve graph recovery and enhance downstream tasks such as graph signal denoising when signal observations are scarce.
[LG-62] Repurposing Pre-trained LLM s as High Fidelity Continuous Text Autoencoders
链接: https://arxiv.org/abs/2609.27248
作者: Arkanath Pathak,Unnat Jain,Alexander C. Berg
类目: Machine Learning (cs.LG)
*备注:
Abstract:Next-token prediction has enabled highly fluent autoregressive language models, but it represents global structure only indirectly through sequential factorization. In contrast, high-fidelity autoencoders have become a standard primitive in image generation, enabling generative models to operate over continuous latent spaces; text lacks a comparably faithful continuous representation. We propose LLMAE, a method for repurposing a pretrained decoder-only language model as a continuous text autoencoder by exposing an intermediate fixed-length latent bottleneck within its internal activations. Instantiated with a parameter-efficient 270M Gemma 3 model, LLMAE uses structured attention masks, LoRA adaptation, and KL regularization to learn an autoencoding interface that leverages the generative prior of the original LLM. We train LLMAE to reconstruct text sequences up to 1024 tokens, significantly improving on this task to achieve near-perfect reconstruction. Furthermore, we demonstrate the downstream utility of this representation by training a latent text diffusion model for detailed image captioning using the learned LLMAE autoencoder. By mapping text into a fixed-length continuous latent space, our approach provides an effective substrate for downstream adaptation while benefiting from the fluency of the original LLM.
[LG-63] Full-Covariance Smoothing of Bayesian Neural Networks for Online Adaptation
链接: https://arxiv.org/abs/2609.27244
作者: Oren Wright,Haoming Jing,Qiaoan Shen,Koichiro Niinuma,Yorie Nakahira,José M. F. Moura
类目: Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注: Accepted to CDC 2026
Abstract:A neural network’s layers can be treated as time steps of a state-space model, turning Bayesian training into a smoothing problem: a forward pass propagates Gaussian moments through the network, and a backward Rauch–Tung–Striebel pass updates the weight posteriors in closed form. Such methods learn from each observation in a single pass, in an uncertainty-aware manner, and without gradient-based iterations or replay, which makes them well suited for online adaptation and data-efficient learning. Existing smoothing-based methods, however, are restricted to diagonal covariances across activations, discarding correlations between neurons. We overcome this limitation via a cross-covariance identity that enables full-covariance propagation through a network’s nonlinear activations. We derive a one-step-per-layer smoother that approximates as Gaussian only each layer’s affine output, and that applies both to deterministic systems with noisy observations and to stochastic systems described by output statistics. We demonstrate this method in non-stationary classification, online dynamics learning, and policy adaptation of a vision-language-action model, and find that it is generally more accurate than other smoothing-based methods.
[LG-64] Discover Falsify Revise: Auditing Input-Use Claims from Source Code to Predictive Contribution in Agent -Discovered Cell Models
链接: https://arxiv.org/abs/2609.27234
作者: Mengran Li,Bo Li,Chengyang Zhang,Yang Yan,Jinfeng Xu,Zhenchao Tang
类目: Machine Learning (cs.LG); Quantitative Methods (q-bio.QM)
*备注:
Abstract:AI virtual cells aim to predict cellular responses to specified interventions, yet held-out predictive performance alone does not establish use of the supplied perturbation information. This prediction-claim gap matters in agentic model discovery, where language-model agents generate and revise predictors using score-based feedback. We introduce CELLAUDIT, which audits input-use claims by asking whether an input can enter the cited computation, whether fitted predictions depend on it, and whether that dependence improves prediction of observed response. On a paired morphology-transcriptomics perturbation benchmark (BBBC047), an agent-selected predictor attains a mean held-out Global Pearson correlation coefficient (PCC) of 0.3153 but remains invariant to compound replacement; a control-profile-only predictor reaches 0.3142. Source inspection identifies a compound-query pathway blocked by singleton key-value attention, and the invariance persists after refitting with disjoint control wells. In a stratified audit of 48 candidates across two linked tasks, 47 change predictions under compound replacement on both held-out folds, but only 20 show target-loss gains with intervals above zero on both folds. On BBBC047, falsification-guided revisions recover positive mean compound contributions while retaining gains over the control-profile-only baseline. In matched sci-Plex searches, audit-enriched feedback yields higher held-out performance and larger mean compound and dose contributions across five trajectories, although paired intervals span zero. Refitting fixed designs on an independently acquired cohort shows predictive generalization need not imply generalization of input-use claims: dose contribution persists, whereas support for compound identity does not. CELLAUDIT adds a falsification layer to agentic model discovery, moving from generate-score-revise toward discover-falsify-revise.
[LG-65] A Scaling Study for fMRI Foundation Models
链接: https://arxiv.org/abs/2609.27232
作者: Wenhao Ye,Xuanye Pan,Junfeng Xia,Junxiang Zhang,Mo Wang,Quanying Liu
类目: Machine Learning (cs.LG)
*备注: 28 pages, 7 figures. Code: this https URL
Abstract:Scaling laws have guided large-model development in computer vision and natural language processing, but the relationships among data, model size, and compute remain unclear for functional magnetic resonance imaging (fMRI) foundation models. Here, we conduct a controlled empirical study using pretraining data from more than 200 source datasets and over 10,000 GPU-hours of experiments. Holding the pretraining framework and downstream protocol fixed, we vary pretraining data size, model size, and training duration. Downstream performance generally improves with compute, yet models using similar compute can perform substantially differently. Additional pretraining data bring larger gains at larger model sizes, suggesting that data and model size should be scaled together. At matched compute, increasing pretraining data benefits more tasks than increasing model size, although the pattern varies across tasks. We then use in-distribution (ID) downstream performance to select the combination of pretraining data size, model size, and training duration at two fixed compute budgets. The resulting models are locked before out-of-distribution (OOD) evaluation. They achieve the highest average performance across the evaluated OOD tasks among the compared fMRI foundation models while using less pretraining compute. Overall, our results show that compute alone does not characterize fMRI scaling: performance depends on how pretraining data, model size, and training duration are combined.
[LG-66] ail-Aware Geometry Learning for Conformal Ellipsoids
链接: https://arxiv.org/abs/2609.27221
作者: Xiang Zhang
类目: Machine Learning (cs.LG)
*备注:
Abstract:This paper studies multivariate conformal prediction (CP), a distribution-free uncertainty quantification framework with finite-sample coverage guarantees. The efficiency of multivariate prediction sets hinges critically on the residual geometry encoded by the nonconformity score, while existing minimum-volume methods rely on quantile thresholds that ignore tail residual severity and implicitly bind geometry learning to coverage level. We propose a tail-aware geometry learning framework for conformal ellipsoids that decouples tail sensitivity in geometry learning from the final coverage guarantee. Using a two-split design, we learn the metric matrix via volume minimization under a CVaR constraint on an estimation split, then apply standard conformal calibration on a held-out calibration split. The resulting problem is convex and admits a bounded-reweighting interpretation that prioritizes high-residual samples. Moreover, we theoretically characterize the trade-off between ellipsoidal volume and tail severity. Experimental results demonstrate the effectiveness of the proposed method.
[LG-67] Reliable Federated TinyML Deployment for IoT Security
链接: https://arxiv.org/abs/2609.27202
作者: Younsoo Park,Seokhyoen Bae,Shasi Kumar Ramachandran Prabhu,Suman Saha,Peilong Li
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:The growing deployment of Internet of Things (IoT) devices has increased the need for privacy-preserving intrusion detection systems that operate directly on resource-constrained hardware. Federated Learning enables collaborative model training without sharing raw data, but conventional federated models are often too large and unstable for deployment on microcontroller-class devices. TinyML techniques enable compact neural networks but are typically designed for inference-only workloads. This work investigates combining Federated Learning with TinyML-based model compression for intrusion detection in IoT environments. We evaluate compression strategies including knowledge distillation, structured pruning, and quantization within a federated training pipeline. Preliminary results show that training stability plays a critical role in federated TinyML systems. In particular, server-coordinated cosine learning-rate scheduling improves Attack Recall from 46.7% to 93.85% while enabling substantial model compression and efficient edge deployment. These findings provide insights for designing lightweight and privacy preserving intrusion detection systems for IoT devices. Subjects: Cryptography and Security (cs.CR); Machine Learning (cs.LG) Cite as: arXiv:2609.27202 [cs.CR] (or arXiv:2609.27202v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2609.27202 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-68] A Systematic Benchmark of Explainable Methods for Temporal Attribution in Sequential Recommendation Systems RECSYS’26
链接: https://arxiv.org/abs/2609.27201
作者: Akash Pandey,Kanisha Shah,Addrish Roy,Dwipam Katariya,Hongyangyang Shi,Amanda Ding,Kalanand Mishra,Pranab Mohanty
类目: Machine Learning (cs.LG)
*备注: Presented at CARS@RecSys’26, 11 pages, 6 figures
Abstract:Sequential RecSys are central to modern personalization, exploiting user’s historical interaction sequences to drive next-step decisions. Deep learning models, particularly CNN and Transformer-based architectures, have proven highly effective at capturing temporal dependencies in these histories. For transparency and trust, understanding which past interactions drive a given recommendation is increasingly important — both for developers auditing model behavior and for users seeking a rationale. However, the non-linearities that give these models their predictive power also render them black boxes, making it difficult to attribute decisions to specific interactions. While gradient-based, perturbation-based, and attention-based explainability methods exist, a systematic benchmark of their faithfulness for sequential recommendation is missing. We address this gap by introducing a dual-model masking metric in which one model supplies per-timestep attribution scores and a separately trained, masking-robust probe measures the resulting change in predicted probability. Using this metric, we benchmark ten XAI methods across CNN, Transformer, SASRec, and BERT4Rec backbones on KuaiRand and MovieLens, complemented by analyses of temporal attribution patterns, item popularity confounding, and robustness to input corruption. Our key findings are: (1) gradient-based methods, particularly GradientSHAP and Integrated Gradients, yield the most faithful and robust attributions; (2) raw attention weights are unreliable, but gradient-weighted attention restores faithfulness on shorter sequences, with degradation on longer horizons as softmax attention probabilities converge toward uniform importance scores, diminishing the method’s ability to identify informative interactions; and (3) temporal attribution patterns in faithful methods reflect genuine task structure rather than recency or popularity bias.
[LG-69] ZO-COSMO: Index-Free One-Hop Mixing for Decentralized Zeroth-Order Optimization
链接: https://arxiv.org/abs/2609.27199
作者: Shengjun Zhang,Tingyi Liu,Heng Zhang,Dong Xie
类目: Machine Learning (cs.LG); Systems and Control (eess.SY); Optimization and Control (math.OC)
*备注:
Abstract:Sparse communication in decentralized zeroth-order learning requires compatible peer-state coordinates. We characterize this one-hop condition and develop \textsfZO-COSMO, coupling two-query estimation with average-preserving masked consensus using q values per active link. Global supports serve all-neighbor mixing; matching updates require agreement only within each pair. We derive a sharp contraction-per-scalar bound within the matching class and convergence guarantees for the core and sparse-momentum updates. At fixed matching, exact moment identities characterize how shared directions preserve gradient-heterogeneity cancellation and redistribute estimation error and disagreement. Mechanism experiments cover unequal curvatures, noise, and sparse momentum. Further tests span 64 synthetic agents and eight logical Qwen LoRA workers. At matched payload budgets, Qwen2-7B QNLI gains 3.65 accuracy points over explicit-index Rand- k ; edge-local updates gain 3.42 and 2.53 points over all-neighbor mixing on eight-worker complete and ring graphs. A matched-first-step ablation gives a 3.92 -point momentum benefit. Seed-aware and same-matching controls distinguish encoding, scheduling, and query correlation.
[LG-70] Data-driven discrete-time deep recurrent neural network-based modeling for dissipative systems
链接: https://arxiv.org/abs/2609.27186
作者: Tuan Luong,Hyungpil Moon
类目: Machine Learning (cs.LG); Robotics (cs.RO)
*备注:
Abstract:Physical AI has gained increasing attention for its role in developing AI systems that better understand, predict, and control real-world dynamics. Achieving this requires AI models that not only achieve high prediction accuracy but also preserve fundamental physical properties of dynamical systems. In this paper, we propose a deep discrete-time dissipative recurrent neural network (DissipNet) that explicitly enforces dissipativity, a key property related to stability and energy dissipation, through structural weight constraints and a dedicated training algorithm. By construction, the proposed network is capable of learning dissipative dynamics while preserving their inherent stability, which is formally analyzed using Lyapunov theory. In contrast to Physics-Informed Neural Networks (PINNs), which incorporate governing equations into the training loss but do not guarantee preservation of internal analytical properties such as dissipativity or passivity, our approach provides explicit guarantees on stability at the model level. We demonstrate the effectiveness of the proposed method through several modeling applications, and compare its performance with a naive recurrent neural network (RNN) and a PINN-based model.
[LG-71] Median Temporal Ensembling: Training-Free Robust Aggregation for Action-Chunked Visuomotor Policies
链接: https://arxiv.org/abs/2609.27167
作者: Yuhang Jiang
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注: 9 pages, 2 figures, 6 tables. Project page: this https URL
Abstract:Action-chunked visuomotor policies predict overlapping trajectories, so every executed action is covered by several predictions. Temporal ensembling smooths execution by combining these predictions with an exponentially weighted mean. One corrupted prediction can move the aggregate without bound: its breakdown point is 0. We use adversarial corruption to stress this deployed aggregator and to compare two kinds of guarantee. A metric guarantee bounds the response to a perturbation of a given size. A combinatorial guarantee instead bounds the damage when at most q of the M candidates covering a timestep are corrupted, whatever their size. Encoder adversarial fine-tuning recovers 44% of the loss under the published patch attack, but only 7.3% after the attacker’s step size is increased. By contrast, the coordinate-wise median of the same candidate set keeps its recovered fraction flat as attack optimisation increases. Median temporal ensembling costs one line and requires no retraining. Across 25 (configuration, corruption-level) combinations it is never worse than the mean and is significantly better in 15. It also transfers to a second policy class, and it recovers performance under a failure with no attacker in the loop at all: camera frames that arrive blank. Its effect on clean data is configuration-dependent, from -0.04 to +0.07. We also give the boundary: corruption that shifts every covering prediction by the same amount is invisible to this whole family of statistics, and no equivariant aggregator can remove it.
[LG-72] Scaling of Capability and Efficiency at Inference Time in Large Reasoning Models
链接: https://arxiv.org/abs/2609.27166
作者: Moritz Laber,Zohair Shafi,Germans Savcisens,Brennan Klein,Matteo Chinazzi,Samuel V. Scarpino,Albert-László Barabási,Tina Eliassi-Rad
类目: Machine Learning (cs.LG); Physics and Society (physics.soc-ph)
*备注:
Abstract:Capability and efficiency are two key dimensions of reasoning in large language models (LLMs). Capability refers to the ability to solve a given problem correctly, whereas efficiency refers to the ability to do so with limited resources. When LLMs use Chain-of-Thought (CoT) reasoning to solve problems of controlled hardness, both the number of problems solved correctly and the number of tokens required to reach a correct answer depend on problem hardness and model size. However, how these factors jointly shape capability and efficiency remains poorly understood. Here, we use hierarchical Bayesian models to evaluate the capability and efficiency of LLMs from the DeepSeek-R1-Distill model family across four classes of arithmetic and algorithmic reasoning problems. At a fixed model size, the probability of correctly solving an instance decays approximately exponentially with instance size, our proxy for problem hardness. The decay scale grows sublinearly with model size, indicating that larger models are more capable, but that capability gains diminish with scale. Output length grows as a power law with instance size, which serves as a proxy for difficulty. However, the parameters of this power law do not vary systematically with model size, suggesting that larger models do not become more efficient. Together, these findings reveal potential limitations of naive scaling as a strategy for developing more capable AI systems: capability improves with diminishing returns, while efficiency shows little to no improvement.
[LG-73] Learning Risk Scores Robust to Unobserved Confounders
链接: https://arxiv.org/abs/2609.27144
作者: Ryan Edmonds,Yingxiao Ye,Sina Aghaei,Andrés Gómez,Çağıl Koçyiğit,Phebe Vayanos
类目: Machine Learning (cs.LG)
*备注:
Abstract:We consider the problem of learning risk scores to prioritize individuals for scarce resources or interventions, from historical observational data affected by unobserved confounding. Decisions about who receives scarce resources are often guided by risk scores based on recorded characteristics, such as responses to a survey. These risk scores are increasingly being learned directly from observational data: historical records of individuals’ characteristics, allocation decisions, and outcomes. Standard methods such as inverse propensity weighting (IPW), which corrects for the bias introduced by the historical allocation policy, can be used to learn accurate risk scores if the historical decision process is fully explained by the recorded characteristics. In practice, however, historical decisions often depend on unrecorded information, causing learned risk scores to systematically under-prioritize exactly the individuals whose unrecorded circumstances drove past prioritization. We propose a method for learning risk scores that are robust to this kind of unobserved confounding, building on IPW. Since propensity weights cannot be reliably estimated under unobserved confounding, we instead treat them as belonging to an uncertainty set determined by the observable data and domain-informed estimates of the degree of confounding, combining sensitivity analysis from causal inference with Wasserstein distributionally robust optimization. The resulting robust risk score learning problem admits a sample-based approximation that we reformulate as an exponential cone program compatible with off-the-shelf solvers. We demonstrate the effectiveness of our approach on semi-synthetic data derived from datasets in the UCI Machine Learning Repository. Our method improves calibration by up to 29.2% over traditional benchmarks and up to 11.1% over the state of the art, without compromising other metrics.
[LG-74] Quantifying the Occult: A Comparative Study of Hindu and Buddhist Deities Using Machine Learning Methods
链接: https://arxiv.org/abs/2609.27074
作者: Ankit Bhattacharjee
类目: Computers and Society (cs.CY); Machine Learning (cs.LG)
*备注: Under peer review at Digital Scholarship in the Humanities
Abstract:This study introduces a dual-matrix computational architecture to mathematically quantify the morphological and theological divergence of 196 Hindu and Vajrayana Buddhist esoteric deities. Physical morphology is evaluated via a discrete Gower distance matrix enhanced by a novel “Cardinality Weighting” algorithm, while theological function is mapped via dense vector embeddings generated from Large Language Model (LLM) semantic expansions, explicitly utilized as a synthetic proxy to mitigate circular reasoning. The multi-modal topological projections provide algorithmic validation of “iconographic camouflage”, demonstrating how distinct visual forms structurally obscure shared cross-tradition functions. Furthermore, I computationally model the “Atin Effect” - serving simultaneously as a psychological observation of sequential cognitive bias and a machine learning benchmark - demonstrating how high-cardinality esoteric anchors (e.g., a veena or a severed head) override systemic theological disparities to mathematically cluster orthodox and Tantric entities. Cross-tradition spatial analysis establishes that the highest esoteric manifestations, such as the Hindu Chinnamasta and the Buddhist Chinnamunda, share a near-identical mathematical coordinate across both visual ( D_G = 0.288 ) and semantic ( D_C = 0.068 ) boundaries, indicating a 1:1 esoteric transfer. By open-sourcing this architecture, I provide a scalable, unsupervised machine learning tool for Digital Humanities scholars and comparative theologians to rigorously map latent structural continuities across qualitative cultural corpora.
[LG-75] Does Graph Structure Earn Its Place in Microservice Root-Cause Analysis? A Controlled Study on RCAEval and What the Benchmark Was Really Measuring
链接: https://arxiv.org/abs/2609.27069
作者: Imad Buljić
类目: oftware Engineering (cs.SE); Machine Learning (cs.LG)
*备注: 17 pages; preprint published at Zenodo, DOI https://doi.org/10.5281/zenodo.22832168
Abstract:Graph neural networks dominate recent work on microservice root-cause analysis, yet recent results question whether the graph contributes. Those results compare whole pipelines, so when a flat model wins one cannot tell whether structure is useless or redundant. We run the comparison they imply on RCAEval: three learned arms with identical features, optimiser, validation split, early-stopping rule and scoring head, in which a single term separates the graph arms. Across two RCAEval benchmarks, two topology sources and four regimes we find no reliable graph-specific effect: in-distribution the graph model leads the conventional flat model by 0.003 Avg@5 (p = 0.844, n = 6 disjoint folds). Auditing the pipeline surfaced two benchmark properties that condition any result on it. RCAEval injects faults into only five services per system while exposing 12 to 70 in telemetry, and the headline metric is Avg@5: a ranker reading no telemetry at all places the true culprit in the top five on 99.7 percent of held-out incidents, scoring Avg@5 0.488. That prior, not the uniform-random 0.137, is the honest in-distribution floor, and it collapses to 0.192 across systems. The second property is a non-uniform column schema that silently zeroes telemetry for most RE1 cases. We reproduce a published baseline, BARO, RCAEval’s own reference implementation; on the one system with a clean schema it reaches similar aggregate accuracy to our heuristic, within 0.004, under a different scoring rule. The audit motivated a new model. PSC-GRCA separates a candidate score into a system prior, telemetry evidence and a centred graph residual, and reaches mean Avg@5 0.915 against 0.864 for the flat baseline, while its ablations locate most of the gain in the prior term rather than the graph. We close with a twelve-item checklist for graph-versus-flat ablation studies, distilled from sixty-two recorded defects.
[LG-76] GeoRVQ: Decoder-aware geometry for residual-token prediction in physiological signals
链接: https://arxiv.org/abs/2609.27018
作者: Bo Cui,Yaowen Zhang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Residual vector quantization (RVQ) turns physiological waveforms into compact token sequences, but conventional masked modeling treats every incorrect token as equally costly. We propose GeoRVQ, a coarse-to-fine masked token model whose objective reflects the local response of a frozen waveform decoder. Decoder-induced costs define geometry-aware soft targets and expected distortion, while quantizer-causal prediction follows residual dependencies from coarse to fine levels. In a descriptive aggregate over MIMIC-IV Waveform, VitalDB, and CODE-15%, GeoRVQ increases exact token accuracy from .133\pm.004 to .143\pm.003 , reduces decoded distance from .606\pm.006 to .393\pm.007 , and increases R-peak F1 from .784\pm.004 to .837\pm.008 under matched model and training conditions. Across 45 held-out code substitutions, decoder-induced cost has a Spearman correlation of .85 with realized decoded cost, compared with .54 for Euclidean codeword distance. These results indicate that decoder-aware objectives can improve waveform and event preservation without requiring a large increase in exact token accuracy.
[LG-77] Resource-Efficient Distributed Recursive Gaussian Processes
链接: https://arxiv.org/abs/2609.26979
作者: Josephine King,Ali Emre Balci,Raj Thilak Rajan
类目: Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注:
Abstract:Gaussian processes (GPs) provide a flexible framework for learning unknown functions from noisy measurements while quantifying predictive uncertainty, making them well suited for estimation in multi-agent systems. However, when measurements are collected by multiple agents, maintaining a unified GP model without centralized processing requires efficient distributed algorithms that can operate using local measurements and communication with neighboring agents. In this work, we develop two distributed recursive GP (RGP) algorithms for multi-output GP regression: ADMM-RGP and PDMM-RGP. We analyze the stability and convergence of both algorithms and develop parameter selection strategies to accelerate convergence, thus reducing the communication burden. The proposed methods are validated on a real-world multi-output wind dataset, and their convergence behavior is examined across communication graphs with varying connectivity. Numerical experiments demonstrate that ADMM-RGP and PDMM-RGP can significantly reduce communication relative to the state of the art, while maintaining comparable estimation accuracy and network-wide consensus.
[LG-78] nyUDE: Solver-Free Universal Differential Equations on Microcontrollers via Lie-Taylor Jet Matching
链接: https://arxiv.org/abs/2609.26972
作者: Pranavanath Balamurali,Hrishi Kamireddy
类目: Machine Learning (cs.LG); Emerging Technologies (cs.ET)
*备注: 22 pages, 13 figures
Abstract:Training Universal Differential Equations (UDEs) traditionally relies on backpropagating through numerical ODE solvers, creating memory footprints far exceeding the capabilities of edge microcontrollers. We present Lie-Taylor jet matching, a solver-free training framework that fits a hybrid vector field directly to the first and second time-derivatives of observed system states. These derivatives, the truncated Lie-Taylor jet, are estimated online via Savitzky-Golay filtering, yielding fully analytic gradients without automatic differentiation software. We evaluate whether eliminating the solver compromises accuracy against a conventional baseline (fixed-step RK4 integration, multiple shooting, exact discrete adjoints, Adam) sharing identical dynamics, noise models, network architectures, and metrics. While naive derivative matching degrades under sensor noise, our noise-adaptive mechanisms close and reverse this gap: full-rate phase-shifted sampling, a reservoir buffer, cosine-annealed optimization with weight averaging, on-device noise estimation, and polynomial-misfit quality gating. On a damped pendulum and chaotic double pendulum, our method matches or exceeds baseline accuracy at matched data windows and recovers unmodeled damping coefficients. Across noise levels from 0% to 5%, it attains a geometric-mean relative field error of 0.65x that of the baseline within 108 kB of static memory, compared with megabytes of solver tape. On an ESP32 microcontroller, the on-device run reaches a field error of 0.0020 and recovers the damping coefficient to c = 0.400 (true 0.400) within 61.3 kB of static memory and 7.24 ms per update (18.1% duty cycle at 25 Hz), confirming real-time on-device training is feasible without a numerical solver.
[LG-79] CRISP: Scalable Importance-Stratified Coresets for Imbalanced Tabular Learning
链接: https://arxiv.org/abs/2609.26962
作者: Hardhik Mohanty,Indrayana Rustandi,Mohamadreza Sheibani
类目: Machine Learning (cs.LG)
*备注:
Abstract:Large imbalanced tabular datasets make repeated gradient-boosted tree training expensive. Existing coreset methods often lose accuracy when most majority examples are removed. We present CRISP (Coreset Reduction via Importance-Stratified Pruning), a linear-time method that allocates a negative-class budget across quantile strata of a proxy-model score. Sample weights account for unequal inclusion probabilities. At 95% negative-class reduction on a production fraud dataset, CRISP trains on approximately 1.70M of 25M rows and retains 99.7% of full-data Average Precision. This is a 93.2% reduction in total training rows. On public CriteoPrivateAds, CRISP has the highest mean Average Precision at each tested rate from 90% to 99.4% majority reduction. Sparkov results are mixed at lower rates, but CRISP has the highest mean at 99.2% and 99.4%. Ablations identify budget allocation and inverse-propensity weighting as the main sources of the production-dataset gain.
[LG-80] ransfer Learning with Conformalized Quantile Regression for Solar PV Forecasting Under Load-Shedding-Driven Data Scarcity
链接: https://arxiv.org/abs/2609.26959
作者: Rakib Abdullah,K. M. Tahlil Mahfuz Faruk
类目: Machine Learning (cs.LG)
*备注: 6 pages, 4 figures, conference paper
Abstract:Solar photovoltaic (PV) forecasting in regions affected by load shedding is challenging because reliable historical observations are scarce. This study proposes a transfer learning framework combined with Conformalized Quantile Regression (CQR) to improve PV power forecasting and provide reliable uncertainty estimates under severe data scarcity. A source-domain PV dataset from Alice Springs, Australia, is used to pretrain a temporal forecasting model, which is then adapted to simulated Bangladesh PV data representing different levels of historical availability. Experimental results show that transfer learning reduces RMSE by up to 23.7% when only one month of target-domain data is available and by 13.7% with three months of data. The proposed Transfer Learning plus CQR framework achieves 94.3% empirical coverage with three months of target data while producing prediction intervals that are 14% narrower than those obtained without transfer learning. These results demonstrate that combining transfer learning with conformal uncertainty quantification can improve both point forecasting accuracy and uncertainty reliability when target-domain PV data are severely limited.
[LG-81] When Post-Processing Fairness Constraints Help and When They Harm: Evidence from Eight Cross-Domain Evaluations
链接: https://arxiv.org/abs/2609.26955
作者: Nithin Raghava Ramachandra Narla
类目: Machine Learning (cs.LG); Computers and Society (cs.CY)
*备注: 18 pages, 6 figures, 2 tables. Code, data loaders and figures: this http URL
Abstract:Fairness audits in production ML typically occur once, at deployment, on a single domain. Both fail in practice: fairness can shift after retraining or a changing user base, and interventions validated on one dataset are rarely tested across the heterogeneous domains an organization deploys. We present FAPE (Fairness Auditing for Production Environments), a four-stage framework evaluating a single post-processing intervention, Fairlearn’s ThresholdOptimizer, across eight domain evaluations: criminal justice, income prediction, legal admissions, credit lending, agricultural lending, a multi-domain benchmark corpus, healthcare, and education. Each is scored on demographic parity and equalized odds difference, plus disparate impact ratio and accuracy cost where computable. Intervention effectiveness tracks baseline disparity magnitude: across model-domain pairs the constraint improved disparity in 9 of 14 high-disparity cases and worsened it in 3 of 4 near-fair ones. Each of the five high-disparity exceptions reverses under one of two measurement checks, a minimum group size or thresholds fit on held-out data. A CUSUM monitor started at deployment, tested on a simulated shift, separates constrained models that never met a 0.1 parity convention from those that met it and later regressed. A single deployment-time audit is therefore an unreliable guide, which argues for baseline-disparity screening and continuous monitoring
[LG-82] he Computational Value of Sensory-Aligned Receptive Fields Depends on Neuronal Expressivity
链接: https://arxiv.org/abs/2609.26940
作者: Agnese Adorante,Aaron Spieler,Anna Levina
类目: Neural and Evolutionary Computing (cs.NE); Machine Learning (cs.LG); Neurons and Cognition (q-bio.NC)
*备注:
Abstract:Biological sensory neurons have selective receptive fields organized along meaningful stimulus coordinates, such as frequency, motion direction, or retinotopic position. Such structure may arise from efficient coding and biological constraints on activity, connectivity, and wiring, as computational studies of simple neurons have shown across modalities. This raises a question: do structured receptive fields confer a computational advantage beyond resource efficiency itself, and does this advantage persist when individual neurons are highly expressive? We address this question in recurrent networks of Expressive Leaky Memory neurons, where we can independently vary neuronal complexity and the organization of feed-forward receptive fields. Across auditory and event-based visual classification tasks, receptive fields aligned with a task-relevant sensory coordinate improve test accuracy relative to budget-matched random receptive fields. This advantage disappears when sensory coordinates are scrambled, or when receptive fields follow task-irrelevant coordinates, showing that the benefit comes from alignment with task geometry rather than restricted connectivity alone. Increasing neuronal complexity reduces the performance advantage of structured receptive fields. Finally, generic synaptic sparsity regularization induces input selectivity and partially recovers performance, but remains substantially below explicitly structured receptive fields, suggesting that sparsity alone is insufficient to recover the full computational benefit of task-aligned receptive fields. Together, our results show that appropriate receptive fields can serve as a computational prior beyond sparsity itself, and that their value depends on the computational expressivity of individual neurons.
[LG-83] PR-Smoother: Simulator-Preserving Non-Gaussian Smoothing for Data Assimilation
链接: https://arxiv.org/abs/2609.26890
作者: Yuta Tarumi
类目: Machine Learning (cs.LG); Chaotic Dynamics (nlin.CD); Atmospheric and Oceanic Physics (physics.ao-ph)
*备注:
Abstract:Many physical data assimilation (DA) workflows require smoothing methods that represent non-Gaussian posteriors over physical state variables, scale to high-dimensional simulators, train from observation windows alone, and remain compatible with calibration of the prescribed simulator. We introduce PR-Smoother, a simulator-preserving amortized smoother designed for this prescribed-simulator DA regime. Its key design principle is to keep the prescribed simulator explicit in both the evidence lower bound and the variational family: rather than learning replacement dynamics or a learned trajectory prior, PR-Smoother learns only future-conditioned corrections around the prescribed rollout. This yields an explicit non-Gaussian smoothing distribution over physical trajectories and supports joint state, parameter, and sensor-bias learning from observations alone. The variational family contains the exact smoother in deterministic and linear-Gaussian limits. Empirically, PR-Smoother captures multimodal posteriors in 4-dimensional Lorenz-96, remains accurate under ambiguous nonlinear observations and process noise in 40-dimensional Lorenz-96, and scales to joint state-parameter-bias inference in 16,384-dimensional Kolmogorov flow.
[LG-84] Marginally Correct Tool Caches Can Reverse Group-Normalized Policy Updates
链接: https://arxiv.org/abs/2609.26866
作者: Shivam Gupta
类目: Machine Learning (cs.LG)
*备注: 8 pages, 1 figure, 2 tables. Code and reproducibility materials: this https URL
Abstract:Tool-result caching reduces repeated execution in agent training, but also couples rollout randomness. We study a two-action model in which independent and shared execution preserve every rollout’s conditional reward distribution. Despite this marginal agreement, sharing one stochastic result per group can reverse the expected group-normalized policy update. We derive an exact finite-group expression: against a constant alternative, the shared update follows the probability of winning minus the probability of losing, rather than the difference in expected reward. A Bernoulli specialization yields a wrong-direction region and a non-vanishing update-variance floor as group size grows. Centering without group standard-deviation scaling preserves the expected-return direction in this model, using an existing estimator control. Exhaustive finite sums verify 540 configurations and 3,240 estimator evaluations, with a separate ordered-sequence checker. An implementation audit reproduces the sharing path in a pinned, unmodified TVCache stack using 256 scripted rollouts. These results do not measure language-model training performance or refute TVCache’s deterministic-output contract. They establish that marginal output validity alone cannot certify a stochastic cache as training-equivalent.
[LG-85] NeuroRule: Making Black-Box Neural Networks Explainable through Rule-set Evolution
链接: https://arxiv.org/abs/2609.26841
作者: Tapaswini Kodavanti,Hormoz Shahrzad,Risto Miikkulainen
类目: Neural and Evolutionary Computing (cs.NE); Machine Learning (cs.LG)
*备注:
Abstract:High-capacity neural network models have achieved state-of-the-art performance across diverse classification tasks, yet they frequently operate as black-box models, lacking the transparency necessary for critical decision-making. Such opacity creates a persistent trade-off between performance and explainability. This paper proposes a solution to address this gap: the NeuroRule knowledge distillation framework that results in explainable rule-sets from neural network models. NeuroRule adapts the EVOTER rule-set evolution infrastructure to treat neural networks as targets for the evolution process, distilling their performance into concise sets of propositional logic expressions. There are three primary contributions: (1) an evolutionary method for distilling black-box neural network models into explicit rule-set models; (2) a method for making rule sets more explainable by including a conciseness objective to evolution; and (3) a demonstration that the distillation is viable even without access to the original neural network training data. The paper thus establishes that black-box neural network models can be made explainable and therefore useful in real-world applications where trustworthiness is paramount.
[LG-86] HARN: Hierarchical Associative Resonance Network for Event-Driven Multi-Timeframe Forecasting
链接: https://arxiv.org/abs/2609.26822
作者: Nabeel Ahmad Saidd
类目: Machine Learning (cs.LG); Computational Finance (q-fin.CP); General Finance (q-fin.GN)
*备注:
Abstract:Financial time series evolve across multiple temporal resolutions, challenging forecasting systems to incorporate newly available information without repeatedly recomputing unchanged representations. We introduce HARN, a Hierarchical Associative Resonance Network for event-driven multi-timeframe forecasting. HARN maintains persistent representations across temporal levels and updates each level only when its corresponding completed bar becomes available. The architecture combines causal multi-scale temporal encoding, gated associative memory, cross-level resonance, and hierarchical evidence aggregation, with forecasting performed in basis-point space and reconstructed to the original price scale. We evaluate HARN on four assets spanning equity, foreign exchange, and commodity markets using multiple random seeds and component ablations. HARN achieves competitive reconstructed-price forecasting errors against single-timeframe PatchTST and TimeXer baselines, while ablations reveal the effects of removing individual components across assets and timeframes. A code-level audit further examines consistency between the implementation and the defined event-driven causal protocol. The results position HARN as a persistent multi-timeframe forecasting framework rather than evidence of universal predictive superiority.
[LG-87] he Drift Contract: Spectral Updates for Depth-Robust Local Learning
链接: https://arxiv.org/abs/2609.26811
作者: Fabien Polly
类目: Machine Learning (cs.LG)
*备注: 7 pages, 2 figures, 2 tables. Code and raw results: this https URL
Abstract:Local learning trains each layer with its own auxiliary loss and no global backward pass, which makes layer updates structurally parallel. Two problems have kept it marginal: accuracy degrades as depth grows, and hyperparameters are fragile. We apply Muon-style spectral update geometry (momentum orthogonalization with spectral step scaling) to per-layer local updates, an intersection not previously studied. On CIFAR-10 MLP benchmarks with local linear heads, a single step-size setting is the best value in our tested grids from width 128 to 2048 and from depth 12 to 48, while local Adam requires re-tuning along both axes and still collapses at depth 48 (31.3 percent re-tuned per depth, 19 percent with its depth-12 setting transferred, vs 42.7 percent for the spectral update at its unchanged setting). At five seeds and width 512 the spectral update leads local Adam by a clear margin (48.9 +/- 0.5 vs 46.6 +/- 0.3). Prospectively specified controls attribute the transfer and most of the depth robustness to the spectral geometry itself rather than to any step-size rule on top of it. We additionally formulate the step size as a drift contract, lr = epsilon / RMS(input), which bounds each layer’s weight-induced pre-activation change per step, conditioned on its current input. The contract yields a small gain over the best fixed learning rate where that baseline is measured, makes the step size interpretable, and provides a per-layer, input-conditioned drift bound that standard optimizers do not offer. We report one negative result: with RMSNorm and weight decay in the trunk, the stability benefit of spectral updates accrues to global rather than local training, so the local advantage concentrates precisely where normalization is absent.
[LG-88] Nonequilibrium Phases of Repulsive Self-Attention: Chaos Attention Condensation and Emergent Locality
链接: https://arxiv.org/abs/2609.28448
作者: Qucheng Gao,Zuyi Yang,Xiao Chen
类目: Disordered Systems and Neural Networks (cond-mat.dis-nn); Statistical Mechanics (cond-mat.stat-mech); Machine Learning (cs.LG)
*备注: 54 pages, 21 figures, including appendices
Abstract:We study the nonequilibrium dynamics of a minimal recurrent transformer with N normalized tokens, Q=K=I , and a negative value map V=-I . Similarity-based attention selects nearby representations, while the negative value map drives tokens away from the selected field. This feedback can continually reorganize both the representation geometry and the attention network. For d=2 , the tokens lie on a circle, where the regular polygon is an exact fixed point. As the attention feedback strength \gamma is increased, the polygon loses stability through a flip bifurcation, giving rise to period-two motion, chaos, and cluster-exchange or cluster-flip states. Despite this temporal complexity, attention remains diffuse as N\to\infty at finite fixed softmax sharpness \beta . Attention condensation instead emerges in the scaling regime \beta\sim N^2 . In the hard-routing limit, repulsive updates amplify local perturbations and routing-partner switches transmit them ballistically, producing an emergent butterfly cone in representation space. High-dimensional geometry provides a distinct route to localization. For d=N\to\infty , simulations from Gaussian initial conditions provide evidence for a condensation transition at \beta=O(1) , driven by dynamically generated finite overlap gaps. Depending on \gamma , the resulting phases include diffuse simplex-like states, consensus flips, condensed active routing with signatures of chaos, and fragmented cluster flips. These results establish temporal activity, attention condensation, and geometric clustering as distinct collective phenomena, and show that sparse attention can sustain persistent dynamics rather than freeze it.
[LG-89] Repairability of Inexact Solvers in Recursive State Estimation with Machine Learning
链接: https://arxiv.org/abs/2609.28425
作者: Yanjun Ji,Dennis Willsch,Orkun Şensebat,Priyanka Arkalgud Ganeshamurthy,Zhi Pei,M. Sahnawaz Alam,Ivelina Stoyanova,Frank K. Wilhelm,Bo Zhao,Chao Wang,Kristel Michielsen
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG)
*备注:
Abstract:Recursive state estimation often executes approximate numerical solutions inside a feedback loop, where highly accurate local steps do not guarantee better overall results. For a fixed linear Kalman model, we characterize when a correction within a prescribed subspace and norm budget can meet a local admissibility tolerance, and how the defects actually executed affect the finite-horizon covariance response. Centering each defect on the exact gain for the implemented covariance separates current solve error from inherited gain drift. Expanding the exact residual-drift identity reveals opposing quartic contributions beyond the quadratic response: innovation-covariance inflation enters positively, while local-gain reoptimization enters subtractively. Under matched initialization, an absolute sixth-order remainder bound, uniform over bounded defect sequences at fixed horizon, gives sufficient conditions for quadratic under- or overprediction. Machine learning proposes bounded corrections, while a learner-independent residual certificate and verified fallback govern execution of classical and quantum candidates without changing the reference estimator. In a power-grid tolerance study, learned correction lowers the minimum conjugate-gradient iteration count for deployment without fallback relative to uncorrected solves under the same residual certificate. Gains reconstructed from a variational quantum linear solver and from an annealing-based binary encoding, with small-scale terminal measurements on superconducting hardware and sampling on a quantum annealer, are executed through the same interface. By linking local repairability to nonlinear error propagation, the framework evaluates approximate solvers and learned corrections through independent certification and finite-horizon response, providing a practical basis for studying hybrid quantum–classical computation.
[LG-90] Quantum score matching with applications to learning thermal states ATC
链接: https://arxiv.org/abs/2609.28391
作者: Yulong Dong,Jiaqi Leng
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG)
*备注: 57 pages, 5 figures, 3 tables, with an accompanying GitHub repository at this https URL
Abstract:Score matching has driven major advances in classical generative learning by enabling models to learn from data without evaluating intractable normalization constants, or partition functions. Yet, extending this principle to quantum learning requires rethinking its foundations, as quantum states are described by noncommuting density operators rather than scalar probabilities. The noncommutativity creates fundamental challenges not only in defining quantum scores, but also in developing a training framework with efficient circuit implementations and rigorous theoretical guarantees. In this work, we bridge this gap by establishing a general quantum score-matching framework with end-to-end theoretical guarantees. Applied to Gibbs-state learning, our approach avoids additional thermal-state preparation and achieves information-theoretically optimal sample complexity in the high-temperature regime for Hamiltonians with bounded locality and interaction degree. This positions score matching as a new route to state-of-the-art performance in learning quantum Gibbs states. Beyond these theoretical results, numerical simulations show that our method remains effective even when gradients are estimated inaccurately under limited measurement budgets. Experiments on IBM quantum hardware further demonstrate that quantum score matching is NISQ-friendly: without any error mitigation or correction, it reduces the relative Hamiltonian-parameter error from 64% to approximately 10%. Together, these results extend score matching into an experimentally realizable paradigm for quantum-state learning. Comments: 57 pages, 5 figures, 3 tables, with an accompanying GitHub repository at this https URL Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG) Cite as: arXiv:2609.28391 [quant-ph] (or arXiv:2609.28391v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2609.28391 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-91] Local Geometric Mixing via Dobrushin Contraction with Applications to Diffusion Path Monte Carlo and the Proximal Sampler
链接: https://arxiv.org/abs/2609.28338
作者: Stefan Oberdörster
类目: Probability (math.PR); Machine Learning (cs.LG); Computation (stat.CO); Machine Learning (stat.ML)
*备注:
Abstract:Local geometric mixing localizes geometric mixing by requiring geometric convergence to equilibrium in total variation only over finitely many transitions. It accommodates local convergence rates and captures rapid local equilibration, even when global mixing is much slower. We establish and discuss local geometric mixing bounds through Dobrushin contraction. We then apply this approach to Diffusion Path Monte Carlo, a recently proposed Markov chain Monte Carlo method, aimed at leveraging advances in score-based modeling, whose ideal transitions coincide with those of the Proximal Sampler. Our analysis covers both the ideal method and its implementable Metropolis-adjusted counterpart, providing mixing guarantees under minimal assumptions. For the ideal method, these guarantees complement recent spectral gap estimates, which we develop into mixing time bounds.
[LG-92] How Sensitive Are LLM Leaderboard Claims to Hidden Model Selection?
链接: https://arxiv.org/abs/2609.28177
作者: Chen Yang,Xianyang Zhang,Jun Chen
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: 32 pages
Abstract:LLM leaderboard gains can reflect selection among privately evaluated model variants, yet neither the number of variants nor their dependence is public. We ask how many hidden variants a published margin can support while retaining statistical evidence of a provider’s advantage over a fixed comparator. For a fixed candidate family under a Gaussian margin model, we derive a sensitivity curve that reports this maximum count as a function of a lower bound on within-family correlation. The relevant correlation must match the score used for ranking and the sampling model: in a controlled family, pooled item correlation is 0.90, whereas composite-score correlation is 0.46 under item resampling and 0.92 when MMLU subjects are resampled. An item-based audit of 394 adjacent-rank claims on the Open LLM Leaderboard finds that 391 lack statistical support even before accounting for selection. Among claims that pass the uncorrected test, certification can depend on assumptions about the hidden family’s correlation. The resulting curves make these assumptions explicit without estimating the unobserved search size.
[LG-93] NPBoost: Neural Processes with Gradient-Boosted Fixed Effects
链接: https://arxiv.org/abs/2609.28122
作者: Andrea Nava,Ken Rölli,Armin Begic,Fabio Sigrist
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Neural Processes (NPs) are model-based meta-learners that implicitly learn a stochastic process and adapt to a new task from a small context set. Most extensions of NPs focus on improving the neural network architecture. We instead develop an extension motivated by the shared hierarchical interpretation of meta-learning and mixed-effects models. Specifically, we introduce Neural Process Boosting (NPBoost), which decomposes structured response variability into tree-boosted fixed effects shared across tasks and NP random effects that capture stochastic task-to-task variation. We propose to train the two components jointly using a boosting algorithm in which an NP learns residual task-specific structure and a tree ensemble estimates common patterns across tasks. Across synthetic and real-world tabular meta-learning problems, this decomposition improves over a standard NP when the shared structure contains discontinuities or other irregular patterns that boosted trees can represent effectively.
[LG-94] Improving Ensemble Filters with Flow Matching
链接: https://arxiv.org/abs/2609.28015
作者: Haoyuan Chen,Alexandre Thiéry
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Dynamical Systems (math.DS); Methodology (stat.ME)
*备注: 57 pages, 6 figures, 12 tables
Abstract:Data assimilation estimates a dynamical state from partial and noisy observations. Classical ensemble filters are efficient but restrict analysis updates through finite sample covariance and affine Gaussian distribution. We introduce the Flow Ensemble Filter (FlowEF), which uses conditional flow matching to transport the forecast ensemble from a classical baseline filter to an analysis ensemble. FlowEF uses a localized Gaussian source during training, transports forecast ensemble members from a baseline filter at deployment, and conditions its velocity field on ensembles from that baseline filter and the observation. The proposed model therefore learns a nonlinear update while mapping each baseline ensemble independently. For sparsely observed dynamical systems, FlowEF improves both deterministic and probabilistic metrics over all four classical ensemble filters. It also achieves the best performance among the state-of-the-art generative data assimilation models.
[LG-95] SoLiD26: A First Principles Solid-Liquid Interface Dataset for Machine-learned Interatomic Potentials
链接: https://arxiv.org/abs/2609.28013
作者: Jonas Busk,Emil J. P. Frost,Yogeshwaran Krishnan,Henrik H. Kristoffersen,August E. G. Mikkelsen,Xueping Qin,Xin Yang,Heine A. Hansen,Arghya Bhowmik,Tejs Vegge
类目: Materials Science (cond-mat.mtrl-sci); Machine Learning (cs.LG); Chemical Physics (physics.chem-ph); Computational Physics (physics.comp-ph)
*备注:
Abstract:Machine-learned interatomic potentials (MLIPs) for solid-liquid interfaces in advanced materials applications, e.g., electrochemistry, catalysis and corrosion, require training data that samples both liquid environments, the solid and the interface itself. We present SoLiD26, a curated solid-liquid interface dataset, containing 15.4 million first-principles atomic structures with up to 576 atoms and 15 chemical elements for training and evaluating MLIPs. The structures were compiled from density functional theory (DFT) calculations performed in studies of solid-liquid interfaces, with most configurations originating from ab initio molecular dynamics (AIMD) simulations. Each record contains atomic species, positions, simulation cell, periodic boundary conditions, potential energy and atomic forces. SoLiD26 includes aqueous coinage metal interfaces, electrode-electrolyte systems, and selected bulk reference structures, calculated with VASP using the PBE functional and D3 dispersion corrections. We describe the data ingestion and preparation pipeline used to construct the dataset. The application of SoLiD26 for training and evaluating MLIPs is demonstrated with a suite of MACE models on a simple training, validation and test split. The dataset enables development and benchmarking of MLIPs for structurally and chemically heterogeneous solid-liquid interfaces.
[LG-96] Conformal Bayes under Continuous Label Shift: Sensitivity Analysis and the Limits of Exact Validity
链接: https://arxiv.org/abs/2609.27976
作者: Seungjin Choi
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: 47 pages
Abstract:Conformal Bayes combines Bayesian posterior predictive scores with conformal calibration, but under continuous label shift both the score and calibration weight depend on the unknown response-marginal density ratio. Existing methods typically estimate one shift parameter from pseudo-labels or predictive samples and plug it into calibration. We instead propose Joint Tilt-Sensitivity Conformal Bayes (JTS-CB), which performs sensitivity analysis over a prespecified set of plausible tilts; its split-conformal realization is JTS-SCB. Each tilt jointly determines the Bayesian conformal score and conformal importance weight. JTS-SCB forms a bounded sensitivity envelope over candidate tilts, but its calibration-only construction does not inherit the exact finite-sample weighted-conformal guarantee. We therefore study a separate candidate-weighted exact counterpart and show that its usefulness depends sharply on tail behavior. For scalar linear exponential tilts, any nonzero candidate tilt makes the exact set unbounded. More generally, tail-growing density ratios produce the same pathology, whereas quadratic tilts with a negative coefficient on (y^2) have vanishing tail weights and admit bounded exact inference on the original target. Ratio clipping provides a complementary bounded exact construction for a surrogate target when tails grow. Experiments show that strong plug-in predictive sampling can match the oracle when the shift is well identified, while sensitivity analysis is most useful for richer, weakly identified, or systematically biased shift models, at the cost of wider prediction sets.
[LG-97] Dirichlet Process Mixtures of Trees with Gaussian Process Splits: A Bayesian Nonparametric Framework with Posterior Contraction Rate
链接: https://arxiv.org/abs/2609.27930
作者: Subhasish Basak,Anik Roy,Sourabh Bhattacharya
类目: Methodology (stat.ME); Machine Learning (cs.LG); Statistics Theory (math.ST); Machine Learning (stat.ML)
*备注: Comments and questions welcome!
Abstract:We propose a Bayesian nonparametric mixture of regression trees with a Dirichlet process prior over tree-parameter pairs, enabling data-driven selection of ensemble size and unifying CART, BART, random forests, and boosting. A novel splitting rule driven by the posterior predictive of a Gaussian process within each terminal node generates flexible, smooth decision boundaries; remarkably, the GP density cancels exactly in the Metropolis–Hastings ratio for GROW/PRUNE moves, ensuring computational feasibility. An exact Gibbs sampler for posterior predictive inference propagates uncertainty through random tree traversal. A parallel MPI implementation distributes independent tree updates across processors, achieving adequate speedups. We prove posterior consistency at rate n^-1/4 in Hellinger distance under only continuity of the true regression function, allowing misspecification, via the identity h(\Theta)=0 . Simulations on Friedman benchmark show near-nominal coverage (0.94 Gaussian, 0.92 Cauchy), robust to high-dimensional noise and heavy tails, outperforming BART and bagged CART. Applications to QSAR toxicity, crime, riboflavin, wheat genomics, and air quality confirm reliable credible intervals and automatic sparsity. The DP mixture offers a principled, robust, theoretically justified alternative for challenging regression with honest uncertainty quantification.
[LG-98] Noise-Induced Predictability Redistribution Across Forecast Horizons of Extreme Events in Chaotic Dynamics
链接: https://arxiv.org/abs/2609.27877
作者: Andrei Velichko,Viet-Thanh Pham
类目: Chaotic Dynamics (nlin.CD); Machine Learning (cs.LG); Data Analysis, Statistics and Probability (physics.data-an)
*备注: 26 pages, 9 figures, 1 table, 42 references
Abstract:Extreme events (EEs) in chaotic dynamics are rare broad excursions whose forecastability can be altered by dynamical noise. We investigate how noise changes EE occurrence and prediction skill across forecast horizons in a third-order autonomous chaotic flow. A single clean-data threshold is frozen for all realizations, broad events are defined by one maximum per excursion, and a future window W=15 is predicted from a 15-time-unit history using HistGradientBoosting with chronological data separation. As the forecast gap G between the observed history and the future event window increases, the clean Matthews correlation coefficient (MCC) decreases from 0.641 at G=0 to 0.165 at G=15. Noise dependence is evaluated with ten paired realizations at eight amplitudes. The mean short-horizon score increases from 0.456 in clean data to 0.546 at sigma=0.007; the paired gain is 0.0895 (95% CI 0.0494-0.1295; Holm-adjusted p=0.0234). Noise strongly increases EE occurrence while event amplitude and width remain comparatively stable. Equalizing positive training counts across noise levels substantially attenuates the short-horizon gain, whereas strong noise reduces intermediate-horizon skill. We term this horizon-dependent, nonuniform change in forecast skill noise-induced predictability redistribution (NIPR).
[LG-99] heoretical Study on the Evidential Learning-based Variational Autoencoder
链接: https://arxiv.org/abs/2609.27853
作者: Ge Wang
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Neural and Evolutionary Computing (cs.NE); Statistics Theory (math.ST)
*备注: 18 pages, 0 figures. Theoretical study of the NIG latent bottleneck in ELVAE; related to arXiv:2608.10398
Abstract:A normal–inverse-gamma (NIG) latent hierarchy has four parameters, but its induced latent law does not identify all four. For \sigma^2\sim\mathrmInvGamma(\alpha,\beta) , \mu\mid\sigma^2\sim\mathcalN(\gamma,\sigma^2/\nu) , and z\mid\mu,\sigma^2\sim\mathcalN(\mu,\sigma^2) , the marginal law of z depends on (\nu,\beta) only through c=\beta(1+1/\nu) . Hence the reconstruction-visible parameter space is the three-dimensional quotient (\gamma,\alpha,c) , with a one-dimensional fiber degree of freedom. For a fixed hierarchical variational objective, exact partial minimization of the forward KL divergence to a complete NIG prior selects a unique prior-relative representative on each fiber, yielding an exact three-coordinate reduction with the same optimum as the four-coordinate objective. Writing \rho_0=2\beta_0/\nu_0 and T=c/\alpha[(\gamma-\gamma_0)^2+\rho_0]\ , we show that inverse canonical allocation 1/\nu_\rm can is an explicit strictly increasing function of T . For \alpha1 , the ratio u_\rm epi/u_\rm var=1/\nu_\rm can is therefore determined by the quotient state and prior; for rank-only use under a common calibration, T contains the same coordinatewise ordinal information. The residual prior gauge is characterized rather than eliminated: (\gamma_0,\rho_0) govern ordinal dependence, while (\nu_0,\alpha_0) determine numerical calibration and the analytic ceiling of 1/\nu_\rm can .
[LG-100] ype-II Error Bounds for Test Supermartingales from Lower-Tail Hypotheses
链接: https://arxiv.org/abs/2609.27766
作者: Patrick Forré
类目: atistics Theory (math.ST); Information Theory (cs.IT); Machine Learning (cs.LG); Probability (math.PR); Machine Learning (stat.ML)
*备注:
Abstract:In safe hypothesis testing with test supermartingals, Ville’s inequality provides anytime-valid type-I error guarantees for every significance level \alpha\in(0,1] , if one rejects the null hypothesis whenever the wealth process first exceeds \frac1\alpha . Due to an inherent asymmetry, the type-II error does not have such guarantees: a heavy concentration of the probability on the lower tail of the log-increments can lead to one catastrophic bet that undoes any amount of accumulated evidence. This paper studies how different hypotheses on those lower-tail probabilities lead to different bounds on the type-II error of the sequential test. They all reduce to one master inequality, which bounds the type-II error at level \alpha , at a fixed horizon and sequentially, in terms of a one-sided Legendre transform of the (inverse-)moment generating function of the e-variables, evaluated at one number: the amount by which the lower bound of the accumulated e-powers exceeds \log\frac1\alpha . And, the step is lossless, in the sense, that it extracts exactly a constrained information projection. Every bound presented here is a corollary, obtained by a certain majorant of the above function. The hypotheses are: a finite negative moment; an exponentially small crash probability with a moment on the winning side; a wealth floor with a conditional variance, and its Bernstein variant, which interpolates between a Gaussian regime set by the variance and an exponential one set by the scale; a sub-Gaussian or bounded-tilt lower tail; bounded log-increments; and i.i.d. increments, where the majorant is the truth. We also provide an empirical-Bernstein variant. Each hypothesis may either be read as a condition on the e-variables one has, or as the price of betting with an approximation to the likelihood ratio rather than the ratio itself, which satisfies the weakest condition for free.
[LG-101] he Type-II Error of Test Supermartingales: e-Power versus the Chernoff-Stein Exponent
链接: https://arxiv.org/abs/2609.27765
作者: Patrick Forré
类目: atistics Theory (math.ST); Information Theory (cs.IT); Machine Learning (cs.LG); Probability (math.PR); Machine Learning (stat.ML)
*备注:
Abstract:In safe hypothesis testing with test supermartingales, Ville’s inequality provides anytime-valid type-I error guarantees for every significance level \alpha\in(0,1] , if one rejects the null hypothesis whenever the wealth process first exceeds 1/\alpha . Due to an inherent asymmetry, the type-II error behaves differently. We prove two things about the latter, for a simple null and alternative. First, the mean growth rate \mathbbE_P_1[\log E] , the e-power, that Kelly betting and growth-rate-optimal e-variables maximise, bounds nothing on its own. For every level c0 , every \alpha and horizon t we construct e-variables of conditional e-power exactly c whose probability of not rejecting by t is arbitrarily close to one. It forces eventual rejection, but no finite-horizon guarantee follows. Second, the quantity that does control the type-II error is the Chernoff-Stein exponent of an e-variable, \Lambda(E)=\sup_s\ge0-\log \mathbbE_P_1[E^-s]\ , whose range is exactly determined: \sup_E \Lambda(E)=\mathrmKL(P_0|P_1) , the classical Chernoff-Stein exponent, and so the ceiling of its own per-e-variable form. One conditional application of Hoelder’s inequality per step gives it, for every test supermartingale on an arbitrary filtered space, with no independence or product structure; the i.i.d. case adds that it is matched, and attained by nothing. The e-power has its own ceiling, \mathrmKL(P_1|P_0) , and that one is attained, P_0 -a.s. uniquely, by the likelihood ratio R . The two optima are the same divergence in opposite arguments, at opposite ends of the flattened family R^\beta/\mathbbE_P_0[R^\beta] : the ceiling as \beta\downarrow0 , R at \beta=1 . Which \beta is best is settled by the horizon, exactly: R is optimal at t=\log(1/\alpha)/\mathrmKL(P_1|P_0) alone, beaten by sharpening (\beta1) below it and by flattening above.
[LG-102] FedIncome: Federated Learning for Income Estimation in Digital Lending Under Data Sovereignty Constraints
链接: https://arxiv.org/abs/2609.27654
作者: Sultan Amed,Tanmay Sen,Sayantan Banerjee
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Statistical Finance (q-fin.ST)
*备注:
Abstract:Verified income is often unavailable in digital loan applications, forcing lenders to rely on reported income and potentially leading to over-lending, overly conservative offers, or rejection of creditworthy applicants. Cross-institutional data-sharing constraints make this problem especially difficult for smaller lenders with limited training data. We introduce FedIncome, a federated learning framework for income estimation that enables institutions to train a shared model without pooling raw borrower records. Using more than one million LendingClub loans partitioned into 50 state-level clients, we simulate a heterogeneous lending consortium. The best federated model achieves out-of-time R^2=0.608 , compared with 0.619 for a pooled centralised benchmark. Small-sample clients obtain an average out-of-time R^2 improvement of 3.8 percentage points relative to the pooled centralised benchmark, while the fitted client-level relationship places the empirical crossover at approximately 4,790 training observations in this setting. When pooling is infeasible and the relevant alternative is local-only training, federation improves out-of-time performance across all sample-size groups, with the largest gains for data-scarce clients. We also combine federated income estimates with state- and income-specific debt-to-income thresholds. In a retrospective decision analysis, replacing reported income with the federated estimate increases simulated approval rates with only modest changes in observed default rates. FedIncome supports collaborative learning under data-locality constraints with little aggregate loss relative to pooled training and larger gains relative to local-only estimation.
[LG-103] Robustness of Diffusion Models under Distribution Shift
链接: https://arxiv.org/abs/2609.27546
作者: Wei Luo,Neil K. Chada,Shijie Zhang,Lu Yu
类目: atistics Theory (math.ST); Machine Learning (cs.LG); Probability (math.PR); Machine Learning (stat.ML)
*备注: 13 pages, 2 figures
Abstract:Score-based diffusion models are increasingly considered in settings where the underlying data distribution may differ from the training distribution, yet existing theoretical guarantees largely focus on the no-shift setting. In this work, we study robust score estimation under Wasserstein perturbations of a reference distribution. For the Ornstein–Uhlenbeck diffusion, we show that robust estimation decomposes into two fundamental components: the statistical cost of learning the reference distribution and the intrinsic cost of distribution shift. The latter scales quadratically with the Wasserstein radius, and this dependence is minimax optimal. We construct an explicit finite-sample estimator achieving the resulting robust minimax rate without knowing the shift radius. When the reference distribution lies on an unknown low-dimensional subspace, the statistical term adapts to the intrinsic dimension while the shift cost remains unchanged. Finally, we show that the same decomposition governs positive-time reverse sampling and obtain matching minimax guarantees in KL divergence. Together, these results characterize how finite data, intrinsic dimension, and distribution shift affect the robustness of score-based diffusion models.
[LG-104] Multitask Regression with Pairwise Fusion
链接: https://arxiv.org/abs/2609.27280
作者: Xiaodong Li,Zhentao Li
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: 34 pages, 1 figure, 2 tables
Abstract:We study multitask regression when coefficient sharing can differ by predictor. For a given predictor, many tasks may have the same coefficient while a few differ, and the exceptional tasks need not be the same for another predictor. We describe this structure by two quantities: the number of active predictors and the total number of task coefficients that differ from the most common value for their predictor. We estimate the coefficient matrix by penalizing all pairwise coefficient differences across tasks, with an additional group penalty when predictor selection is needed. The resulting upper and lower bounds have the same dependence on these two quantities. We also consider the stronger setting in which a large set of tasks shares one entire coefficient vector. Under explicit sample-size conditions, the same pairwise estimator pools those tasks exactly, while allowing the remaining tasks to differ. Simulations and household energy data illustrate the transition between broad sharing and task-specific coefficients.
[LG-105] On the Sample Complexity of Active Learning with Membership Queries
链接: https://arxiv.org/abs/2609.27241
作者: Ganghua Wang,Shaddin Dughmi
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Statistics Theory (math.ST)
*备注:
Abstract:This work revisits a fundamental question in active learning: how powerful is the ability to synthesize arbitrary queries? Compared to pool-based active learning, where the learner only selects queries from a given unlabeled pool, we find that this seemingly mild change in query ability may dramatically alter the difficulty of statistical learning. In particular, some hypothesis classes that are inherently slow to learn in the pool-based setting, achieving only polynomial error decay in the number of samples, become exponentially learnable once synthesized queries are allowed. This striking gap suggests that membership query synthesis induces a fundamentally different mode of learning, one that is not adequately captured by existing active learning theory and calls for new analytical tools to characterize its complexity. Motivated by this phenomenon, we develop several sufficient conditions, present intriguing examples, and propose a conjectural perspective toward understanding which hypothesis classes admit efficient learning through synthesized queries.
[LG-106] Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant
链接: https://arxiv.org/abs/2609.27206
作者: Yang Cai,Vineet Gupta,Yanchen Jiang,Christopher Liaw,Aranyak Mehta,Grigoris Velegkas,Di Wang
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Prediction with expert advice is a fundamental problem in online learning. When the time horizon T is known in advance, the minimax cumulative regret over n experts is asymptotically \sqrt\fracT \ln n2 . This is achieved by the Multiplicative Weights Update algorithm with a learning rate tuned to T , and is known to be tight. If instead the regret bound is required to hold simultaneously at every time t , the best known guarantee has been \sqrtt \ln n —a factor of \sqrt2 worse—and it has remained unknown whether this factor of \sqrt2 is necessary. We show that it is not. We give an algorithm, requiring no knowledge of the horizon, whose cumulative regret satisfies R_t \le \bigl(1 + O(\sqrt\ln \ln n / \ln n)\bigr)\sqrtt \ln n / 2 simultaneously for every t \ge 1 .
[LG-107] Artificial intelligence surrogates for treatment effect estimation with before-and-after data
链接: https://arxiv.org/abs/2609.27180
作者: Frances Dean,Anna Neufeld,Joshua Barrios,Geoffrey H Tison,Ahmed Alaa
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Estimating the causal effects of medical treatments is difficult when clinically important outcomes are costly to measure or require long follow-up. Short-term or inexpensive surrogate outcomes offer a potential alternative, but surrogate biomarkers may be unavailable or difficult to identify. Advances in artificial intelligence (AI) have enabled increasingly accurate prediction of clinical outcomes from inexpensive, high-dimensional measurements, which creates an opportunity to use AI predictions themselves as surrogates. To this end, we develop a framework for estimating treatment effects from paired measurements obtained before and after treatment for each treated individual. A pretrained AI model is applied to the before and after measurements, and our estimator compares the resulting outcome predictions. We characterize the technical assumptions under which this within-person contrast identifies the average treatment effect on the treated, even when clinical outcomes are never observed for treated individuals. When these assumptions cannot be justified, we use prediction-powered inference to correct bias using a small number of observed clinical outcomes and obtain valid inference. Synthetic and real-world cardio-oncology experiments demonstrate the validity and accuracy of the approach.
[LG-108] CVaR anchor regression protects against rare shifts
链接: https://arxiv.org/abs/2609.27034
作者: Malte Londschien
类目: Methodology (stat.ME); Machine Learning (cs.LG)
*备注:
Abstract:We study prediction in new environments when training data contain rare, large shifts. Anchor regression penalizes the average of the squared mean residual across environments. It protects against shifts in an ellipsoid determined by the second moment of the training shifts. Covering rare shifts may therefore require a large penalty, expanding the ellipsoid in every direction and reducing accuracy on common environments. We propose CVaR anchor regression, which replaces the average of the squared mean residuals with a tail average. Unlike CVaR or GroupDRO applied directly to prediction risks, it does not give environments more weight solely because their noise levels are high. We prove an exact worst-case risk guarantee under a linear structural model that allows for heteroscedastic noise. For discrete environments, decreasing the CVaR tail fraction expands the robustness set from an ellipsoid to a scaled convex hull of the training shifts and their negatives. A separate parameter controls its scale. Examples show how the method can improve protection against rare shifts while retaining accuracy on common environments. We illustrate the method on New York City taxi data.
[LG-109] Sharp Convergence of Wasserstein Gradient Flows for Spectrally Nonnegative Interaction Energies
链接: https://arxiv.org/abs/2609.27008
作者: Zhengjiang Lin,Philippe Rigollet
类目: Analysis of PDEs (math.AP); Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注: 38 pages, 1 figure
Abstract:We study the long-time behavior of Wasserstein gradient flows for interaction energies [ \mathsf E[\mu] = \frac12\iint_M\times MK(x,y),\mathrm d\mu(x),\mathrm d\mu(y) ] on a closed manifold M . For kernels diagonal in a Laplace eigenbasis with nonnegative spectral coefficients, we prove a differential inequality relating the relative entropy to the energy gap. Consequently, for any nonnegative initial density u_0\in L^p(M) , p1 , the energy gap is integrable in time and satisfies [ \mathsf E[\mu_t]-\mathsf E_\min=o(t^-1). ] If all spectral coefficients are positive, the flow converges weakly to the constant measure. These interaction energies need not be geodesically convex in Wasserstein space, and the associated flows contain no diffusion; their global convergence therefore does not follow from standard Wasserstein gradient flow theory. The kernels covered by our results include zonal kernels on spheres, kernels arising in transformer models, regularized Riesz kernels, and inverse fractional Laplacian kernels. We also investigate the sharpness of the o(t^-1) rate. For any smooth kernel in this class with infinitely many positive spectral coefficients and any \delta0 , we construct a solution of the linearized flow whose energy is comparable to t^-1-\delta along a sequence of times tending to infinity. Moreover, for any \delta0 , by choosing a suitable inverse fractional Laplacian kernel on the flat torus, we construct an exact solution of the nonlinear Wasserstein gradient flow whose energy is comparable to t^-1-\delta . The nonlinear construction is based on uniform-in-time estimates for the evolution of the dyadic Fourier coefficient blocks and a blockwise energy-persistence argument. These estimates also yield a uniform-in-time quantitative comparison between the nonlinear Wasserstein gradient flow and its linearization. Comments: 38 pages, 1 figure Subjects: Analysis of PDEs (math.AP); Machine Learning (cs.LG); Optimization and Control (math.OC) Cite as: arXiv:2609.27008 [math.AP] (or arXiv:2609.27008v1 [math.AP] for this version) https://doi.org/10.48550/arXiv.2609.27008 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-110] ght Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights
链接: https://arxiv.org/abs/2609.26978
作者: Shinsaku Sakaue
类目: Machine Learning (stat.ML); Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)
*备注:
Abstract:We study online inverse linear optimization with a fixed unknown linear utility: in each round, an environment presents a compact action set, the learner recommends an action from it, and the environment returns an action that maximizes the utility over the same set. When the utility vector and the actions lie in the d -dimensional Euclidean unit ball, we give a randomized algorithm whose regret—the cumulative utility shortfall relative to optimal actions—is O(\sqrt d) in expectation for every time horizon, without knowledge of the horizon. The dependence on d is optimal up to a constant factor by the known \Omega(\sqrt d) lower bound for horizons T\ge d . Our algorithm maintains matrix multiplicative weights on polynomial feature spaces at geometrically spaced scales. It selects a recommendation distribution by solving a linear program and updates its score matrices by comparing the available actions with the feedback action. With rational oracle outputs and feedback actions, an implementation computable relative to a linear-optimization oracle preserves the O(\sqrt d) regret bound. Whether the same rate is attainable with running time polynomial in the dimension, horizon, and input length remains open.
[LG-111] Untangling the Geometry and Speed for RF Sensing Spectrograms
链接: https://arxiv.org/abs/2609.26960
作者: Mert Torun,Darius Cuenca,Yasamin Mostofi
类目: ignal Processing (eess.SP); Machine Learning (cs.LG)
*备注:
Abstract:A fundamental challenge in RF sensing is that Doppler signatures observed by a link entangle the target’s motion with the sensing geometry, resulting in limited applicability to unconstrained real-world settings. In this paper, we establish a new foundation for physically interpretable RF sensing that disentangles reflector speed from geometry, jointly recovering the speed, geometry factor, relative amplitude, and width of each dominant Doppler ridge. More specifically, we first develop a compact parametric representation of WiFi spectrograms and establish its low-dimensional structure through a systematic computer-vision analysis of a large and diverse human-activity dataset, thereby providing a tractable foundation for learning. Building on this representation, we then design a physics-informed autoencoder whose structured bottleneck and differentiable RF forward model enforce physically meaningful estimates of reflector speed and geometry. We further introduce a synthetic-to-real training framework, eliminating the need for real WiFi training data. We extensively validate the proposed framework under both known and time-varying geometries, using both independently generated synthetic test sets and 31 real WiFi experiments. The results demonstrate the superior performance in speed and geometry extraction, robustly recovering the underlying geometry, speeds, Doppler-ridge amplitudes, and ridge widths across all settings, while substantially outperforming the strongest baselines.
[LG-112] Rolling Conformal Prediction in Sequential Model Training
链接: https://arxiv.org/abs/2609.26951
作者: Chen Cheng,Ruiting Liang,Rina Foygel Barber
类目: atistics Theory (math.ST); Machine Learning (cs.LG); Methodology (stat.ME); Machine Learning (stat.ML)
*备注: 42 pages, 5 figures
Abstract:We introduce Rolling Conformal Prediction (rolling-CP), a distribution-free predictive inference method for the setting of sequential model training. Specifically, given a data stream (X_1,Y_1),(X_2,Y_2),\dots , at each time n the trained model may depend on the observed history (X_i,Y_i)_in . This setting arises naturally in modern sequential training, including one-pass training over massive datasets and continual fine-tuning or test-time adaptation of language models during deployment. Rolling-CP first calibrates each incoming observation against the current predictor and then rolls it into future training. In this way, we avoid the need for data splitting. Remarkably, although the models at times n=1,2,\dots may have entirely different properties and accuracy levels, for exchangeable data it is nonetheless possible to establish a guarantee of marginal coverage, with a familiar universal factor-two guarantee (a worst case guarantee of 1-2\alpha coverage, as compared to the target level 1-\alpha ), without any assumptions of stability or any restrictions on the model training process. For i.i.d. data streams, we further prove high-probability training-conditional validity uniformly over time; under stability conditions, coverage guarantees sharpen towards 1-\alpha . Numerical experiments on sequential regression, multiclass SGD, and one-pass neural-network training further demonstrate the practical effectiveness of rolling-CP. Comments: 42 pages, 5 figures Subjects: Statistics Theory (math.ST); Machine Learning (cs.LG); Methodology (stat.ME); Machine Learning (stat.ML) Cite as: arXiv:2609.26951 [math.ST] (or arXiv:2609.26951v1 [math.ST] for this version) https://doi.org/10.48550/arXiv.2609.26951 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-113] An improved periodic activation for PINNs reconstructing convective flows
链接: https://arxiv.org/abs/2609.21798
作者: Michael Mommert,Marie-Christine Volk,Christian Bauer
类目: Fluid Dynamics (physics.flu-dyn); Machine Learning (cs.LG)
*备注:
Abstract:Architectures with periodic activation functions have already been shown to be beneficial in comparison to monotonic counterparts for a wide range of applications of physics-informed neural networks. Here, we investigate a network architecture which uses the complex exponential function, generating pairs of sine and cosine outputs as activation functions. Testing it against comparable, sine-activated multi-layer perceptrons for the task of temperature reconstruction from sparse velocity data for cubic Rayleigh-Bénard convection reveals significant improvements in the reconstruction quality without a substantial increase in computational cost per training step. Vice versa, the improved architecture enables reaching similar reconstruction qualities for a fraction of the expense. Analyzing the mathematical structure of these networks points to the improvements being rooted in the property of passing both a sine and cosine function forward. This way, the subsequent layer is able to adapt the phase of the provided latent periodic functions, and doing it individually for each of its neurons.
附件下载
