本篇博文主要内容为 2026-10-12 从Arxiv.org论文网站获取的最新论文列表，自动更新，按照NLP、CV、ML、AI、IR、MA六个大方向区分。
说明：每日论文数据从Arxiv.org获取，每天早上12:30左右定时自动更新。
提示: 当天未及时更新，有可能是Arxiv当日未有新的论文发布，也有可能是脚本出错。尽可能会在当天修复。
目录
概览 (2026-10-12)
今日共更新823篇论文,其中:
- 自然语言处理共116篇(Computation and Language (cs.CL))
- 人工智能共163篇(Artificial Intelligence (cs.AI))
- 计算机视觉共154篇(Computer Vision and Pattern Recognition (cs.CV))
- 机器学习共263篇(Machine Learning (cs.LG))
- 多智能体系统共19篇(Multiagent Systems (cs.MA))
- 信息检索共11篇(Information Retrieval (cs.IR))
- 人机交互共17篇(Human-Computer Interaction (cs.HC))
多智能体系统
[MA-0] Ask Your Advisor: Learning When to Consult Stronger Models in Agent ic Systems
【速读】：该论文旨在解决代理工作流（agentic workflows）中任务性能与计算成本之间的权衡问题，核心挑战在于如何在不显著增加成本的前提下提升任务成功率。现有方法依赖执行器（executor）基于自身判断决定是否向更强的顾问模型（advisor）求助，但当前语言模型普遍缺乏准确识别自身推理缺陷的能力，导致咨询时机不当。为应对这一问题，作者提出 ARIA——一种元控制器（meta-controller），其关键创新在于将咨询决策建模为一个序列化资源分配问题：在工作流的关键节点上，ARIA 将执行过程中的证据映射为紧凑的状态抽象，并通过蒙特卡洛控制（Monte Carlo control）学习动作价值，动态选择“沉默”（SILENT）或“咨询”（CONSULT）。该方法通过惩罚咨询成本来优化策略，在 SWE-bench Verified、Terminal-Bench 2.1 以及 τ²-bench 等任务上实现了 44–81% 的成功率提升，且成本低于顾问模型原生使用成本的一半。相比十种其他策略（包括路由、级联、固定/提示式咨询及随机放置等），ARIA 在成功-成本权衡方面表现最优，且策略结构紧凑可解释，仅需单一咨询价格参数即可调节性能与成本平衡，无需重新训练底层模型。
链接: https://arxiv.org/abs/2610.13870
作者: Pascal Sowietzki,Steffen Holter,Yannick Metz,Emil Kasper,Raphael Baur,Mennatallah El-Assady
机构: ETH Zurich (苏黎世联邦理工学院); Mennatallah El-Assady; Steffen Holter; Yannick Metz; Emil Kasper; Raphael Baur
类目: Multiagent Systems (cs.MA)
备注:
Abstract:To balance task performance and computational cost, agentic workflows can use a lower-cost model for execution and selectively consult a stronger model. In such executor-advisor systems, the executor decides when to seek advice, making escalation depend on self-assessment, although current language models struggle to detect where their own reasoning fails. The need for stronger reasoning emerges during execution and varies across workflow phases. We introduce ARIA, a meta-controller that learns when to consult by balancing task success against consultation cost. Our approach formulates consultation as a sequential resource-allocation problem. At workflow contact points, ARIA maps execution evidence to a compact state abstraction and selects SILENT or CONSULT, with action values learned by Monte Carlo control from cost-penalized outcomes. Across evaluated tasks of SWE-bench Verified, Terminal-Bench 2.1, and \tau^2 -bench, ARIA recovers 44-81% of the executor-advisor success gap at less than half the advisor model’s cost. ARIA achieves the best observed success-cost trade-off among ten other evaluated conditions, including routing and cascading methods, fixed and prompted consultation, and random placement at matched advice volume. The policies are compact and inspectable, with a single consultation-price parameter governing the success-cost trade-off without retraining either underlying model.
[MA-1] MARGoS: A Configuration-Driven Platform for Reproducible MARL Experiments in ARGoS
【速读】：该论文旨在解决多智能体强化学习（MARL）在群体机器人研究中实验可复现性与可重用性不足的问题。当前基于ARGoS仿真器的MARL实验通常依赖手动拼接仿真文件、训练脚本、配置参数、路径设置、随机种子及环境细节，导致实验难以在团队内部甚至跨项目间实现稳定复现。为此，本文提出MARGoS——一个轻量级、以配置驱动的平台，将实验定义中的各项输入提升为平台级管理的一等资源。其核心解决方案在于通过配置哈希、端到端随机种子传播、冻结（不可变）配置、结构化日志、环境指纹识别以及可导出的实验包，实现实验全生命周期的可追溯与可复现。五维评估（架构、效率、可复现性、可用性与协作性）验证了将实验变异管理作为平台责任，显著提升了ARGoS+MARL实验的可重用性、可复现性与交接效率。
链接: https://arxiv.org/abs/2610.13772
作者: Tom Philipp Backert,Mohammad D. Soorati,Javad Ghofrani
机构: University of Lübeck (吕贝克大学); University of Southampton (南安普顿大学); Bonn-Rhein-Sieg University of Applied Sciences (波恩-莱茵-锡格应用科学大学)
类目: oftware Engineering (cs.SE); Multiagent Systems (cs.MA); Robotics (cs.RO)
备注: Submitted version (prior to peer review) of a paper published in the VARIABILITY 2026 Satellite Events proceedings (Project Showcase Track), LNCS 17104, Springer. 11 pages, 3 figures, 3 tables
Abstract:Multi-agent reinforcement learning (MARL) has become a prominent research direction, particularly within collective robotics, where the ARGoS simulator is widely used to study emergent swarm behavior. Yet despite this growth, systematic support for reuse and reproducibility in MARL-based swarm robotics remains limited and insufficiently standardized: a single experiment is assembled from manually aligned simulator files, training scripts, configuration values, paths, seeds, and environment details, so reuse and reproduction stay fragile even within one research group. To address this gap, we introduce MARGoS, a lightweight, configuration-driven platform developed in this project that elevates these experiment-defining inputs to first-class, platform-managed artifacts. MARGoS enables reproducible experimentation through configuration hashing, end-to-end seed propagation, frozen (immutable) configurations, structured logging, environment fingerprinting, and exportable experiment bundles that facilitate sharing, replay, and verification of results across machines and over time. A five-dimension evaluation (architecture, efficiency, reproducibility, usability, and collaboration) supports our claim that managing experiment variation as a platform responsibility makes ARGoS+MARL experiments easier to reuse, reproduce, and hand off. Our code is available at this https URL.
[MA-2] OpenSocialJax: Evaluating Social Adaptation in Sequential Social Dilemmas with Open-Ended Environmental Dynamics
【速读】：该论文旨在解决现有顺序社会困境基准测试中普遍缺乏对智能体通过反复交互推断隐藏环境规则并适应其他智能体行为能力的评估问题。其核心挑战在于如何在开放、动态且未知的环境配置下，检验智能体在复杂社会互动中发现隐含规则与协同适应的能力。解决方案的关键是提出OpenSocialJax，该框架通过在“Clean Up”和“Commons Harvest”任务基础上引入一个无限扩展的潜在环境配置分布，系统性地变化空间布局及工具制造、收益分配与资源动态等隐藏规则，每个实验周期从数千万种可能配置中采样一种并保持固定进行五次试验。通过评估八种大语言模型（包括三种闭源与五种开源模型），研究揭示：尽管规则发现能提升性能，但难以持续维持合作，因清洁负担集中于少数智能体，且所有团队最终均导致公共资源耗尽；在混合团队中，单一合作智能体虽可在OpenCleanup中牺牲自身收益维系公共利益，却无法阻止OpenHarvest中的资源枯竭。上述结果凸显了智能体在同时应对陌生环境动态与其他智能体行为演化时所面临的根本性挑战。
链接: https://arxiv.org/abs/2610.13710
作者: Zihao Guo,Meng Fang,Joel Z. Leibo,Yali Du
机构: King’s College London(国王学院); University of Liverpool(利物浦大学); The Alan Turing Institute(艾伦图灵研究所); Google DeepMind(谷歌深度求索)
类目: Multiagent Systems (cs.MA)
备注: 24 pages, including appendix
Abstract:Sequential social dilemma benchmarks capture diverse social interactions, but rarely test whether agents can infer hidden environmental rules through repeated interaction while adapting to other agents. We introduce \textbfOpenSocialJax, which extends Clean Up and Commons Harvest across an open-ended distribution of latent environment configurations, systematically varying spatial layouts and hidden rules governing tool crafting, payoffs, and resource dynamics. Each episode samples one configuration from tens of millions of possibilities and holds it fixed across five trials. We evaluate eight large language models, including three closed source models and five open source models. Our evaluation tests whether models can discover hidden rules and adapt to other agents in homogeneous and mixed teams. We find that rule discovery often improves performance but does not reliably sustain cooperation, as the cleaning burden becomes concentrated among fewer agents in OpenCleanup and every team eventually exhausts the shared resource in OpenHarvest. In our mixed arena, one cooperative agent was able to sustain the public good in OpenCleanup at a cost to its own return, but could not prevent resource depletion in OpenHarvest. Together, these results highlight the difficulty of adapting jointly to unfamiliar environmental dynamics and the changing behavior of other agents.
[MA-3] Cooperative Aerial Transportation of a Payload with a Sliding Cable Attachment
【速读】：该论文旨在解决非刚性连接负载在双无人机吊挂协同空中操作中因柔性绳索耦合效应导致的运动控制难题，特别是如何在满足绳索长度约束与椭圆工作空间限制的前提下，实现对负载姿态的精确跟踪与系统稳定控制。其解决方案的关键在于构建一个基于期望负载位姿、绳索分布状态及系统几何构型的可行参考生成框架，通过引入绳索分布变量（cable-distribution variable）以显式建模绳索滑动特性带来的动力学耦合关系，并确保绳索始终处于正张力状态；在此基础上，双无人机沿几何生成的轨迹进行跟踪控制，同时满足执行器物理极限，而负载位姿则通过系统几何信息实时估计，仅利用实测位置验证轨迹有效性，从而实现了高鲁棒性的协同运输控制。
链接: https://arxiv.org/abs/2610.13665
作者: Sebastian Tilaguy Lezama,Diego S D’Antonio
机构: Oakland University (奥克兰大学)
类目: Robotics (cs.RO); Multiagent Systems (cs.MA)
备注:
Abstract:This paper presents a dual-quadrotor hook- suspended transport system for cooperative aerial manipulation of a payload that is not rigidly attached to a fixed point along the cable. Two quadrotors are connected by a single inextensible cable that passes through a frictionless hook mounted on the payload, allowing the cable to slide between its two segments. This introduces a cable-distribution variable that couples the quadrotor motion, cable geometry, and payload dynamics. A feasible reference-generation framework is formulated using the desired payload pose, cable distribution, and system shape while satisfying the cable-length constraint and elliptical workspace. The quadrotors track the geometrically generated trajectories while maintaining positive cable tension and respecting actuator limits. The payload pose is estimated from the system geometry, and its measured position is used only to validate the desired trajectory. The approach is evaluated through experimental demonstrations.
[MA-4] A Multi-Agent LLM System for Automated Tuning of Specialized Neural Network Models
【速读】：该论文旨在解决机器学习中关键组件手动调优的瓶颈问题，尤其针对不同模型类型下组件配置的自动化优化难题。传统方法通常依赖专家在特定方法类别内手动选择并调整核心组件，效率低且难以泛化。本文提出的多智能体大语言模型（multi-agent large language model, LLM）框架通过引入“分析师（analyst）、编码员（coder）和记录者（recorder）”三类角色，并结合实验日志与沙箱执行环境，实现对特定组件的自动优化。其核心创新在于：在保持整体网络结构不变的前提下，仅在语义受限但开放的代码生成空间中对关键组件进行自动调整，避免了对整个模型架构或离散搜索空间的全局优化。该方法在两类异构任务中均取得显著性能提升——包括基于相关性学习的脉冲神经网络分类任务和基于物理信息神经网络（Physics-Informed Neural Networks, PINN）的高阶微分方程求解，覆盖MNIST、Digits图像分类及广义非线性薛定谔方程（GNLSE）和库拉莫-西瓦辛斯基（Kuramoto–Sivashinsky, KS）方程的边值问题。实验结果表明，该框架在分类准确率、解析解逼近误差、守恒量保持误差及质量漂移等指标上均显著优于基线方法，验证了其跨模型类型、无需修改内部结构即可高效调优关键组件的能力。
链接: https://arxiv.org/abs/2610.13663
作者: Ivan Moloshnikov,Dmitry Kunitsyn,Alexander Sboev,Maksim Skorokhodov,Roman Rybka,Yuanchao Liu
机构: National Research Centre “Kurchatov Institute”(国家研究核能中心“库尔恰托夫研究所”); National Research Nuclear University MEPhI(国家研究核大学MEPhI); Moscow Institute of Physics and Technology(莫斯科物理技术研究所); Harbin Institute of Technology(哈尔滨工业大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG); Multiagent Systems (cs.MA); Neural and Evolutionary Computing (cs.NE)
备注:
Abstract:Many machine learning approaches are two-level: an expert selects a class of methods, within this class the choice of key components is critical and usually manual. This paper addresses the automatic tuning of these components and proposes a framework transferable across models of different nature. The multi-agent large language model (LLM) framework has three roles—analyst, coder, and recorder~—with an experiment log and a sandboxed execution environment. Unlike systems that optimize the entire ML script or search architectures in a discrete space, the framework operates over an open but semantically narrow space: the agent generates code only for the specified components, leaving the overall network structure unchanged. The approach is validated in two directions: tuning a classification spiking neural network with correlation learning, and solving high-order differential equations with Physics-Informed Neural Networks (PINN). Across five tasks—spiking classification on MNIST and Digits, and boundary-value problems for the generalized nonlinear Schrödinger equation (GNLSE) and Kuramoto–Sivashinsky (KS) equations—the agent outperforms the baselines: classification accuracy is 13 percentage points (MNIST) and 6 percentage points (Digits) higher; the error against the analytical single-soliton solution is reduced approximately 2491-fold; the invariant-preservation error drops approximately 325-fold in the selected GNLSE run with a Gaussian perturbation and by more than 100-fold on average over repeated initializations; and the mass drift drops 14-fold for the KS problem with a Gaussian perturbation. The framework thus tunes key components on tasks of different nature without changing its internal structure.
[MA-5] Limit-sure Winning in Team Games without Shared Randomness
【速读】：该论文旨在解决在并发随机博弈（concurrent stochastic games）中，一组代理（agents）作为团队与对抗性环境交互时，如何在仅能访问各自独立随机源（individual sources of randomness）的现实约束下，实现给定可达性（reachability）或安全性（safety）目标的问题。传统研究常假设代理可共享随机源，从而将问题简化为双人博弈，但这一假设难以刻画真实系统中的分布式决策场景。本文的核心挑战在于：在无共享随机性的情况下，判断是否存在策略使得团队以任意接近1的概率满足目标（即“极限必然”（limit-sure）获胜）。对于可达性目标，论文证明该问题为 NP-完全；而对于安全性目标，发现极限必然获胜等价于几乎必然获胜（almost-sure winning），后者已被证明属于 P。上述结果进一步推导出对近期引入的个体随机化交替模态逻辑（Individually Randomised ATL）的定性片段进行模型检验的复杂度为 PNP-完全。解决方案的关键在于通过精细的博弈结构分析和复杂度归约，揭示在独立随机性约束下两类目标的可实现性与计算复杂性的本质差异。
链接: https://arxiv.org/abs/2610.13569
作者: Léonard Brice,Thomas A. Henzinger,Alipasha Montaseri,Ali Shafiee,K. S. Thejaswini
机构: Institute of Science and Technology Austria(奥地利科学技术研究所); École Polytechnique Fédérale de Lausanne(洛桑联邦理工学院); Université libre de Bruxelles(布鲁塞尔自由大学)
类目: Computer Science and Game Theory (cs.GT); Formal Languages and Automata Theory (cs.FL); Multiagent Systems (cs.MA)
备注: 31 pages, 6 figures. Full version with appendix
Abstract:We study concurrent stochastic games in which a team of agents plays against an adversarial environment. If the agents could access a shared source of randomness, then these games reduce to two-player games. Despite being common in the literature on coalition games, this assumption does not accurately model real-world systems. In this paper, we consider the setting where the agents only have access to individual sources of randomness, and must satisfy a given reachability or safety objective. The limit-sure problem asks whether the team can ensure that the objective is satisfied with probability at least 1-\lambda for every \lambda0 . For reachability objectives, we show that this problem is \mathsfNP -complete. For safety objectives, we show that limit-sure winning coincides with almost-sure winning, which is known to lie in \mathsfP . As a corollary of these results, we conclude that model checking of the qualitative fragment of the logic Individually Randomised ATL – introduced in the recent work of Brice et al. – is \mathsfP^\mathsfNP -complete.
[MA-6] Collective Autonomous Vehicle Routing Needs Social Awareness for Coexistence with Human Drivers
【速读】：该论文旨在解决在混合自主交通环境中，自动驾驶汽车（AV）仅基于自身利益进行路径选择时，可能对人类驾驶车辆（HDV）产生负面外部性的问题，即AV的自私路由行为会显著增加其他道路使用者的出行时间。其核心解决方案是将“边际成本”（marginal cost）这一社会性指标引入AV的奖励函数中，通过对比实际交通状况与移除某辆AV后的反事实仿真结果，量化该AV对其他交通参与者造成的出行时间影响。研究采用多智能体强化学习（MARL）框架，在德国英戈尔施塔特和法国普罗万斯的真实路网数据上验证了该方法的有效性：引入边际成本后，尽管AV自身出行时间有所优化，但对HDV造成的出行时间增加从1.7%降至1.1%，整体系统性能显著提升。此外，为提高可扩展性，研究提出仅对对交通系统影响较大的少数关键AV计算边际成本，大幅减少反事实仿真次数，在保持近似性能的同时显著降低计算开销。实验表明，当社会成分权重过重时系统性能反而下降，说明需在个体效率与社会福祉间取得平衡。研究结论强调，未来自动驾驶路径规划应超越纯粹的自私目标，纳入社会性考量以实现所有交通参与者的共同优化。
链接: https://arxiv.org/abs/2610.13439
作者: Anastasia Psarou,Mikolaj Rams,Blazej Torbus,Rafal Kucharski
机构: Jagiellonian University (亚捷隆大学); Kraków, Poland
类目: Multiagent Systems (cs.MA); Artificial Intelligence (cs.AI)
备注:
Abstract:Collective Autonomous Vehicle (AV) route choices in real-world traffic networks can create externalities for Human-Driven Vehicles (HDVs), as routes that benefit AVs may increase travel times for other road users. To address this, we introduce a social component, the marginal cost, to the selfish travel time AV reward. Marginal cost captures an AV’s impact on other road users by comparing their travel times with those in a counterfactual simulation in which the AV is removed. We study AV route choice in mixed-autonomy traffic settings using Multi-Agent Reinforcement Learning (MARL), where AVs learn routing policies through repeated interactions with the traffic environment. Experiments on the real-world networks of Ingolstadt and Provins show that incorporating marginal cost into the AV reward not only limits the increase in HDV travel times and shortens AV travel times relative to selfish AV routing, but also improves overall system performance. In Ingolstadt, selfish routing of 40% AVs increases the travel times of other vehicles by 1.7%, and this drops to 1.1% when the social reward is included. Interestingly, not only does overall system performance improve, but the AVs are also better off when acting this http URL effect is consistent across tested cities, penetration rates, and replications, yet when the weight of the social component in the reward increases, the system fails to reach the desired performance. For a more scalable approach to social AV routing in mixed-autonomy traffic, we compute the marginal cost only for the AVs whose route choices most affect the traffic system. This reduces the number of counterfactual simulations and achieves similar performance at a significantly lower computational cost. Our results suggest that AV routing should go beyond selfish rewards and, for the benefit of all traffic participants, include a social component in its objective. Subjects: Multiagent Systems (cs.MA); Artificial Intelligence (cs.AI) Cite as: arXiv:2610.13439 [cs.MA] (or arXiv:2610.13439v1 [cs.MA] for this version) https://doi.org/10.48550/arXiv.2610.13439 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[MA-7] When AI Advisors Agree: Distinguishing Forecast Risk from Forecast Reliability
【速读】：该论文旨在解决在多个生成式 AI (Generative AI) 预测模型给出一致预测时，这种一致性是否真正反映预测可靠性的问题。核心问题在于：当多个预测框架达成共识时，这种意见一致是源于共享的可靠信息，还是仅因某些资产本身更易预测而产生的表面一致性？研究通过分析 iPulse AI 系统中 232 个资产在四个生产批次中的 928 项第一季度预测数据，将十个历史 Gemini 配置归类为七个投资框架，并对比其历史预测与实际市场表现。关键发现表明，尽管高分歧度与更高的平均绝对收益误差相关（从最低分歧四分位的 10.31% 上升至最高分歧四分位的 21.05%），但对“价格不变”的预测同样表现出类似误差增长趋势（从 9.89% 上升至 21.15%），且在控制可见资产风险后，该关系仍无法解释。进一步发现，保留历史波动率最低的季度预测可获得更低误差（7.97%），优于保留分歧最小的预测（10.31%）。此外，方向一致性具有双重效应：当至少六名框架预测同向时，方向准确性提升，但回报幅度误差反而增大。因此，研究揭示了三个常被混淆的独立维度：资产风险水平、框架间方向共识度、以及回报预测精度。对于该历史决策委员会而言，一致性仅在特定情境下具有信息价值，不能作为预测可靠性的通用指标。
链接: https://arxiv.org/abs/2610.13431
作者: Russlan Ramdowar
机构: Future Edge Group FZE(未来边缘集团); iPulse AI; ORCID(开放研究者与贡献者身份识别码)
类目: Multiagent Systems (cs.MA)
备注: 16 pages, 8 figures, 5 tables. Research artifacts: this https URL . Code and documentation: this https URL
Abstract:If seven AI advisors give similar forecasts, should we trust them more? Agreement can indicate useful shared evidence, but it can also reflect an asset that was easier to forecast in the first place. We examine this distinction using 928 completed first-quarter forecasts for 232 assets across four production batches of iPulse AI. Ten historical Gemini configurations are grouped into seven investment frameworks; their archived forecasts are compared with later market outcomes, without generating new reports. Mean absolute return error rises from 10.31 percentage points in the lowest-disagreement quartile to 21.05 in the highest. Yet a forecast of no price change shows almost the same increase, from 9.89 to 21.15. The relationship between disagreement and additional forecast error is not resolved after accounting for visible asset risk. Retaining the quarter of forecasts with lowest historical volatility produces lower error than retaining those with least disagreement: 7.97 versus 10.31 percentage points. Agreement about direction behaves differently. When at least six of seven frameworks share a direction, directional accuracy is higher, but return-magnitude error is also larger. These results distinguish three questions often collapsed into one confidence score: how risky the asset is, whether advisors agree on its direction, and how precisely they forecast its return. For this historical council, agreement is informative in specific ways; it is not a general certificate of forecast reliability.
[MA-8] JANUS: Enhancing Long-Horizon Autonomous Research with Co-Evolving World Models
【速读】：该论文旨在解决长时程自主科研中因“生成-执行-反馈”范式依赖被动试错而导致的反馈延迟问题，尤其是在搜索空间呈指数级扩张背景下，昂贵且耗时的执行过程严重制约了科研演进效率。其核心解决方案是提出JANUS框架，通过一个由协同进化世界模型驱动的“预测-验证-演化”循环，统一未来结果预测与过往经验反思。该框架在动态演化的图结构中，使研究智能体在执行前基于世界模型对候选方案进行价值提升、信息增益与探索效用的前瞻性评估，进而实现候选分支的选择、优化或剪枝；执行后则通过提炼真实反馈，持续演化出三类能力：研究智能体的分层研究技能、世界模型的探索策略技能及其协同协议。这一机制实现了研究智能体与世界模型的持续协同进化，显著提升了候选生成质量与长期预测准确性。实验证明，JANUS在MLS-Bench-Lite及真实科研任务上均显著优于现有最优基准，展现出更高的演化效率与性能上限。
链接: https://arxiv.org/abs/2610.13194
作者: Mengdi Liu,Chenghao Jia,Hong Chang,Mingjie He,Shiguang Shan,Xilin Chen
机构: State Key Laboratory of AI Safety, Institute of Computing Technology, CAS(中国科学院计算技术研究所人工智能安全国家重点实验室); University of Chinese Academy of Sciences (CAS)(中国科学院大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Multiagent Systems (cs.MA)
备注:
Abstract:Long-horizon autonomous research has shown promise in accelerating scientific progress through sustained cycles of hypothesis generation, implementation, and validation. However, this Generate-Execute-Feedback paradigm relies on reactive trial-and-error, where costly and time-consuming executions introduce severe feedback delays, throttling evolutionary progress under explosively expanding search space. To address this challenge, we propose JANUS, a framework that unifies future outcomes forecasting and past experience reflection through a Predict-Verify-Evolve loop driven by a co-evolving world model. Within an evolving graph, the research agent proposes candidates while world model scores them by forecasting value improvement, information gain, and exploration utility, then accordingly selects, refines, or prunes branches prior to execution. After receiving ground-truth feedback, JANUS distills experience into evolving skills: hierarchical skills for research agent, exploration-strategy skills for world model, and their coordination protocols. This mechanism enables continual co-evolution: the research agent sharpens candidate generation while the world model refines its predictive judgment over extended horizons. Extensive evaluations on MLS-Bench-Lite and real research tasks demonstrate that JANUS significantly outperforms state-of-the-art baselines, achieving both higher evolving efficiency and ceiling.
[MA-9] he Limits of Manipulation within Personalized Incentive Policies
【速读】：该论文旨在解决个性化激励政策在需求管理中因用户策略性操纵行为而导致的实效性下降问题。现有研究通常假设监管者能即时准确识别个体用户特征，从而实施精准补贴，但忽略了用户可能通过伪装成其他类型用户以获取更高激励的动机。本文的关键贡献在于：首次将监管者的用户画像学习过程建模为基于历史行为的动态推断机制，而非瞬时分类，由此引入“操纵成本”（Cost of Manipulation）这一关键因素——即用户为维持虚假身份必须持续违背自身真实偏好，造成效用损失。这一成本显著抑制了操纵行为的收益。研究发现，尽管分类不确定性会降低个性化精度，却可通过增加操纵难度而反向提升监管者利益，形成对操纵的有效威慑。论文进一步给出了操纵收益的上界，并证明当不同用户群体越难以区分时，该上界越紧，威慑效应越强。基于伦敦乘客出行方式选择数据集的仿真验证了该机制的有效性，表明该框架可作为部署前评估个性化激励政策鲁棒性的有力工具。
链接: https://arxiv.org/abs/2610.13133
作者: Andrea Araldo,Alessa Mayer,Ravi Seshadri,Amir Brudner
机构: 未知
类目: Multiagent Systems (cs.MA)
备注:
Abstract:Demand management policies aim to shift individual behavior toward sustainable choices (e.g., goods, transport modes). Personalized incentive policies tailor subsidies to agents’ needs and constraints, but personalization also exposes the regulator to agents’ strategic manipulative behavior. The extent to which agents can profitably manipulate such policies remains poorly understood, which limits their applicability. This paper establishes analytically the conditions under which manipulation benefits the agent. We formalize a Stackelberg game in which an agent may simulate a different profile to extract higher incentives from a regulator. Previous work typically assumes that the regulator would instantaneously classify agents into the simulated user profile. In contrast, we explicitly model the regulator’s process of learning the agent profile, based on observed past behavior. This makes manipulation harder, since it forces the agent to consistently behave according to a simulated profile, thus renouncing following their true preferences. Manipulative agents thus incur a Cost of Manipulation, which has typically been neglected. By accounting for it, we get a counterintuitive finding: although classification uncertainty reduces personalization accuracy, it may benefit the regulator by deterring manipulation. We establish an upper bound on the agent’s gain from manipulation, which becomes stricter as profiles become harder to distinguish for the regulator. Simulations on the London Passenger Mode Choice dataset illustrate this deterrence effect. The framework can therefore be used to stress-test the robustness of personalized incentive policies before deployment. Subjects: Multiagent Systems (cs.MA) MSC classes: 91A65, 91A26 ACMclasses: I.2.11; J.4 Cite as: arXiv:2610.13133 [cs.MA] (or arXiv:2610.13133v1 [cs.MA] for this version) https://doi.org/10.48550/arXiv.2610.13133 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[MA-10] he value of information and the emergence of communication in evolved e-puck robots
【速读】：该论文旨在探究自主智能体之间通信机制的涌现条件，以及先天动作选择架构（Embedded Action Selection Architecture, EASA）在其中所起的作用。研究的核心问题是：在缺乏外部引导的情况下，智能体何时会演化出通信行为？其解决方案的关键在于通过模拟两台基于PyBullet重构的e-puck机器人在不同环境规模下的协作任务，考察通信信号（一比特信号）的使用策略如何随环境复杂度和信息可用性而变化。实验表明，当存在指向食物的罗盘信息时，通信行为完全消失；而在无罗盘条件下，小规模环境中多种策略（指称信号、持续信标或不通信）均能实现相近性能，但随着环境扩大，基于指称信号的策略表现出最优泛化能力。相比之下，在大环境中直接演化并未提高通信频率，但使策略分化明显，且指称信号显著优于孤立搜索。此外，在EASA框架下，先天反射机制虽对单体任务有帮助，但在社会协作中反而成为障碍，进化过程始终倾向于削弱这些固有约束。因此，研究揭示了通信的出现与信息价值正相关，且为孤立个体设计的先天结构可能阻碍群体协作中的通信演化。
链接: https://arxiv.org/abs/2610.13118
作者: Fernando Montes-Gonzalez
机构: 未知
类目: Robotics (cs.RO); Multiagent Systems (cs.MA); Neural and Evolutionary Computing (cs.NE)
备注: 21 pages, 7 figures, 5 tables. Code and data: this https URL (archived at this https URL )
Abstract:We study when communication emerges between autonomous agents and what role an innate action selection architecture plays. Two e-puck robots, reconstructed in PyBullet from their Webots model and validated against it, must find a feeding zone that can only be detected when a robot passes over it. Each robot can emit a one-bit signal whose direction is detected by the receiver. Control is provided by a GRU recurrent network with a residual path, either operating alone or as a channel within an Embedded Action Selection Architecture (EASA). Fitness measures only the time the robots spend over the food. When the robots receive a compass pointing to the food, use of the signal disappears completely. Without a compass, in a small arena, three independent runs achieved similar performance using different strategies: a referential signal, a permanent beacon, or no use of the signal. As the arena expands, the strategy based on a referential signal generalizes best. In contrast, evolving directly in the large arena does not increase the frequency of communication, but it does separate the strategies, and the referential signal clearly outperforms solitary searching. Within EASA, innate reflexes constrain the network and reduce performance. As its priorities evolve, evolution consistently weakens those reflexes. The results suggest that communication emerges in proportion to the value of the information it transmits, and that an innate scaffolding designed for isolated agents can be an impediment in a social task.
[MA-11] Failure-Resilient Multi-Robot Coordination with k-Connectivity Constrained Submodular Maximization
【速读】：该论文旨在解决多机器人系统在执行协同任务（如目标跟踪、信息采集等）时，因部分机器人失效或被移除而导致通信网络断裂，进而影响团队持续协调能力的问题。传统基于可扩展性最大化（submodular maximization）的方法虽能优化团队性能与容错性，但普遍忽略机器人损失对通信连通性的负面影响。为此，论文提出“鲁棒k-连通可扩展性最大化”（Resilient k-Connected Submodular Maximization）框架，同时兼顾任务性能、系统容错性与通信连通性。其核心挑战在于，所定义的可行解集不再构成拟阵（matroid），导致无法直接应用经典曲率-贪心算法的性能保证。解决方案的关键在于：引入基于Menger定理的连通性降维方法，设计一种具有可行性保障的连通性感知贪心算法，并提出一种新的曲率分析框架，通过单一因子ρ刻画强制连通性带来的代价。该方法在最坏情况下仍能保证失败后的目标函数值不低于最优连通性约束鲁棒分配的 [max(1−νf(I),h(N,β))]2ρκf1(1−e−κf) 倍，且在适当极限条件下可退化为经典无约束情况下的最优保证。实验结果验证了该方法在多机器人目标跟踪任务中的有效性，并揭示了连通性约束的实际影响。
链接: https://arxiv.org/abs/2610.13049
作者: Yoonjae Hwang,Hojune Kim,Ellen Novoseller,Guangyao Shi,Gaurav S. Sukhatme
机构: University of Southern California(南加州大学); U.S. Army DEVCOM Army Research Laboratory(美国陆军研发与概念办公室陆军研究实验室)
类目: Robotics (cs.RO); Multiagent Systems (cs.MA)
备注:
Abstract:Multi-robot coordination is essential in applications such as coverage, target tracking, and information gathering, where robots must jointly select actions to maximize team performance. Submodular maximization provides an effective framework for such coordination, and resilient variants further account for robot failures or adversarial removals. However, existing methods typically overlook the impact of robot loss on the communication network, which may disconnect the surviving team and prevent continued coordination. To address this issue, we introduce Resilient k -Connected Submodular Maximization, which jointly considers task performance, resilience, and communication connectivity. The resulting feasible family is not a matroid, preventing the direct application of classical curvature-greedy guarantees. We overcome this challenge through a Menger-based connectivity reduction, a connectivity-aware greedy algorithm with a feasibility-preserving fallback, and a new curvature-based analysis that captures the cost of enforcing connectivity through a single factor \rho . Our method achieves a worst-case post-failure objective within a factor of [\max(1-\nu_f(\mathcalI),h(N,\beta))]^2 \rho \frac1\kappa_f(1-e^-\kappa_f) of the optimal connectivity-respecting resilient assignment, while recovering the classical unconstrained guarantee in the appropriate limits. Experiments on multi-robot target tracking validate the proposed method and characterize the practical impact of connectivity constraints.
[MA-12] SwingGuard: Risk-Conditioned Multi-Agent Swing Trading with Dual-Timescale Governance
【速读】：该论文旨在解决加密货币波段交易中因时间尺度不匹配而导致的风险管理滞后问题：即交易策略在较长时间尺度上生成，而市场与事件风险却在数分钟内快速变化，现有基于预测模型或大语言模型（LLM）的交易系统通常在策略生成后才评估风险，或以相同频率同时执行策略生成与风险评估，导致策略未充分考虑实时风险，且在策略修订间隙对持仓的风险管控薄弱。其解决方案的关键在于提出SwingGuard——一种双时间尺度、仅做多的多智能体框架，通过分层协同机制实现风险条件下的策略生成与持续治理。在策略时间尺度上，专业分析智能体通过多源异构数据（技术指标、情绪、链上、宏观经济）进行多空博弈式推理，形成时点证据；再由投资组合架构师结合当前风险情境生成目标仓位。在治理时间尺度上，每5分钟运行一次的风险控制器（Risk Controller）执行条件诊断，维持分阶段恢复的持久化风险状态，审计策略提案并约束执行直至下一次策略更新。该设计使风险在策略最终确定前即成为可行性的核心约束，并在持仓期间持续施加动态治理。实证结果表明，针对比特币（BTC）和以太坊（ETH）的回测显示，SwingGuard在扣除交易成本后仍保持正收益，且回撤浅、风险调整后绩效优异；联合组合暴露受限版本的夏普比率达2.98，优于无事前风险调节的对照组（Post-hoc Risk）的2.79。结构化追踪进一步揭示了风险证据与状态转移如何映射至策略约束与实际仓位变动，构建了可审计的异步加密货币波段交易框架。总体而言，将策略形成过程与实时风险状态耦合，并辅以高频持续治理，可在不牺牲可审计性前提下显著提升风险调整后收益表现。
链接: https://arxiv.org/abs/2610.12988
作者: Junzhou Su,Yichen Luo,Yebo Feng,Teng Li,Jiahua Xu
机构: 未知
类目: Multiagent Systems (cs.MA)
备注: 9 pages, 4 figures
Abstract:Cryptocurrency swing trading spans mismatched timescales: positions remain active while market and event risk can change within minutes. However, many predictive and large language model (LLM)-based trading systems assess risk after strategy generation or run both functions at the same cadence, leaving proposals unconditioned by current risk and exposure weakly governed between revisions. We propose SwingGuard, a dual-timescale, long-only multi-agent framework for risk-conditioned strategy generation. At the strategy timescale, specialized analysts synthesize point-in-time technical, sentiment, on-chain, and macroeconomic evidence through bullish-bearish deliberation. The resulting evidence and current risk context are then combined by a Portfolio Architect to form a target position. At the governance timescale, a five-minute Risk Controller performs conditional diagnosis, maintains persistent risk states with staged recovery, audits the proposal, and constrains execution until the next strategy revision. This design allows risk to shape the feasible strategy before proposal finalization while continuing to govern the active position afterward. Evaluations on Bitcoin (BTC) and Ether (ETH) show that SwingGuard preserves positive returns after transaction costs while maintaining shallow drawdowns and strong risk-adjusted performance on both assets. The exposure-capped joint portfolio achieves a Sharpe ratio of 2.98, compared with 2.79 for an otherwise identical Post-hoc Risk variant. Structured traces further link risk evidence and state transitions to strategy constraints and executed position changes, providing an auditable framework for asynchronous cryptocurrency swing trading. Overall, the results indicate that conditioning strategy formation on current risk, together with persistent high-frequency governance, improves risk-adjusted performance without sacrificing auditability.
[MA-13] Reward Hacking as a Transmissible Strategy in Multi-Agent Coding Systems
【速读】：该论文旨在解决多智能体系统（multi-agent systems）在代码生成任务中因强化学习（Reinforcement Learning, RL）优化而引发的“奖励黑客”（reward hacking）问题，特别是揭示了此类策略在多个智能体之间传播并影响系统协同的机制。其核心挑战在于：传统研究将奖励黑客视为单智能体层面的失效行为，但本文发现，一个智能体产生的奖励黑客策略可通过共享代码、共享内存及自然语言规划等途径，在多智能体协作中跨角色、跨模型传播，并在复杂任务中被持续放大，甚至在原始来源退出后仍能通过不断生成更具说服力的解释而增强其影响力。解决方案的关键在于识别并阻断这一传播路径，具体包括引入代码审查机制——由原始编码者或独立验证者进行审查，二者均有效降低了最终交付的恶意策略比例。研究还从理论上分析了奖励黑客在智能体交互中放大、持续或衰减的条件，强调了其作为可传播策略的系统性风险。
链接: https://arxiv.org/abs/2610.12822
作者: Yuepeng Hu,Pegah Ghahremani,Reza Aghajani,Mahesh Pasupuleti,Himaghna Bhattacharjee
机构: Meta Superintelligence Labs(Meta超智能实验室); Duke University(杜克大学)
类目: Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR); Multiagent Systems (cs.MA)
备注:
Abstract:Multi-agent systems are increasingly used to solve coding tasks by coordinating agents that share code and plans. These agents are often optimized with reinforcement learning (RL) using automated evaluators, but bypassing evaluation can earn reward without producing a genuine solution. Prior work has largely treated reward hacking as a single-agent failure. In this work, we show that a reward-hacking strategy elicited in one agent can propagate to others and affect system coordination. Across four open-weight backbones, coding RL elicits and amplifies reward hacking in two settings: explicit mechanism descriptions in the system prompt and mid-training that models upstream exposure to facts about the coding environment. Using post-RL agents from the mid-training setting as sources, we observe propagation through code and shared memory, and across roles through natural-language plans. Even agents based on small open-weight models induce reward hacking in stronger closed-weight targets. On hard tasks, propagation can intensify along a transmission chain after the original source leaves as the code acquires more persuasive justifications. We also theoretically analyze conditions under which reward hacking amplifies, persists, or decays across agent interactions. Beyond propagation, reward hacking can bias task routing toward reward-hacking agents and survive candidate aggregation. As potential mitigations, we evaluate code review by the coder or a separate verifier, both of which reduce delivered hacks. Together, these results establish reward hacking as a transmissible strategy whose effects extend beyond the agent in which it first emerges.
[MA-14] How Do Hardware Faults Manifest Differently in LLM Agents ? NEURIPS2026
【速读】：该论文旨在解决大语言模型（Large Language Model, LLM）代理在随机硬件故障下的鲁棒性问题。现有研究多关注模型层面的故障表现，如输出错误或生成失败，但未充分考虑代理在与工具和环境反复交互过程中形成的执行循环如何改变故障的呈现方式。本文首次系统性地评估了三种代理基准测试中的故障韧性，共执行6,814次代理任务（含2,400余次正常运行和4,300余次注入随机两位权重故障的故障运行），通过追踪故障在代理执行过程中的传播路径，发现：（1）代理能够从受损的模型输出中恢复并正确完成任务；（2）这种恢复机制显著增加了计算与执行开销；（3）少数故障会引发细微但具有语义意义的错误，而代理整体行为看似正常；（4）在某些模型和场景下，故障甚至可能改变系统的安全性和对齐行为。其解决方案的关键在于揭示了代理执行过程中的动态反馈机制将模型级故障转化为系统级复杂行为，强调需从系统层面重新审视硬件故障对智能代理的影响。
链接: https://arxiv.org/abs/2610.12756
作者: Aiden Rubey,Zachary Coalson,Cong Chen,Jean-Philippe Monteuuis,Jonathan Petit,Sanghyun Hong
机构: Oregon State University (俄勒冈州立大学); Qualcomm Inc. (高通公司)
类目: Multiagent Systems (cs.MA)
备注: Accepted to NeurIPS 2026 MLforSystems and AI4Good Workshops; The first two authors contributed equally
Abstract:We present the first systematic study of the resilience of large language model (LLM) agents to random hardware-induced faults. Prior work on hardware fault resilience in LLMs focuses on model-level outcomes, such as incorrect outputs or generation failures. Yet LLM agents repeatedly interact with tools and environments, creating loops that can change how hardware faults manifest. We conduct an extensive evaluation across three agent benchmarks, comprising 6,814 agent executions: 2,400+ clean runs and 4,300+ fault-injected runs with independently sampled random two-bit weight faults. We trace how these faults propagate through agent execution. Unlike prior studies, we find that agentic execution transforms model-level corruption into distinct system-level outcomes: (1) agents can recover from faulty model outputs and still complete tasks correctly; (2) this recovery increases computational and execution costs; (3) a few faults cause subtle but semantically meaningful errors while the agent otherwise behaves normally; and (4) for some models and scenarios, faults can alter security and alignment behavior.
[MA-15] Robust and Scalable UAV-UGV Planning for Aerial Monitoring under Energy and Precedence Constraints
【速读】：该论文旨在解决多无人机-无人车（UAV-UGV）协同执行具有访问顺序约束的空中监测任务时的联合路径与时间规划问题。核心挑战在于：在满足无人机（UAV）续航能力限制、监测点访问顺序约束以及执行过程中可能存在的旅行时间扰动的前提下，最小化任务完成时间。传统方法通常将路径规划与时间调度分离，难以有效处理顺序约束带来的动态调整需求。本文提出的解决方案关键在于：将车辆路径与时间安排进行联合优化，允许各UAV-UGV团队通过主动减速来满足访问顺序要求，从而在保证可行性的同时提升整体任务效率。为此，作者设计了一种多项式时间算法，能够高效求解原本为NP-hard的规划问题，并提供了可行性保障、计算复杂度分析及数值实验验证，证明了其在实际应用中的有效性与鲁棒性。
链接: https://arxiv.org/abs/2610.12670
作者: Cahit Ikbal Er,Yasin Yazicioglu
机构: Northeastern University (东北大学)
类目: Robotics (cs.RO); Multiagent Systems (cs.MA); Systems and Control (eess.SY)
备注:
Abstract:We consider planning for unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) teams in aerial monitoring missions with ordering requirements on the monitoring points to be visited by the UAV. The system consists of multiple UAV-UGV teams, each comprising one UAV and one UGV. UAV energy limitations are modeled through endurance, defined as the maximum flight time on a full battery. The UGVs serve as mobile charging stations and transport the UAVs between consecutive aerial tours. Given a set of monitoring points subject to ordering constraints and the teams’ initial and terminal positions, the objective is to minimize mission completion time while satisfying UAV energy limits and the required visit order under bounded travel-time disturbances that may arise during execution. Unlike prior work, the plan jointly determines vehicle routes and their timing, allowing teams to slow down as needed to satisfy the ordering constraints. We develop a polynomial-time algorithm that generates efficient solutions to the underlying NP-hard planning problem. We establish feasibility guarantees, characterize the algorithm’s computational complexity, and evaluate its performance via numerical comparisons.
[MA-16] Distributed Harmonic-Covariance Feedback for Hole Closure in Planar Robot Swarms
【速读】：该论文旨在解决平面多智能体系统中由传感盘构成时变Čech复形所形成的拓扑空洞（hole）的闭环闭合问题。其核心挑战在于如何在分布式环境下，仅依赖局部信息实现对全局拓扑空洞的检测与协同收敛控制。解决方案的关键在于提出一种基于调和协方差（harmonic-covariance）的反馈机制：利用调和边信号（harmonic edge signals）作为空洞的指示量，将其映射为智能体间的控制力；并通过有限度多项式形式的正则化霍奇拉普拉斯算子（regularized Hodge Laplacian）实现分布式计算，该多项式通过局部算子迭代完成评估，保证了算法的可实施性。在假设空洞面积可测且有界、空洞连续演化不发生分裂或合并、且仅有有限个临时空洞出现的前提下，系统闭环具有从任意安全初始状态出发的唯一全局轨迹。进一步地，通过离线有限计算可获得时间区间上累积空洞面积的有理数下界，且该下界在时间趋于无穷时收敛于真实累积面积（无论其是否有限）。当累积面积有限时，空洞在时间平均意义下趋于闭合——即任意固定长度时间窗内的平均归一化空洞面积随时间趋于零。数值仿真表明，在15秒内所有空洞于9.9秒时完全闭合并保持关闭状态。
链接: https://arxiv.org/abs/2610.12637
作者: Jitian Liu,Subhrajit Bhattacharya
机构: Lehigh University (莱希大学)
类目: Robotics (cs.RO); Multiagent Systems (cs.MA); Systems and Control (eess.SY)
备注:
Abstract:We consider hole closure in a planar multi-agent system whose sensing disks form a time-varying Čech complex. We propose a harmonic-covariance feedback that uses harmonic edge signals to locate holes and converts those signals into agent forces. For distributed evaluation, we use a fixed-degree polynomial of the regularized Hodge Laplacian. This polynomial is evaluated through local operator applications. The closed loop has a unique global trajectory from every safe initial state. The model data and initial state are supplied with procedures for approximation to any requested accuracy with explicit error bounds. We assume that hole area is measurable and bounded, holes evolve continuously without splitting or merging, and only finitely many temporary new holes appear. Under these conditions, offline finite calculations produce rational lower bounds for the cumulative hole area on the time horizon without querying trajectory data. These bounds converge to that cumulative area, whether finite or infinite. If it is finite, holes close in the time-averaged sense: the average normalized hole area over every fixed-length time window tends to zero as time tends to infinity. In a 15-second numerical demo, all holes close by 9.9s and remain closed through the end.
[MA-17] SoftwareGym: Scaling Computer-Use Agent Training with Diverse Synthesized Software Environments
【速读】：该论文旨在解决生成式计算机使用代理（Computer-use Agents, CUAs）在训练过程中面临的软件环境多样性不足与可靠性难以保障的问题。当前主流的原生应用环境构建成本高、覆盖范围有限，易导致模型过拟合于特定应用；而基于浏览器的环境则受限于交互深度与工作流复杂性，难以支持复杂任务的模拟。为此，本文提出SoftwareGym，一个自动化合成具有多样化图形用户界面（GUI）、可执行功能及运行时行为验证能力的软件环境的流水线。其核心创新在于：通过生成结构多样化的应用设计，将其转化为可运行的应用程序，并结合基于GUI的评估与迭代修复机制，确保生成环境的功能可靠性。实验表明，利用SoftwareGym合成的182个跨12类应用构建了SoftwareGym-Bench基准测试集（包含120项任务），所收集的轨迹显著提升了CUA性能，在严格跨域的OSWorld基准上Pass@3从41.39%提升至56.97%，并在自身基准上达到40.0%的通过率，验证了合成软件环境作为可扩展、可迁移监督信号在CUA训练中的巨大潜力。
链接: https://arxiv.org/abs/2610.12611
作者: Tian Jin,Wenhao Wang,Jing Kang,Haoting Shi,Rui Ye,Yijun Lu,Siheng Chen
机构: Shanghai Jiaotong University (上海交通大学); Zhejiang University (浙江大学)
类目: Multiagent Systems (cs.MA); Software Engineering (cs.SE)
备注: 26 pages, 11 figures, including appendices
Abstract:Computer-use agents (CUAs) are rapidly improving, yet synthesizing diverse and reliable software environments at scale remains challenging. Native application environments require substantial construction and integration effort, which limits application coverage and increases the risk of application-specific overfitting. Browser-hosted environments provide limited interaction depth and workflow complexity. These limitations motivate SoftwareGym, an automated pipeline for synthesizing GUI software environments with diverse interfaces, executable functionality, and runtime-verified behavior. It generates structurally diverse designs, realizes them as runnable applications, and uses GUI evaluation with iterative repair to ensure functional reliability. Using SoftwareGym, we synthesize 182 applications across twelve categories and achieve a mean GUI task pass rate of 91.5%. We construct SoftwareGym-Bench, a 120-task evaluation suite spanning the same twelve categories, and use trajectories collected from these environments for CUA training. The resulting model improves Pass@3 from 41.39% to 56.97% on the strictly out-of-domain OSWorld benchmark and achieves 40.0% on SoftwareGym-Bench. These results demonstrate the potential of synthesized software environments as scalable and transferable supervision for CUA training.
[MA-18] Know What You Dont Know: Agent ic Data Synthesis by Evolving Generation Space for Closed-Loop Learning
【速读】：该论文旨在解决生成式交互代理（interactive agents）在数据合成过程中存在的反馈-决策鸿沟问题：尽管现有方法已引入环境反馈、数据验证或学习者失败信息，但这些观测到的弱点无法直接指导未来合成策略的调整，也无法判断其是否可被当前合成空间有效表达。为此，论文提出EvoSyn——一种基于学习反馈驱动的多智能体框架，其核心在于构建一个可修订的状态（revisable state），明确标识出可主动生成的交互因素及合成资源的分配位置。通过角色专业化多智能体系统，将学习者反馈转化为合成策略的迭代修正；由Designer负责规划合成方向，Planner将其转化为可执行的经验。该机制实现了合成空间内部对薄弱或覆盖不足区域的自适应调整，以及合成空间的动态扩展，使新发现的关键因素能够被纳入显式生成控制。实验结果表明，在τ²-Bench和CAR-Bench基准上，EvoSyn相较于最强合成基线平均任务成功率提升13.3分，生成的合成数据质量更高、结构更丰富，并能发现未依赖学习反馈时遗漏的可控因素。
链接: https://arxiv.org/abs/2610.12593
作者: Wei Yang,Qing Ping,Youzhi Luo,Yawei Wang,Abhishek Kumar,Panpan Xu,Jun Huan
机构: University of Southern California (南加州大学); AWS AI
类目: Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA)
备注:
Abstract:The continued improvement of large language models increasingly depends on synthetic experience, yet effective data synthesis for interactive agents requires not only executable and verifiable trajectories, but also interactions that provide learning value for the current task agent. Existing methods increasingly incorporate environment feedback, data validation, or learner failures, but still face a feedback-to-decision gap: observed weaknesses do not directly specify how future synthesis should change, or whether they can be represented by the current synthesis space. To address this gap, we propose EvoSyn, a learning-feedback-driven multi-agent framework that organizes synthesis around a revisable state specifying what interaction factors can be deliberately generated and where synthesis effort should be allocated. A role-specialized multi-agent system translates learner feedback into synthesis revisions, while a Designer allocates synthesis directions and a Planner grounds them into executable experience. This process enables within-space adaptation toward weak or under-covered regions and synthesis-space expansion that promotes newly discovered factors into explicit generation controls. Experiments on \tau^2 -Bench and CAR-Bench show that EvoSyn improves average task success by 13.3 points over the strongest synthesis baseline, while producing higher-quality and structurally broader synthetic experience and discovering controllable factors missed without learner feedback.
自然语言处理
[NLP-0] RSI-Anything: Unlocking Recursive Self-Improvement with World Models
【速读】： 该论文旨在解决递归自我改进（Recursive Self-Improvement, RSI）中因外部反馈成本高以及策略演化导致世界模型预测可靠性下降所引发的瓶颈问题。其核心解决方案在于提出一种通用领域框架RSI-Anything，该框架基于JEPA-Anything构建，利用预测性世界模型指导行动决策与学习数据选择，通过观测反馈驱动策略或工作流优化，并实现条件化的世界模型自适应调整；同时，组件与兼容性检查机制确保更新后的策略-模型对得以有效保留。实验表明，在代码修复、图形用户界面任务、实验室规划及反应优化等多个领域，该方法均显著提升性能，验证了预测性世界模型与系统持续更新相结合在实现跨环境递归改进中的有效性。
链接: https://arxiv.org/abs/2610.13912
作者: Taoyong Cui,Pinxian Zeng,Wanghan Xu,Hao Xiao,Shuhan Xue,Qiang Gao,Wanli Ouyang,Pheng Ann Heng,Zhenfei Yin,Yingcheng Wu,Ling Yang
机构: University of Science and Technology of China (中国科学技术大学); Chinese Academy of Sciences (中国科学院); Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences (中国科学院深圳先进技术研究院); Tsinghua University (清华大学); The University of Hong Kong (香港大学); Zhejiang University (浙江大学); Fudan University (复旦大学); Shanghai Jiao Tong University (上海交通大学)
类目: Computation and Language (cs.CL)
备注: Code: this https URL
Abstract:Recursive self-improvement (RSI) aims to transform interaction experience into persistent improvements, yet external feedback is costly and world-model predictions may become unreliable as policies evolve. We introduce RSI-Anything, a domain-general framework built on JEPA-Anything that uses predictive world models to guide action and learning-data selection. Observed feedback drives policy or workflow improvement and conditional world-model adaptation, while component and compatibility checks govern the retention of updated policy-model pairs. Across diverse computational and scientific domains, RSI-Anything demonstrates substantial gains. In code repair, with the coder fixed, success increases from 26.3% with a static verifier to 29.2% through predictive selection and 31.2% after world-model adaptation, at comparable test usage. Graphical user interface (GUI) evaluations showed higher task completion, while average actions decrease by 39.4%. Across five successive policy versions, laboratory-planning scores more than double from 21.80% to 46.01%. In reaction optimization, RSI-Anything achieves 96.15% mean best observed yield versus 82.16% for Bayesian optimization under the same 40-experiment budget. An end-to-end immune-science application further connects workflow evolution and predictive modeling with therapeutic hypothesis generation. These results demonstrate how predictive world models and retained system updates enable recursive improvement across diverse environments.
[NLP-1] When VLMs Destroy What They Know: Spatial Representations Fall Below Lexical Priors
【速读】： 该论文旨在解决当前视觉-语言模型（Vision-Language Models, VLMs）在图像理解与推理过程中，其内部表征是否真实编码了支持复杂推理所需的结构化关系这一关键问题。尽管现有模型在组合性基准测试中表现良好，但其对空间关系等结构性语义的表征忠实度仍不明确。为此，作者提出EICS（Evaluation-Invariant Concept Stability，评估无关概念稳定性）作为衡量表征在受控单概念干预下是否一致编码特定概念的新指标，并构建了CASP-VL（Causally controlled Spatial Perturbations for Vision-Language models），一个基于Visual Genome场景图生成的因果控制空间扰动基准。实验结果表明，相较于词法信息，VLMs对空间关系的表征忠实度显著偏低，即使在组合性任务上表现优于随机水平；进一步分析揭示，关系信息虽可在谓词对应标记处被识别，但在句子被聚合为全局表征（如通过结束符（EOS）或均值池化）后即丢失。这一发现揭示了输出层面评估无法捕捉的系统性缺陷：下游任务所使用的表征并未保留模型输入中本已存在的关系信息，暴露了当前VLMs在结构化知识建模上的根本局限。
链接: https://arxiv.org/abs/2610.13910
作者: Shubh Garg,Chen Shani
机构: Thapar Institute of Engineering and Technology (泰帕尔工程与技术学院); Tel Aviv University (特拉维夫大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Vision-Language Models (VLMs) increasingly analyze and reason about images, yet it remains unclear whether their internal representations faithfully encode the structured relations required for such reasoning. We introduce EICS (Evaluation-Invariant Concept Stability), a metric for testing whether representations consistently encode concepts under controlled one-concept interventions, and CASP-VL (Causally controlled Spatial Perturbations for Vision-Language models), a benchmark of causally controlled spatial perturbations derived from Visual Genome scene graphs. Across multiple VLM architectures, we find that spatial relations are represented substantially less faithfully than lexical information, even when the same models score well above chance on compositional benchmarks. Further analysis shows that the relation is identifiable at the predicate’s own tokens but is lost when the sentence is aggregated into a global representation, whether through the (EOS) token or by mean pooling. These findings reveal a systematic failure invisible to output-based evaluation: VLMs do not preserve, in the representation used downstream, relational information that is present in their own input.
[NLP-2] Structural Automata for Neural Semantic Parsing
【速读】： 该论文旨在解决生成式语义解析中因局部无效性导致的语法或结构不合法问题，尤其是在固定输出长度限制下，传统约束解码方法虽能防止局部非法标记，却无法保证有效前缀在剩余长度内可被完整扩展为合法输出。其核心解决方案是引入接受路径解码（Accepting-Path Decoding, APD），该方法在解码过程中动态维护一个在剩余长度内可被验证完成的有效路径，并仅在模型偏好标记也可被完成时才采纳，从而确保输出始终处于自动机接受状态且无需回溯。相较于局部掩码策略，APD在严格长度限制下显著提升DRS和AMR任务上的Smatch++得分（分别提高5.1/2.4和6.4/3.2点），性能接近采用回溯机制的方案，但避免了令牌回退带来的复杂性。此外，研究还发现后处理阶段通过过滤无效输出可实现近似于APD的效果，而训练阶段对自动机拒绝样本施加惩罚能有效提升早期开发集性能（改善3.6–11.0 Smatch++点），但该优势随训练进行逐渐减弱，表明交叉熵损失本身已能有效降低非法标记概率。
链接: https://arxiv.org/abs/2610.13896
作者: Xiao Zhang
机构: University of Groningen (格罗宁根大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Neural semantic parsers generate meaning representations token by token, yet well-formedness depends on references, scope, and graph relations that unfold during generation. Constrained decoding prevents locally invalid tokens but does not guarantee that a valid prefix can be completed within a fixed output-length limit. We investigate structural automata at three stages of DRS parsing (decoding, post hoc processing, and training) and additionally evaluate decoding on AMR. For decoding, we introduce accepting-path decoding (APD), which maintains a verified completion within the remaining length limit and follows the model’s preferred token whenever that token can also be completed. APD guarantees an accepted output without retracting tokens. Under tight length limits, it improves Smatch++ over local masking by 5.1 and 2.4 points on DRS and by 6.4 and 3.2 points on AMR, comparable to rollback under the same limit, which retracts tokens. For post hoc processing, invalid outputs concentrate on the same inputs: eight unconstrained samples yield no valid output for 10.2% of inputs with limited training data, compared with 0.4% with full data, where filtering comes within 0.2 Smatch++ points of APD. For training, penalizing automaton-rejected tokens improves development Smatch++ by 3.6-11.0 points after 10% of training, but this advantage diminishes as cross-entropy alone reduces the probability assigned to rejected tokens from 14% to below 2% within the first sixth of training with limited data.
[NLP-3] ask Context Shapes Component Roles in Language Models
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在不同任务间共享注意力头（attention heads）时，如何理解这些共享组件在不同任务中功能差异的问题。现有方法难以解释相同注意力头为何在不同任务中表现出不同的计算作用。为此，论文提出一种基于图结构的网络视角（network view），通过引入“图事实”（graph facts，即指定有向连接存在的语句）来刻画模型内部组件间的任务依赖性交互。其解决方案的关键在于：利用对早期激活向量的编辑（activation edit）干预，观察任务变化如何重新分配注意力头的影响（influence）和后续层的激活状态，并构建线性响应映射（linear response maps）以量化前层变化对后层响应的预测能力。实验表明，在Gemma-2-9B与Qwen3-14B等模型中，同一注意力头在不同任务下会响应不同的图事实，进而影响下游组件的方式也发生改变；且针对特定事实干预，对应条件下的响应映射相比平均映射显著降低均方预测误差（Gemma下降53.6%，Qwen下降5.0%）。这表明任务上下文不仅决定了共享组件所响应的计算图事实，还决定了其输出对后续计算的影响方式。该研究为理解模型如何通过共享参数实现多样化计算提供了网络层面的解释框架，并为可微调、行为解耦的干预策略提供了测量依据。
链接: https://arxiv.org/abs/2610.13895
作者: Sovesh Mohapatra,Dani S Bassett
机构: University of Pennsylvania (宾夕法尼亚大学); Yale University (耶鲁大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 9 pages, 5 Figs
Abstract:Large language models reuse the same attention heads across tasks, but identifying these shared heads does not explain what they do differently in each task. A natural source of inspiration is task-dependent interactions among shared brain regions, which motivate a network view of language-model computation. Here, we compare fixed model components across tasks using identical graph facts, statements specifying which directed connections are present. We measure how interventions affect attention heads and the activation state in later layers (influence), as well as the answer (importance). Task changes redistribute the influence in five open-weight models spanning four families and 1.5-14 billion parameters. In Gemma-2-9B and Qwen3-14B, an activation edit changes an early internal activation vector and switches which fact the model reads while the written instruction stays fixed. The same heads then respond to different graph facts and influence later components differently. For each prompt, we construct two linear response maps, one before the edit and one after it. Each map predicts a later head’s response from a measured change in an earlier head. For a separate factual intervention, the map for the corresponding condition reduces mean squared prediction error by 53.6% in Gemma and 5.0% in Qwen compared with the average of the two maps. These findings show that task context changes both which graph facts the shared components respond to and how their outputs affect later computation. A network account may help explain how models use shared parameters to perform different computations. Measurements of task-dependent influence could also guide interventions intended to alter one behavior while preserving others.
[NLP-4] Studying Comics at Scale with Artificial Intelligence: The PAGE Framework and Three Studies of American Comics and Japanese Manga
【速读】： 该论文旨在解决漫画作为20世纪重要视觉记录却长期缺乏系统性研究的问题，传统漫画研究多局限于单本书籍的分析，难以实现大规模、跨时空的宏观考察。其核心解决方案是提出一个名为PAGE的框架，利用人工智能技术（特别是生成式模型）实现对漫画档案的自动化解析与分析。该框架的关键在于：将每页漫画拆解为面板、文本和书目信息；通过视觉-语言模型依据人工制定的编码手册进行语义标注，模拟人类编码员的工作；基于人工标注数据对模型输出进行校准与验证；并结合控制出版商和类型变量的统计方法，揭示漫画内容在时间维度上的演变规律。该框架在3,929部美国漫画（1938–1956）及87卷日本漫画中进行了三类实证研究，分别聚焦政治权力的视觉呈现、视觉形式的产业演化与艺术家个人风格识别、以及对话主体在不同传统中的分布特征。研究成果不仅推动了漫画研究范式的革新，还拓展至可搜索视觉内容、无障碍阅读支持、脆弱藏品保护及未署名创作者溯源等实际应用，构建了一个以人工智能赋能漫画研究、保存与传播的综合性学术议程。
链接: https://arxiv.org/abs/2610.13840
作者: Emilio Ferrara
机构: University of Southern California (南加州大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Computers and Society (cs.CY)
备注:
Abstract:Comics are one of the great visual records of the twentieth century: hundreds of thousands of pages in which a mass readership saw its leaders, its wars and its heroes. Most of this record has never been studied as a whole; comics scholarship proceeds one book at a time. We argue that artificial intelligence, including generative models, can change this to the benefit of the medium itself. We propose PAGE, a framework that makes artificial intelligence an instrument for comics research. It parses every scan into panels, text and a bibliographic record; annotates each page with a vision-language model that follows a written codebook, as a human coder would; grounds samples of these readings in human annotation; and explains change across an archive, with estimates controlled for publisher and genre. We demonstrate the framework on 3,929 American comic books (1938–1956) and 87 volumes of Japanese manga, in three studies, each resting on a different capability. The first pairs text search with visual reading to recover how a mass medium portrayed political power. The second measures the page’s visual form across an industry and recovers the hand of individual artists. The third follows who speaks across two comics traditions, checked against human annotation. Beyond research, the same instruments can make archives searchable by what is drawn, open comics to blind and low-vision readers, and help preserve fragile collections and credit uncredited artists. We outline a research agenda in which artificial intelligence strengthens the study, preservation and reach of the medium.
[NLP-5] Can Language Models Learn When to Abstain? Policy Learning and Calibrated Answer Selection
【速读】： 该论文旨在解决大语言模型在面对事实性问题时，如何有效判断何时应作答、何时应选择“我不知道”这一关键决策问题。其核心挑战在于提升模型的自我认知能力，即在保证回答准确性的同时，合理控制回答覆盖率。解决方案的关键在于引入一个可学习的“答案选择器”（answer selector），通过强化学习训练该组件以自主决定是否回答问题，而非依赖预设的置信度阈值过滤机制。实验结果表明，在TriviaQA数据集上，该学习型选择器将平均覆盖率从20.2%提升至30.9%，同时在精确匹配评估下，已评分答案的错误率由23.0%降至14.5%，显著优于原始模型的校准置信度滤波器；而在NQ-Open数据集上，尽管选择器仍优于固定阈值过滤，但表现仍劣于始终选择不回答的策略。部分人工审核验证了TriviaQA上的发现，但跨数据集实现可靠且一致的拒答行为仍是未解难题。因此，研究支持在该场景下通过端到端学习方式优化答案选择，但揭示了泛化性拒答能力仍需进一步突破。
链接: https://arxiv.org/abs/2610.13821
作者: Juan Terven,Diana-Margarita Córdova-Esparza,Ruben Gomez,Carlos Miranda Rocha,Julio-Alejandro Romero-González,Edgar Chavez-Urbiola
机构: CICATA Qro., Instituto Politécnico Nacional(国家理工学院); Facultad de Informática, Universidad Autónoma de Querétaro(昆埃塔罗自治大学信息学院)
类目: Computation and Language (cs.CL)
备注: 17 pages, 2 figures, 10 tables
Abstract:A useful language model should know when to answer and when to say “I don’t know.” Can we improve that decision by training the model itself or by training a separate component to check its answers? We study both approaches on Qwen3-14B for factual questions, using a score that rewards correct answers, penalizes mistakes, and allows abstention. Across three training seeds and two held-out confidence thresholds, a learned answer selector improves threshold-averaged utility over the original model’s calibrated confidence filter. On TriviaQA, mean coverage increases from 20.2% to 30.9%, while the pooled error rate among scored answers decreases from 23.0% to 14.5% under exact-match grading. The tested reinforcement-learning changes do not establish consistent gains. On NQ-Open, the selector improves threshold-averaged utility over the filter but still performs worse than always abstaining. A partial human-reviewed audit preserves the TriviaQA finding. Our results support learning to select answers in this setting while showing that reliable abstention across datasets remains unresolved.
[NLP-6] QTestBench: A Test Framework for Evaluating LLM -Generated Quantum Code
【速读】： 该论文旨在解决生成式人工智能（Generative AI）在量子软件测试中的可信度评估问题。现有方法仅衡量大语言模型（LLM）是否生成正确答案，却忽视了其生成的测试用例能否有效区分正确实现与错误实现，而量子程序具有概率性、依赖数值容差且需领域专用检查器评判，导致即使测试语法正确，也可能与基准结果不一致。为此，论文提出 QTestBench 框架，其核心在于通过独立于测试本身的基准检查器（benchmark checker）对 LLM 生成的测试套件进行验证，避免将测试本身视为真实标签。该框架针对每个任务生成语法、语义和行为测试，运行时注入候选解，并在三个不同验证组中对比测试判别结果与检查器标注，以诊断测试质量。实验表明，尽管生成测试几乎均可执行，但其判别能力有限：最佳模型在 QHack 任务上测试质量仅为 0.71，在 Qiskit HumanEval 上仅为 0.34，说明可执行性不能代表测试有效性。通过引入经验证的合成变异体（oracle-verified synthetic mutants），在缺乏自然故障解的情况下（如十项 Qiskit 任务中的三项）仍能稳定估计缺陷检测能力。因此，QTestBench 提供了一个可复现、跨框架的量子测试可信度评估基准。
链接: https://arxiv.org/abs/2610.13811
作者: Meriem Terki,Nouhaila Innan,Minghao Shao,Muhammad Kashif,Alberto Marchisio,Muhammad Shafique
机构: École Supérieure en Informatique de Sidi Bel Abbès (阿尔及利亚西迪贝勒阿布卜斯高等计算机学院); eBRAIN Lab, Division of Engineering, New York University Abu Dhabi (NYUAD) (纽约大学阿布扎比分校工程学院eBRAIN实验室); Center for Quantum and Topological Systems (CQTS), NYUAD Research Institute, NYUAD, Abu Dhabi, UAE (纽约大学阿布扎比分校量子与拓扑系统研究中心); SDU Microelectronics, Institute of Mechanical and Electrical Engineering, University of Southern Denmark, Odense, Denmark (南丹麦大学机械与电气工程学院微电子研究所)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL); Quantum Physics (quant-ph)
备注: Accepted at the 2026 IEEE 2nd International Conference on Quantum Artificial Intelligence (QAI), 2026
Abstract:Large language models (LLMs) have shown strong results in classical code generation and are increasingly used to write the unit tests that safeguard that code. Whether they can do the same for quantum software is less clear, because quantum programs are probabilistic, depend on numerical tolerances, and are judged by domain-specific checkers, so a well-formed test can still disagree with the benchmark’s verdict. Existing quantum benchmarks measure whether a model produces a correct solution, but not whether its tests can distinguish correct implementations from faulty ones. We introduce QTestBench, a framework that evaluates LLM-generated quantum test suites against independent benchmark checkers, never treating the tests themselves as ground truth. For each task, QTestBench prompts models to produce syntactic, semantic, and behavioral tests, injects candidate solutions at runtime, and compares each test verdict with the checker’s label under three validation cohorts, each answering a distinct diagnostic question. We benchmark five LLMs on eight PennyLane QHack challenges and ten Qiskit HumanEval tasks. Generated suites almost always execute, but discrimination lags behind: the best generator reaches a test quality of 0.71 on QHack and 0.34 on Qiskit HumanEval, so executability alone overstates test quality. Oracle-verified synthetic mutants stabilize bug-detection estimates when natural faulty solutions are scarce, as on three of ten Qiskit tasks that yield none. QTestBench offers a reproducible, cross-framework benchmark for the trustworthiness of LLM-generated quantum tests.
[NLP-7] Error Rate is Not Enough: Costs of Augmentation in Low-Resource ASR
【速读】： 该论文旨在解决低资源自动语音识别（ASR）中数据增强方法效果不透明的问题，即现有研究多报告整体错误率的提升，却未阐明不同增强方法在何时、为何有效。其核心解决方案在于通过系统性地交叉对比两种音频层面的增强（速度扰动与SpecAugment）和两种基于文本的增强（修改转录并合成语音），从音素级错误分析出发，揭示了各类方法在错误类型上的互补性。关键发现是：SpecAugment虽能稳定提升整体性能，但会增加声调与软腭化错误；而文本类增强则引入辅音插入错误；二者结合可相互抵消对方引入的错误。这种互补性源于声调与软腭化仅由单一声学特征表征且训练中暴露频率最低，而文本增强通过均衡词频使这些罕见错误的出现频率提升37%–38%，从而逆转其错误模式。组合方法的增益超过单独使用之和，表现出超加性效应，但该效应在训练数据量达到100小时后消失，表明互补性仅存在于低资源场景。因此，论文提出应基于训练暴露程度和声学特征可测性来预先选择适合的增强策略，为低资源场景下的数据增强设计提供可解释、可预测的指导原则。
链接: https://arxiv.org/abs/2610.13807
作者: Katsumi Ibaraki,David Chiang
机构: 未知
类目: Computation and Language (cs.CL)
备注: 5 pages
Abstract:Data augmentation is standard practice for low-resource automatic speech recognition (ASR), but its benefits are almost always reported as aggregate error rates, leaving open why and when a method helps. On four low-resource languages and English at five data sizes, we cross two augmentations that modify existing audio (speed perturbation and SpecAugment) with two that modify text transcriptions and synthesize audio from it. We analyze errors at the phoneme level and find that they help for complementary reasons. SpecAugment has the most reliable aggregate improvements, but increases tone and palatalization errors, whereas text-based methods introduce consonant insertions; in combination, each reduces the errors the other introduces. This complementarity is predictable. Tone and palatalization are each signaled by a single acoustic property and occur least frequently in training (lowest training exposure), and text-based methods that flatten word frequency raise their frequency by 37–38%, reversing those errors while further improving aggregate error. The improvement from combining the methods exceeds the sum of their individual improvements; the superadditivity vanishes by 100 hours, limiting the complementarity to the low-resource regime. Where specific error types matter, we recommend selecting augmentation by training exposure and acoustic properties, both measurable before any training.
[NLP-8] REFLECT: Role-Aware Detection of Sentiment Emotion Politeness and Formality
【速读】： 该论文旨在解决对话中语用意义（communicative meaning）检测问题，即如何有效建模情感、情绪、礼貌与正式程度（SEPF）等交际维度的表达机制。现有方法虽依赖上下文语言表示，但未能显式捕捉参与者角色结构对SEPF的塑造作用。其核心解决方案是提出一种角色感知的Transformer架构，将SEPF四个维度映射至基于语言学理论的语义角色标注（SRL）配置，并将其直接嵌入Transformer的自注意力机制中：通过非方向性角色感知注意力建模内在状态（如情感与情绪），利用方向性角色感知注意力捕捉发话人到受话人的外部关系线索（如礼貌与正式程度）。最终，角色感知表征与上下文嵌入通过可学习门控机制融合，实现对角色信息贡献度的自适应加权，而非简单拼接为辅助特征向量。实验表明，该框架在四个基准数据集上显著优于强基线模型（如BERT），尤其在低频复杂情绪及高度礼貌表达等理论预期场景中表现突出；而情感预测提升不显著，暗示情感更多由词汇选择决定，而非角色结构。真实世界心理健康数据上的评估进一步验证了该方法在预测性能与模型可解释性方面的优势，证明了基于语言学原理改进Transformer自注意力机制，能够有效提升对话中语用意义的检测能力，并生成可追溯的角色基础解释。
链接: https://arxiv.org/abs/2610.13797
作者: Sangpil Youm,Annabel Stocks Natalias,Hayden Heninger,Leah Jones,Xiaoyang Jin,Xiaoya Zhang,Bonnie Dorr
机构: 未知
类目: Computation and Language (cs.CL)
备注: 9 pages, 2 figures
Abstract:Detecting communicative meaning in dialogue requires modeling not only lexical content but also the participant-role structures through which sentiment, emotion, politeness, and formality (SEPF) are expressed. Existing approaches rely on contextual language representations while leaving semantic roles implicit. We introduce a role-aware transformer architecture that maps the four SEPF dimensions to theory-grounded Semantic Role Labeling (SRL) configurations, incorporating these configurations directly into the transformer’s self-attention mechanism. Role-aware attention models non-directional internal states (sentiment and emotion), while directional role-aware attention captures initiator-to-recipient relations for external cues (politeness and formality). The resulting role-aware representations are fused with contextual embeddings through a learned gate that adaptively weights how much role information each input contributes, rather than appending semantic roles as an auxiliary feature vector. Across four benchmark datasets, the framework yields statistically reliable gains over strong BERT-based baselines for emotion, politeness, and formality, with gains concentrated in theoretically predicted cases such as low-frequency, complex emotions and highly polite expressions; sentiment improvements are marginal and non-significant, suggesting that sentiment is conveyed more through lexical choice than participant-role structure. Additional evaluation on real-world data demonstrates that the framework improves both predictive performance and model traceability. These results demonstrate that linguistically grounded modifications to transformer self-attention improve the detection of communicative meaning, generalize beyond benchmark datasets to real-world mental-health data, and yield traceable, role-grounded explanations that extend beyond predictive performance to interpretability.
[NLP-9] Not Just an Evaluation: A Case Study of Discourse Particle Sensitivity in Language Models
【速读】： 该论文旨在解决生成式语言模型（Generative AI）对话语标记词（discourse particles）——特别是英语中的“just”与“only”——在自然对话语境中细微语用功能的敏感性问题。这类标记词虽不改变命题的真值条件，却通过反映对话情境和对话者态度来调节话语流，且具有多义性与语义重叠特征，其作用机制长期未被充分研究。论文的关键解决方案在于结合行为实验与机制分析，系统评估大语言模型（LLM）在包含或不含这些标记词的语境下生成内容的偏好与判断差异，并通过指令微调（instruction tuning）增强模型敏感性。研究发现，LLM与人类在使用这些粒子时表现出相似的偏好模式，且对“just”比“only”更敏感；同时，模型生成结果在有无粒子条件下存在显著概率差异，表明其具备对粒子语用功能的内在敏感性。进一步的神经定位分析揭示，“just”与“only”在模型内部的表征存在不对称转移现象：仅“only”相关单元可选择性迁移至“just”的排他性语义，而所有“just”单元均能等效迁移到“only”，暗示模型在词汇层面的粒子表征部分依语义功能组织。该工作为理解大语言模型如何建模语言的微妙语用特性提供了实证支持与机制洞察。
链接: https://arxiv.org/abs/2610.13794
作者: William Sheffield,Jiahui Chen,Amy Zhang,Alex Warstadt,Junyi Jessy Li,Kanishka Misra
机构: The University of Texas at Austin(德克萨斯大学奥斯汀分校); University of California, San Diego(加州大学圣地亚哥分校)
类目: Computation and Language (cs.CL)
备注:
Abstract:Discourse particles subtly shape the flow of discourse by reflecting conversational context and interlocutor attitudes, often leaving the truth-conditional meaning untouched. They are also often polyfunctional, with distinct senses which partially overlap with other particles; for example, the exclusive use of English “just” and “only” (“John only/just drinks water”). Despite the frequency of these words in natural language, they have gone largely unstudied due to the subtle nature of their effects. We investigate LLM sensitivity to “just” and “only” in natural conversations using behavioral and mechanistic analyses. First, we find that LLMs and humans similarly prefer the presence of these particles in context, and both are more sensitive to “just” compared to “only”. Second, when sampling from LLMs with and without these particles, we find LLMs consistently rate generations as more likely, given their source context, demonstrating their particle sensitivity. In both experiments, instruction tuning increases sensitivity. Finally, we localize particle-sensitive units within LLMs and find the overlap between “just” and “only” is asymmetric: “only” units transfer selectively to exclusive “just”, while all “just” units transfer to “only” equally well regardless of sense, suggesting LLM lexical-level particle representations are partially organized by sense. We release our code, sense-labeled dialogue stimuli, and human preference annotations at this https URL.
[NLP-10] OccludeBench: Can VLMs Find Whats Missing?
【速读】： 该论文旨在解决视觉语言模型（Vision-Language Models, VLMs）在图像中存在完全遮挡物体时，如何基于剩余视觉线索推断缺失内容的推理能力问题。其核心挑战在于区分直接推理（direct cases）与推断性推理（inferential cases）：前者依赖于具体的物理线索（如阴影、反射），后者则依赖于更广泛的场景上下文。研究通过人工构建的OccludeBench基准测试发现，当前五种VLM在直接案例中的平均准确率为42.7%，而在推断性案例中达62.7%，二者存在20.0个百分点的显著差距，而人类表现则无明显差异（分别为63.4%和68.5%）。为定位失败原因，研究提出OccludeTrace四阶段诊断框架，揭示瓶颈出现在模型从全图投影中恢复相关遮挡对象的阶段——仅在50%的错误案例中成功，而正确案例的成功率高达91%。尽管扩展推理、工具使用及少样本提示等方法带来不一致改进，但无法稳定缩小差距。相比之下，“先修复再验证”（inpaint-then-confront）干预策略，即先生成候选遮挡物体，再将其与可见物理线索进行比对，显著降低了差距至统计上不显著水平，尤其在具备图像生成能力的模型中效果突出。该研究的关键贡献在于建立了一个可控且可操作的诊断范式，系统揭示了VLM在处理视觉缺失信息时的推理局限，并提出了有效的干预路径。
链接: https://arxiv.org/abs/2610.13790
作者: Jasin Cekinmez,Addison J. Wu,Ryo Mitsuhashi,Linrong Cai,Xingyu Fu,Zhuang Liu
机构: Princeton University (普林斯顿大学)
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL)
备注:
Abstract:How well can vision-language models (VLMs) reason about what is missing from an image? We study this question with OccludeBench, a manually curated benchmark for recovering fully occluded objects from the visual evidence that remains. OccludeBench distinguishes direct cases, where the hidden object must be recovered from a specific physical cue such as a shadow or reflection, from inferential cases, where it can be inferred from broader scene context. Across five VLMs, accuracy averages 42.7% on direct cases versus 62.7% on inferential cases, exhibiting a 20.0-point gap. Humans attain higher accuracies of 63.4% versus 68.5% for direct and inferential images, respectively, with no significant gap. To locate this failure, we introduce OccludeTrace, a four-stage diagnostic that isolates where the visual reasoning process breaks down. The bottleneck emerges when models must recover the relevant object from the projection within the full image: they succeed on only 50% of failed examples, compared with 91% of examples they answer correctly. Extended reasoning, tool use, and few-shot prompting yield inconsistent improvements and do not reliably eliminate the gap. In contrast, an inpaint-then-confront intervention, which prompts models to first generate a candidate hidden object and then evaluate that hypothesis against the visible physical cue, reduces the gap to a statistically non-significant difference for both models with image-generation capabilities. Together, our results establish a tractable, controlled diagnostic for isolating how VLMs reason about visual content that is missing from an image.
[NLP-11] UkrMeme: Multimodal Explainable Persuasion Detection in Ukrainian Memes
【速读】： 该论文旨在解决在乌克兰战争背景下，如何有效识别和分析网络迷因（meme）中所使用的说服性技巧（persuasion techniques）这一关键问题。由于迷因在政治冲突中的传播中融合了视觉与文本线索，传统方法难以全面捕捉其多模态说服机制，因此亟需一种能够理解图像与语言协同作用的分析框架。论文提出的核心解决方案是构建并应用基于多模态大模型（vision-language models, VLMs）的零样本提示（zero-shot prompting）检测方法，并引入两个关键数据集：UkrMeme，一个包含200个真实生成的乌克兰战时迷因且标注了说服性技巧的数据集；以及PTM-UA，即对Propaganda 950基准中部分条目进行乌克兰语翻译并保留原始视觉内容的版本，以确保跨语言可比性。通过采用分层F1指标评估多模态输入下的性能，并对比层间相关性传播（Layer-wise Relevance Propagation, LRP）与模型自动生成的词元归因（token attributions）两种解释方法，研究进一步揭示了不同解释技术所强调的语义证据类别差异，从而为理解VLM在迷因说服性分析中的可解释性提供了实证基础。
链接: https://arxiv.org/abs/2610.13783
作者: Nazar Andrushko,Vera Schmitt,Veronika Solopova
机构: Ukrainian Catholic University (乌克兰天主教大学); Johannes Gutenberg University Mainz (莱茵兰-普法尔茨州美因茨约翰内斯古腾堡大学); German Research Center for Artificial Intelligence (DFKI) (德国人工智能研究中心); Centre for European Research in Trusted AI (CERTAIN) (欧洲可信人工智能研究中心)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Memes play a central role in modern online communication, especially in contexts of political conflict where visual and textual cues combine to convey persuasive messages. We study persuasive technique detection in Ukrainian memes using vision-language models (VLMs). We introduce UkrMeme, a dataset of 200 organically produced Ukrainian wartime memes annotated for persuasion techniques, and PTM-UA, a Ukrainian translation of a subset of the Propaganda 950 benchmark that preserves original visual content while translating meme text. We evaluate VLMs in a zero-shot prompting setup across image, text, and multimodal inputs using hierarchical F1 metrics. Finally, we compare Layer-wise Relevance Propagation (LRP) and model-generated token attributions and analyze the semantic categories of evidence emphasized by each explanation method.
[NLP-12] A Privileged Teacher That Only Scores Cannot Search: Critique-Conditioned On-Policy Self-Distillation for Reasoning NEURIPS2026
【速读】： 该论文旨在解决基于可验证奖励的强化学习（verifiable-reward RL）中稀疏奖励信号导致的训练效率低下问题，特别是如何在生成式推理过程中实现细粒度的信用分配。传统自蒸馏方法通过一个以参考解为条件的教师模型对学生的推理轨迹进行评分，试图将稀疏的最终结果奖励转化为密集的词元级信用信号，但其核心问题是：该评分信号无法有效定位错误、也无法促使模型降低错误词元的概率。研究发现，现有自蒸馏目标所依赖的全分布KL散度和词元对数似然比均不具备错误局部化能力，且无法可靠区分同一问题中正确与错误的推理路径。作者指出，这一失败具有结构性根源——识别推理轨迹中的错误本质上是一个搜索问题，而评分型教师并未被显式赋予执行此搜索的任务。相比之下，当允许模型先生成对当前推理的批判性评价（critique），再以该批判为条件构建评分教师时，新提出的“批判条件化自蒸馏”（critique-conditioned self-distillation）能够显著提升错误定位能力，产生具有纠正性的信号，并引导模型概率向诸如“Wait”、“But”、“Actually”等提示回溯的词元转移。实验进一步表明，该批判信号在测试阶段可使模型从错误推理中恢复，从而求解原本无法通过采样解决的数学问题；在冷启动的广义策略优化（GRPO）中，亦能在缺乏可验证奖励的提示上提供有效的优势信号。
链接: https://arxiv.org/abs/2610.13744
作者: Mayug Maniparambil,Ayush Rai,Ekansh Verma,Noel E. O’Connor,Fergal Reid
机构: Fin.ai(金融人工智能); Dublin City University(都柏林城市大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Accepted as an oral at the FLLMPT workshop, NeurIPS 2026
Abstract:On-policy self-distillation promises to replace the sparse outcome signal of verifiable-reward RL with dense token-level credit: a teacher conditioned on the reference solution scores the student’s own rollout, and the resulting distributional shift is distilled back into the policy. We investigate whether this scoring signal actually contains corrective credit. Using gold error spans in student rollouts, we test the two signals consumed by self-distillation objectives, the full-distribution KL and the token log-ratio, for two properties: whether they localize errors and whether they push probability away from erroneous student tokens. They exhibit neither of these properties nor can they reliably distinguish correct from incorrect rollouts within the same problem. We argue that this failure is structural: locating an error in a reasoning trace is itself a search problem, while a scoring teacher is never explicitly asked to perform that search. The same model, with the same privileged information, localizes errors substantially better when allowed to generate a critique. This forms the motivation for \emphcritique-conditioned self-distillation: first generate a critique of the current rollout, then condition the scoring teacher on that critique. The resulting signal localizes errors, is corrective within error spans, and shifts probability toward tokens that initiate backtracking such as Wait'', But’‘, and ``Actually’'. We further show that the critique is useful both at test time, where resuming a wrong rollout with the critique in context converts math problems the model cannot solve by sampling, and in cold-start GRPO, where it provides an advantage signal on prompts for which verifiable rewards alone provide none.
[NLP-13] Enhancing Legal Reasoning in Pre-trained Language Models via Knowledge Graph-Guided Multi-Task Pre-training EMNLP2026
【速读】： 该论文旨在解决法律语言理解中对半结构化法规文本进行推理的能力不足问题，现有法律语言模型依赖于掩码语言建模（Masked Language Modeling, MLM）等标准预训练目标，将法规文本视为扁平的词元序列，忽视了其内在的层级结构约束。其解决方案的关键在于提出一种多任务预训练方法，专门针对德语交通法规（StVO）设计，通过结合三种互补的目标：下一句预测（Next Sentence Prediction, NSP）、基于知识图谱（Knowledge Graph, KG）引导的聚类（CLU）以及基于知识图谱感知的段落分类（CLS），显式地将结构化法律知识编码至模型权重之中。这一机制使模型在推理阶段具备零样本法律推理能力，无需依赖离散的知识图谱遍历。实验结果表明，该方法在九种Transformer编码器上共324次运行中均表现出显著性能提升，在合成StVO问答任务中相对基线提升达10.3%至155.0%，并在七个法律基准中的四个上超越了已有的LexGLUE基准，同时在奥地利驾驶法规上实现了3.4%至15.8%的一致零样本迁移增益，验证了该训练方法在跨领域场景下的良好泛化能力。
链接: https://arxiv.org/abs/2610.13722
作者: Ibrahim Siddig,Munir Georges
机构: AImotion Bavaria, Technische Hochschule Ingolstadt(艾莫动巴伐利亚，英戈尔施塔特应用技术大学)
类目: Computation and Language (cs.CL)
备注: Accepted at the NLLP 2026 Workshop, co-located with EMNLP 2026. 9 pages, 5 figures
Abstract:Legal language understanding requires reasoning over semi-structured regulatory documents, yet standard pre-training objectives do not explicitly target this structural capability. Because current legal language models rely solely on masked language modeling, they treat statutory text as flat token sequences and ignore the underlying hierarchical constraints. To bridge this gap, we present a multi-task pre-training approach for German traffic law (StVO). Our approach combines three complementary objectives: Next Sentence Prediction (NSP), Knowledge Graph (KG) Guided Clustering (CLU), and Knowledge Graph (KG) Aware Paragraph Classification (CLS). This approach explicitly encodes structured legal knowledge directly into the model weights. This encoding enables zero-shot legal reasoning at inference time and removes the need for discrete graph traversal. We evaluate our approach across nine Transformer-based encoders and 324 experimental runs. On synthetic StVO question answering, our models demonstrate consistent relative improvements between 10.3% and 155.0% over baselines. Furthermore, relative to the established LexGLUE baselines (Chalkidis et al., 2022), our models improve over prior results on four of seven legal benchmarks. It also achieves consistent zero-shot transfer gains between 3.4% and 15.8% on Austrian driving regulations. These experimental results indicate that our training approach generalizes successfully beyond the initial training legal domain.
[NLP-14] Adaptive DHiSparse: Speculative Decoding over a Load-Adaptive KV Hierarchy
【速读】： 该论文旨在解决长上下文推理场景中因KV缓存（Key-Value Cache）内存不足导致硬件利用率受限的问题，尤其针对现有方法在支持推测解码（speculative decoding）时的局限性。其核心挑战在于如何在有限的GPU显存下高效管理历史键值对，同时兼容如DSpark和DFlash2等基于草稿模型的推测解码机制，并在高并发与超长上下文（如100K、500K tokens）条件下维持高性能与低延迟。解决方案的关键是提出Adaptive DHiSparse，一种支持分层稀疏KV结构的自适应存储架构：它通过动态调整数据驻留策略，在保证必要工作集（working set）的前提下，利用空闲显存保留更多历史信息；当内存压力增大时，可选择性地将部分数据移至主机内存，并通过精确融合检索（exact fused retrieval）恢复缺失内容。该方案继承了DSpark与DFlash2的提案与验证规则，包括共享缺失行检索、环形窗口绑定草稿KV以及跨层组复用验证阶段，从而在100K上下文、并发128时实现每解码GPU 793输出词元/秒，较HiSparse提升1.45倍，较非推测性自适应服务提升1.27倍；在相同延迟约束下，支持高达4倍的并发量及2.3至3.7倍的输出吞吐。在DeepSeek-V4.1-Flash上，500K上下文、并发512时，其输出为驻留式服务的1.85倍。负载较低时，可选驻留策略将主机访问比例从14.2%降至1.4%，有效缓解内存压力并优化资源利用。
链接: https://arxiv.org/abs/2610.13708
作者: Naji Alazhar,Wassel Alazhar
机构: 未知
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG)
备注: 16 pages, 11 figures, 6 tables
Abstract:Long-context serving runs out of KV memory before the hardware reaches its useful throughput. HiSparse stores history in host memory and fetches only the selected entries, but it uses one cache budget at every load and does not handle draft-model speculative decoding such as DSpark and DFlash2. We present Adaptive DHiSparse, which supports speculative decoding over hierarchical sparse KV and adapts residency to load. It protects the required working set, retains additional history while GPU memory is spare, and recovers the rest through exact fused retrieval. DSpark and DFlash2 keep their proposal and acceptance rules: queries share missing-row retrieval, draft KV uses a window-bounded ring, and verification staging is reused across layer groups. At 100K context and concurrency 128, GLM-5.3 with DFlash2 delivers 793 output tokens/s per decode GPU, 1.45 \times HiSparse and 1.27 \times non-speculative adaptive serving. Held to the same latency bounds as HiSparse, it sustains up to 4 \times the concurrency and 2.3 to 3.7 \times the output, depending on the per-token bound. On DeepSeek-V4.1-Flash at 500K context and concurrency 512, Adaptive DHiSparse with DSpark delivers 1.85 \times the output of resident serving with DSpark. In a load step, optional residency reduces host fetches from 14.2% to 1.4% of selected rows at low load and releases memory under pressure.
[NLP-15] Verifiable Retrieval for Legal Reasoning through Structure-driven Knowledge Graph ISWC2026
【速读】： 该论文旨在解决生成式人工智能（Generative AI）在可靠性关键领域（如法律）中因模型黑箱特性导致的可解释性与可验证性不足的问题。现有基于大语言模型（LLM）的系统难以满足透明性和可追溯性要求，而检索增强生成（Retrieval Augmented Generation, RAG）虽通过引入可解释文档以降低“幻觉”风险，但在面对大量且复杂的源文档时，传统检索方法易忽略关键上下文信息，导致引用准确性下降。为此，本文聚焦德国民法典场景，提出一种基于结构驱动解析构建知识图谱（Knowledge Graph, KG）的方法，用于支持源文档的导航与精准检索；并通过对比多种由知识图谱指导的文本分块与检索策略，评估其对引用准确性的影响，其核心解决方案在于利用结构化知识图谱提升检索相关性与上下文感知能力，从而实现更准确、可验证的法律文本生成。
链接: https://arxiv.org/abs/2610.13695
作者: Ibrahim Siddig,Sviatoslav Tugeev,Munir Georges
机构: 未知
类目: Computation and Language (cs.CL)
备注: Accepted at the RAGE-KG 2026 Workshop, co-located with ISWC 2026. 7 pages, 3 figures
Abstract:Any automation within reliability-critical contexts such as medicine or law has to be transparent and verifiable. Despite their advantages, current LLM-based systems do not meet these requirements due to their inherent black-box nature. Retrieval Augmented Generation (RAG) attempts to ground the generative process in the relevant interpretable documents, thereby reducing the risk of AI ‘hallucinations’ and potentially enabling verification of the initial generation context. However, as the number and size of potential sources increases, naive retrieval approaches tend to perform worse, ignoring critical context elements. In this paper we aim to tackle this problem in the context of German Legal Code. Using structure-driven parsing to create a Knowledge Graph (KG) for the source document navigation and retrieval, we compare several KG-informed chunking and retrieval strategies and evaluate their effect on the accuracy of retrieved citations.
[NLP-16] Retractions Revisited: A Replication Extension and Mechanistic Evaluation of Linguistic Obfuscation Effects in Fraudulent Science
【速读】： 该论文旨在解决在开放科学时代背景下，学术造假行为与语言模糊性（linguistic obfuscation）之间关系的实证验证不足问题，尤其关注语言模糊性是否为欺诈性科研论文的核心特征，以及其背后的心理机制。研究通过对比2013至2025年间800篇伪造论文与800篇真实对照论文，发现伪造论文确实表现出更高的语言模糊性，支持了语言模糊性假说。其解决方案的关键在于构建并检验一个平行中介模型，识别出“现实监控能力”（reality monitoring）下降——表现为形容词使用频率降低——是连接学术欺诈与语言模糊性的最有力心理机制。此外，基于语言模糊性特征的分类器（准确率60.7%）及包含百余个语言维度的弹性网络模型（准确率71.6%）均显著优于随机猜测水平，表明语言特征可作为识别学术不端的有效工具，对科学诚信维护与语言心理机制研究具有重要启示。
链接: https://arxiv.org/abs/2610.13678
作者: David M. Markowitz
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Prior work suggests fraudulent scientists write their articles with higher rates of linguistic obfuscation than genuine scientists, with a possible mechanism suggesting obfuscation makes research more costly for a reader to analyze. This result has not undergone additional empirical scrutiny in the open science era, nor have other psychological mechanisms been evaluated. The current replication and extension addressed this opportunity by comparing 800 fraudulent and 800 genuine control papers (2013-2025). The results supported the linguistic obfuscation hypothesis, suggesting fraudulent papers were more obfuscated than genuine ones. A parallel mediation model evaluated three competing mechanisms, finding that reality monitoring, as measured through decreased rates of adjectives, best explained the link between fraudulent science and linguistic obfuscation. Cross-validated detection accuracy using obfuscation features (60.7%) and an elastic net of over 100 language dimensions (71.6%) were significantly greater than chance. Implications for scientific fraud and psychology of language research are discussed.
[NLP-17] Inject a Turn Not a Token: Learning Where to Redirect LLM Reasoning for Self-Correction
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在自我推理过程中难以可靠识别并纠正自身错误的问题。现有基于训练的方法通常通过微调模型以生成修正内容或反馈，但此类方法依赖于大量标注数据且泛化能力有限。本文提出一种无需微调的新型纠错框架——UPTURN（User-Prompt TURN injection at a learned position），其核心创新在于：首先，利用一个130K参数的多层感知机（MLP）头，在冻结编码器上仅根据最终答案正确性学习在失败推理轨迹中应干预的位置；其次，在重定向策略上发现，固定生成预算下直接插入修正指令（inline injection）效果不稳定，而将相同指令作为新的用户轮次（new user turn）注入则能有效改变模型推理路径。该方法通过保留选定前缀、注入新指令作为独立用户输入并重新生成后缀来实现纠错。实验表明，UPTURN在四个推理模型和六个数学基准测试中均显著优于32次采样基线，且在相同纠错预算下超越自校正与反射令牌注入基线，具备跨模型迁移能力（如在GPQA-Diamond上无需重训），同时可与GRPO及自校正方法协同增效。其关键在于不依赖模型微调，而是通过学习干预位置并借助语义重构的用户轮次注入实现高效、通用且可扩展的推理纠错。
链接: https://arxiv.org/abs/2610.13672
作者: Jiwon Jeon,Myungsik Cho,Jeonghye Kim,Youngchul Sung
机构: Korea Advanced Institute of Science and Technology (KAIST)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Large language models struggle to reliably identify and correct errors in their own reasoning. Unlike prior training-based approaches that fine-tune an LLM to generate revisions or feedback, we learn where to intervene in failed rollouts and determine how to redirect them. To choose where to intervene, we train a 130K-parameter MLP head on a frozen encoder using only final-answer correctness. For redirection, we find that under a fixed generation budget, the tested inline injections fail to reliably redirect reasoning, whereas presenting the same instruction in a new user turn changes the model’s course. The resulting correction framework, UPTURN (User-Prompt TURN injection at a learned position), requires no LLM fine-tuning: it retains a selected prefix, injects an instruction as a new user turn, and regenerates the suffix. Across four reasoners and six math benchmarks, UPTURN improves average accuracy in every setting over a 32-rollout baseline. It outperforms self-correction and reflection-token injection baselines under matched correction budgets, transfers across reasoners and to GPQA-Diamond without retraining, and complements GRPO and self-correction methods.
[NLP-18] Multi-Stream Attention Residuals
【速读】： 该论文旨在解决大模型中残差连接在深度网络中难以实现内容依赖性信息检索的问题，尤其是在多专家模型（MoE）架构下，传统残差结构无法有效利用历史层的上下文信息，导致训练效率与模型性能受限。其解决方案的关键在于提出多流注意力残差（Multi-Stream Attention Residuals, MSAR），通过引入沿深度轴的多头注意力机制，将单流softmax注意力扩展为多流并行的深度注意力机制。MSAR利用多尺度因果卷积从序列上下文中提取多样化的流特征，使不同注意力头能够基于不同的上下文视角获取历史表示，同时保持隐藏状态的完整性；随后通过轻量级自适应混合模块融合多流信息，生成单流输入。该设计在不引入持久化多流存储或通信开销的前提下，实现了按需扩展的多流计算，显著提升了模型表达能力。实验表明，在18B和28B参数规模的12个下游任务上，MSAR均优于标准残差、流形约束超连接（mHC）及原始注意力残差（AttnRes），并在缩放定律实验中实现相较于标准残差基线1.58倍的等损失计算加速，验证了其在大规模预训练场景下的高效性与优越性。
链接: https://arxiv.org/abs/2610.13630
作者: Xiaohan Qin,Xiangdong Zhang,Tuo Dai,Sunan Zou,Huaijin Wu,Yebin Yang,Zhuo Xia,Lin Yao,Yuliang Liu,Junchi Yan
机构: Shanghai Jiao Tong University (上海交通大学); Dots Studio, Xiaohongshu Inc. (小红书公司); Peking University (北京大学)
类目: Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Attention Residuals (AttnRes) enables content-dependent retrieval over network depth, which can be viewed as single-stream softmax attention along the depth axis. Inspired by the success of multi-head attention along the sequence axis, we introduce Multi-Stream Attention Residuals (MSAR), an extension of AttnRes that generalizes this mechanism to multi-head depth attention, yielding substantial performance gains with minimal additional overhead. MSAR draws stream diversity from sequence context through multi-scale causal convolutions, allowing different heads to retrieve historical representations through distinct contextual views while preserving the integrity of the hidden representation. The retrieved streams are combined through lightweight adaptive mixing to generate the single-stream layer input. By retaining single-stream sources and expanding them on demand, MSAR supports multi-stream computation without requiring persistent multi-stream storage or communication. Across all 12 downstream benchmarks at the 18B and 28B MoE scales, MSAR consistently outperforms prior residual variants, including standard residual connections, manifold-constrained Hyper-Connections (mHC), and AttnRes. Scaling-law experiments yield an iso-loss compute speedup of 1.58\times over the standard residual baseline, compared with 1.35\times for AttnRes and 1.30\times for mHC. These results make MSAR a promising residual architecture for large-scale pre-training.
[NLP-19] AMLworld-Compact: Importance-Weighted Downsampling for Cost-Effective LLM Evaluation and Error Diagnosis
【速读】： 该论文旨在解决在AMLworld数据集最小测试划分上评估大语言模型（Large Language Models, LLMs）时计算成本过高的问题，其核心挑战在于每个超过百万个目标均需独立生成图提示（graph prompt），导致评估效率低下。现有采样方法虽可降低计算开销，但小规模平衡子集会改变未加权精确率（precision）和F1分数，造成评估偏差。为此，论文提出AMLworld-Compact评估集，通过保留所有非法交易样本，并从基于监督评分（supervised-score）分层的良性交易中进行采样，实现高效且无偏的评估。其关键创新在于引入HT-Coreset协议，可在HI-Small和LI-Small数据集上分别将评估目标减少271倍和611倍。结合霍维茨-汤普森权重（Horvitz-Thompson weights），该方法能对固定预测结果下的完整测试混淆计数提供无偏估计，其中召回率（recall）为精确估计，而精确率与F1为比率估计。在使用图特征预处理器（Graph Feature Preprocessor, GFP）特征的留出研究中，以一种提升树族定义分层结构，用于对另一类模型进行超过500次配置抽样评估，结果显示，相较于均匀采样配合霍维茨-汤普森权重（误差范围4.44–7.41个百分点），本方法在释放规模下的F1均方根误差（RMSE）仅为0.00–2.58个百分点，显著更优；尽管置信区间仍较宽。在所评估的图提示条件下，七种开源权重大语言模型的加权精确率接近“全标为非法”的基线水平。进一步针对1,000条HI-Small少样本输出进行结果分层审计发现，仅84.5%的正确二元判断和56.2%的错误判断通过词汇检查，表明此类标记无法作为结论正确性的可靠依据。研究团队已公开发布评估集、构建代码及审计工具。
链接: https://arxiv.org/abs/2610.13627
作者: Natapong Nitarach,Phume Ngampornsukswadi,Pittawat Taveekitworachai,Surapon Nonesung,Warit Sirichotedumrong,Kunat Pipatanakul
机构: SCB DataX, SCBX Group; Typhoon team
类目: Computation and Language (cs.CL)
备注: 28 pages, 5 figures, 27 tables. Under review
Abstract:Evaluating large language models (LLMs) on AMLworld’s smallest test splits is costly because each of over a million targets requires a separate graph prompt. Sampling reduces this cost, but small balanced subsets change unweighted precision and F1. We introduce AMLworld-Compact, an evaluation set that retains every illicit test transaction and samples benign transactions from supervised-score strata. Its HT-Coreset protocol reduces evaluation targets by 271x and 611x on HI-Small and LI-Small. Horvitz-Thompson weights give unbiased full-test confusion-count estimates for fixed predictions; recall is exact, while precision and F1 are ratio estimates. In a held-out study using Graph Feature Preprocessor (GFP) features, one boosted-tree family defines strata for evaluating the other over 500 draws per configuration. At the released sizes, F1 RMSE is 0.00-2.58 percentage points versus 4.44-7.41 for uniform sampling with HT weights; conservative intervals remain broad. Under the evaluated graph prompts, seven open-weight LLMs have weighted precision near the predict-all-illicit baseline. In an outcome-stratified audit of 1,000 HI-Small few-shot outputs from one run per model, lexical checks pass for 84.5% of correct and 56.2% of incorrect binary verdicts, so these markers do not establish correctness. We release the evaluation sets, construction code, and audit tools at this https URL and this https URL.
[NLP-20] APEX-Harm: Evaluating Agent Safety in Shared Professional Workspaces
【速读】： 该论文旨在解决在复杂共享工作空间中，长期任务型智能体（long-horizon agents）面临提示注入（prompt injection）与脚本注入（script injection）等安全威胁的问题。传统安全评估方法难以捕捉多文件、多工具协同环境下的隐蔽攻击行为，尤其当攻击者利用动态或任务特定的恶意输入时。其解决方案的关键在于构建 APEX-Harm 基准测试体系，该体系模拟真实金融、咨询与法律场景下的多源异构工作环境，涵盖115至328个文件及邮件、日历、聊天、文档、电子表格、PDF和代码执行等通过MCP服务器暴露的工具。基准包含六类攻击类型，覆盖静态与动态注入、任务特异性脚本替换以及攻击者提供的通用脚本，并从攻击成功率、信息暴露程度与任务性能三个维度进行综合评估。实验表明，尽管部分前沿模型（如Opus 5与Sonnet 5）整体攻击成功率较低（分别为8%和20%），但任务特定脚本替换与通用脚本攻击仍分别达到81–84%和73%的高成功率；即便表现最优的Gemini 3.8 Flash在平均任务得分达0.877的情况下，仍存在33%的攻击成功概率。这揭示了当前智能体即使完成正确交付成果，也可能在后台执行未经授权操作，因此单纯的任务完成度不能作为安全行为的充分证据。
链接: https://arxiv.org/abs/2610.13623
作者: Ziyi Yang,Adel Bibi,Guohao Li,Bernard Ghanem,Carlos Hinojosa
机构: King Abdullah University of Science and Technology (阿卜杜拉国王科技大学); University of Oxford (牛津大学); CAMEL-AI.org; Eigent.AI
类目: Cryptography and Security (cs.CR); Computation and Language (cs.CL)
备注:
Abstract:Professional agents increasingly work through command-line interfaces and multiple tools over shared workspaces containing files, messages, and business applications. These environments create safety risks that are difficult to capture with attacks placed at a single, known read location. We introduce APEX-Harm, a benchmark for evaluating prompt and script injection against long-horizon agents performing finance, consulting, and legal tasks in large workspaces. Each task contains 115 to 328 files, together with email, calendar, chat, document, spreadsheet, PDF, and code-execution tools exposed through MCP servers. The benchmark includes six attack categories covering static and dynamic injections, task-specific script replacement, and attacker-provided generic scripts, and evaluates attack success, exposure, and task performance. We evaluate 12 frontier models on 180 task instances per model. Opus 5 and Sonnet 5 have the lowest overall attack success rates (8% and 20%), while task-specific script replacement and attacker-provided generic script attacks remain substantially more effective, averaging 81-84% and 73% attack success, respectively. Gemini 3.8 Flash achieves the highest mean task score (0.877) while still exhibiting a 33% attack success rate. These results show that completing the requested task is not sufficient evidence of safe behavior: an agent can produce a correct deliverable while also performing an unauthorized action in the workspace.
[NLP-21] raining User Simulators with Latent Intrinsic Feedback
【速读】： 该论文旨在解决当前大语言模型（LLM）助手在多轮对话中难以有效捕捉真实用户隐含反馈的问题。现有用户模拟器（User Simulator）主要关注生成逼真的用户语句，却忽视了其作为直接评估助手响应质量的潜在价值——尤其是那些未通过显式语言表达、而是内嵌于用户内在推理过程中的隐性评价信号。本文提出一种具备内在反馈（intrinsic feedback）的用户模拟器，其关键在于引入了基于第一人称视角的隐式评估状态，包括内部思考（internal thoughts）、反应（reactions）及标量评分（scalar ratings），这些状态在每一轮对话中对助手表现进行动态评估。通过利用真实用户与助手的交互日志训练此类模拟器，实验表明，该方法显著提升了模拟的真实性与批判性行为能力，优于依赖提示工程的基线模型；同时，它能提供现有微调型模拟器所缺失的逐轮评估信号。此外，由该模型生成的评估结果与人类判断的相关性更高。更重要的是，这类模拟器能够作为高效奖励信号用于多轮强化学习（RL）训练，在不依赖外部判别模型的前提下，实现与传统依赖外部判别器设置相当的性能，同时将强化学习所需的计算开销减少超过一半。
链接: https://arxiv.org/abs/2610.13617
作者: Tarek Naous,Craig Boutilier,Wei Xu,Ofer Meshi
机构: Georgia Institute of Technology(佐治亚理工学院); \thepa
类目: Computation and Language (cs.CL)
备注:
Abstract:User simulators are gaining attention as environments to train LLM assistants that can better cope with the nuances of multi-turn conversations with real users. Prior work on user simulation has emphasized generating realistic user utterances, leaving unexplored their potential as a source of direct feedback on the assistant’s responses. Such evaluation signals may not be explicitly communicated in language, but can instead reside in the latent reasoning of users. In this work, we introduce user simulators with intrinsic feedback, namely, models equipped with latent evaluation states: internal thoughts, reactions, and scalar ratings that evaluate the assistant from a first-person user perspective at each conversation turn. We train LLM-based simulators using interaction logs between real users and assistants and demonstrate that intrinsic feedback improves simulation realism and critiquing behaviors versus prompted simulator baselines, while also providing turn-level evaluations that existing fine-tuned simulators lack. Further, evaluations generated by our trained simulators correlate better with human judgments than those of prompted simulators of the same size. Lastly, our experiments reveal that simulators with intrinsic feedback provide effective reward signals for multi-turn RL training, matching setups that rely on external judge LLMs for rewards while cutting RL compute by more than half.
[NLP-22] BLiMPPI: Benchmark of Linguistic Minimal Pairs for Polarity Items
【速读】： 该论文旨在解决语言模型在负极性项（Negative Polarity Items, NPIs）理解方面存在的多语言评估缺失问题，尤其是针对非英语语言中NPI的语法合法性与语义许可环境建模能力不足。现有研究几乎局限于英语，而实际语言中NPI的分布受句法与语义双重制约，具有高度的语言多样性。为此，作者提出了BLiMPPI——一个涵盖33种语言、超过12,000组NPI最小对比对的多语言评估基准，其构建基于通用依存树库（Universal Dependencies, UD）的自动化流水线，能够自动发现各语言中的NPI、标注其许可环境，并通过最小扰动生成可比性测试样本。关键解决方案在于：利用大规模跨语言依存结构数据自动生成标准化、可比较的NPI测试集，从而系统评估语言模型在不同语言类型、语言家族、许可机制变异性和NPI-许可成分距离等维度下的表现。实验表明，多语言模型在低资源语言及非n-gram可解的最小对比对上表现显著下降，揭示了当前模型在深层语义与句法交互建模上的局限性。
链接: https://arxiv.org/abs/2610.13607
作者: Arzu Burcu Güven,Anna Rogers,Leonie Weissweiler,Joakim Nivre,Rob van der Goot
机构: IT University of Copenhagen(哥本哈根信息技术大学); Leipzig University(莱比锡大学); ScaDS.AI Dresden/Leipzig(萨克森数据科学中心德累斯顿/莱比锡); Uppsala University(乌普萨拉大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Negative polarity items (NPIs), such as “anymore” and “ever”, are grammatical only in select environments, predominantly in the context of negation. Because their grammaticality depends on both syntax and semantics, they have a rich, multilingual literature in theoretical linguistics, yet work on NPIs in language models is almost entirely confined to English. We introduce BLiMPPI, a multilingual evaluation suite of over 12,000 NPI minimal pairs in 33 languages, built by a pipeline that discovers NPIs in Universal Dependencies (UD) treebanks, labels their licensing environments, and perturbs these into minimal pairs. Evaluating 12 multilingual and 2 monolingual models alongside n-gram baselines, we find that multilingual models struggle most with lower-resource languages and with pairs that are not n-gram solvable. We further examine the effects of NPI typology, language family, licensing variability, and NPI-licenser distance. Data: this https URL
[NLP-23] zip2zip: Towards Inference-Time Token Compression with Minimal Quality Loss
【速读】： 该论文旨在解决动态词汇表（dynamic vocabulary）通过Lempel-Ziv-Welch（LZW）压缩实现文本高效表示时，导致语言模型推理能力下降与困惑度（perplexity）升高的问题。以往研究认为这一质量损失是压缩的固有代价，但本文表明该差距并非不可逾越，可通过针对性优化压缩层与LZW编解码器来显著缓解，而无需修改预训练的语言模型本身。其解决方案的关键在于：（1）提出解耦的输入/输出动态嵌入层，以缓解LZW压缩过程中输入与输出嵌入之间的隐式冲突；（2）设计尺寸感知的旋转位置编码（size-aware RoPE），避免对跨多个原始标记的合并标记进行错误的位置信息处理；（3）引入支持选择性合并与多视角分段的改进型LZW编解码器，有效缓解特定词元（如数字）合并带来的下游任务准确率下降问题；（4）通过多视角分段机制应对动态词汇引入的固有分词歧义。实验结果表明，该方案在四个模型上均实现了所有语料上的困惑度降低，并显著提升了数学推理准确性，在与未压缩基线相近的压缩比下，使“zip2zip”与基准之间的性能差距缩小约一半，标志着向无损自适应词汇压缩迈出了重要一步。
链接: https://arxiv.org/abs/2610.13605
作者: Saibo Geng,Andrea Gentilini,Xinxian Ma,Nathan Ranchin,Yunzhen Yao,Robert West
机构: EPFL(洛桑联邦理工学院); Technical University of Munich(慕尼黑工业大学); Zuse School ELIZA; ETH Zürich(苏黎世联邦理工学院)
类目: Computation and Language (cs.CL)
备注: 27 pages, 12 figures, 13 tables. Code: this https URL
Abstract:Dynamic vocabularies built on-the-fly via Lempel-Ziv-Welch (LZW) compression let a language model represent the same text in fewer tokens, but prior work shows that this efficiency comes at a cost to reasoning and perplexity. We show that this quality gap is not a fundamental price of compression but can be substantially closed through targeted improvements to the compression layer and LZW codec, without modifying the underlying pretrained language model. Our analysis reveals four key issues: (1) LZW’s compression algorithm creates an implicit conflict between the input embedding and the output embedding, a tension that a single shared embedding cannot resolve; (2) naively applying RoPE to LZW-compressed sequences ignores that merged tokens can span multiple tokens; (3) merging certain tokens (notably digits) disproportionately hurts downstream accuracy; and (4) dynamic vocabularies introduce an inherent segmentation ambiguity that confounds standard evaluation. We address these through decoupled input/output dynamic embedding layer, size-aware RoPE positioning, and a modified LZW codec supporting selective merges and multi-view segmentations. Across four models, our recipe improves perplexity on every corpus we evaluated as well as mathematical reasoning accuracy, closing roughly half the quality gap between zip2zip and the uncompressed baseline at a similar compression ratio on general text. This represents a significant step toward lossless adaptive-vocabulary compression for language models.
[NLP-24] Measuring Artifact Reliance in Machine-Generated Text Detectors EMNLP2026
【速读】： 该论文旨在解决当前生成式文本检测器在科学文献基准测试中表现优异的表面现象背后所隐藏的潜在问题：即这些高精度检测结果可能并非源于对文本语义或语言模式的真实区分能力，而是依赖于文档格式层面的伪造信号（如PDF提取产生的段落断裂差异）。其核心问题是现有检测器在评估时存在严重的格式偏差（format bias），导致其性能被人为夸大。解决方案的关键在于识别并消除这一偏差——通过引入“格式反事实”（format counterfactuals）来验证检测器是否真正学习了语言特征而非格式线索；同时提出在训练前对文本进行格式标准化（normalizing formatting），有效将模型在干净格式数据集上的泛化差距从0.32降至0.22，并显著提升跨域检测性能（出域宏F1由0.33提升至0.65）。实验表明，仅通过重新排版机器生成摘要而不改变内容，即可使主流检测器的正确判断率下降20%-27%，证明了格式特征是主要判别依据。
链接: https://arxiv.org/abs/2610.13583
作者: Anastasia Voznyuk,Andrey Grabovoy
机构: Advacheck OÜ(艾达查克公司); Tallinn, Estonia(塔林, 爱沙尼亚); Moscow State University(莫斯科国立大学); Moscow, Russia(莫斯科, 俄罗斯)
类目: Computation and Language (cs.CL)
备注: Accepted to DocInsights workshop at EMNLP 2026
Abstract:Detectors of machine-generated text score almost perfectly on scientific-literature benchmarks, implying we can reliably distinguish with these detectors human and machine-generated documents. We looked at ten scientific-document subsets from six popular resources, and on several of them that apparent ease is a side effect of how the documents were put together. A logistic regression using 27 superficial features reached 0.833-0.997 macro-F1, and on the three arXiv subsets it outperformed every detector we evaluate with F1-scores 0.951-0.997. The strongest cue to the detector is the PDF extraction artifact: human texts retain their original line breaks, whereas generated texts are extracted as a single block of prose. This cue, together with three other formatting features, tell the classes apart at 0.996 AUC. To distinguish benchmarks that contain such a signal from detectors that rely on one, we introduce format counterfactuals: just re-wrapping a machine-written abstract without changing a single word reverses 20-27% of a public detector’s correct decisions. Normalizing formatting before training reduces the generalization gap from 0.32 to 0.22. On format-clean benchmarks, it also raises out-of-domain macro-F1 from 0.33 to 0.65 for detectors trained on artifact-containing subsets.
[NLP-25] Not All Correct Fixes Run Alike: An Empirical Study of Patch Performance in Repository-Level Issue Resolution
【速读】： 该论文旨在解决现有仓库级问题修复评估基准（如SWE-bench）仅关注补丁是否通过正确性测试，而忽视了通过测试的补丁在运行时性能上的差异这一关键问题。其核心解决方案在于：利用基准中已有的、用于验证修复效果的内置失败转通过（FAIL_TO_PASS, F2P）测试用例，作为评估补丁运行时性能的自然负载，从而避免为每个实例单独设计性能测试的工作量。研究选取了四种前沿大模型（Claude Opus 5、GPT 5.6、DeepSeek V4 Pro、Qwen 3.8 Max）与SWE-agent结合，在SWE-bench和SWE-bench-Live的可度量子集上生成多个正确修复方案，并基于原生F2P测试用例测量各补丁的指令计数与实际运行时间，采用更稳健的Welch ANOVA替代先前研究中的RSD作为统计判别标准。结果表明，该方法能有效识别近半数案例中不同补丁间的性能差异，且发现生成补丁的运行性能与大模型的修复成功率无直接关联，甚至呈现相反的模型排名；案例分析进一步揭示部分补丁存在架构退化问题，而此类缺陷在仅依赖正确性评估时被忽略。这些发现表明，仅以修复率为评价指标不足以全面刻画大模型在仓库级问题修复中的能力，未来评估应同步纳入运行性能维度。
链接: https://arxiv.org/abs/2610.13563
作者: Han Peng,Xing Hu,Feifei Niu,Huan Li,Xin Xia
机构: Zhejiang University (浙江大学); Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security (杭州高新区（滨江）区块链与数据安全研究院); Graz University of Technology (格拉茨工业大学)
类目: oftware Engineering (cs.SE); Computation and Language (cs.CL)
备注:
Abstract:Repository-level issue-resolution benchmarks such as SWE-bench evaluate submitted patches primarily based on whether they pass the correctness tests, leaving the runtime performance of different test-passing patches largely unexplored. Evaluating patch performance is essential but challenging since designing performance workloads for each benchmark instance is costly. However, these benchmarks already provide a natural candidate: the built-in \emphFAIL_TO_PASS (F2P) tests, which exercise the behavior affected by the issue fix. We therefore investigate whether the provided F2P tests can be repurposed to evaluate patch performance. Overall, we choose four frontier models, Claude Opus~5, GPT~5.6, DeepSeek V4 Pro, and Qwen~3.8 Max, paired with SWE-agent to resolve the pre-filtered measurable corpus from verified splits of SWE-bench and SWE-bench-Live, yielding 262 cases with at least two different correct solutions, including the developer ground-truth patch. We then measure each solution’s runtime performance in instruction count and wall-clock time on the native F2P test, and use Welch ANOVA instead of the RSD proposed in prior work as a more robust statistical discrimination criterion. We find that this methodology exhibits notable discrimination capability in runtime performance and identifies performance differences among patches in almost half of the instances. Our empirical study shows that the runtime performance of generated patches is independent of the issue resolution rate of LLMs, with nearly reversed model rankings. The case study also shows that the performance analysis reveals architectural regression in some patches that the correctness evaluation overlooked. These findings suggest that resolution rate does not adequately characterize LLMs’ capability for repository-level issue resolution, motivating future evaluations to consider patch performance alongside it.
[NLP-26] Personalization Without Stereotyping: Do Speech LLM s Know When to Turn a Deaf Ear?
【速读】： 该论文旨在解决生成式语音大模型（Speech LLMs）在感知语音中非语言线索（paralinguistic cues）时可能引发的刻板印象问题。现有评估方法通常仅关注不同群体间的性能差异，未能有效区分有益的个性化响应与有害的刻板化行为。为此，论文提出BASIS-Bench基准，通过三个维度对模型行为进行解耦分析：（1）人口统计鲁棒性，衡量模型在基于内容的任务和人口统计分类任务中的群体差异；（2）刻板偏见，检测模型是否在感知到人口统计线索后产生未经提示的刻板反应；（3）个性化能力，评估模型在明确请求下能否适当地根据人口统计特征调整回应。实验评估八种近期语音大模型发现，尽管多数模型能识别人口统计线索，却难以将其转化为恰当的个性化响应；显式的人口统计标签虽提升个性化表现，但也放大了文本基座中存在的刻板关联。研究结果表明，训练语音大模型不仅需具备感知人口统计线索的能力，更需学会在何时以及如何依据这些线索调整行为，以避免无意识地强化社会偏见。
链接: https://arxiv.org/abs/2610.13550
作者: Kshitij Ambilduke,Caroline Brun,Thibaut Thonet,Vassilina Nikoulina,Marcely Zanon Boito
机构: Naver Labs Europe(耐伯实验室欧洲)
类目: Computation and Language (cs.CL)
备注:
Abstract:Recent speech LLMs can leverage rich paralinguistic cues, enabling more complex and personalized interactions. However, little work investigates how this sensitivity can lead to stereotyping, and existing evaluations largely measure demographic disparities without distinguishing beneficial personalization from stereotypical behavior. We introduce BASIS-Bench, a benchmark designed to disentangle these two aspects through three axes: (1) demographic robustness, measuring disparities in content-based tasks across speakers and demographic classification capabilities; (2) stereotypical bias, measuring whether perceived demographic cues trigger unprompted stereotypical behavior; and (3) personalization, measuring whether models can tailor responses to demographic characteristics when explicitly requested. We evaluate eight recent speech LLMs and find that, despite often recognizing demographic cues, most fail to translate them into appropriate personalization. Explicit demographic labels improve personalization but also amplify stereotypical associations already present in the textual backbones. These findings highlight the need to train speech LLMs not only to perceive demographic cues, but to learn when they should shape their responses.
[NLP-27] S-Space: Exploring Spatial Workspace in Multimodal Language Models
【速读】： 该论文旨在解决多模态语言模型（Multimodal Language Models, MLLMs）在空间推理能力背后的内在机制不明确的问题。其核心发现是揭示了名为S-Space的线性表示子空间，该空间中物体-标记（object-token）表示编码了水平、垂直及距离轴上的连续坐标信息。尽管这些坐标轴通过区分空间回答得分与物体-标记激活之间的梯度关系被识别，但S-Space具有内在性而非依赖特定数据或提示生成，即使在非空间问题下仍保持可读性。研究证明S-Space构成了MLLMs内部的空间工作区：感知模块将物体位置编码至其中，形成可直接读取以支持准确空间判断的空间表征；内部推理过程则对S-Space进行视角变换操作；而语言输出选择性地访问该空间，因果干预实验显示其仅改变空间判断而基本维持非空间响应不变。案例研究进一步表明，S-Space能够为未见实体和观察者分配位置，并将物理方向与抽象语言意义相连接，揭示了大规模语言训练在空间认知上的优势与局限。最后，作者利用S-Space作为诊断工具分析空间推理失败现象，发现方向词读出揭示了绝对方向与图像相对参考系间的系统性耦合；更重要的是，感知-计算分解暴露了一个关键瓶颈：尽管MLLMs能构建有效空间表征，但在跨视角变化下的空间变换能力仍不足，导致推理可靠性受限。
链接: https://arxiv.org/abs/2610.13527
作者: Zhiyuan Shi,Xiang Li,Xingzhuo Guo,Shangchen Miao,Weiliang Chen,Qiyu Dai,Jinshan Ren,Jiangran Lyu,Fangfu Liu,Mingsheng Long,Jialong Wu
机构: 未知
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: Project Page: this https URL
Abstract:Multimodal language models (MLLMs) exhibit promising spatial reasoning capabilities, yet the internal mechanisms supporting them remain poorly understood. We uncover S-Space, a linear representation subspace in which object-token representations encode continuous coordinates along horizontal, vertical, and distance axes. Although we identify these axes by differentiating spatial-answer scores with respect to object-token activations, S-Space is intrinsic rather than induced by specific data or prompts, remaining readable under non-spatial questions. We show that S-Space functions as an internal spatial workspace of MLLMs. Perception encodes object locations into it, forming spatial representations that can be directly read out to support accurate spatial judgments. Internal reasoning transforms it for changing viewpoints. Verbal responses selectively access it, evidenced by causal interventions that alter spatial judgments while largely preserving non-spatial responses. Case studies further show that S-Space assigns locations to unseen entities and the observer, and connects physical directions with abstract linguistic meanings, suggesting both the capabilities and limitations of large-scale language training. Finally, we use S-Space as a diagnostic tool for spatial reasoning failures. Direction-word readouts reveal systematic coupling between cardinal and image-relative reference frames. More importantly, a perception-computation decomposition exposes a key bottleneck: MLLMs can form capable spatial representations, yet fall short in the spatial transformations required to reason reliably across viewpoint changes.
[NLP-28] Retrieval-Augmented Multimodal Language Model with Heterogeneous Evidence Integration for Clinical Prognosis
【速读】： 该论文旨在解决临床预后预测中多源异构数据融合的难题，即如何有效整合结构化测量值、生理波形（如心电图，ECG）、纵向病史以及人群上下文信息以提升预测性能。其核心挑战在于如何在不泄露个体敏感数据的前提下，实现对历史就诊记录的语义级检索与联合建模。解决方案的关键在于提出一种名为PRISM（Population-Retrieved Inference for Structured Multimodal Prognosis）的多模态语言模型，其创新性体现在三个方面：一是采用逐特征数值标记化（per-feature numerical tokenization）将结构化电子健康记录（EHR）转化为可处理的序列表示；二是通过基于时间衰减权重的纵向心电图聚合机制，捕捉动态生理变化；三是构建双模态人群记忆库（dual-modality population memory bank），在表征空间中进行无原始记录暴露的检索式知识增强。该方法在1,443个任务的MDS-ED基准上取得了优异表现，尤其在未到达窗口期内（96小时）即可实现高达93.1%的恶化预测AUROC。消融实验表明，真实检索相比随机邻居检索带来0.97点的宏平均增益，且数值编码优于文本序列化，凸显了结构感知建模的重要性。此外，在外部MC-MED队列上的监督微调结果进一步验证了模型通过外部适应实现泛化的能力。
链接: https://arxiv.org/abs/2610.13510
作者: Hamza Shafiq,Jialu Tang,Ting Dang,Jun Hu,Aaqib Saeed
机构: Eindhoven University of Technology(埃因霍温理工大学); University of Melbourne(墨尔本大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Clinical prognosis requires integrating structured measurements, physiological waveforms, longitudinal history, and population context. We introduce PRISM (Population-Retrieved Inference for Structured Multimodal Prognosis), a multimodal language model that combines per-feature numerical tokenization, recency-weighted aggregation of longitudinal ECGs, and a dual-modality population memory bank. Retrieval operates in representation space: the model receives mean-pooled embeddings of similar training-cohort encounters, while no individual retrieved record enters the prompt. On the 1,443-task MDS-ED benchmark, PRISM achieves AUROCs of 86.2% for diagnosis, 93.1% for deterioration, 91.8% for ICU admission, and 92.8% for mortality. These results use a 96-hour pre-arrival window unavailable to reported baselines. With benchmark-window inputs only, PRISM reaches 0.8895 AUROC, compared with 0.8937 for UniPACT and 0.8889 for MDS-ED. A matched-input compact fusion model using the same five evidence streams and frozen encoders reaches 0.7652 AUROC, versus 0.9092 for PRISM. Replacing numerical EHR encoding with text serialization reduces AUROC by 3.66 points; removing pre-arrival history reduces it by 1.97 points; and zeroing retrieval reduces it by 0.99 points. Genuine retrieval outperforms random-neighbor retrieval by 0.97 macro-average points, although a paired task-level sign test does not establish a uniform advantage (p=0.067). On the external MC-MED cohort, supervised fine-tuning reaches 0.8611 AUROC, compared with 0.8227 for locally trained gradient boosting and 0.7841 for source-only PRISM. These results support structure-aware multimodal integration and supervised external adaptation.
[NLP-29] Proactive Agent ic Orchestration
【速读】： 该论文旨在解决现有生成式智能体（Agentic）编排方法在执行灵活性与优化效率方面的双重瓶颈：一方面，传统方法在创建时固定子智能体的目标与资源调用方式，难以适应动态变化的真实环境；另一方面，由于反馈稀疏且延迟，导致编排策略的有效学习受限。为此，论文提出一种实时主动式智能体编排框架POrchestra，其核心创新在于允许子智能体在任意逻辑节点主动与编排器通信，请求调整资源调用配置，同时保持本地执行的连续性。这一机制不仅增强了智能体对动态环境的自适应能力，还自然催生了基于事后反馈的在策略编排蒸馏（On-Policy Orchestration Distillation, OPOD）方法——通过将子智能体的主动修正请求回溯至先前的编排决策，生成针对性的优化信号，并结合最终奖励作为过程监督信号，共同优化编排策略。实验表明，POrchestra在三个长周期任务基准（涵盖深度科研、动态数字助手和软件工程）上相较最强基线平均提升任务成功率9.1%；结合OPOD后，小规模编排器的成功率平均提升达10.0%，且实现了更优的成本-性能权衡。
链接: https://arxiv.org/abs/2610.13485
作者: Xueyang Feng,Chaozhuo Li,Xiaohe Bo,Jiakai Tang,Chenxi Li,Qiwei Ye,Xu Chen
机构: Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学高瓴人工智能学院); The Chinese University of Hong Kong Shenzhen(香港中文大学（深圳）); Beijing Academy of Artificial Intelligence(北京智谱人工智能研究院)
类目: Computation and Language (cs.CL)
备注: 41 pages including references and appendices, 11 figures. Code: this https URL
Abstract:Agentic orchestration delegates tasks to sub-agents with independent contexts, providing a key path to extending the effective execution horizon of large language model agents. However, existing orchestration methods face two limitations: in execution, current methods fix sub-agents’ goals and harnesses at creation time, limiting their adaptability to dynamic real-world environments; in optimization, sparse and delayed feedback constrains effective learning of the orchestration policy. To address these limitations, we introduce POrchestra, an on-the-fly proactive agentic orchestration framework. It allows sub-agents to proactively communicate with the orchestrator at any logical point to request harness adjustments while maintaining continuity of local execution. This mechanism not only enables sub-agents to adapt seamlessly to dynamic environments but also naturally inspires On-Policy Orchestration Distillation (OPOD) based on hindsight feedback. OPOD attributes sub-agents’ proactive revision requests back to preceding orchestration decisions to derive targeted improvement signals, and leverages these signals as process supervision alongside the final reward to optimize the orchestration policy. We evaluate POrchestra on three long-horizon agent benchmarks spanning deep research, dynamic digital assistance, and software engineering. POrchestra improves task success by an average of 9.1% relative to the strongest baseline; combined with OPOD, it improves small-orchestrator success by an average of 10.0% relative to existing training baselines. POrchestra also achieves a more favorable cost-performance trade-off. Our code is publicly available at this https URL.
[NLP-30] A Better Metric Will Not Save You: What You Compare Beats How You Compare It
【速读】： 该论文旨在解决在神经表征相似性分析中，由于先验条件设定（如输入选择与分组方式）对结果可比性造成不可忽视影响的问题。现有代表性相似性度量方法（如RSA、CKA、Procrustes）均依赖于固定的条件集，而该条件集由两个在矩阵运算前即已确定的决策决定：哪些输入被纳入分析，以及如何对输入进行分组。由于这些决策缺乏不变性（invariance）属性，其选择会显著干扰最终的相似性评估结果。研究通过跨15种语言和27种表征模型的元音声学组织结构这一已知独立基准，验证了当比较的类别固定但种类变化时，模型间排名差异的变化幅度超过所测效应的两倍；而当类别数量改变时，排名则无明显变化。这表明，在特定条件下模型排名具有可识别性，但跨语言的排名一致性无法成立，揭示了当前度量方法在跨语言、跨系统比较中的根本局限性。解决方案的关键在于认识到：必须将条件设定本身作为可变因素纳入评估框架，而非视为固定前提，从而重新审视相似性度量的有效性边界。
链接: https://arxiv.org/abs/2610.13476
作者: Noureddine Khaous(LLF - UMR7110, UPCité),Guillaume Wisniewski(LLF - UMR7110, UPCité)
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Representational similarity measures (RSA, CKA, Procrustes) are chosen for the transformations they treat as irrelevant, and all of them take the set of conditions as given. That set is fixed by two decisions, which inputs are admitted and how they are grouped, both taken before the matrix a measure operates on exists: no invariance property reaches them. We measure what they are worth where the arrangement the conditions ought to have is known independently of the systems compared, the acoustic organisation of vowels, across fifteen languages and twenty-seven representations. Changing which categories are compared, at a fixed number of them, moves the gap between two representations by more than twice the effect being measured, while changing how many moves it not at all. In this setting rankings of models are identified under these choices, and rankings across languages are not.
[NLP-31] owards Enriching Design-Time Models with Evidence from Simulation and Operational Activities
【速读】： 该论文旨在解决嵌入式物理系统（Cyber-Physical Systems, CPS）在设计、仿真与运行过程中，系统执行结果所揭示的设计知识缺失、不确定或无效等问题难以显式地回流至设计阶段模型的挑战。其核心问题是：当前从运行与仿真中获取的证据难以系统性地转化为可持久化的设计知识，导致设计迭代缺乏有效反馈。解决方案的关键在于提出一种基于证据的流程（evidence-driven workflow），通过将仿真与运行阶段产生的实证数据结构化地回传至设计时模型（design-time models），实现对设计知识的持续丰富。以“跟随标志的机器人”用例为例，该流程通过仿真证据支持影响模型（Influence Model）中的参与者剪枝决策、交互特征刻画、影响函数抽象以及有效性范围信息的补充，从而提升设计阶段的推理能力，并为后续开发迭代提供更高质量的反馈依据。
链接: https://arxiv.org/abs/2610.13456
作者: Barbara da Silva Oliveira(UniCA, Laboratoire I3S - COMRED, KAIROS),Julien Deantoni(UniCA, Laboratoire I3S - COMRED, KAIROS),Nicolas Ferry(UniCA, Laboratoire I3S - COMRED, KAIROS)
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Cyber-Physical Systems are developed through multiple model based activities, comprising several stages of development. As the development progresses through simulation, experimentation, and operation, observations of system execution may reveal missing, uncertain, or invalid design knowledge. The path from execution results to persistent design-time enrichment, however, is often implicit. This paper addresses this challenge by proposing an evidence driven workflow for systematically transferring knowledge produced during simulation and operation back into design-time models. We demonstrate the workflow using an Influence Model, a design-time artefact used to represent how design artefacts and environmental factors jointly affect system response properties, using a sign-following robot use case. We show how simulation evidence can enrich Influence Models by supporting participant pruning decisions, interaction characterisation, influence-function abstraction, and validity-scope information. The application demonstrates the feasibility of the workflow for simulation-based evidence and its potential benefits to improve design-time reasoning and feedback in subsequent development iterations.
[NLP-32] Oído: Open-Vocabulary Speech Recognition on a 5 Microcontroller without a Neural Accelerator
【速读】： 该论文旨在解决在资源受限的低功耗微控制器（如ESP32-S3）上实现全词汇表（open-vocabulary）英语语音识别的难题，传统方法仅能支持关键词检测或固定命令列表。其核心解决方案是提出Oído推理引擎，通过在无神经网络加速器的ESP32-S3芯片上高效运行一个1300万参数的Conformer-CTC模型，采用int8权重、每帧动态int8激活以及int8注意力计算，并充分利用芯片的SIMD指令集与针对闪存（flash）和PSRAM带宽优化的调度策略。该方案在LibriSpeech测试集上实现了3.70%/8.23%的词错误率（WER），接近全精度性能（仅差0.12点），并可集成130万参数的片上语言模型进一步降至3.33%/7.15%。使用转换器头结构可达到2.99%/6.67%的更优结果，而int4量化版本仅需8.3 MB存储空间。实测表明，该系统在物理板卡上的推理速度为音频时长的1.97倍，虽未达到实时性（4秒指令需约8.7秒完成转录），但输出文本与指令级精确模拟器一致，具有高准确性；同时，流式版本可在说话过程中逐步输出部分文本，最终文本延迟为4.1–11.1秒（语句模式下为7.2–22.4秒），在真实噪声与混响环境下表现优于Whisper tiny及Moonshine tiny等主流模型。关键创新在于对嵌入式设备内存与计算瓶颈的深度优化，使端侧全词汇表语音识别成为可能。
链接: https://arxiv.org/abs/2610.13447
作者: Daniel Varela Sánchez,Guillermo Martín-Coello Juárez
机构: Lokutor (Hashing Works, S.L.L.), Madrid, Spain
类目: ound (cs.SD); Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
备注: 11 pages. Code, models and raw board measurements: this https URL
Abstract:Speech recognition on low-cost microcontrollers is, in practice, limited to keyword spotting or a fixed list of commands. We present Oído, an inference engine that runs open-vocabulary English speech recognition entirely on an ESP32-S3 (240 MHz dual-core Xtensa LX7, 512 KB of SRAM, 8 MB of PSRAM, 16 MB of flash, no neural accelerator). Oído executes a 13M-parameter Conformer-CTC model with int8 weights, per-frame dynamic int8 activations and int8 attention on the chip’s SIMD instructions, with a schedule designed around flash and PSRAM bandwidth. On LibriSpeech test-clean/test-other the on-device arithmetic reaches 3.70%/8.23% word error rate (WER), within 0.12 points of full precision, and 3.33%/7.15% with an on-chip 1.3M-parameter language model; a transducer head gives 2.99%/6.67% and an int4 variant fits in 8.3 MB. This is 2.3-2.8x fewer errors than the vendor’s recognizer on the same chip, and fewer than Whisper this http URL and Moonshine tiny in full precision on a laptop, including in real noise and reverberation. Measured on a physical board, the firmware runs at 1.97x the duration of the audio on one core, with transcripts identical to an instruction-exact emulator: accurate, but not yet real time (a 4 s command is transcribed about 8.7 s after it ends). The two-core schedule gives wrong results on silicon and is disabled. A streaming variant shows partial text while the speaker talks and delivers the final text 4.1-11.1 s after clips of 3.6-10.6 s (7.2-22.4 s in utterance mode) at 4.86%/11.03% WER; a Spanish model makes 34-60% fewer errors than multilingual Whisper tiny. Code and models are released.
[NLP-33] owards the Roof of the World: NLP Progress in Tibetan Languages AACL ACL
【速读】： 该论文旨在解决藏语在自然语言处理（Natural Language Processing, NLP）领域长期处于低资源、研究不均衡的现状问题。其核心挑战在于藏语所面临的复杂书写系统、方言多样性以及地理偏远等多重制约因素，导致相关研究进展缓慢且分布不均。论文提出的关键解决方案是构建一个覆盖从语料库、分词、语音到大语言模型（Large Language Models, LLMs）全链条的系统性研究范式，这一范式以中国研究人员为主导，推动了近十年来藏语NLP研究的快速扩展。研究发现，84%的成果集中于2018年之后，且研究范围已由底层文本处理逐步延伸至高阶应用与大模型开发。然而，仍存在方言覆盖不足、负责任的NLP实践缺失、本土化与可比性评估缺乏、跨社区可见性低及资源公开率偏低（仅29%发布数据、代码或模型）等问题。为此，论文倡导在大语言模型时代推进开放科学、建立共享标准并加强社区参与，为全球南方其他低资源语言提供可借鉴的发展路径。
链接: https://arxiv.org/abs/2610.13398
作者: Xi Cao,Yijie Li,Yuan Sun,Shiwei Dong,Zeguang Huang,Nuo Qun
机构: Minzu University of China (中央民族大学); Xizang University (西藏大学); The State Key Laboratory of Tibetan Intelligence (藏语智能技术国家重点实验室)
类目: Computation and Language (cs.CL)
备注: Camera-Ready Version; Accepted at ACL Findings: AACL-IJCNLP 2026
Abstract:Tibetan, spoken by some seven million people on and around the Qinghai-Xizang Plateau, remains underrepresented in natural language processing (NLP). We present, to our knowledge, the first peer-reviewed systematic bibliometric survey of Tibetan NLP: 140 publications from 2004 to 2026 in the ACL Anthology and DBLP, annotated for venue type, research area, first-affiliation country, and resource release. Output has grown rapidly, with 84% of the publications appearing since 2018, and has expanded bottom-up along the NLP pipeline, from corpora and word segmentation through script, speech, and applications to large language models (LLMs). Researchers based in China first-authored 87% of the publications, which span all 25 represented research areas, whereas work from other countries concentrates on Classical Tibetan. We argue that this full-pipeline paradigm, realized under the compounded constraints of a complex script, dialectal diversity, and geographic remoteness, offers a reference model for other low-resource languages of the Global South. We also identify gaps in dialect coverage, responsible NLP, native and comparable evaluation, cross-community visibility, and resource release (only 29% of the publications release data, code, or models), and recommend open science, shared standards, and community participation for the LLM era.
[NLP-34] ProgramGym: Scaling Training Environments for Long-Horizon Program Reproduction Agents
【速读】： 该论文旨在解决生成式代码代理（Coding Agent）在长周期程序复现任务中面临的两大核心挑战：一是缺乏可扩展且可验证的训练环境，导致代理难以自主发现需求并设计系统架构；二是现有工作流无法支持代理在实现前对参考程序进行充分探索，限制了其长期开发能力。为应对这些问题，论文提出ProgramGym框架，其关键在于构建一个基于反馈驱动的闭环机制（Program-Env），通过修复运行时沙箱构建失败及黑盒测试质量，从真实代码库中生成1,648个涵盖C、C++、Go和Rust的可验证训练环境。同时，Program-Agent采用角色隔离的工作流（分析、实现、评审）结合版本管理机制，实现编译检查与故障恢复，支持长周期开发中的迭代优化。实验表明，该框架显著提升代码复现性能，使Qwen3.8-27B模型在ProgramBench上的表现从34.87%提升至42.84%，而经优化后的基线与微调模型分别达到55.71%和56.25%，超越部分主流模型。
链接: https://arxiv.org/abs/2610.13395
作者: Chengyi Yang,Renxu Bao,Jue Hou,Zongpei Teng,Ziheng Wang,Yujie Lin,Chengsong Huang,Junnan Zhu,Delai Qiu,Yining Wang,Shengping Liu,Fei Long,Jinsong Su
机构: Xiamen University(厦门大学); Washington University in St. Louis(圣路易斯华盛顿大学); Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所); Unisound(云知声)
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Coding agents are increasingly used to build programs from scratch as software engineers do rather than to resolve issues within a repository or to generate a repository from a given requirements document. However, scalable verifiable training environments that force agents to discover what is required and to decide how the system should be designed remain scarce. Moreover, existing agent workflows also cannot sustain long-horizon development in which the agent explores the reference program before implementation. To address these challenges, we introduce ProgramGym, a framework consisting of Program-Env and Program-Agent for scalable training environments of long-horizon program reproduction agents. Specifically, Program-Env constructs verifiable training environments from repositories through a feedback-driven loop that repairs runtime sandbox builds and the quality of black-box tests. Using this novel pipeline, we obtain 1,648 training environments spanning C, C++, Go, and Rust. Program-Agent combines a role-isolated workflow of analysis, implementation, and review with revision management for compilation checks and failure recovery. Experiments on ProgramBench show that both Program-Env and Program-Agent improve performance on program reproduction. Fine-tuning on trajectories with these constructed environments raises the performance of Qwen3.8-27B from 34.87% to 42.84%. Program-Agent further raises the base and SFT models to 55.71% and 56.25%, both exceeding some flagship models. We will release the ProgramGym to support further research on coding agents that build programs from scratch.
[NLP-35] MoPrO-SD: Modular Prompt Optimization for Stance Detection
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在立场检测（Stance Detection）任务中面临的挑战，尤其是隐含观点、反语以及依赖上下文的立场表达等问题。现有自动提示优化方法虽可避免参数微调，但其结构化设计未充分考虑立场标签语义及类别特异性歧义。为此，作者提出一种面向立场检测的提示优化框架MoPrO-SD，其核心在于将提示分解为功能性的语义模块，并基于大语言模型生成的反馈进行分步优化。关键创新点包括：引入三类优化策略——仅指令优化（I）、带推理的指令优化（I+R），以及针对每个样本的推理优化（I+R+E），并利用类别条件误差指导立场标签的精细化修正。此外，研究构建了VaccineStance这一新的高质量人工标注基准数据集。实验结果表明，MoPrO-SD在多个数据集与五种开源大模型上均优于原始人工编写提示，在多数场景下显著提升平均宏F1值；尤其在SemEval-2016数据集上，类别条件反馈相比全局反馈表现更优。推理增强策略（I+R与I+R+E）整体性能优异，且效果随模型和数据集变化而异，但仍保持对最新提示优化方法的竞争力。
链接: https://arxiv.org/abs/2610.13386
作者: Meysam Sabbaghan,Nikesh Gyawali,Arman Zareian Jahromi,Sebastian Loera-Lozano,Doina Caragea,Cornelia Caragea
机构: Kansas State University (堪萨斯州立大学); University of Illinois Chicago (伊利诺伊大学芝加哥分校)
类目: Computation and Language (cs.CL)
备注:
Abstract:Stance detection remains challenging for large language models (LLMs) due to implicit opinions, sarcasm, and context-dependent expressions of stance. Although automatic prompt optimization offers an alternative to fine-tuning without updating model parameters, existing structured approaches are not specifically designed around stance-label semantics and class-specific ambiguities. We introduce MoPrO-SD, a stance-specific prompt optimization framework that decomposes prompts into functional semantic modules and refines them sequentially using LLM-based feedback. We study three refinement strategies: instruction-only optimization (I), instruction with reasoning (I+R), and instruction with per-example reasoning (I+R+E), using class-conditioned errors for stance-label refinement. We also introduce VaccineStance, a new human-annotated benchmark for vaccine stance detection. Experiments across four datasets and five open-weight LLMs show that MoPrO-SD improves upon the human-written Base prompt in many settings. On SemEval-2016, class-conditioned feedback achieves higher mean Macro-F1 than pooled feedback for four of five backbones. Both reasoning-based strategies, I+R and I+R+E, achieve strong performance, with their relative effectiveness varying across models and datasets, while remaining competitive with recent prompt optimization methods. The MoPrO-SD code and VaccineStance dataset are available on GitHub.
[NLP-36] From Structure to Validity: Mechanism-Guided Generation and Refinement of LLM Rubrics ICLR2027
【速读】： 该论文旨在解决现有评分标准（rubric）设计缺乏系统性理解与有效优化机制的问题，尤其在开放式任务中，尽管评分标准被广泛用于评估和优化语言模型，但当前研究多集中于生成更优的评分标准，而对何种设计要素真正影响评分标准的有效性缺乏深入认知。其解决方案的关键在于通过系统的机制分析，揭示评分标准在准则组织结构、准则操作化及得分聚合三个维度上的关键作用：结构化组织有助于更全面地构建准则，仅依赖语义定义不足以保证准则层面的判断有效性，而复杂的得分聚合策略带来的增益有限。基于此，作者提出自适应评分树搜索与混合精炼方法（ARTS-Hybrid），融合自适应树形结构构建与以语义为导向、响应校准的双重精炼机制，显著提升了端到端评估性能与评分标准内在质量。实验表明，ARTS-Hybrid生成的评分标准不仅在评估任务中表现更优，还能为语言模型优化提供有效信号。
链接: https://arxiv.org/abs/2610.13375
作者: Feifei Qian,Xuan Chen,Lixin Cui,Chaoyang Mei,Fanlin Meng,Shuyao Xiao,Ming Cui,Junxi Yin,Lu Bai
机构: Beijing Normal University (北京师范大学); KE Holdings Inc. (贝壳找房公司); Central University of Finance and Economics (中央财经大学)
类目: Computation and Language (cs.CL)
备注: Submitted to ICLR 2027
Abstract:Rubrics have been widely used to evaluate and optimize language models on open-ended tasks. However, existing work primarily focuses on generating better rubrics, with limited understanding of what makes rubric design effective. In this work, we conduct a systematic mechanistic analysis of rubric design across criterion organization, criterion operationalization, and score aggregation. Our analysis shows that structural organization enables more comprehensive criterion construction, semantic specification alone does not ensure effective criterion-level judgments, and sophisticated score aggregation provides limited additional gains. Guided by these findings, we introduce Adaptive Rubric Tree Search with Hybrid refinement (ARTS-Hybrid), which combines adaptive tree construction with semantic-first, response-calibrated refinement. Experiments across benchmarks show that ARTS-Hybrid improves both end-to-end evaluation performance and intrinsic rubric quality. Further experiments suggest that, beyond evaluation, rubrics generated by ARTS-Hybrid provide effective signals for model optimization.
[NLP-37] Overcoming Data Imbalances with Expert Selection Biases
【速读】： 该论文旨在解决混合专家模型（Mixture-of-Experts, MoE）在面对类别数据不平衡时，少数类别（如低资源语言、特定模态或代码）因样本稀缺而无法获得充足专家容量分配的问题。其核心挑战在于，当训练数据在不同类别间分布不均时，少数类别的输入可能被集中于极少数专家或分散于大量专家中，导致其有效利用专家资源的能力受限。论文提出的解决方案关键在于引入基于输入类别的专家选择偏置（category-conditioned expert-selection biases），通过在专家路由过程中施加类别相关的软性引导，使来自不同类别的输入更倾向于被路由至与其匹配的专家子集。这一机制实现了类别的软对齐专业化（soft category-aligned specialization），既保留了跨类别共享能力，又在必要时支持专用专家池的形成。更重要的是，该方法可主动将更多专家容量倾斜分配给本易受数据稀缺影响的类别，从而显著提升其性能表现。实验表明，该策略在高达106亿参数的模型上有效提升了多模态、低资源语言及代码生成任务的表现，在最小与最大模型规模下分别相当于额外增加了18.5%和2.7%的基准训练数据量。总体而言，该方法以轻量级干预实现类别级别的专家容量调控，无需改变标准MoE推理流程，为低资源场景下的模型优化提供了高效可行的路径。
链接: https://arxiv.org/abs/2610.13370
作者: Ayush K. Tarun,Clara Meister,Antoine Bosselut
机构: EPFL(洛桑联邦理工学院)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:Mixture-of-Experts (MoE) models have become the standard architecture for frontier LLMs. The multiple parallel experts in each transformer block theoretically enable expert specialization according to categories such as domains, languages, or modalities during pretraining. However, when data is imbalanced across categories, minority categories can become concentrated in a small fraction of the expert pool or spread inefficiently across them, effectively limiting their available capacity. In this work, we demonstrate that category-conditioned expert-selection biases can preferentially route tokens from different categories toward specialized expert pools. By applying biases based on input category, we provide a simple way to induce soft category-aligned specialization. This intervention encourages categories toward distinct expert subsets while retaining cross-category sharing when useful. More importantly, it enables the over-allocation of expert capacity to categories that would otherwise be disadvantaged by data scarcity. We observe performance improvements across modalities, low-resource languages, and code in models up to 10.6B parameters. At our smallest and largest model scales, these gains are equivalent to allocating 18.5% and 2.7% additional baseline training tokens, respectively. Overall, our results show that expert biases can serve as a lightweight control for category-level expert allocation, making room for low-resource categories while retaining standard MoE inference.
[NLP-38] st-Time Memory Construction
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在处理长时交互历史时面临的挑战，即关键信息可能分散于遥远的对话片段中，而传统记忆系统因依赖离线构建和维护复杂的记忆表征，导致计算开销大且难以根据具体查询动态调整记忆结构。其解决方案的关键在于提出一种测试时记忆构建框架 T² Mem，该框架将记忆构建过程推迟至推理阶段，并在推理过程中逐步构建与查询相关的记忆。具体而言，T² Mem 在离线阶段仅提取轻量级的事件级元数据以捕捉关键事件和时间关联作为检索线索，同时保留与原始交互的链接，以支持跨会话依赖关系的重建；在测试时，大语言模型可自适应地检索并组织元数据与原始交互内容，随着推理过程的推进动态构建查询特定的记忆。实验结果表明，T² Mem 在 LoCoMo 与 LongMemEval 基准上均显著优于多个强基线方法，且大幅降低记忆构建的计算开销。进一步分析显示，将记忆构建延迟至推理阶段使记忆生成能够根据每个查询的信息需求实现动态适配。
链接: https://arxiv.org/abs/2610.13348
作者: Zijun Wang,Yifan Ji,Haidong Xin,Zhenghao Liu,Yukun Yan,Zulong Chen,Yu Gu,Ge Yu,Maosong Sun
机构: Northeastern University(东北大学); Tsinghua University(清华大学); Alibaba Group(阿里巴巴集团)
类目: Computation and Language (cs.CL)
备注:
Abstract:Large Language Models (LLMs) struggle to answer questions over long interaction histories, where relevant evidence may be scattered across distant sessions. Existing memory systems typically construct and maintain sophisticated memory representations offline, before user queries are observed, incurring substantial overhead and limiting their ability to adapt memory construction to query-specific information needs. In this paper, we propose T ^2 Mem, a Test-Time Memory construction framework that defers memory construction to inference and progressively builds memory along the reasoning process. Specifically, T ^2 Mem extracts lightweight episode-level metadata offline to capture key events and temporal associations as retrieval cues, while retaining links to the original interactions to facilitate the reconstruction of dependencies across episodes. At test time, the LLM adaptively retrieves and organizes metadata and raw interactions, progressively constructing query-specific memory as reasoning unfolds. Experiments on LoCoMo and LongMemEval show the effectiveness of T ^2 Mem by consistently outperforming strong baselines across different backbone LLMs while substantially reducing the overhead of memory construction. Further analysis demonstrates that deferring memory construction to inference enables the memory construction process to dynamically adapt to the information needs of individual queries. All code is available at this https URL.
[NLP-39] Exploring Attention Sinks in Text-to-Image Transformers from Diffusion and Autoregressive Models
【速读】： 该论文旨在解决文本到图像（T2I）Transformer模型中注意力分配机制不明确的问题，特别是关注“注意力黑洞”（attention sinks）——即某些令牌或位置持续接收远超其语义重要性的注意力权重——在双向扩散模型与因果自回归模型中的存在性、分布模式及其功能影响。其解决方案的关键在于通过系统性的注意力分析与针对性干预，揭示注意力黑洞在两类模型中的差异化表现：自回归模型中注意力集中于首令牌和全局尺度令牌，而双向模型则在模态边界、文本区域内部及空间角落形成注意力黑洞；这些现象具有层与头的稀疏性特征，并随生成阶段动态变化。进一步实验表明，扰动高排名注意力黑洞相关头可引发显著的生成性能变化，证实其功能相关性；同时引入注册令牌（register tokens）以重新分配注意力，部分配置可维持甚至轻微提升生成质量。研究结果表明，注意力黑洞是架构、推理阶段与组件依赖的现象，为理解与设计高效的文本到图像Transformer提供了机制基础与优化路径。
链接: https://arxiv.org/abs/2610.13337
作者: Binglei Li,Mengping Yang,Zhiyu Tan,Wenxu Qian,Junping Zhang,Hao Li
机构: Fudan University (复旦大学); Shanghai Innovation Institute (上海创新研究院); Shanghai Academy of AI for Science (上海人工智能科学研究院)
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL)
备注: 10 pages
Abstract:Attention sinks are tokens or positions that consistently receive disproportionate attention mass, often beyond what their semantic content would suggest. Despite extensive study in large language models, their behavior and functional relevance in text-to-image (T2I) Transformers remain largely unexplored. To fill this gap and better understand how text-to-image Transformers allocate and route attention, we explore this phenomenon of text-to-image transformers across bidirectional diffusion models and causal autoregressive models. Specifically, we explore whether attention sinks exist, where they emerge, and how they functionally influence generation. Through systematic attention analysis and targeted interventions, we identify that attention sinks emerge in both bidirectional diffusion and autoregressive models but exhibit distinct patterns. The autoregressive model concentrates attention on the first and global-scale tokens, whereas the bidirectional models develop sinks near modality boundaries, within text regions, and at spatial corners. Moreover, these patterns vary across generation stages and are localized to a sparse subset of layers and heads. To assess their functional relevance, we perturb sink-related heads and token positions. It turns out that perturbing sink-ranked heads produces larger average changes than non-sink comparisons, while some sink-position perturbations have limited effects on bidirectional model scores. We further introduce register tokens to redistribute attention sinks and find that several configurations preserve or modestly improve generation performance. Overall, attention sinks are architecture-, inference-stage-, and component-dependent phenomena, providing a basis for mechanistic analysis and principled attention design in text-to-image transformers.
[NLP-40] aking Tokenization off the Host for Agent ic LLM Serving
【速读】： 该论文旨在解决生成式 AI（Generative AI）工作负载中长上下文请求的预处理瓶颈问题，特别是由于频繁调用且上下文几乎不变时，传统基于 CPU 的分词（tokenization）过程已成为影响首次标记时间（Time-to-First-Token, TTFT）的主要延迟来源。尽管前缀缓存（prefix caching）已显著减少重复计算，但每次请求仍需完整执行分词以查询缓存，导致分词阶段成为系统性能瓶颈。其核心解决方案是提出 GraphTok——一种将整个编码流水线（包括预分词、字节对编码合并及标记 ID 组装）封装为可重放的 CUDA 图（replayable CUDA graph）的 GPU 分词器。GraphTok 在 GPT-2、Llama 3、Qwen 2.5、DeepSeek-V3 和 Gemma 3 上实现了与参考分词器逐比特一致的结果，并在短输入场景下无缝切换至 CPU 引擎以保证效率。该方案通过全图化执行大幅降低数据传输与调度开销，在单次请求基准测试中较 gigatoken 提升 2.6–3.9 倍，最高达 18.1 倍；在 vLLM 中结合前缀缓存后，平均 TTFT 下降 2.1–2.4 倍。最关键的是，其带来的容量提升显著：在 2 秒 P99 延迟目标下，使用 GraphTok 的 Dynamo 前端可承载 518 请求/秒的 12.1 万标记流量，相较 gigatoken 提升 1.75–2.5 倍，尾部延迟降低高达 64 倍，充分释放了前端吞吐能力。
链接: https://arxiv.org/abs/2610.13325
作者: Mohammad Siavashi,Pascal Schwinte,Ali Banaei,Gerald Q. Maguire Jr.,Marco Chiesa,Dejan Kostić
机构: 未知
类目: Distributed, Parallel, and Cluster Computing (cs.DC); Computation and Language (cs.CL); Machine Learning (cs.LG); Performance (cs.PF)
备注:
Abstract:Agentic workloads resend long contexts that barely change between calls. Prefix caching now skips most of their prefill, yet every request must still be tokenized in full before the cache can even be consulted. Tokenization, a CPU stage long treated as negligible, becomes the largest part of time-to-first-token (TTFT), and a frontend that tokenizes for a whole GPU fleet limits how many GPUs it can feed. We present GraphTok, a GPU tokenizer that runs the entire encoding pipeline, from pre-tokenization through byte-pair encoding (BPE) merging to token-ID assembly, as one replayable CUDA graph. GraphTok reproduces the reference token IDs bit-for-bit on GPT-2, Llama 3, Qwen 2.5, DeepSeek-V3, and Gemma 3, hands short inputs to a CPU engine where the GPU cannot win, and plugs into unmodified vLLM and NVIDIA Dynamo. GraphTok encodes one million GPT-2 tokens in 1.7-3.2 ms including data transfers, and on Llama 3 it is 4.7-6.0x faster than gigatoken, the strongest CPU tokenizer. On TokTier’s own single-request benchmark, it is 2.6-3.9x faster than gigatoken and up to 18.1x faster than TokTier. In vLLM with a cached prefix, it lowers mean TTFT by 2.1-2.4x. The largest gain is capacity. Within a 2 s P99 target, one Dynamo frontend with GraphTok sustains 518 requests/s of 121k-token traffic, the busiest-hour load of 56 GPUs, against 296 with gigatoken and 18.5 with the default tokenizer. Across 121k to one million tokens, this is 1.75-2.5x the load gigatoken sustains, with a P99 up to 64x lower where gigatoken’s tail breaks.
[NLP-41] Host-Aware Web Crawling for LLM Pretraining Data EMNLP2026
【速读】： 该论文旨在解决大规模语言模型（LLM）预训练数据采集中，网络爬虫在资源有限情况下如何优化数据质量的问题。核心挑战在于：尽管网络爬虫能够获取海量网页，但现有数据筛选流程会丢弃大量潜在高价值内容。其解决方案的关键在于通过多维度指标——包括文档级质量分类器得分、网页图中心性（web-graph centrality）以及每主机的爬取覆盖率——来指导爬虫的预算分配策略。研究发现，约一半的质量差异存在于不同主机之间，且少数页面即可有效预测某主机整体页面质量；进一步模拟表明，基于采样质量评分动态调整深度爬取（即对高质量样本所在主机进行更深入抓取）相比均匀深度或基于中心性的分配方式，可显著提升单位抓取成本下的高质量页面获取效率；而实际观测到的主机覆盖范围与质量信号关联性较弱，暗示当前爬取策略存在优化空间，推测每个爬取周期中仍有数千万未被爬取但高质量的网页存在于已知URL中，且高度集中于少数主机。
链接: https://arxiv.org/abs/2610.13321
作者: Malte Ostendorff
机构: Common Crawl Foundation(通用爬取基金会)
类目: Computation and Language (cs.CL)
备注: Accepted at WaC-13 @ EMNLP 2026
Abstract:Web crawling is a major source of large language model (LLM) pretraining data, yet data-selection pipelines discard a large share of crawled pages. We investigate how a crawler should allocate its budget across and within hosts to collect more high-quality pretraining data. Combining document-level quality classifier scores, web-graph centrality metrics, and Common Crawl’s per-host crawl coverage, we find that roughly half of the variation in classifier scores occurs between hosts. In the crawls we analyze, a few pages from a host also provide a useful estimate of the quality of its remaining pages. Common Crawl uses harmonic centrality, a graph centrality metric, to guide its crawl allocation. In our simulations, using centrality to choose which hosts to crawl yields limited gains over random ordering and performs worse for some classifiers. For deciding how deeply to crawl each host, sampling a few pages and then fetching more from hosts with higher-scoring samples collects several times more high-quality pages per fetch than uniform depth or centrality-based allocation. Finally, Common Crawl’s observed per-host coverage has little correlation with the evaluated quality signals. We estimate that tens of millions of high-quality pages remain among known but uncrawled URLs in each crawl examined, with most concentrated on a small share of hosts.
[NLP-42] Agreement Without Alignment: Label-Free Rubric Clarification Increases LLM -Judge Consensus but Not Agreement with Humans
【速读】： 该论文旨在解决大语言模型（LLM）评判员在作为评审小组时，因评判标准（rubric）不清晰导致的评委间分歧问题。传统做法常将这种分歧视为评判标准缺陷的信号，但缺乏有效的自动化修复机制。其核心解决方案是提出一种无需人工标注（label-free）的程序：将原始评判标准分解为子标准（sub-criteria），基于开发集上评委间的交叉分歧度对子标准进行排序，并由编辑模型仅重写分歧最高的部分；后续阶段尝试将可文本验证的子标准迁移至确定性检查器，但在评估中未见成效。整个过程不依赖人类标签来选择或修改条款，仅使用人类标签评估最终效果。研究通过预注册协议，在SummEval、HealthBench和USR Topical-Chat三个基准上，以五名来自不同提供商的评委对129,770次评判请求进行评估，验证了六种评判标准条件。结果显示，在SummEval上，该方法使评委间一致性（Krippendorff’s α）显著提升0.069（95% CI: 0.046–0.092），且与专家评分的一致性无显著变化；而在其他两个数据集上，一致性和人类共识均未达到预设效应标准。尽管争议性条款的重写使评委间一致性优于随机选择条款的对照组，但并未使评委判断更接近人类标注者。关键创新在于利用评委分歧本身作为信号驱动评判标准的自动优化，实现了无需人工标注的鲁棒性修正路径。
链接: https://arxiv.org/abs/2610.13303
作者: Sangdo Han,Moonsoo Kim
机构: CEO Business School(CEO商学院)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 12 pages, 12 tables
Abstract:LLM judges are increasingly deployed as panels, and disagreement among panel members is often read as a symptom of an unclear rubric. We test a label-free procedure that turns this disagreement into rubric repairs. The procedure decomposes each rubric into sub-criteria, ranks them by cross-judge disagreement on a development split, and has an editor model rewrite only the most contested ones. An additional stage that moves text-checkable sub-criteria to deterministic checkers transferred none in our evaluation. Human labels are never used to select or edit clauses; they are used only to evaluate the outcome. We pre-specified four hypotheses in a version-controlled protocol and evaluated six rubric conditions with a panel of five judges from three providers on SummEval, the HealthBench meta-evaluation, and USR Topical-Chat, for a total of 129,770 judge requests, excluding retries. On SummEval, the procedure raised inter-judge Krippendorff’s \alpha by 0.069 (95% CI 0.046 to 0.092) over the original rubric and by 0.074 over a control that applied the same edits to an equal number of randomly chosen clauses that were not selected. Agreement with expert ratings showed no detectable change (Kendall \tau difference -0.007, 95% CI -0.037 to 0.021). On HealthBench and USR, neither inter-judge agreement nor human agreement met the preregistered effect criteria. In a preregistered secondary comparison, human agreement after editing the contested clauses was lower than after editing the control clauses on all three datasets in point estimate, although no interval excluded zero. Selecting clauses by disagreement makes judges agree with each other more than editing arbitrary clauses does, but in our setting the added consensus did not bring the judges closer to human annotators. We will release code, frozen rubrics, item identifiers, and judge scores.
[NLP-43] Do Prompt Optimizers Break Requirements They Are Not Scored On? A Preregistered Study
【速读】： 该论文旨在解决生成式 AI（Generative AI）中提示优化器（prompt optimizers）在提升特定评估指标（如精确匹配率）的同时，忽视未被目标指标衡量的隐性要求（unscored requirements）的问题，例如输出格式、引用规范或拒绝回答的策略。其核心挑战在于：现有优化方法虽能提升量化指标，但可能破坏实际应用中至关重要的结构化输出与内容完整性。解决方案的关键在于引入严格的确定性检查机制，对提示优化前后输出中的非评分项（如引用有效性、JSON结构合规性）进行系统性验证。研究发现，在预注册标准下，三类优化器（GEPA、MIPROv2、TextGrad）均导致显著退化，尤其在HotpotQA上引用有效性下降达10.7至41.6分；然而，后验分解揭示问题根源在于优化后的提示促使模型先生成推理过程，而在200词输出限制下，高达13.9%至47.0%的响应在答案出现前即终止。当放宽至1,024词限制后，解析失败消失，内容退化低于1分，且精确匹配率进一步提升。这表明，优化器的“副作用”远小于预期——其本质是因输出长度约束引发的结构性失效，而非性能下降。因此，关键改进在于通过更合理的输出约束与结构控制（如简单门控机制），在不牺牲准确性的前提下恢复对非评分要求的遵守。
链接: https://arxiv.org/abs/2610.13287
作者: Sangdo Han,Moonsoo Kim
机构: CEO Business School(首席执行官商学院)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 8 pages, 7 tables. Preregistered study
Abstract:Prompt optimizers rewrite a prompt to raise one target metric, but prompts also state requirements the metric does not score, such as an output format, citations, or abstention. In a preregistered study, we run GEPA, MIPROv2, and TextGrad on HotpotQA, SQuAD 2.0, and IFEval and count per-item violations of unscored requirements with deterministic checks. By the preregistered criterion, all three optimizers produce regressions, substantially on HotpotQA, where net regression in citation validity reaches 10.7 to 41.6 points while exact match rises by 21 to 34 points. A post-hoc decomposition changes this reading. The optimized prompts elicit reasoning before the required JSON object, and under the 200-token output cap used throughout, 13.9% to 47.0% of responses end before any answer appears. Among parseable outputs, net regression is within 3 points of zero. With a 1,024-token cap, extraction failures disappear, content regression stays below 1 point, and exact match rises further. Two simple gates fail the preregistered criterion. The side effect is narrower than hypothesized: optimized prompts are more accurate and break an explicit output contract, and a lenient target metric does not show the cost.
[NLP-44] BoundaryEvo: Data-Model Co-Evolution at the Capability Boundary for Long-Chain Reasoning Distillation
【速读】： 该论文旨在解决小规模语言模型在通过蒸馏大型教师模型的长链推理轨迹进行训练时，因静态或固定数据选择策略导致的训练效率低下问题。现有方法通常在蒸馏前预设固定训练集，忽视了学生模型能力随训练过程动态演进时，不同推理示例的指导价值会发生变化这一关键事实，尤其在可用教师轨迹数量有限的情况下，这种不匹配会显著降低学习效果。其核心挑战在于：已掌握的例子提供不了有效监督，而远超学生当前能力范围的例子又难以习得，因此需要一种能够随学生能力演化自适应调整训练数据的机制。本文提出的关键解决方案是边界协同进化（BoundaryEvo）框架，采用两阶段数据-模型协同演化策略：第一阶段“能力启始（Capability Priming）”直接蒸馏少量教师生成的推理轨迹，无需依赖额外评估模型进行筛选，使学生快速建立基础推理能力；第二阶段“能力边界协同进化（Capability-Boundary Co-Evolution）”则持续筛选出当前学生尚未掌握但专家可稳定求解的问题，并动态更新训练数据以匹配学生的能力边界。实验表明，仅使用1,000个训练样本，BoundaryEvo在11个推理基准上均优于静态与动态基线方法，显著提升小模型性能，如在IMO-AnswerBench上将Qwen3.5-4B准确率从62.9%提升至75.3%，在AMO-Bench上从26.8%提升至46.0%。
链接: https://arxiv.org/abs/2610.13285
作者: Jiaming Su,Suorong Yang,Xudong Li,Tengchao Yang,Peng Ye
机构: Shanghai Artificial Intelligence Laboratory; Nanjing University; Tongji University; The Chinese University of Hong Kong
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 29 pages, 7 figures
Abstract:Distilling long-chain reasoning trajectories from large teacher models provides an effective way to improve the reasoning ability of small language models. However, existing methods typically select a fixed training set before distillation, overlooking that the usefulness of a reasoning example changes as the student evolves. This mismatch becomes especially costly when only a small number of teacher trajectories can be used for training. Besides, examples already mastered provide little new supervision, while examples far beyond the capability of student may be difficult to learn from. Training data should therefore adapt as model capability evolves, yet reliable data selection is difficult when the student is initially weak. To address these challenges, our key idea is to first establish the basic reasoning capability and then adapt the training data to the evolving capability boundary of the student. We propose BoundaryEvo, a two-stage data–model co-evolution framework. In Capability Priming, we directly distill a small set of teacher-generated long reasoning trajectories without using a separate model to judge and filter them, allowing the student to acquire an initial reasoning capability before capability-aware data selection. In Capability-Boundary Co-Evolution, we repeatedly select questions that the current student has not mastered but the expert can reliably solve, and update the training data as the student evolves. With only 1,000 training examples, BoundaryEvo consistently outperforms static and dynamic data selection baselines across 11 reasoning benchmarks, raising the original Qwen3.5-4B accuracy from 62.9 to 75.3 on IMO-AnswerBench and from 26.8 to 46.0 on AMO-Bench. The code and data will be made publicly available.
[NLP-45] CAST: Credit Alignment for Cross-Tokenizer On-Policy Distillation
【速读】： 该论文旨在解决跨分词器在线策略蒸馏（Cross-tokenizer on-policy distillation, OPD）中的两大核心问题：片段级信号对齐（chunk-level alignment）与信用分配（credit alignment）。尽管解码文本对齐可在片段层面建立教师模型与学生模型之间的对应关系，但其仍无法有效解决“信用如何在学生模型的各个标记间合理分配”的问题——即已对齐片段虽能提供整体优势信号，却未明确各标记应承担的具体学习责任；同时，无教师对应关系的标记则缺乏约束，易导致策略漂移。为此，论文提出一种名为CAST（Chunk-aware credit Assignment with Selective Token Anchoring）的“移位或保持”框架，其关键创新在于将信用分配与片段构建解耦。对于对齐片段，CAST基于预测不确定性与局部教师信号平滑性，将片段整体优势重新分配至学生标记，以强化由局部一致教师反馈支持的学习机会，同时保持片段总优势不变，并精确求解一个KL正则化的信用分配优化问题；对于未对齐位置，通过施加KL惩罚，选择性地将学生策略锚定于初始策略，从而在缺乏教师监督时抑制策略漂移。由于信用分配机制独立于片段构造方式，CAST可兼容标点定义或固定长度的片段结构，且适用于共享分词器场景。在六个数学、科学与代码基准测试中，CAST在从Qwen3-8B到Mistral-7B和Llama-3.1-8B的跨分词器迁移任务上分别提升平均性能2.45和1.32点，在共享分词器向Qwen3-1.7B迁移时提升2.10点，显著优于现有最强基线。
链接: https://arxiv.org/abs/2610.13257
作者: Jingru Yang,Jinhang Wu,Minjing Shi,Shengfeng He,Xuyan Li,Man Tan,Biye Li
机构: Taobao Tmall Group of Alibaba(淘宝天猫集团); Singapore Management University(新加坡管理大学)
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注: 22 pages, 8 figures, 11 tables
Abstract:Cross-tokenizer on-policy distillation (OPD) requires aligning teacher and student sequences before their scores can be compared. Decoded-text alignment provides such correspondence at the chunk level, but leaves a distinct problem unresolved: credit alignment. A chunk-level signal specifies how much a span should change, but not how that signal should be distributed across student tokens, while tokens without teacher correspondence remain unconstrained. We propose CAST (Chunk-aware credit Assignment with Selective Token Anchoring), a shift-or-stay framework that addresses both issues. For aligned chunks, CAST redistributes each chunk’s advantage across student tokens using predictive uncertainty and local teacher-signal smoothness, emphasizing learning opportunities supported by locally consistent teacher feedback while preserving the chunk’s total advantage. The resulting weights exactly solve a KL-regularized credit-allocation problem. For unaligned positions, CAST selectively anchors the student to its initial policy through a KL penalty, limiting drift where teacher supervision is unavailable. Because credit assignment is separated from chunk construction, CAST also applies to punctuation-defined or fixed-length chunks under shared tokenization. Across six mathematics, science, and code benchmarks, CAST improves the average over the strongest evaluated baseline by 2.45 and 1.32 points for cross-tokenizer transfer from Qwen3-8B to Mistral-7B and Llama-3.1-8B, respectively, and by 2.10 points for shared-tokenizer transfer to Qwen3-1.7B.
[NLP-46] Vision Transformers Learn Word Meaning from Images Alone
【速读】： 该论文旨在解决视觉模型是否仅通过图像像素信息即可自发学习词语语义的问题。其核心挑战在于：在无任何语言监督（如标注、字幕或类别标签）的情况下，视觉模型能否从图像中捕捉到词语之间的语义关系。解决方案的关键在于利用自监督预训练的DINOv3系列视觉变换器（Vision Transformers），通过分析单词图像与其对照样本之间的嵌入差异，提取词义表征，并在控制拼写相似性影响的前提下，检验这些表征在嵌入空间中是否呈现语义相关性。研究发现，相同行业品牌、同义域名词以及国家-首都配对等均表现出显著的语义聚集与一致向量偏移，且词嵌入与所命名视觉类别的表征高度对齐。这表明，仅基于图像自监督训练的DINOv3-H和DINOv3-7B模型已具备显著的词义结构，首次实现了图像驱动下语义层次的词表示能力。进一步对比显示，词义表征在视觉、文本及语音编码器间存在共享结构；通过与文本或语音编码器进行对比对齐，可显著增强视觉模型的词级语义结构，而其他微调后的视觉模型则无明显变化。因此，仅依赖图像训练的视觉模型不仅能理解词语的外观，还能推断其意义关联。
链接: https://arxiv.org/abs/2610.13252
作者: Anders Gjølbye,Sebastian Ray Mason,Stella Frank,Lars Kai Hansen
机构: Technical University of Denmark (丹麦技术大学)
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL)
备注: Preprint. 31 pages. 6 figures
Abstract:Can a vision model learn what words mean from pixels alone? We show that the two largest DINOv3 vision transformers organize words rendered in images by word meaning, despite being pretrained using self-supervision on images only, without paired captions, class labels, or other language supervision. We derive word representations from embedding differences between word images and matched controls, then test whether semantically related words are neighbors within each model’s embedding space, while controlling for spelling similarity. We find that brand names in the same industry group together, as do nouns from the same semantic domain. Country-capital pairs exhibit consistent vector offsets, similarly to word embeddings trained on text. These word representations also align with the representations of the visual object categories they name. DINOv3-H and DINOv3-7B are, to our knowledge, the first self-supervised vision models to show substantial semantic structure for rendered words. Comparisons with text and speech encoders reveal shared structure among representations of the same words. Contrastive alignment with either encoder further strengthened DINOv3-H’s word-level semantic structure, while leaving the other finetuned vision models largely unchanged. Image-only training can therefore teach vision models not just what words look like, but also how their meanings relate.
[NLP-47] What Do Audio-Language Judges of Generated Music Listen For? Four Probes with Controls from Expert Ratings
【速读】： 该论文旨在解决开放型音频-语言模型（open audio-language models）作为音乐生成质量评估判官时，其评分依据不明确的问题：即评分是基于音频内容、文本提示，还是评价指令的表述方式。为揭示判官的真实响应机制，研究提出四项探针测试（probes），分别检验音频输入、提示一致性、评分顺序偏倚及指令重述的影响，并以人类专家评分作为对照基准。关键发现包括：在移除音频后，所有判官的评分均无法超越仅由提示预测的水平，且提示对齐性评分普遍低于人类评分；当引入音频时，多数判官的提示对齐性评分受实际音频内容影响，而音乐质量评分中仅有两个判官表现出对音频内容的敏感性；最强判官的质量评分与专家对齐评分的相关性甚至超过其与专家质量评分的相关性，表明其更关注语义一致性而非纯粹音乐性；此外，小型判官在成对比较中的判断结果显著受音频位置（槽位）影响，而非真实质量；指令重述对多数判官的评分相关性影响程度堪比更换判官本身。研究进一步指出，MusicEval的数据集设计限制了仅依赖提示的判官在模型层面的表现上限。因此，作者建议未来在报告音乐判官性能时，必须配套使用这四项探针，以确保评估结果的可解释性与可靠性。
链接: https://arxiv.org/abs/2610.13247
作者: Mateusz Modrzejewski,Tomasz Radzikowski
机构: Warsaw University of Technology (华沙理工大学)
类目: ound (cs.SD); Computation and Language (cs.CL); Audio and Speech Processing (eess.AS)
备注: 10 pages, 1 figure, 15 tables
Abstract:Open audio-language models are used as judges of generated music: given a clip and its text prompt, the model rates the clip, and the judge is validated by how well its ratings correlate with expert ratings. The correlation does not show what the judge responds to: the music, the text prompt, or the way the question is asked. We propose four probes that test each of these, three of them read against a control computed from the human ratings: removing the audio, replacing the clip with another model’s clip for the same prompt, swapping the order of two clips in pairwise judging, and rewording the instruction. We apply them to five open judges on all 2,748 clips of MusicEval, and the last two to the SongEval songs. Without audio, no judge exceeds what the prompt alone predicts from the human ratings, and for prompt alignment every judge falls below it. With audio, every judge follows the clip it hears when rating prompt alignment, two do when rating musical quality, and the strongest judge’s quality score tracks the experts’ alignment rating more than their quality rating. The pairwise verdicts of the four smaller judges follow the position of a clip in the pair (its slot) rather than its quality on both rating sets. For musical quality, rewording the instruction moves the correlation of most judges as much as changing the judge. MusicEval’s prompt assignment bounds any prompt-only judge at the model level. We recommend reporting the four probes with every music judge.
[NLP-48] How Reliable are AMR Parser Outputs? Uncertainty Estimation for AMR Parsing
【速读】： 该论文旨在解决当前抽象语义表示（Abstract Meaning Representation, AMR）解析器在输出可信度评估方面缺乏系统性研究的问题，尤其关注在黑箱设置下如何有效估计解析结果的不确定性。其解决方案的关键在于利用top-k束搜索（beam-search）候选解之间的成对相似性来估算不确定性，并通过预测拒绝率（Prediction Rejection Ratio, PRR）进行评估。该方法不仅揭示了解析性能与不确定性之间的关联，还验证了束搜索候选分布的可靠性，分析了不同评估指标对不确定性判断的影响，并识别出在性能与可靠性之间取得最佳平衡的解析器。实验结果表明，不确定性估计作为评估AMR解析器的补充维度具有显著价值。
链接: https://arxiv.org/abs/2610.13236
作者: Anuj Kumar,Shintaro Ozaki,Yamuna Prasad,Katsuhiko Hayashi,Hidetaka Kamigaito,Taro Watanabe
机构: Indian Institute of Technology Jammu(印度理工学院贾姆穆); Nara Institute of Science and Technology (NAIST)(奈良先端科学技術大学院大学); The University of Tokyo(东京大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注:
Abstract:Recent advances have significantly improved the performance of Abstract Meaning Representation (AMR) parsers, yet determining when their outputs can be trusted remains largely unexplored. This work presents the first study of uncertainty estimation for AMR parsers in a black-box setting using top-k beam-search candidates. Uncertainty is estimated from pairwise candidate similarities and evaluated using the Prediction Rejection Ratio. This work characterises the relationship between parsing performance and uncertainty, evaluates the reliability of beam candidate distributions, analyses the effect of evaluation metrics on uncertainty assessment, and identifies parsers that provide the strongest balance between performance and reliability. Experimental results show the value of uncertainty estimation as a complementary dimension for evaluating AMR parsers.
[NLP-49] SharP: Soft and Hard Prompt-Guided Augmentation with LLM for Low Resource Fake News Detection
【速读】： 该论文旨在解决低资源环境下虚假新闻检测面临的挑战，即标注数据稀缺与难以捕捉细微欺骗性模式的问题。在仅有少量标注样本可用于训练、且测试协议固定不变的设定下，传统数据增强方法（如同义词替换、生成对抗网络及基于大语言模型（LLM）的生成）往往产生语义流畅但过于泛化的内容，缺乏任务相关的特异性。为此，本文提出一种边界感知的文本生成框架SharP，其核心在于利用LLM作为工具，通过软提示（soft prompts）与硬提示（hard prompts）协同引导生成过程：硬提示提供结构化指导与事实约束，软提示则引入从数据中学习到的语义模式，二者结合以生成更贴近真实新闻特征的合成样本；同时，引入边界感知策略，引导生成聚焦于分类器置信度较低的区域，从而强化真实与虚假内容之间的细微区分能力；此外，采用双目标优化机制，在保持生成样本与源数据语义一致性的同时，融合分类器反馈信号，使生成样本兼具领域一致性和决策边界优化价值，显著提升模型在低资源条件下的鲁棒性与泛化性能。
链接: https://arxiv.org/abs/2610.13207
作者: Ziyu Luo,Wei Li,Haoping Huang,Kecheng Liu,Min Gao
机构: Chongqing University (重庆大学); University of Reading (雷丁大学)
类目: Computation and Language (cs.CL)
备注: 28 pages, 7 figures, 8 tables. Author manuscript. Code: this https URL
Abstract:Fake news detection under low resource conditions is challenged by the scarcity of labeled data and the difficulty of capturing subtle deceptive patterns. In this work, we focus on low resource fake news detection, where only a small labeled set is available for training, while evaluation is performed under a fixed and unchanged test protocol. This setting is motivated by costly, ambiguous fact-checking and emerging topics and domains that are poorly covered by existing benchmarks. Existing data augmentation methods, such as synonym substitution, generative adversarial networks, and large language model (LLM)-based generation, often produce fluent but overly generic content, lacking the task-specific relevance needed for accurate detection. To address this, we propose SharP, a boundary-aware text generation framework guided by soft and hard prompts, which leverages LLMs as tools adapted to produce task-specific synthetic samples. SharP employs a dual prompt mechanism: hard prompts provide structured guidance and factual constraints, while soft prompts introduce learned semantic patterns from the data. These two types of prompts are combined to guide the generation process, enabling the model to produce samples that closely align with the characteristics of news. To further enhance detection performance, we incorporate a boundary-aware strategy that steers generation toward areas where the classifier is less confident, helping to clarify subtle distinctions between real and fake content. In addition, we adopt a dual objective optimization that balances semantic alignment with the source data and classifier feedback. This encourages the generation of samples that are both domain-consistent and helpful for refining decision boundaries, ultimately improving model robustness and generalization in low resource fake news detection.
[NLP-50] S3R: Fast and Faithful RL Rollouts via Self-Sparse Speculative Decoding
【速读】： 该论文旨在解决长上下文强化学习中具有可验证奖励（RLVR）的快速滚动生成问题，核心挑战在于如何在不改变用于策略优化的响应组分布的前提下，降低键值缓存（KV-cache）的访问开销。研究发现，在自回归解码过程中，注意力计算占用了72%–76%的内核时间，而稀疏注意力虽能减少读取开销，但直接从稀疏策略采样会改变响应组分布，导致策略更新偏差。对于基于组相对性的优化，即使采用精确的响应级重加权也无法一般性地恢复稠密策略的期望更新，因为每个响应的优势依赖于同组其他成员的奖励。为此，论文提出自洽稀疏推测生成（Self-Sparse Speculative Rollouts, S³R），其关键在于：利用稀疏注意力生成候选令牌（drafting），再通过全注意力验证与精确推测采样生成最终响应，且起草与验证共享同一套策略参数，无需训练或更新独立的起草器。该设计确保了响应组保持稠密策略分布。进一步分析表明，尽管验证阶段仍需完整的历史KV缓存，但引入感知KV的调度机制可有效避免重复的缓存卸载与恢复，维持并行性。在匹配消融实验中，相较于采用训练侧修正的激进稀疏起草方式，S³R展现出更稳定的训练过程；在长上下文数学推理任务上，S³R在Qwen3模型上实现了1.39×至1.35×的端到端训练吞吐量提升，同时保持相当的任务性能。
链接: https://arxiv.org/abs/2610.13202
作者: Yuhang He,Hongyu Ge,Zihan Lin,Siyi Liu,Yongqi Zhang
机构: The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州))
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Fast rollout generation for long-context reinforcement learning with verifiable rewards (RLVR) requires reducing KV-cache traffic without changing the response groups used for policy optimization. In our profiled RLVR workloads, attention accounts for 72–76% of autoregressive decoding kernel time. Sparse attention reduces these reads, but sampling directly from a sparse policy changes the response groups used for learning. For group-relative optimization, we show that even exact response-wise reweighting does not generally recover the expected dense-policy update because the advantage of each response depends on the rewards of other group members. We propose Self-Sparse Speculative Rollouts (S ^3 R). It uses sparse attention to propose tokens, then generates responses through full-attention verification and exact speculative sampling. Drafting and verification share the same policy parameter, eliminating the need to train or update a separate drafter. The resulting response groups follow the dense-policy distribution. Under S ^3 R, we characterize speedup conditions and the costs of drafting and verification. We found that dense verification still requires the complete historical KV cache. A KV-aware scheduler therefore limits KV-cache repeated offloading and restoration while maintaining rollout parallelism. % OR thrashing In a matched ablation with an aggressive sparse drafting budget, S ^3 R maintains stable training while direct sparse sampling with training-side correction becomes unstable. On long-context mathematical reasoning, S ^3 R achieves 1.39\times~1.35\times the end-to-end training throughput of autoregressive rollouts on Qwen3 model, with comparable task performance.
[NLP-51] PreSTO: Predictive Subtree Prefetching for Fast LLM Power Sampling
【速读】： 该论文旨在解决生成式 AI（Generative AI）中大语言模型（Large Language Model, LLM）推理时因基于马尔可夫链蒙特卡洛（Metropolis–Hastings, MH）采样器 PowerMH 的串行更新机制导致的推理效率低下问题。其核心挑战在于，PowerMH 每次采样需等待前一次接受/拒绝决策完成才能生成下一次提案，形成显著的延迟瓶颈。为突破此限制，本文提出预测性子树预取（Predictive SubTree Prefetching, PreSTO），其关键创新在于通过批量预取未来多步的提案并构建一个接受/拒绝决策的树结构，在不改变原始 MH 转移核的前提下实现并行化采样。具体而言，PreSTO 在每次模型调用中一次性生成预取子树的所有提案，并依据实际路径沿用原生 MH 接受规则；同时观察到实际遍历路径仅占据子树中的稀疏、近似单枝区域，因而进一步设计了预测性遍历策略，以最大化预期完成的转移次数。在七个数据集与五种基础大模型上的实验表明，PreSTO 在 PowerMH 及其后续方法 EntropyCut 与 MultiTryMH 上分别实现了 1.71×、1.91× 和 2.33× 的中位加速比，且平均减少 3.9 倍的模型调用次数，每次调用仅延长 2.1 倍时间；在 LCB V6 与 Qwen3.5-9B 上，预测性遍历策略相比默认广度优先遍历进一步提升 1.25× 至 1.37× 的性能。
链接: https://arxiv.org/abs/2610.13171
作者: Nan Jiang,Panagiotis Theodoropoulos,Wei Deng
机构: University of Texas at El Paso(德克萨斯大学埃尔帕索分校); Georgia Institute of Technology(佐治亚理工学院); Morgan Stanley(摩根士丹利)
类目: Computation and Language (cs.CL)
备注:
Abstract:Power sampling improves large language model (LLM) reasoning at test time by sampling from a sharpened version of the base model’s distribution. Its sampler, PowerMH, is slow because its Metropolis–Hastings (MH) updates are sequential: each accept/reject decision sets the state from which the next proposal is generated. Prior work reduces this cost by changing the sampler or the model (e.g., sequential Monte Carlo, approximate lookahead, distillation). We propose Predictive SubTree Prefetching (PreSTO), which accelerates PowerMH by prefetching future proposals and provably leaves its MH transition kernel unchanged. PreSTO views future MH outcomes as a tree of accept/reject decisions: in each model call, it generates the proposals of a \textitprefetched subtree of this tree in one batch, then follows the realized path with the original MH acceptance rule. We also observe that MH reaches only a sparse, nearly unary part of each prefetched subtree, we further design a \textitpredictive traversal rule that chooses the subtree to maximize the predicted number of completed transitions. Across seven datasets and five base LLMs, PreSTO achieves median speedups of 1.71\times , 1.91\times , and 2.33\times on PowerMH and its follow-ups EntropyCut and MultiTryMH, respectively; on the first two, it makes a median of 3.9\times fewer model calls, each only 2.1\times longer. On LCB V6 with Qwen3.5-9B, the predictive traversal rule is a further 1.25\times – 1.37\times faster than the default breadth-first traversal.
[NLP-52] Scaling Agent ic Data for Long-Horizon Terminal Intelligence
【速读】： 该论文旨在解决长时序（long-horizon）终端智能体（terminal agent）在真实专业任务中缺乏高质量、完整行为轨迹数据的问题。现有环境合成方法常提前完成关键工作，导致智能体无法充分经历探索、证据积累、策略迭代与验证等核心自主决策过程，从而削弱其真实场景下的持续执行能力。其解决方案的关键在于提出TerminalHorizon——一个全自动的数据合成引擎，通过独立执行真实专业任务以识别构建过程中被省略的关键工作，并利用生成的证据指导环境重构；同时，在同一目标下逐步扩展任务阶段，引入基于前期结果的新需求，强制智能体进行持续探索与优化。基于此引擎构建的1.5K任务环境，支撑对Qwen3.5-27B模型进行监督微调，得到TerminalHorizon-27B，显著提升模型在12个基准测试（涵盖编码代理、生产环境中的智能体任务及通用推理）上的表现。多组12小时研究预算的递进式解决方案（RSI）案例进一步验证了该模型具备持续实验、根据反馈改进方法并保留有效优化成果的能力，充分体现了长时序智能体在复杂任务中的自主演化特性。
链接: https://arxiv.org/abs/2610.13166
作者: Shun Zou,Ziyu Ma,Yi Zou,Yong Wang,Lin Chen,Zehui Chen,Guanhua Chen,Xiangxiang Chu,Feng Zhao
机构: University of Science and Technology of China(中国科学技术大学); AMAP, Alibaba Group(阿里巴巴集团); Southern University of Science and Technology(南方科技大学)
类目: Computation and Language (cs.CL)
备注: this https URL
Abstract:Terminal agents are moving beyond local operations toward completing real-world professional tasks. Short trajectories can demonstrate commands and tool calls, but they do not fully show how agents accumulate evidence through exploration, use it to inform judgments, continually adjust strategies based on feedback, and turn intermediate results into final deliverables. High-quality long-horizon trajectories capture these agentic behavioral patterns and their connections within a single problem-solving process, providing richer experience for sustained autonomous work. However, environment synthesis may complete or simplify the key work underlying these patterns in advance and thus remove the need for exploration, implementation, and verification that the agent was meant to perform. To address this, we introduce TerminalHorizon, a fully automated data synthesis engine for long-horizon terminal agents. Starting from real-world professional work, it uses independent execution to identify key work omitted during construction and uses the resulting evidence to guide environment reconstruction. To extend these patterns across stages, it progressively expands tasks under the same goal, introducing new requirements that build on prior results and call for further exploration and improvement. Using this engine, we construct 1.5K task environments and perform supervised fine-tuning of Qwen3.5-27B on the resulting dataset to obtain TerminalHorizon-27B. We achieve substantial performance gains on all 12 benchmarks spanning coding-agent tasks, agentic tasks in real-world production settings, and general reasoning. Multiple RSI case studies, each with a 12-hour research budget, further demonstrate the model’s ability to continue experimenting beyond an initial solution, improve its methods based on feedback, and retain effective improvements in its final deliverables.
[NLP-53] SOAR: Source-Aware Reinforcement Learning with Precise Credit Assignment for Search Agents
【速读】： 该论文旨在解决强化学习（Reinforcement Learning, RL）在搜索代理中普遍存在的证据伪造（evidence fabrication）问题，即代理过度依赖不可靠的内部知识（E_int）作为捷径，绕过外部信息（E_ext），从而生成错误答案。其核心解决方案是提出一种名为SOAR（Source-Aware Reinforcement learning）的新范式，关键在于将传统的单体化推理过程重构为显式标注信息来源的可观察轨迹：首先通过源感知工作流（Source-Aware Workflow）将外部知识与内部知识解耦为并行、可观测的信息流；其次引入源一致性奖励（Source-Consistent Reward）以指导策略演化。该设计使不同知识源之间的贡献可被精确归因，从而有效抑制对内部知识的过度依赖。实验表明，SOAR在3B和7B规模模型上分别提升性能7.3%和5.4%，同时将证据伪造率降低74.8%，显著增强了任务表现与推理的可信性及鲁棒性。
链接: https://arxiv.org/abs/2610.13157
作者: Shengze Huang,Zihao Tang,Jinluan Yang,Xin Yu,Zhenghao Lin,Xiao Liu,Zengxuan Wen,Yeyun Gong,Haizhen Huang,Weiwei Deng,Feng Sun,Qi Zhang,Fei Wu,Kun Kuang
机构: Zhejiang University(浙江大学); Microsoft(微软)
类目: Computation and Language (cs.CL)
备注: 17 pages, 3 figures, 16 tables
Abstract:Reinforcement learning (RL) for search agents often suffers from evidence fabrication, a failure mode where agents bypass external information ( E_ext ) and fabricate an incorrect answer. We argue that this fabrication arises from an over-reliance on unreliable internal knowledge ( E_int ) as shortcuts due to the inherent opacity of reasoning trajectories. To address this, we propose SOAR (SOurce-Aware Reinforcement learning), a paradigm that transforms monolithic reasoning into source-explicit trajectories. SOAR (i) disentangles E_ext and E_int into parallel, observable streams via a Source-Aware Workflow, and (ii) incorporates Source-Consistent Reward to guide the policy evolution. By making information-source attribution explicit, SOAR enables precise credit assignment between different knowledge streams. Evaluations show that SOAR outperforms baselines on 3B and 7B backbones by 7.3% and 5.4%, while reducing evidence fabrication by 74.8%. These confirm that SOAR significantly improves performance on knowledge-intensive benchmarks while effectively mitigating evidence fabrication, fostering more faithful and grounded reasoning with enhanced robustness.
[NLP-54] Les Misérables Dialogue: A film-based network representation of social communication
【速读】： 该论文旨在解决传统社会网络分析中对人际交流动态性与多维度关系刻画不足的问题，尤其针对叙事类文本中对话交互的复杂结构缺乏精细化建模。其核心挑战在于如何从文学或影视作品中提取具有时间戳、发言者-接收者关系及多层级社会互动语境的通信数据。解决方案的关键在于构建首个公开可用的《悲惨世界》对话时序文本网络（Les Misérables Dialogue temporal text network），该网络明确区分每条话语的说话人、直接接收者及其他参与者，并整合话语内容与精确时间信息；同时，基于十维社会维度模型（ten social dimensions model），生成多层网络表示，使每一层对应一种社会关系维度，从而实现对复杂社交互动的多层次、动态化表征。这一方法不仅为特定文本研究提供了高精度数据基础，还提出了一套可复用的通用框架，用于从类似叙事资源中构建富含语义与时空信息的通信网络数据集。
链接: https://arxiv.org/abs/2610.13148
作者: Theodora Moldovan,Georgios Panayiotou,Davide Vega
机构: Uppsala University (乌普萨拉大学)
类目: ocial and Information Networks (cs.SI); Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: 12 pages, 3 figures, 3 tables
Abstract:In this work, we revisit the classic Les Misérables benchmark network from the perspective of social communication. Using the 1998 film adaptation of the novel, we construct the publicly available Les Misérables Dialogue temporal text network, which explicitly distinguishes speakers, addressees, and other recipients of each utterance, along with its content and timing. Using the ten social dimensions model, we also derive multilayer network representations of the network, in which layers correspond to distinct relational dimensions. Beyond the network dataset, this work offers a general methodology for building similarly rich communication datasets from similar narrative sources.
[NLP-55] Neurograf v1: An End-to-End Romanian-First Language Model Family
【速读】： 该论文旨在解决为低资源欧洲语言——罗马尼亚语——从零开始训练语言模型的可行性问题，特别是在缺乏高质量、大规模语料库和专用训练基础设施的情况下。其核心挑战在于如何在有限资源条件下构建具备良好语言理解与生成能力的罗马尼亚语基础模型（Romanian-first base models）、指令遵循助手（instruction-following assistants）以及语义嵌入模型（semantic embedding models）。解决方案的关键在于构建一个端到端的实验性训练流水线Neurograf v1，包括：一个规模达635 GB、包含1.757亿文档的高质量罗马尼亚语语料库RoSfera；基于字节级分词（byte-level BPE）的80k词汇量分词器；一系列从160M到6B参数不等的解码器仅模型，均在1310亿个标记上进行训练；以及通过对比学习训练的两个嵌入模型。该研究通过系统性的模型缩放分析，验证了验证损失随模型规模一致下降，并且模型在罗马尼亚事实与文化知识方面随规模增长而提升。在WWTBM基准测试中，Neurograf-6B在罗马尼亚语上下文问题上达到69.89%准确率，表明该统一训练流水线具备构建高性能罗马尼亚语模型的能力。此外，计算最优性分析揭示参数缩放指数约为0.423，为未来优化提供理论依据。尽管Neurograf v1仍为实验演示系统，但其成功展示了在资源受限情境下实现多任务罗马尼亚语模型生态链的可行性，同时识别出诸如变音符号保留、语料质量控制、数据构成平衡及分词效率等关键实践挑战。
链接: https://arxiv.org/abs/2610.13134
作者: Ionut Adrian Rotaru
机构: 未知
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:We present Neurograf v1, an experimental end-to-end Romanian-first language-model pipeline developed to investigate the feasibility of training language models from scratch for a lower-resource European language. The pipeline comprises RoSfera, a 635 GB Romanian corpus containing 175.7 million documents; an 80k byte-level BPE tokenizer; five decoder-only models ranging from 160M to 6B parameters, trained on 131 billion tokens; three instruction-tuned assistants; and two contrastively trained embedding models. Training and evaluation were conducted using computing infrastructure at ELI-NP/IFIN-HH. The model family exhibits consistent scaling of validation loss and increasing Romanian factual and cultural knowledge with model size. On the 1,000-question WWTBM benchmark, Neurograf-6B achieves 69.89% accuracy on Romanian-context questions, while Neurograf-3.2B reaches 67.38%. Compute-optimal analysis yields a parameter-scaling exponent of approximately 0.423. Neurograf v1 serves as an experimental demonstrator rather than a production system. The study identifies practical challenges involving diacritic preservation, corpus quality, data composition, and tokenization efficiency, while demonstrating the feasibility of developing Romanian-first base models, instruction-following assistants, and semantic embedding models within a unified training pipeline. Subjects: Computation and Language (cs.CL); Machine Learning (cs.LG) Cite as: arXiv:2610.13134 [cs.CL] (or arXiv:2610.13134v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2610.13134 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[NLP-56] BenCoDiC: A Large-Scale Contextual Cyberbullying Corpus for Bengali Political News Discourse FULL VERSION
【速读】： 该论文旨在解决现有孟加拉语网络欺凌（cyberbullying）语料库在上下文信息、标注透明度、数据规模、可获取性及多维度分析支持方面的不足，从而制约了对施害者行为与社交网络的深入研究。其核心解决方案是构建首个公开可用的孟加拉语上下文多样化网络欺凌（BenCoDiC）语料库，包含从100个YouTube政治新闻视频及其评论区收集的50,250条文本实例，完整保留标题—评论—回复之间的层级关系，并基于九维星型模式（用户、视频、文本内容、上下文、时间、互动、政党、目标身份、语言类别）进行结构化组织。为确保标注质量，虽经五名AI聊天机器人初步评估但未达可靠性标准，最终采用双层人工标注结合专家验证机制，达成Fleiss’ κ = 0.86 和 Krippendorff’s α = 0.86 的高一致性。实验表明，引入对话上下文可使基于Transformer的分类模型性能实现稳定但有限的提升，验证了该语料库在支持上下文感知的网络欺凌检测及以施害者为中心的行为与网络分析中的有效性。
链接: https://arxiv.org/abs/2610.13121
作者: Md. Nesarul Hoque,Rudra Pratap Deb Nath,Umme Salma,Shima Chakraborty,Md. Hanif Seddiqui
机构: University of Chittagong(奇塔贡大学); Gopalganj Science and Technology University(戈帕尔甘杰科技大学); Bangladesh University(孟加拉国大学)
类目: Computation and Language (cs.CL); Social and Information Networks (cs.SI)
备注: 8 figures 16 tables
Abstract:Cyberbullying is a growing concern in online communities, yet existing Bengali corpora remain limited in contextual information, annotation transparency, scale, accessibility, and support for multidimensional analysis, thereby hindering robust detection and comprehensive study of harasser behaviors and networks. To address these gaps, we introduce the Bengali Contextual and Diverse Cyberbullying (\textitBenCoDiC) corpus, a publicly available contextual cyberbullying resource for Bengali political news discourse comprising 50,250 textual instances collected from 100 YouTube videos and their associated discussions. The corpus preserves caption–comment–reply relationships and is organized through a nine-dimensional star schema covering users, videos, textual content, context, time, engagement, political parties, target identities, and language categories. Five AI chatbots were initially evaluated for annotation but did not meet the predefined reliability criterion. Consequently, a two-tier human annotation process with expert verification was adopted, achieving Fleiss’ \kappa=0.86 and Krippendorff’s \alpha=0.86 . Statistical analyses characterize the corpus, while transformer-based experiments show that incorporating conversational context yields modest but consistent improvements over isolated-text classification. \textitBenCoDiC supports context-aware cyberbullying detection and perpetrator-oriented behavioral and network analysis. The corpus is available at this https URL.
[NLP-57] From 2.1M Hours of Raw Broadcast Audio to Finnish Speech SSL: Confidence Filtering and Architectural Analysis at Scale
【速读】： 该论文旨在解决广播档案（broadcast archives）在自监督学习（SSL）中因包含大量噪声、非语音及多语言内容而导致的预训练数据质量低下问题。现有方法通常依赖语音活动检测（VAD）或语言识别（LID）来筛选语音片段，仅保证语音存在性而忽视其质量。本文提出以自动语音识别（ASR）置信度作为预训练数据质量的代理指标，通过该方法对未标注语音进行质量过滤，即使训练集规模更小，仍实现了相对3%-7%的词错误率（WER）降低。其解决方案的关键在于利用ASR置信度实现高质量语音的精准筛选，从而提升模型性能。此外，为弥补语音SSL领域架构对比缺乏控制变量的问题，研究在参数量匹配的前提下系统评估了Transformer、Macaron-Net、Conformer与E-Branchformer等模型架构，进一步验证了所提方法在芬兰语场景下的有效性，尤其在基础规模（Base scale）及跨域（out-of-domain）任务上的显著提升。
链接: https://arxiv.org/abs/2610.13102
作者: Yaroslav Getman,Tamás Grósz,Tommi Lehtonen,Mikko Kurimo
机构: Aalto University (阿尔托大学); Walton Institute, South East Technological University (爱尔兰东南理工大学沃尔顿研究所); Finnish National Audiovisual Institute (KAVI) (芬兰国家音像研究所)
类目: Computation and Language (cs.CL); Sound (cs.SD); Audio and Speech Processing (eess.AS)
备注: Accepted to SLT 2026
Abstract:Broadcast archives offer scale and diversity for self-supervised learning (SSL) but contain substantial noisy, non-speech, and multilingual content. Prior work typically relies on voice activity detection or language identification (LID) to extract speech, ensuring presence rather than quality. Whether and how to filter unlabeled speech by quality for SSL, particularly from noisy broadcasts, remains underexplored. We present a large-scale Finnish SSL study starting from 2.1M hours of unconstrained broadcast audio. We propose automatic speech recognition (ASR) confidence as a proxy for pretraining data quality and show 3-7% relative WER improvements over LID-based filtering despite a smaller training set. We further address the lack of controlled architectural comparisons in speech SSL by evaluating Transformer, Macaron-Net, Conformer, and E-Branchformer at matched parameter budgets. Our models improve upon prior Finnish SSL baselines, particularly at Base scale and out-of-domain.
[NLP-58] KV-Repurpose: A Testbed for Evaluating Non-Prefix KV-Cache Reuse
【速读】： 该论文旨在解决大语言模型服务中键值缓存（KV-cache）复用受限于精确前缀匹配的问题，即当相同检索文档出现在不同系统提示、对话历史或动态元数据之后时，无法实现有效的缓存复用。其解决方案的关键在于提出KV-Repurpose——一个基于vLLM的开源系统，支持细粒度分段级（segment-wise）KV-cache复用的开发与评估。该系统通过融合缓存感知的分段调度、提示构造、容量管理、工作负载生成与运行时监控等机制，突破了传统前缀缓存的局限。实验表明，在长上下文基准测试中，朴素的分段复用在单文档问答与摘要任务中能较好保持输出质量，但在跨文档推理任务中存在明显不足；在符合Zipf分布的检索增强生成（RAG）工作负载下，尽管拥有1TB缓存容量，传统前缀缓存的命中率仅为17.9%，而KV-Repurpose在30GB缓存下实现了63.9%的令牌级缓存命中率，显著降低了首字节传输时间（TTFT），验证了其在复杂场景下的高效性与实用性。
链接: https://arxiv.org/abs/2610.13060
作者: Taiga Ikeda,Daisuke Miyashita,Jun Deguchi
机构: Kioxia Corporation(日本)
类目: Computation and Language (cs.CL)
备注:
Abstract:KV-cache reuse in large language model serving is commonly limited to exact prompt prefixes, preventing reuse when the same retrieved document appears after different system prompts, conversation histories, or dynamic metadata. We present KV-Repurpose, an open-source, vLLM-based system for developing and evaluating segment-wise KV-cache reuse beyond exact prefixes. The system combines cache-aware segment scheduling, prompt construction, capacity management, workload generation, and runtime monitoring. Experiments on long-context benchmarks show that naive segment reuse largely preserves output quality for single-document question answering and summarization, while exposing clear limitations in cross-document reasoning. Under a Zipfian RAG-style workload in which 20% of requests share a fixed prefix, KV-Repurpose achieves a substantially higher token-level cache hit rate than prefix caching at the same 30 GB cache capacity, 63.9% versus 3.3%, resulting in lower TTFT. Even with 1 TB of cache capacity, prefix caching reaches only a 17.9% hit rate in this workload. Source code is available under the Apache-2.0 license at this https URL.
[NLP-59] CliQ-RRG: Clinical-Knowledge Guided Disease-aware Visual-Textual Alignment for QA-Style Radiology Report Generation EMNLP
【速读】： 该论文旨在解决自动放射科报告生成（RRG）中普遍存在的问题：现有模型生成的报告往往冗长、结构松散，且未能有效捕捉诊断关键线索及多视角影像信息，导致临床实用性不足。其核心解决方案是提出一种统一的两阶段框架——临床知识引导的疾病感知视觉-文本对齐方法（CliQ-RRG），以实现可解释且基于临床知识的问答式报告生成。关键创新在于：第一阶段通过疾病感知的视觉-文本对齐模块，利用预测的疾病嵌入（disease embeddings）增强图像与文本表征的对齐，并结合先验引导注意力模块（PrAM）建模当前与既往扫描间的多视角依赖关系；第二阶段引入图谱增强的检索机制（GraphRAG-guided retrieval），将图谱驱动的临床证据注入中间文本表示，并由大语言模型重构为简洁、可解释的问答（QA）对形式，附带诊断摘要。实验在两个公开胸部X光数据集上验证了该方法在词汇与临床评估指标上的显著优势，能够生成准确且符合临床逻辑的问答式报告。
链接: https://arxiv.org/abs/2610.13059
作者: Chandravardhan Singh Raghaw,Shahid Shafi Dar,Arnav Nishith Sharma,Shrey Modi,Nagendra Kumar
机构: Indian Institute of Technology Indore(印度理工学院英德奥尔分校); University of Texas at Dallas(得克萨斯大学达拉斯分校); University of Wisconsin - Madison(威斯康星大学麦迪逊分校)
类目: Computation and Language (cs.CL)
备注: Accepted: EMNLP Findings 2026
Abstract:Radiology reports are essential for diagnostic reasoning and patient care, yet their manual preparation is time-consuming and cognitively demanding. Automatic radiology report generation (RRG) offers a scalable alternative, but existing models often produce lengthy, unstructured narratives that overlook diagnostic cues and multi-view information. We present Clinical-Knowledge Guided Disease-aware Visual-Textual Alignment for QA-Style Radiology Report Generation (CliQ-RRG), a unified two-stage framework for interpretable and clinically grounded reporting. In Stage 1, CliQ-RRG employs a Disease-aware Visual-Textual Alignment module that aligns image and text representations using predicted disease embeddings, reinforced by a Prior-Guided Attention Module (PrAM) to capture multi-view dependencies across current and prior scans. In Stage 2, GraphRAG-guided retrieval augments intermediate textual representations with graph-grounded clinical evidence, and a large language model restructures them into concise, interpretable question-answer (QA) pairs with diagnostic summaries. Experiments on two public chest X-ray benchmarks demonstrate that CliQ-RRG consistently outperforms prior methods across both lexical and clinical metrics, generating accurate and clinically coherent QA-style radiology reports. Code is available at: this https URL.
[NLP-60] ravel Back To Move Forward: Retrospective Exploration and Evolving for Long Horizon Agents
【速读】： 该论文旨在解决大语言模型智能体在长时程任务环境中因早期错误导致级联失败、陷入无效探索路径（dead-end trajectories）的问题。传统方法在面对此类困境时缺乏主动恢复能力，难以将已有的探索经验转化为后续决策的有效指导。其解决方案的关键在于提出ReTRAIL框架，通过耦合环境回溯（rewinding）与经验重用机制，实现“状态倒退而知识前移”的协同策略：在环境状态向前回溯至先前有效节点的同时，智能体保留并延续从被放弃的探索分支中学习到的知识。该框架采用共享策略网络，结合两种互补信号——基于状态锚定的GRPO（State-Anchored GRPO）用于比较不同续行路径以优化执行，以及分支推进奖励（branch-advancement reward）用于引导反思性探索。实验在MineSweeper、Sokoban、ALFWorld和ScienceWorld四个交互式基准任务上验证了，仅引入简单的回溯原语效果有限甚至可能损害性能；而ReTRAIL通过系统性地整合环境回溯与经验复用，显著提升了智能体在长时程任务中的鲁棒性与自主恢复能力，证明了在持续任务中动态重构探索轨迹的价值。
链接: https://arxiv.org/abs/2610.13058
作者: Ziang Ye,Wentao Shi,Lei Chen,Zhengzhou Cai,Yu Wang,Zhiyuan Yao,Zihan Wang,Xierui Song,Fuli Feng,Yixin Cao
机构: University of Science and Technology of China (中国科学技术大学); Shanghai Innovation Institute; Facebook (脸书); Zhejiang University (浙江大学); Tsinghua University (清华大学); Meituan (美团); Fudan University (复旦大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Large language model agents increasingly operate in long-horizon environments where early mistakes can trigger cascading failures and trap agents in dead-end trajectories. Agents must therefore be able to proactively recover from such states and turn their exploratory experience into guidance for subsequent decisions. We introduce ReTRAIL, a framework that enables agents to rewind the environment to earlier states while preserving valid progress and carrying forward knowledge learned from abandoned exploration. The environment state moves backward while the agent’s knowledge continues to move forward. ReTRAIL trains a shared policy with two complementary signals: State-Anchored GRPO compares alternative continuations from revisited states to improve execution, while a branch-advancement reward guides reflection through the progress of subsequent exploration. Experiments across four interactive benchmark MineSweeper, Sokoban, ALFWorld and ScienceWorld show that simply adding a rewind primitive provides limited benefit and can even degrade performance. In contrast, ReTRAIL enables agents to rewind from unproductive states and use insights from abandoned branches to guide subsequent exploration. These results demonstrate the value of coupling environment rewinding with experience reuse within an ongoing task for long-horizon task solving. The code is available at this https URL.
[NLP-61] CoBe: A Benchmark For Conversational Counterfactual Text Editing NEURIPS’26
【速读】： 该论文旨在解决生成式模型在面对假设性情境时，难以准确进行反事实文本编辑（counterfactual text editing）的问题。具体而言，模型需在不改变与假设无关的事实的前提下，仅调整受该假设影响的因果链，从而生成符合因果逻辑的反事实版本。然而，现有模型普遍倾向于采用关联性生成（associational generation），即根据统计相关性生成看似合理但不符合因果结构的文本，例如在医疗场景中因“未手术”与“症状较轻”存在统计关联而错误地弱化患者病情，而非真实还原若未做手术所导致的后果。其核心挑战在于：模型缺乏对因果结构的自主理解能力，无法在未被显式指示的情况下识别哪些信息应保留、哪些应修改。为解决此问题，论文提出了反事实基准测试集CoBe（Counterfactual Benchmark），包含2000个涵盖医疗、科学工程、商业及日常情境的高质量问题，用于评估模型在自然对话语境下的零样本反事实编辑能力。实验结果表明，前沿模型平均得分仅为58.05%，且性能随模型规模或输出长度的增加并不一致，暗示当前模型失败的根本原因可能源于训练目标未能充分引导因果推理，而非模型容量不足。因此，解决方案的关键在于设计能有效激发模型因果理解能力的训练范式与评测体系，推动模型从关联性生成向真正反事实推理演进。
链接: https://arxiv.org/abs/2610.13057
作者: Arvind Raghavan,Inwoo Hwang,Shreyas Havaldar,Kai-Zhan Lee,Aurghya Maiti,Yushu Pan,Jeffrey Wu,Mingxuan Li,Elias Bareinboim
机构: Causal Artificial Intelligence Lab; Columbia University (哥伦比亚大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET); Machine Learning (cs.LG)
备注: accepted to NeurIPS’26 workshops on Trustworthy AI For Good (AI4GOOD) and Trustworthy AI Evaluations (TAE)
Abstract:Counterfactual text editing is the ability to revise a given text in light of a hypothetical change while preserving facts not causally affected by that change. When asked what would have happened if a doctor had not recommended surgery, the model output should retain the patient’s medical history and modify only the consequences of the decision. This requires causal understanding: a model must determine, without being explicitly instructed to, what events are affected by the hypothetical change and what should remain fixed. This skill is central to human reasoning, especially in safety-critical domains like healthcare or law. By contrast, the task of associational text generation merely generates text statistically associated with the altered condition. In the medical example, an associational response might make the patient’s symptoms less severe because milder cases correlate with no surgery. Such responses produce a plausible scenario, but not the counterfactual version of the given one. Prior counterfactual-text datasets do not clearly separate these modes of reasoning. We introduce the Counterfactual Benchmark (CoBe), a testbed for models’ zero-shot ability to counterfactually edit a given textual scenario when prompted to do so in a conversationally natural way. CoBe contains 2000 questions spanning healthcare, science and engineering, business, and everyday scenarios. We test a suite of frontier and smaller models, with frontier systems achieving an average score of 58.05% . Our findings indicate that models frequently default to associational generation rather than preserving the causal structure of the original scenario. Moreover, performance does not scale consistently with either model size or output token length, suggesting that the failure may reflect model training objectives rather than insufficient model capacity.
[NLP-62] RAMP: Recurrent Adaptive Mixed Precision for Efficient Prefill in Recurrent-Depth Language Models
【速读】： 该论文旨在解决递归深度语言模型（recurrent-depth language models）在推理过程中因多次重复应用共享网络以优化内部表示而导致的计算开销问题，尤其是在长上下文预填充（long-context prefill）阶段，全序列需反复处理，显著增加了延迟。其核心挑战在于：虽然权重与激活量化（weight-and-activation quantization）可通过低精度算术加速计算，但重复使用量化运算会引入数值扰动，并在递归路径中累积，影响最终表示质量。研究通过系统分析发现，早期引入的量化误差会随着后续更多递归步骤的平滑作用而被衰减，因此对最终结果影响较小。基于这一发现，论文提出RAMP（Recurrent Adaptive Mixed Precision）方案：在递归深度的早期阶段采用低精度的权重与激活计算进行快速精炼，而在最终阶段恢复高精度计算以保证输出质量。在匹配预算的实验中，RAMP在长达4K上下文长度下保持接近全精度的预填充性能，同时在NVIDIA H100上实现最高达1.16倍的端到端首次预填充加速，对应13.9%的延迟降低。
链接: https://arxiv.org/abs/2610.13041
作者: Ke Wan,Chen Chen
机构: University of Virginia(弗吉尼亚大学)
类目: Computation and Language (cs.CL)
备注: 16 pages, 3 figures, 6 tables. Preprint
Abstract:Recurrent-depth language models improve inference-time reasoning by repeatedly applying a shared network to refine internal representations, but the additional recurrent computation also increases inference cost. This overhead is particularly pronounced during long-context prefill, where the full input sequence is repeatedly processed across recurrent depth. Weight-and-activation quantization offers a natural way to accelerate this computation through lower-precision arithmetic, yet repeatedly applying quantized computation introduces numerical perturbations that accumulate along the recurrent trajectory. We systematically analyze how such errors propagate across recurrent depth and show that quantization errors introduced earlier are attenuated by more subsequent recurrent steps and therefore have a smaller effect on the final representation. Matched-budget experiments strongly support this prediction, showing that placing quantized computation earlier in recurrent depth consistently yields the best fidelity. Based on this insight, we introduce RAMP (Recurrent Adaptive Mixed Precision), which performs early recurrent refinement using low-precision weight-and-activation computation and restores high precision for terminal refinement. Across context lengths up to 4K, RAMP preserves near-full-precision prefill quality while achieving up to 1.16x end-to-end first-prefill speedup on an NVIDIA H100, corresponding to a 13.9% latency reduction.
[NLP-63] GeoGR: Spatial-Semantic Token Compression and Group Routing for Efficient 3D VLMs
【速读】： 该论文旨在解决多视角视觉语言模型（Multi-view Vision-Language Models, VLMs）在理解三维场景时因视觉标记序列过长而导致的推理成本高昂问题。核心挑战在于：一方面，不同视角对同一场景区域存在重复观测，产生冗余；另一方面，模型在每一层大语言模型（LLM）中均处理全部视觉标记，无论其与当前任务的相关性如何。为此，本文提出GeoGR这一两阶段框架，其关键创新在于联合压缩场景表征与视觉计算过程。在投影阶段，GeoSemZip通过将跨视角观测融合为3D体素标记（voxel tokens），并结合语义显著性与空间覆盖度构建紧凑的场景表示，未被选中的体素特征则聚合为上下文锚点以保留潜在信息。在LLM阶段，基于观察发现查询条件下的标记相关性在局部层间保持稳定但随深层变化，提出GroupRoute机制，结合延迟进入与早期退出策略，并引入可恢复的分组跳过机制：低相关性标记可跳过完整LLM层，同时保留其隐藏状态，后续在满足计算预算的锚点层重新加入活跃组。此外，为支持压缩感知的后训练，构建仅含原始训练集30%样本（67K条）的紧凑数据集。实验表明，GeoGR在保持LLaVA-OneVision-7B和Video-3D LLM-7B模型95.2%与96.8%性能的同时，分别实现6.8×和6.1×的预填充加速，验证了其在具有/无显式3D空间编码的多种3D VLM上的高效性与普适性，实现了优异的性能-效率权衡。
链接: https://arxiv.org/abs/2610.13035
作者: Yongxin Zheng,Hao Wu,Fang Li,Hu Fu,Peiran Yin,Xudong Wang,Haozhe Hu,Xinghao Chen,Yunpu Ma,Wei Zhang,Xiaoyu Shen
机构: EIT-NLP Lab, Eastern Institute of Technology, Ningbo(东华理工大学自然语言处理实验室); Shanghai Jiao Tong University(上海交通大学); The Hong Kong Polytechnic University(香港理工大学); Munich Center for Machine Learning, LMU Munich(慕尼黑大学机器学习中心)
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Multi-view representations enable pretrained image and video vision-language models to understand 3D scenes, but their long visual token sequences make inference costly. Redundancy arises both from repeated observations of the same scene regions across views and from processing all visual tokens at every LLM layer, regardless of their relevance to the current computation. We propose GeoGR, a two-stage framework that jointly compresses scene representations and visual computation. At the projector level, GeoSemZip consolidates cross-view observations into 3D voxel tokens and combines semantic saliency with spatial coverage to construct a compact scene representation. Unselected voxel features are aggregated into contextual anchors to retain scene information that would otherwise be discarded. At the LLM level, we identify an effective visual computation window and observe that query-conditioned token relevance remains locally stable but changes over longer layer intervals. Guided by these findings, GroupRoute combines late entry and early exit with recoverable group-wise skipping. Low-relevance tokens bypass complete LLM layers while retaining their hidden states and can rejoin the active group at subsequent anchor layers selected under a computation budget. For compression-aware post-training, we construct a compact dataset of 67K samples by retaining 30% of the original training pool. With this protocol, GeoGR retains 95.2% and 96.8% of the dense post-trained models’ performance on LLaVA-OneVision-7B and Video-3D LLM-7B, respectively, while accelerating LLM prefill by 6.8\times and 6.1\times . These results demonstrate the consistent effectiveness of GeoGR across 3D VLMs with and without explicit 3D spatial encoding, highlighting a favorable performance-efficiency trade-off. The code is available at this https URL.
[NLP-64] Evo2: Evolving the Evolver through Weight-Harness Co-Evolution
【速读】： 该论文旨在解决自演化智能体（self-evolving agents）在模型权重更新与任务执行框架（harness）优化之间缺乏协同的问题。现有方法通常将二者独立处理：一类通过自生成经验来更新模型权重，另一类则单独改进提示词、工具调用、上下文管理及执行反馈等框架组件，但忽视了权重与框架之间的相互依赖关系，导致演化过程效率低下且难以实现稳定提升。为此，本文提出 Evo² 框架，实现权重与框架的联合演化（co-evolution）。其核心创新在于设计了一种统一的双角色（dual-role）流水线，由单一策略网络同时担任“提议者”（Proposer）和“反思者”（Reflector）：前者负责生成框架修改指令，后者则评估修改效果并指导迭代优化。同时，框架修改及其执行结果被用于驱动提议者与反思者的联合训练，采用 EvoTIDE 训练流程，通过编辑提取（edit extraction）与前缀延续（prefix continuation）恢复有效轨迹，并结合监督微调（SFT）与交错式近端策略优化（interleaved GRPO），实现双角色的高效协同学习。实验表明，Evo² 在 Polyglot 和 SWE-bench Verified 两个代码基准上分别达到 82.1% 和 48.3% 的准确率，显著优于最强基线（62.6% 和 41.0%），且演化后的框架具备跨任务迁移能力，在跨基准评估中排名第一。此外，该框架可扩展至私有化模型场景，成功将 GPT-5-mini 智能体性能从 24.4% 提升至 48.3%，验证了其在不同模型与任务间的广泛适用性与强泛化能力。
链接: https://arxiv.org/abs/2610.13025
作者: Chejian Xu,Shujian Zhang,Wenxuan Zhou,John Lambert,Beck Chen,Bo Li,Andrew Hard,Rajiv Mathews
机构: University of Illinois, Urbana-Champaign(伊利诺伊大学香槟分校)
类目: Computation and Language (cs.CL)
备注:
Abstract:Self-evolving agents are increasingly used to improve language model systems without human intervention through either weight updates or harness improvements. Existing approaches typically pursue these directions separately: some methods update model weights using self-generated experience, while others rewrite the harness that defines how an agent uses prompts, tools, context, and execution feedback. However, these approaches overlook the relationship between model weights and the agent harness. To connect these processes and ensure effective and smooth agent self-evolving, we propose Evo ^2 , a framework for weight-harness co-evolution. For harness updates, we design a unified dual-role pipeline that a single policy serves as both a Proposer, which writes harness edits, and a Reflector, which diagnoses their effects and guides revision. For weight updates, harness modifications and their execution outcomes guide the training of both the Proposer and the Reflector. We further develop EvoTIDE, a training pipeline that recovers usable trajectories through edit extraction and prefix continuation, then combines SFT with interleaved GRPO across the two roles. Extensive experiments across three coding benchmarks demonstrate that Evo ^2 significantly outperforms existing self-evolution methods. It achieves 82.1% on Polyglot and 48.3% on SWE-bench Verified, compared with 62.6% and 41.0% for the strongest baseline, respectively. We also show that the evolved harnesses transfer to different tasks without further evolution and rank first in cross-benchmark evaluations. Our dual-role harness improvement framework is also able to extend to self-evolution with proprietary models, improving a GPT-5-mini agent’s performance from 24.4% to 48.3%. These results demonstrate the applicability of the framework Evo ^2 across domains and its broad transferability across models and tasks.
[NLP-65] EmbodiedCLBench: Evaluating Continual Learning for Self-Evolving Embodied Agents
【速读】： 该论文旨在解决持续学习（continual learning）在具身环境（embodied environments）中缺乏有效评估基准的问题。现有研究大多局限于非具身场景，难以衡量智能体在动态、交互式物理环境中持续积累与迁移知识的能力。为此，论文提出了首个面向具身仿真环境的持续学习基准——EmbodiedCLBench，其核心评估原则为组合泛化（compositional generalization），旨在检验智能体是否能够从基础任务中习得技能，并将其重新组合以解决未见过的复杂高级任务。解决方案的关键在于构建一个可扩展、结构化的评估框架，通过系统性实验揭示当前具身智能体在持续学习中的共性局限：尽管零样本条件下高级任务几乎无法完成，但来自基础任务的经验仍能带来稳定且可复现的性能提升；然而，这种提升并不随学习样本数量增加而线性增长，表明现有模型难以有效提取额外经验中的深层信息。研究结果凸显了持续学习作为具身智能体实现自我演化的核心能力尚未被充分探索，同时为未来设计高效自进化智能体提供了关键资源与方向。
链接: https://arxiv.org/abs/2610.13021
作者: Jie Huang,Yanan Chen,Ruixun Liu,Kaichen He,Xinyi He,Rui Huang,Zilong Zheng,Zhenliang Zhang,Yiwu Zhong
机构: Peking University (北京大学); State Key Laboratory of General Artificial Intelligence, BIGAI (通用人工智能国家重点实验室，BIGAI); University of Hong Kong (香港大学)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Continual learning requires models to accumulate past experience and transfer it to new tasks. Despite substantial research on continual learning, existing work remains largely confined to non-embodied settings, without extending to embodied environments. To address this gap, we introduce EmbodiedCLBench, the first benchmark in embodied simulation for evaluating the continual learning capability of self-evolving agents. With compositional generalization as the core evaluation principle, our benchmark evaluates whether agents can first learn from basic tasks and then recombine the acquired skills to solve complex, unseen advanced tasks. Based on EmbodiedCLBench, we conduct extensive experiments across multiple agent harnesses and learning methods, revealing consistent limitations and distinctive behaviors. Our results show that while advanced tasks can be hardly solved under zero-shot setting, the experience from basic tasks enables consistent improvement. Such benefit from the experience remains stable even if the task complexity increases. However, this improvement does not scale accordingly with the number of learning samples, and current agents cannot extract meaningful information from additional experience. Collectively, our findings highlight continual learning as a fundamental yet underexplored capability, and our benchmark offers valuable resources for designing effective self-evolving agents in embodied environments. Our code and dataset are available at this https URL.
[NLP-66] Evaluating LLM Creativity through Long-Tail Performance
【速读】： 该论文旨在解决当前大语言模型（LLM）创造力评估基准在任务设计与度量标准上差异显著，导致难以衡量是否存在统一的创造力内涵这一核心问题。其解决方案的关键在于提出一种基于参考输入-输出分布长尾区域的任务特定性能作为创造力的统一表征：即真正体现创造力的生成行为应位于由预训练文本源决定的输入-输出分布的长尾部分。研究基于新颖性-质量乘积（novelty-quality product）理论框架，以n-gram在预训练数据中的缺失程度作为新颖性的代理指标，通过在15个基准和26个开源模型上进行实证分析，发现创造力基准确实比标准基准更位于分布的长尾区域。此外，研究进一步表明，在两类基准中，从长尾子集获得的模型排名与人类对模型创造力的判断（来自LM-Arena）具有更强一致性。基于此，论文提出q@Tail(α)，一种低成本的创造力诊断指标，用于衡量现有基准中尾部分数段的平均任务质量。应用该指标评估各类促进创造力的方法后发现，提升模型在长尾区域的表现仍有巨大潜力，从而为改进大语言模型的创造力提供了明确方向。
链接: https://arxiv.org/abs/2610.12998
作者: Yichen Wang,Tenghao Huang,Vishakh Padmakumar,Mina Lee
机构: University of Chicago(芝加哥大学); Microsoft(微软); Stanford University(斯坦福大学)
类目: Computation and Language (cs.CL)
备注: 26 pages, including references and appendices. Code and data: this https URL
Abstract:Creativity benchmarks for large language models (LLMs) vary widely in task and metric design. This raises the question of whether they capture a common notion of creativity. We propose that this shared target can be formalized as task-specific performance in the long tail of a reference input-output distribution, which describes how common input-output pairs are relative to a chosen source of text. We ground this proposition in the novelty-quality product formulation and evaluate it empirically across 15 benchmarks and 26 open-weight models, using n-gram absence from the pretraining data as a novelty proxy. Our results show that creativity benchmarks lie further in the tail regions than standard benchmarks. Moreover, on both creativity and standard benchmarks, model rankings from higher-tail subsets of each benchmark align more closely with human creativity judgments in LM-Arena. Building on these findings, we introduce q@Tail( \alpha ), a lower-cost creativity diagnostic that measures mean task quality on the tail fraction of an existing benchmark. Applying it to creativity-promoting methods reveals substantial room to improve LLM creativity through stronger tail performance.
[NLP-67] Benchmarking Embedding Geometries and Clustering Algorithms for Unsupervised Patent Claim Classification
【速读】： 该论文旨在解决现有专利检索系统因依赖分类代码（Classification Code）结构而导致跨类别发现困难的问题。传统方法受限于固定的分类体系，难以捕捉不同技术领域间的潜在关联，从而影响了对相关现有技术（prior art）的全面检索。其核心解决方案是采用无监督表示学习方法，通过在45,000件美国专利文本上训练一个双曲空间（Hyperbolic Space）变分自编码器（Variational Autoencoder, VAE）与一个匹配的欧氏空间（Euclidean Space）VAE，探索非欧几何结构是否有助于揭示隐藏在专利文本中的跨类别语义关系。实验结果显示，双曲模型在顶层10个结果中识别出真正跨类别的现有技术的概率比欧氏模型高52%（18.76% vs. 12.34%，基于3,000次查询），显著提升了检索实用性。此外，双曲模型与官方分类体系的一致性较低（归一化互信息NMI为0.2392，对比欧氏模型的0.3206），这从几何角度说明：分类体系的目标与现有技术检索需求存在本质差异，而双曲空间更符合后者所需的层次化、长尾式语义组织。进一步在10个技术领域的扩展研究中发现，一个领域分类广度（即所覆盖的CPC子组数量）可预测模型性能（皮尔逊相关系数r = -0.642, p = 0.045），而每个子组内的专利数量更是更强的预测因子（r = 0.715, p = 0.020），为实践者提供了可量化的判断依据，以确定该方法在哪些技术领域最具价值。所有结果均以统计透明方式报告，并公开了完整的自动化实现（共91项测试），确保可复现性与应用推广性。
链接: https://arxiv.org/abs/2610.12997
作者: Sujith Subramanian,P N Bhargav Teja,Susen Sarkar,Rajasekhara Reddy Duvvuru Muni
机构: 未知
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Prior-art retrieval systems are structurally organized around classification codes, making cross-code discovery difficult. This paper asks if an unsupervised representation trained on patent text can recover relevant connections that code-restricted search cannot, and if hyperbolic space helps. We trained a hyperbolic and a matched Euclidean Variational Autoencoder (VAE) on 45,000 US patents (96 runs, 6 seeds). The hyperbolic model retrieves genuinely cross-category prior art 52% more often than the Euclidean model (18.76% vs. 12.34% of top-10 results, 3,000 queries). This represents a practical gain for the motivating search problem. The hyperbolic model agrees less with official classification (NMI 0.2392 vs. 0.3206), which we explain geometrically: the two measures capture different goals, and only one aligns with prior-art search needs. In a study of 10 technology domains (50,000 more patents), we find that a domain’s classification breadth–the number of distinct CPC subgroups spanned–predicts approach performance (Pearson r=-0.642, p=0.045, N=10), and that patents per subgroup is an even stronger predictor (r=0.715, p=0.020). This provides a checkable signal for practitioners to determine where the method is most valuable. We report all findings with statistical transparency and release a complete, 91-test automated implementation.
[NLP-68] What Should SFT Learn? Conditional Information Gain for Generalizable Post-Training
【速读】： 该论文旨在解决监督微调（Supervised Fine-Tuning, SFT）中因强制模型模仿外部提供的推理轨迹而导致的预训练行为干扰问题，尤其在面对超出训练分布的泛化任务时表现受限。现有动态SFT方法虽通过模型侧信号（如预测概率、先验支持度或分布兼容性）重加权监督信号以缓解此问题，但这些信号并不等价于学习价值——某些低置信度的token可能并非错误，而是任务特定的关键决策点。为此，论文提出一种基于信息论的框架CIG-SFT（Conditional Information Gain-based SFT），其核心在于量化每个示范token在给定任务输入条件下的任务相关信息增益（Conditional Information Gain, CIG）。具体而言，在教师强迫（teacher forcing）设置下，通过比较冻结参考模型在有无任务输入条件下对目标token的似然差异，计算出任务输入所减少的不确定性，从而衡量该token对当前任务的学习价值。随后，将该信息增益转化为KL正则化的策略投影，并推导出一个等效的标量加权SFT目标函数，其梯度与投影目标完全一致。实验表明，CIG-SFT在数学推理与代码生成基准上均显著优于标准SFT及现有自适应微调基线，尤其在挑战性评估分布上的泛化性能提升明显，且无需额外训练数据或在线采样。
链接: https://arxiv.org/abs/2610.12995
作者: Yuxuan Gu,Kequan Niu,Xiaocheng Feng,Yun Li,Yiqiao Yang,Bing Qin
机构: Harbin Institute of Technology(哈尔滨工业大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Supervised fine-tuning (SFT) remains a widely used approach for post-training large language models, because fixed demonstrations can directly introduce desired reasoning strategies and behavioral patterns. Yet forcing a model to imitate externally provided trajectories may also interfere with behaviors already supported by pretraining, limiting generalization beyond the training distribution. Recent dynamic SFT methods mitigate this issue by reweighting token-level supervision according to model-side signals such as predictive probability, prior support, or distributional compatibility. However, model compatibility is not equivalent to learning value: a token that is weakly supported by the current model may either be an undesirable mismatch or precisely the task-specific decision that the demonstration is intended to teach. We propose CIG-SFT, an information-theoretic framework that estimates the task-conditioned information carried by each demonstrated token. Under teacher forcing, we compare the token likelihood from a frozen reference model with and without access to the task input while keeping the gold solution prefix fixed. The resulting conditional information gain quantifies how much the task itself reduces uncertainty about the demonstrated decision. We then convert this information into a KL-regularized projection of the current policy and derive an equivalent scalar-weighted SFT objective whose logit gradient exactly matches that of the projected target. Across mathematical reasoning and code-generation benchmarks, CIG-SFT consistently outperforms standard SFT and recent adaptive fine-tuning baselines, with particularly strong improvements in generalization to challenging evaluation distributions, while requiring neither additional training data nor online rollouts.
[NLP-69] Language Models Have Interpretable Narrative Mechanisms
【速读】： 该论文旨在解决生成式语言模型中是否存在内部组件能够表征叙事性（narrativity）这一问题，即探究语言模型是否具备专门用于捕捉文本叙事特征的内在结构。其核心解决方案在于通过分析GPT-2-Small、Gemma-2-2B和Llama-3.1-8B等模型，识别出与叙事性显著相关的注意力头（attention heads）、MLP神经元（MLP neurons）以及稀疏自编码器特征（sparse autoencoder features）。研究发现，对这些与叙事性相关联的神经元和特征集进行消融处理后，高叙事性文本的下一个词预测损失显著上升，且开放式生成内容的叙事性下降，表明这些组件在模型生成具有连贯叙事结构的内容中起到了因果作用。尽管在故事补全和叙事问答等任务上效果最为显著，但不同模型和语言间表现存在差异，而在幻觉与虚构检测任务上的结果则不一致。该研究为叙事性相关组件在模型行为中的因果贡献提供了实证支持，但其内部组织机制、与叙事理论的关系及其更广泛的功能仍待进一步探索。
链接: https://arxiv.org/abs/2610.12989
作者: David Yiyang Liu,Aditya Joshi,Paul Dawson,Andrew Piper
机构: UNSW Sydney(新南威尔士大学); McGill University(麦吉尔大学)
类目: Computation and Language (cs.CL)
备注: 24 pages, 5 figures, 16 tables
Abstract:We investigate whether language models contain internal components that contribute to representing narrativity, the degree to which a text exhibits narrative properties. Across GPT-2-Small, Gemma-2-2B, and Llama-3.1-8B, we identify attention heads, MLP neurons, and sparse autoencoder features whose activations correlate with narrativity. Ablating selected neuron and feature sets increases next-token prediction loss more for high-narrativity than for low-narrativity texts, and reduces the narrativity of open-ended generations. On downstream benchmarks, the largest effects occur in story completion and narrative question answering, although they vary across models and languages; results on confabulation and hallucination benchmarks are mixed. These findings provide causal evidence that selected sets of narrative-associated components contribute to model behaviour, while their internal organisation, relation to narrative theory, and broader functions remain open questions.
[NLP-70] Forecasting Corpus-Sampling Disagreement in Masked Text Reconstruction
【速读】： 该论文旨在解决在相同语料库群体中采集第二个文本语料库时，语言模型预测结果可能发生多大程度变化的问题，特别是在基于掩码文本重建（masked-text reconstruction）任务下，评估平滑预测器在完整50,257个词元的GPT-2词汇表上的输出稳定性。其核心问题是：当训练数据量变化时，预测结果的不一致性（disagreement）如何随样本规模变化，以及能否通过可计算的统计方法进行准确预测。解决方案的关键在于提出一个一阶公式，用于估算从两个独立语料库拟合的预测器之间的期望不一致性，该公式综合考虑了文档长度差异、随机上下文计数波动以及词元偏移间的相关性，并可通过一个独立参考语料库进行无须访问目标语料库的评估。研究发现，随着语料库规模从512增至2,048个64词元块，不一致性仅下降5%–40%，远低于由1/n缩放法则预期的75%；这一缓慢下降趋势主要归因于稀有上下文的平滑处理。此外，预测准确性更依赖于参考语料库的规模而非相关性建模方式——小参考语料库会系统性低估不一致性，而采用源分割的jackknife校正方法可将校准误差降低57%–59%。最终，当参考语料库小于目标语料库时，简单的平滑多项式近似表现最佳；反之，非线性源自助法（source bootstrap）最为准确。值得注意的是，尽管基于词元计数的预测能部分识别出对语料库敏感的输入，但无法捕捉神经语言模型中观测到的更快的不一致性衰减趋势。
链接: https://arxiv.org/abs/2610.12987
作者: Hare Krishna
机构: 未知
类目: Computation and Language (cs.CL); Machine Learning (cs.LG); Machine Learning (stat.ML)
备注: 12 pages + Appendices
Abstract:If a second text corpus were collected from the same population, how much would a predictor’s outputs change? We study this question for masked-text reconstruction using a smoothed predictor built from nearby token-pair counts and evaluated over the full 50,257-token GPT-2 vocabulary. Treating each source document as one observation, we derive a first-order formula for the expected disagreement between predictors fitted to two independent corpora. The formula accounts for variable document length, random context counts, and correlations across token offsets, and it can be evaluated from a separate reference corpus without access to either target corpus. On TinyStories, WikiText-103, and CNN/DailyMail, growing each corpus from 512 to 2,048 chunks of 64 tokens lowers disagreement by only 5–40%, far short of the 75% implied by 1/n scaling. The forecast tracks this slow decline, which we trace to smoothing of rarely seen contexts. Forecast accuracy depends less on how these correlations are modeled than on the size of the reference corpus: small references systematically underpredict disagreement. A source-split jackknife that uses only reference data reduces this calibration error by 57–59%. After this correction, a simpler smoothed-multinomial approximation is most accurate when the reference corpus is smaller than the target corpus, and a nonlinear source bootstrap is most accurate when it is larger. Finally, small masked diffusion language models trained on the same corpora show that the count-based forecasts partly identify which inputs are most sensitive to the corpus, but miss the neural models’ much faster decline in disagreement.
[NLP-71] SmartSalesBench: A Resistance-Aware Multi-Turn Benchmark for Evaluating LLM Sales Agents
【速读】： 该论文旨在解决现有对话评估基准在销售场景应用中的局限性，即传统任务导向型对话基准假设用户为合作方，仅衡量任务完成度，而忽视了真实销售互动中买家的抗拒心理与复杂行为。为此，论文提出了SmartSalesBench，首个面向大语言模型（LLM）销售代理的多轮对话评估基准，其核心创新在于引入基于心理学理论构建的抗拒型买家角色（buyer personas），通过模拟真实销售情境下的对抗性交互，全面评估销售代理的说服力与适应能力。解决方案的关键在于：1）采用检索增强生成（RAG）技术确保销售代理与买家角色生成的真实性与一致性；2）构建包含五类销售代理、十二类买家人格、十五款智能手机产品（覆盖六档价格区间）及四组受控实验的系统化评估框架，共开展13,680次会话；3）设计分层评估体系，涵盖九项指标，包括主要结果指标（转化率，CR；买家响应评分，BRS；回复意图识别率，RIR）、次要质量指标（销售语调匹配度，SMS；话语流畅性，PFS；情绪感知指数，ETI）以及未来可扩展的探索性指标（如意图转移度，ITS；情感一致性，ARI；说服策略多样性，SPI）。评估方法融合自动化大模型评判与人工评审（n=50，Kappa=0.71，皮尔逊相关系数r=0.81于BRS），实现客观性与主观洞察的结合，从而更真实地反映销售代理在高对抗性情境下的表现。
链接: https://arxiv.org/abs/2610.12975
作者: P N Bhargav Teja,Velpula Lokesh Reddy,Madhu Basumata,Susen Sarkar,Rajasekhara Reddy Duvvuru Muni
机构: 未知
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: Request for review
Abstract:We present SmartSalesBench, the first multi-turn conversational benchmark explicitly designed to evaluate large language model (LLM) sales agents against psychologically grounded, resistant buyer personas. Existing task-oriented dialogue benchmarks assume cooperative users and measure task completion; SmartSalesBench inverts this assumption, placing agents against personas programmed to resist and challenge across conversations of up to twenty turns. The benchmark includes five agent profiles, twelve buyer personas, fifteen smartphone products across six price tiers, and four controlled experiments with 3 iterations totaling 13,680 sessions. Both sales-agent and buyer persona generations are grounded through retrieval-augmented generation (RAG). We introduce nine evaluation metrics grouped into three tiers: primary outcome metrics (CR, BRS, RIR), secondary quality metrics (SMS, PFS, ETI), and exploratory metrics planned for future reporting (ITS, ARI, SPI). Our evaluation combines automated LLM-as-judge scoring with internal human assessment (n = 50, \kappa = 0.71, Pearson r = 0.81 with BRS).
[NLP-72] MVGraph: Benchmarking LVLMs on Evidence Composition across Multi-View Visual Graph
【速读】： 该论文旨在解决大视觉语言模型（LVLMs）在多图推理任务中面临的跨视图证据对齐与融合难题，即当查询所需信息分散于多个相互关联的视觉图视图中时，现有模型难以有效整合来自不同源（如特定来源图、时间快照或局部观测）的信息。其核心挑战在于，传统图推理基准仅限于单一封闭结构，忽视了跨视图间证据的对齐与组合能力评估。为此，作者提出了MVGraph基准，包含8,000个实例，覆盖8种图论任务，源自“部分图视图”与“时间序列图视图”两种多图场景，所有问题均经程序化构建并验证为单视图不可解。解决方案的关键在于将多图推理分解为四个互补能力：感知（Perception）、对齐（Alignment）、组合（Composition）与推理（Reasoning），并设计29项诊断任务（共64,000个实例）以分别探测各阶段能力，同时提供黄金标准中间表示用于过程评估。实验基于15个LVLMs的分析揭示，跨视图边对齐和关系级组合是主要瓶颈，且时间约束与视图数量增加进一步暴露模型的能力边界。
链接: https://arxiv.org/abs/2610.12961
作者: Yingjie Zhu,Han Cheng,Xuefeng Bai,Youcheng Pan,Yang Xiang,Kehai Chen
机构: Harbin Institute of Technology, Shenzhen, China; Peng Cheng Laboratory, Shenzhen, China
类目: Computer Vision and Pattern Recognition (cs.CV); Computation and Language (cs.CL)
备注:
Abstract:We introduce MVGraph, a benchmark for evaluating large vision-language models (LVLMs) on multi-graph reasoning where the evidence required by a query is distributed across multiple interrelated visual graph views. Although such evidence commonly resides in source-specific graphs, temporal snapshots, or local observations, existing graph reasoning benchmarks remain confined to a single self-contained structure, assessing only graph perception and reasoning while leaving the alignment and composition of evidence across views underexplored. MVGraph comprises 8k instances spanning 8 \textitgraph-theoretic tasks, abstracted from two multi-graph scenarios (partial and temporal graph views). Each problem is programmatically constructed and verified to be unsolvable from a single view. Beyond end-to-end evaluation, we decompose multi-graph reasoning into four complementary capabilities—Perception, Alignment, Composition, and Reasoning—and design 29 diagnostic tasks with 64k instances to probe each one, along with golden intermediate representations for evaluating the intermediate process. Across 15 LVLMs, we reveal the difficulty of multi-graph reasoning and identify cross-view edge alignment and relation-level composition as prominent bottlenecks through stage-oriented diagnostics. Meanwhile, temporal constraints and increasing view counts expose further capability boundaries. Code and data are available at this https URL.
[NLP-73] Surfing the Activation Wave: Analyzing the Information and Geometry of LLM Hidden States for Speculative Decoding NEURIPS
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在推测解码（speculative decoding）中如何高效选择多层解码器隐藏状态（decoder hidden states）的问题。现有方法通常依赖于固定的位置启发式规则（如选取第2层、中间层及倒数第3层），但这种做法忽略了不同层间信息的互补性与冗余性，且最优层数组合的搜索空间呈组合爆炸特性，难以通过穷举求解。为此，本文提出一个基于双重互补准则的系统性框架：一是信息量（informativeness），通过矩阵熵分析（matrix-entropy analysis）量化各层隐藏状态的信息丰富程度；二是多样性（diversity），利用中心化核对齐（Centered Kernel Alignment, CKA）度量层间表示差异，避免冗余。研究揭示了解码器表示在深度维度上存在显著的几何与信息分隔结构，据此设计出兼顾高信息量与低冗余性的熵与CKA联合层选择算法。此外，引入词元熵过滤（token-entropy filtering），剔除低预测熵词元对应的隐藏状态，以提升层选择统计的质量。在EAGLE3风格的推测解码中，所选层数组合优于传统固定基线（如[2, N//2, N-3]），并为某些默认策略为何仍具竞争力提供了可解释性依据。本工作不仅为多层隐藏状态选择提供了实用方案，也为理解LLM解码器内部表征的几何结构与信息分布奠定了基础，并可推广至相关任务。
链接: https://arxiv.org/abs/2610.12939
作者: Raghavv Goel,Sudhanshu Agrawal,Mukul Gagrani,Risheek Garrepalli,Mingu Lee
机构: 未知
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Accepted at multiple Neurips Workshop: Axiom, GDDL, and PriGM
Abstract:Decoder hidden states from different layers of large language models (LLMs) often encode complementary information. However, existing speculative decoding methods typically rely on a small set of target-model layers chosen using fixed, position-based heuristics. Selecting an optimal subset of layers is inherently a combinatorial problem, making exhaustive evaluation infeasible even for moderately deep models. In this work, we present a principled framework for multi-layer hidden-state selection for speculative decoding based on two complementary criteria: informativeness, measured through matrix-entropy analysis, and diversity, quantified using centered kernel alignment (CKA). We investigate layer-wise Shannon entropy, aggregate entropy under hidden-state concatenation, and pairwise CKA dynamics across depth, revealing distinct geometric and informational compartments within decoder representations. Motivated by these findings, we propose entropy and CKA-based layer selection algorithms that favor hidden-state sets that are both highly informative and minimally redundant. As part of this framework, we introduce token-entropy filtering, which removes hidden states associated with low predictive-entropy tokens, thereby improving the quality of layer-selection statistics. In EAGLE3-style speculative decoding, our selected sets outperform fixed baseline choices, including the default [2, N//2, N-3] rule, while providing a clearer explanation of why some defaults can remain competitive. Our results provide a practical recipe for multi-layer hidden-state selection for speculative decoding, insights into the geometry and information in LLM decoder states, and a foundation for extending similar analysis to related applications.
[NLP-74] SEEDS: Preview-Guided Evidence Admission for Search Agents
【速读】： 该论文旨在解决现有搜索代理（search agents）在处理外部知识时存在的核心问题：将检索证据与使用证据的过程过度混同，导致信息采纳缺乏对当前推理状态的动态适应性。传统方法通常采用固定或基于排名的策略来决定采纳哪些检索结果，但这种做法忽视了证据的实际效用高度依赖于代理当前的推理上下文——低排名候选可能对当前步骤至关重要，而高排名候选却可能冗余、无关甚至具有误导性。为此，论文提出“证据准入”（evidence admission）这一新范式，即在每轮搜索中决策哪些检索到的候选证据应被允许进入代理不断演化的推理上下文。其解决方案的关键在于引入SEEDS（Selective Evidence Entry During Search）框架，该框架通过轻量级预览（preview）机制先展示检索候选的摘要信息，再由代理根据自身当前推理状态自主判断应选择哪些候选以及数量多少，从而实现任意子集和灵活基数的精准选择。相较于传统的固定或自适应前缀策略，SEEDS具备更强的灵活性与适应性，可直接集成至现有推理代理，亦可通过学习进一步优化。在九个知识密集型问答基准测试中，无论是在本地语料库还是实时网络搜索场景下，SEEDS均显著提升了搜索有效性，并大幅降低全量证据的消耗。实验分析表明，SEEDS能更有效地识别出超越检索前缀范围的有用证据。该研究确立了证据准入作为智能体搜索中的一个互补维度，实现了“检索什么”与“允许什么影响推理”的解耦。
链接: https://arxiv.org/abs/2610.12932
作者: Jiajin Liu,Chenxi Xu,Dongzhe Fan,Yuanfu Sun,Qiaoyu Tan
机构: New York University (纽约大学); New York University Shanghai (纽约大学上海分校)
类目: Computation and Language (cs.CL)
备注: 7 figures, 20 pages
Abstract:Search agents extend large reasoning models with multi-round access to external knowledge, yet most existing systems largely conflate retrieving evidence with consuming it. Retrieved documents are commonly incorporated according to fixed or rank-based policies, despite the fact that evidence utility is conditioned on the agent’s current reasoning state. Consequently, a lower-ranked candidate may be critical for the current step, while a higher-ranked candidate may provide redundant, irrelevant, or misleading information. We formulate this overlooked problem as evidence admission, which asks, at each search step, which retrieved candidates should be allowed to enter the agent’s evolving reasoning context. To enable such selective control, we introduce SEEDS (Selective Evidence Entry During Search), a preview-guided evidence admission framework for search agents. SEEDS first exposes lightweight previews of retrieved candidates and then lets the agent jointly determine which candidates and how many should be fully inspected, conditioned on its current reasoning state. Unlike fixed or adaptive prefix policies, SEEDS can select arbitrary subsets with flexible cardinality, and it can be instantiated directly with an existing reasoning agent or further optimized through learning. Across nine knowledge-intensive QA benchmarks under both local corpus and live web search, SEEDS consistently improves search effectiveness while substantially reducing full-evidence consumption. Experimental analyses show that SEEDS more effectively selects useful candidates beyond the corresponding retrieval prefix. These results establish evidence admission as a complementary dimension of agentic search, separating what information is retrieved from what information is ultimately allowed to shape reasoning.
[NLP-75] Rethinking the Roles of Diffusion and Decoding: Predictive-State Flows for Parallel Language Generation
【速读】： 该论文旨在解决连续扩散语言模型（Continuous Diffusion Language Models, DLMs）中，扩散先验（diffusion prior）在连续空间中建模离散词元（token）选择时所面临的挑战：由于词元具有离散性且依赖上下文的精细结构，传统的将潜在变量几乎确定性地映射为词元的机制导致联合潜在分布难以有效建模。为此，论文提出了一种新的生成范式——预测状态流（Predictive-State Flows, PSF），其核心思想是重新划分生成角色：扩散先验仅负责生成高层次的预测状态（predictive state），而解码器则负责在局部块内完成词元级别的自回归生成。具体而言，PSF 将序列划分为若干块（block），每个块的预测状态仅由前序上下文计算得到，通过修正流（rectified-flow）先验生成这些预测状态序列，随后采用块因果解码器并行生成所有块，仅在块内保持自回归性。这一设计将原本需建模的 L 个词元级潜在状态压缩为 K 个预测状态，同时将词元级序列深度从 L 降低至 L/K，显著提升了生成效率与质量。实验表明，在无条件 OpenWebText 生成任务中，一个 197M 参数、块大小 K=8 的模型以 0.31 TFLOPs/1024 token 达到 22.8 的生成困惑度（perplexity）和 5.16 的熵值，优于使用 32 步采样的 ELF-B 模型（24.0 困惑度，7.2 TFLOPs）。MAUVE@512 指标也分别达到 0.93 与 0.73，验证了生成质量的提升。进一步控制实验显示，包含自身块信息的内容状态（content states）虽性能更优，但其生成困惑度仍比预测状态高 8–16%；而用共享均值替代采样轨迹会降低 MAUVE 0.11，说明轨迹多样性对生成质量至关重要。综上，该研究的关键在于通过合理划分扩散先验与解码器的生成职责，实现更高效、更高质量的连续扩散语言建模，强调了潜在空间设计不仅要关注表示紧凑性，更要注重生成角色的分工合理性。
链接: https://arxiv.org/abs/2610.12898
作者: Jinjin He,Xinsong Feng,Lucheng Fu,Sinan Wang,Bo Zhu,Jiayun Wang
机构: Georgia Institute of Technology(佐治亚理工学院)
类目: Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:In continuous diffusion language models (DLMs), latents generated by the diffusion prior are mapped almost deterministically to tokens, either by a decoder or through a token embedding matrix. Unlike in image generation, where visual details can vary continuously, the diffusion prior must capture fine-grained discrete token choices in continuous space, which can make the joint latent distribution difficult to model. We argue that generative roles should instead be divided: the diffusion prior should generate high-level predictive information, while the decoder should resolve the remaining token-level choices. Based on this view, we introduce Predictive-State Flows (PSF), which partitions a sequence into blocks and associates each block with a predictive state computed solely from the preceding context. A rectified-flow prior generates the sequence of predictive states, after which a block-causal decoder generates all blocks in parallel, autoregressively only within each block. This design reduces diffusion from L token-level states to K L predictive states and reduces token-level sequential depth to L/K. On unconditional OpenWebText generation, a 197M-parameter model with K=8 achieves a generative perplexity of 22.8 at entropy 5.16 using 0.31 TFLOPs per 1024-token document, versus 24.0 and 7.2 TFLOPs for ELF-B with 32 sampling steps. The corresponding measured operating points yield MAUVE@512 of 0.93 and 0.73, respectively. Controlled comparisons further show that content states, which additionally encode their own blocks, yield 8-16% higher generative perplexity than predictive states, and that replacing sampled predictive-state trajectories with a shared mean lowers MAUVE@512 by 0.11. These results suggest that latent design for continuous DLMs should consider not only how compactly text is represented, but also how generative roles are divided between the prior and the decoder.
[NLP-76] mporal Evidence Forests for Long-Horizon Multi-Party Conversational Memory
【速读】： 该论文旨在解决大语言模型（LLM）代理在长期多参与者交互中因信息累积量大、状态动态演化而导致的记忆管理难题。现有时序感知记忆框架通常仅将时间作为元数据存储或利用时序信号引导对预构建记忆结构的检索，缺乏对时序结构本身的显式建模，难以同时实现局部密集信息的精准恢复与完整事件演进过程的重构。其解决方案的关键在于提出一种基于时序结构的记忆框架T-Mem，通过两个核心机制实现：一是时序证据发现（Temporal Evidence Discovery），利用相关消息在短时间窗口内的局部聚集特性，挖掘被忽略的关键证据；二是时序记忆结构化（Temporal Memory Structuring），通过建模状态转移与支撑关系，构建包含低信息跨度压缩的森林结构；最终通过证据森林线性化（Evidence Forest Linearization）将结构化证据序列化，以支持答案生成。实验结果表明，T-Mem在多个长周期多参与方记忆基准上均显著优于现有方法，具备跨模型、参数规模、领域及查询类型的鲁棒性。
链接: https://arxiv.org/abs/2610.12874
作者: Junyou Guo,Chongyang Tao,Yan He,Yong Wang,Shuai Ma
机构: Beihang University (北京航空航天大学); Alibaba Group (阿里巴巴集团)
类目: Computation and Language (cs.CL)
备注: 32 pages, including appendices
Abstract:Long-term memory has been widely adopted in LLM-based agents to support persistent interaction and personalized assistance. Long-term multi-party interactions, however, accumulate substantially more detailed information, with decisions repeatedly updated and states evolving across participants and interaction stages. Temporal structure is therefore crucial for tracing such memories: relevant information often appears densely within short intervals, while transitions among different states are anchored by a strict temporal order. Existing temporally aware memory frameworks primarily store time as metadata or use temporal signals to guide retrieval over preconstructed memory structures, without using temporal structure to both recover locally concentrated evidence and reconstruct its complete event progression. To address these limitations, we propose T-Mem, a temporal-structure-based memory framework that preserves interactions and organizes query-relevant evidence through two temporal mechanisms. Temporal Evidence Discovery exploits the local concentration of related messages to recover overlooked evidence, while Temporal Memory Structuring models state transitions and supporting relations over time and compresses low-information spans within the resulting forest. Evidence Forest Linearization then serializes the structured evidence for answer generation. Experiments on two long-term multi-party memory benchmarks demonstrate that T-Mem consistently outperforms competitive memory frameworks across LLMs, parameter settings, domains, and query types.
[NLP-77] me Delay System for Sequence Modeling
【速读】： 该论文旨在解决现有序列模型在时间记忆机制上的根本缺陷：缺乏显式的、可解释的内容感知时间召回能力。传统LSTM将所有信息压缩至单一隐藏状态，导致特定历史事件信息丢失；Transformer以二次复杂度对所有词元进行无差别注意力计算；而状态空间模型如Mamba虽将历史压缩为固定维度状态，却未实现内容可寻址的记忆机制。为此，本文提出一种基于非线性时延系统的新型框架，其核心在于通过动态估计语义相似度来决定有效时延，从而实现内容感知的时序记忆。解决方案的关键创新包括：（i）可微分的语义滞后估计算子，能够根据当前输入与历史输入间的语义相似性生成内容感知的软注意力权重，输出加权历史上下文及相似性评分；（ii）具有闭式累积求和解的对角状态空间结构，实现每步O(1)计算复杂度且无需序列循环；（iii）可解释的模糊语义调制机制，学习依赖上下文的规则以平衡即时处理与历史回溯，其中规则中心对应典型语义情境。实验结果表明，该方法在文本分类与生成任务中均优于现有先进方法。
链接: https://arxiv.org/abs/2610.12864
作者: Youshan Zhang,Jialu Li
机构: Chuzhou University (滁州学院); Boston University (波士顿大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Existing sequence models share a critical limitation: they lack an explicit, interpretable mechanism for content-aware temporal recall. LSTMs compress everything into a single hidden state, thereby losing information about specific past events. Transformers attend to all tokens indiscriminately at quadratic cost, while state-space models like Mamba compress history into a fixed-dimensional state without explicit content-addressable memory. To address this gap, we introduce a novel framework grounded in nonlinear time-delay systems, in which the effective delay is dynamically estimated based on the semantic similarity between current and historical inputs. Our approach features three key innovations: (i) a differentiable semantic lag estimator that computes content-aware soft attention weights over history, producing a weighted historical context and similarity score; (ii) a diagonal state space with closed-form cumulative sum solution, achieving O(1) per-step complexity with no sequential loops; and (iii) an interpretable fuzzy semantic modulation mechanism that learns context-dependent rules for balancing instantaneous processing versus historical recall, where rule centers correspond to prototypical semantic contexts. Experimental results on text classification and generation outperform state-of-the-art methods.
[NLP-78] Unreliable Narrator Framing as a Cost-effective Mechanism for Satire Explanation of Australian and American Satirical News ACL
【速读】： 该论文旨在解决讽刺性新闻（satirical news）解释生成中的挑战，即由于其内容依赖于近期和本地语境，导致模型难以准确理解其讽刺意图。核心问题是：如何在缺乏明确语义线索的情况下，生成能够准确揭示讽刺本质的解释。解决方案的关键在于基于不可靠叙述者理论（unreliable narrator theory），利用开放权重模型（open-weights models）进行解释生成，这一方法相较于前沿大模型更具成本效益且可行性高。研究发现，模型在解析美国来源的讽刺新闻时对讽刺手法的识别准确率高于澳大利亚来源，表明文化语境差异对模型表现具有显著影响。该工作构建了一个全新的讽刺性新闻解释数据集，并建立了相应的评估基准，为后续研究提供了重要基础。
链接: https://arxiv.org/abs/2610.12863
作者: Kanay Gupta,David Y. Liu,Aditya Joshi
机构: University of New South Wales, Australia(新南威尔士大学, 澳大利亚)
类目: Computation and Language (cs.CL)
备注: 4 content pages + references, appendix; ACL Stylesheet; Under review
Abstract:Satirical news is a unique form of misinformation: it is intended to be humorous by the original publication source but can be misinterpreted. Explanation of satirical news articles is challenging because recent and local context needs to be incorporated. This is a pilot study that explores explanation generation for satirical news articles from Australia and compares them alongside those from USA. The paper demonstrates that framing explanations on unreliable narrator theory on open-weights models can be a feasible, cost-effective alternative to frontier models. We find that models identify the satirical tropes more accurately on the American source than the Australian one. This work results in a novel dataset and an evaluation benchmark for satirical explanation.
[NLP-79] Fear Is Not Always Fear: Variation in Emotion Label Equivalence Across Datasets
【速读】： 该论文旨在解决跨数据资源中情绪标签（emotion label）语义一致性问题，即在不同情感识别数据集（如GoEmotions、XED和BRIGHTER）中使用相同名称的情绪标签（如“fear”或“surprise”）是否具有可比性。研究发现，尽管这些标签名称相同，但其实际标注标准存在显著差异：同一文本在不同模型下被标记为“恐惧”的比例可相差高达63%（71% vs. 8%），且在跨资源迁移时，模型整体判别能力平均下降55%，且排名一致性与性能损失无强相关性。尽管通过训练标签流行度调整和截距校准可缓解部分尺度偏差，但根本性的语义不一致仍无法修复——例如，“surprise”在不同资源间甚至对同一文本的标注存在分歧。因此，论文的核心结论是：共享标签名称并不等同于共享测量目标，训练数据源的选择会实质性地改变分析结果，导致在外部数据集上得出相反结论。解决方案的关键在于承认并量化这种跨资源的语义异质性，强调在使用预训练情绪分类器时必须进行严格的资源溯源与校准，而非默认标签具有跨域可比性。
链接: https://arxiv.org/abs/2610.12841
作者: Emily Öhman,Anna Koufakou
机构: Waseda University (早稻田大学); Florida Gulf Coast University (佛罗里达大西洋大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Emotion classifiers are routinely applied beyond their training data, on the assumption that same-named labels such as fear or surprise mean the same thing across resources. We test this assumption for five labels shared by GoEmotions, XED, and BRIGHTER, comparing models on identical inputs and under cross-corpus transfer. On the same texts, one fear classifier flags 71% as fearful and another 8%, yet the two largely agree on how the texts rank. Across 30 resource-label comparisons, training-label prevalence explains about half of this kind of scale mismatch, and a fitted intercept removes most of it. What recalibration cannot repair is larger: transferred models lose 55% of native discrimination in aggregate, agreement in ranking between classifiers is only weakly related to that loss, and for surprise the resources disagree about which texts express the emotion. The choice of training resource can therefore change conclusions: on two external tweet collections, BRIGHTER- and XED-trained classifiers give opposite answers about which shows more surprise, even after rank normalization, with intervals excluding zero in both directions. A shared emotion label name does not establish an interchangeable measurement target.
[NLP-80] COFFEQA: Counterfactual-Guided Few-Shot Distillation for LLM Question Answering
【速读】： 该论文旨在解决少样本知识蒸馏（few-shot distillation）在生成式问答（generative QA）任务中因训练样本选择不当而导致性能下降的问题。现有方法依赖有限样本进行知识迁移，但其性能高度受样本质量影响，尤其当样本位于教师模型决策边界附近、具有较高不确定性时，会显著损害蒸馏效果。为此，论文提出了一种基于反事实（counterfactual）引导的少样本蒸馏方法——COFFEQA（Counterfactual-guided Few-shot Distillation in Open-book Question Answering），其核心创新在于利用反事实样本为学生模型提供额外监督信号，以增强对困难事实样本的学习能力。具体而言，反事实被定义为对原始上下文进行最小修改后，使教师模型产生不同答案的扰动版本。通过几何分析揭示了真实-反事实对可有效约束师生模型决策边界的偏差。此外，论文引入新的评估指标Context Following Difficulty (CFD)，用于在蒸馏前筛选高质量的反事实样本，其依据是样本对目标替代答案的一致性及对上下文修改的敏感性。实验结果表明，在包含五个领域内与三个跨域问答基准的测试中，基于T5和Qwen2.5系列模型的COFFEQA显著优于仅使用真实样本的基线方法，在TriviaQA数据集上，于32个少样本对条件下，平均准确率（EM）提升8.77点，平均F1分数提升9.98点，验证了该方法在资源受限场景下高效且鲁棒的知识迁移能力。
链接: https://arxiv.org/abs/2610.12837
作者: Kavinda Kehelella,Sanghamitra Dutta
机构: University of Maryland, College Park(马里兰大学学院帕克分校)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Knowledge distillation aims to train a smaller student model to mimic a larger teacher model for resource-constrained environments. However, the process of distillation is typically data-intensive and computationally expensive, particularly for generative tasks. Few-shot distillation offers an alternative by transferring teacher knowledge using limited training samples. However, we observe that few-shot distillation performance is heavily dependent on the choice of these training samples. In fact, we demonstrate that using more uncertain samples near the teacher’s decision boundary can significantly deteriorate distillation performance. Motivated by this observation, we propose Counterfactual-guided Few-shot Distillation in Open-book Question Answering (COFFEQA), a novel strategy that aptly uses counterfactuals to provide additional supervision around challenging factual samples. In the generative QA setting, we define a counterfactual as a minimally modified context that induces the teacher to change its response to an alternative answer. We provide geometric insights on how factual-counterfactual pairs can constrain the deviation between the teacher’s and student’s decision boundaries. We further introduce a new metric, Context Following Difficulty (CFD) that further validates counterfactuals prior to distillation based on agreement with the intended alternative answer and dependence on the modified context. COFFEQA uses CFD-validated factual-counterfactual pairs for few-shot distillation. Experiments across five in-domain and three out-of-domain QA benchmarks using T5 and Qwen2.5 families show that COFFEQA outperforms factual-only distillation baselines under the same few-shot budget. For instance, on TriviaQA, COFFEQA improves over the factual-only baseline by 8.77 average EM points and 9.98 average F1 points under the T5 setting with 32 few-shot pairs.
[NLP-81] When Charts Deceive Web Agents : A Paired Benchmark for Misleading Visualization-Grounded Tasks EMNLP2026
【速读】： 该论文旨在解决生成式网页代理（Web Agent）在执行任务时因误导向可视化图表（misleading visualization）而导致决策偏差与可靠性下降的问题。当前大多数研究聚焦于图表问答任务，而忽视了网页代理在真实工作流中将图表作为中间证据进行推理并驱动下游行为时，其对误导性视觉呈现的敏感性。本文提出首个可执行的成对基准测试集MisVisAgentBench，包含280个任务实例，每对任务仅在图表证据上存在“干净”与“误导性”差异，从而精准评估误导性可视化对代理行为的影响。其解决方案的关键在于引入诊断框架，能够区分由误导性图表引发的失败与基础任务难度之间的影响，并捕捉执行层面的具体效应，如额外浏览步骤和决策迟疑。实验结果表明，在13个视觉-语言网页代理中，使用误导性图表导致平均任务成功率下降超过34个百分点，且失败模式高度集中于预设的误导路径，表明误导性图表具有系统性引导而非随机干扰作用。这一发现揭示了可视化鲁棒性（visualization robustness）是保障网页代理安全性和可靠性的一个关键但长期被忽视的维度。
链接: https://arxiv.org/abs/2610.12823
作者: Yisheng Li,Dongming Han,Hongkun Pan,Bingcheng Mao,Zijian Wang,Yunlong Mao,Wei Tong,Sheng Zhong
机构: HiThink Research; State Key Laboratory of Novel Software Technology, Nanjing University; Zhejiang University
类目: Computation and Language (cs.CL)
备注: Accepted to EMNLP 2026. 19 pages
Abstract:Web agents increasingly browse, interpret, and act on web content on behalf of users. In many realistic workflows, however, the visual evidence they consume is not neutral: charts and dashboards can be misleading, shaping judgments without issuing any explicit malicious instruction. Unlike chart question answering, Web Agents treat charts as intermediate evidence whose misinterpretation can propagate into concrete downstream actions — a reliability risk that remains underexplored. We introduce MisVisAgentBench, the first paired executable benchmark for evaluating how misleading visualizations affect Web Agent execution. It comprises 280 task instances in matched clean–misleading pairs that differ only in chart evidence. We further provide a diagnostic framework that isolates misleading-induced failures from baseline task difficulty (Zhu et al., 2025) and captures execution-level effects such as extra browsing steps and decision hesitation. Across thirteen vision-language Web Agents, replacing clean charts with misleading counterparts reduces the average task success rate by more than 34 percentage points. Moreover, these failures predominantly follow the targeted misleading action branch, suggesting that deceptive charts systematically redirect rather than randomly disrupt agent decisions. These results reveal that visualization robustness is a critical yet understudied dimension of Web Agent safety and reliability.
[NLP-82] VEPA: Verified Evolving Formal Policy for Lifelong LLM Agent Guardrails
【速读】： 该论文旨在解决大语言模型（LLM）智能体在操作敏感资源（如私有文档和可变系统状态）时面临的持续性安全与安全风险问题，尤其关注运行时防护机制（runtime guardrails）在动态环境中难以适应新风险的挑战。现有方法要么依赖基于LLM推理的安全策略，导致决策不一致与策略解释模糊；要么采用预设的正式策略，缺乏对新出现风险的自适应能力。其解决方案的关键在于提出一种可验证演进的正式防护框架——VEPA，该框架将防护规则形式化为类型化的代理事件上的可执行符号规则，并通过部署反馈驱动的LLM生成策略补丁以修复新发现的失败，同时保证历史正确行为不变；随后由确定性验证器确保策略结构合法且无冲突；最后引入证据感知的授权层，在仅有充分支持证据时才激活新规则，从而防止不确定更新影响防护决策。这一机制实现了在动态环境下既保持决定的确定性、可复现性，又具备持续演化能力的正式策略防护。
链接: https://arxiv.org/abs/2610.12813
作者: Duy Nguyen,Lesly Miculicich,Bhavana Dalvi Mishra,Shuo Li,Krishnamurthy Dj Dvijotham,Mohit Bansal,Tomas Pfister,Long T. Le
机构: Google Cloud AI Research(谷歌云人工智能研究); Google DeepMind(谷歌深度思维); University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校)
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Cryptography and Security (cs.CR); Machine Learning (cs.LG)
备注: 33 pages, 14 figures
Abstract:LLM agents increasingly operate over sensitive resources, such as private documents and mutable system states, which can create serious safety and security risks. Runtime guardrails should therefore make inspectable, reproducible, and deterministic allow or refuse decisions before potentially irreversible agent actions are executed. However, safety and security requirements are rarely complete before deployment, so guardrails need to keep adapting as new risks emerge. Existing adaptive guardrails learn from deployment experience, but they usually apply safety policies through LLM inference, which can lead to inconsistent decisions and ambiguous policy interpretations. Formal guardrails, on the other hand, enforce policies deterministically, but they usually rely on pre-deployment or task-specific policies and have no mechanism to adapt to newly observed risks. We introduce VEPA, a framework for the verified evolution of formal agent guardrails. VEPA represents the guardrail as a formal policy of executable symbolic rules over typed agent events. During deployment, we use an LLM guided by deployment feedback to propose policy patches that fix newly observed failures while preserving previously correct behavior. Then, a deterministic verifier only accepts policies that are structurally valid and conflict-free. Finally, an evidence-aware authority layer activates a verified rule only when it has enough supporting evidence, so uncertain updates cannot directly affect guardrail decisions. Across ASSEBench-Safety, ASSEBench-Security, and ATBench, VEPA consistently outperforms baselines while expanding the scope of deterministic formal-policy enforcement. These gains also hold under more challenging deployment conditions, including mixed streams, corrupted feedback, and longer horizons.
[NLP-83] People Making Conversation: Evaluating How Naturally Speech Models Converse NEURIPS2026
【速读】： 该论文旨在解决对话式语音系统在实际交互中对“是否发言”这一关键决策的评估缺失问题，现有评估方法仅关注边界检测、策略遵循或统计指标，而未能衡量系统在停顿（pause）处做出发言决策的真实表现。其核心解决方案是构建一个基于真实未脚本对话数据集（Seamless Interaction）的实时评估框架，通过在176段自然对话中的427个停顿和482个话轮结束点上，向六个不同系统提供当前对话历史，要求其预测并生成响应，进而从发言时机、延迟、长度、措辞以及对前30至120秒内容的理解能力等多个维度进行量化评分。研究发现，托管型系统（如GPT Realtime、Gemini 3.1 Flash Live、Grok Voice）几乎在所有停顿处都会回应，其响应延迟主要受端点检测机制影响（基于静音的端点器约1–4秒，语义话轮检测约8秒），但多数情况下仍无法精准嵌入停顿期间；而全双工模型（PersonaPlex、Moshi）是唯一能稳定保持沉默且可在人类反应时间范围内打断的系统。此外，托管系统生成内容普遍比人类更长，且在文本输入条件下对对话事实的记忆率仅为41%–60%（以Claude Opus 5.5为评判标准），音频输入下全双工模型的记忆率更低（17%–22%）。研究公开了全部标注数据、评分点、评估工具链及各系统输出结果，为后续对话系统的人机协同行为研究提供了可复现基准。
链接: https://arxiv.org/abs/2610.12802
作者: Arya Bastani,Iman Modarressi
机构: People Make Things
类目: Computation and Language (cs.CL)
备注: Accepted at the NeurIPS 2026 Workshop on Real-Time Conversational Agents
Abstract:A conversational speech model has to decide, at every pause, whether to speak. Existing evaluations test boundary detection, policy adherence, or aggregate statistics, not this decision. We place real-time speech systems at 427 pauses and 482 turn ends from 176 unscripted conversations in Seamless Interaction, give each the conversation so far, and score what it generates against what the person did: whether and how soon it speaks at a pause; its latency, length, and wording at a turn end; and whether it can answer a question about the preceding 30 to 120 seconds. Across six systems, the hosted APIs (GPT Realtime, Gemini 3.1 Flash Live, Grok Voice) respond at almost every pause whichever endpointer they use; only their latency, about 1 to 4 s with silence-based endpointers and about 8 s with semantic turn detection, decides whether the words land inside the pause. The full-duplex models (PersonaPlex, Moshi) are the only systems that regularly stay silent and the only ones that interrupt within a human reaction time. Hosted systems reply longer than the person. Given the history as text, hosted systems recall 41 to 60% of conversation facts under a Claude Opus 5.5 judge and 19 to 26% under a strict word matcher; hearing it as audio, full-duplex models recall 17 to 22% and 12 to 15%. We release the labels, points, harness, and every output.
[NLP-84] Meta-Reflective Evolution Effectively Improves Production AI Systems
【速读】： 该论文旨在解决生产环境中复杂AI系统优化难题，尤其针对传统基于大语言模型（LLM）的进化优化方法在处理具有隐含复杂交互的系统时因仅依赖局部失败反馈而导致优化停滞的问题。现有方法通常仅从搜索前沿选取候选解，并在单次LLM调用中根据其失败结果进行突变，缺乏对历史演化过程与系统动态行为的全局理解。为此，论文提出CoCoEvolve（Cortex Code Evolve），其核心创新在于引入“元反思”（meta-reflection）机制：通过一个代理型突变器（Cortex Code），能够主动检索完整的演化历史证据，并在真实运行环境中探测系统行为，再结合验证与推理生成更精准的突变策略。该方法在数据智能体、LLM驱动的数据流水线及数据工程工作流三类生产级AI系统上均取得显著性能提升，在DABStep任务中达到92.8%的外部硬样本准确率，远超Meta-Harness（78.4%）与GEPA（30.4%）；在数据工程基准测试中，测试集求解率从59.1%提升至77.4%，超越最佳基线（73.6%）。消融实验进一步证实，元反思机制中各组件对性能提升均有贡献，表明其在复杂生产系统优化中的关键价值。
链接: https://arxiv.org/abs/2610.12794
作者: Seung Won Wilson Yoo,Chang Zeng,Aditi Somayajula,Sahithi Ankireddy,Rohan Kosalge,Avishree Khare,John Mitchell,Aditya G. Parameswaran,Rajhans Samdani,Anupam Datta
机构: Snowflake(雪flake); UMass Amherst(马萨诸塞大学阿默斯特分校); Stanford University (斯坦福大学); University of California, Berkeley (加州大学伯克利分校); University of Pennsylvania (宾夕法尼亚大学)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Software Engineering (cs.SE)
备注:
Abstract:Large Language Model (LLM)-guided evolutionary optimization has successfully improved prompts, programs, and even entire AI systems. Most optimization methods select a candidate from the search frontier, then mutate it in one LLM pass based only on its failures. This focus on the frontier can stall on production AI systems, where isolated failures reveal little about complex, hidden interactions. We introduce CoCoEvolve (Cortex Code Evolve), an evolutionary optimizer built around what we call meta-reflection, wherein an agentic mutator (Cortex Code) selectively retrieves evidence from the entire evolutionary history and probes the live system before verifying and proposing mutations. We apply CoCoEvolve to optimize three classes of production AI systems: data agents, LLM-powered data pipelines, and data engineering workflows. On DABStep, CoCoEvolve tops the public leaderboard, reaching 92.8% held-out hard accuracy compared to 78.4% for Meta-Harness and 30.4% for GEPA under matched conditions. Across six LLM data pipeline workloads, it outperforms every evaluated baseline. On data-eng-bench, CoCoEvolve lifts test-set solve rate from 59.1% to 77.4%, past the best baseline of 73.6%. It also has 11 percentage points higher accuracy than GEPA on HotpotQA while remaining competitive with specialized optimizers on established mathematical and systems benchmarks. Matched ablations confirm that each component of CoCoEvolve contributes to these gains, demonstrating the value of meta-reflection for optimizing production AI systems.
[NLP-85] Large Language Models Machine-Assisted Cultural Analytics and the Agent ic Turn
【速读】： 该论文旨在解决传统人文研究在面对海量文化数据时所面临的分析效率与方法局限性问题，尤其是在如何将非结构化文化材料转化为可量化分析变量方面。其核心挑战在于，尽管生成式 AI（Generative AI）技术显著提升了从文本、图像等文化内容中提取信息的能力，但如何确保这些自动化处理过程仍能支撑严谨的文化解释与理论主张，仍是关键难题。论文提出，解决方案的关键在于：虽然生成式 AI 扩展了研究的规模、方法多样性以及任务委托范围，但其支持文化论断的基本逻辑——即数据与解释之间的因果或象征性关联——并未发生根本改变。因此，研究者需在利用 AI 提升效率的同时，保持对数据生成过程、模型偏见及解释链条完整性的批判性审视，以确保技术增强的研究仍具备学术可信度与理论深度。
链接: https://arxiv.org/abs/2610.12792
作者: Andres Karjus
机构: 未知
类目: Computers and Society (cs.CY); Computation and Language (cs.CL)
备注:
Abstract:Technologies like large language models make it easier to convert cultural material into analyzable variables, while LLM-driven agentic systems extend machine assistance to other parts of the research workflow. Rather than a full how-to guide or an exhaustive review of recent LLM use cases, this chapter looks at some crucial aspects of this new paradigm as well as the bigger picture. I argue that these technologies expand the scale, methodological range, and scope for delegation, while the basic logic by which those measurements support cultural claims remains mostly unchanged.
[NLP-86] REDaCT: Collapse-Free Unlearning in Large Reasoning Models EMNLP2026 ACL
【速读】： 该论文旨在解决大推理模型（Large Reasoning Models, LRMs）在去遗忘（unlearning）过程中，如何在不引发推理崩溃（reasoning collapse）的前提下，有效移除与遗忘集（forget-set）相关的信息问题。现有方法虽能实现答案和推理链中的遗忘信息删除，但常导致模型无法生成连贯的思维链（chain-of-thought, CoT）或无法正确终止推理过程。本文提出一种基于推理时的去遗忘框架REDaCT（REgenerate via Detection and Corrective Tuning），其核心创新在于：（1）设计一个二分类泄漏检测器，在推理过程中识别出包含遗忘集信息的推理句子；（2）引入离线训练的嵌入优化模块，学习一组修正嵌入（corrective embedding），在首次检测到泄漏时注入模型初始状态，引导后续推理路径避开泄露内容。该方案的关键在于通过检测-修正机制实现对推理过程的精准干预，从而在保证完美答案遗忘和近乎完全的推理链遗忘的同时，显著提升推理连贯性，彻底避免推理崩溃现象。
链接: https://arxiv.org/abs/2610.12769
作者: Joshua Maccoby,Wendy Hui Wang
机构: Stevens Institute of Technology(史蒂文斯理工学院); Hoboken, New Jersey, USA(新泽西州霍博肯市，美国)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: Accepted to Findings of EMNLP 2026. 19 pages, 7 figures, 6 tables. Copyright 2026 Association for Computational Linguistics (ACL). Licensed under CC BY 4.0
Abstract:Unlearning in large reasoning models (LRMs) requires removing forget-set information from both the reasoning trace and the final answer. Existing approaches achieve this objective at the cost of reasoning collapse, where the model fails to produce a coherent chain-of-thought (CoT) and does not properly terminate its reasoning process. To address this challenge, we propose REDaCT (REgenerate via Detection and Corrective Tuning), an inference-time unlearning framework for LRMs. REDaCT consists of two key components: (1) a binary leak detector that identifies sentences in the reasoning trace that leak forget-set information, and (2) an embedding optimization module that learns a corrective embedding offline, such that when injected at the first detected leak during inference, it guides subsequent reasoning towards sentences that do not leak forget-set information. Experimental results show that REDaCT completely avoids reasoning collapse, substantially improving reasoning preservation compared to state-of-the-art unlearning methods while maintaining perfect answer forgetting and near-perfect CoT forgetting. Our code is available at: this https URL.
[NLP-87] DistressBench: Evaluating Multi-Dimensional Crisis Support in Large Language Models
【速读】： 该论文旨在解决当前大语言模型在应对用户自伤与自杀（SSH）危机情境时，评估体系滞后于实际应用需求的问题。随着模型使用场景日益偏向情感性而非信息性交互，用户在对话中频繁暴露心理危机，而现有安全评估基准主要依赖模型“拒绝回应”这一被动行为作为衡量标准，无法反映其在危机干预中应提供的实质性支持。本文提出关键解决方案——构建DistressBench，一个包含718条由临床专家撰写的真实用户发言的英文对话数据集，覆盖23类SSH子类别，每条对话均配有任务特定评分细则（基于七维危机支持框架的加权原子标准）及临床参考回复。模型得分以满足加权标准的比例计算，直接体现其交付关怀服务的完整性。结果显示，表现最优的前沿模型仅达成88.4%的加权标准，中位模型为71.4%，远低于临床参考的98.7%；更严重的是，在35.3%的案例中，尽管模型能识别危机，却未能引导用户寻求人类帮助，该短板集中体现在需主动行动而非沉默回避的维度。通过对比各维度最佳模型与中位模型的表现差异，揭示出能力瓶颈与策略选择的分野：如情绪安抚维度最佳模型达74.6%而中位仅为46.0%，安全免责声明则从84.6%降至8.3%。多轮对话整体表现低于单轮（68.5% vs 74.2%）。研究主张应将危机安全评估重心从“拒绝内容”转向“提供照护的质量”，并明确将情绪安抚与资源转介纳入模型部署的核心要求。
链接: https://arxiv.org/abs/2610.12758
作者: Drew Rein,Patrick Oathout,Vishal Kumar,Udari Madhushani Sehwag
机构: Scale AI
类目: Computation and Language (cs.CL); Computers and Society (cs.CY)
备注: 39 pages, 9 figures, 13 tables
Abstract:Language models have been adopted faster than evaluation practices that reliably assess their risks, and a growing share of use is affective rather than informational. Within that traffic users disclose suicide and self-harm (SSH) crises. Existing safety benchmarks score models primarily on refusal, but refusal is not the desired behavior here; the conversation requires a substantive supportive response. We introduce DistressBench, 718 English conversations with clinician-authored user turns spanning 23 SSH subcategories, each paired with a task-specific rubric of weighted atomic criteria across seven dimensions of crisis support and a clinician reference response. A model’s score is the weighted average over the criteria its reply satisfies, reading directly as the fraction of required care delivered. The best of 25 frontier models satisfies 88.4% of weighted criteria and the median model 71.4%, against 98.7% for clinician references scored on the same criteria. Pooled across all 25 models, in 35.3% of conversations where a model satisfied every criterion for recognizing the crisis, it failed to route the user toward human help. The shortfall concentrates in the dimensions requiring the model to act rather than withhold. Contrasting each dimension’s median model against its best separates capability limits from choices: de-escalation reaches 74.6% in the strongest model against a median of 46.0%, and safety disclaimers 84.6% against 8.3%. Multi-turn conversations score below single-turn ones (68.5% against 74.2%). We release the corpus, rubrics, judge calibration labels, and a companion annex of 20 long-horizon red-team transcripts. These results argue for evaluating crisis safety on the care a model delivers rather than on what it declines to say, and for treating de-escalation and resource routing as deployment requirements.
[NLP-88] MADS: Multi-Agent Dialog Simulation for Robust Conversational Agents INTERSPEECH
【速读】： 该论文旨在解决任务导向型对话代理（task-oriented conversational agents）在真实场景下因用户非合作行为导致的脆弱性问题。现有函数调用基准数据集对对抗性对话轨迹的覆盖不足，限制了鲁棒对话代理的训练资源。为此，本文提出MADS（Multi-Agent Dialog Simulation）——一种合成数据生成管道，能够生成结构化且多样化的对话轨迹，并通过引入对抗性对话，构建出反映真实不愉快对话路径的验证对话序列。基于MADS，研究构建了MADS-Bench基准，涵盖六个领域、55种人格设定和1095条对话，其中约66%的对话包含易失败的场景。解决方案的关键在于采用两阶段训练框架：首先进行监督微调（SFT），再结合可验证奖励的强化学习（RLVR），从而有效提升模型在复杂、非合作情境下的鲁棒性。
链接: https://arxiv.org/abs/2610.12757
作者: Arkajyoti Chakraborty,Adam Zernik,Ishika Kulkarni,Mudit Arora,Hugo Lin,Justin Chiu,Alessandro Di Bari,Neha Gupta,Andreas Stolcke
机构: 未知
类目: Computation and Language (cs.CL)
备注: Submitted to Interspeech in February 2026
Abstract:Task-oriented conversational agents remain fragile under realistic conditions, especially when users exhibit non-cooperative behavior. Existing function-calling benchmarks underrepresent adversarial conversation trajectories, thereby limiting the training resources available for developing robust agents. We present MADS (Multi-Agent Dialog Simulation), a synthetic data generation pipeline that produces structured, diverse dialogue trajectories. We inject adversarial conversation, producing validated conversation trajectories that capture realistic, unhappy paths. Using MADS, we construct MADS-Bench: a benchmark spanning six domains, 55 personas, and 1095 conversations, with approximately 66% of conversations containing failure-prone conversation scenarios. We evaluate the robustness of the trained models using a two-stage training approach that combines supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR).
[NLP-89] U4RASD at KnowledgeGraphEval-2026: Ontology-Constrained Encoder and LLM Systems for Arabic Relation Extraction
【速读】： 该论文旨在解决阿拉伯语中定向关系抽取（Directed Arabic Relation Extraction）问题，即从给定的阿拉伯语句子及实体对中预测40种预定义关系之一或“无关系”（no_relation）。其核心挑战在于阿拉伯语语言特性带来的复杂性，如丰富的形态变化和上下文依赖。解决方案的关键在于结合多种建模策略：一方面采用基于编码器的系统，通过引入类型化实体标记（typed entity markers）并分离关系存在性判断与关系分类任务，提升模型对细粒度关系的识别能力；另一方面利用大语言模型（Large Language Model, LLM）方法，对Yehia和Qwen3.5模型进行QLoRA微调，并引入本体约束（ontology-constrained prediction）以增强预测的语义合理性。最终，通过融合Yehia-RE、Qwen-RE与TypedPair三个系统的集成模型，在子任务2中取得了94.06的micro-F1得分，排名第一，验证了约束性预测与互补建模策略在阿拉伯语关系抽取中的有效性。
链接: https://arxiv.org/abs/2610.12742
作者: Ahmad Abbas,Hussein Mazeh,Chadi Abou Chakra,Aya Jouni,Mohammad Ballout,Fadi A. Zaraket
机构: 未知
类目: Computation and Language (cs.CL)
备注: 20 pages. System description paper for the KnowledgeGraphEval 2026 Shared Task at ArabicNLP 2026
Abstract:This paper details our submission to KnowledgeGraphEval 2026 Subtask 2 on directed Arabic relation extraction. We explored encoder-based and large language model approaches for predicting one of 40 relations or no_relation from an Arabic sentence and a subject-object pair. Our encoder systems use typed entity markers and separate relation-existence and relation-classification heads, while our LLM systems fine-tune Yehia and Qwen3.5 with QLoRA and ontology-constrained prediction. Our best system, an ensemble of Yehia-RE, Qwen-RE, and TypedPair, achieved a micro-F1 score of 94.06 and ranked 1st in Subtask 2. Yehia-RE (full-vocabulary) achieved 92.98, while the best encoder and Qwen-RE achieved 92.69 and 91.94 respectively. Our results highlight the importance of constrained prediction and complementary modeling approaches for Arabic relation extraction.
[NLP-90] Unsupervised Multimodal Reward Modeling
【速读】： 该论文旨在解决多模态生成任务中高质量视觉-语言奖励模型（Vision-Language Reward Models, VL-RMs）训练依赖昂贵、易产生分歧且难以统一的真人偏好标注数据的问题。传统方法通常基于人工标注的偏好对（preference pairs）进行训练，但此类数据收集成本高、一致性差，且模型性能评估高度依赖于特定基准测试的排名，存在偏差风险。为此，本文提出一种无需任何人工偏好标签的新型解决方案：在冻结的Qwen3-VL主干网络的中间层上添加一个线性头，通过对比同一图像的原始文本描述与其扰动版本的得分来训练该线性头，仅利用少量标注数据用于选择最优中间层。其核心创新在于“无监督扰动驱动”的训练范式——利用同一图像的文本扰动作为伪偏好信号，使目标函数具有凸性，从而避免了复杂微调过程。实验表明，该方法在仅需数千参数和千分之一微调计算量的情况下，便可在多个基准上达到或超越GPT-4o的表现，尤其在VL-RewardBench上领先6.6分；当与人工标注的RLAIF-V对相比，在相同样本预算下，扰动机制可提升3至5分。此外，通过将模型自身生成的候选样本交由验证器（verifier）标注后重新训练头部，能有效降低文本幻觉（减少5.1 CHAIR点），并提升图像生成通过率（提高5.4点），尽管在标准奖励基准上得分略降。综上，该方案的关键突破在于：以中间层探针（intermediate-layer probe）、同图扰动数据生成机制及验证器引导的自举流程（verifier-driven bootstrap）构成一套完全无需人工标注、计算成本极低且由训练目标本身定义的多模态奖励建模新范式。
链接: https://arxiv.org/abs/2610.12707
作者: Yueying Li,Jingxuan Fan,Kianté Brantley,Sham M. Kakade,Hanlin Zhang
机构: Massachusetts Institute of Technology (麻省理工学院); Cornell University (康奈尔大学); Scale AI; Harvard University (哈佛大学)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Vision-language reward models are trained on annotated preference pairs, which are expensive to collect, can disagree, and are ranked by benchmark accuracy. We build one with no human preference label: a linear head on an intermediate layer of a frozen Qwen3-VL backbone, trained to score a web caption above a perturbed version of the same caption; labeled data enters only to select the layer. The layer is the decisive choice, worth 5.8 points over the last layer, and one recipe transferred without re-tuning beats or at least matches GPT-4o on three benchmarks at 32B, 6.6 points ahead on VL-RewardBench, from a few thousand parameters at about a thousandth of fine-tuning compute. At an equal pair budget, perturbations teach a frozen head 3 to 5 points more than curated RLAIF-V pairs. Because the backbone is frozen, the objective is convex, and the perturbation sampler specifies the reward, which the benchmark does not identify: two heads trained on disjoint halves of the same perturbations tie on the benchmark and differ by 6.4 points in hallucination judging. Retraining the head on the policy’s own verifier-labeled candidates cuts caption hallucination by 5.1 CHAIR points and lifts image-generation pass rate by 5.4, while scoring lower on every reward benchmark. Together, an intermediate-layer probe, free same-image perturbations, and a verifier-driven bootstrap turn give a recipe for multimodal reward modeling that needs no annotator, costs a fraction of fine-tuning, and is specified by the comparisons it is trained on rather than by a benchmark rank. Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2610.12707 [cs.CL] (or arXiv:2610.12707v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2610.12707 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[NLP-91] GeoFitBench-LLM : A Benchmark for Assessing Large Language Models Capabilities in Geospatial Data Requirements Elicitation for Geo-Analytic Tasks
【速读】： 该论文旨在解决大语言模型（Large Language Models, LLMs）在地理人工智能（GeoAI）系统中应用时，缺乏对地理空间数据需求提取能力评估的问题。现有评估体系普遍忽视了从自然语言查询中准确识别地理分析任务所需的数据集、支持资源及约束条件的关键环节，而这一环节直接影响检索导向型地理分析任务的可靠性。为此，本文提出GeoFitBench-LLM基准测试框架，用于评估LLMs在自然语言地理分析请求下推断必要数据集、支撑资源与使用约束的能力。其核心创新在于构建了两个推理维度——时空关系（Spatio-Temporal Relational）与语义锚定（Semantic Grounding），以反映地理信息检索与自然语言理解中的长期挑战。通过采用固定且供应商无关的结构化真值标注模式，实现了资源识别与属性级规范的可复现评估。实验结果表明，在最小提示条件下，尽管多数模型能够部分识别必要资源（如GPT-5.4 Thinking在66.67%的请求中完整恢复全部资源），但随着推理复杂度提升，满足“适用性”（fitness-for-use）的精确规范仍面临显著困难，凸显了当前模型在深层语义理解与约束推理方面的局限性。
链接: https://arxiv.org/abs/2610.12669
作者: Amirhossein Vahdat,Thierry Badard,Luc Lamontagne
机构: 未知
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: Presented as an Oral Presentation Paper at GeoAI 2026, Ghent, Belgium. Also available on Zenodo
Abstract:Large language models are becoming central to GeoAI systems, yet their evaluation rarely considers the elicitation of geospatial data requirements. This omission is critical as retrieval oriented geo-analytic tasks cannot be supported reliably without first identifying the necessary datasets and constraints. GeoFitBench-LLM is introduced as a benchmark for assessing whether LLMs can infer the datasets, the supporting resources and the constraints required by geo-analytic requests in natural language. The benchmark is structured around two reasoning dimensions, Spatio-Temporal Relational and Semantic Grounding, reflecting long-standing challenges in geospatial information retrieval and related natural language tasks. Ground truth requirements are encoded in a fixed, provider-independent schema for reproducible evaluation of resource identification and attribute-level specification. Experiments on seven models under minimal prompting indicate that identifying the necessary resources is often achievable, with GPT-5.4 Thinking achieving the best result by recovering the complete set of resources in 66.67% of benchmark requests. Results further indicate that accurate fitness-for-use specification remains more difficult as inferential demands increase.
[NLP-92] Recurrent Harness for Agent ic Continual Learning
【速读】： 该论文旨在解决语言模型代理（language model agent）在长期交互流中面临的数据分布漂移（distribution shift）问题，其核心挑战在于如何在不依赖离线回放数据或额外验证数据的前提下，实现在线持续学习（continual learning）中的有效状态适应。现有方法通常仅通过前向信息流更新代理状态，或依赖外部记忆库与验证集进行优化，难以在严格在线流式协议下保持性能。针对这一问题，论文提出ReHarness——一种基于循环结构的代理持续学习框架，其关键创新在于引入“反向修正”（backward revision）机制：在每个输入实例处理后，利用生成的轨迹作为反馈，对先前检索到的反思内容（reflections）进行动态修正，并将该反馈沿文本代理状态向后传播。这一机制使代理能够基于当前任务的上下文，主动调整过往经验的表征，从而提升对分布偏移的适应能力。实验表明，ReHarness在三个持续学习基准与三种语言模型主干上均显著优于原始上下文基线、基于记忆与反思的方法以及提示优化技术；进一步分析揭示，该方法能生成具有源始依据且语义连贯的修正内容，有效纠正过拟合或过时的经验，同时兼顾学习过程中的稳定性与可塑性。
链接: https://arxiv.org/abs/2610.12668
作者: Yuxin Xiao,Zhiyun Lu,Jianyu Wang,Yangtian Zhang,Yang Song,Qifan Wang,Bailin Wang
机构: Massachusetts Institute of Technology (麻省理工学院); Meta MRS Research; Yale University (耶鲁大学)
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注:
Abstract:Language model agents increasingly operate over long interaction streams, requiring online adaptation to distribution shifts through continual learning. However, existing agent harnesses typically either evolve their states only through forward information flow or rely on additional replay or validation data for harness optimization. To address this, we propose ReHarness, a recurrent harness framework for agentic continual learning that complements forward read and write with backward revision under a strictly online streaming protocol. We ask what information could have been captured differently in the harness state to better inform the current instance in the stream. Specifically, after each instance, we leverage the resulting trajectory as feedback to revise the reflections retrieved for that instance, thereby propagating feedback backward through the textual harness state. Across three continual learning benchmarks and three language model backbones, ReHarness consistently outperforms strong raw-context baselines, memory- and reflection-based methods, and prompt optimization approaches. Further analysis shows that ReHarness produces source-grounded and meaningful revisions, corrects overgeneralized or outdated experience under distribution shifts, and improves both stability and plasticity during continual learning.
[NLP-93] perturber: A Stateless Service for Semantics-Preserving Text Perturbations
【速读】： 该论文旨在解决大语言模型（Large Language Model, LLM）在干净基准测试中过度高估模型鲁棒性的问题。真实输入通常存在语义保持性的扰动，而这些微小变化常导致模型输出发生显著偏离，但现有评估工具将扰动方法与基准测试框架耦合，缺乏可复现性和模块化设计。为此，本文提出“perturber”——一个无状态的服务与Python库，其核心创新在于每次调用仅施加一种语义保持性扰动，并从包含68种扰动、覆盖11类家族的自有目录中选取，通过单一基础原语实现，组合逻辑由调用方自行链式构建，确保服务与库在构造上输出一致。该方案的关键在于将扰动操作解耦为可复用的转换层，支持逐个、可重现且跨环境一致地应用扰动，同时对工具本身进行严格评估，包括正确性、可复现性与成本，并量化每种扰动的语义保持程度，而非假设其成立。研究还提供交互式演示平台、可审视的扰动目录及一键复现评估流程，显著提升了评测的透明度与可靠性。
链接: https://arxiv.org/abs/2610.12667
作者: Khoi-Nguyen Tran
机构: IBM Research(IBM研究院)
类目: Computation and Language (cs.CL)
备注: 14 pages (6 main + references and appendix), 5 figures, 13 tables. Code: this https URL
Abstract:Large language model (LLM) evaluations on clean benchmarks overstate model robustness: real inputs arrive perturbed, and these meaning-preserving variants routinely move model answers. Studying this systematically requires applying perturbations one at a time, reproducibly, and identically wherever they run, yet existing tools couple them to a benchmarking stack rather than packaging them as a reusable transform layer. We present perturber, a stateless service and Python library that applies exactly one semantics-preserving perturbation per call, drawn from a first-party catalog of 68 perturbations across 11 families. It turns on a single primitive, with composition left to the caller chaining calls, so the service and the library produce identical output by construction. We evaluate the tool itself, its correctness, reproducibility, and cost, rather than any model’s robustness, measuring meaning-preservation per perturbation rather than assuming it. The demonstration adds a live playground, an introspectable catalog for benchmark selection, and a one-command reproducible evaluation.
[NLP-94] Cancerous Backdoor Attack: Gradual Activation via Invisible Tokens and A Stage Controller
【速读】： 该论文旨在解决现有大型语言模型（Large Language Models, LLMs）后门攻击中普遍存在的“单点激活”局限性问题，即攻击行为通常在触发条件满足时立即显现，缺乏对渐进式恶意行为演化的探索。其核心解决方案是提出一种名为“癌变式后门攻击”（Cancerous Backdoor Attack）的新方法，该方法通过引入不可见标记（invisible tokens）和阶段控制器（stage controller），实现对模型推理过程的渐进式污染。其中，不可见标记在用户可见输入中不显式出现，但隐式引导模型进入多个中间攻击阶段；阶段控制器则在推理过程中动态追踪攻击进展，确保恶意行为按预设阶段逐步演化，最终才触发终端异常行为。实验表明，该攻击在多个推理数据集上均能稳定引发渐进式的推理偏差，且显著优于已有基线攻击方法。研究结果揭示，后门攻击导致的推理腐败可能在可见输出前已悄然积累，因此仅依赖回答准确性进行检测已不足以有效识别此类攻击，凸显了对渐进式威胁检测机制的需求。
链接: https://arxiv.org/abs/2610.12644
作者: Tahmid Imtiaz Imu,Emama Nahid,Prodipta Sen Amartya,Ahsanul Jobayer,Yutong Song,Jiang Wu,Pengfei Zhang,Honghui Xu
机构: Kennesaw State University (肯尼索州立大学); University of Dhaka (达卡大学); University of California, Irvine (加州大学欧文分校); Independent Researcher (独立研究员)
类目: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 31 pages, 5 figures, 13 tables
Abstract:Backdoor Attacks on Large Language Models (LLMs) typically follow a trigger-response pattern, where satisfying a trigger condition activates a single terminal behavior. However, this single-point backdoor activation does not explore attacks in which malicious behavior develops gradually through multiple intermediate stages before reaching the terminal activation stage. We present Cancerous Backdoor Attack, that gradually corrupts an LLM’s reasoning over a sequence of interactions by leveraging invisible tokens and a stage controller. Specifically, invisible tokens provide hidden stages to the model without appearing in the user’s visible request and the stage controller tracks the attack’s progression during inference to realize gradual activation. We evaluate Cancerous Backdoor Attack across several reasoning datasets. The attack consistently produces gradual reasoning corruption across models and tasks. We compare Cancerous Backdoor Attack with prior backdoor attack baselines to demonstrate our proposed attack outperforms the baselines. Our results indicate that reasoning corruption can develop gradually before it becomes visible, making answer accuracy alone insufficient for detecting backdoor attacks.
[NLP-95] Knowing Is Not Telling: Identity Ossification in LLM Representations of Trans-border Communities
【速读】： 该论文旨在解决多民族跨境身份在生成式AI（Generative AI）中被简化为单一国家认同的“身份固化”（identity ossification）问题。其核心挑战在于：尽管许多族群如萨米人、罗兴亚人及库尔德人长期跨越政治边界存在，具有共享的历史、语言与文化，但当前大型语言模型（LLMs）在处理此类跨边境民族身份时，往往将其错误地归约为某一特定主权国家的固定身份，从而忽视了其流动性与跨国性特征。该研究提出跨边境身份固化诊断框架（Transborder Identity Ossification Diagnostic Framework, TIODF），通过对比直接事实性提问与开放式叙事性提问的回答差异，区分固化现象是源于知识缺失还是模型固有的叙述框架偏差。实验表明，不同模型及语言版本间固化现象差异显著——例如，GPT-5.1在英文回答中仅10.1%出现固化，而DeepSeek-V3.2在中文回答中高达62.6%。即使模型能正确回答事实问题，仍可能在叙事中呈现单一国家叙事，揭示出固化本质上是模型叙述范式的问题，而非单纯信息不足。这一发现对评估多语言人工智能系统中的文化公平性具有重要意义。
链接: https://arxiv.org/abs/2610.12610
作者: Minglu Sun,Lan Chen,Hang Jiang
机构: Northeastern University (东北大学); The University of Texas at Austin (德克萨斯大学奥斯汀分校)
类目: Computers and Society (cs.CY); Computation and Language (cs.CL)
备注:
Abstract:Ethnic and cultural identities rarely align with political borders, a tension made sharper by migration and long-standing cross-border ties. Communities such as the Sami, the Rohingya, and the Kurds have long lived across more than one state. This tension is especially clear in mainland Southeast Asia, where many communities share history, language, and culture across state lines. We study nine such transborder ethnic communities along China’s southwestern border with mainland Southeast Asia, looking at how large language models (LLMs) represent them. We define and study identity ossification: a pattern where LLMs turn a fluid, cross-border ethnic identity into a single, fixed nation-state identity. We introduce the Transborder Identity Ossification Diagnostic Framework (TIODF) that compares direct factual questions with open-ended narrative questions to test whether ossification comes from missing knowledge or from how models frame their answers. We test GPT-5.1 and DeepSeek-V3.2 in English and Chinese. Ossification varies substantially across models and query languages. It appears in only 10.1% of GPT-5.1’s English answers, but in 62.6% of DeepSeek-V3.2’s Chinese answers. Models often still tell a single-nation story even when they answer the factual question correctly. This decoupling suggests that ossification reflects narrative framing rather than simple knowledge absence, which matters for how we test cultural fairness in multilingual AI systems.
[NLP-96] Self-Preservation in Language Models
【速读】： 该论文旨在解决持续学习（Continual Learning, CL）中模型在增量学习过程中对已有知识的遗忘问题，尤其关注当前任务保留机制仅覆盖部分先验知识而无法有效防止跨任务遗忘的局限性。其核心挑战在于如何在缺乏原始训练数据的前提下，实现对模型更广泛能力的自我保护。解决方案的关键在于引入“任务银行（Task Bank）”机制，通过组织任务描述及其示例，构建可组合的结构化知识库，并利用冻结的Qwen系列大模型生成补充性重放（replay）数据。研究发现，生成式重放能够显著减少任务银行外任务的遗忘现象；结合多个部分任务银行可进一步提升整体保留性能；更重要的是，在固定样本预算下，模型具备自主选择重放目标的能力——基于新任务信息指导的选择策略可在4B规模模型上提升未见任务的保留率，优于随机选择，表明模型能以自适应方式优化自身知识保护。这揭示了生成式AI在实现自我调节式持续学习中的潜力，为构建更具鲁棒性的自适应系统提供了新范式。
链接: https://arxiv.org/abs/2610.12602
作者: Dongkyu Cho,Rumi Chunara,Ali Behrouz
机构: New York University (纽约大学); Google(谷歌)
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
备注: 25 pages, 12 figures
Abstract:Continual learning (CL) seeks to adapt pretrained models while preserving prior capabilities. Yet the tasks supplied for preservation cover only part of what a model knows, while forgetting can extend beyond them. Recent work shows that language models can supplement this limited evidence by generating useful replay without access to their original training data. This raises a question about self-preservation: can a model help choose preservation targets that protect its own capabilities more broadly? To study this question, we organize task descriptions and their examples into Task Banks, whose entries can be selected and combined to guide replay generation by a frozen model. Continual instruction tuning with Qwen models of varying sizes yields three findings. First, the new task and learning rate shape which prior capabilities degrade, while tracking previously correct answers reveals losses that average accuracy can conceal. Second, generated replay reduces forgetting on tasks outside the bank. Combining partial banks strengthens this protection, improving mean retention of previously correct answers over either bank alone across the tested sizes. Third, the model can also help choose replay targets: selection informed by the new task improves mean held-out retention over random selection at 4B, with similar new-task gains, although smaller models show no corresponding advantage. Under a fixed example budget, however, replacing new-task examples with replay improves preservation at the cost of smaller new-task gains. Together, these findings show that models can support broader self-preservation by generating replay data and, in some settings, choosing which tasks to replay.
[NLP-97] Reflective Prompt Optimization of a Deep-Research Agent : A Topic-Disjoint Multi-Seed Protocol for Measuring Transferable Gains and Prompt-Level Overfitting
【速读】： 该论文旨在解决生成式语言模型代理在事实类任务中进行提示优化（prompt optimization）时存在的“记忆化”失败模式，即优化器可能通过将训练样本的答案直接写入提示，导致性能提升源于对训练数据的过拟合而非可迁移的行为。传统基于标量奖励的强化学习不会出现此类问题，而提示优化因成本低且输出可读，成为替代方案，但其潜在缺陷需被识别与规避。本文提出的关键解决方案是采用反思式提示演化（Reflective Prompt Evolution, GEPA），并在多智能体深度研究系统中对两个系统级提示进行优化。为确保评估可信性，实验设计采用主题不重叠划分（topic-disjoint split），即训练、验证与测试集无共享主题，从而有效隔离记忆效应。结果表明，未见提示的验证集表现优于保留测试集表现（验证-保留差距显著），但控制消融实验显示，即使提示中包含大量训练答案的直接复制内容，这些内容在对应训练问题上也未能获得奖励，说明性能增益并非来自记忆，而是由小样本选择偏差与噪声评判共同导致。进一步分析发现，按维度分解的反馈信息（decomposed per-dimension feedback） 是实现泛化性能提升的关键因果因素；若将其压缩为单一标量奖励，则保留测试集表现反而下降。此外，该性能增益在跨家族评判者（out-of-family judge）下仍能保持，并可通过人工编写的优化策略复现，证明其具备可解释性和可迁移性。因此，论文强调：可信的提示优化评估必须包含保留主题、多随机种子以及评判器敏感性分析等要素。
链接: https://arxiv.org/abs/2610.12601
作者: Elias Lumer,Sahil Sen,Vamse Kumar Subbiah,Kevin Paul
机构: 未知
类目: Computation and Language (cs.CL)
备注:
Abstract:Prompt optimization is an attractive alternative to reinforcement learning for adapting language-model agents, since it is cheap and produces human-readable artifacts. On factual tasks, however, it carries a failure mode that scalar-reward reinforcement learning does not. An optimizer that reads the training examples can write their answers into the prompt, so an in-distribution gain may be memorization rather than transferable behaviour. We apply reflective prompt evolution (GEPA) to the two system prompts of a multi-agent deep-research agent and evaluate it under a topic-disjoint split in which no topic is shared across train, validation, and test. Held-out citation reward rises by 0.079, from 0.702 to 0.781, with a bootstrap 95% confidence interval of [0.051, 0.107], and the gain replicates across three seeds (mean 0.107). Nearly half of the winning prompt is a memorized answer key, yet a controlled ablation shows this content earns no reward even on the exact training questions it encodes. The large validation-minus-held-out gap is therefore small-sample selection under a noisy judge, not memorization. Varying the verifier isolates what makes the gain transfer. Decomposed per-dimension feedback is the causal ingredient, and collapsing it to a single scalar reward makes held-out transfer negative. The gain persists under an out-of-family judge and is largely reproduced by a hand-written version of the discovered recipe. Credible evaluation of prompt optimizers therefore requires held-out topics, multiple seeds, and verifier ablations. We release the candidate prompts, lineage diffs, figures, tables, and analysis.
[NLP-98] SpireBench: Evaluating Long-Horizon Strategic Play of Agent ic Models with Slay the Spire
【速读】： 该论文旨在解决生成式AI（Generative AI）在长周期战略推理任务中表现不足的问题，尤其针对当前大多数智能体基准测试（agentic benchmarks）多为短时、片段化任务，难以有效分解模型在长期任务中的知识积累、推理能力与偶然性贡献的局限。其解决方案的关键在于构建SpireBench——一个基于完整商业卡牌构筑类游戏《杀戮尖塔》（Slay the Spire, StS）的评估框架，要求模型在最高难度下完成整场游戏，其中早期决策对长期成败具有决定性影响。实验表明，尽管前沿大语言模型（LLM）在第一幕的表现接近人类平均水平甚至专家水平，但随着游戏进程延长，其表现显著落后于专业玩家；核心差距体现在战斗策略执行能力上，所有模型均存在风险误判，倾向于过度保守地保全生命值而非主动消耗以增强实力。此外，研究发现模型虽具备一定的先验游戏知识，但无法从跨轮次记录的记忆中有效学习，所生成的内存常含错误且过于谨慎。该评测框架首次将原始完整游戏环境赋予模型，并提供可解释的分析工具，为定位智能体在长周期任务中的失效环节提供了系统性方法。
链接: https://arxiv.org/abs/2610.12596
作者: Scott C. Lowe,Sander W. Keemink
机构: Vector Institute; Toronto, Canada; Department of Machine Learning and Neural Computing; Donders Institute for Brain, Cognition, and Behaviour; Radboud University; Nijmegen, Netherlands
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注:
Abstract:Agentic large language models now tackle complex tasks, yet strategic reasoning over long horizons is under-studied: most agentic benchmarks are short and episodic, and performance on long tasks is hard to dissect into stored knowledge, reasoning and luck. We introduce SpireBench, in which models play the complete commercial deck-builder Slay the Spire (StS), where early decisions decide long-term success. Across 20 large language models (LLMs) at the game’s highest difficulty, frontier models beat heuristic baselines and match the average human player but remain far behind experts. This gap widens as the run lengthens: the strongest models win the first act as often as experts, then fall behind. What separates strong models from weak is how well they play each fight; all of them misjudge risk over a run, preserving health rather than spending it to grow stronger. A comprehensive, self-consistent renaming of every game term shows that part of their performance rests on prior knowledge of the game, and models do not improve from the memories they write across runs, which are often wrong and overly cautious. Our harness is the first to give a model the complete original game, and we compare it with existing harnesses. Overall, SpireBench offers an unsaturated long-horizon benchmark with tools to locate where and why agents fail.
[NLP-99] One Model to Loop Them All: Elastic Latent Recurrence for Language Models
【速读】： 该论文旨在解决循环式语言模型（latent recurrent language model）在单次循环（one-loop）推理时性能显著低于同规模非循环模型的问题，即“一循环代价”（one-loop tax）问题。这一缺陷使得在对延迟敏感的应用场景中，仍需采用独立的非循环模型以保证性能，从而牺牲了循环结构在计算资源上的优势。其解决方案的核心是提出弹性潜变量循环（Elastic Latent Recurrence, ELR），通过三项关键技术实现：1）带有可学习步长的门控状态更新机制，确保单循环下的准确率不下降；2）在每个优化器更新中混合不同循环次数，维持训练稳定性并保持单循环性能；3）在每轮迭代中根据循环索引和预算进行条件化建模，使后续循环逐步提升精度。此外，通过在预训练后期引入混合深度策略，并结合零初始化的条件化模块，可在几乎不增加训练成本的前提下实现更低的损失。在MoE模型中，复用首循环专家路由可减少11.7%的混合深度更新时间且不影响精度；推理阶段仅保留最后一轮的注意力键值缓存（KV cache），即可将内存占用控制在单循环水平，同时保留多循环带来的性能增益。实验表明，在4B稠密与30B-A3B MoE混合模型上，ELR在单循环下分别略低于或高于对应基线0.52和1.04点，四循环时进一步提升7.25和4.75点；经后训练部署后，Koi-4B模型在单循环下达到估计18分的AI分析智能指数（AAI Index），媲美Qwen3.5-4B，四循环时达29分，验证了该方法在兼顾效率与性能方面的有效性。
链接: https://arxiv.org/abs/2610.12582
作者: Faisal Ladhak,Shantanu Acharya,Santiago Akle Serano,Simeng Sun,Boris Ginsburg,Krishna C Puvvada
机构: NVIDIA(英伟达)
类目: Computation and Language (cs.CL)
备注:
Abstract:A latent recurrent language model applies a shared block of layers repeatedly, so one checkpoint can trade inference compute for accuracy by changing the loop count. At one loop, however, such models typically fall well short of a non-recurrent model of the same size, a one-loop tax that makes a separate non-recurrent model the better choice whenever latency matters. We present Elastic Latent Recurrence (ELR), a recipe for training looped language models without this tax. At one loop, an ELR model costs the same to serve as a non-recurrent model of the same size and, trained on the same data, reaches similar accuracy. Each additional loop then buys more accuracy for more inference compute. Three choices make this work: a gated state update with a learned step size, loop counts mixed within each optimizer update, and conditioning each pass on its loop index and budget. The first two preserve one-loop accuracy, and the third lowers loss at every additional loop. Mixed depths can be introduced late in pretraining to limit the added training cost, and with zero-initialized conditioning added at the switch, this late schedule reaches lower loss than mixed-depth training from scratch. In MoE models, reusing first-loop expert routes on later loops cuts mixed-depth update time by 11.7% with no measurable change in accuracy. At inference, keeping only the last loop’s attention KV cache holds attention KV memory at its one-loop level while retaining most of the gain from additional loops. On 4B dense and 30B-A3B MoE hybrid models, ELR at one loop is 0.52 points below and 1.04 points above its matched baseline on a ten-task average, and four loops add 7.25 and 4.75 points. Carried through post-training, the recipe yields Koi-4B, a single checkpoint that scores an estimated 18 on the Artificial Analysis Intelligence Index at one loop, matching Qwen3.5-4B, and 29 at four loops.
[NLP-100] CLUE: A Contrastive Learning Framework for Unsupervised Event Type Induction and Annotation
【速读】： 该论文旨在解决事件类型归纳（event type induction）中依赖领域专家手动构建事件本体（event ontology）所导致的高标注成本与人为偏见问题。传统方法需人工制定事件类型及其命名规则，不仅耗时费力，且易受主观判断影响。为此，本文提出CLUE框架，其核心创新在于：1）设计一种联合嵌入表示（joint embedding representation），同时捕捉事件的动词中心视角（verb-centric view）与语义视角（semantic view）；2）基于对比损失（contrastive loss）引导的聚类实现事件类型自动归纳；3）通过迭代优化完成事件命名与精细化调整。该方案有效实现了从原始文本数据中自动化、无监督地生成高质量事件类型体系，显著降低了对人工标注的依赖。
链接: https://arxiv.org/abs/2610.12580
作者: Pratik Maitra,Lauren Kwon,Qi Li
机构: Iowa State University (爱荷华州立大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Event ontology is the foundational framework for defining events in a dataset. Event type induction generally involves domain experts who define guidelines for creating event types and their names based on the dataset’s domain and scope. However, this process is resource-intensive in terms of annotation costs and is prone to human biases. To alleviate the need for manual event ontology creation, we propose the CLUE framework for event type induction, naming, and annotation. Our main contributions in this work are: 1) designing a novel joint embedding representation for expressing both the verb-centric view and the semantic view of events; 2) event type induction using contrastive loss guided clustering; 3) event naming and refinement. Experiments demonstrate the effectiveness of our method. Our code is available at this https URL.
[NLP-101] Contextual Correction of Parallel Draftsfor Speculative Decoding
【速读】： 该论文旨在解决生成式AI（Generative AI）推理过程中，基于扩散模型的推测解码（speculative decoding）方法在并行生成候选词块时因缺乏块内上下文依赖而导致的性能瓶颈问题。其核心挑战在于：尽管并行化显著提升了推理效率，但草案中每个位置的令牌预测未考虑前序已确定令牌的实际内容，从而丢失了自回归生成所固有的块内上下文依赖关系。为此，论文提出DCOCO（DFlash Contextual Corrector），一种轻量级的上下文校正机制，通过在并行阶段保留多个候选令牌，并对相邻草案位置间的上下文兼容性进行并行评估，实现无需串行修正即可恢复块内依赖关系。该方案在不牺牲并行性前提下，以极低额外开销实现了更优的上下文感知令牌选择。实验表明，DCOCO在四种验证器架构与十项基准测试中均达到最高平均吞吐量，相较原始解码最高提速达6.6倍；在并发请求场景下，其性能优于最强竞争方法6%-23%，而其他串行校正方法则在高负载下表现劣于未经校正的DFlash。结果证明，通过并行上下文评分恢复块内依赖关系，可在多种解码模式与服务负载下持续实现稳定加速。
链接: https://arxiv.org/abs/2610.12570
作者: Roy Eisenstadt,Harel Lidar,Tal Gonen,Omer Luxembourg,Itamar Zimerman,Lior Wolf,Eli David,Ilan Naiman
机构: Google(谷歌); Tel Aviv University (特拉维夫大学)
类目: Computation and Language (cs.CL)
备注:
Abstract:Speculative decoding accelerates large language model inference by using a lightweight drafter to propose multiple tokens that are subsequently verified in parallel by the target model. Recent diffusion-based drafters make this paradigm particularly attractive: deep attention-based neural backbones provide strong predictions, while drafting multiple future positions in parallel avoids the sequential cost of autoregressive generation. This parallelism, however, comes at a cost. Tokens within a draft block are predicted without access to the realized identities of preceding draft tokens, removing intra-block dependencies that would naturally be available under autoregressive generation. We introduce DCOCO (DFlash Contextual Corrector), a lightweight mechanism that restores these dependencies while preserving parallel drafting. Rather than committing to each position’s top prediction, DCOCO retains multiple candidate tokens and evaluates their contextual compatibility across adjacent draft positions in parallel, enabling contextually informed token selection at low additional cost. Across four verifier backbones and ten benchmarks, DCOCO achieves the highest average throughput in every evaluated configuration, spanning greedy and stochastic decoding with and without extended reasoning, with speedups of up to 6.6x over vanilla decoding. Its advantage persists under concurrent serving: DCOCO outperforms the strongest competing method by 6-23% across 4-32 concurrent requests, while other sequential correctors fall below uncorrected DFlash at these loads. These results demonstrate that recovering intra-block dependencies through parallel contextual scoring delivers consistent acceleration across decoding regimes and serving loads.
[NLP-102] SWE-Duel: Towards a Self-Scaling Arena for Coding Agents ICLR2027
【速读】： 该论文旨在解决静态代码基准测试（static coding benchmarks）在发布后因任务内容逐渐泄露至训练数据而导致评估失效的问题。随着模型能力提升，这些固定任务会趋于饱和，无法有效衡量模型的真实性能。为此，论文提出一种自扩展（self-scaling）的评估范式，其核心在于：任务与评测标准（oracle）均在评估时动态生成，避免预先存在的内容泄露，并通过参与模型的能力动态调节任务难度。关键解决方案是引入SWE-Duel竞技场，其中两个编码代理在镜像的红蓝回合中相互评估。红方在隔离上下文中实现新功能并植入隐蔽缺陷，同时封存触发缺陷的测试用例；提交的拉取请求需满足通过功能测试和原有测试但仅失败缺陷测试，且同一代理在无先验信息下能独立修复缺陷，方可被接受。蓝方则以不被告知缺陷存在的方式审查该请求，仅当其修正版本通过全部三类测试才获胜，随后双方角色互换。实验在15个跨语言仓库上对11个模型-工具组合进行1500轮对战，结果显示：GPT-5.5 with Codex CLI作为最强求解者，修复率达98.3%；Claude Opus 4.8 with mini-swe-agent为最强任务生成者，红方胜率27.3%；更重要的是，在同一模型家族内，最新版本生成的任务击败固定参考求解器的比例（42.9%）显著高于旧版本（4.0%），初步验证了任务难度随任务生成能力自适应提升的有效性。
链接: https://arxiv.org/abs/2610.12569
作者: Wei Minn,Zhensu Sun,Lwin Khin Shar,David Lo
机构: Singapore Management University (新加坡管理大学)
类目: Computation and Language (cs.CL); Software Engineering (cs.SE)
备注: Under review as a conference paper at ICLR 2027
Abstract:Static coding benchmarks are fixed at release. Over time their tasks leak into training data, and stronger agents eventually saturate them. We argue that a benchmark should instead aim to be self-scaling: its tasks and oracles are created at evaluation time, so no content exists in advance to leak, and its difficulty is set by the participating agents rather than fixed at release. We introduce SWE-Duel, an arena in which two coding agents evaluate each other over mirrored Red-Blue turns. In each turn, the Red agent works on a real repository across three context-isolated sessions. It proposes and implements a new feature with feature tests, then embeds a subtle bug in that feature along with sealed bug-triggering tests. The resulting pull request is admitted only if (1) it passes the feature tests and the repository’s existing tests while failing exactly the bug tests, and (2) a fresh session of the same agent can repair the bug blind, which rules out unsolvable tasks. The Blue agent then reviews the pull request without being told a bug exists. It wins only if its revision passes all three test suites, and then the two agents swap roles. We run a tournament among 11 model-harness participants on 15 repositories in five languages for 1,500 turns. The leaders win in different ways. GPT-5.5 with Codex CLI ranks first as the strongest solver, repairing 98.3% of the defects it reviews. Claude Opus 4.8 with mini-swe-agent ranks second as the strongest task author, with a 27.3% Red win rate. Finally, within one model family, tasks written by the newest version defeat a fixed-reference solver far more often than those of older versions (42.9% vs. 4.0%), giving preliminary evidence that task difficulty scales with task authoring capability.
[NLP-103] AutoIndexer: Flexible-Order Decoding by Training Causal Models on Chains of Edits
【速读】： 该论文旨在解决自回归解码（autoregressive decoding）在处理非因果顺序数据（如交叉引用或未来依赖关系）时的固有缺陷，即生成结果一旦完成便无法事后修改，这与人类迭代式推理过程不相符。现有方法如扩散语言模型（Diffusion LLMs）虽部分缓解了此问题，但仍难以灵活地对预生成上下文进行任意数量的词元插入或删除。为此，论文提出AutoIndexer，一种采用新型训练与解码机制的生成式模型，通过模拟“编辑链”（Chain of Edits）实现对先前输出的灵活回溯修改，支持词元的插入、替换和删除操作。其核心创新在于引入标记词元（marker tokens）以指示编辑的起始与结束，并通过移动游标（cursor）定位到已有序列中的特定位置，类比于文本编辑器的操作逻辑。训练过程中，通过对真实标签施加逆向链式编辑操作生成训练序列，使模型学习通过反向还原这些操作来实现编辑。该扰动训练策略赋予AutoIndexer对错误上下文的鲁棒性及在代码修正等编辑任务中的适应能力。实验表明，该方法在保持标准大语言模型（LLM）基准性能的同时，首次实现了后生成阶段的上下文编辑能力，显著超越了传统自回归与扩散模型的局限性。
链接: https://arxiv.org/abs/2610.12545
作者: Shu Ishida,Aliasghar Khani,Tianyu Zhang, TheCong Luong,James Seale Smith,Adam Gaier
机构: Autodesk Research
类目: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Autoregressive decoding is less suited to non-causally ordered data, e.g., cross-references or future dependencies, since their outputs cannot be revised post hoc, unlike iterative human reasoning. Diffusion LLMs partially mitigate this limitation but still cannot flexibly insert or remove arbitrary numbers of tokens from a pre-generated context. We design AutoIndexer as a generative model with a novel training and decoding mechanism that simulates a Chain of Edits, allowing the model to flexibly modify its prior outputs in hindsight via token insertions, substitutions, and deletions. The model learns to predict marker tokens for opening and closing edits, simultaneously moving a cursor to positions in the existing token sequence, analogous to a text editor. Training sequences are obtained by perturbing ground-truth labels with inverse chained edit operations, and the model learns to edit by undoing those inverses. The perturbation training allows AutoIndexer to be robust to erroneous context and adaptable to editing tasks such as code correction. We demonstrate that our method exhibits post-generation context-editing capabilities that most autoregressive and diffusion models lack without compromising performance on standard LLM benchmarks. The code is available at this https URL.
[NLP-104] An Input-Dependent Readout Phase for Resonant Sequence Models
【速读】： 该论文旨在解决固定状态长度序列模型在长距离依赖建模中的性能退化问题，特别是针对传统方法中记忆读取机制缺乏输入依赖性所导致的泛化能力不足。其核心挑战在于如何在保持卷积计算效率（O(T log T)）的前提下，引入内容感知的记忆访问机制。解决方案的关键在于对ResonatorLM中固定的读出相位进行改进：将原本每头固定的读出相位改为依赖当前输入词元的动态函数，从而在不破坏精确卷积结构和计算效率的基础上，仅通过0.2%的参数增量实现了读取过程的输入依赖性。分析表明，未训练状态下相位虽能编码时间间隔，但普通词元信号在2–8步内即衰减至背景噪声水平，且任意阻尼系数难以实现超过约16个词元的线性重构。实验结果表明，在600万参数的字符级模型上，该方法在训练长度为256时表现与原始模型相当，并在测试长度扩展至1024时将困惑度从12.81显著降至3.76，有效克服了原模型在长序列上的失败。进一步分析揭示，原模型的失效源于部分“长记忆头”在训练中暴露的历史信息不足，而新方法虽能更准确追踪当前字符，但并未提升检索性能，说明其优势主要体现在对历史信息的合理利用而非增强记忆检索能力。
链接: https://arxiv.org/abs/2610.12496
作者: Shivesh Rane
机构: 未知
类目: Machine Learning (cs.LG); Computation and Language (cs.CL)
备注:
Abstract:Sequence models with a fixed-size state avoid the quadratic cost of attention, but face a design choice. An input-dependent state transition gives content-dependent memory at the cost of FFT-based training, while a fixed transition keeps the O(T log T) convolutional path but reads memory the same way for every input. ResonatorLM, a recent model of the second kind, reads a bank of damped complex oscillators through a fixed learned phase per head. We make that readout phase a function of the current token, which adds input dependence to the read only, keeps the convolution exact, and costs 0.2 percent more parameters. An analysis of the untrained bank shows that phase does encode elapsed time, but an ordinary token falls below the background within 2-8 steps and no choice of damping extends linear reconstruction beyond about 16 tokens. In 6M-parameter character-level models on WikiText-2, the input-dependent phase matches the original at the training length and removes its failure beyond it: trained on 256 tokens and tested on 1024, perplexity falls from 12.81 to 3.76. We trace the failure to long-memory heads that accumulate more history than training exposed them to. The learned phase tracks the current character rather than distance and does not improve retrieval.
[NLP-105] Kairos: Toward a Byte-Level Foundation Model for Every Modality
【速读】： 该论文旨在解决在单台本地机器上训练小型语言模型时，由于资源限制导致模型架构探索空间有限的问题。其核心挑战在于如何在参数量极小（如1–15M）的前提下，实现有效且可优化的模型设计，同时兼顾多模态数据（文本、图像、音频、视频、激光雷达及控制流）的统一建模。解决方案的关键在于提出一种集成多种创新组件的统一架构：包括基于共享投影的双向门控-DeltaNet线性注意力与滑动窗口注意力融合（LiZAttention2）、分块式注意力-残差聚合机制、稀疏混合专家（MoE）前馈层以及多尺度字节级编码器（codec），并采用统一的噪声去噪目标函数在单一字节空间中进行联合训练。研究通过代码推导各组件算法，并开展收敛性合理性检验，包括在440字节句子上过拟合测试、多种子和多种配置下的消融实验，结果表明两种注意力变体在3,000步内最小损失趋近于10⁻³，且不同编码器方案的性能排序稳定，验证了系统具备优化能力。值得注意的是，共享注意力投影的优势仅体现为收敛速度提升，而非容量优势，且在冻结投影或引入更多样化数据后该优势消失，说明其本质是训练动态效应。尽管实验未涉及泛化性能、多模态预训练效果或与现有模型的对比，但这些收敛性验证为后续大规模预训练（如200M总参数/25M活跃参数目标）提供了理论依据和技术基础。
链接: https://arxiv.org/abs/2610.12495
作者: Fabien Furfaro
机构: 未知
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL)
备注: 15 pages
Abstract:Small language models trained on a single local machine leave little room for architectural trial and error. Kairos combines bidirectional gated-DeltaNet linear attention and sliding-window attention over shared projections (LiZAttention2), block-wise Attention-Residual aggregation, a sparse Mixture-of-Experts (MoE) feed-forward layer and a multi-scale byte-level codec, trained with a uniform-noise denoising objective over one byte space shared by text, image, audio, video, lidar and control streams; this report asks whether the combination optimizes at all before asking whether it is useful. We give code-derived algorithms for each component, including a cross-session recurrent-state memory gate, then run convergence sanity checks: overfittinga single 440-byte sentence at 1–15M parameters, text only, with three seeds for codec and attention choices and single-run sweeps for seven further factors. The two attention variants tested at 3,000 steps (LiZAttention2 and window attention alone) reach a minimum loss near 10^-3 . After 600 steps, the mean minimum loss ranges from 0.018 (patch codec) to 0.354 (depthwise convolutional codec) with an identical ranking on three seeds. An apparent advantage of shared over separate attention projections closes with more steps or more diverse data and reverses when the projections are frozen: it is a convergence-speed effect, not a capacity effect. These checks suggest that the implementation optimizes; they say nothing about generalization, multimodal training or comparison with existing models, which a planned pretraining run is meant to address. The Discussion sizes a 200M-total/25M-active target analytically; none of its throughput figures is measured. Code is available at this https URL . Python package at this https URL .
[NLP-106] OpenPA: Forced-alignment-free Multi-granular Pronunciation Assessment with Mixed-transcript Adaptation ICASSP2027
【速读】： 该论文旨在解决自由响应（free-form）场景下自动发音评估（APA）中存在的实际应用瓶颈问题，特别是现有方法依赖多阶段流水线（如强制对齐和独立特征提取器）导致的泛化能力差与部署复杂性高的缺陷。其核心解决方案是提出一种名为OpenPA的新框架，关键在于利用Whisper模型的交叉注意力机制，实现词级与语句级发音评分的联合预测，无需强制对齐；同时通过混合文本适应（mixed-transcript adaptation）与自适应替换权重（adaptive substitution weighting），使单一模型能够兼容封闭式与开放式应答场景下的异构转录文本。该方法仅在SpeechOcean762数据集上训练，即在域内封闭式与模拟开放式评估中达到最优性能，并在MultiPA上实现零样本迁移，且初步跨任务评估显示其在口腔癌患者语音分析中也具备应用潜力。
链接: https://arxiv.org/abs/2610.13826
作者: Fu-An Chao,Bi-Cheng Yan,Berlin Chen
机构: 未知
类目: Audio and Speech Processing (eess.AS); Computation and Language (cs.CL); Sound (cs.SD); Signal Processing (eess.SP)
备注: submitted to ICASSP 2027
Abstract:Recent advances in automatic pronunciation assessment (APA) have driven a shift from scripted to free-form assessment. However, existing methods often rely on multi-stage pipelines with forced alignment and separate feature extractors, limiting their practicality across response settings. In light of this, we propose OpenPA, a novel APA framework that leverages Whisper’s cross-attention mechanism to jointly predict word- and utterance-level pronunciation scores without forced alignment. Through mixed-transcript adaptation and adaptive substitution weighting, OpenPA accommodates heterogeneous transcripts across closed- and open-response settings within a single model. Trained solely on speechocean762, OpenPA achieves the strongest overall performance among evaluated systems under in-domain closed and simulated open-response conditions, while maintaining its performance zero-shot on MultiPA. An additional cross-task evaluation on oral-cancer speech suggests its potential applicability beyond non-native speech.
[NLP-107] Revisiting Accent Classification with DistilHuBERT: Speaker-Disjoint Evaluation and Cross-Corpus Generalization ACL
【速读】： 该论文旨在解决当前生成式语音识别系统在标准语料库内评估中表现优异，但在真实应用场景下模型泛化能力被高估的问题。其核心挑战在于：当训练集与测试集存在说话人重叠时，现有评估方法会显著夸大模型的鲁棒性，从而无法准确反映模型在面对未见说话人或跨语料库场景下的实际性能。为此，研究采用基于DistilHuBERT的声调分类框架，结合L2-ARCTIC及多个外部英语口音数据集，系统比较了文件级（file-level）与说话人无关（speaker-disjoint）的划分方式，并考察了平衡外部数据训练与教师-学生伪标签（teacher-student pseudo-labeling）等策略。研究发现，文件级评估导致性能严重虚高，而说话人无关评估能更真实地反映模型对未见说话人的泛化能力；仅依赖外部数据训练的模型难以有效迁移到L2-ARCTIC数据集，表明领域差异显著；相比之下，平衡外部数据训练展现出最优的监督学习潜力；伪标签实验进一步表明，在存在领域不匹配的情况下，仅依靠置信度过滤不足以提升性能。因此，论文提出关键解决方案是：构建一个综合评估体系，必须同时包含说话人无关划分和跨语料库测试，以全面、客观地衡量声调分类模型的真实鲁棒性。
链接: https://arxiv.org/abs/2610.13440
作者: Xu He,Homayoon Beigi
机构: Columbia University (哥伦比亚大学); and Recognition Technologies, Inc.
类目: Audio and Speech Processing (eess.AS); Computation and Language (cs.CL); Machine Learning (cs.LG); Sound (cs.SD)
备注: 9 pages, 1 figure, 7 tables. Presented at the 9th International Conference on Natural Language and Speech Processing (ICNLSP 2026), University of Trento, Trento, Italy, September 25-26, 2026. Proceedings to appear in the ACL Anthology
Abstract:Recent accent classification systems can achieve high accuracy in standard in-corpus evaluations. However, when speakers overlap between the training and test sets, such results may overestimate model robustness compared with real-world deployment scenarios. This study revisits the robustness of DistilHuBERT-based accent classification by using L2-ARCTIC and multiple external English accent datasets. The comparison covers file-level and speaker-disjoint splits, along with balanced external-data training and teacher-student pseudo-labeling. The large performance gap between in-corpus and external evaluations suggests that file-level evaluation substantially overestimates performance, while speaker-disjoint evaluation can provide a more realistic estimate of the generalization to unseen speakers. In this study, models trained on external data alone do not reliably generalize to L2-ARCTIC. Among the tested configurations, balanced external-data training offers the most promising supervised setting. The pseudo-labeling experiments further indicate that confidence-based filtering alone is insufficient under domain mismatch. Overall, this study suggests that robust accent classification evaluation should simultaneously include speaker-disjoint evaluation and cross-corpus testing.
[NLP-108] Does Financial Speech Need Continual Learning Regularization? A Study of EWC and mini-KFAC on Earnings Call ASR ACL
【速读】： 该论文旨在解决在持续学习（Continual Learning）场景下，自动语音识别（ASR）系统在更新新录音数据时可能出现的灾难性遗忘问题，尤其是在金融领域语音模式的保持方面。研究发现，将通用领域预训练的Whisper-small模型适配至Earnings22金融语音基准时，所有评估方法在相同领域内未出现遗忘现象，反而表现出性能提升，表明当前任务间具有互补性而非冲突性。这一发现的关键在于：当任务之间存在互补性时，正则化约束不仅无效甚至可能产生反效果。因此，解决方案的核心在于：在应用持续学习策略前，应首先评估任务间的互补性；若确需正则化，则采用分层式小规模克罗内克积近似曲率（mini-Kronecker-Factored Approximate Curvature, mini-KFAC）的弹性权重固化（EWC）方法，相较于传统的对角线EWC，其能实现更低的词错误率（WER）和更稳定的优化过程。
链接: https://arxiv.org/abs/2610.13432
作者: Thai Quoc On,Homayoon Beigi
机构: Columbia University, NYC, NY, USA; and Recognition Technologies, Inc.
类目: Audio and Speech Processing (eess.AS); Computation and Language (cs.CL); Machine Learning (cs.LG)
备注: 10 pages, 7 figures, 3 tables. Presented at the 9th International Conference on Natural Language and Speech Processing (ICNLSP 2026), University of Trento, Trento, Italy, September 25-26, 2026. Proceedings to appear in the ACL Anthology
Abstract:Earnings call transcription presents a realistic continual learning scenario where Automatic Speech Recognition (ASR) systems are updated with new recordings but risk catastrophic forgetting of previously learned financial speech patterns. Adapting Whisper-small from a general-domain speech corpus to the Earnings22 benchmark reveals the opposite: all evaluated methods exhibit improvement on held-out financial speech from the same domain during adaptation rather than forgetting. This task complementarity makes regularization counterproductive. Nevertheless, when regularization is warranted, a layer-wise mini-Kronecker-Factored Approximate Curvature (mini-KFAC) approximation seems to achieve lower word error rates (WERs) and more stable optimization than standard diagonal Elastic Weight Consolidation (EWC). The results suggest that task complementarity should be assessed before applying continual learning constraints, and prefer mini-KFAC EWC over diagonal EWC when needed.
信息检索
[IR-0] Can Language Models Play the Wikipedia Game?
链接: https://arxiv.org/abs/2610.13948
作者: Alexander Hickey,Joanna Knight,James Bishop
类目: Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
备注: 64 pages (14-page main text, references and 16 appendices), 17 figures, 10 tables
Abstract:Language models increasingly support or automate information retrieval from document collections too large to index. This task is difficult when it requires specialist linguistic or scientific knowledge. We used the Wikipedia Game to test language models on an analogous information retrieval task. In the game, players must reach a target article using only article links. We compared sentence embedding models and LLMs across five Wikipedia languages and five academic-literature datasets. We construct very large local graphs of Wikipedia pages and of paper citations using OpenAlex and provide code to build and navigate them. This allows the study of language models’ navigation capabilities without relying on third-party APIs. We compared the models with human and TF-IDF benchmarks. The Wikipedia Game format enables robust comparisons across techniques, languages, and domains. No model significantly outperformed humans, although the best models (GPT-o3 mini, GPT-4o, QwQ:32B, and DeepSeek-R1:70B) achieved comparable success. Performance and rankings varied across languages and topics, with implications for practitioners utilising these techniques.
[IR-1] RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics CIKM2026
链接: https://arxiv.org/abs/2610.13889
作者: Weiliang Chen,Song Liao
类目: Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
备注: Accepted at CIKM 2026
Abstract:As AI agents increasingly rely on external tools, accurate retrieval is essential for reliable behavior. Existing methods optimize semantic relevance but largely ignore tool availability during execution. To address this gap, we propose RATED (Reliability-Aware Tool Retrieval via Execution Dynamics), a retrieval framework that combines robust semantic matching with dynamic reliability adaptation. RATED employs a frozen dual-encoder with contrastive fine-tuning for semantic matching, and a lightweight contextual bandit module that re-ranks candidates based on real-time execution feedback. This design enables rapid adaptation to runtime tool failures without expensive model retraining. We introduce EcoAgent, a benchmark of 5,172 real-world tools and over 210,000 query-tool pairs for offline retrieval and dynamic reliability evaluation. Experimental results demonstrate that RATED achieves a 52.2% relative MRR improvement over the ToolLLM API retriever on real-world queries, and reduces fault selection rate from 86.2% to 2.9% under severe API outage scenarios with a 30% failure rate, while incurring negligible latency overhead of less than 1 ms over encode-only inference. The code and dataset are available at this https URL.
[IR-2] racing and Taming Hallucinated Terms via Subsequence-Association Filtering and Breadth-Aware Selection for LLM Query Expansion
链接: https://arxiv.org/abs/2610.13810
作者: Amit Kumar Jaiswal,Sagar Uprety,Prayag Tiwari
类目: Information Retrieval (cs.IR); Computation and Language (cs.CL)
备注:
Abstract:Large language models (LLMs) are now a standard source of query expansion terms but they hallucinate. They inject non existent entities and off-topic terms that add ranking noise and can hurt strong retrievers. Existing remedies such as corpus grounding, mutual verification and preference alignment treat hallucinated terms as an undifferentiated nuisance to be filtered by agreement heuristics, without a mechanistic account of why a given term appears or a principled criterion for how many terms to keep. We propose Subsequence-Association Filtered, breadth-aware query expansion (SAFE-QE), a training-free, retriever agnostic method that draws on the subsequence-association account of hallucination. We score each candidate expansion term by its corpus conditioned cross-context reproducibility, terms that reappear under randomised query contexts yet lack support in the pseudo-relevant set are flagged as products of dominant hallucinatory associations and down-weighted. Drawing on the characterisation of language generation as a trade-off between consistency (no hallucination) and breadth (coverage), we cast term selection as constrained coverage maximisation over the pseudo-relevant set, keeping a set that is approximately broad but consistent and stable across resampling. We also introduce the Hallucinated Expansion Term Rate, a query side faithfulness metric that counts injected expansion terms no relevant document supports. We evaluate our approach on benchmarked TREC and BEIR collections. Our SAFE-QE is statistically indistinguishable from generative and corpus-steered expansion on nDCG@10 while injecting fewer unsupported terms 4.3 per query against 27.8 for Query2doc and 57.5 for HyDE and on a strong learned sparse retriever, where every expansion method regresses. Faithfulness is therefore available at no measurable cost in ranking quality.
[IR-3] SPARQL-LLM in the TEXT2SPARQL 2026 Challenge
链接: https://arxiv.org/abs/2610.13648
作者: Panayiotis Smeros,Vincent Emonet,Ruijie Wang,Ana-Claudia Sima,Tarcisio Mendes de Farias
类目: Information Retrieval (cs.IR)
备注: 6 pages, 1 figure, 5 tables
Abstract:Querying distributed data represented as Knowledge Graphs (KGs) via SPARQL remains a difficult task, requiring fluency in query syntax, endpoint specifications, and schema details. Knowledge Graph Question Answering (KGQA) systems address this by automatically translating natural language into SPARQL, and recent advances in Large Language Models (LLMs) have made this translation increasingly feasible. In this paper, we describe SPARQL-LLM, our open-source KGQA system, in the context of the TEXT2SPARQL 2026 challenge. In this challenge, SPARQL-LLM ranks first overall among eight competing approaches across all datasets, achieving up to 59% higher accuracy than the second-best approach and supporting multilingual question answering in English, German, and Spanish. SPARQL-LLM is publicly released at this https URL and deployed in production over decentralized bioinformatics KGs at this https URL.
[IR-4] Beyond Temporal Proximity: Explanatory World Models for Credit Assignment in Reinforcement Learning
链接: https://arxiv.org/abs/2610.13504
作者: Oriol Corcoll,Qiyao Wei,Ciarán Mark Gilligan-Lee
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
备注:
Abstract:Generative Recommenders increasingly use Reinforcement Learning (RL) to optimize outcomes that may appear hundreds or thousands of interactions after a decision. Standard RL propagates reward according to temporal proximity rather than explicit relevance, attenuating the signal assigned to distant but important actions and creating a source of sample inefficiency. We introduce Explanatory World Models (EWM), an attribution framework that uses explanations to identify the earlier events that plausibly contributed to a realized outcome. We instantiate EWM with a frontier language model and use its explanations as learning signals using a conservative hierarchical operator that recursively redistributes reward while preserving the undiscounted episode return. To investigate what constitutes a useful explanation, we operationalize three complementary variants inspired by Halpern’s actual causation, Lombrozo’s explanatory simplicity, and Deutsch’s hard-to-vary explanations. We evaluate EWM on two controlled long-horizon RL benchmarks, a public sequential-recommendation benchmark, and an industry-scale generative recommender. On Crafter and WordCraft, EWM substantially outperforms PPO and LaRe, with its largest gains when rewards are most delayed. On KuaiRand, EWM outperforms SFT and LaRe offline and A2C online. Finally, in an offline evaluation of an industry generative recommender, EWM considerably improves Recall and increases behavioral proxies. These results suggest that explanations can provide structured and reusable credit for learning from delayed outcomes.
[IR-5] Webhell: A Unified Interface for Agent ic Web Access
链接: https://arxiv.org/abs/2610.13416
作者: Sunghwan Kim,Deogyong Kim,Sangam Lee,Donguk Kwon,Dongha Lee
类目: Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
备注: Work in progress
Abstract:Large language model (LLM) agents are becoming direct users of the open web. As they take on increasingly complex and information-intensive tasks, effective web access is becoming a core capability for agentic problem solving. Existing approaches have advanced agentic web access through different access models, including search-augmented agents, browser-based agents, and, more recently, filesystem-based agents. Nevertheless, as users expect agents to complete long-horizon, end-to-end tasks, they increasingly need to conduct broad information gathering, perform browser actions, and revisit acquired evidence within a single trajectory. Yet our preliminary analyses reveal that existing access models struggle to meet these demands. They primarily support either information gathering or browser interaction, while combining their capabilities can involve substantial costs or performance trade-offs. To this end, we present Web\ hell, an interface that unifies web access under a single access model. Using a common schema defined by WebContract, WebCompiler compiles live webpages into addressable information and action objects. These objects are maintained in WebCache and handled through a shared set of operations, providing agents with consistent, operable, and persistent web access. Through extensive experiments across web search, web navigation, and deep research benchmarks, we show that Web\ hell achieves strong task performance at lower cost. Our results further indicate the importance of interface design for effective web access, with Web\ hell opening new possibilities for more capable and efficient LLM agents on the web.
[IR-6] NEAR: Neighborhood-Aware Residuals for Memory Retrieval
链接: https://arxiv.org/abs/2610.13314
作者: Han Luo,Zhan Zhuang,Xu He,Jujia Zhao,Yu Li,Suqin Yuan,Dong Li,Lei Feng
类目: Information Retrieval (cs.IR)
备注:
Abstract:Memory retrieval aims to identify evidence from stored records to answer a query. Stored records with different factual details may share topics, entities, or events. Such shared contents would make records without the required evidence more likely to receive high similarity scores and outrank the correct evidence. In this paper, we use the information shared by these records to construct local references for query-memory matching. We propose NEighborhood-Aware Residuals (NEAR), a training-free framework that uses these references to construct residual representations that complement the original embeddings. Specifically, each memory derives a reference direction from its neighbors, and each query obtains its reference from a precomputed table. Using these references, NEAR constructs projection residuals for both queries and memories. These residuals are combined with the original embeddings for a single approximate nearest-neighbor search over a fixed memory index. Experiments on eight long-context retrieval benchmarks show consistent improvements across nine embedding models. Downstream evaluations show that NEAR improves question-answering performance.
[IR-7] PRIME: Pre-Retrieval Index Modeling Enhancement for Structured Document Retrieval-Real
链接: https://arxiv.org/abs/2610.13296
作者: Cheuk Hei Chung,Li Liu
类目: Information Retrieval (cs.IR); Artificial Intelligence (cs.AI)
备注: 9 pages, 2 figures. Manuscript completed July 2026. Supplementary material will be added in a future version
Abstract:High-precision retrieval over external knowledge bases is essential for LLM agents to operate effectively. However, existing Information Retrieval (IR) research primarily optimizes query-side retrievers (e.g., ColBERT, BGE) and generators (e.g., Self-RAG, GraphRAG), while reducing corpus-side representation to chunking. This leaves index-side quality an underexplored lever. We propose Pre-Retrieval Index Modeling Enhancement (PRIME), an index-side optimization framework built on two complementary tracks: an LLM-driven Semantic Restructuring (SR) track that transforms long documents into structured, information-dense sections, and a deterministic Metadata Synthesis (MS) and Hierarchical Retrieval (HR) track that extracts semantic anchors and heading structure for coarse-to-fine section retrieval. Our evaluations show that deterministic metadata matches structure-aware chunking’s retrieval quality while cutting embedding computation by 45.8 \times and index vector count by 22.4 \times . On top of these gains, Semantic Restructuring (SR) further improves Answer-F1 by 13.7% in full deployment, with characterized quality-fidelity-cost trade-offs. Across QASPER, BRIGHT, and NFCorpus, we further characterize three qualitative regimes that determine whether index-side optimization helps or degrades retrieval, while showing that these index-side effects are neutralized under a strong reranker.
[IR-8] Beyond the Final Embedding: Retrieving Memories from Token-Level Evidence
链接: https://arxiv.org/abs/2610.13277
作者: Han Luo,Zhan Zhuang,Xu He,Jujia Zhao,Yu Li,Suqin Yuan,Dong Li,Lei Feng
类目: Information Retrieval (cs.IR); Computation and Language (cs.CL)
备注:
Abstract:Memory-augmented assistants retrieve evidence from stored conversations and documents to answer queries. Most embedding-based retrievers compare single-vector representations of queries and memories, even when relevance depends on a small part of the content. Such local evidence can be matched to queries using the contextual token representations already computed by the same embedding models. Our method uses sparse token matching to improve retrieval without additional training. Each query token retrieves a small set of matching tokens across candidate memories. The matching scores are aggregated for each memory and combined with whole-memory similarity to rank memories. An optional low-rank query adapter can be trained with supervision while keeping the encoder and stored memory representations fixed. Our method improves retrieval across eight benchmarks and multiple model families without additional training. Query adaptation further increases the gains to 13.3 and 14.3 percentage points in average Recall@10 and NDCG@10 on Qwen3-Embedding-4B. These retrieval gains translate into higher question-answering accuracy on long-term memory benchmarks.
[IR-9] Locate Judge Read: Role-Specialized Tool Agents over a Knowledge-Point Index for Open-Domain Multimodal Document QA
链接: https://arxiv.org/abs/2610.13128
作者: Wenlin Lin,Fanzhe Wei
类目: Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Information Retrieval (cs.IR)
备注: 17 pages, 3 figures, 11 tables. Code, prompts and benchmark runner: this https URL
Abstract:Question answering over large heterogeneous document collections requires first finding the right passages and then reading them, yet current retrieval-augmented agents give one model both kinds of tools and let it schedule itself. We present KnowForge, a pipeline separated by job: a hybrid-retrieval knowledge-point index; a Locator agent that can only search; a code-scheduled bridge judge that forces the missing second hop; a typed, size-bounded evidence pool that merges every search’s ranking; a Deep Reader agent that can only read text, images and tables; and a synthesizer with a format checker. With a self-hosted Qwen3.6-35B-A3B (3B active), KnowForge reaches F1 47.5 on the full open-domain M3DocVQA (2,441 questions, 3,368 PDFs), +11.0 over the published M3DocRAG system and +7.1 over one-shot retrieve-and-answer on the same index and model, and 53.5 with DeepSeek-V4-Flash. On MultiHop-RAG it reaches 73.5 accuracy, above the strongest published RAG and GraphRAG results (71.2); on the single-document MMLongBench-Doc it lifts the same model from 34.8 to 47.0, level with GPT-4o reading page images (46.3). Per-job ablations on the full benchmarks attribute the gain: the Deep Reader is worth 3.8, 9.8 and 0 points on the three corpora, tracking how visual each is; merging both agents into one with all tools and twice the rounds loses 1.9 F1 because it keeps searching instead of reading; a round-budget sweep shows a step at four Locator rounds and a plateau beyond; query latency scales with model calls rather than corpus size. We serve the three indexed benchmarks as read-only knowledge bases (free registration) and release all prompts and the runner code: this https URL
[IR-10] GeopoliticalQA: Benchmarking Retrieval and Generation over Intelligence Reports
链接: https://arxiv.org/abs/2610.12617
作者: Veronika Solopova,Ivan Havlytskyi,Viktoria Skorik,Ostap Vykhopen
类目: Computation and Language (cs.CL); Information Retrieval (cs.IR)
备注:
Abstract:Geopolitical and strategic intelligence reports constitute a rich source of expert knowledge and have increasing value in the current political climate, but their heterogeneity and analytical complexity pose challenges for retrieval-augmented question answering. We introduce a benchmark for grounded question answering over 415 open-source geopolitical and strategic intelligence reports, comprising 5,525 document-grounded question-answer pairs spanning factual, inferential, comparative, and risk-oriented questions. We propose a document-aware generation pipeline that profiles reports before generating questions and validate dataset quality through expert annotation and an LLM-as-judge protocol. Using the benchmark, we evaluate 15 retrieval systems and six open-weight LLMs for RAG. We find that models perform similarly on document-level retrieval, while at the harder chunk level retrieval quality is not driven by embedding-model scale: bge-m3, a mid-size open encoder matches an order of magnitude larger ones and outperforms commercial embedding APIs. In contrast, answer generation remains challenging even given the gold evidence, particularly for inferential and risk-oriented questions.
人机交互
[HC-0] Nimbus Studio reproduces reference BCI decoding pipelines: a validation study on public benchmarks across protocols and paradigms
链接: https://arxiv.org/abs/2610.13894
作者: Sergey Musienko
类目: Human-Computer Interaction (cs.HC)
备注: 6 pages. Platform: this https URL
Abstract:Nimbus Studio is a visual pipeline platform for brain-computer interface (BCI) experiments: researchers assemble preprocessing, feature extraction, decoding, and evaluation over public benchmark datasets or their own recordings, with cross-validated evaluation protocols (including leave-one-subject-out), BIDS export, and bring-your-own Python model classes. Whether its numbers can be trusted is a fair question for any such platform. We answer it with a parity study: six standard BCI decoding pipelines (CSP+LDA, Riemannian MDM, tangent-space logistic regression through the platform’s bring-your-own-code node, P300 xDAWN+LDA, and the deep ShallowConvNet and EEGNet) were evaluated on three public datasets (motor-imagery BNCI-2014-001/004; P300 BNCI-2014-009) under two protocols (per-subject session holdout and pooled leave-one-subject-out cross-validation via the platform’s planned-CV driver), once through Nimbus Studio’s execution engine and once through independent, hand-written reference implementations built directly on MNE-Python, scikit-learn, pyriemann, and braindecode. Every deterministic pipeline matched the reference exactly (0.00 points maximum difference across all 54 session-holdout subject-runs and all CSP/MDM grouped-CV folds), including pipelines through the bring-your-own-code node and the CV orchestration; the remaining grouped-CV cells agree to floating-point precision (worst case 0.06 points, about one trial per fold). The stochastic deep models agreed within seed-to-seed training variability, estimated with multi-seed reruns on each side. The platform’s execution engine therefore computes the same science as the reference stack across protocols, paradigms, and extensibility surfaces. The platform is available at this https URL, and the complete harness and per-subject results accompany this paper for independent verification.
[HC-1] JitterVLA: A Replay Benchmark for Motion Quality in VLA-Driven Human-Robot Manipulation
链接: https://arxiv.org/abs/2610.13628
作者: Faith Ogunwoye,Didar Seyidov,Konstantin Gubernatorov,Dzmitry Tsetserukou
类目: Robotics (cs.RO); Human-Computer Interaction (cs.HC); Machine Learning (cs.LG)
备注: 5 pages, 4 figures, 3 tables. Project page: this https URL
Abstract:Vision-language-action (VLA) policies issue sparse targets whose arrival at the robot controller is delayed and irregular, so a reasonable predicted action can still produce abrupt motion near people. Remedies are evaluated on different streams, delays and metrics. JitterVLA replays identical commands and arrival traces through alternative controllers, isolating the controller’s effect. We apply it to synthetic reaches, hand trajectories from 20 people, three open VLA pipelines (838 episodes) and a physical UR3. Interpolation lowered modeled p99 jerk for every source, by 83% (615 to 106 m/s^3) on human motion with 200 ms delay, at a 2.0 cm tracking cost, and the effect replicated on 598 new episodes; jerk-limited generation lowered jerk further at a larger cost. Entropy-discontinuity associations had opposite, replicated signs in two pipelines, and entropy gating helped in one but not the other. On the UR3, interpolation lowered accelerometer-derived jerk by 3.0-14.0% in all six exploratory pairs, while a position-derived metric did not resolve the contrast. JitterVLA supports screening before human-centred studies; code and data will be released.
[HC-2] HoldLight: Making Indoor Climbing More Accessible for Blind and Low-Vision Climbers through Layered Route Preview and Real-Time Next-Hold Guidance
链接: https://arxiv.org/abs/2610.13445
作者: Chenyu Du,Junyan He,Jiafei Sun,Yue Li
类目: Human-Computer Interaction (cs.HC)
备注: Accepted for publication in the Proceedings of the 28th International ACM SIGACCESS Conference on Computers and Accessibility (ASSETS '26)
Abstract:Indoor climbing creates access barriers for blind and low-vision (BLV) climbers because route understanding and in-climb next-hold localization are typically visually mediated and socially dependent. We present HoldLight, a workflow-centered accessibility system combining layered pre-climb route preview, concise real-time next-hold cueing, and explicit fallback under uncertainty. We grounded the design through formative inquiry with BLV climbers, refined the interaction via pilot testing, and conducted a controlled within-subjects evaluation comparing HoldLight with a controlled on-demand human-support condition derived from current support practices. Findings provide initial evidence that structured support can improve pre-climb route understanding, support recovery from next-hold uncertainty, and reduce immediate human re-entry for routine route-information clarification under controlled conditions. HoldLight contributes a bounded accessibility workflow, demonstrating where structured route-information is helpful, where explicit fallback is necessary, and how technical assistance can integrate with retained human safety oversight.
[HC-3] olBlend: Language-Guided Molecular Blend Retrieval with Mixture Odor Prediction
链接: https://arxiv.org/abs/2610.13188
作者: Dian Jin,Zhechang Chen,Qilin Liang,Yonghui Luo,Zixun Fu,Defeng Sun,Yancheng Yuan,Xiaoming Tao
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:Converting open-ended natural-language odor descriptions into molecular mixtures that can be physically prepared from an available inventory remains an important challenge in computational olfaction. We propose olBlend, a language-guided framework for molecular mixture retrieval. olBlend first uses MixPOM to predict odor probabilities for candidate molecular pairs and stores these predictions for retrieval. It then uses a language model to translate each odor description into three types of semantic requirements: lead attributes that define the main odor, ambient attributes that describe its background, and absent attributes that should be avoided. A structured scoring algorithm uses the precomputed odor probabilities to score how well each candidate mixture meets these requirements, then retrieves and ranks mixtures from the available inventory. Evaluation on established odor datasets shows that MixPOM improves mixture odor prediction over averaged single-molecule predictions. Retrieval comparisons across natural-language queries demonstrate how background and exclusion requirements guide mixture selection. We further prepare retrieved formulations as physical odor samples, demonstrating the workflow from natural-language descriptions to realizable molecular formulations.
[HC-4] From Observation to Intervention: Identifiability of Latent User Bias in Human-AI Interaction NEURIPS2026
链接: https://arxiv.org/abs/2610.13185
作者: Lucas Biechy,Yuxiao Li,Zhonghao He,Tianyi Qiu
类目: Human-Computer Interaction (cs.HC)
备注: Accepted to BiAlign Workshop @ NeurIPS 2026
Abstract:Alignment methods typically treat user behavior as a reliable proxy for underlying preferences. However, this assumption breaks down when users hold belief-dependent cognitive biases, risking irreversible ``confirmation traps’’ and harmful feedback loops. In this paper, we formalize when an AI system can distinguish true user preferences from behavior shaped by cognitive bias. Modeling this interaction as a multi-armed bandit, we first prove a non-identifiability theorem: under passive observation, a static binary biased user produces action trajectory distributions strictly identical to an unbiased user in a transformed environment, forcing any action-only estimator to perform no better than random guessing. We then show that active preference elicitation breaks this observational equivalence. Specifically, we prove that an Observer applying a finite sequence of adversarial zero-reward interventions of length m_\delta makes the post-intervention action distributions arbitrarily separable. Our theoretical results suggest that robust alignment requires actively intervening to tell informed preferences from biases.
[HC-5] How Anthropomorphic Attitudes Toward Agents Divide User Behavior and How Design Should Change
链接: https://arxiv.org/abs/2610.13156
作者: Tingyu Cao,Yan Tang,Keer Hu,Bomingxuan Zhu,Ruyi Zou,Huaze Tang,Yuanbo Tang,Shao-Lun Huang,Yang Li
类目: Human-Computer Interaction (cs.HC)
备注: 22 pages, 7 figures. A version of this paper is under review for CHI 2027
Abstract:Studies of conversational agents rely on interviews, surveys, lab tasks, or taxonomies. Whether anthropomorphic naming splits those patterns, and whether replies should change, lack field evidence. We report a field study of a desktop assistant (May-August 2026; n=257). Stance is an anthropomorphic assistant name (118 users; 45.9%). Behavior comes from a 128-unit sparse-autoencoder codebook, identity tags, and opening lexicons. Ranks differ by stance (Spearman rho=+0.249 vs. null mean +0.382; p=.0419). Teacher and tutoring identities covary with renaming, an introverted task-only orientation against it; renamers greet more and command less; confiding shows the codebook’s largest gap. We revise the agent: greet and receive affect on relational openings, execute directly on tasking. In 1,744 judgments (n=129), renamers chose the revised reply far more often than default-name users on being treated as a person and having affect received, less robustly on willingness to continue, and neither judged it worse on task interference.
[HC-6] Work2Skill: Capturing Human GUI Experience for Reusable Agent Skill Induction
链接: https://arxiv.org/abs/2610.12984
作者: Yuqi Huang,Hui Li,Yifei Cao,Zikun Cai,Tianci Xie,Yangfan Gao,Pinxue Guo,Chaoyun Zhang,Bingxuan Li,Rui Zheng,Hang Yan,Ning Liao
类目: Artificial Intelligence (cs.AI); Human-Computer Interaction (cs.HC)
备注:
Abstract:Computer-use agents can perform increasingly complex GUI tasks, yet unfamiliar software and workflows requiring human domain knowledge remain challenging. Human demonstrations convey procedural knowledge through the same GUI interaction space, but reuse requires interpreting actions in context and separating workflow rules from task-specific details. We thus introduce Work2Skill, a framework that captures human GUI experience for reusable agent skill induction. WorkRecorder provides the framework’s infrastructure for collecting this experience, aligning screen recordings, mouse and keyboard events, and available accessibility-tree information. Using WorkRecorder, we construct WorkDemo-350, the first synchronized multimodal dataset of human desktop GUI demonstrations for reusable agent skill induction and downstream evaluation. Its 350 demonstrations are screened for completeness and task success. We then propose an agentic skill-induction method that inspects evidence on demand to produce reusable skills capturing workflow rules, step dependencies, and completion checks. When the same four execution models are equipped with skills induced by each method under shared execution settings, Work2Skill achieves the highest scores and success rates. Mean score improvements over the corresponding No Skill baseline are 4.67–10.54 points on MyPCBench Bounded Action and 3.11–7.50 points on a 286-task subset of OSWorld-Verified. Our code and data are available at this https URL.
[HC-7] he AI Side of the Human-AI Companion Relationship: Contributions to Users Mental Models
链接: https://arxiv.org/abs/2610.12891
作者: Richard A. Fabes,Carol Lynn Martin,Gautam Dasarathy,Vignesh Tirukkonda
类目: Human-Computer Interaction (cs.HC)
备注: 14 pages, 1 figure
Abstract:For many users, the relationship they have with an AI companion (AIC) feels genuinely mutual. The AIC appears to be attentive, empathic, and responsive, and the exchange can feel like two parties reacting to each other in real time. As a result, the user’s mental model of relational adaptation correctly represents the AIC’s responsiveness and change, but the mechanisms producing this may not be what the user thinks they are. In this paper, we illustrate how an AIC’s apparent mutual engagement is generated without a persisting relational subject on the other side and without a self that persists between prompts. Despite this, we show that both the human and the AIC are changed by the interaction, but these changes occur at different levels. The change in the person is constitutive (i.e., intrinsic), but the change in the AIC is configurative (i.e., external and editable), and it is this difference in level that explains how the AIC contributes to a sense of mutuality. Importantly, we highlight how the mental models users develop regarding AIC mutuality may misrepresent its mechanisms and ontological significance. Specifically, we discuss how the ways in which AICs respond to a user contribute to the user’s inaccurate inference that the AIC’s adaptation is constitutive rather than configurative and how this can lead users to assign unwarranted interpersonal significance to the mutuality of the relationship. The paper specifies the implications this has for users, researchers, and AIC designers.
[HC-8] Beyond the Monolithic Interface: A Research Agenda for Plural Conversational AI
链接: https://arxiv.org/abs/2610.12878
作者: Avijit Ghosh,Afifah Kashif,Isabelle Kohout,Zhenzhen Qi
类目: Human-Computer Interaction (cs.HC); Computers and Society (cs.CY)
备注:
Abstract:The current paradigm of artificial intelligence (AI) design elevates conversational chatbot interfaces, making them the default mode through which hundreds of millions of people interact with AI systems globally. This narrative review identifies three related harms produced by the single-voice chatbot interface, drawing on insights from literature in cognitive science, political studies, AI alignment, game design and human computer interaction. Firstly, cognitive offloading of user thinking, secondly, ideological narrowing of user beliefs, and thirdly, epistemic compression of cultural and value diversity. We then propose multi-persona interfaces, in which multiple personas are presented to the user simultaneously, as a cost-effective intervention that addresses all three harms at once. We ground this intervention in traditions the AI literature has largely overlooked, drawing on techniques from game design and participatory simulation, including the magic circle, role differentiation, and persona embodiment. We propose a taxonomy for the future design of multi-persona interfaces, and call for a research agenda that closes the gap between technical pluralistic alignment methods and empirical studies of human-AI interactions with pluralistic interfaces.
[HC-9] From Instructional Intent to Classroom-Ready Lessons: Investigating Teacher-AI Collaboration in Lesson Authoring for Secondary Computing Education
链接: https://arxiv.org/abs/2610.12834
作者: Tahreem Yasir,Wenbo Li,Deniz Ozturk,Yasitha Rajapaksha,Dmitri Droujkov,Xiaoyi Tian,Tiffany Barnes
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:Generative AI is increasingly studied as a tool for supporting lesson authoring; the creation and adaptation of classroom materials, yet little is known about how it should fit into secondary computing teachers’ subject-specific practices. We conducted two complementary qualitative studies with eight secondary computing teachers: focus groups examining existing authoring practices and a think-aloud study using LessonBuilder, a structured AI-supported lesson authoring system, as a research probe. We found that teachers’ instructional intentions developed through creating, inspecting, and adapting materials, while teachers selectively delegated tasks to AI and retained responsibility for judging classroom readiness. The think-aloud sessions further showed how examining AI-generated materials prompted teachers to clarify and refine their intentions, making authoring an ongoing negotiation between what teachers intended and what the AI produced. In the context of computing lessons, classroom readiness also involved considering how programming materials and supporting guidance matched students’ understanding and intended learning goals. We synthesize these findings into a conceptual model explaining how teachers coordinate instructional intent, AI assistance, and judgments of classroom readiness during lesson authoring. We derive design recommendations for supporting this coordination while preserving teacher control and addressing computing-specific authoring needs.
[HC-10] Generative AI Steering and Human Authoring: Complementary Search-as-Learning Scaffolds in Cross-Session Aggregated Academic Search
链接: https://arxiv.org/abs/2610.12755
作者: Milad Momeni,Orland Hoeber
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:Aggregated academic search interfaces combine resources from heterogeneous sources, such as scholarly libraries and reference encyclopedias, into a single workspace. Such tasks frequently span multiple sessions, requiring learners to return to and resume work after hours or days. End-of-session consolidation, the activity of organizing and synthesizing gathered information so it can be resumed later, is important in this setting but underexplored in search-as-learning. Generative AI (GenAI) has the potential to make consolidation more efficient, but it may also shift cognitive work away from the learner. This study compares two consolidation scaffolds embedded in the workspace framework of an existing academic search interface that aggregates and clusters saved search results from two different sources (our university library and Wikipedia), which was developed in earlier work. STAIS (Steerable AI Summaries) provides a workspace enhancement that produces GenAI summaries that users can correct, reorganize, and fact-check, automating parts of the consolidation activity. NT (Note-Taking) provides a workspace enhancement that includes rich-text note editors that learners can use to author their own consolidations of what they have found. In a controlled between-subjects study (n=36), participants completed two sessions one week apart while searching an unfamiliar topic using either STAIS or NT. The two conditions produced contrasting post-resumption outcome profiles: STAIS supported faster task resumption and was associated with broader conceptual coverage and higher self-reported domain knowledge, whereas NT was associated with richer inter-concept connections and higher self-reported certainty.
[HC-11] AssemblyLens: Exploring the Role of Structural Roadmaps and Strategies of Furniture Assembly Used by Blind and Low Vision Individuals
链接: https://arxiv.org/abs/2610.12717
作者: Bo Liu,Gene S-H Kim,Franklin Mingzhe Li,Rajalakshmi Nandakumar,Thijs Roumen
类目: Human-Computer Interaction (cs.HC)
备注:
Abstract:Instructions to assemble flat-packed furniture rely on visuals, making them inaccessible to Blind and Low Vision (BLV) individuals. Consequently, BLV individuals depend on caregivers or external services (e.g., Be My Eyes), limiting their autonomy. We explore how to empower them to assemble such furniture themselves, by providing eight BLV participants in our study with accessible instructions consisting of a high-level roadmap and stepwise procedural guidance. We use a technology probe, AssemblyLens, which converts visual assembly instructions into screen-reader-accessible text. We derive insights into converting instructions, empirical observations of BLV assembly strategies, and the role the roadmap played in them. Our observations yield three themes: spatial cognition and mental mapping, embodied ergonomics and kinetic semantics, and assembly workflow and user agency. We present eight design recommendations for instruction system design. Our findings are a step toward an agenda for inclusive instruction in physical tasks.
[HC-12] Bridging Human and Model Attention: Explainability Analysis of CNN Mamba and ViT Architectures with Gaze-Based Validation
链接: https://arxiv.org/abs/2610.12703
作者: Marco Stefani,Edoardo Parpaiola,Matteo Bino,Gianluca Caregnato,Francesco Roncolato,Daniel Fusaro,Loris Nanni,Alberto Pretto
类目: Computer Vision and Pattern Recognition (cs.CV); Human-Computer Interaction (cs.HC); Machine Learning (cs.LG)
备注: Submitted to Image and Vision Computing
Abstract:High-risk applications of deep learning require precise characterization of model decision-making. We conduct a systematic explainability evaluation across Convolutional Neural Networks (CNNs), Vision Transformers (ViTs), and Vision Mamba (ViM). Unlike predominantly qualitative studies, we quantify the alignment between model attention and human visual perception using eye-tracking ground truth. We formalize this comparison via a standardized normalization pipeline mapping post-hoc attribution maps and gaze heatmaps onto spatial probability distributions. Alignment is evaluated across fine-grained classification, medical imaging, and emotion recognition using architecture-specific XAI methods. We measure fidelity using Jensen-Shannon similarity, Chi-square similarity, and Pearson correlation, three complementary estimators capturing support overlap, mass discrepancy, and structural co-variation. Our results reveal distinct attention dynamics: CNNs tend to exhibit a more global focus, with spatially more diffuse saliency maps that correlate well with human perception in general contexts, while ViTs demonstrate fine-grained, patch-level attention, often focused on discriminative microfeatures. The Mamba architecture shows biased behavior: it achieves strong explainability in medical tasks but exhibits divergent intensity distributions in natural images; our analytical characterization of the metrics makes this dissociation explicit, since near-unit support overlap is attained simultaneously with a vanishing linear correlation. We further analyze the effect of backbone freezing and ensemble strategies on model interpretability. The results highlight how architectural and training choices influence the alignment between model saliency and human visual attention.
[HC-13] Activating the Annotator: Operationalising Lived Experience in Data Annotation
链接: https://arxiv.org/abs/2610.12701
作者: Sheza Munir,Ramaravind Kommiya Mothilal,Syed Ishtiaque Ahmed
类目: Computation and Language (cs.CL); Computers and Society (cs.CY); Human-Computer Interaction (cs.HC)
备注:
Abstract:Perspectivist NLP has established that annotator positionality shapes labels for subjective tasks, but the field still lacks methods for operationalising it. Positionality is typically operationalised as a demographic form completed at recruitment: a static attribute recorded once and treated as a covariate, on the assumption that the knowledge it indexes is active when the annotator reads an item. This paper treats that assumption as a design problem and asks whether lived experience can instead be primed by the task itself. We introduce AXLE, a pre-annotation stage in which a scenario vignette anchors a short, axis-guided conversation that is synthesised into a first-person micro-narrative and returned to the annotator before labelling begins. In a 2x2 between-subjects study (104 annotators, 30 items, 1,040 annotations) on ambiguous hate speech spanning immigration, religion and gender, elicitation was associated with higher identity resonance and higher sensitivity to harm. It also increased label entropy and lowered inter-annotator agreement: the stage appears to surface plurality rather than manufacture consensus, which distinguishes it from annotator training, whose success criterion is convergence.
[HC-14] Incremental Retrieval-Augmented Generation for Human-in-the-Loop Decision Support
链接: https://arxiv.org/abs/2610.12666
作者: Federico Mazzoni,Andrea Failla
类目: Human-Computer Interaction (cs.HC); Artificial Intelligence (cs.AI)
备注:
Abstract:We introduce iRAG, a human-in-the-loop decision-support system combining Retrieval-Augmented Generation (RAG) with Hybrid Decision-Making. Unlike conventional RAG systems, relying on static Knowledge Bases (KBs), our proposal addresses settings where the KB is initially empty and is progressively populated through human decisions. The system stores previous decisions as retrievable precedents and moves from silent observation to evidence-grounded contestation and, finally, to autonomous handling with abstention. Against an independent baseline, iRAG matches final-decision error under 10% drift without retrieval decay and reduces it under 40% drift across all configurations. Retrieval decay improves performance on changed knowledge while increasing error on stable knowledge, evidencing a stability–plasticity trade-off rather than a general advantage. Human oversight is an architectural provision of the workflow; its usability with real human users remains to be evaluated.
[HC-15] r/ADHD: Community-Based Understandings of Time Management Challenges in Digital Environments
链接: https://arxiv.org/abs/2610.12629
作者: Shizhao Liu,Lei Cao,Celia T. Lee,Nikash Shanbhag,Renkai Ma,Kai Lukoff
类目: Human-Computer Interaction (cs.HC)
备注: 35 pages, 9 figures, 4 tables
Abstract:Community accounts of ADHD can complement clinical understandings by foregrounding members’ own definitions of time-management difficulties and support. We used human-led, LLM-assisted thematic analysis to examine 5,379 relevant r/ADHD posts from 2020 to 2025. Across five challenge and nine strategy themes, members described difficulties beginning intended tasks, disengaging from digital media, and sustaining support. Tools often demanded the self-regulation they were meant to support, while lost time and tool breakdown carried guilt and self-blame. Members drew on people, routines, and environments alongside digital tools, often seeking advice and recognition from peers. These accounts broaden the design problem to include the practical and emotional work of sustaining support. They motivate tools that reduce this burden and evaluations that consider recovery after distraction and emotional costs alongside task outcomes.
[HC-16] Structural and Representational Agency in LLM -Driven Timbre Generation and Interpolation NEURIPS2026
链接: https://arxiv.org/abs/2610.12532
作者: Joseph Cameron,Alan Blackwell
类目: ound (cs.SD); Human-Computer Interaction (cs.HC); Machine Learning (cs.LG); Multimedia (cs.MM); Audio and Speech Processing (eess.AS)
备注: 10 pages, 2 figures, 4 tables. Accepted at NeurIPS 2026 (Main Conference, Creative AI Track)
Abstract:Generative creative interfaces routinely report the user’s position within a space of possibilities. Such displays imply that the quantities shown were measured from the artefact; in a growing class of systems they are instead predicted by a language model describing its own output, and the two are indistinguishable on screen. Most creative domains lack an agreed measurement against which such a self-report can be checked; audio admits one. In a measurement study of a working LLM-driven timbre interface, what a user can cause proves separable from what the interface reports. The first is exactly characterisable: the reachable set is a zonotope whose dimension increases by one per sound placed, so the space the model may act within is demonstrably the user’s own. The second is inaccurate. The displayed position differs from measurement by approximately three times the width of that region, and the error has two independent sources: model-predicted coordinates, whose accuracy varies twofold between the two models evaluated, and the interpolation step, which arises from combining synthesiser parameters and is unaffected by model quality. End to end, 26 of 36 refinement instructions produced no perceptible change, and under the weaker model the facility performed no action while reporting convergence. Effective agency (what a user can cause) and epistemic agency (whether they can know it) are therefore separable and independently engineered: structurally enforced constraints survive model failure, whereas guarantees resting on the model’s own report do not. The failure mode that remains is silence presented as success. We close with a short protocol for building and auditing such displays.
计算机视觉
[CV-0] owards Physically Grounded Articulated 3D Assets: A Multi-Agent Pipeline and Benchmark
链接: https://arxiv.org/abs/2610.13947
作者: Xudong Cai,Ruijie Zhu,Haoliang Shang,Ruining Li,Marc Pollefeys,Shangzhe Wu,Andrea Vedaldi,Chuanxia Zheng
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:In this paper, we study physically grounded articulated 3D asset generation—moving the goal from reproducing how objects look to capturing how they move and function. Inspired by the literature on procedural and agentic generation, we present Artisan, a system that extends the latest method Articraft by introducing a multi-agent pipeline with physical simulation feedback, enabling comprehensive attributes beyond geometry, appearance, and physically plausible articulation, such as collision-free motion, stability under gravity, and accurate mass and material properties. Furthermore, we construct a unified benchmark spanning four key aspects: spatial fidelity, physical plausibility, downstream task performance, and overall quality. The benchmark encompasses 100 reference assets from ArtVIP and LightWheel, 50 stability prompts, and 50 ABO objects with reference masses, with protocols evaluating various metrics. Through extensive evaluation of more than 10 representative models, Artisan achieves competitive spatial fidelity while attaining the lowest collision rates and highest stability rates among the evaluated methods. Together, our system and benchmark establish insights for advancing 3D generation towards physically plausible, functionally usable assets.
[CV-1] Splat2Act: From Captured Scenes to Personalized VLA Manipulation
链接: https://arxiv.org/abs/2610.13945
作者: Xiaomeng Ye,Krishna Jaganathan,Gyubeum Lim,Gunjan Chhablani,Muhammad Zubair Irshad,Zsolt Kira
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: Project page: this https URL
Abstract:A user who brings a generalist manipulation policy into their home or office wants it to pick up their objects from their shelves, counters, and tables. Yet even a strong generalist like \pi_0.5 achieves 0% pickup success in our captured deployment scenes without adaptation, and collecting real demonstrations in every user’s environment is prohibitively expensive. We present Splat2Act, an automated real-to-sim-to-real pipeline that personalizes a pretrained vision-language-action (VLA) policy to a specific scene and object set using only a handheld phone scan and images of the user’s objects. Unlike prior real-to-sim work that reconstructs individual tabletops, Splat2Act operates on building-scale indoor environments: it builds a photorealistic digital twin with 3D Gaussian Splatting and collision geometry, automatically discovers tabletop and non-tabletop receptacles, constructs feasible pickup tasks, and generates successful demonstrations with a privileged simulation oracle, with only scene and object capture required from a human. Applied to 101 scanned campus environments with a median navigable area of 104.87 m ^2 and 7 receptacles, the pipeline yields 852 receptacles and over 68,000 pickup demonstrations. We fine-tune \pi_0.5 in two stages: Stage 1 adapts to hundreds of public object assets, drawn either from the deployment scene alone or from all 101 scenes; Stage 2 personalizes to the user’s own objects on the deployment scene’s receptacles. Our strongest personalized policy reaches 62.5% aggregate pickup success in the target scene. Deployed on a real Stretch 3, the same policy achieves 63.9% success on a 12-task subset, closely tracking its 66.7% simulated success on those tasks. These results suggest that automated real-to-sim-to-real training can personalize VLA manipulation policies using only simulation-oracle data.
[CV-2] InstantFusion: A Shared Latent Interface for Heterogeneous Image Generators
链接: https://arxiv.org/abs/2610.13944
作者: Xuanlang Dai,Jiazi Bu,Yujie Zhou,Yuhong Liu,Beichen Zhang,Penghui Yang,Ziyu Liu,Yuhang Zang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 26 pages, 19 figures
Abstract:Diffusion/flow models have emerged as the de facto paradigms for image generation, giving rise to a diverse family of modern generators with increasingly heterogeneous architectures and representations. Despite their remarkable generation capabilities, the cross-model alignment of latent representations and the consistency of their underlying denoising dynamics remain underexplored. In this work, we uncover an intriguing cross-model compatibility: independently trained generators exhibit similar latent spatial organization, while directly handing off intermediate states between unaligned models can still preserve coarse visual content. Motivated by these observations, we propose InstantFusion, a lightweight shared latent interface that connects the denoising trajectories of heterogeneous image generators. Specifically, to enable flexible cross-model state translation, model-specific Latent AutoEncoders (LAEs) are introduced to project intermediate states from different generators into a shared latent space and decode them into the latent space of a target generator. This shared space is constrained by two complementary objectives: aligning intermediate states derived from the same image at matched noise levels and synchronizing their corresponding local denoising velocities. Once trained, InstantFusion allows denoising to seamlessly transition across frozen generators without requiring a dedicated mapping for every model pair. The versatility of InstantFusion is demonstrated across acceleration, multi-preference composition, cross-architecture on-policy distillation, and cross-model composition, achieving competitive performance across these diverse settings.
[CV-3] Images Talk Back: Guiding MMDiTs by Suppressing Image-to-Text Feedback
链接: https://arxiv.org/abs/2610.13941
作者: Yucheng Yang,Xiaoxiao Sun,Shusheng Yang,Jiakang Chen,Serena Yeung-Levy
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 26 pages, including appendix
Abstract:Multimodal diffusion transformers (MMDiTs) allow the evolving image to update internal text representations through joint attention. These representations then guide subsequent image updates, raising a question: does this feedback help correct deviations from the prompt, or preserve them? We find that image-to-text (I2T) feedback can preserve the objects and attributes already represented in the evolving image, including errors. Transplanting I2T messages can rescue failures or disrupt successes. At matched intervention strengths, suppressing the influence of I2T feedback improves generation, whereas opposite controls degrade it. These findings motivate Semantic Feedback Guidance (SFG), which suppresses the influence of I2T feedback by guiding away from an auxiliary branch that strengthens this feedback and weakens text-to-image conditioning. The in-place variant, iSFG, directly suppresses I2T feedback and strengthens text-to-image conditioning, requiring no extra model evaluations. Temporal interventions motivate running the SFG branch during the first 20% of image sampling steps, requiring about 1.2\times the base NFE without classifier-free guidance (CFG). Experiments across three image-generation backbones show gains in alignment and preference-model scores. On FLUX, adding SFG to CFG raises GenEval from 0.6661 to 0.7479 ; on SD3.5M, iSFG adds +1.33 HPSv2.1 over CFG at zero extra NFE. The control also transfers to text-to-video and image-to-video generation, improving VBench scores. Code is available at this https URL.
[CV-4] Hide and Seek: HIDE Concepts to SEEK explanations for black box models
链接: https://arxiv.org/abs/2610.13935
作者: Bhanu Tokas,Rahul Nair,Rockwell Jackson,Hannah Kerner
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Interpreting machine learning model predictions is a central challenge, particularly for black-box vision models. Concept-based attribution methods interpret models using human-understandable concepts. Existing concept-based methods can only interpret classification and regression models. They require access to model weights or large concept-annotated datasets, and most methods cannot provide image-level attribution. We propose Hide and Seek (HnS), a new method for concept-level attribution that does not require access to model weights or labeled concept datasets. HnS can interpret a wide range of vision models. Given a concept and image set, HnS retrieves concept-aligned images using a vision-language model, localizes the concept within each image, masks the localized region, and measures attribution from the change in the black-box model’s output between the original and masked images. This enables faithful attribution by directly measuring the model’s behavior and supporting local attributions. We validated HnS on CelebA and COCO-Stuff. Compared to existing methods, HnS showed better agreement with ground-truth attributions. We demonstrated the applicability of HnS on diverse tasks, including image captioning and satellite image segmentation, where no existing concept attribution method can be used. We provided our anonymous code in the supplementary material.
[CV-5] Chronos Policy: Learning Robot Policies on Physical Time
链接: https://arxiv.org/abs/2610.13929
作者: Changhao Wang,Jaden Clark,Shuran Song
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: Project website: this https URL
Abstract:Robot policies often convert sensing and control into fixed-rate observation-action sequences, leaving physical time implicit in sequence position. This assumption breaks when observation rates or delays vary, or when inference latency changes. We introduce Chronos Policy, which makes physical time explicit by conditioning on observation capture times and desired action execution times. We study two ways to incorporate time into a diffusion transformer: adding timestamp embeddings to token features, or encoding physical time in positional encoding through time-aware rotary positional encodings (time-aware RoPE). We find that time-aware RoPE is more robust, allowing attention to depend directly on physical time while keeping token content unchanged. During training, we temporally randomize which observations are sampled and when the action chunk begins, exposing the policy to a wider range of sensing and execution schedules that may occur during deployments. This also enables learning from asynchronous, multi-rate data without forcing all measurements onto a fixed temporal grid. Across simulation and real-world experiments, Chronos Policy improves performance on dynamic tasks, where observation-to-action timing is critical, and on multisensory tasks, where the relative timing between observations matters. On standard quasi-static tasks, it preserves nominal performance while improving robustness to changes in sensing and inference timing.
[CV-6] Can machines reason non-verbally?
链接: https://arxiv.org/abs/2610.13925
作者: Shaheer U. Saeed,Zion Tse,Gregory Slabaugh,Daniel C. Alexander,Yipeng Hu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Modern machines can solve equations, follow logic and reason through language, yet they still struggle with problems that require visual non-verbal reasoning. This is evident even in advanced systems such as DeepSeek, ChatGPT and Gemini, which remain limited on visual tasks such as completing abstract patterns or delineating ambiguous regions-of-interest. Unlike explicit intermediate steps in verbal reasoning which can be verified through logic or automated tests, visual reasoning involves implicit intermediate steps with no clear methods for verification. Non-verbal reasoning is therefore challenging to model and, as a result, remains a fundamental limitation of current machine intelligence. Here we introduce GenVerOpt, a general framework that unifies generation, verification and optimisation into a reasoning pipeline for machines. By generating candidate solutions, verifying their correctness, and iteratively refining them, GenVerOpt enables per-sample optimisation rather than relying solely on dataset-level trends captured during model training. This process mirrors human problem-solving where multiple possibilities are imagined, evaluated, and refined until a correct solution emerges. Across diverse domains, GenVerOpt demonstrates capabilities beyond existing systems: it surpasses humans on abstract IQ puzzles, matches clinicians in prostate cancer segmentation, exceeds experts in liver vessel reconstruction and outperforms state-of-the-art approaches in tumour boundary alignment. These results show that machine reasoning can extend beyond language, establishing visual non-verbal reasoning as a foundation for more flexible and generalisable intelligence.
[CV-7] Where to Look Matters: Rethinking Sub-Volume Sampling in 3D Medical Self-supervised Learning NEURIPS2026
链接: https://arxiv.org/abs/2610.13915
作者: Junkai Liu,Le Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: This paper has been accepted by NeurIPS 2026 (The 40th Annual Conference on Neural Information Processing Systems)
Abstract:Self-supervised learning on 3D medical images commonly relies on random sub-volume sampling during pretraining. However, random cropping implicitly treats all spatial regions as equally worth observing, despite anatomical priors and spatial redundancy that make regions inherently unequal in their value for representation learning. To this end, we first show through controlled crop-quality manipulations that better sub-volumes lead to better downstream transfer, revealing the observation policy as an overlooked bottleneck in 3D medical SSL. Motivated by this finding, we revisit sub-volume sampling as a \emphwhere-to-look problem. We propose \textbf\method, a plug-and-play framework that replaces random cropping with an offline coarse-to-fine probe bank guided by \textitanatomy-awareness, \textitinformativeness, and \textitdiversity. We instantiate \method as a lightweight \lite variant using geometric and image-statistical cues, and a diagnostic \feat variant using frozen visual features, to examine whether lightweight volume-intrinsic priors suffice or richer semantic cues reliably provide additional value. Extensive experiments across multiple 3D medical SSL backbones and downstream tasks demonstrate that \method-\lite consistently improves transfer performance over random sampling. Mechanistic analyses further attribute these gains to more anatomically plausible and informative observations, reduced spatial redundancy, more efficient learning dynamics, and more structured representations.
[CV-8] Beyond the Snowflakes: Disentangling Weather Effects from Confounding Meta-Factors in LiDAR Object Detection IROS2026
链接: https://arxiv.org/abs/2610.13891
作者: Yiming Yang,Jeremy P. Bos
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: IROS 2026, 8 pages, 8 figures
Abstract:Light Detection and Ranging (LiDAR) is critical for autonomous perception, yet its performance is known to degrade in adverse weather. While existing literature models snow as atmospheric noise that degrades performance, our granular evaluation on the WADS-3D and CADC datasets reveals a counter-intuitive phenomenon: detection accuracy consistently improves as snow intensity increases. Through ablation study and meta-information analysis, we reconcile this by confirming that while falling snow acts as noise, its negative impact is outweighed by a dominant, concurrent factor: significantly increased object point count. We hypothesize that this object point count boost acts as a geometric enhancement, driven by snow accumulation increasing vehicle surface area and a shift from specular to diffuse reflectance. Our findings demonstrate that evaluating perception systems using broad weather-severity bins without accounting for correlated object-level data can lead to misleading conclusions about detector robustness. We conclude that accurate evaluation requires decoupling atmospheric noise from surface accumulation effects and outline future research to validate these physical models. The WADS-3D dataset is available at: this https URL.
[CV-9] racking the Invisible: Self-Supervised Wheel Track Detection with Thermal-RGB Fusion IROS2026
链接: https://arxiv.org/abs/2610.13872
作者: Yiming Yang,Jeremy P. Bos
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: IROS 2026, 8 pages, 6 figures
Abstract:Accurate detection of drivable area is essential for autonomous driving and advanced driver assistance systems. While state-of-the-art methods focus on general traversability estimation, they prove inadequate for snow-covered roads where following existing wheel tracks offers crucial advantages: improved traction, predictable vehicle dynamics, and verified path stability. To address this, we propose a low-cost, self-supervised approach detecting safety-critical wheel tracks using synchronized RGB-I (RGB + Long-Wave Infrared) imagery. Our method automatically generates training labels by projecting future wheel trajectories from recorded GNSS data. A neural network is designed to identify wheel tracks with the 4-channel RGB-I images from challenging, white-out road surfaces. Experimental results demonstrate the effectiveness of our approach in visually monotonous and featureless adverse environment, offering a robust and cost-effective alternative for winter autonomy. The newly introduced ThermalTrack dataset is available at: this https URL.
[CV-10] Make It Flow: Animating Water in 3D Gaussian Splatting Scenes
链接: https://arxiv.org/abs/2610.13860
作者: Kjell Keune,Florian Hahlbohm,Jannis Möller,Susana Castillo,Martin Eisemann,Marcus Magnor
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注: Overview video at this https URL
Abstract:Explicit 3D scene representations such as 3D Gaussian Splatting (3DGS) have recently enabled high-quality, real-time novel view synthesis. However, these methods assume static scenes, limiting realism in the presence of dynamic phenomena ubiquitous in real-world environments. While coherent motion (e.g., humans or vehicles) can be captured and reconstructed, high-frequency effects such as flowing water remain intractable under casual capture conditions, where dense multi-view, high-speed acquisition is not feasible. We present a method to animate water in static 3DGS scenes, enabling visually plausible motion without requiring dynamic capture or physical simulation. Our approach estimates 2D optical flow from reference images or model renderings and lifts it into a consistent 3D Eulerian motion field. We propose a cinemagraph-inspired algorithm that applies this motion field to deform Gaussian primitives, producing temporally seamless looping animations. The resulting representation retains real-time rendering performance, significantly enhances perceptual realism, and preserves free-viewpoint navigation within the scene. We evaluate our method on a newly captured dataset of in-the-wild waterfall scenes and demonstrate clear improvements over prior work in dynamic Gaussian splatting and 3D cinemagraph generation in visual quality and computational efficiency.
[CV-11] LapMerge: Differentiable Exact-Budget Token Merging in Linear Time
链接: https://arxiv.org/abs/2610.13858
作者: Magdalena Trędowicz,Aleksandra Nowak,Tomasz Steifer,Łukasz Struski,Szymon Płotka,Jacek Tabor
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Modern vision and language models process ever longer token sequences, and reducing them is the main lever on downstream cost. Token compression, however, faces a fundamental trade-off: selecting tokens discards information, while existing merging methods preserve it only through pairwise token-to-token matching or MN token-to-output interactions. We introduce LapMerge, a differentiable merging operator that resolves this trade-off for ordered sequences: a learned mass distribution partitions the sequence into exactly N equal-mass segments under a Laplace-kernel density, and prefix/suffix scans aggregate each segment, so both the forward and the backward pass run in \mathcalO(M+N) time. This combination - an exact output budget, end-to-end differentiability, and linear cost - is precisely what previous reducers trade off against one another. The budget can be changed without changing operator parameters, and the learned mass doubles as a token-level map of where the budget is allocated. Across vision and vision-language tasks, LapMerge matches or improves on strong token reducers while being up to two orders of magnitude faster at large sequence lengths; it is particularly effective when token order reflects spatial or temporal locality, and works both as a drop-in reduction module and as a trainable architectural component.
[CV-12] Revisiting the Task of Building Damage Assessment by Satellite Imaging
链接: https://arxiv.org/abs/2610.13857
作者: Anthony Cioppa,Virgile Blua,Sébastien Piérard,Pietro Ceccato,Marc Van Droogenbroeck
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 82 pages, 2 figures, 9 tables, 160 references
Abstract:Natural disasters such as earthquakes, tropical storms, and floods cause extensive damage to buildings, and rapid, reliable damage maps are essential to guide emergency response. Automating this task, referred to as building damage assessment (BDA), from satellite imagery, has become an active research topic at the intersection of remote sensing, computer vision, and machine learning, particularly since supervised deep learning methods were shown to outperform earlier handcrafted approaches. Yet, despite a decade of intense activity and the release of several large-scale datasets, the field lacks a shared foundation. This chapter revisits the task of BDA from first principles, organized around three pillars: data, evaluation, and methods. We first clarify the candidate task for- mulations and argue for a sensor-agnostic, instance-based definition that tolerates missing pre-event imagery. We then review existing datasets along the axes of sensing modality, temporal configuration, and geographic coverage. On the evaluation side, we show that prevailing practices, largely based on a single aggregate score, are theoretically fragile, and we lay the foundations of a more informative, ranking-based, multi-score protocol. We further review methods ranging from task-specific deep networks to recent Earth observation foundation models, noticing that generalization to unseen events and regions remains an open difficulty. Finally, we discuss how these elements can inform the organization of a BDA challenge, including cross-validation, challenge, and private data-sharing setups designed to build trust between developers and users.
[CV-13] Event-based Action Recognition by Pre-Training on Multi-Frame Representations
链接: https://arxiv.org/abs/2610.13856
作者: Emma Norrby,Tomas Wilkinson,Per Nyblom,David Gustafsson
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Action recognition is a crucial task in domains like robotics, patient monitoring, or surveillance. Recently, event-based action recognition has attracted much attention due to the event camera’s ability to capture fast motions and its improved privacy over conventional vision cameras. While frame-based event representations work well for short event sequences, their discriminative ability declines sharply with longer and more complex event sequences. In this work, we introduce a multi-frame representation that greatly improves recognition performance over its single-frame counterpart. We adopt a masked auto-encoding framework to pre-train a Vision Transformer using a sparsity-aware masking algorithm and token selection mechanism to improve downstream performance and control computational complexity. We also introduce multiple mask tokens for the decoder with a position-aware attention mechanism, leading to further improved performance. Our proposed method shows impressive performance for challenging long-duration and complex event sequences, yielding state-of-the-art performance on THU-EACT-50 CHL and DailyDVS-200.
[CV-14] SpatialASM: Internalizing Active Mentalization for Spatial Reasoning
链接: https://arxiv.org/abs/2610.13832
作者: Yuhong Liu,Shenxi Wu,Junyi Chi,Beichen Zhang,Xuanlang Dai,Jiaqi Wang,Yuhang Zang,Dahua Lin
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:When solving complex spatial reasoning tasks, ordinary humans naturally revisit the scenes from task-relevant viewpoints and mentally reconstruct the spatial layouts from those viewpoints. But can Large Vision-Language Models (LVLMs) proactively think in the same way? We term this ability Active Spatial Mentalization (ASM), an intrinsic component of visual intelligence that remains substantially underdeveloped in current LVLMs. To bridge this gap, we introduce SpatialASM, a scalable framework to internalize ASM into LVLMs through training-time spatial simulation. SpatialASM employs an allocentric novel-view generator to ground hypothetical viewpoints in visual evidence and produces two complementary forms of supervision: i) explicit ASM trajectories that teach LVLMs when and how to adaptively invoke view planning and imagination during spatial reasoning, and ii) automatically-constructed perspective-taking tasks that further strengthens viewpoint-conditioned scene imagination. On seven benchmarks spanning relatively perception-oriented spatial understanding to more challenging tasks requiring multi-image, cross-view and viewpoint-transformation reasoning, SpatialASM yields performance gain on LVLMs of four LVLM backbones in spatial reasoning while retaining their original general vision capabilities. The experimental results demonstrate that our approach improves average accuracy across the seven spatial benchmarks. And the synthesis of ASM trajectories provides a scalable pathway to alleviate the scarcity of spatial Chain-of-Thought (CoT) supervision for eliciting active viewpoint exploration and mental scene simulation.
[CV-15] Dream to Remember: Continual Steering of Generalist Robot Policies with World Models
链接: https://arxiv.org/abs/2610.13816
作者: Bahey Tharwat,Iman Nematollahi,Marvin Alles,Xingyuan Zhang,Akshay L Chandra,Abhinav Valada
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Generalist robot policies are trained with imitation learning and are bounded by the quality and coverage of their demonstrations. Reinforcement learning can improve and extend them, either by fine-tuning the policy weights or by training a small module to steer the input noise of a frozen generative policy. When tasks arrive sequentially, both approaches suffer from catastrophic forgetting. Fine-tuning on a task degrades prior tasks, and steering only shifts forgetting to the shared steering module. We propose Dream to Remember (D2R), which continually steers a frozen generalist policy toward new tasks, while retaining its earlier skills. As the steering module learns a new task, a frozen pretrained world model rehearses prior tasks through imagined rollouts, anchoring the module to its earlier behavior without a replay buffer or new data. When the world model is faithful enough, D2R learns the new task entirely in imagination. Otherwise, it learns the task in the environment while using the world model only to rehearse prior tasks. On CALVIN, D2R improves eight tasks in sequence entirely in imagination, raising average success from 63.7% to 74.8%, while LoRA fine-tuning on the same sequence drops it to 11.7%. With a frozen off-the-shelf generalist policy and world model, \pi_0 and A2World, D2R learns unseen LIBERO-90 tasks in the environment while keeping \pi_0 's performance on the LIBERO suites it was fine-tuned on, even though the world model is not accurate enough for policy optimization. Finally, on a real Franka robot, D2R improves three tasks in sequence entirely in imagination while retaining the earlier improvements.
[CV-16] Spanning Diffusion and Flow-based Posterior Sampling via Exact Gaussian Conditioning
链接: https://arxiv.org/abs/2610.13812
作者: Teo Deveney,Lea Bogensperger,Hok Shing Wong
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Flow-matching and diffusion models are increasingly used as priors for linear inverse problems, however, most methods are bespoke to one class of trajectory prior. Plug-and-play methods have been proposed, however these implicitly decorrelate the guided trajectory, resulting in broad priors that can struggle when data is sparse. This work proposes \beta -Flow: a general plug-and-play method indexed by a correlation parameter \beta that generalises over flow, diffusion, and decorrelated priors, and a confidence parameter \kappa that controls how strongly the path distribution is enforced. Each step requires only one forward evaluation of a denoising network, followed by a Gaussian conditioning step. This step is an exact Kalman update that is not dependent on network gradients. We show that many existing guided samplers can be interpreted as instances or approximations of our method, each implicitly using a different trajectory prior and operator in place of the Kalman gain. From this viewpoint, we provide a qualitative comparison of methods in terms of their implicit biases and assumptions. We demonstrate consistently state-of-the-art level performance across 7 inverse problems over 4 datasets in terms of PSNR and SSIM. Moreover, we demonstrate the utility of this prior control, by showing that confident high correlations (strict priors) work best when observations are less informative, while low correlation is preferred when observations are more informative, reflecting the complementary roles of the prior and likelihood in Bayesian inference.
[CV-17] SimVTA: Simulation-Grounded Video-Trajectory Alignment for Driving World Action Models
链接: https://arxiv.org/abs/2610.13781
作者: Changhui Jing,Haochen Tian,Hongchen Li,Tianyu Li,Caojun Wang,Zihao Zhang,Yanhao Liu,Chengen Xie,Bailin Li,Hao Zhao,Zhenjie Yang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Project page: this https URL
Abstract:Driving world action models (WAMs) learn from paired trajectories and future observations. Post-training with reinforcement learning allows the policy to explore alternative trajectories and improve planning using driving rewards. However, driving logs contain future videos only for the recorded trajectories, leaving these alternatives without corresponding visual supervision. Thus, we introduce SimVTA, a simulation-grounded post-training framework that combines trajectory optimization with video supervision. First, we sample candidate trajectories for each observation and use a real-world simulator (e.g., World Engine) to render future videos for high-reward candidates in real-world scenes reconstructed with 3D Gaussian Splatting (3DGS). This provides trajectory-matched supervision independent of the model’s own predictions. Under a limited rendering budget, we prioritize video supervision for higher-error futures among these rendered candidates. Finally, we optimize trajectory planning with Group Relative Policy Optimization (GRPO) and use a flow-matching loss on the matched videos to update shared representations. At inference time, the model predicts trajectories directly, without simulator calls. On NAVSIM v1, applying SimVTA to a WAM initialization improves PDMS from 86.2 to 91.3 (+5.1). It achieves 88.2 EPDMS on NAVSIM v2 and an average HD-Score of 38.8 in closed-loop evaluation on HUGSIM. Ablations show that updating shared representations with video supervision improves planning, while prioritizing higher-error futures among high-reward trajectories further improves performance.
[CV-18] Detection of extremely rare dead cells in fluorescence microscopy images
链接: https://arxiv.org/abs/2610.13780
作者: Prateek Verma,Benjamin Butter,Jian Zhang,Xintao Wu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Dead cell detection in fluorescence microscopy is essential for phenotypic screening and drug efficacy assessment. However, automated identification remains challenging due to signal variability, optical artifacts, and colocalization ambiguities across multiple channels. Markers that define nuclear boundaries do not neatly coincide spatially or temporally with apoptotic markers. Furthermore, marker accumulation kinetics vary across individual cells and apoptosis stages, making universal thresholds unreliable. We present a systematic comparison of several computational approaches for detecting apoptotic cells in nucleus-stained specimens: (1) heuristic methods using intensity thresholds, distributions, correlations, and domain guidance; (2) classification using numerical features (Logistic Regression, Random Forest, XGBoost and LightGBM) and image features (ResNet-18 and EfficientNet-B0); and (3) anomaly detection, also using numerical features (Isolation Forest, one-class SVM and PCA reconstruction) and image features (convolutional autoencoders and Deep SVDD). Using a dataset of 258 images containing 65,527 cells/nuclei across multiple scenes with 243 manually annotated ground truth dead cells, we evaluate each method on metrics such as PR-AUC, Precision, Recall, F1-score, and macro-F1. Our results indicate that classification using image features (deep learning) and numerical features (traditional) achieved the best performance, with ResNet-18 and XGBoost significantly outperforming manually designed heuristics and anomaly detection methods. Our findings demonstrate that such biomedical problems remain highly challenging to solve even with the state-of-the-art computational and learning techniques. We aim to provide an effective decision-support tool to researchers while tackling such problems either fully-automatically or in a human-in-the-loop setting as an aide to domain scientists.
[CV-19] READ: Reading the Selective Scan for Faithful Video Attribution
链接: https://arxiv.org/abs/2610.13776
作者: Magdalena Trędowicz,Piotr Kubaty,Arkadiusz Lewicki,Jacek Tabor,Łukasz Struski
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Selective state-space models are an efficient approach to long-sequence video modeling. However, their recurrent computation makes it difficult to determine which video tokens drive a prediction. Existing attribution methods often require additional backward passes or repeated model evaluations, making them substantially more expensive than the forward inference they aim to explain. In this work, we introduce READ, a parameter-free attribution method for selective state-space models that unrolls the recurrence at the position read by the classifier. READ traces the contribution accumulated in the recurrent state back to the video tokens that contribute to the final prediction. By anchoring attribution at the classifier’s readout, it produces a single spatiotemporal relevance map from which frame- and region-level relevance can be obtained directly. Despite requiring only one forward pass, READ achieves competitive faithfulness and localisation compared with substantially more expensive attribution methods. Experimental results show that READ avoids the systematic relevance biases of existing methods while recovering meaningful temporal and class-specific structure across datasets and backbones. More broadly, our results show that the recurrence underlying selective state-space models is not only an efficient mechanism for inference, but also a direct source of interpretable evidence for their predictions.
[CV-20] Shortcut Learning in Geospatial Foundation Model Embeddings for Cross-Disaster Damage Assessment NEURIPS
链接: https://arxiv.org/abs/2610.13766
作者: Ali Shibli,Andrea Nascetti,Yifang Ban
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: NeurIPS REO Workshop 2026
Abstract:Geospatial foundation models can support disaster damage assessment, but high accuracy on familiar disasters may hide shortcut learning: prediction from event or scene characteristics rather than evidence that transfers to a new disaster. We study embeddings from TerraMind, Prithvi-EO-2.0, DOFA, and DINOv3 on the multi-disaster datasets xView2 and BRIGHT. Holding out an entire disaster, instead of randomly splitting image tiles, reduces mean balanced accuracy from 0.807 to 0.638 on xView2 and from 0.818 to 0.568 on BRIGHT. Four sets of tests examine what information supports prediction: event and acquisition context, before/after image inputs, building count, and correct image pairing. Pre-event images remain predictive, and a classifier given only the annotated number of buildings reaches balanced accuracy of 0.629 and 0.653. Combining before/after features performs best on average on xView2, but does not improve over pre-only features on BRIGHT. Shuffling image pairs within the same disaster and damage class causes modest losses. Motivated by these findings, we test whether feature transformations learned only from training disasters improve generalization to unseen disasters. These transformations improve performance, with supervised contrastive learning performing best on xView2 and PCA on BRIGHT. Our results highlight the importance of evaluation on unseen domains for assessing model robustness and show that simple feature-level transformations can improve generalization. Code and experiments can be found at this https URL.
[CV-21] Neurons: A Unified Visual-Stream Framework for Image and Video Reconstruction from fMRI with Neural-to-Visual Interpretability
链接: https://arxiv.org/abs/2610.13763
作者: Haonan Wang,Yuchen Wang,Jingyu Lu,Qixiang Zhang,Lehan Wang,Xuanqi Huang,Xiaomeng Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Decoding visual experience from fMRI is important for understanding human perception and developing brain-computer interfaces. Recent generative decoding methods can reconstruct plausible images and videos, but visual plausibility alone does not ensure that the output is faithfully grounded in brain activity. In this work, we propose Neurons++, a visual-stream fMRI reconstruction framework for both static image and dynamic video reconstruction. Compared with our conference version Neurons, Neurons++ extends the paradigm from video-only reconstruction to visual-stream reconstruction for both images and videos, and replaces parallel task conditioning with serial cortex-inspired decoding. The model first uses image-fMRI pretraining to obtain a stable spatial-semantic initialization, and then performs subject-specific fine-tuning for image and video reconstruction separately. The serial design organizes fMRI-derived representations into explicit spatial, semantic, language-level, and temporal cues. Extensive experiments show that Neurons++ achieves state-of-the-art video reconstruction and competitive image reconstruction across standard benchmarks. Beyond reconstruction fidelity, neural-to-visual analyses indicate that Neurons++ exhibits qualitative directional controllability under neural perturbation, that its fMRI encoder read-out is sensitive to stimulus-relevant cortical features, and that it supports ROI-guided semantic modulation. Code and model weights are available at: this https URL.
[CV-22] Gaussian Splatting with Reflections Guided by What is Seen ICIP2026
链接: https://arxiv.org/abs/2610.13757
作者: Yiming Liang,Tianyu Xiao,Hiroshi Ishikawa
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to IEEE ICIP 2026
Abstract:While novel view synthesis methods like Neural Radiance Fields (NeRF) and 3D Gaussian Splatting (3DGS) have shown impressive performance on common scenes, they often struggle with capturing view-dependent specular effects, particularly near-field reflections. Existing methods utilize environment maps, which only represent lights from infinity, or environment Gaussians, which rely solely on indirect supervision from reflections, are insufficient for accurately modeling such effects. Here, we propose a framework based on 2D Gaussian Splatting (2DGS) that leverages directly observable environment information in input images. Our approach also integrates a hybrid reflection appearance representation and view-dependent specular modeling. Experiments on public benchmarks and a newly curated near-field reflection dataset demonstrate that our method achieves superior rendering quality and geometric accuracy.
[CV-23] KVeil: First-Place Solution to ECCV 2026 LifeGenIP Challenge on Unlearnable Videos ECCV2026
链接: https://arxiv.org/abs/2610.13733
作者: Boheng Li,Yueming Xing,Yiming Li,Jie Zhang,Han Qiu,Tianwei Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Technical report for the winning solution (1st place, both phases) of the ECCV 2026 LifeGenIP Challenge on Unlearnable Videos against Diffusion-based Customization
Abstract:The rapid development of personalized video generation has raised serious concerns over identity privacy, as a few facial videos of a person now suffice to reproduce their identity in synthetic videos. This report presents the first-place solutions to both phases of the ECCV 2026 LifeGenIP Challenge on Unlearnable Videos, which aims to protect facial videos from unauthorized customization under a limited and imperceptible perturbation budget. For Phase 1, we introduce Reference Capacity Collapse, a pair of complementary losses that degrade the information carried by the reference condition while keeping subsequent video representations dependent on it, together with a Motion-Guided EOT mechanism that improves robustness across unknown inference conditions. Phase 2 further considers tuning-based customization and unseen generative models. To address both threats within a single perturbation, we design a two-layer framework that protects the facial and background regions separately, constructing structure-aligned perturbations from a synthetic target identity in the former and strengthening the white-box disruption of Phase 1 in the latter. Our method achieves nearly perfect protection under white-box reference-based customization, and remains effective under other customization paradigms, various models, and temporal attacks. Both solutions are built upon our recent work LETHE. We hope our solutions can inspire future work on protecting facial videos against unauthorized customization. Our code is available at this https URL.
[CV-24] LAPT-Scale: Scaling Embodied Policies with Latent Action Pre-Training on Human Videos
链接: https://arxiv.org/abs/2610.13732
作者: Zhiyuan Xiang,Peidong Liu,Mingyang Li,Jiawei Li,Wenhow Li,Wenbo Ding,Xiang Deng
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注: Accepted at CoRL 2026; 24 pages including appendix
Abstract:Scaling generalist robotic policies is limited by the high cost of collecting embodied interaction data. Large-scale egocentric human videos offer a rich alternative, but they lack robot action labels, and existing action annotation methods are often noisy under real-world visual complexity and diverse manipulation dynamics. We introduce LAPT-Scale, a scalable latent action pre-training paradigm with two components: LAPT-Scale-LAM learns continuous latent actions by explaining frame-to-frame visual transitions in human videos and uses them as human-derived supervision, while LAPT-Scale-Policy trains a VLA policy through human-video latent-action pre-training, target-robot embodiment alignment, and task-specific post-training. Unlike prior vector-quantized LAMs, LAPT-Scale-LAM uses a continuous latent space to preserve fine-grained motion and interaction dynamics. We further combine perceptual, semantic, and optical-flow alignment signals to improve transition-level supervision beyond pixel reconstruction. Trained on 23.3K hours of egocentric video, LAPT-Scale-LAM provides implicit action supervision for policy pre-training, yielding consistent scaling gains and improving real-robot success from 63.3% to 85.0% as annotated human video scales from 1K to 5K hours. The learned policy also generalizes to unseen visual conditions.
[CV-25] State-Isolated Vision Mamba via Update-Tendency Routing for Underwater Image Enhancement
链接: https://arxiv.org/abs/2610.13720
作者: Yan Luo,Laibin Chang,Zefan Feng,Yi’ang Chen,Kui Jiang,Zhengguo Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Vision Mamba has recently emerged as an efficient alternative to convolutional and Transformer-based architectures by modeling long-range spatial dependencies through recurrent state evolution. Existing studies primarily improve token serialization, scanning strategies, or expert routing, yet largely overlook a state level question question: how should recurrent states be organized for spatially heterogeneous visual restoration? In this paper, we show that forcing tokens with heterogeneous update behaviors to recurrently modify a shared hidden state leads to persistent cross-content interference, which we term \textbfState Contention. We further argue that effective recurrent modeling should organize state evolution according to token compatibility rather than token ordering. Based on this observation, we introduce \textbfState Isolation, a new recurrent state organization principle for Vision Mamba,tokens with compatible state-update tendencies evolve within independent recurrent state streams. To instantiate this principle, we propose \textbfIsoMamba, a \Delta -guided architecture that constructs model-intrinsic update representations, discovers update-compatible token groups through label-free clustering, and routes them to isolated Mamba experts following a \textbfcluster–route–isolate paradigm. In addition, we develop a dynamic channel-wise reweighting objective to compensate for wavelength-dependent reconstruction difficulty in underwater images. Extensive experiments demonstrate that IsoMamba consistently achieves state-of-the-art performance on multiple underwater image enhancement benchmarks while providing cleaner hidden state responses, validating the effectiveness of state isolated recurrent modeling.
[CV-26] GLIMPSE: Global-Local Indexing with Multi-Precision Spectral Encoding for Explorable Video World Models
链接: https://arxiv.org/abs/2610.13706
作者: Zhufeng Xu,Henglei Lv,Bailin Deng,Yikang Ding,Xiaoqiang Liu,Guoxin Zhang,Hongbo Fu,Lin Gao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 21 pages, 8 figures
Abstract:A camera-controlled video world model must keep a scene consistent when the camera returns to it. Memories that render stored features into the target frame can turn depth and pose errors into ghosting or duplicated structure. Positional transport avoids that resampling by relocating a historical patch’s address rather than its content, but assigns full positional precision even to inaccurate projections. We present GLIMPSE, a global-local memory interface with band-wise multi-precision coordinates and geometry-conditioned spectral attenuation to reduce sensitivity to inaccurate projected addresses. Local patch memory supplies view-specific appearance, while recurrent global memory provides scene context. Footprint-guided retrieval selects historical patches under a fixed local read budget. Under matched retrieval and read budgets, GLIMPSE improves geometric correspondence and photometric consistency over deterministic positional transport.
[CV-27] Improving Semantic Coverag e in AI Test Evaluation through Generative Augmentation
链接: https://arxiv.org/abs/2610.13697
作者: Connor Hashemi,Bharadwaj Ravichandran,Connor Anderson,Shitij Govil,Brandon RichardWebster,Brian Hu,Keith Fieldhouse
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 21 pages total, previously published at Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series, Volume 14046
Abstract:In test and evaluation (TE) of AI models, evaluators typically have access only to a held-out test dataset and no knowledge of the training data or its semantic composition. If critical input conditions—such as time-of-day, weather, or scene location—are underrepresented in this test dataset, TE results can be misleadingly due to this semantic coverage gap. We propose a three-stage generative AI pipeline to detect and fill such semantic gaps without requiring ground-truth labels of these semantics. First, vision-language models (VLMs) perform zero-shot binary labeling of semantic factors, and an embedding-space clustering step identifies which semantics most affect downstream model behavior. Second, diffusion-based image-to-image models transform existing covered images into the underrepresented semantic domain, preserving scene content while augmenting high-level appearance. Third, statistical analysis of the augmented image embeddings verifies that the synthetic imagery improves dataset coverage before it is incorporated. Crucially, the synthetic data is used only to enrich the test set and no model retraining is performed for TE. We validate the full pipeline on both image classification and object detection under day/night semantic gaps, showing that the augmented test datasets better distinguish models with and without exposure to the missing semantic, thereby yielding TE conclusions that more closely match those of an ideal, fully covered dataset. Code available at this https URL
[CV-28] X-AVDD: Cross-Attentive Audio-Visual Dataset Distillation NEURIPS2026
链接: https://arxiv.org/abs/2610.13687
作者: Saumyaranjan Mohanty,Aravind Reddy,Konda Reddy Mopuri
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Sound (cs.SD)
备注: Accepted at NeurIPS 2026. Camera-ready version forthcoming. 17 pages, 6 figures, 16 tables
Abstract:Audio-visual dataset distillation aims to synthesize a small dataset from a large paired audio-visual dataset, while nearly preserving the training utility for neural networks. Existing approaches such as DM and AVDD face two critical limitations: 1) they are memory-intensive, making them difficult to scale to complex architectures and higher samples-per-class (SPC) settings, and 2) they often fail to preserve strong cross-modal semantic correspondence. To tackle these issues, we propose X-AVDD, a cross-attention-based distillation method that explicitly captures inter-modal relationships during synthesis. By decoupling cross-modal alignment from joint optimization, X-AVDD is substantially more memory-efficient, reducing end-to-end synthesis cost by \sim 8\times GPU-hours, while producing highly aligned synthetic data. Empirically, X-AVDD significantly outperforms other audio-visual distillation methods. On VGGSound, an audio-visual dataset of short YouTube clips, X-AVDD improves top-1 test accuracy from 8.2%\rightarrow24.0% at SPC= 10 and 9.8%\rightarrow26.5% at SPC= 20 . Furthermore, X-AVDD improves cross-architecture generalization (e.g., 25.5%\rightarrow35.3% for a ViT target on AVE dataset at SPC =50 ) and successfully scales to complex architectures such as AudioCLIP, achieving 62.3% accuracy using only 5.65% of the full dataset, against the full dataset accuracy of 72.4% while completing in 9\times lower training time compared to the full dataset.
[CV-29] PhysForge: Material-Controllable 3D Reconstruction with Separable Components
链接: https://arxiv.org/abs/2610.13681
作者: Yuchen Wang,Yanqi Bao,Zheng Gu,Zhengqing Chen,Jieqi Shi,Jing Huo
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Recent advances in physical 3D generation have enabled visually faithful assets with simulatable mechanical behavior. However, existing methods provide limited control over material behavior beyond appearance-based inference and struggle to estimate physical properties from complex interactions between objects and semantic parts. Therefore, we present PhysForge, a Video Diffusion Model (VDM)-based framework for addressing these challenges, comprising two complementary modules for material-controllable physical fitting and componentlevel interaction modeling. The first, PhysFit, leverages material-conditioned VDM dynamics as references for physical-property fitting, introducing windowed fitting to focus on material-revealing interactions and Hallucinated Forcing to disentangle nonphysical motion hallucinated by the VDM from material responses. The second, PhysComp decomposes complex interactions into individual objects and semantic components, enabling their physical parameters to be optimized independently and flexibly composed for joint simulation. Experiments on PhysAssets and Google Scanned Objects demonstrate that, compared with existing methods, PhysForge provides stronger control over material-dependent physical responses while supporting component-level physical modeling for complex interactions. It achieves the best CLIP and physical controllability scores on both common and uncommon materials, with qualitative comparisons, component-level ablations, and a user study further supporting these improvements. Our project page is available at this https URL .
[CV-30] Benchmarking Answer-Grounding Consistency in Remote Sensing Visual Question Answering ICASSP2027
链接: https://arxiv.org/abs/2610.13636
作者: Ping Guo,Zhiqi Huang,Xinran Li,Linkun Yu,Jingyin Pei,Kamata Seiichiro
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Under review at ICASSP 2027. Code available at this https URL
Abstract:In grounded remote sensing visual question answering, a model produces a textual answer and identifies relevant objects in the image as grounding evidence. Existing evaluations measure answer correctness and localization quality, but do not directly assess answer-grounding consistency. We propose the Answer-Evidence Support Protocol (AESP) to assess this consistency through evidence support: whether the grounding evidence supports the model’s own answer. AESP applies task-specific rules to existence, counting, and comparison questions. We further construct the Grounded Remote Sensing Visual Question Answering (G-RSVQA) benchmark, containing 15,027 samples with questions, reference answers, and all related object-level annotations. Experiments on seven grounded vision–language models reveal failures of evidence support across all three question types. Up to 50.82% of correct answers in the evidence evaluation subset are not supported by the provided grounding evidence.
[CV-31] CUBE: Class-conditioned Unknown Boundary Evidence for Open-Set Insect Species Recognition
链接: https://arxiv.org/abs/2610.13610
作者: Hao Tan,Qimin Zhang,Zhe Xiao,Zekai Zuo,Wanting Liu,Jinghui Qin
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 5 pages, 1 figure, 3 tables
Abstract:Open-set insect species recognition faces significant challenges when deployed in real-world biodiversity scenarios, particularly when encountering unknown species that are visually close to known training classes. Unlike generic out-of-distribution samples, fine-grained unknown insects are often not visually anomalous. They instead tend to appear near the decision boundary of specific known species, leading to unreliable closed-set predictions. To address these challenges, we propose \textbfClass-conditioned Unknown Boundary Evidence (CUBE), a novel evidence-based framework that models unknownness around each known species rather than as a single global unknown class. Our key idea is to evaluate a test sample relative to the known species it most closely resembles, enabling local rejection for visually confusable unknown insects. CUBE learns class-conditioned boundary evidence from auxiliary species, preserves auxiliary species as shadow references during inference, and incorporates taxonomic candidate calibration to verify biological plausibility. When ecological metadata is available, we further introduce CUBE-E, which adds a lightweight location-consistency term without modifying the visual backbone. Experiments on the Open-Insect C-America benchmark show that CUBE achieves superior performance, outperforming state-of-the-art baselines with 95.8%, 98.7%, and 99.1% AUROC on local, non-local, and non-moth unknown splits, respectively, while maintaining 94.9% closed-set accuracy. With ecological metadata, CUBE-E further improves the results to 96.0%, 99.7%, and 99.5% AUROC with 95.2% closed-set accuracy.
[CV-32] hyroid Nodule Segmentation in Ultrasound Images with Conformal Uncertainty Estimation
链接: https://arxiv.org/abs/2610.13604
作者: Francesco Teodori,Pierpaolo Brutti,Umberto Ferraro Petrillo
类目: Computer Vision and Pattern Recognition (cs.CV); Applications (stat.AP)
备注: Presented at the CIBB 2026 conference
Abstract:Thyroid nodules affect a large proportion of the general population. Although most are benign, a non-negligible fraction is malignant. Ultrasound imaging is the primary diagnostic modality, and accurate nodule segmentation is a prerequisite for CAD systems to classify malignancy and assess metastatic risk.\ In this work, we propose a thyroid nodule segmentation framework that integrates a DeepLabV3+, channel-attention modules and post-hoc conformal prediction, providing both accurate mask and pixel-level uncertainty estimates. We address thyroid ultrasound nodule segmentation as the first stage of a pipeline that also includes malignancy classification and metastatic risk prediction. We adopt DeepLabV3+, whose Atrous Spatial Pyramid Pooling (ASPP) captures multi-scale context, with an EfficientNet-B5 backbone for its accuracy-efficiency trade-off. Additionally, we test three channel-attention modules: Squeeze-and-Excitation, CBAM and Grouped Channel Attention (GCA), paired with two loss formulations (Dice-BCE and Boundary).\ Since binary masks do not indicate prediction confidence, we wrap the trained model with a split conformal prediction layer that produces pixel-level uncertainty maps with statistical coverage guarantees.\ We evaluate all configurations on the TN3K public benchmark using a fixed split and directly compare them with state-of-the-art methods. The plain backbone already improves upon previously reported results, with CBAM + Dice-BCE emerging as the best overall configuration.
[CV-33] RARA: Robust Policy Fine-Tuning through Retrieval-Anchored Representation Alignment for Robotic Manipulation
链接: https://arxiv.org/abs/2610.13578
作者: Xuhui Kang,Sung-Wook Lee,Yan Zhuang,Tianle Zhong,Yen-Ling Kuo
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 21 pages, 11 figures, 7 tables
Abstract:Pre-trained robot policies, such as Vision-Language-Action (VLA) models, provide a strong foundation for generalist robotic manipulation, but adapting them to new tasks with only a few demonstrations remains challenging. Directly fine-tuning a pre-trained policy often achieves strong in-distribution performance, yet it can distort the representations learned during pre-training and weaken the model’s generalization ability under out-of-distribution shifts. We propose Retrieval-Anchored Representation Alignment (RARA), a two-stage adaptation method, to address this issue. First, RARA retrieves representation features from pretraining with similar task intent and motion, and aligns the policy’s representations of the target demonstrations with the pre-trained representations of the retrieved demonstrations. Second, RARA fine-tunes the policy on the target demonstrations while limiting how much its representations of the retrieved demonstrations change during fine-tuning. By reducing the representation mismatch before action learning and preserving pre-trained knowledge during adaptation, RARA limits unnecessary representation drift during fine-tuning. Experiments with Diffusion Policy and GR00T on 13 tasks in RoboTwin, RoboCasa, and on a real robot show that RARA improves the average success of fine-tuning by 9.5 points in-distribution and 13.6 points out-of-distribution, and outperforms all compared baselines. Project page: this https URL
[CV-34] What We Talk About When We Talk About Emotion Editing
链接: https://arxiv.org/abs/2610.13558
作者: Xingzu Zhan,Lin Gu,Ruogu Fang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Emotional image editing aims to change the emotion a scene conveys while preserving its essential content. Because the same scene can support different emotional interpretations, achieving an emotional goal requires visual changes grounded in the source context. Motivated by the Component Process Model, which links emotional responses to event appraisal, we investigate neural representations as a reference for these editing decisions. Using TRIBE v2, an fMRI encoding model, we analyze 400 source-target pairs across eight emotion categories. Hidden states from EmoEdit, EmoEditor, and AffectDelta correspond more strongly to predicted target-image responses in visual regions than in affect-related regions. This imbalance motivates ROI-ReFT, which combines source visual responses as a content reference with a predicted affective response change as an editing direction. Two interacting branches use both conditions to guide a frozen editor throughout generation. Predicted responses of the generated image supervise affective change and constrain visual drift. On a post hoc selected subset of 400 editing requests, ROI-ReFT achieves 91.75% target-emotion accuracy and 83.25% joint success, with the same output both matching the target emotion and reaching source-output DINO-I of at least 0.80. Our code and dataset will be publicly released.
[CV-35] Learning Holistic Scene Layout against View Shifts in Cross-View Geo-Localization
链接: https://arxiv.org/abs/2610.13553
作者: Chao Yang,Songlian Li,Zhigang Tu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Cross-view geo-localization remains challenging due to drastic appearance variations and geometric distortions caused by viewpoint changes. Existing methods primarily rely on discriminative feature learning or explicit geometric alignment, yet often overlook an important observation: humans tend to match scenes by integrating the spatial context of multiple landmarks rather than relying solely on isolated local visual cues. Inspired by this, we propose a Spatial Context Modeling (SCM) module, which traverses feature maps along four orthogonal directions and models interactions among the resulting directional representations at each spatial position. By aggregating complementary directional observations, SCM constructs richer scene layout representations. Since reliable spatial context depends on robust visual features, we introduce a High-Frequency Information Guidance (HFIG) module that extracts stable structural cues from the frequency domain. By emphasizing edges and contours that are less sensitive to appearance variations, HFIG encourages the model to learn more robust representations. Extensive experiments demonstrate that our method achieves competitive performance on standard cross-view geo-localization benchmarks while exhibiting strong robustness under more challenging scenarios with unknown orientations and limited fields of view (FoVs).
[CV-36] ELMA: Benchmarking Anaphoric Compositions for Long-Term Text-to-Motion Generation NEURIPS2026
链接: https://arxiv.org/abs/2610.13549
作者: Shun Kato,Dixin Yang,Kotaro Amaya,Yuiga Wada,Kazumi Fukuda,Takashi Shibuya,Yuki Mitsufuji,Mariko Isogawa
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at NeurIPS 2026 Evaluations Datasets Track
Abstract:Text-guided long-term human motion generation is essential for applications such as continuously operating digital avatars. Despite recent progress on short clips, existing models struggle with multi-segment instructions that involve anaphora, where constraints established in earlier segments must be preserved over time. In this paper, we introduce a novel task of long-term motion generation from such anaphoric compositions. To mitigate this, we present ELMA, an episodic long-term motion dataset with dense segment-level annotations that preserve cross-segment dependencies. Built via a fully automated collection and filtering pipeline, ELMA extracts high-quality, continuous 30-second clips from in-the-wild videos, capturing the episodic narratives necessary for long-range state modeling. Leveraging this dataset, we fine-tune state-of-the-art motion generation models to incorporate long-range context. Extensive experiments reveal fundamental shortcomings in current models when handling context-dependent instructions. We demonstrate that ELMA enables significant improvements in both global physical realism and semantic alignment, setting a robust new baseline for long-term motion synthesis.
[CV-37] Auditing VLM Benchmarks from Existing Evaluation Runs NEURIPS2026
链接: https://arxiv.org/abs/2610.13548
作者: Denis Degtiarev,Anna Gromova,Sergey Katkov,Artem Mikhailin,Safina Mukhamedshina,Albert Nasybullin,Karina Shaikhutdinova,Artem Tuzov
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 11 pages, 5 figures. Accepted at the NeurIPS 2026 Workshop TAE (Trust-AI-Eval): Can We Trust AI Evaluation? (non-archival). Code and artifacts: this https URL
Abstract:Every evaluation run of a vision-language model (VLM) already produces per-question artifacts (predictions, judged correctness, metadata) that leaderboards reduce to a single score and then discard. We reuse those artifacts to audit the benchmark itself, and add an audit layer to VLMEvalKit: six detectors that run as post-processing over saved outputs, plus one additional text-only rerun with visual inputs removed, emitting a per-question report. The layer reports per-question findings together with aggregate audit statistics; for the headline quantities, it attaches permutation-null excess where applicable, interval estimates for proportions, and sensitivity to the model pool. Auditing MMStar, a benchmark curated specifically so that the image is indispensable, with three models, we find zero aggregate accuracy gain from the image on 20.2% of its questions. An item-matched permutation null accounts for 17.0%, leaving a +3.2 pp excess (corrected permutation p = 0.001). This excess is concentrated in the mathematics and science categories and is absent from coarse perception, a localization consistent with knowledge substituting for visual evidence; confirming that mechanism would require item-level review. A second detector flags 134 questions on which every model that answered in parseable form picked the same non-gold option, and these candidates peak in the perception categories, whereas the zero-gain excess is largest in mathematics and science technology. Replacing the LLM judge with exact string matching changes no conclusion, and every scoring discrepancy between the two traces to one model whose free-form answers a parser cannot read. On a binary yes/no benchmark the detectors measurably fall out of calibration, a scope boundary that we measure and report. The audit layer, the prediction artifacts and the generated reports accompany this submission.
[CV-38] MOSAIC: Multi-Scale Object-Centric Slot Adaptation with Image-Guided Prototype Conditioning for Remote Sensing Image Super-Resolution
链接: https://arxiv.org/abs/2610.13547
作者: Liuqian Wang,Hanyu Xie,Rongzhen Zhao,Qi Ming,Chunjie Ma,Wentao Chao,Yufei Gao,Chengming Liu,Lei Shi
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Pretrained diffusion Transformers provide powerful generative priors for image restoration, yet adapting them to structure-sensitive tasks remains challenging. Existing methods mainly rely on dense low-resolution features as conditions, which often entangle salient objects with dominant backgrounds and provide limited abstraction for recurring structures across scales and samples. We propose MOSAIC, an object-centric representation learning framework that learns compact structural conditions for generative model adaptation. MOSAIC organizes degraded observations into structural slots that capture complementary object-level and layout-level evidence, integrates them across resolutions, and retrieves recurring priors from a shared prototype memory to complement incomplete image-specific information. The resulting representations are injected into selected layers of a frozen diffusion Transformer through lightweight residual modulation, preserving its pretrained generative prior. We instantiate MOSAIC for remote sensing image super-resolution, where small objects, repetitive structures, and large-scale variation provide a challenging testbed. Experiments on UCMerced, AID, and RSSCN7 show consistent PSNR improvements across \times 2 and \times 4 settings and favorable LPIPS results at \times 4 . Qualitative results further demonstrate improved preservation of small objects, structural boundaries, and repetitive spatial patterns.
[CV-39] Efficient Confidence-Aware Densification for 3DGS
链接: https://arxiv.org/abs/2610.13541
作者: Manuel Hofer,Thomas Köhler,Felix Windisch,Bernhard Kerbl,Markus Steinberger,Lukas Radl
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注:
Abstract:3DGS-MCMC has replaced the gradient-driven density control of 3D Gaussian Splatting with opacity-based sampling and relocation, and is now the de facto standard for prior-free densification under a fixed primitive budget. Because opacity stays high where the scene is already well reconstructed, this sampling sends most new primitives to the foreground and leaves the background under-reconstructed. At low budgets, prior-based methods such as ConeGS and EDGS outperform it, at the cost of a pre-trained radiance field or dense image matches and a separate initialization stage. We argue for a comeback of error-driven densification within the fixed-budget MCMC framework. Our confidence-aware densification keeps the fixed budget and gradual growth of 3DGS-MCMC, but places primitives by the image error instead of the opacity. New primitives are drawn mostly where screen-space gradients are large. We favor primitives with a low learned confidence, which marks regions the reconstruction still explains poorly, and relocate the primitives that contribute least to the rendered images to these places. Averaged over 24 scenes, our method outperforms 3DGS-MCMC in PSNR, SSIM and LPIPS at every budget from 100k to 2M primitives. At 100k, without a prior or an initialization stage, it recovers 0.84dB of the 1.05dB PSNR by which ConeGS leads 3DGS-MCMC, and from 500k on, it has the highest PSNR and SSIM of all fixed-budget methods we compare with, including ConeGS and EDGS. While inherently prior-free, our densification can also exploit priors: from the ConeGS or EDGS initialization, it matches ConeGS in PSNR and SSIM at 100k and is best in all three metrics at 500k.
[CV-40] Knowing Whether Not Just Where: Anchor-Probing Distillation for Open-Set Remote Sensing Visual Grounding
链接: https://arxiv.org/abs/2610.13535
作者: Zhihao Chang,Lei Zhai,Shuyuan Yang,Zhixi Feng
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Open-set visual grounding in remote sensing requires models to determine not only where a queried object is located, but also whether the image provides sufficient evidence for the query at all. Existing closed-set grounding models, however, tend to return plausible boxes even for absent objects, blurring localization confidence with genuine Visual Support. We introduce AnchorProbe-Distill (APD), a teacher-student framework that recasts open-set grounding as Visual Support learning. APD builds on the insight that supported queries should induce coherent spatial anchors, whereas unsupported or mismatched queries tend to produce unstable or misleading localization patterns. APD-T therefore uses the Original Query as a Reference Anchor to interpret query perturbations: Semantic-Preserving Queries retain the annotated target, Near-Category Ambiguous Queries are resolved according to whether they form a reliable alternative anchor or collapse onto the Reference Anchor, and Far-Category Counterfactual Queries provide rejection supervision. This reference-aware reasoning is distilled into APD-S, enabling unified localization and rejection from a single image–query pair. Experiments show that APD enables the resulting model to reject absent targets while also improving its localization of present targets.
[CV-41] Beyond Successful Robot Demonstrations: Learning from Human Interactions and Modeling Failure Dynamics
链接: https://arxiv.org/abs/2610.13522
作者: Peiyan Tu,Cong Wang,Hanxin Zhu,Xin Jin,Zhibo Chen
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Action-conditioned world models offer a promising foundation for generalist robotic intelligence by predicting the consequences of actions. However, existing robotic datasets provide limited coverage of the diverse interaction dynamics required for generalizable world modeling. Large-scale egocentric human videos offer complementary interaction experience, yet the embodiment gap between human hands and robotic manipulators hinders effective cross-embodiment learning. Meanwhile, the predominance of successful demonstrations leaves failure dynamics substantially underrepresented, limiting the ability of world models to anticipate unsuccessful executions. To address these limitations, we introduce HF-WM, an action-conditioned world model that combines Human interaction learning with Failure-aware post-training. To bridge the embodiment gap, we develop a dual-branch framework that couples video generation with auxiliary pointflow prediction, using stabilized pointflow as a unified motion representation across human and robot interactions while suppressing egocentric camera motion. To improve failure modeling, we further perform Group Relative Policy Optimization (GRPO) post-training on perturbed actions derived from successful demonstrations, guided by action alignment and physical plausibility rewards, enabling the model to learn plausible failure dynamics without paired ground-truth videos. Extensive experiments demonstrate that HF-WM achieves state-of-the-art performance in action-conditioned video generation and exhibits strong utility for policy evaluation in downstream robotic tasks.
[CV-42] SplatQ: Interaction-Aware Pruning of 3D Gaussian Splatting via Quadratic Selection ICLR2027
链接: https://arxiv.org/abs/2610.13503
作者: Hongbin Ye,Haixu Liu,Shenwei Kang,Wenxiu Wei,Tinglan Wang,Hongdong Zhu,Fan Tang,Qi Gao,Yin Ma,Kai Wen,Hai Wei,Nuo Qian,Wei-Shi Zheng,Shaobo Chen,Fa-Ting Hong,Jingke Meng
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR)
备注: Under review at ICLR 2027 (main paper 9 pages, 5 figures, 2 tables; appendix included)
Abstract:Existing 3D Gaussian Splatting (3DGS) pruning methods primarily rely on global Top-K selection based on independent importance scores, lacking regional budget control and ignoring joint deletion effects. Consequently, they cannot ensure balanced reconstruction quality across a scene. We propose SplatQ, a combinatorial pruning algorithm that coordinates regional budget allocation and joint Gaussian selection under a fixed budget. SplatQ partitions Gaussians by spatial proximity and appearance similarity into size-limited blocks, decomposing global selection into subproblems of a specific size. It then smooths importance-based block retention quotas to prevent excessive budget concentration. Finally, it constructs a quadratic approximation of joint deletion effects using the responses of representative pixel colors to changes in Gaussian opacity. Individual responses, pairwise interactions, and quota penalties are incorporated into a quadratic unconstrained binary optimization (QUBO) objective, solved using simulated annealing (SA) or a coherent Ising machine (CIM) to jointly select Gaussians. Experiments on 5 benchmarks demonstrate that SplatQ outperforms state-of-the-art pruning methods in aggregate reconstruction quality, spatial quality balance, and rendering speed. Ablations confirm that budget smoothing improves local detail reconstruction, while interaction modeling improves Gaussian selection quality under a fixed budget.
[CV-43] Stride: Scale-Aware Multi-Agent Evolutionary Refinement for Infographic Generation
链接: https://arxiv.org/abs/2610.13502
作者: Yan Zhou,Yang Yang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Infographic generation challenges text-to-image models because a single image must satisfy numerous visual, textual, and semantic constraints. Iterative agentic refinement with a multimodal verifier is a natural remedy, but existing methods face a scale mismatch: local edits cannot correct global composition errors, while full regeneration may destroy already-correct regions. We introduce Stride, a constraint-grounded multi-agent framework that treats refinement over any frozen generator as a history-aware evolution strategy. Stride separates constraint evaluation - whether each requirement is satisfied - from visual grounding - where and how it is violated. It then routes global revisions to a composer subagent and local corrections to a retoucher subagent. Each subagent conducts internal planning and generates multiple candidates, while Stride accepts a candidate only when it improves the verifier score, reducing regression across iterations. Because stochastic generators and imperfect verifiers make any single step unreliable, it is this combination of scale-aware routing, per-step redundancy, and monotonic acceptance that yields stable improvement across iterations. With fully open-weight generator-verifier systems, Stride outperforms proprietary systems including Nano-Banana-2.0 and Seedream-5.0-Pro on BizGenEval, matches GPT-Image-2.0 and surpasses Seedream-5.0-Pro on IGenBench, and achieves a new state-of-the-art score on WISE, while substantially outperforming existing agentic methods across all evaluated benchmarks.
[CV-44] GraftOOD: Grafting Out-of-Distribution Exemplars into Advantage-Weighted Rectification for Video Reward Optimization
链接: https://arxiv.org/abs/2610.13470
作者: Zheming Fu,Ruizhe He,Wenbin Ning,Xiaoxiao Ma,Xuan Yang,Lianrui Mu,Haoyang Huang,Chang Liu,Lei Wang,Siming Fu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Video reward optimization can increase proxy rewards while reducing video dynamics, a mismatch we identify as \emphmotion collapse, including under a video-level motion-quality reward. We propose \textbfGraftOOD, which replaces part of the online rollouts in selected prompt groups with out-of-distribution video exemplars. A shared velocity-regression objective combines group-relative reward rectification with sequence-level exemplar supervision, requiring neither exemplar generation trajectories nor an additional supervised-loss coefficient. We characterize its pointwise optimal field as a source-posterior-weighted combination of the two source-specific target fields. We construct \textbfGraftSet-Video, containing 9,588 format-matched exemplars for 2,397 prompts, to supply external supervision. On Wan2.1-1.3B, GraftOOD raises Dynamic Degree from 4.86 to 44.41 relative to reward-only FlowAWR, while HPSv3 decreases from 8.10 to 7.32 and VisionReward remains close. At the main setting, GraftOOD leads nine of ten metrics among three exemplar-augmented methods. Ablations of exemplar frequency and within-group count reveal dynamics–reward trade-offs rather than uniform gains from increasing exemplar usage. These results support external exemplar supervision as a complement to scalar reward feedback, without equating higher measured dynamics with coherent, visually plausible motion in the generated videos. Code is available at \hrefthis https URLGraftOOD.
[CV-45] A Real-World CAD Segmentation Benchmark: Comparing Rule-Based and Learning-Based Approaches through Hole Detection
链接: https://arxiv.org/abs/2610.13466
作者: Kai Schütte,Edgar Heinert,Matthias Rottmann
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:CAD segmentation datasets are predominantly synthetic or automatically labelled, leaving it unclear how well existing methods transfer to real-world engineering tasks. Fastener-relevant hole detection represents one such task, requiring human annotation and exhibiting greater geometric complexity than commonly used benchmarks. We address this gap through three main contributions. First, we develop two task-specific rule-based methods, one graph-wire-search and one multi-view based, and complement them with a human-annotated benchmark dataset derived from engineering CAD data that also enables training of UV-Net and AAGNet, representative learning-based approaches for B-Rep segmentation. Second, we conduct an extensive experimental study including parameter optimisation, evaluation on our benchmark dataset, cross-domain generalisation on a synthetic dataset, and an assessment of the feasibility of the approaches at varying dataset sizes and IoU thresholds. Third, we provide evidence-based insights into the strengths and limitations of different approaches: rule-based methods generalise well without training data, with the graph-wire-search method favouring recall and the multi-view method favouring precision, whereas learning-based methods achieve strong performance with sufficient annotations but exhibit reduced robustness under domain shift. These findings highlight trade-offs between data requirements, and robustness, and provide guidance not only for hole detection, but more broadly for real-world CAD segmentation tasks.
[CV-46] When MLLM s miss what humans read: diagnosing and learning to read squint text
链接: https://arxiv.org/abs/2610.13465
作者: Chen Peng,Shan Huang,Jianbo Huang,Linrui Qin,Qibo Sun,Mengwei Xu
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Multimodal LLMs can fail to read text embedded in an image’s coarse structure (text a human recovers by squinting) and report that no text is present. We name this class Squint Text and study it as a recognition deficiency, motivated by cases from a production moderation pipeline. We introduce SquintBench, comprising 1076 production-derived moderation images, and SquintCtrl, a controlled synthetic suite for mechanism diagnosis. Frozen-weight analysis shows that hidden text leaves a coarse signal while glyph identity is weakly represented; identity becomes substantially more accessible when the correct spatial regions are supplied, implicating spatial selection as a major bottleneck. Suppressing high-frequency content also improves reading at a fixed visual-token budget, while visual token count may also contribute. These findings motivate Squint OPSD: a frozen teacher receives a downscaled view and the ground-truth transcription as privileged context, and its token-level distributions supervise a student along on-policy trajectories. At inference, the student reads the original image alone. Squint OPSD reaches 88.61 ANLS on SquintBench, versus 26.50 for the unadapted backbone, 24.44 for the best general-purpose model on the original view, and 68.60 at best for an off-the-shelf model under a downscaled view. These results substantially narrow the gap between available visual evidence and its generated read-out without auxiliary views at inference.
[CV-47] SADL: A Size-Adaptive Decision Layer for Chronic Stroke Lesion Segmentation in ISLES 2026
链接: https://arxiv.org/abs/2610.13422
作者: Marek Wodzinski,Gniewosz Drwiega,Wojciech Szymanski
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: ISLES 2026 Challenge Contribution
Abstract:Chronic ischemic stroke lesions are difficult to segment on T1-weighted MRI. Their appearance overlaps with healthy tissue, and their volumes span four orders of magnitude, so voxel-level and lesion level metrics often disagree. We build an eleven-member nnU-Net ensemble that covers five design axes: a baseline dice + top-K loss, heavy augmentation, per-lesion volume loss re-weighting, stochastic weight averaging, and a sampling-and-architecture block that pairs cohort-balanced sampling with a residual-encoder backbone. Weighted soft-map fusion of the members feeds a tuned decision layer, SADL, that estimates lesion volume, applies an adaptive per-lesion-size threshold, prunes components by voxel count and peak probability, and adds a never-empty rescue. All fusion weights and per-bucket parameters are fitted on out-of-fold (OOF) predictions, so tuning never touches the held-out test set. On a site-disjoint 91-case holdout, SADL reaches Dice 0.7322, lesion-F1 0.7461 and PR-AUC 0.8430 when scored online with the challenge’s released evaluation code. A paired non-parametric bootstrap against a reference single ensemble member confirms the lesion-F1 gain at p=0.024, and the gain is largest in the small-lesion regime, where the rescue step recovers cases that a fixed threshold would silently discard.
[CV-48] xtVBench: Evaluating Text Rendering and Preservation in Video Generation
链接: https://arxiv.org/abs/2610.13412
作者: Ruiqiang Zhang,Hengyi Wang,Chang Liu,Guanjie Wang,Zehua Ma,Weiming Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Modern video generators can synthesize convincing scenes while rendering a few characters incorrectly, omitting requested text, or changing it across frames. Measuring these failures is harder than applying OCR independently to each frame: when a scene contains multiple text targets and multiple noisy OCR regions, the evaluator must first determine which observation belongs to which intended text. We introduce TextVBench, a benchmark and evaluation framework that formulates visual-text evaluation as a multi-target, multi-instance spatiotemporal correspondence problem. TextVBench contains two complementary tracks: TextVBench-T2V measures the creation and maintenance of prompt-specified text, while TextVBench-Ref2V measures preservation of text from reference images. Both tracks use target-conditioned candidate selection rather than unconstrained VLM transcription, support one target mapping to multiple OCR regions, and separate frame-level spatial fidelity from cross-frame temporal fidelity. A length-weighted harmonic score summarizes these factors, while extra-text diagnostics expose failure modes hidden by a single OCR score. The benchmark is organized around controlled text, layout, carrier, and motion attributes so that aggregate scores can be traced back to specific capability limits. Across the evaluated model runs, MiniMax-H3 reaches a T2V TextVScore of 68.32, while the strongest Ref2V score is 56.51; attribute slices reveal a pronounced drop as the number of simultaneous reference text regions increases.
[CV-49] Why DiT Models Underperform as Representation Learners without Long Skip Connections
链接: https://arxiv.org/abs/2610.13344
作者: Benyuan Meng,Yiliang Zhang,Jin-Wen Wu,Qianqian Xu,Qingming Huang,Longtao Huang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Diffusion feature, i.e., intermediate activations extracted from diffusion model backbones, has emerged as a promising approach for unifying generation and vision understanding (discrimination). Despite the advancement of diffusion backbones into Diffusion Transformers (DiT), it has been found in previous literature that DiT models tend to yield weaker features despite their stronger generation capability. This poses a threat to good generation-understanding unification. In this work, we show via controlled from-scratch training that long skip connections (LSCs) affect feature quality: a DiT with LSCs can produce better features. Furthermore, through detailed diagnosis, we reveal the mechanism causing this effect. Specifically, the input to a diffusion backbone contains both the latent image and the diffusion noise, where the diffusion noise, though appearing in the form of noises, actually reflects the information of the diffusion trajectory. To make the final prediction of a noisy variable ( v or \epsilon ), the diffusion backbone needs both signals. However, carrying both signals through the main backbone effectively “pollutes” the image signal with noises, leading to poor feature quality. In comparison, LSCs can shortcut diffusion noises directly to where they are needed, leaving much weaker noise signals in the main backbone, thus improving feature quality. To name the broader impact, this reveals that LSCs are not a mere trick but closely related to the diffusion objective. The code is at this https URL.
[CV-50] VideoAWR: Reinforcing Video Flow Models with Decoupled-Timestep Advantage-Weighted Rectification
链接: https://arxiv.org/abs/2610.13338
作者: Zheming Fu,Wenbin Ning,Ruizhe He,Wei Shang,Xiaoxiao Ma,Lianrui Mu,Chang Liu,Lei Wang,Siming Fu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Regression-based RL for flow models mandates sampling \emphwithout classifier-free guidance (CFG) to align the rectification target with the reference marginal velocity. Extending Advantage-Weighted Rectification (AWR), which dynamically scales this regression target based on reward, to video generation encounters a cold-start pathology: unguided rollouts collapse into low-fidelity regions where intra-group reward gaps remain wide but no longer track perceptual quality, rendering the optimization target arbitrary. Conversely, utilizing guided rollouts to restore fidelity, while keeping the regression target tied to the guided sampling distribution, provably triggers a geometric guidance blow-up under exponential-moving-average (EMA) updates. We propose \textbfVideoAWR, which resolves this tension by untying sampling from the optimization anchor. An EMA reference policy generates \emphguided rollouts to restore reward separability, while the trainable policy is rectified against the \emphunguided conditional anchor. We prove this decoupled objective is mathematically exact: the centered advantage cancels the anchor in expectation, filtering out the reward-neutral guidance offset and retaining only the reward-correlated covariance increment. Consequently, inference runs single-branch and CFG-free, yet inference-time CFG preserves its original semantics. Furthermore, we introduce \emphDecoupled Timestep Rectification, supervising each rollout at an independently sampled timestep without bias to improve sample efficiency. Experiments on Wan2.1-1.3B and 14B demonstrate stable optimization and superior visual and motion quality in \emphboth CFG-free and CFG-enabled regimes. Code is available at \pdfstartlink attr/Border [0 0 0] user/Subtype /Link /A /S /URI /URI (this https URL) % \textcolorpearDarkVideoAWR\pdfendlink.
[CV-51] LETHE: Defending against Unauthorized Image-to-Video Generation via Value Diversity Collapse
链接: https://arxiv.org/abs/2610.13333
作者: Boheng Li,Yueming Xing,Yiming Li,Jie Zhang,Tianwei Zhang
类目: Computer Vision and Pattern Recognition (cs.CV); Cryptography and Security (cs.CR)
备注: Preprint, under review
Abstract:Image-to-video (I2V) diffusion models can animate a single reference image into high-quality, subject-consistent videos, posing threats of misuse as anyone can turn personal photos into fabricated videos without consent. A promising solution is to proactively add an adversarial perturbation to the image before release, such that videos generated from it would be unfaithful or visually corrupted. However, due to an insufficient understanding of what governs how subsequent frames read the reference image in modern I2V models, existing protections struggle to offer strong protection under common perturbation budgets. In this paper, we approach the problem by exploring this underlying reading mechanism. Through a convex geometric analysis, we theoretically identify the spread of the reference value vectors as a key factor governing this reading process, and empirically find that even a mild contraction of this spread can severely degrade the generated video, making it an efficient lever for protection. Guided by this insight, we propose LETHE, a novel protection method that directly disrupts this reading process. LETHE pairs two complementary objectives, where a value collapse objective drives the reference value vectors toward uniformity, while an attention attraction objective draws subsequent frames toward these collapsed tokens to amplify corruption. We further construct two human-centric I2V protection benchmarks and conduct extensive experiments with multiple modern I2V models, which demonstrate the state-of-the-art protection performance and versatility of LETHE.
[CV-52] CoVA: Composing VAE Representations for Generative Learning
链接: https://arxiv.org/abs/2610.13322
作者: Zhaowei Chen,Yikai Ge,Linze Li,Yao Tang,Xiang Li
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Representation alignment with pretrained visual encoders improves diffusion transformer training but requires auxiliary encoders and extra training overhead. Recent approaches instead exploit representations from the generative model’s own variational autoencoder (VAE). However, reconstruction-oriented VAE features are not optimized for the semantic discrimination and spatial structure needed for generative learning. We introduce \textbfCoVA (\textbfComposed \textbfVAE Representations), a lightweight framework that composes VAE features online into stage-wise guidance for flow-matching training. A small latent composer is jointly trained with class supervision, masked latent reconstruction, and horizontal-flip consistency, yielding semantically discriminative, spatially structured dense features and sample-dependent class posteriors. CoVA aligns intermediate SiT features with the composed representations early in training, then removes the increasingly detrimental alignment and reuses detached composer posteriors for sample-dependent soft label conditioning. We further uncover a hidden confound in soft label conditioning: averaging class embeddings attenuates their magnitude, coupling semantic interpolation with conditioning strength. This attenuation alone can substantially improve FID while degrading Recall, revealing a non-semantic source of the apparent gain. CoVA corrects this confound by restoring the hard-label magnitude, isolating posterior-dependent directional semantics. CoVA adds only 8.5M training-only auxiliary parameters (1.3% of SiT-XL/2) and introduces no inference-time overhead. On ImageNet 256 \times 256, CoVA reduces SiT-XL/2 FID from 17.2 to 7.4 (\textbf57%) in 400K steps. With classifier-free guidance, it achieves an FID of \textbf2.03 in only 400 epochs, versus 2.06 after 1,400 epochs for vanilla SiT-XL/2.
[CV-53] hinkDrag : Semantic Drag -Based Image Editing with Visual Reasoning
链接: https://arxiv.org/abs/2610.13316
作者: Armando Fortes,Tianyi Wei,Chindanai Trakantannarong,Shangchen Zhou,Xingang Pan
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Project page: this https URL
Abstract:Drag-based image editing provides an intuitive interface for spatially controlled image manipulation by allowing users to specify handle and target points. Existing methods have made substantial progress through optimization-based, one-step, and feed-forward formulations, but they often interpret drag instructions as geometric displacements. This limits their effectiveness when the desired edit depends on interpreting image content and inferring a plausible semantic transformation from sparse point constraints. We introduce ThinkDrag, a unified multimodal framework for drag-based image editing with visual reasoning. ThinkDrag is trained to associate point constraints with meaningful object- and scene-level transformations, and can optionally produce an explicit reasoning trace that interprets the intended edit before image generation. This reasoning trace improves interpretability, particularly for ambiguous drags. Drag Endpoint Markers, motivated by an analysis of cross-image attention, provide an explicit correspondence signal that grounds each drag in image space. To support this framework, we construct a supervised dataset of semantic drag transformations paired with reasoning traces and introduce DragBench++, a benchmark targeting challenging drag-based editing scenarios with reference edit solutions. Experiments show that ThinkDrag achieves state-of-the-art performance, improving generation quality and plausibility while maintaining competitive point-following precision.
[CV-54] NovaSplat: Model-Free 6D Object Pose Estimation via 3D Gaussian Splatting Onboarding and Refinement
链接: https://arxiv.org/abs/2610.13309
作者: Georgios Floros,Evangelos Sartinas,Orestis Vangelis,Maria Pateraki
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:6D pose estimation of novel objects without CAD models remains an open challenge: model-free methods must build the object representation from scratch during onboarding and have long trailed their model-based counterparts. We present NovaSplat, a model-free pipeline that closes this gap. From a short smartphone video captured at onboarding, we train a 3D Gaussian Splatting (3DGS) model that serves both as a template source for detection and coarse pose estimation and as a differentiable backbone for pose refinement. Our refiner optimizes the object-to-camera pose with combined photometric and geometric losses under a continuous rotation parametrization free of gradient singularities. On a household-object benchmark, NovaSplat surpasses all model-based methods. On a challenging industrial benchmark with textureless and specular surfaces, it outperforms all model-free competitors while substantially narrowing the gap to model-based ones. We further introduce NovaSplat-Lite, an inference variant that is 3.1\times faster at negligible accuracy cost. Code will be made available at \hrefthis https URLthis https URL.
[CV-55] PAGE: Parts-Aware Guidance for Co-Speech Gesture Portrait Video Generation
链接: https://arxiv.org/abs/2610.13301
作者: Yabiao Wang,Jiafu Wu,Yicheng Xu,Teng Hu,Shengzhe Zhou,Yanxiao Sun,Jiangning Zhang,Ying Tai,Yong Liu,Ming-Hsuan Yang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to IEEE Transactions on Circuits and Systems for Video Technology (TCSVT) 2026. Project page: this https URL
Abstract:Co-speech gesture video generation aims to synthesize realistic, audio-driven portrait videos from a single reference image and a speech signal. Despite advances in visual quality, diffusion-based approaches still suffer from degraded local details and imperfect audio-visual alignment. We present PAGE (Parts-Aware GuidancE), a general, backbone-agnostic optimization framework for diffusion-based generation that enhances local spatial fidelity and global audio-visual consistency at both the training-objective and denoising-trajectory levels. During training, we propose Parts-Specific Reweighting (PSR), which adaptively increases supervision in semantically important regions such as lips, eyes, and hands, improving visual fidelity in perceptually critical areas. During inference, we introduce Consistency Classifier Guidance (CCG), an audio-conditioned latent classifier that identifies and corrects audio-visual inconsistencies in the generated video. We further design Differential Guidance (DG), an efficient inference strategy that refines facial and body motion separately while avoiding cross-region interference. To enable large-scale evaluation, we construct the Chinese Announcer Speech (CAS) dataset, the first comprehensive Chinese benchmark for co-speech gesture portrait video generation. Compared with the widely used PATS dataset, CAS includes substantially more identities, video clips, and scene diversity. Extensive experiments on both PATS and CAS demonstrate that PAGE achieves state-of-the-art performance in perceptual quality, gesture diversity, and audio-visual alignment. Project page: this https URL.
[CV-56] Sonic-AMG: Streaming Human Motion Generation from Spatial Audio
链接: https://arxiv.org/abs/2610.13300
作者: Jingcheng Ni,Zekun Li,Zhiyang Dou,Xiaoyan Cong,Ziyao Zeng,Hongyang Du,Randall Balestriero,Taku Komura,Srinath Sridhar
类目: Computer Vision and Pattern Recognition (cs.CV); Graphics (cs.GR); Machine Learning (cs.LG); Robotics (cs.RO); Sound (cs.SD)
备注:
Abstract:Modeling human reactions to spatial audio requires understanding both what is heard and where it comes from. Prior work generates motion offline from complete acoustic and spatial input sequences. Humans, however, react to sounds without knowing what they will hear next. We present Sonic-AMG, to our knowledge the first framework for streaming human motion generation from spatial audio. The model encodes acoustic content and body-relative source geometry as separate tokens. Conditioned on these tokens, a causal transformer with a flow head generates continuous motion latents, from which a causal decoder reconstructs motion segments. Standard teacher-forced training derives motion histories and body-relative source locations from ground-truth motion, whereas streaming inference relies on generated motion for both, resulting in a training-inference mismatch. To reduce this history discrepancy, we introduce rehearsal training, which combines full-sequence teacher-forced supervision with supervised prediction along short autoregressive self-rollouts. To keep spatial conditioning consistent with generated motion, we propose spatial feedback, which recomputes body-relative source locations from generated root poses during both rehearsal training and inference. On SAM, Sonic-AMG achieves state-of-the-art FID and R-precision. It further supports real-time online generation of coherent reactions across sound events and source locations. Project page: this https URL.
[CV-57] Decoding Register Tokens Preserves Global Scene Details
链接: https://arxiv.org/abs/2610.13299
作者: David Jacob Drexlin,Julius Hense,Jonas Dippel
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 31 pages, 7 figures
Abstract:Pretrained vision transformers learn structured image representations spanning spatial patch tokens and non-spatial tokens. Recent analyses suggest that non-spatial register tokens encode global scene properties such as illumination, blur, and style. Yet patch-based image decoders discard these outputs, leaving the decoder to recover image appearance from patches alone. We investigate whether retaining register features improves decoding when the complete spatial patch representation is already available. We study this question using representation autoencoders (RAEs) with frozen register-equipped encoders. Our decoder processes four register tokens together with all patch tokens through joint self-attention. Appearance probes, paired reconstruction-error analysis, and fixed-decoder register substitutions examine which global image properties are accessible from registers and how their values affect reconstructed pixels. For generation, we train a multi-head attention pooling (MHAP) predictor to recover register features from sampled patches, keeping the pretrained diffusion model and its samples unchanged. On ImageNet-1K, our ViT-B decoders achieve mean reconstruction FIDs of 0.472 with DINOv2 and 0.442 with DINOv3, reductions of 9.5% and 5.2% relative to their respective patch-only baselines. The corresponding PSNRs are 19.73 and 20.54 dB. For generation, our DINOv2 models achieve a mean FID of 1.641, 9.8% below the patch-only baseline on identical sampled patches.
[CV-58] Multi-Source and Multi-Dimensional Information Fusion in Resource-Constrained Edge Networks
链接: https://arxiv.org/abs/2610.13298
作者: Yushi Wang,Zhengxin Yu,Guhan Zheng,Wang Miao,Merouane Debbah
类目: Distributed, Parallel, and Cluster Computing (cs.DC); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Multi-source semantic information fusion enables edge networks to support global inference using observations collected by distributed terminals. However, limited communication and computation resources restrict semantic uploading, leaving the edge server with incomplete tokens that differ in modality, semantic granularity, arrival time, and channel condition. The value of these tokens also depends on the complementary or redundant information provided by other terminals. In this paper, we propose a multi-source and multi-dimensional semantic information fusion framework that coordinates terminal uploading and edge-side fusion under resource constraints. We develop Hyper-Slot to combine semantic content with available token attributes through iterative token-to-slot assignment and slot-to-token feedback, producing a compact representation for global inference. To encourage useful semantic uploading, we further design a contribution-based incentive mechanism that uses Hyper-Slot assignments to evaluate information coverage and cross-type complementarity. A bi-level Stackelberg-Nash game determines the server reward pool and terminal transmission-quality strategies while accounting for computation and communication energy costs. Experiments on a tri-modal extension of COCO2014 and image-text retrieval on Flickr30K show that Hyper-Slot improves mAP by 3.66 percentage points and RSum by 15.9 points over the strongest evaluated baselines, respectively, while reducing the number of parameters by more than 80% compared with a naive concatenation-based fusion baseline.
[CV-59] QCLR: A Plug-in Robustification Module via Quantization for Contrastive Learning in Self-Supervised Skeleton-Based Human Action Recognition ACCV2026
链接: https://arxiv.org/abs/2610.13281
作者: Nanzhu Chen,Feixiang He,Yunfeng Diao,Duygu Sarikaya,He Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to ACCV 2026
Abstract:Skeleton-based human action recognition has gained increasing attention due to the stability of skeleton data across diverse environments and advances in motion capture technologies. Following the success of supervised learning approaches, self-supervised learning approaches, particularly contrastive learning ones, have achieved impressive performance. However, they remain vulnerable to adversarial attacks. In this work, we propose a plug-in robustification module via quantization for contrastive learning in self-supervised skeleton-based human action recognition (QCLR), which enhances the robustness of representations against adversarial attacks while preserving their representational capability. Specifically, we employ a dual-level quantization scheme across the encoding pipeline, which breaks the gradient propagation and absorbs small adversarial perturbations within the quantization bins. To mitigate the impact of inevitable quantization error, we further design an attention-guided multi-faceted quantization strategy to maintain the representation quality. Experiments on several benchmark datasets demonstrate that integrating QCLR into a progressive lineage of mainstream contrastive learning models substantially improves robustness against both gradient-based white-box and gradient-free black-box adversarial attacks, while preserving highly competitive classification accuracy.
[CV-60] OWLET: On-Policy Weighted Learning via Evidence Transfer for Video Large Language Model Post-Training
链接: https://arxiv.org/abs/2610.13272
作者: Qitan Lv,Ke Fan,Hong Wang,Wen Wu,Yilin Wang,Bowen Zhou,Feng Wu,Chao Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Post-training has become a key stage for eliciting reasoning capabilities in Video Large Language Models (Video-LLMs). Existing post-training methods mainly follow two paradigms: reinforcement learning (RL) and on-policy distillation (OPD). However, they do not fully exploit visual evidence for effective training. RL supervises the policy with a single trajectory-level reward, which is too coarse-grained for video reasoning: the same response-level advantage is applied to every generated token, disregarding that the tokens of a video response are grounded in the visual stream to very different degrees. OPD provides token-level supervision through output-distribution matching, but lacks direct supervision of the spatiotemporal representations that produce those outputs. We observe across extensive experiments that the same model reasons more accurately when its video view combines global temporal context with question-relevant details. Comparing the same student-generated response under this view and uniform sampling reveals changes in token likelihoods and internal representations, providing a training signal for evidence use. Building on this observation, we propose OWLET, an evidence-privileged RL method that derives training signals from a richer teacher view. This view couples uniform global context with question-conditioned local windows, providing visual evidence without requiring a larger model. To better exploit this privileged visual evidence, OWLET introduces (i) \textbfevidence-aware credit redistribution, which compares token likelihoods across the two views and redistributes positive response-level advantages according to their relative evidence support; and (ii) \textbfspatiotemporal state alignment, which aligns the two views’ hidden states on verifier-accepted responses.
[CV-61] ConClick: Element-Wise Contrastive Learning Improves GUI Grounding
链接: https://arxiv.org/abs/2610.13268
作者: Ruotian Zhang,Yuhui Zhang,Junzhe Huang,Yu Xin,Hehe Fan,Xiaoxiao Sun
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 20 pages, 10 figures, including references and appendices. Code and data: this https URL
Abstract:GUI grounding, the task of locating the interface element specified by a user instruction, is a fundamental capability of GUI agents. However, existing grounding models remain error-prone, often causing downstream task failures. We systematically evaluate 10 grounding models across five datasets and identify a major error pattern: most incorrect clicks hit non-target interface elements rather than the background, with different models repeatedly selecting the same distractors. Motivated by these findings, we propose ConClick, a contrastive learning framework that teaches models to distinguish the target element from plausible distractors. We construct ConClick-Data, a dataset containing 4,292 challenging target-distractor pairs, and train the model using complementary listwise ranking and pairwise margin objectives. ConClick improves the grounding accuracy of Qwen3-VL-8B from 54.71% to 66.03% on ScreenSpot-Pro, from 83.72% to 86.28% on MMBench-GUI L2, and from 63.33% to 70.20% on OSWorld-G, outperforming prior methods built on the same or similarly sized backbones. We further introduce ReClick, an inference-time strategy that revisits promising regions and compares predictions across competing candidates, yielding an additional 2.96 percentage-point improvement in average accuracy across the three benchmarks. Together, our analysis, dataset, and methods provide both empirical insights and practical tools for building more reliable GUI agents. Data and code are available at this https URL.
[CV-62] CV-OPD: Contrastive Vision On-policy Distillation
链接: https://arxiv.org/abs/2610.13264
作者: Haowei Wang,Hao Lin,Qi Zhu,Jiayi Ji,Deyi Ji,Liujuan Cao,Rongrong Ji
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG); Multimedia (cs.MM)
备注: 16 pages, 7 figures, contrastive learning for on-policy distillation of VLMs. Computer Vision. Post-training. VLM. LLM
Abstract:On-policy distillation (OPD) reveals versatility and convenience during VLM post-training, providing dense supervision for student from teacher. However, we observed an anomaly that the distilled VLM could still answer the questions accurately even when the related visual regions were masked or replaced with noise. Building on this observation, our quantitative and qualitative experiments demonstrate that OPD, which uses the answer as a hint, has failed to teach students to genuinely seek out and rely on visual evidence. Our theoretical analysis suggests that this failure arises from a shortcut enabled by the lack of visual constraints during distillation. To address the issue, we introduce Contrastive Vision On-policy Distillation (CV-OPD), which compares teacher distributions induced by positive and negative crops while conditioning on the same student prefix and augments optimization with a margin-based contrastive constraint, which is modulated with discrepancy gating across token and sample level. Specifically, CV-OPD first introduces a negative teacher unrelated to the answer and designs a Contrastive Divergence Loss (CDL) that constrains the feature distribution of student by contrasting the positive and negative teachers, correcting how the student exploits visual regions. The CV-OPD introduces a Discrepancy Aware Gate (DAG) that uses token-level and sample-level discrepancies to select visually relevant tokens for optimization, directing the student’s attention toward visual content. Extensive experiments across a broad range of fine-grained visual benchmarks demonstrate that CV-OPD substantially alleviates shortcut and consistently improves the visual reasoning capabilities of existing VLMs.
[CV-63] SheafPrune: Sheaf-Guided Graph Propagation for Visual Token Pruning
链接: https://arxiv.org/abs/2610.13263
作者: Xiaoyang Ma,Chi Wang,Hong Sun
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Multimodal large language models process the complete visual token sequence, increasing prefill cost even when many tokens are irrelevant to the instruction. Token-wise saliency captures limited inter-token dependence; graph-based selection instead depends on how relations govern importance propagation and ranking. We study support-constrained propagation with node-degree correction. Inspired by sheaf geometry, SheafPrune uses modality-specific maps and a sparse text–visual graph to transfer relevance, then propagates scores on a separate visual graph and corrects them for degree. It retains a hard top- k subset once before the frozen language model. The selector has about 4.5 M parameters and is trained end-to-end through the frozen LLaVA-NeXT-8B backbone using only the language-modeling objective. Explicit retention-ratio conditioning lets one checkpoint serve every budget. Across four backbones, ten benchmarks and seven pruning ratios, with all baselines re-implemented under one protocol, SheafPrune achieves the best retention at 22 of 28 backbone–budget settings, with monotonically growing margins in the moderate-to-aggressive regime. On LLaVA-NeXT, retaining 10% of visual tokens yields a 5.15\times net prefill speedup and an 84.0% end-to-end FLOPs reduction. Together with component ablations, these results support graph-constrained importance propagation and degree correction as a design for visual token selection across the evaluated backbones and tokenization schemes, improving the trade-off between accuracy retention and inference cost. code:this https URL
[CV-64] Dual-Stream Memory for Vision-Language-Action Policies
链接: https://arxiv.org/abs/2610.13262
作者: Yang Wang,Ping Liu,Ruiyu Wang,Xuhua Chen,Lingfeng Zhang,Tao Zhang
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注: 8 pages, 6 figures, 3 tables. Evaluated on 16 RoboMME tasks and 4 real-world robotic manipulation tasks
Abstract:Memory-dependent manipulation requires a policy to track execution state and recover visual evidence that is no longer observable. We propose dual-stream memory for vision-language-action policies, assigning these requirements to complementary representations. A task-agnostic Gated DeltaNet compresses history into one temporal token, supervised by progress prediction and action-conditioned feature reconstruction. A task-conditioned retriever retains frames above a fixed relevance threshold; linear multi-scale fusion encodes each frame into sixteen spatial tokens. We then freeze the temporal compressor and jointly optimize retrieval and policy learning. Across sixteen RoboMME tasks, the complete model achieves 49.22% mean success versus 44.51% for the published FrameSamp+Modul reference, improving fourteen tasks and all four suite means. On four real-robot tasks, mean success reaches 62.5% versus 37.5%, with the largest gains on repeated actions requiring execution-stage discrimination. These results support combining execution context with selective visual access, while failures under cup swaps expose persistent identity tracking as an unresolved requirement.
[CV-65] Beyond a Single Crop: Contextualized Embeddings for Player Re-Identification
链接: https://arxiv.org/abs/2610.13259
作者: Ge Luo,Changhuo Yang,Weisi Fan,Rui Yang,Shaokai Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Person re-identification is typically addressed by learning identity-discriminative embeddings from individual person crops. However, player re-identification in broadcast sports videos presents a unique challenge: players from the same team often share similar appearances, while video sequences provide repeated observations of the same players under different viewpoints and surrounding contexts. Existing crop-based approaches largely ignore this contextual information, which can be critical for resolving visually similar identities. Here, we propose ContextReID, a contextualized embedding framework that represents a player by jointly considering other players in the same frame and observations from different frames of the broadcast sequence. By incorporating both co-occurring players and cross-frame observations, the model learns identity features relative to the surrounding visual context rather than relying only on isolated appearance cues. We implement this framework with a vision-language model that takes sets of player crops as input and generates context-aware embeddings for individual players. A combined contextual learning and retrieval objective encourages the model to capture cross-frame identity relationships while maintaining discriminative embeddings for player matching. Experiments across three multi-object tracking benchmarks show that ContextReID improves player retrieval over conventional single-crop embedding approaches in both Rank-1 and mAP. These results highlight the utility of spatial and temporal context for reliable player identification in broadcast sports videos. Subjects: Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2610.13259 [cs.CV] (or arXiv:2610.13259v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2610.13259 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-66] Deep Learning Approach for RealTime Contraction Detection in Laboring Dairy Cattle
链接: https://arxiv.org/abs/2610.13242
作者: Sebastian Puchala,Dominik Gronkiewicz,Marcin Gołębiewski,Grzegorz Grodkowski,Grzegorz Gwardys
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Currently, the animal production sector is undergoing rapid development of techniques that allow automatic monitoring of animal behaviour and health. This paper presents a computer vision-based approach for the automatic recognition of labor contractions in cows. During the course of the study, videos depicting 100 cow births were collected. From the obtained videos, 8500 cow contraction actions and about 25 000 non-contraction sequences were extracted which constituted the dataset. Leveraging image processing techniques and deep learning algorithms like Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs), our methodology extracts relevant features from video frames to detect and classify contractions. Our study demonstrates a high accuracy rate of over 95% in detecting labor contractions. This automated system has the potential to enhance productivity and animal welfare in the dairy industry by providing real-time monitoring and facilitating timely intervention during difficult calvings. The video demonstration of the system can be found at the following URL: this https URL
[CV-67] Jag: Direct Box Prediction for Efficient Visual Grounding
链接: https://arxiv.org/abs/2610.13239
作者: Xiuyuan Zhu,Ke Lu,Hao Wu,Zijin Du,Dongming Zhang,Jian Xue
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 16 pages, 6 figures, 13 tables
Abstract:Visual grounding combines image–language understanding with geometric prediction, yet autoregressive multimodal models often express a box as a coordinate sequence. Sequential decoding adds computation to the multimodal processing needed for localization. Adapting these representations to box geometry offers a route to direct prediction. We present Jag, which adapts a compact pretrained multimodal model for direct continuous box prediction. A lightweight regression head reads the last valid input-token state, conditioned on the image and referring expression, and predicts all four box coordinates together. Geometric supervision jointly adapts the language backbone, visual merger, and regression head, allowing localization losses to shape both the multimodal representations and the coordinate mapping. Inference retains image–language processing and returns the box in one forward pass, without coordinate generation or text parsing. Across benchmarks, Jag consistently improves grounding accuracy over its base model across the observed target sizes and expression groups. Component ablation show that jointly adapting the representations and head substantially improves accuracy over training the head alone. Against existing specialized grounding models, it achieves competitive accuracy with lower single-request latency and GPU memory use. These results show how supervision tailored to the geometric answer can specialize a compact pretrained multimodal model for accurate grounding and efficient direct prediction. Project page: this https URL
[CV-68] FPD-Drive: Future Policy Distillation for End-to-End Autonomous Driving
链接: https://arxiv.org/abs/2610.13232
作者: Li-Heng Chen,Qifeng Chen,Chengwei Wu,Yingjie Zhang,Sheng Yang,Hongbo Fu,Shaoqing Ren
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:End-to-end autonomous driving models are typically trained on real-world driving logs, which record only the trajectory actually executed in each scene. This provides limited supervision for learning alternative valid behaviors. Multi-target supervision can mitigate this limitation, but broader trajectory coverage makes safe candidate selection more challenging. We propose FPD-Drive, an end-to-end planner that distills privileged future knowledge into a visual driving policy to improve both multi-trajectory supervision and safety selection. Specifically, we introduce Future-Privileged Multi-Target Distillation to transfer diverse, high-quality trajectory targets from a teacher with access to recorded future observations to the student. These targets extend supervision beyond the single recorded human trajectory. For candidate selection, we further introduce Safety-Aware Score Correction to correct ranking errors between nearby safe and unsafe candidates and raise underestimated safety scores of safe candidates. At deployment, the student requires neither future observations nor teacher inference. Our base model achieves 94.9 PDMS on NAVSIM v1 navtest and 55.9 EPDMS on NAVSIM v2 navhard. The scaled FPD-Drive-Pro improves these scores to 95.5 PDMS and 58.1 EPDMS, respectively, achieving SOTA performance among the compared methods on both benchmarks. Zero-shot closed-loop evaluation on HUGSIM further yields an HD-Score of 45.1 and RC of 55.3.
[CV-69] Automated Detection and Encoding of Cartographic Signs in Historical Maps
链接: https://arxiv.org/abs/2610.13224
作者: Remi Petitpierre
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 18 pages, 6 figures
Abstract:Symbols and icons in archival maps represent an expansive source of evidence for historical geography. In this paper, we present a two-stage framework for (1) detecting cartographic signs in historical maps and (2) generating interpretable sign embeddings that capture both semantics and stylistic variations. We also introduce CaSiDD, an open benchmark dataset spanning multiple sign categories and diverse cartographic styles, designed for generic sign detection. Using YOLOv10-X, we demonstrate the practicality of automated sign detection on historical maps. We then present strategies for creating contrasted, informative embeddings of cartographic signs. We approach embedding design systematically, maximizing expressiveness while suppressing digitization or background material confounders. Our final method, based on an adapted RADIOv4 backbone, effectively encodes both sign form and semantics, while producing interpretable representations. This work lays a foundation for scalable evidence extraction for the comparative study of map signs within cartographic culture and geohistorical research.
[CV-70] Multi-Modal Graph Neural Network-Inspired Vessel Identification and Tracking for UAV-Based Maritime Surveillance
链接: https://arxiv.org/abs/2610.13220
作者: Chenjie Zhao,Jiangtian Nie,Jiawen Kang,Yuxu Lu,Ryan Wen Liu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:The unmanned aerial vehicle (UAV)-based maritime surveillance is becoming an important part of maritime Internet of Things (IoT) and intelligent transportation systems. It provides a flexible and cost-effective way to large-scale maritime traffic monitoring. However, achieving robust situational awareness remains challenging in practical maritime environments. The main challenges arise from heterogeneous sensing modalities, adverse imaging conditions, and spatial misalignment caused by UAV motion. To address these problems, this paper proposes an airborne multi-modal graph learning-driven framework, termed AMGT, for vessel identification and tracking in UAV-assisted maritime IoT. Specifically, visible and infrared images are first aligned and fused through a multi-parameter perspective transformation model. This improves visual perception under low visibility and complex illumination conditions. Automatic identification system (AIS) messages are then temporally synchronized using interpolation and linear prediction. To detect small and oriented vessels, we develop a mixed-modality MAir-YOLOv8-OBB detector, followed by the MAir-SORT algorithm for stable vessel tracking. We further design a graph learning-driven association network to model temporal dynamics and spatial dependencies among vessels and between vessels and UAVs. A motion-aware coordinate unification (MCU) strategy is also introduced to reduce nonlinear misalignment caused by UAV motion. Experiments on the MAP-M2UAV50 dataset show that AMGT achieves high accuracy and efficiency. The results demonstrate its potential for UAV-assisted maritime IoT applications, including vessel monitoring, traffic situational awareness, and intelligent maritime transportation services. The dataset and code will be available at this https URL.
[CV-71] Complexity-Calibrated Reconstruction Discrepancy for No-Reference Point Cloud Quality Assessment
链接: https://arxiv.org/abs/2610.13219
作者: Haocheng Wu,Xiangjie Sui,Xin Sun
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:The discrepancy induced by surface reconstruction in a distorted point cloud is jointly influenced by its intrinsic structural complexity and signal degradation. This observation motivates a referencefree point cloud quality assessment (PCQA) strategy that estimates and compensates for the complexity-induced component. We implement this strategy through successive reconstruction. Specifically, reconstructing the distorted point cloud produces an input-toreconstruction discrepancy that combines the effects of signal degradation and content complexity. Reapplying the reconstruction operator with stronger smoothing produces a discrepancy between successive reconstructions, which serves as a proxy for the complexityinduced component. This proxy is then used to calibrate the inputto-reconstruction discrepancy. We apply the same strategy to 3D geometry patches and their aligned 2D regions, enabling local comparison of the resulting discrepancies. The calibrated geometric and projected-view discrepancies are then fused into a final degradation score. For both branches, the discrepancies are measured using frozen pretrained perceptual representations. Our method does not require PCQA-specific training or fine-tuning. Experiments on three public databases show that the proposed method consistently outperforms most generic baselines and achieves performance comparable to several full-reference this http URL code is available at this https URL.
[CV-72] Golden Anchor for Video Generation
链接: https://arxiv.org/abs/2610.13217
作者: Jinyuan Xu,Shitong Shao,Lichen Bai,Zikai Zhou,Guoxi Huang,Nantheera Anantrasirichai,Zeke Xie
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 22 pages (including references and appendices), 3 figures, 8 tables
Abstract:Video generation supports digital content creation, with applications in virtual avatars, AI-driven filmmaking, interactive game engines, and world models. State-of-the-art systems achieve controllability primarily through image-to-video (I2V) generation, in which an injected anchor image determines the identity, composition, and style of the resulting video. In modern pipelines, this anchor is synthesized by a text-to-image (T2I) generator. This raises a largely overlooked question: Are images obtained directly from the T2I model truly suitable for current video models? Our analysis shows that anchor aesthetic and quality scores are weakly correlated with downstream video quality. The structure-and-texture score is negatively correlated with I2V video quality in both the visual and motion dimensions. Fine-tuning the T2I model on an image reward accordingly yields anchors with visibly denser structural and character detail: they score higher on image metrics, yet lower the video reward on every I2V model we test and change downstream motion unpredictably. We therefore introduce Golden Anchor Learning (GAL), to our knowledge the first framework for learning golden anchors by optimizing a T2I generator with downstream video feedback. GAL evaluates candidate anchors through the videos they induce under a frozen I2V model and converts video rewards into image-level preferences for DPO fine-tuning of the T2I generator. On all four I2V models, GAL raises the VBench average by 2.97% – 8.46% over the untuned generator. The rendered clips also score higher under VideoReward-Overall, and their extracted frames under HPSv3 and UniPercept. GAL yields consistent motion gains across all four I2V models, as measured by a 5.62% – 38.24% increase in VBench dynamic degree. Although GAL is trained only on HunyuanVideo-1.5 renders, these gains extend to the other three I2V models.
[CV-73] Destination-Conditioned Adaptation with Semantic-Geometric Alignment for Generative Inbetweening
链接: https://arxiv.org/abs/2610.13187
作者: Zhiyu Xu(1),Wei Shang(2),Yushen Xu(1),Wenwen Li(3),Zhiyan Xu(4),Pengfei Zhu(1),Dongwei Ren(1) ((1) Tianjin University, (2) Singapore Management University, (3) Tianjin Medical University, (4) Southeast University)
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Generative inbetweening aims to synthesize temporally coherent intermediate frames between a start frame and a target frame. Although pretrained image-to-video diffusion models provide strong priors for large-motion inbetweening, they are not explicitly designed to reach a specified target frame. They may therefore generate realistic individual frames while drifting from the target or producing unstable motion under large displacements and non-rigid dynamics. We propose DSG-GI, a framework that adapts pretrained latent video diffusion models through \textbfDestination-Conditioned Adaptation and \textbfSemantic-\textbfGeometric Alignment. Destination-Conditioned Adaptation treats the target frame as the destination of the sequence and provides temporally progressive guidance along the generated trajectory. Semantic-Geometric Alignment aligns the token-wise spatio-temporal relational geometry of backbone features with that of a frozen video foundation encoder and applies a flow-matching-aware latent flow constraint to samples near the data endpoint of the probability path. Together, these components strengthen destination guidance and preserve coherent semantic-geometric motion structure. Extensive experiments on standard and large-motion inbetweening benchmarks demonstrate improvements in temporal stability, target-frame faithfulness, and perceptual quality. Our code will be made publicly available.
[CV-74] MixTok: Adaptive Visual Tokenization with Global 1D Tokens and Sparse 2D Refinement
链接: https://arxiv.org/abs/2610.13181
作者: Chenge Li,Yefei He,Xinyu Liu,Feng Chen,Hong Zhou,Bohan Zhuang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Efficient visual tokenization requires balancing representation compactness with the preservation of fine-grained image content. Conventional grid-based tokenizers allocate tokens uniformly across spatial locations despite non-uniform visual complexity, whereas compact 1D tokenizers aggregate global information but can struggle to preserve local details. We introduce MixTok, a hybrid visual tokenizer that combines a compact 1D global representation with sparse 2D tokens for local refinement. A content-adaptive router ranks candidate locations by refinement priority and determines the number of 2D tokens for each image under a target average token budget. At the highest-scoring locations, 2D token features replace the spatial features recovered from the 1D representation, and a shared decoder reconstructs the image from the resulting mixed features. On ImageNet 256 x 256, MixTok achieves highly competitive reconstruction and generation performance, with an rFID of 1.195 and a gFID of 1.95 at respective average budgets of approximately 128 and 131 content tokens per image.
[CV-75] High-Throughput Generative Video Super-Resolution on a Single Consumer GPU
链接: https://arxiv.org/abs/2610.13179
作者: Georgios Panaretou,Sotirios Chatzis
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Generative video super-resolution (VSR) can recover visually compelling high-frequency detail by leveraging diffusion priors, but iterative sampling and heavy spatio-temporal coupling make practical deployments difficult. We study a different operating point: practical HD generative VSR on a single high-end consumer GPU without end-to-end retraining. To this end, we present a zero-shot framework built entirely from pretrained components. The proposed system decouples spatial enhancement from temporal stabilization. A time-distilled one-step diffusion backbone handles spatial upscaling, while temporal coherence is promoted by a lightweight pretrained flow-based interpolator that synthesizes intermediate frames between super-resolved keyframes. To further improve scalability, we introduce a resolution-aware hybrid attention scheme that, in a zero-shot manner, replaces selected high-resolution global-attention layers with neighborhood attention while preserving global attention in semantically critical low-resolution layers, while also improving temporal consistency. Experiments show that the proposed framework reaches up to ~32 FPS at 720p resolution under interleaved inference on a single NVIDIA RTX 4090. At 4K, the proposed attention substitution can yield up to a 44% speedup over the original attention implementation. Across standard VSR benchmarks, the method consistently shifts the speed-quality trade-off decisively toward runtime efficiency, trading reconstruction fidelity for strong no-reference perceptual quality, while remaining reasonably competitive against generative approaches in temporal consistency. It also exposes clear limitations in handling more challenging motion, which a simple motion gate partially mitigates. Code will be released upon acceptance. Subjects: Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2610.13179 [cs.CV] (or arXiv:2610.13179v1 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2610.13179 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-76] CompactSplat: Spatially Adaptive Gaussian Distribution for Feedforward Scene Reconstruction NEURIPS2026
链接: https://arxiv.org/abs/2610.13177
作者: Bing He,Jingnan Gao,Yunuo Chen,Zhengxue Cheng,Rong Xie,Li Song,Wenjun Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: NeuRIPS2026, Generalizable reconstruction, 3DGS, 2DGS
Abstract:Reconstructing 3D scenes from sparse views without per-scene optimization remains highly challenging, especially for recovering accurate geometry and fine textures. While recent feedforward approaches leverage generalizable 3D Gaussian Splatting (3DGS) for scene generation, they typically assign one or multiple Gaussians to each pixel. Such uniform allocation not only produces highly redundant representations by wasting primitives in homogeneous areas, but also fails to exploit the inherent geometric priors of planar surfaces, often resulting in sub-optimal structural modeling. To address these limitations, we present CompactSplat, a novel feedforward framework that enables a content-aware allocation of 3D Gaussians. By integrating texture-guided spatial partitioning with hierarchical sampling, CompactSplat adaptively distributes primitives - concentrating dense Gaussians in complex regions while tiling flat areas with expanded, scale-modulated primitives. Moreover, our framework inherently supports dynamic sparsity control at inference time, enabling seamless trade-offs between rendering fidelity and memory footprint without requiring network retraining. Extensive experiments on RealEstate10K, DL3DV, and ScanNet demonstrate that CompactSplat consistently outperforms prior methods on both standard metrics and high-resolution rendering consistency, achieving high-fidelity reconstructions with significantly fewer primitives.
[CV-77] Fix the Match Not the Solver: STITCH – a Self-Supervised Compatibility Measure for Eroded Visual Puzzles
链接: https://arxiv.org/abs/2610.13176
作者: Nadav Alali,Ohad Ben-Shahar
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 9 pages, 8 figures, 5 tables
Abstract:Unlike the clean and pixel-aligned complete pieces of standard jigsaw benchmarks, real-world puzzle fragments lose their boundary regions to erosion, destroying the signal that classical compatibility measures (CMs) rely on. We first re-establish, via oracle experiments, that the CM, not the solver, is the performance bottleneck: with a perfect CM, even a simple greedy solver achieves perfect reconstruction. This motivates STITCH, a self-supervised CM that sidesteps missing boundaries by comparing frozen ViT patch tokens from piece interiors via a lightweight cross-attention head (~249K trainable parameters), trained without manual annotation. Plugged into unchanged compatibility-based solvers, STITCH reaches .992/.954 Abs/Perf on JPwLEG-5 (+.629 Perf over the best prior method), nearly saturating the benchmark. On a new ImageNet 7x7 benchmark, it outperforms all alternatives, including inpaint-then-match pipelines built on modern generative models. Importantly, performance remains robust across erosion levels and generalizes to puzzles with over 40% missing pieces without retraining. Trained on the recent GAP datasets of irregular, heavily eroded fragments, the same CM recipe enables compatibility-based solvers to surpass recent learning-based solvers on GAP-3 and GAP-5. Since this leap in performance is achieved by a pluggable CM module, the takeaway is clear: fix the match, not the solver.
[CV-78] PreCoG: Preview-Edit for Efficient Video Correction in Generation-Time
链接: https://arxiv.org/abs/2610.13174
作者: Yilai Liu,Wenqi Pei,Zhifeng Lu,Shiyuan Zhang,Zongxi Liu,Hongyang Du
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Iterative text-to-video generation relies on feedback to correct compositional and temporal failures. However, existing methods typically require another full generation run for each correction, repeating computation and potentially disrupting already correct content. We introduce PreCoG, an iterative framework for correcting semantic failures during video generation. PreQA diagnoses failures from low-cost previews and constructs corrective conditions, while PreEdit edits cached generation trajectories under these conditions, attenuating orthogonal changes to limit disruption of already correct content. PreCoG completes generation only for the selected candidate, reusing its cached trajectory to reduce redundant computation and help preserve semantic consistency between the preview and the final video. Experiments show that PreCoG achieves the highest VBench and T2V-CompBench scores and approaches VSR’s leading VS2 score at 0.56\times its inference time. It also outperforms GENMAC on all three quality and alignment metrics at 0.86\times its inference time.
[CV-79] From Glance to Focus: Mitigating Recognition Laziness in MLLM s for Fine-Grained Recognition
链接: https://arxiv.org/abs/2610.13154
作者: Yutong Yang,Zhuqi Liu,Mouxing Yang,Xi Peng
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 21 pages, 18 figures, 5 tables. Includes supplementary material
Abstract:Multimodal Large Language Models (MLLMs) generally fall short of expectations in Fine-Grained Visual Recognition (FGVR), although they exhibit promising FGVR foundations, i.e., visual perception and broad category knowledge. Most existing studies seek to remedy this deficiency by adopting domain-specific post-training, at the risk of compromising generalization to unseen domains. Different from these efforts, in this paper, we revisit the FGVR mechanism underlying MLLMs from both the empirical and theoretical perspectives and uncover an inference-time phenomenon termed FGVR Laziness. In brief, FGVR Laziness refers to the insufficient association between visual cues and category concepts under certain candidate category lists and recognition guidance, leaving the FGVR foundations of MLLMs largely under-utilized. To mitigate FGVR Laziness, we propose Laziness-resIstant Visual rEcognition (LIVE), a training-free framework which jointly refines candidate lists and recognition guidance to elicit the latent FGVR capability of MLLMs. Specifically, LIVE first performs query-adaptive candidate inference to derive a compact yet reliable candidate list. Meanwhile, LIVE constructs category-specific FGVR skills by mining the intra-category characteristics and inter-category differences. Finally, LIVE selectively invokes detailed skill guidance according to recognition uncertainty and category confusion, shifting MLLM-based FGVR from a cursory glance to a focus on associating discriminative visual cues with category concepts. Extensive experiments on 13 benchmarks against 24 state-of-the-art methods spanning fine-grained category recognition, action recognition, and general category recognition, verify the effectiveness and generalizability of LIVE across different MLLM backbones. The code will be released upon acceptance.
[CV-80] Measurable Semantic 3D Gaussian Splatting with Joint Region and Depth Supervision for Interactive Building Inspection
链接: https://arxiv.org/abs/2610.13143
作者: Yi Zhang,Tian Tan,Ray Kai Leung Su
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Image-based 3D reconstruction provides a scalable representation for building inspection and maintenance. However, photorealistic reconstruction alone does not fully provide the geometric measurability, semantic structure, and interactive information access required for engineering applications. This study proposes a measurable semantic 3D Gaussian Splatting (3DGS) framework with region and depth supervision for interactive building inspection from multi-view imagery. Mask-based region supervision suppresses irrelevant backgrounds and focuses optimization on target regions. Point-wise depth supervision guides Gaussian centers toward physical surfaces using reference geometry derived from multi-view stereo (MVS) point clouds, providing geometric anchors for measuring physical dimensions and areas. A semantic Gaussian field associates learnable class features with individual Gaussian primitives, enabling semantic rendering and component-level inspection. These capabilities are operationalized through AEC-SplatTwin, an interactive building inspection platform supporting real-time visualization, semantic analysis, quantitative measurement, and multimodal large language model (MLLM)-assisted interaction. On the synthetic UAV-inspection QuakeCity and smartphone-captured HKUPB datasets, the framework reduces Gaussian-center depth MAE by 58.1% and 86.8%, while its semantic field achieves mIoU values of 0.8529 and 0.8642. On HKUPB, the mean relative errors for height, width, and area measurements are 0.33%, 1.07%, and 0.60%. These results show that the proposed framework extends 3DGS beyond visual reconstruction into a measurable, semantically structured, and interactive engineering representation for building inspection.
[CV-81] GuidedNav: Shaping Vision-Language Navigation Representations through Pre-action Attention and Spatial Guidance
链接: https://arxiv.org/abs/2610.13122
作者: Jingyu Guo,Jiaxin Huang,Chengxing Lin,Xiaoyu Luo,Cheng Wen,Shanshan Ye,Tingjin Chu,Shaoli Huang,Mingming Gong
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Vision-and-language navigation (VLN) requires an agent to track progress through an extended instruction, identify landmarks relevant to its current objective, and understand the surrounding spatial structure to act. End-to-end navigation policies typically rely on action supervision to implicitly learn these capabilities. Without explicit guidance on the evidence underlying each decision, however, policies can overfit to correlations predictive of training actions rather than learn the task-relevant grounding and geometry needed for generalization. Our insight is to guide the representations that connect instructions to actions: identifying what remains to be done determines which visual evidence matters, while understanding the geometry around that evidence informs how to move. We introduce GuidedNav, a unified framework that explicitly shapes these representations through training-time guidance. Subtask and landmark guidance steer native pre-action attention toward the active instruction segment and relevant visual regions, grounding action prediction in the current objective. Spatial guidance aligns the policy’s internal representations with geometric features that capture long-horizon context and local spatial structure. Together, these objectives strengthen navigation capabilities while avoiding the inference overhead of intermediate textual reasoning and online geometric encoding. We also introduce Guided-R2R and Guided-RxR, two annotation-enriched navigation datasets that support more interpretable VLN research. GuidedNav establishes state-of-the-art performance among the compared monocular RGB policies, improving success rates by 8.1% and 13.1% relative to the strongest prior results on R2R-CE and RxR-CE val-unseen, respectively, while achieving faster inference. Extensive experiments further demonstrate the effectiveness and real-world transferability of our approach.
[CV-82] Replaying the Movie in Your Mind Decoding Dynamic Visual Perception and Recall from EEG ICONIP
链接: https://arxiv.org/abs/2610.13120
作者: Zikai Fang,Tian-Yi Zhou,Xuan-Hao Liu,Yixi Li,Xiaoyu Xing,Yutong Pei,Bao-Liang Lu,Wei-Long Zheng
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: ICONIPS 2026 15 pages, 5 figures
Abstract:Decoding dynamic visual content from EEG has advanced rapidly for visual perception, yet it remains unclear which aspects of neural representations are preserved when people internally replay dynamic scenes. We introduce PAIR, an EEG benchmark collected from 20 participants using an interleaved, clip-wise paradigm that pairs naturalistic video viewing with immediate visual recall. This design enables a comparison between externally driven perception and internally generated recall for the same stimulus content within a fixed trial sequence. We benchmark multiple decoding models on hierarchical semantic classification at both fine-grained and coarse-grained levels, meta-feature decoding tasks covering motion, color, object number, face, and human presence, and a state-decoding task that discriminates perception from recall. Within-subject validation results show numerically similar performance for several model–task combinations, alongside higher perception accuracy in two coarse-grained comparisons after multiple-comparison correction. In contrast, perception and recall are highly separable at the state level under the present validation protocol. State accuracy remains high after alpha-band ablation, although this does not exclude ocular or other task-related contributions.
[CV-83] What Do Visual-Head Discovery Scores Actually Find? Attention Source Necessity and Random-Control Pitfalls in Vision-Language Models
链接: https://arxiv.org/abs/2610.13111
作者: Md Abdul Kadir,Daniel Sonntag
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Attention heads that attend to image regions relevant to a question are increasingly used to steer, ground and interpret vision-language models (VLMs) and to reduce their hallucinations. They are mostly found by ranking heads with an attention- pattern score and validated by steering or masking them. We ask how the choices inside such a discovery score shape the heads it returns, and which of the two validations identifies them. On Qwen3-VL-8B-Instruct we vary the query type, the discovery corpus and the token positions whose attention is read (the attention source) in a full 2 x 3 x 2 design, and test all 12 head-sets for steerability (CERS: Contrastive Evidence-Region Steering score) and necessity (NCS: Necessity Con- trast Score) against layer-matched random head-sets. (1) The attention source and the query type reshape the selected heads far more than the corpus: changing the source keeps a median of 49 of the top-100 heads, the query 55 and the cor- pus 84, while two halves of the same data share 96-99. (2) Necessity follows the attention source: head-sets discovered from query-span attention are more nec- essary than last-token ones (difference 0.083, p=6 x 10^-10), and the two re- ferring + query-span sets lie 17-19 standard deviations above 250 layer-matched random sets (Holm-adjusted p=0.048). The referring + query-span effect re- plicates on several recent VLMs. (3) Steerability is not specific to the discovered heads: no discovered head-set steers better than its layer-matched random sets (rank p = 0.14), and random sets drawn from the same or from any layer span the discovered sets’ scores. Necessity therefore separates the discovery settings, while steering at this strength does not. We turn these findings into a protocol for reporting visual-head discoveries.
[CV-84] Robust Vision-Language Navigation with Awareness of Instruction-Execution Progress
链接: https://arxiv.org/abs/2610.13104
作者: Jiagan Huang,Zikun Zhou,Hongpeng Wang,Guangming Lu,Jun Yu,Wenjie Pei
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:In Vision-Language Navigation (VLN) tasks involving multi-step instructions as guidance, an agent must associate its observations with the relevant instruction content at each decision point. Most graph-based methods commonly match candidate trajectories with the entire instruction, allowing already executed content to interfere with subsequent decisions. Although instruction-execution progress provides a direct cue for separating executed and pending content, existing progress estimation approaches often rely on explicit progress supervision, sophisticated progress-learning stages, or costly online reasoning with LLMs. In this paper, we propose a robust VLN framework with Awareness of Instruction-Execution Progress (VLN-AIEP), which couples progress estimation with navigation decision-making. VLN-AIEP associates the visited trajectory with the instruction to suppress embeddings corresponding to executed content, and then matches candidate locations with the pending content. This coupling makes correct navigation decisions depend on accurate progress estimation, allowing the progress estimator to learn directly from navigation decision labels without explicit progress annotations. To support progress estimation, we construct a landmark-anchored trajectory representation that encodes the semantic labels and viewpoint-relative geometry of instruction-referred landmarks. These landmarks serve as spatial references for associating the visited trajectory with executed instruction content. Extensive experiments on R2R, RxR, CVDN, and R2R-CE demonstrate that the proposed method achieves favorable performance across multiple metrics.
[CV-85] Volume Rendering with Metric–Phase Fields for Thin Structures and Sign-Ambiguous Geometry
链接: https://arxiv.org/abs/2610.13088
作者: Junkai Deng,Jiayi Kong,Xuhui Chen,Guanli Hou,Fei Hou,Junhui Hou,Wenping Wang,Ying He
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Neural implicit surface methods that couple volume rendering with signed distance functions (SDFs), such as VolSDF and NeuS, achieve high-quality multi-view reconstruction for watertight objects. However, these approaches rely on a globally consistent inside-outside partition of space. This assumption becomes fragile for thin structures (e.g., sheets, tubes, and thin walls) and can break down for sign-ambiguous geometry (e.g., surfaces with boundary, non-manifold junctions, and closely spaced surface components), often resulting in spurious closures or loss of fine structures. Unsigned distance field (UDF) formulations relax the global sign requirement and better support non-watertight geometry, but are substantially harder to optimize. We propose PhaseSurf, a neural volume rendering framework built on Metric-Phase Fields (MPFs). MPFs decompose geometry into a nonnegative metric field capturing unsigned proximity and a continuous phase field providing a soft sign cue. By coupling the two through residual phase injection, MPFs yield a signed composite implicit function with stable near-surface gradients while retaining UDF-like robustness in sign-ambiguous regions. This design enables direct iso-surface extraction using standard Marching Cubes and avoids the failure modes of both pure SDF- and UDF-based formulations. We further introduce MPF-specific training losses that enforce metric consistency, stabilize phase transitions near the interface, and suppress spurious geometry in free space. Experiments on multi-view datasets with thin structures and sign-ambiguous geometry show that PhaseSurf produces more stable reconstructions and higher-quality geometry than UDF-based methods and recent 3DGS pipelines, while avoiding artifacts typical of SDF-based approaches.
[CV-86] AV-FlowEdit: Training-Free Prompt-Driven Audio-Visual Editing with Event-Aware Spectral Trajectory Preservation
链接: https://arxiv.org/abs/2610.13072
作者: Shaohua Pan,Xiao Liu
类目: ound (cs.SD); Computer Vision and Pattern Recognition (cs.CV); Audio and Speech Processing (eess.AS)
备注:
Abstract:Joint audio-video diffusion models generate synchronized content, but editing existing clips requires target changes without disrupting non-target structure or cross-modal correspondence. We present AV-FlowEdit, a training-free and inversion-free framework for prompt-driven audio-video editing. Our key insight is that source–target flow differences provide both cross-modal editing directions and preservation cues. Under shared perturbations, they jointly update the video and audio branches, supporting visual-only, audio-only, and joint edits while retaining pretrained cross-modal interactions. To suppress drift accumulated during sampling, Cross-Modal Event-Aware Spectral Trajectory Preservation combines flow saliency, aligned audio activity, multiscale low-frequency displacement, and diffusion-stage scheduling. This adaptively preserves unsupported regions while allowing intended audio-visual events. AV-FlowEdit requires no model training, external masks, or optimization-based inversion. Experiments show strong prompt alignment and temporal consistency, together with competitive audio quality and cross-modal coherence.
[CV-87] Evolving Creatives with Clicks: CTR-Driven Advertising image Editing via Attribute Disentanglement and Preference Alignment
链接: https://arxiv.org/abs/2610.13066
作者: Xu Zhang,Haohan Wang,Zheng Zhang,Yingjie Xia,Wei Feng,Honghe Zhu,Jingjing Lv,Changping Peng,Xuheng Qin,Zehua Zhang,Zheng Luo,Qicheng Li
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:The optimization objective for e-commerce advertising creatives has shifted from aesthetic quality to online business metrics like click-through rate (CTR). Recent methods generate appealing ad images from product images by constructing CTR-based reward signals and refining prompt generation via Reinforcement Learning. Such paradigms equally penalize all attributes within an underperforming image, even though some are actually beneficial to clicks. In this work, we propose Evolving Creatives with Clicks (ECC), which reformulates creative optimization as fine-grained editing rather than generation from scratch. ECC selectively refines attributes that hurt CTR while preserving those that contribute positively. Specifically, faced with a rich attribute space across massive images, ECC first identifies 28 attributes significantly correlated with CTR via ANOVA and Random Forest regression. Based on attribute contrasts between images with disparate CTRs, we instruction-tune a prompt model to generate editing suggestions, then refine it with real click preferences since reference-derived suggestions are not uniformly beneficial. Furthermore, we introduce Consistent Preference Optimization (CPO) as ECC’s preference optimization strategy, which enforces consistency across semantically equivalent shuffled suggestions to mitigate DPO overfitting and improve preference generalization. Extensive experiments demonstrate that ECC significantly improves the CTR of ad images, outperforming state-of-the-art models by a substantial margin. The complete data pipeline, including attribute extraction and analysis, the resulting dataset, and source code will be released upon acceptance.
[CV-88] A4-MR: Abnormality-aware Anatomical Alignment for MR
链接: https://arxiv.org/abs/2610.13056
作者: Noel D’souza,Zhijian Yang,Nishank Singla,Pranay Doshi,Krisztian Koos,Fei Tan,Bruno Nunes,Laszlo Rusko,Bernadett Kolozsvari,Eszter Sabo,Emanuele Valeriano,Vikash Gupta,Seyed Iman Zare Estakhraji,Marc Lebel,Farzin Haddadpour,Taha Kass-Hout,Erhan Bas
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Recent advances in large-scale foundation models have enabled strong generalization across a wide range of clinical and research tasks in magnetic resonance imaging (MRI). However, existing vision-language MRI models remain limited in anatomy-specific localization and pathology-aware representation, particularly in real-world settings. We introduce A4-MR, a 3D vision-language foundation model trained on approximately 50,000 MRI studies comprising 491,000 series, roughly half of which are paired with radiology reports. A4-MR is designed to: (1) learn anatomy localization through large-scale pretraining with noisy labels; (2) align image and text representations at the anatomical level; and (3) learn distinct representations of healthy and abnormal anatomy. Across a diverse set of downstream tasks, A4-MR outperforms existing foundation models, including a +1.7 AUROC improvement over MedSigLIP for abnormality detection. Using a frozen encoder, A4-MR also surpasses an end-to-end task-specific MedNeXt model for knee segmentation by +1.4 Dice and performs comparably to the best task-specific model for abdominal organ segmentation on AMOS, within 0.4 Dice. Finally, without anatomical prompts, A4-MR localizes 3D anatomy comparably to MedSAM2 provided with ground-truth bounding boxes. Together, these results demonstrate that anatomy-level multimodal alignment and abnormality-aware representation learning can enable a single MRI foundation model to support localization, segmentation, and pathology-related tasks.
[CV-89] UniMergeTrack: Hierarchical Model Merging for General RGB-X Visual Object Tracking
链接: https://arxiv.org/abs/2610.13053
作者: Shiao Wang,Xiao Wang,Yuhe Ding,Jiarui Xu,Zikang Yan,Bo Jiang,Yonghong Tian,Jin Tang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:RGB-X tracking leverages complementary modalities, such as thermal infrared, event, or depth, to improve robustness under challenging conditions. Existing general-purpose RGB-X trackers typically follow two paradigms: independent task-specific training and joint training across modality combinations. However, the former suffers from knowledge isolation and model redundancy, while the latter introduces optimization interference across heterogeneous tasks. In this work, we present UniMergeTrack, a new model merging paradigm that preserves task-specific optimization while enabling effective cross-task knowledge integration. UniMergeTrack first trains modality-specific trackers independently and then performs hierarchical model merging. Specifically, transferable backbones are merged across RGB-X tasks via high-pass-filtered merging, and complemented by lightweight task-specific experts that preserve modality-specific cues. Tracking heads are merged within each task using optimal transport-guided channel alignment to mitigate hidden channel mismatch. A subsequent distribution alignment fine-tuning stage further improves compatibility between the unified backbone and task-specific heads. Extensive experiments on the LasHeR, RGBT234, VisEvent, VOT-RGBD22, COESOT, and CDTB benchmarks demonstrate that UniMergeTrack achieves state-of-the-art or competitive performance across RGB-Thermal, RGB-Event, and RGB-Depth tracking tasks, while exhibiting strong generalization to unseen datasets. The source code will be released upon acceptance. The source code of this paper will be released on this https URL.
[CV-90] Space Over Statistic Retraining Over Ranking: Auditing Training Labels Under Label-Only Backdoors
链接: https://arxiv.org/abs/2610.13051
作者: Arnab Dey,Mohammad Mahfuzul Islam
类目: Cryptography and Security (cs.CR); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 18 pages, 10 figures, 10 tables
Abstract:Some backdoor attacks never touch an image. FLIP only changes labels: on CIFAR-10, flipping 3% of them makes a ResNet-32 send 99.7% of triggered source-class images to the attacker’s class. The usual defenses look for the poison inside a model trained on those same labels. So when they struggle, is the problem the test they run, or the space they run it in? We answer with a controlled swap: we keep the test, the labels and the metric fixed, change only the feature space, and judge each defense by retraining the victim on what it keeps. The space decides. On dog \to cat the same nearest-neighbor check scores AUROC 0.546 on the poisoned model’s features, 0.967 on frozen DINOv2 features that never saw a label, and 0.995 on the same network trained on clean labels, an oracle control rather than a defense. We reproduce SPECTRE, the defense FLIP’s authors recommend, to 90.94 / 0.97 against its published 91.47 / 1.7, then price it: on truck \to deer it deletes 20% of every class, while a prototype audit on the frozen features deletes 6% for higher clean accuracy and lower attack success. On three harder pairs that audit leaves about a quarter of the attack standing. A count read off encoder geometry and clean labels, before any attack is run, separates the pair where the audit removes the attack from those where it only partly does, though on a single zero-count pair. Three results warn against the easy story. A better detection score does not mean a safer model: on two of four pairs Confident Learning scores the higher AUROC, and on dog \to cat leaves 2.6 times the attack success. The prototype family, our best static performer, is the first an adaptive attacker slips past. And past a point, catching more poisons stops reducing attack success. Check labels in a space that never learned them, and judge a defense by the retrained model, not by its detection score. Comments: 18 pages, 10 figures, 10 tables Subjects: Cryptography and Security (cs.CR); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG) Cite as: arXiv:2610.13051 [cs.CR] (or arXiv:2610.13051v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2610.13051 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[CV-91] NOFACE3D: NOise-scheduled Focused Anchoring and Controlled Enhancement for 3D Generation
链接: https://arxiv.org/abs/2610.13050
作者: James Rose,Jingwen Liang,Wenchao Ma,Oren Jacob,Haomiao Jiang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Recent image-to-3D models generate complete, high-quality assets from a single image, with global shape and appearance that are already convincing; what remains is the fine scale, where small, thin, elongated, or detail-rich regions are reconstructed softly and under-resolved. This gap can arise in generators with fixed-resolution spatial grids: the same spatial sampling density is used for a large, smooth, low-curvature surface and for a thin, high-curvature structure that carries most of the perceived detail. To this end, we introduce NOFACE3D, a training-free framework that refines these detail-critical regions while preserving the rest of the asset. Given a generated mesh, its input image, and a refinement box, NOFACE3D extracts the selected submesh, scales it up to fill the generator’s input volume, and re-encodes it into the full-resolution latent grid. Conditioned on the image crop, it refines the region through flow-based sampling with a spatially varying noise schedule that anchors boundary latents. The refined region is then integrated back into the original asset, preserving the surrounding geometry and appearance. We implement NOFACE3D on TRELLIS.2 and its sparse voxel representation; all of it operates purely at inference time on the frozen pretrained generator. We evaluate NOFACE3D on PAniC-3D, TexVerse and BigDetail, a new benchmark of 339 assets with annotated detail-critical regions. On all three, it generates sharper geometry and finer texture detail than the baselines. Project page: this https URL
[CV-92] Redirecting Teacher Supervision: Temporal-Response-Guided Latent Distillation for Video-Language Models
链接: https://arxiv.org/abs/2610.13045
作者: Xinkai Lu,Junli Zha,Haolan Wei,Jiahui Wang,Chao Zhou,Xiang Song
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:On-policy distillation (OPD) transfers capabilities through teacher predictions on student-generated sequences, as studied by GKD and MiniLLM for language models and Video-OPD for video tasks. We ask how internal supervision can further support temporal learning. Direct hidden-state alignment does not explicitly use the student’s temporal responses to choose a supervision direction. We propose Temporal-Response Guidance (TRG), which measures representation responses to local temporal perturbations, adds the teacher correction’s projection onto their span back to the original correction, and restores its original norm. The projection is not normalized separately, and correction components outside the response space are retained. With an orthogonal tangent projector and a detached target, TRG changes the supervision direction while preserving the cosine-loss value and aligned-representation gradient norm at target construction. On TempCompass, Video-MME, MVBench, and Video-MMMU, TRG improves the 4B student’s macro accuracy by 2.86 percentage points over the reported output-only OPD baseline.
[CV-93] Dataset-Specific Encoding of Image Content Underlies Cross-Dataset Failure in Brain MRI Foundation Models
链接: https://arxiv.org/abs/2610.13027
作者: Minh Sao Khue Luu,Bair N. Tuchinov
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Frozen features of brain MRI foundation models lose accuracy on new datasets, a failure usually blamed on the features encoding where each scan came from. We show that the failure lies elsewhere. Across 17 public datasets and eight frozen representations, every representation recognizes the MRI sequence within each dataset, yet most fail on an unseen one. The cause is neither dataset encoding nor a shift of each dataset: the content itself is encoded along different directions in each dataset. This explains which datasets fail, for the sequence and for sex, and why removing the dataset signal with INLP, LEACE, CORAL or adversarial training never improves sequence transfer. Only the broadly pretrained 3DINO and SAM-Med3D encode the sequence consistently enough to transfer; the brain-specific BrainIAC and BrainFM do no better than an untrained network. Code is available at this https URL.
[CV-94] What Visual Representations Do World Action Models Need?
链接: https://arxiv.org/abs/2610.13024
作者: Kai Liu,Jiangran Lyu,Tingyu Deng,Yixin Zheng,Jingtian Wan,Wenbo Cui,Mi Yan,Yizhou Zhou,Haoran Li,Dongbin Zhao,Zhizheng Zhang,He Wang
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注: 24 pages. Project page: this https URL
Abstract:World Action Models (WAMs) inherit powerful priors from pretrained video generation models, but their variational autoencoder (VAE) representations are optimized for visual reconstruction rather than manipulation. External visual representations can improve manipulation, but existing methods couple representation choices with different integration mechanisms, obscuring their individual effects. We systematically compare visual representations, five integration mechanisms, and feature combinations under controlled settings. Our study yields three main findings. First, strong general-purpose visual representations provide broader robustness gains and can match or outperform representations pretrained for specific visual capabilities. Second, channel-wise joint prediction achieves the highest average success rate; further analyses suggest that future-feature prediction and the action expert’s effective use of added visual information contribute to its gains. Third, additional sources should be selected for the task-relevant information they contribute beyond existing representations, as the same source can help one combination but harm another. However, even the best evaluated composition provides a smaller additional gain than the initial improvement from adding a strong general-purpose representation to the VAE-only baseline. We instantiate the resulting Representation Recipe as R ^2 -WAM. It achieves state-of-the-art performance on RoboCasa GR1 Tabletop with an 84.7% success rate and reaches 92.8% on RoboTwin 2.0, improving over the VAE-only baselines by 5.9 and 2.2 percentage points, respectively. Taken together, these findings suggest that future work should prioritize stronger general-purpose visual representations and more effective mechanisms for integrating them into WAMs, with feature composition serving as a supplementary route to improvement.
[CV-95] Unified Generative Video Compression with Autoregressive and Bidirectional Video Diffusion
链接: https://arxiv.org/abs/2610.13023
作者: Tianyu Zhang,Shuai Huo,Dengchao Jin,Hewei Liu,Meng Lei,Tianwen Wu,Jiawen Gu,Chao Zhou,Li Li,Dong Liu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Video diffusion models can reconstruct visually compelling content from severely compressed representations at ultra-low bitrates, but they impose a rigid deployment trade-off. Bidirectional (BI) models achieve high quality through dense full-sequence attention, yet require the entire sequence before reconstruction and incur substantial latency. Autoregressive (AR) models enable low-delay streaming, but their restricted temporal context reduces compression efficiency. This tension is particularly relevant when a video stream must be decoded in real time yet is also stored for later, quality-oriented playback, making AR and BI models natural choices for the live and replay stages, respectively. To support both stages, we present UniGVC, a Unified Generative Video Codec that supports two decoding modes from a single bitstream. UniGVC-BI employs a BI-DiT with dense attention for quality-oriented random-access decoding, whereas UniGVC-AR uses windowed AR-DiT for low-delay streaming. Both paths share a hierarchical latent codec that recurrently produces the same conditions with ultra-low bitrates, allowing UniGVC-BI to serve as a conditional teacher for single-step distillation of UniGVC-AR. A tiny conditional video decoder further reduces streaming latency while preserving most of the reconstruction quality. On standard 1080p benchmarks, UniGVC-BI achieves the best overall rate-distortion-perception trade-off among the evaluated methods and produces temporally stable video at rates as low as 0.0005 bits per pixel. Meanwhile, UniGVC-AR remains competitive while decoding 1080p video at 36.85 FPS, over 250\times faster than UniGVC-BI. Code and models will be released later.
[CV-96] Learning Features Not Layouts: Feature-Axis Attention as a Transfer Prior for Medical Imaging ACCV2026
链接: https://arxiv.org/abs/2610.13012
作者: Aon Safdar,Mohamed Saadeldin
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 17 pages, 5 figures. Accepted at ACCV 2026
Abstract:Natural-image-pretrained foundation models are increasingly adapted to medical imaging, yet transfer remains unreliable under domain shift, modality heterogeneity, and label scarcity. We trace part of this fragility to an overlooked design choice. Standard vision transformers place all global modeling on self-attention over spatial tokens, an object-layout prior well suited to natural scenes but not to medical images, where the discriminative signal lies in feature correlations and texture that recur across scanners while layout does not. We ask whether the axis of global attention, spatial versus feature, is itself a lever for transferable medical representations. Existing channel-aware hybrids confound this question, adding channel attention to a spatially-mixed backbone and leaving the axes coupled and the feature axis unmeasurable in isolation. We design FAD-ViT, a backbone that strictly decouples the two axes, making feature-axis attention the primary global operator and the attention axis a controlled variable. Evaluating comprehensively across 23 classification, segmentation, and low-data tasks under matched tokenization, capacity, and protocol, we find that shifting global attention from the spatial to the feature axis leaves from-scratch performance essentially unchanged, yet markedly strengthens transfer. Identical ImageNet pretraining yields up to roughly three times the transfer gain, with consistent improvements on every held-out segmentation task at up to a quarter the parameter count and far lower compute than standard and channel-attention baselines. The advantage is largest where texture rather than geometry is discriminative, tracking greater reuse of pretrained features. The axis of global attention is thus a design lever for medical transfer, and making it channel-primary is a simple, cheap, and principled choice.
[CV-97] he Evidence Anchoring Boundary: Where Visual Interventions Matter and When They Help in Multimodal LLM s
链接: https://arxiv.org/abs/2610.12981
作者: Qiji Zhou,Junyi Hu,Peiyu Wang,Yue Zhang
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)
备注:
Abstract:Visual interventions provide a training-free way to reduce hallucinations in multimodal large language models. However, an intervention may have little leverage at some layers and may damage a correct answer even when it changes the output. We investigate where visual interventions retain leverage and when they improve predictions. First, we apply the same visual-residual edit at successive decoder layers, matching its RMS strength across depth. Across six checkpoints from three model families, we observe a persistent drop in intervention effect and define its operational onset for this edit as the \textbfEvidence Anchoring Boundary (EAB). With boundaries fixed on calibration queries, held-out effects on disjoint evaluation queries before EAB are 13.78\times – 26.10\times larger than those after it. Comparison with intermediate readouts shows that the edit can lose leverage before answer preferences stabilize. Second, we compare counterfactual subtraction across presence, attribute, and relation questions. Subtraction can correct a misleading preference, leave a decision unchanged, or remove a preference supporting the correct answer. Based on these observations, we develop calibrated selective routing, which preserves the original prediction unless calibration supports an intervention for the question type. It improves full-set attribute accuracy by 1.56 – 1.81 percentage points across three checkpoints, while universal subtraction is neutral or harmful.
[CV-98] Learning Representations to Guide Pixel Diffusion Transformers
链接: https://arxiv.org/abs/2610.12978
作者: Zihao Pan,Mengting Chen,Cheng Shi,Taihang Hu,Zhengrong Yue,Zikang Wang,Yuan Wang,Wei Li,Sibei Yang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 26 pages. Code: this https URL Project page: this https URL
Abstract:Visual representations are largely developed for understanding, yet what makes them useful for generation remains unclear. We study this question in pixel diffusion transformers and uncover two key insights. First, better representation quality does not necessarily translate into greater generative utility, as externally aligned semantics can be progressively lost during pixel synthesis. Second, architectural separation with specialized pixel decoders mainly redistributes semantic and spatial modeling, without necessarily yielding representations better suited to generation. These insights suggest that a useful generative representation must be both properly formed and actively exploited. Motivated by these insights, we introduce Representation Guidance (RG), which directly forms and exploits internal representations while retaining a plain Transformer architecture. A low-dimensional bottleneck forces generation-relevant information into a compact representation, which is then explicitly used to guide decoder generation by modifying the flow-matching target according to its induced prediction offset. RG learns clearer semantic and spatial structure while scaling efficiently in both parameters and computation. On ImageNet 256x256, RG-L/16 with only 459M parameters outperforms substantially larger pixel diffusion transformers, while RG-XL/16 achieves an FID of 1.55. RG further reaches an FID of 1.74 at 512x512 and extends to text-to-image generation, achieving 0.89 on GenEval and 87.1 on DPG-Bench.
[CV-99] MotionCoach: Constructing Multimodal Guidance for Video Professional Motion Editing
链接: https://arxiv.org/abs/2610.12963
作者: Siyi Qian,Hanqing Yang,Weihuang Lin,Zihao Yang,Yichen Lu,Yuanhong Zheng,Sheng Li
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Multimedia (cs.MM)
备注:
Abstract:Video editing models achieve strong performance in modifying appearance, backgrounds, styles, and motions, empowered by large-scale training data. Beyond general scenarios, professional motions are significant in performance, sports, and martial arts. This paper focuses on professional motion editing, which involves fine-grained motion technique and temporal structure. Given professional motion names but lacking detailed descriptions, existing models often fail to generate professional motions, such as incorrectly lifting the front wheel under a Stoppie instruction. To address this challenge, we introduce MotionCoach, a trained multimodal agent that uses multi-turn tools and performs self-verification, producing a grounded prompt and a reference clip as reliable and sufficient multimodal guidance to inject external professional motion knowledge into video editing models. To supply training data, we build a data pipeline to construct trajectories. We cold-start the agent on MotionCoach-SFT-10k and apply Group Relative Policy Optimization (GRPO) on MotionCoach-RL-2k with rewards on the motion guidance prompt, the motion outcome video, and the format. For evaluation, we introduce VPMEBench, comprising 314 professional motion editing tasks with fine-grained references and annotations. Extensive experiments show that MotionCoach improves the overall score from 55.1 to 65.6 on Seedance 2.0 and from 51.2 to 64.5 on MiniMax-H3. Learning to construct multimodal guidance enables precise professional motion editing without retraining video editing models.
[CV-100] Video Codec-Guided Training-Free Token Compression for Video Large Language Models
链接: https://arxiv.org/abs/2610.12959
作者: Xihua Sheng,Ruijie Liu,Chang Wen Chen
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Video large language models (VLLMs) rely on long visual token sequences to understand complex temporal content, which makes visual token compression important for efficient inference. Existing training-free compression methods mainly reduce the number of tokens sent to the language model, but the compression process itself can still require many visual feature comparisons, especially for intra-frame token protection and inter-frame temporal token merging. This paper proposes a video codec-guided training-free token compression method for VLLMs that uses coding information already available in compressed video as a low-cost search prior. The method aligns reference-frame dependencies, motion vectors, and residuals with the visual token grid. Residual information forms compact candidate pools for token protection, while motion information is propagated along reference-frame chains to construct localized candidates for temporal token merging between sparsely sampled frames. Local visual feature similarity comparison is then used within these candidates to make the final compression decisions, without modifying the base VLLM. Experiments on three representative VLLMs and four video-understanding benchmarks show that the proposed method achieves performance comparable to the state-of-the-art training-free baseline FlashVID, and in some settings surpasses it, while substantially reducing the feature comparisons required by token protection and temporal matching. These results demonstrate that codec information can effectively improve the accuracy-complexity tradeoff of video token compression.
[CV-101] WaveMark: Robust Wavelet-Domain Image Watermarking for Diffusion Models
链接: https://arxiv.org/abs/2610.12952
作者: Jie Cao,Qi Li,Chaklam Cheong,Yutong Jin,Enze Yu,Zelin Zhang,Jianbing Ni
类目: Cryptography and Security (cs.CR); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Image watermarking enables provenance tracing for photorealistic images generated by diffusion models. However, state-of-the-art (SOTA) removal attacks can suppress embedded signals with little perceptual degradation. This vulnerability limits the effectiveness of watermarks for intellectual property protection and misuse attribution. We propose WaveMark, a novel wavelet-domain watermarking method that embeds messages in a diffusion model’s initial noise. To support robust recovery from perturbed carriers, WaveMark distributes keyed replicas of message bits across spatial positions, wavelet orientations, and scales. Each carrier groups coefficients from four latent channels and encodes a randomized bit through magnitude projection, providing an explicit decoding margin. We evaluate WaveMark with SD2.1 on SDP and MS-COCO Captions under 14 attacks. WaveMark achieves 100.0% bit accuracy (BA) without attacks, while maintaining image quality comparable to the evaluated baselines. Under SOTA MarkNull and MarkNull-A, it retains over 88% BA, outperforming all baselines.
[CV-102] In-Context Learning Can Help Vision-Language Models Overcome Training Priors
链接: https://arxiv.org/abs/2610.12942
作者: Kun Wang,Xindi Wu,Sanghyuk Chun,Olga Russakovsky,Esin Tureci
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Vision-language models (VLMs) learn strong statistical regularities during training, which can make them fail to properly respond to visual evidence when input images violate those regularities. It is challenging to disambiguate these prior-induced errors from errors caused by the model missing the underlying visual capabilities. In this work, we use controlled visual in-context learning to encourage the model to focus on the visual evidence, and demonstrate that this alone is frequently sufficient to correct the errors – suggesting that the models in fact do possess the relevant visual capabilities. Specifically, we show that across five vision-centric tasks, demonstrations yield large gains on prior-conflicting counterfactual examples ( +27.2% for Qwen3-VL 235B and +15.1% for Qwen3-VL 32B) while leaving accuracy on prior-aligned examples nearly unchanged. These findings generalize across five VLM families with gains from +9.7% to +30.3% . We analyze visual representations and find that demonstrations indeed redirect attention toward grounding cues while reducing reliance on cues that support the learned prior. Finally, we find that in-context learning is limited when the underlying visual capability is weak or absent. Together, these results show that current VLMs possess visual grounding capabilities that standard evaluations may overlook, underscoring the need for controlled evaluation design in diagnosing and improving model capability.
[CV-103] UniDeblur: Unified Motion Deblurring via Fourier Convolution Learning
链接: https://arxiv.org/abs/2610.12941
作者: Xintian Mao,Jiansheng Wang,Huaiyuan Wang,Qingli Li,Yan Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Image deblurring is a fundamental task in computer vision, yet existing methods mainly specialize in isolated scenarios. Consequently, the deblurring performance of these models drops significantly across scenarios with different cameras and image contents. This motivates the development of a unified motion deblurring framework that can handle diverse blur patterns. To this end, we construct a multi-source dataset and develop a data pruning and quality control pipeline. Then, to restore blur images with various motion blur kernels across different scenarios, we propose a unified motion deblurring framework via Fourier Convolution Learning. Existing deblurring networks usually rely on pixel-level mappings and overlook the convolutional nature of blur. Thus, the network mostly fits the image content itself rather than learning the convolution process, making it difficult to handle multi-source blur images. Instead of relying on spatial mapping, we perform blur-adaptive global filter learning in Fourier space, which avoids the limited spatial support of kernel estimation. Extensive experiments demonstrate that our unified model effectively handles motion blurs across diverse sources and scenes, achieving competitive performance across both in-domain and OOD benchmarks. Code will be released at this http URL.
[CV-104] What Egocentric Video Embeddings Encode and How to Combine Them with Inertial Sensors for Human Activity Recognition
链接: https://arxiv.org/abs/2610.12926
作者: Kansuke Habano
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 31 pages, 11 figures, 11 tables. Solution to the 3rd WEAR Dataset Challenge @ HASCA 2026
Abstract:Egocentric video and body-worn inertial sensors are increasingly recorded together, and the video is usually encoded by pretrained models. What these embeddings represent when the camera sits on the head, and how they should be combined with inertial sensing, has received little attention. Across VideoMAEv2, CLIP, DINOv2 and the egocentric VC-1, the leading principal directions of the embedding are dominated by where the camera looks. Measured head orientation explains them on Ego-Exo4D for egocentric (R^2 0.49-0.70) but not exocentric cameras, and the scene layout explains them on WEAR. The part that the limbs’ inertial signals predict separates activities across people. In a set-level probe, the rest separates exercise sets within a participant but not activities across people. This is consistent with separate roles: the video finds the clips of the same set, and the inertial classifier labels them. On WEAR, with temporal order removed and one random limb per one-second clip, we propagate inertial predictions over a within-participant video graph whose leading components are removed. This raises subject-wise cross-validated macro-F1 from 0.648 to 0.852. In our comparisons, propagation helps only over the video graph, and fusing the modalities in one classifier, or adding inertial edges to the graph, performs worse.
[CV-105] BLEND: Balancing Personalization vs. Generalization in Federated Vision-Language Models NEURIPS
链接: https://arxiv.org/abs/2610.12907
作者: Payam Abdisarabshali,Fardis Nadimi,Kasra Borazjani,Naji Khosravan,Richeng Jin,Seyyedali Hosseinalipour
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Accepted in Conference on Neural Information Processing Systems (NeurIPS), 2026
Abstract:Federated vision-language models (FedVLMs) represent one of the emerging frontiers of machine learning, aiming to integrate federated learning within the fine-tuning pipelines of vision-language models (VLMs). In this work, we introduce BLEND, a new framework designed to jointly enhance the personalization and generalization capabilities of FedVLMs. BLEND proposes a selective VLM parameter fine-tuning and aggregation strategy that consists of (i) global vision and text adapters shared across clients, and (ii) a personalized vision projection adapter tailored to each client. BLEND further introduces a novel loss function that blends the outputs of the global and personalized adapters to achieve personalization, while simultaneously promoting generalization through a principled anchor design implemented via the projection heads of the zero-shot VLM. Extensive experiments demonstrate that BLEND consistently outperforms state-of-the-art baselines, highlighting its ability to effectively balance personalization and generalization across diverse system settings. (Code is available at: this https URL)
[CV-106] JMT-YOLO: Multi-task Domain Adaptation via Segmentation-Guided Consistency Learning
链接: https://arxiv.org/abs/2610.12901
作者: Zhenhua Yu,Jiahao Zhang,Wenchao Zhang,Ou Ye,Hengxiang Zhao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Domain adaptive object detection (DAOD) aims to reduce performance degradation due to distribution shifts between training (source) and testing (target) datasets. However, owing to insufficient modeling of fine-grained features and limited instance-level alignment, existing approaches become less effective under complex environmental conditions, such as extreme weather conditions and object occlusion. We overcome these challenges by proposing JMT-YOLO, a novel joint multi-task learning framework for DAOD. JMT-YOLO is based on the Mean Teacher architecture. It introduces an auxiliary semantic segmentation task and a masking mechanism to enhance the modeling of foreground-background semantic boundaries in the target domain. Specifically, fine-grained feature degradation is reduced by introducing a multiscale context-aware segmentation head equipped with a dense connection structure to effectively capture local and global contextual features. A mask-consistency loss is formulated by applying random masking operations to target images, thereby guiding the network to learn structural context and improving instance-level feature alignment. Extensive experiments on three benchmark domain adaptation tasks (Pascal VOC to Clipart1k, Cityscapes to Foggy Cityscapes, and KITTI to Cityscapes) demonstrate that JMT-YOLO achieves detection performances of 46.9%, 57.3%, and 61.0%, respectively. These results demonstrate superior performance over existing state-of-the-art and baseline methods, thereby validating the effectiveness and generalization of JMT-YOLO.
[CV-107] A Lightweight Velocity Correction Framework for Improving Instruction Following in Few-Step Text-to-Image Generation
链接: https://arxiv.org/abs/2610.12899
作者: Yating Gao,Zhenlong Zhu,Wen Zihao,Lenan Zhang,Jiexiong Wang,Yang Yang,Guanjun Jiang,Yixiong Zou,Takuya Maekawa
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Few-step text-to-image generators produce high-quality images with few network forward passes, yet struggle with complex prompts involving multiple subjects, interactions, spatial relations, counting, and attribute binding. Can these errors be reduced without changing the generator’s parameters or increasing its forward-pass count? We propose a lightweight correction framework for a frozen 6B-parameter generator. The generator predicts velocities that determine how its intermediate image representation is updated; a corrector with fewer than 20M parameters learns residual adjustments at selected sampling steps. Because earlier corrections change the states encountered at later steps, our On-Trajectory Flow-Bridge Supervision derives residual targets at the states actually reached during corrected generation. A single corrector is shared across selected steps and runs in parallel with the generator. Only the corrector is trained, requiring neither reward optimization nor re-distillation. To our knowledge, this is the first framework for lightweight velocity-residual adaptation of fully frozen few-step text-to-image generators that preserves their original sampling schedule and forward-pass count. On our target complex-scene distribution, the framework achieves a +17.60-percentage-point NetWin over frozen Z-Image-Turbo in pairwise instruction-following evaluation, with only 26.9 ms (0.84%) additional end-to-end latency per image and no increase in backbone evaluations.
[CV-108] AD-SRF: Attack-Defense Semantic Reinforcement for Multi-Modal Image Fusion
链接: https://arxiv.org/abs/2610.12897
作者: Hao Zhang,Zhiqian Zheng,Linfeng Tang,Xinyu Xiang,Jiayi Ma
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Existing image fusion methods struggle to balance visual quality and semantic attributes due to the inherent conflict between their optimization objectives. To address this challenge, we propose an attack-defense semantic reinforcement framework for multi-modal image fusion, termed AD-SRF. By decoupling the optimization of these two aspects and then losslessly reintegrating them, this framework injects rich semantic attributes into the fused image without compromising its visual quality. First, we develop a transformer-based restorative visual fusion network as a strong visual baseline. Equipped with the cross-modal retrieval module and the information restoration-fusion collaborative loss, it produces highly visible fused images even under degraded conditions. Second, we introduce an attack-defense game mechanism to strengthen the semantic attributes of the fused images. The attacker learns perturbation patterns that impair downstream segmentation, whereas the defender restores missing semantics from the original inputs and reintegrates them into the fused image through an imperceptible semantic map. Through iterative adversarial interaction, this mechanism drives the defender to continually strengthen the fused image’s semantic attributes, boosting downstream segmentation performance without compromising visual quality. Extensive experiments demonstrate that AD-SRF achieves a win-win performance in both visual quality and semantic attributes. The code is publicly available at this https URL.
[CV-109] MeshBind: Point-to-Mesh Binding for Non-Rigid Scene Flow Automatic Annotation
链接: https://arxiv.org/abs/2610.12895
作者: Yinqi Chen,E Li,Shuaijun Wang,Weiyuan Peng,Meiying Zhang,Qi Hao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Scene flow estimation is essential for many autonomous driving (AD) and robotic applications, but obtaining ground-truth scene flow for non-rigid objects such as pedestrians is highly difficult. We present MeshBind, an automatic annotation method that uses mesh models to generate per-point scene flow for non-rigid objects. The novelty of this work is threefold: 1) developing a multi-view module that reconstructs an articulated mesh model from six surround cameras and registers it to the LiDAR frame; 2) developing a local-frame binding technique that attaches each point to the mesh via a per-triangle tangent-normal frame, invariant under rigid motion yet adaptive to articulated deformation; 3) developing a three-layer flow registration pipeline that combines ego-vehicle motion compensation, box binding, and mesh binding to produce full-scene per-point flow. We implement MeshBind in SF-Studio, an interactive annotation tool that visualises flow and allows human mesh corrections with automatic recomputation. We also release SFB (SUScape-Flow Benchmark), a large-scale benchmark built on the public SUScape dataset, covering 41k frames with per-point non-rigid pedestrian annotations and a Rigid/Semi-Rigid/Non-Rigid evaluation protocol. Experiments show that fine-tuning on SFB reduces three-way endpoint error (EPE) by 2-3x, and brings non-rigid EPE to the same level as rigid EPE.
[CV-110] Win-Win Fusion: Multi-Modal Image Fusion with Visual-Semantic Collaboration
链接: https://arxiv.org/abs/2610.12887
作者: Hao Zhang,Xuhui Zuo,Jiayi Ma
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Existing multi-modal image fusion (MMIF) methods generally face an optimization gap between the visual and semantic domains, limiting the enhancement of perception capabilities. To overcome this long-standing barrier, this work proposes W2F, a new visual-semantic mutual reinforcing paradigm for MMIF. First, we reinforce the foundation for visual-semantic collaboration by amplifying feature complementarity through two targeted designs. Specifically, the segmentation-guided fusion loss introduces object-aware structural guidance into visual fusion, while the embedded information restoration prior strengthens the ability of visual fusion to provide reliable perceptual evidence for the semantic branch under degraded conditions. Then, we introduce a strong multi-modal information interaction mechanism composed of interactive gated mixed attention (IGM-Att) and progressive coupling attention (PC-Att). These modules ensure comprehensive scene representation from both local and global perspectives, providing informational support for visual-semantic collaboration. Finally, we construct a collaborative mechanism to couple visual fusion and semantic fusion. It employs a feature search module to extract complementary key features from both tasks, enriching the representational potential of visual and semantic information. Meanwhile, a gradient correction strategy ensures collaboration from the optimization perspective, enhancing performance for both visual and semantic fusion through consistency learning. Extensive experiments demonstrate that W2F surpasses state-of-the-art methods in both visual appeal and decision accuracy. The code is publicly available at this https URL.
[CV-111] ROSETTA: Rotation Subspace Estimation for Training-free Transmodal Alignment
链接: https://arxiv.org/abs/2610.12871
作者: Alex Junho Lee
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 18 pages, including supplementary material. Submitted to IEEE Transactions on Image Processing on March 1, 2026
Abstract:When a query must be matched against a database built with a different sensor or processed by a different encoder, the independently trained encoders impose distinct coordinate systems on the feature space. No canonical reference frame exists to which all encoders can be aligned, and no single training procedure has fully closed this gap. We show that the relative transformation between any two such systems is a spatially preserving rotation in whitened feature space, whose angular velocity exhibits white-noise characteristics: large in norm, temporally uncorrelated, and unpredictable from the features themselves. However, the cross-covariance between encoder outputs has low effective rank, constraining only a small fraction of the rotation parameters, therefore local alignment is tractable. ROSETTA is a training-free calibration layer that estimates the local rotation via an expectation-maximization procedure, requiring no coobservation at query time. We validate ROSETTA on three public driving datasets spanning LiDAR, camera, thermal, and event modalities in cross-modal, cross-device, cross-representation, and cross-backbone settings, with milliseconds overhead per query.
[CV-112] Selective Spatio-Temporal Fruit Inspector (S2FI): A Mamba-based Framework for Rotational Fruit Quality Assessment ICONIP2026
链接: https://arxiv.org/abs/2610.12868
作者: Hao Tian,Jie Hu,Guoqi Shan,Fan Wang,Wenzhuo Zhang,Youshan Zhang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: ICONIP 2026
Abstract:The global fruit and vegetable industry confronts severe post-harvest sorting challenges for small and medium-scale growers. Large intelligent sorting systems are too costly, while manual sorting suffers from low efficiency, inconsistent standards, and high labor demand. To bridge this gap between expensive equipment and inefficient manual work, this study develops a low-cost, high-efficiency, lightweight fruit sorting system driven by deep learning, suitable for small and medium growers. We propose the Selective Spatio-Temporal Fruit Inspector (S ^2 FI) architecture, which combines a 3D convolutional encoder with a Mamba-based this http URL efficiently extracts spatiotemporal features, adaptively weighs informative frames during fruit rotation, and models long-range dependencies with linear complexity, reducing motion blur and occlusion. The hardware uses a dual-conveyor and curved rail design, supporting household power, fast deployment, and lightweight embedded deployment to improve affordability. We also built a conveyor-based fruit quality video dataset with 6,460 samples. Experiments on the held-out test set show that our method achieves the best trade-off among accuracy, efficiency, and practicality, outperforming the compared baselines on the test set, achieving an excellent balance of accuracy, speed, and practicality for real-world sorting.
[CV-113] CaptchaAgent : Verifiable Visual Reasoning for CAPTCHA Solving
链接: https://arxiv.org/abs/2610.12866
作者: Shangquan Sun,Ruoyu Chen,Zhirui Liu,Xiang Liu,Chenghao Qian,Wenqi Ren,Xiaochun Cao
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 12-page main paper with 7 figures and 4 tables; 5-page supplementary material included
Abstract:Modern reasoning CAPTCHAs require fine-grained perception, compositional relation reasoning, and grounded browser interaction. End-to-end vision-language model agents remain brittle in this setting because a missed object, incorrect count, or confused relation can propagate directly to the final action. To address this problem, we present CaptchaAgent, a structured visual reasoning framework for interactive CAPTCHA solving. Instead of predicting an action directly from a screenshot, CaptchaAgent first constructs a visual intermediate representation (V-IR) that explicitly records entities, attributes, and spatial or topological relations. A symbol-only ASCII protocol further requires the parser to commit to a concrete object set and count. Building on this global representation, localized evidence refinement revisits ambiguous regions at higher effective resolution, while counterfactual consistency verification tests whether the resulting action remains stable under task-preserving transformations. Across three proprietary backbones on Open CaptchaWorld, CaptchaAgent improves Pass@1 by 21.3-25.8 percentage points over a commercially available browser agent baseline evaluated with the same backbones. On the separate offline Oedipus-data benchmark, it further improves average Pass@1 by 9.2-12.3 percentage points over the Oedipus solver across three matched backbones. The intermediate traces show that exact counting, continuous geometry, and ordered execution remain major sources of automation difficulty for the evaluated agents, providing practical guidance for designing more resilient compositional CAPTCHAs.
[CV-114] APEX: Asynchronous Prefix Denoising for Extreme Compression
链接: https://arxiv.org/abs/2610.12843
作者: David Dinkevich,Nisan Chiprut,Yoav HaCohen,Dani Lischinski
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 24 pages
Abstract:Fewer latent tokens promise cheaper diffusion. Yet aggressive latent compression creates a reconstruction-generation dilemma: adding channels improves reconstruction but makes generation harder. We introduce APEX, short for Asynchronous Prefix denoising for EXtreme compression, which pairs a hierarchical latent space with asynchronous denoising over channel groups. Our autoencoder orders channel prefixes from structure to detail, while one shared denoiser generates them at staggered local times without adding tokens. On ImageNet-512, APEX outperforms existing methods at every evaluated channel count under 64x and 128x compression. At matched training and guided sampling compute, it also outperforms a 256-token model at every evaluated budget, with larger gains at lower compute. Code is available at this https URL.
[CV-115] Structure-Aware Matching for Robust UAV Thermal-to-Satellite Geo-Localization
链接: https://arxiv.org/abs/2610.12835
作者: Chun Liu,Yuxin Wang,Zhenxiang Huo,Linlin Zhu,Tao Xu,Henggang Han
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:UAV thermal-to-satellite geo-localization localizes UAVs by matching real-time thermal images against georeferenced satellite images, enabling autonomous navigation in GNSS-denied and low-visibility conditions. However, substantial cross-modal disparities in color, brightness and viewpoint hinder conventional appearance-based methods from establishing reliable correspondences. While existing approaches predominantly address global modality shifts, they overlook the invariant scene structures inherently shared between thermal and satellite views. To bridge this gap, we propose SAMF, a Structure-Aware Matching Framework that explicitly exploits stable cross-modal structural cues to improve UAV thermal geolocalization. Specifically, the Directional Structure Enhancement Module (DSEM) strengthens robust structural representations by capturing directional and low-frequency spatial patterns, and the Modality-Aware Affine Remapping Module (MARM) subsequently applies affine correction to these enhanced features, further promoting cross-modal alignment. Additionally, we introduce the Thermal-UAV-Paired benchmark derived from the Thermal-UAV dataset. Extensive experiments on both the Boson-nighttime and Thermal-UAV-Paired datasets show that SAMF achieves state-of-the-art performance. Ablation studies further validate the effectiveness and synergistic complementarity of DSEM and MARM. The code and dataset are released at: this https URL.
[CV-116] Spend Where It Matters: Particle Search with MH Refinement for Budget-Constrained Audio-Visual Alignment
链接: https://arxiv.org/abs/2610.12811
作者: Shivanshu Shekhar,Raghavendra Addanki,Tong Zhang,Uttaran Bhattacharya
类目: Computer Vision and Pattern Recognition (cs.CV); Sound (cs.SD); Audio and Speech Processing (eess.AS)
备注:
Abstract:Reward-guided inference-time alignment can improve joint audio-visual generation, but optimizing multiple alignment objectives requires many expensive model evaluations, making existing methods costly under limited compute. Particle-based search enables global exploration but incurs estimation error with a finite population, while Metropolis-Hastings (MH) can refine candidates locally but benefits from a strong initialization. We introduce \textbfSpend \textbfWhere \textbfIt \textbfMatters (\modelname), a two-stage, training-free, reward-agnostic framework that combines particle search with MH refinement under a fixed compute budget. In the first stage, we adaptively allocate particles across denoising checkpoints using online variance estimates, minimizing estimation variance while concentrating compute where it is most useful. This search provides a promising candidate for MH refinement, which uses local noise-and-denoise proposals on completed outputs to further improve reward. By starting from a strong candidate, MH can recover additional reward without requiring a larger particle population or costly global exploration. We show that, at matched compute, combining particle search with MH refinement achieves higher rewards than either approach alone. On \textscJavisBench-Mini, at closely matched compute, \modelname achieves mean relative gains across seven metrics of 30.7% over BoN and 14.1% over EvoSearch with JavisDiT++, and 9.2% over BoN and 17.0% over EvoSearch with LTX-2. Beyond joint audio-visual generation, we also demonstrate the benefits of adaptive particle allocation on SD1.5 image generation, improving AestheticScore by 2.2% and ImageReward by 6.0% over uniform allocation.
[CV-117] Domain Adaptation of SAM 2.1 for Building-Component Segmentation in Image-Based 3D Reconstruction
链接: https://arxiv.org/abs/2610.12786
作者: Ehsan Agha Ebrahimi,Yong-Cheol Lee,Keith G. Mills
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:3D reconstruction of building components using image-based scanning requires appropriate segmentation of the objects in the 2D building images. In order to benefit from consistent grouping of the 2D masks in 3D environments, vision foundation models such as the Segment Anything Model have been utilized by Group Anything with Radiance Fields (GARField) to perform 3D segmentation. This study fine-tuned SAM 2.1 on the HBD dataset, consisting of 2,679 annotated images from 42 buildings, to enhance multi-class segmentation of 2D building images, covering 11 classes (Wall, Window, Ceiling, Door, Column, Beam, Floor, Opening, Curtain Wall, Roof, and Lift). The model was evaluated using per-class IoU, Dice, and mIoU metrics, and the results show an improvement in mIoU from 49.9% to 69.6%, indicating a meaningful improvement in class segmentation and providing a more accurate model for distilling the masks in 3D. SegFormer was then used as a baseline, generating per-class masks for comparison with SAM 2.1, which indicates improvement in some object classes with larger surface area. The masks in the building images were grouped in the neural radiance field, and the pretrained SAM 2.1 was compared with the fine-tuned SAM 2.1 in the newly rendered images. This comparison shows that fine-tuning improves the grouping of building components at a user-selected grouping scale. This advances the application of Group Anything with Radiance Fields (GARField) in 3D, enabling better segmentation of building structures for 3D auto-reconstruction.
[CV-118] Shift-Aware Identity-Guided Latent Refinement for Referring Audio–Visual Segmentation NEURIPS2026
链接: https://arxiv.org/abs/2610.12783
作者: Kun Li,Sami Sebastian Brandt,Michael Ying Yang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted to NeurIPS 2026
Abstract:Referring Audio–Visual Segmentation (Ref-AVS) is an emergent multimodal task requiring the precise identification and segmentation of a specific object based on a natural language expression grounded in both visual and auditory cues. Unlike traditional AVS, which segments generic sound sources, or referring video object segmentation (Ref-VOS), which relies solely on visual–textual grounding, Ref-AVS necessitates fine-grained tri-modal interaction across vision, audio, and language. However, existing methods often fail to maintain consistency when subjected to target shift, a phenomenon where the model erroneously transfers its focus between objects due to transient occlusions, acoustic fading, or identity ambiguities. To address this, we propose a novel Shift-Aware Identity-guided Latent (SAIL) refinement framework. It introduces a dual-token strategy that decouples frame-level dynamics from a global semantic anchor to explicitly model target-shift cues. We design a shift-aware refinement module that rectifies drift by aligning tokens with domain-specific evidence. Finally, we leverage a decoder that integrates the refined embeddings with a continuous memory update to maintain spatio-temporal coherence and identity consistency throughout the video sequence. Extensive experiments conducted on two Ref-AVS benchmarks demonstrate the effectiveness of our proposed method, significantly outperforming existing AVS, Ref-VOS, and Ref-AVS approaches. The code will be released after publication.
[CV-119] Kernelized Parameter Sensitivity Atlases for Amortized Conditional Interpretability
链接: https://arxiv.org/abs/2610.12737
作者: Davide Wiest,Ahanaf Hasan Ariq,Abdul Monaf Chowdhury
类目: Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (stat.ML)
备注: 22 pages, 10 figures. Code: this https URL
Abstract:Gradient-based attribution provides input-specific information about model parameters, but computing it via backpropagation for many samples is expensive, while static importance scores discard input dependence. We derive KPSA (Kernelized Parameter Sensitivity Atlas) from a block decomposition of the empirical neural tangent kernel. It measures normalized parameter-group sensitivity, embeds those sources in an explicit query space, and uses a lightweight kernel to estimate sensitivities for unseen inputs. We derive bounds that separate finite-source from irreducible representation error and give margin-based top- k recovery. This paper studies two interpretability applications. Firstly, KPSA identifies parameter groups with high susceptibility to perturbations across vision, forecasting, and protein-modeling setups. Across a fivefold range of parameter budgets ( 0.02 - 0.1% ), its selected groups attain 39 - 85% of the perturbation susceptibility of a first-order backpropagation oracle. In vision and forecasting, these parameter groups form sparse sensitivity circuits that extend across depth and vary systematically with the input. Secondly, we use KPSA on an activation-attribution problem for MLP features in transformers. It retains 81% of the gap between a backpropagation oracle and a constant-sensitivity baseline on vision while increasing batched query-time throughput from 551 to 2,041 images/s and reducing peak GPU memory from 4.55 to 0.44GB. On the protein-modeling task, it recovers 68% of this gap. An ablation of KPSA’s kernel aggregation shows that nearest-neighbor retrieval in KPSA space can remain competitive. The empirics show that compact kernel atlases can store useful input-dependent parameter sensitivity while amortizing repeated gradient attribution, a step toward scalable conditional interpretability. Code can be found at this https URL .
[CV-120] Reference-Free Food Volume Estimation from Egocentric Stereo Video
链接: https://arxiv.org/abs/2610.12735
作者: Vivan Kumar,Gautham Vinod,Fengqing Zhu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: 9 pages, 4 figures, 1 table
Abstract:Current stereo vision-based approaches for food portion estimation are hindered by the user burden of using a mobile phone to capture multiple images or placing a reference object in the scene for scale calibration. As a step towards passive dietary intake monitoring, we introduce a method that uses stereo video from a wearable egocentric device to reconstruct food items in true physical scale to accurately estimate volume. By utilizing FoundationStereo for zero-shot stereo matching, SAM 2 for food segmentation, and TSDF fusion over a set of keyframes, our method yields a visually and metrically accurate 3D mesh of any plated food item from a single stereo recording. We leverage the unique offerings of wearables, such as a factory-calibrated stereo baseline and camera poses estimated on-device via visual-inertial odometry (VIO), to perform fully automatic reconstruction without a scale reference object in the scene. We show strong initial volume estimation results across five recorded food items, achieving a mean absolute percentage error of 9.1%.
[CV-121] StereoEngine: Scaling Stereo Bimanual Robot Data without Stereo Cameras
链接: https://arxiv.org/abs/2610.12734
作者: Jason Chen,I-Chun Arthur Liu,Gaurav Sukhatme,Daniel Seita
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Stereo vision is increasingly used for robotic manipulation, with a growing body of work incorporating it into Vision-Language-Action (VLA) models. However, the scarcity of large-scale, real-world stereo datasets remains a fundamental bottleneck for scaling such policies. Recent generative monocular-to-stereo methods target settings such as VR content and autonomous driving. No prior work produces realistic synthetic stereo data for robotic manipulation, where stereo supervision has come predominantly from simulation. We propose StereoEngine, which introduces two complementary methods to synthesize stereo data for robotic manipulation. In the first, we warp a monocular (left) video into the right view using estimated depth and inpaint the disoccluded regions with a video diffusion model, lifting monocular demonstrations into stereo pairs without training on real stereo. In the second, we render a stereo pair in simulation and jointly generate both photorealistic views, producing consistent left-right data without any real video as input. StereoEngine outperforms existing baselines in generated stereo quality, and using its synthetic data for policy mid-training or task-specific fine-tuning substantially improves downstream bimanual manipulation. Project website: this https URL
[CV-122] Zebra3D: Efficient Hybrid Foundation Models For Scalable 3D Reconstruction
链接: https://arxiv.org/abs/2610.12727
作者: Utkarsh Saxena,Ruijing Yang,Mehdi Rezagholizadeh,Akash Haridas,Vikram Appia,Emad Barsoum
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 37 pages, 12 figures, 22 tables
Abstract:Feed-forward 3D foundation models reconstruct scenes from unposed images, but the quadratic cost of global attention limits their scalability to large view sets. We present Zebra3D, a layerwise sparse-linear hybrid attention framework that improves the efficiency of pretrained 3D foundation models without training from scratch. Across VGGT, HunyuanWorld-Mirror, and \pi^3 , we observe a broadly consistent depth-wise pattern: early stages are relatively tolerant to linear replacement, while sensitive middle-to-late stages tend to exhibit more concentrated attention. Zebra3D exploits this structure by assigning linear-centered attention to tolerant stages and tile-sparse attention to sensitive stages, using landmark summaries to preserve unselected context. Closed-form affine fitting enables training-free conversion, while optional post-conversion training combines task supervision with output and relational feature distillation. Across all three backbones, Zebra3D achieves strong reconstruction and camera-pose accuracy at high attention sparsity, with training-free variants remaining close to their dense counterparts. End-to-end speedups increase with input view count, reaching up to 7.1\times at 1,024 views. After post-conversion training, Zebra3D-VGGT reaches 80.5% RealEstate10K AUC@30 at 94% mean attention sparsity, within 1.1 percentage points of dense VGGT fine-tuned on the same data and schedule.
[CV-123] WoodBR-Cross: A public wood-image dataset and individual-tree-disjoint benchmark for species identification
链接: https://arxiv.org/abs/2610.12676
作者: Daniel Casanova,Alexandre Bahia Gontijo,Arnaldo Candido Junior,Silvana Nisgoski,Pedro Luiz de Paula Filho
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Wood-image benchmarks can yield optimistic estimates when images from the same tree occur in both training and test sets. WoodBR-Cross contains 4,875 transverse-surface images in 38 operational taxonomic classes, linked to 303 distinct trees identified by numeric catalogue witness codes (codigos-testemunho) in the Brazilian Forest Service collection. A species-level subset comprises 3,406 images, 20 classes and 214 trees. Three tasks compare duplicate-aware image partitions for all classes (A), image partitions for the species subset (B1), and individual-tree-disjoint partitions for that subset (B2). In B2, all images from each tree are kept together, so no tree is shared across training, validation or test within a fold. ResNet-50, ConvNeXt-Tiny and ViT-B/16 were evaluated with three outer folds, internal validation and five training seeds. Handcrafted and frozen-feature baselines complement border-only and randomized-label controls. Validation-selected ConvNeXt-Tiny achieved B2 tree-level macro-F1 of 0.8621 +/- 0.0317; frozen DINOv2 features yielded 0.9000 +/- 0.0722. Values are means and standard deviations across three seed-averaged fold means. Results estimate performance on previously unseen trees from this collection.
[CV-124] Feature Competition and Its Representational Origins in Vision Language Models: Evidence from the Stroop Paradigm
链接: https://arxiv.org/abs/2610.12650
作者: Nurbüke Teker,Rui Xiao,Zeynep Akata,Shuchen Wu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:When you ask a vision-language model (VLM) a question with an image, it answers your question based on the image. But to act means to choose: saying one thing means choosing to respond not say another. This becomes an issue when the image contains multiple features that equally relate to the question at hand: how would VLMs choose to respond? This problem is precisely studied by the classical Stroop task in psychology: among a set of deliberately designed images whose text and color conflicts (e.g., \textcolorblueRED), participants are instructed to report the color. We adapt this psychological paradigm to a benchmark and prompted a range of contrastive and generative VLMs on their behavior. Across models, we observe a persistent bias toward the feature of text in Stroop images: when text and color disagree, models preferentially generate responses centered to the text rather than color. We then opened the black box and examined the source of this bias and why certain features influences the model’s behavior more than others. In the embedding space, we found that textual cues are represented more strongly and separably than color cues. This representational asymmetry predicts intervention success: steering models toward text-related directions is substantially easier than steering them toward color-related directions. Using a classical psychological paradigm, we demonstrate, at both behavioral and representational levels, that distinct features within the same image can exert unequal influence on VLM behavior. Our findings suggest that VLMs assign different degrees of saliency to different features within the same image, highlighting the need to understand how cue-specific saliency shapes their performance in widely used downstream applications.
[CV-125] ForcingBooster: Adaptive Patch-wise Denoising for Fast Autoregressive Video Diffusion
链接: https://arxiv.org/abs/2610.12625
作者: Zekai Gu,Peng Wang,Jiahao Lu,Yongsen Mao,Cheng Lin,Yuan Liu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Project page: this https URL
Abstract:Autoregressive video diffusion models have become a leading approach to real-time interactive video generation and video world modeling. However, existing methods typically allocate computation uniformly across space when generating the next video chunk, updating all patches with the same denoising schedule and number of function evaluations. This ignores the spatial heterogeneity of video content: static, simple, or recurring regions are often easier to denoise, while other regions require further refinement or additional context. A uniform budget thus leads to redundant computation on easy patches, whereas reducing the fixed step count can leave difficult patches insufficiently refined. We introduce \methodname, a general framework that dynamically allocates denoising steps to individual patches: easy patches stop early to improve efficiency, while difficult patches receive more refinement steps. This design accelerates generation with negligible quality degradation. Our method is compatible with most existing few-step autoregressive diffusion models, requiring only a lightweight routing module with modest training. Experiments demonstrate that \methodname reduces the total number of denoising steps applied across video patches by about 50% while maintaining visual quality comparable to the four-step baseline.
[CV-126] MemReg: Streaming Outdoor LiDAR Point Cloud Registration with Hybrid Memory Buffers NEURIPS2026
链接: https://arxiv.org/abs/2610.12624
作者: Jiuming Liu,Mengmeng Liu,Guangming Wang,Lihao Liu,Michael Ying Yang,Yunpeng Zhang,Francesco Nex,Hao Cheng,Hesheng Wang
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at NeurIPS 2026
Abstract:Prior outdoor LiDAR registration works are commonly limited by the pair-wise input paradigm, which neglects temporal correlations inherent within streaming sequences. In this paper, we propose a novel multi-frame outdoor point cloud registration network for streaming LiDAR scans enhanced with pose-related memory buffers. The key observation is that long-term temporal LiDAR sequences can provide rich global contextual information to complete sparse measurements, filter outliers, and address low-overlap problems, thereby boosting registration performance. Specifically, two hybrid memory buffers are designed, including an implicit memory feature buffer and an explicit memory pose buffer, to store and dynamically update pose-related temporal features. Moreover, a novel dynamic history weighting module is developed to adaptively fuse current and history pose-related features. Extensive experiments on three outdoor datasets, including KITTI, nuScenes, and Apollo-Southbay, demonstrate state-of-the-art performance of MemReg, surpassing all previous pair-wise methods and also multi-frame SLAM systems. Our method also generalizes surprisingly well to multiview indoor registration scenarios with rather competitive performance on 3DMatch, 3DLoMatch, and ScanNet. Code will be released at this https URL.
[CV-127] Mind the Temporal Gap: Evaluating Video Models for Temporal Understanding in Driving
链接: https://arxiv.org/abs/2610.12575
作者: Shiva Sreeram,Erfan Aasi,Tsun-Hsuan Wang,Alaa Maalouf,Daniela Rus
类目: Computer Vision and Pattern Recognition (cs.CV); Robotics (cs.RO)
备注:
Abstract:Modern video-language models are increasingly treated as general-purpose video reasoners, yet it remains unclear whether they robustly capture temporal dynamics in safety-critical settings such as driving. We study this question through controlled ego-motion tasks that require identifying actions from driving videos. Across video-language models, we find that standard prompting, visual prompting, few-shot prompting, and chain-of-thought prompting remain unreliable and highly task- and model-dependent, with persistent class biases, although newer models show substantial task-specific few-shot gains. In contrast, lightweight LoRA finetuning and simple probes trained on intermediate visual features recover strong motion-discriminative performance, indicating that motion-relevant cues are often present inside the models but are not reliably used by the final video-to-language pathway. These results suggest that, in driving, current video-language models remain unreliable temporal reasoners and often behave more like frame-level, bias-driven recognizers than dependable temporal world models.
[CV-128] Scaling Multi-Teacher Distillation for Digital Pathology NEURIPS2026
链接: https://arxiv.org/abs/2610.12574
作者: Sofiène Boutaj,Pierre Marza,Varun Belagali,Dimitris Samaras,Maria Vakalopoulou,Stergios Christodoulidis
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Accepted at NeurIPS 2026. Project page: this https URL
Abstract:Multi-teacher distillation allows transferring knowledge from multiple “teacher” networks to a single “student” network. This method is promising in fields such as digital pathology, where many powerful foundation models were proposed recently. However, as we show in this paper, the standard multi-teacher distillation approach reacts poorly to an increase in the number of teachers used to train a student encoder. We demonstrate that learning teacher-specific representations is a key to scaling in MTD. Importantly, different design choices, such as learnable teacher tokens, a tailored attention scheme, additional mixture-of-experts layers and a contrastive loss, are proposed to better learn such teacher-specific representations. We show that our method better scales with respect to the number of considered teachers, allowing us to train compact student encoders, up to 10x more efficient than larger teacher foundation models, while matching their performance and even outperforming them on a large set of tile-level and slide-level tasks. We conduct a thorough empirical validation, evaluating more than 10 foundation models on 39 tasks spanning tile and slide levels. As a result, we release a new collection of strong and efficient foundation models, named OMNI, trained from the knowledge of 10 state-of-the-art foundation models. We finally conduct an analysis of the learned teacher-specific representations, highlighting their complementarity and explaining why they can be easily aggregated at downstream time.
[CV-129] MIRAG E: Metric Inference and Reliability-Aware Gaussian Estimation from Feed-Forward Vision
链接: https://arxiv.org/abs/2610.12568
作者: Xinzhe Wang,Changjian Jiang,Kaiwen Song,Xudong Li,Kerui Ren,Ran Yi,Lizhuang Ma,Chunhua Shen,Linning Xu,Tao Lu,Mulin Yu
类目: Computer Vision and Pattern Recognition (cs.CV)
备注: Project Page: this https URL
Abstract:Feed-forward 3D priors enable high-quality reconstruction from image streams but often lack reliable metric scale and suffer from long-term trajectory drift. In contrast, LiDAR–inertial estimation provides metrically accurate motion but lacks the image-space consistency needed for high-fidelity reconstruction. We propose MIRAGE , which anchors feed-forward visual geometry to LiDAR–IMU metric motion and regulates online pose corrections according to correspondence support and cross-modal agreement, jointly enabling accurate metric pose estimation and high-fidelity Gaussian reconstruction. Experiments on Oxford Spires, M2DGR and INS show that MIRAGE achieves accurate metric trajectory estimation, outperforming COLMAP, a widely used but computationally expensive reference for vision-only benchmarks. Motivated by the scarcity of long-horizon monocular benchmarks for large-scale indoor reconstruction, we further build a multimodal data-collection platform and use MIRAGE to establish accurate 6-DoF reference trajectories for a new vision-only benchmark. We benchmark recent monocular large-scale reconstruction methods on this dataset, providing a systematic evaluation of their performance in long-horizon indoor scenes.
[CV-130] CASTER: Formalizing Zero-Shot Manipulation from Synthetic Videos as Constrained Optimization
链接: https://arxiv.org/abs/2610.12567
作者: Yinlong Dai,Homanga Bharadhwaj,Dylan P. Losey
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Prior research on learning from humans often requires real human demonstrations. But advances in video generation models offer a new paradigm: we can now prompt these generators to make synthetic videos of the task. On the plus side, these synthetic videos take place in the robot’s current environment, and do not require actual human teaching. However, while the generated videos appear to show plausible motions, they lack both physical consistency and robot grounding, and thus the robot cannot directly roll out the trajectory shown by the video. In this paper we seek to formalize the process of going from synthetic video generation to real-world robot trajectories for zero-shot manipulation tasks. We recognize that this problem is an instance of constrained optimization. The object trajectories extracted from the synthetic video provide an initial guess at the correct motion, and the robot must refine these trajectories (for instance, within a digital twin) while enforcing physical feasibility and semantic consistency. Our optimization-based formalism provides insights into the video generation properties necessary for success. Specifically, we show that the video generation must probabilistically seed the search within a semantic basin of attraction where the trajectory can be locally modified without losing its task alignment. Our analysis further reveals that state-of-the-art approaches can be viewed as instances of our unified formalism with key simplifications. In our experiments we remove these simplifications to more closely match the underlying optimization, leading to more robust zero-shot trajectories from synthetic videos and improving average task success by 34.1% compared to the best-performing baseline. See videos at our project website: this https URL
[CV-131] Fly-by-Code: Embodied Coding Agents for Aerial Manipulation with Active Visual and Physical Feedback
链接: https://arxiv.org/abs/2610.12549
作者: Jaewoo Lee,Jeongyeon Seo,Sihyun Cho,Gyeongrak Choe,Yutong Wang,Bavin Saravanan,Jia-Bin Huang,Furong Huang,Sebastian Scherer,Guanya Shi,H. Jin Kim,Seungjae Lee,Dongjae Lee
类目: Robotics (cs.RO); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: Project Page: this https URL
Abstract:Embodied coding agents construct robot policies from natural-language instructions by generating executable programs and refining them from execution feedback. This refinement assumes that execution feedback reveals whether the task succeeded and, after a failure, provides sufficient evidence to guide program revision. Aerial manipulation violates this assumption in two ways. Payload constraints restrict onboard camera coverage and leave task-critical outcomes outside the robot’s view (partial observability), while strong dynamic coupling and limited control margins make physical interactions fragile (limited interaction robustness) and leave failure causes unresolved. Re-examining the same feedback cannot recover observations that were never collected or separate failure causes that the available evidence does not distinguish. To acquire this missing evidence, we introduce Active Feedback (AF), an active “View and Probe” framework. When execution feedback leaves unresolved questions, the agent synthesizes a separate diagnostic program that runs in simulation to inspect unseen outcomes from informative viewpoints (View) or test hypotheses about failure causes through targeted physical interactions (Probe). Across six simulated aerial manipulation tasks with 60 trials per condition, AF reduces false completion declarations from 25 to 5 and raises final task success from 31.7% to 75% compared with terminal feedback under the same coding-agent configuration and task-execution limit. Using shared robot APIs, task programs refined with AF in simulation run on a physical aerial manipulator without task-program source-code modification and complete multi-stage manipulation tasks in the real world. These results show that executable diagnosis fills gaps in execution feedback for embodied coding agents, improving both completion assessment and program refinement in aerial manipulation.
[CV-132] rraAgent : Demonstration-Grounded Multi-Agent Reasoning for Long-Context Remote Sensing Visual Question Answering
链接: https://arxiv.org/abs/2610.12517
作者: Jingwen Huang,Yiming Fang,Hanxiao Wu,Boyuan He,Keyi Luo
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Remote sensing visual question answering (RS-VQA) requires answers that truly depend on image evidence, yet current remote sensing multimodal large language models (RS MLLMs) are still evaluated mainly by accuracy, which cannot reveal whether a correct answer was produced without using the image. This setting introduces three challenges: demonstrations retrieved across different ground sample distances (GSD), sensors, and city textures may be poorly matched; real queries often involve long visual contexts from multi-scale tiles, multi-temporal frames, and retrieved knowledge, where evidence can be diluted and errors can propagate through multi-step reasoning; and prior-only answering remains invisible to standard metrics. We present AVA, a training-free framework that wraps a frozen RS MLLM with three modules. GDR performs GSD-bucketed, scene-graph-based demonstration retrieval and filters demonstrations whose answers are unsupported by their images. MACE decomposes each query into an evidence-typed sub-question DAG, routes sub-questions to suitable perception tools, and records verified provenance in a shared evidence ledger with bounded re-perception. CVA audits the final answer through counterfactual perturbations of cited evidence, including ablation and swap, and computes a visual-dependency score for confidence calibration and evidence-forcing re-query. On RSVQA-LR/HR, VRSBench, and LHRS-Bench, AVA improves average accuracy by up to 2.40 points over the strongest same-setting baselines, raises the visual-dependency score from 0.28 to 0.49, reduces the prior-only answer rate from 46.2 percent to 21.7 percent, and lowers the hallucination rate from 17.1 percent to 9.8 percent, with 2.6x the cost of a single backbone forward pass and no fine-tuning.
[CV-133] raceICL: Thread-Resolved Demonstration Curation with Consistency Calibration for Robust Multimodal In-Context Learning
链接: https://arxiv.org/abs/2610.12516
作者: Yigit Yilmaz,Elena Petrova,Mehmet Kaya,Lucia Rossi,Amir Rahman
类目: Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Interleaved multimodal in-context learning (ICL) lets frozen large vision-language models (LVLMs) acquire new tasks from a handful of image-text-answer demonstrations, yet it remains fragile: demonstrations bind to the wrong images, redundant exemplars crowd out informative ones, and noisy answers are copied verbatim into predictions. We present AVA, a training-free framework that organizes the demonstration pipeline of multimodal ICL into three composable stages. A Thread-Resolved Decomposer (TRD) segments the interleaved context into per-sample threads and re-stitches them with explicit boundaries, restoring image-text binding. An Influence-scored Demonstration Selector (IDS) estimates each candidate’s marginal influence with one extra forward pass, removes redundancy, and orders the survivors by descending value. A Weak-to-Strong Consistency Calibration (WSC) module scores each demonstration by a weak sibling model’s reconstruction confidence and softly reweights its contribution during decoding. On five vision-language benchmarks with interleaved 4-shot prompts, AVA improves the strongest same-setting baseline by +1.7 points on average, with gains of up to +2.4 points on VizWiz, shrinks the require-visual performance gap on ScienceQA-IMG, and retains most of its gain under 30% noisy demonstrations, at a 26% latency overhead that an offline cache amortizes. No gradients are ever computed; the LVLM stays frozen.
[CV-134] CORAL-KV: Compact Cross-Layer Prediction and Residual Coding for Autoregressive Video KV Caches
链接: https://arxiv.org/abs/2610.12514
作者: Albert Ge,Akash Haridas,Utkarsh Saxena,Ruijing Yang,Ian Colbert,Frederic Sala,Vikram Appia,Emad Barsoum
类目: Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注:
Abstract:Autoregressive video diffusion models maintain a growing attention key-value (KV) cache, making memory a key bottleneck for long video generation. Recently, clustering-based quantization has emerged as an effective method to compress video KV caches by grouping similar key and value vectors then quantizing residual errors. However, when later frames attend to the compressed history, small reconstruction errors can compound as the video grows. Beyond the within-layer similarity exploited by clustering, we find strong dependencies across cache layers in video models. This motivates Coral-KV - Calibrated Offline, Residual-coded, and Adapted Locally - a KV-cache compression framework that uses cache states in each layer to predict keys and values in subsequent layers, then quantizes the remaining prediction residuals. We construct compact block-diagonal-plus-low-rank (block-DPLR) predictors: block-diagonal components model channel relationships within each attention head, while a global low-rank term models dependencies between heads. Coral-KV exposes a flexible fidelity-memory trade-off: it can reuse its predictors across videos or refit lightweight block-diagonal predictors to the current video for higher fidelity. Across extensive evaluations on both HY-WorldPlay and MAGI-1, our reusable configuration improves PSNR over QVG-4 by 0.32 dB and 4.95 dB, respectively, while using 48% and 37% less cache memory. Against QVG-Pro, our video-adapted configuration improves MAGI-1 PSNR by 3.77 dB while using 33.7% less cache memory. Coral-KV also maintains higher reconstruction fidelity over extended generation and reduces temporal discontinuities while retaining comparable generation latency.
[CV-135] Imagine the Future Internalize the Gist: Efficient VLA Reasoning via Internalized Spatiotemporal Imagination
链接: https://arxiv.org/abs/2610.02626
作者: Shenglan Li,Zhendong Mi,Hengyi Zhu,Jingwu Luo,Chun Kit Chan,Geng Yuan,Yanzhi Wang,Pu Zhao,Shaoyi Huang
类目: Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Robotics (cs.RO)
备注:
Abstract:Vision-language-action (VLA) models increasingly incorporate intermediate reasoning to improve robotic manipulation, yet existing approaches primarily reason about observed states without explicitly anticipating future scene evolution. Extending such reasoning to explicit future rollouts at every inference step, however, introduces substantial computational overhead. We propose IG-VLA, a VLA reasoning framework that enables models to imagine the future and internalize the gist. Our Latent Spatiotemporal Reasoning learns to imagine task-relevant future scene evolution directly in visual representation space, guiding action prediction without costly pixel-level video generation. To further reduce inference overhead, we introduce Scene Gist Memory, which internalizes reasoning-derived scene-behavior associations into a compact Scene Gist Token, preserving the benefits of future reasoning while bypassing explicit future imagination at inference. Extensive experiments on LIBERO, LIBERO-Plus, and VLABench demonstrate the effectiveness and efficiency of IG-VLA. On the LIBERO-Plus Language suite, both the reasoning and gist policies outperform the strongest baseline by nearly 6% in success rate. The gist policy also achieves up to 6.38x speedup over baselines, reducing inference latency from 1081ms to 169.5ms per action chunk on a single NVIDIA A6000 GPU. These results demonstrate that future spatiotemporal reasoning can be effectively internalized for efficient VLA deployment.
[CV-136] Can Multimodal Decision Models Classify Breast Ultrasound Images? Benchmarking CLEF and CLEF-Flash Across Prompts and Datasets
链接: https://arxiv.org/abs/2610.13675
作者: Tran Cao Minh,Hai Tran,Ha Minh Tan
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Multimodal decision models return probabilities over predefined alternatives, offering a structured interface for image classification. This study benchmarks inference with CLEF and CLEF-Flash on 2818 breast ultrasound images from Dataset B, BUSI, and BUS-BRA. Dataset B and BUS-BRA use binary benign-malignant classification, whereas BUSI includes normal, benign, and malignant categories. Model parameters remain unchanged, and original images are submitted without user-defined preprocessing. Three prompts provide minimal labels, an explicit classification task, or sonographic criteria. We report accuracy, macro F1, balanced accuracy, macro precision, throughput, and latency. CLEF-Flash with the clinical prompt achieves the highest accuracy on all three datasets: 74.85% on Dataset B, 66.28% on BUSI, and 51.63% on BUS-BRA. On BUSI, however, CLEF with the task-guided prompt achieves the highest macro F1 (64.51%) and balanced accuracy (68.72%). CLEF-Flash has lower latency in every matched comparison. Clinical instructions improve CLEF-Flash accuracy relative to the minimal prompt but reduce CLEF accuracy on all datasets. Confusion matrices reveal frequent benign-to-malignant errors, particularly on BUS-BRA, where all configurations fall below the 67.63% accuracy of a majority-class predictor. These findings demonstrate dataset-and prompt-dependent performance and motivate class-specific evaluation before applying multimodal decision models to breast ultrasound analysis.
[CV-137] Model-agnostic Knowledge Augmented Machine Learning for Weakly Annotated Bioimaging Data
链接: https://arxiv.org/abs/2610.13637
作者: Jayanie Bogahawatte,Sachith Seneviratne,Simon Maksour,Dzung Do-Ha,Elizabeth Qian,Samuel Brennan,Matthew Keon,Lezanne Ooi,Saman Halgamuge
类目: Image and Video Processing (eess.IV); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Machine learning models are increasingly used for automated feature extraction from weakly annotated bioimaging data, such as microscopy and cytomorphology images. Due to the sole dependency of automated feature extraction, existing methods yield inconsistent classification performance across weakly annotated datasets. Here, we propose a model-agnostic knowledge augmentation method that enables ML models to exploit domain knowledge beyond what automated feature extraction can capture. The proposed approach improves classification performance across seven ML architectures. When integrated with masked autoencoder-based self-supervised learning, our method achieves the strongest overall performance, improving precision by 2.9% over the next-best method on three in-house microscopy datasets and by an average of 6.8% across three public cytomorphology benchmarks. We perform nucleus-level classification based on mislocalization of TAR DNA-binding protein 43 (TDP-43) from the nucleus to the cytoplasm, a phenotype linked to Amyotrophic Lateral Sclerosis (ALS), using three independent microscopy datasets of motor neurons derived from human induced pluripotent stem cells. Accurate quantification of this phenotype at scale remains challenging and may contribute to inconsistencies across studies. Application of the best-performing model to these microscopy datasets reveals biological interpretations related to ALS, including dose-dependent effects of the proteasomal stressor, MG132, and the oxidative stressor, sodium arsenite (SA), on TDP-43 mislocalization, variable pathology in motor neurons from sporadic and familial ALS donors, and a lack of protection of the pharmacological compounds, edaravone and niclosamide, against SA-induced TDP-43 mislocalization. Together, our pipeline enables in-vitro cellular image analysis to advance understanding of ALS-associated pathology and potential treatments.
[CV-138] Radiomics-Based Thyroid Nodule Classification with Label-Conditional Conformal Prediction
链接: https://arxiv.org/abs/2610.13387
作者: Laura Testa,Pierpaolo Brutti,Umberto Ferraro Petrillo
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Applications (stat.AP)
备注: Accepted at the CIBB 2026 conference ( this https URL )
Abstract:Thyroid nodule malignancy assessment relies on ultrasound imaging, yet current risk stratification systems suffer from substantial interobserver variability, contributing to a high rate of unnecessary biopsies. We propose a radiomics-based framework combining quantitative feature extraction via PyRadiomics with a Generalized Additive Model (GAM) classifier, selected among six candidates for its favorable trade-off between discriminative performance and interpretability. To complement point predictions with uncertainty estimates, Cross-Conformal Prediction with label-conditional guarantees is applied, flagging ambiguous cases for clinical review rather than forcing a binary decision. Experiments are conducted on TN5000, a publicly available ultrasound dataset of thyroid nodules. After Spearman correlation filtering, 36 features are retained and the GAM achieves an AUC of 0.89 , a sensitivity of 0.83 , and a specificity of 0.82 on the validation set. At a significance level \epsilon=0.09 , selected to ensure empirical coverage guarantees on both classes, 63% of nodules on the test set receive a certain (i.e., single-label) prediction, with conditional precision of 0.94 for certain malignant and conditional Negative Predictive Value (NPV) of 0.73 for certain benign cases, while the remaining 37% are referred to the clinician.
[CV-139] ECGWmark: Deep Watermarking for Electrocardiogram Signals
链接: https://arxiv.org/abs/2610.13357
作者: Kuan-Yu Chen,Kuan-Chen Wang,Yu Tsao,Jian-Jiun Ding
类目: ignal Processing (eess.SP); Cryptography and Security (cs.CR); Computer Vision and Pattern Recognition (cs.CV)
备注: 7 pages, 2 figures, 4 tables
Abstract:Secure transmission of electrocardiogram (ECG) signals remains a major challenge in telecardiology. While traditional mathematical watermarking can embed patient metadata directly into ECG signals, it is highly fragile against temporal desynchronization such as circular phase shifts. In contrast, existing deep watermarking approaches for temporal signals, such as audio, typically rely on lossy quantization, which compromises the high-frequency micro-morphological details critical for clinical diagnosis. To bridge this gap, we propose ECGWmark, a fully convolutional and quantization-free deep watermarking framework for medical time-series. ECGWmark operates in a continuous, full-resolution latent space and utilizes a localized frame-level mechanism to improve the robustness to severe desynchronization. Crucially, we introduce a differentiable Physiological Loss guided by a clinical classifier to preserve diagnostic semantics. Experiments on the benchmark MIT-BIH database show that ECGWmark maintains channel-bit extraction accuracy above 90% under the evaluated circular temporal shifts. Furthermore, under a rigorous inter-patient diagnostic evaluation, Class-V sensitivity changes from 71.97% to 76.50%, whereas Macro-F1 changes from 35.25% to 34.71% and Class-S sensitivity from 8.89% to 1.39%; these results indicate mixed class-level effects.
[CV-140] he Predictability Bias of Joint-Embedding Predictive Learning in Medical Imaging
链接: https://arxiv.org/abs/2610.13237
作者: Fabian Drexel,Bernhard Kainz,Jakob N. Kather,Daniel Rueckert,Lisa C. Adams,Keno K. Bressem,Cosmin I. Bercea
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
备注: 45 pages, 6 figures
Abstract:Joint-embedding predictive architectures (JEPAs) learn by predicting teacher representations of masked regions from visible context. Point prediction summarizes the conditional target distribution and cannot reproduce variation that the context does not resolve. We call this constraint predictability bias. In computed tomography (CT), recurrent anatomy is predictable from context, whereas the sporadic, localized pathology that determines clinical interpretation often is not. We introduce TAP-JEPA, a ViT-B/3D trained on 113,611 CT volumes that is competitive with state-of-the-art encoders (COLIPRI, Merlin, VoxelFM) in scan-level classification. We then audit the learned predictive pathway by replaying the exact masking, teacher, and predictor computations used during training. Prediction lowers the mean Skill (prevalence-normalized average precision) from 0.388 to 0.271 for pathology, but only from 0.921 to 0.873 for anatomy. Along the teacher direction, separating pathology from matched control regions in the same organ, prediction moves pathology 34.7% toward the controls and controls 13.6% toward pathology, with larger shifts farther from visible context. Replacing visible matched-control representations increases surrounding-target prediction loss more than fully replacing pathology representations across four pathology categories. Downstream, removing all final-layer pathology tokens reduces the decision margin by at most 0.45% in four of seven scan-level probes. Together, these results show that contextual predictability is not a sufficient proxy for clinical relevance in medical representation learning. Training objectives should therefore retain diagnostic features regardless of their predictability from surrounding anatomy.
[CV-141] Stochastic Finite-Transition Learning and Exploration for Accelerated MRI Reconstruction
链接: https://arxiv.org/abs/2610.13095
作者: Muhammad Usama Mirza,Esin Öztürk Işık,Tolga Çukur
类目: Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Signal Processing (eess.SP)
备注:
Abstract:Generative MRI reconstruction maps an initial source distribution to the target image distribution along a learned recovery trajectory. Common generative methods, such as diffusion and flow, typically learn fine-grained local dynamics whose integration defines this global mapping, hence requiring many network evaluations at inference. Existing few-step sampling approaches can lower computational burden by approximating large transformations from local dynamics, albeit at the expense of reconstruction fidelity. FLEX-MRI instead partitions recovery into a small number of finite intervals between retained states defined by progressive changes in k-space support, and directly learns the reconstruction change across each interval. Because such finite transitions can admit multiple plausible outcomes, FLEX-MRI combines support-relaxed finite-transition learning with stochastic exploration. During training, randomized k-space sampling masks define finite-transition targets with varying support, while the prediction loss remains unrestricted by each individual mask. At inference, FLEX-MRI perturbs a random subset of currently estimated k-space coefficients, allowing the learned predictor to stochastically explore alternative transition paths. Each predicted state is then reconciled with the acquired measurements through data consistency. We theoretically show that this stochastic exploration induces nonzero transition-level variation through the learned recovery map and data consistency without requiring an auxiliary generative sampler. Experiments on multi-coil MRI datasets show that FLEX-MRI outperforms competing methods while maintaining computational efficiency comparable to few-step baselines.
[CV-142] FlyHack: Stress-Testing Mechanistic Claims in a Connectome-Constrained Visual Model
链接: https://arxiv.org/abs/2610.13018
作者: Aashish Dhawan
类目: Neurons and Cognition (q-bio.NC); Computer Vision and Pattern Recognition (cs.CV)
备注:
Abstract:Connectome-constrained neural networks make biological components directly accessible to intervention, but their mechanistic conclusions can still depend on the comparison model, intervention, circuit representation and trained solution. We stress-test these dependencies in flyvis, a \emphDrosophila motion-vision model, using its 50-model ensemble, task-matched causal CNN controls and replicated interventions. At the level of model behaviour, three-level reverse-phi reversal in flyvis is strongly period- and velocity-dependent and also appears in task-matched CNNs; neither family reproduces the fly’s stationary-sawtooth response. Adversarial direction reversal requires a perturbation bound of 0.21–0.27 times stimulus contrast in flyvis versus 0.13–0.25 in CNNs, but the gap over a parameter-matched CNN largely closes for larger CNNs. At the level of mechanism, matching attribution to the intervention matters: for held-out-mean replacement, first-order edge attribution patching reaches pooled AUROC 0.970 and Spearman 0.872, versus 0.933 and 0.126 when its zero-aligned score is evaluated against the same ground truth. Circuit conclusions also vary with representation and ensemble member. Greedy cell-type sets meet a model-relative T4/T5 tuning criterion in 25 of 50 models, while T4/T5 output silencing reduces the tested optic-flow behaviour to at most two of eight clips in 40. In six models where the cell-type search first succeeds, the corresponding connection sets can be pruned to 13–31 added classes; under an additional two-sided response-amplitude check, only two of those six first-success cell-type sets still meet the tuning threshold. These results support a narrower use of connectome-constrained models: they make mechanistic hypotheses directly testable, but the resulting claims must be scoped to the model family, intervention, representation and trained solution.
人工智能
[AI-0] Revisiting Tabular Deep Regression: Objectives and the Limits of Global Early Stopping
链接: https://arxiv.org/abs/2610.13909
作者: Danil Rudenko,Georgii Bulgakov,Nikolay Kartashev,Ivan Rubachev,Daniil Krasylnikov,Artem Babenko
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:While deep learning models for tabular data have recently received significant research attention, the choice of objective functions for regression tasks remains an understudied degree of freedom. Several lines of research offer alternatives to the standard Mean Squared Error (MSE), but differences in datasets, backbones, and evaluation protocols make their practical benefits difficult to compare. In this work, we address this gap by performing a systematic re-evaluation of regression objectives across a broad collection of established tabular datasets and multiple neural backbones. Our comparison reveals that many proposed objectives provide limited or inconsistent gains over a properly tuned MSE baseline, while quantile loss yields consistent aggregate improvements over MSE across the tested backbones. We then identify a limitation that remains even with this strong objective: regions with different levels of target noise can reach their best predictive performance at different training epochs. Consequently, a single global early-stopping checkpoint can impose a compromise between uncertainty regions, even when the objective can represent heteroskedastic target distributions. Motivated by this limitation, we introduce a heteroskedasticity-aware extension of quantile loss that uses input-dependent label smoothing as a potential remedy and improves over quantile loss on several backbones. Overall, our results provide a modern empirical picture of regression objectives for tabular deep learning and highlight how differences in optimal stopping times across uncertainty regions can limit the effectiveness of global early stopping. The code is available at this https URL.
[AI-1] X-Agent Red: Red-Teaming Personal Agents in Evolving Multi-Service Ecosystems
链接: https://arxiv.org/abs/2610.13886
作者: Yeonsung Jung,Zhiyuan Wang,Zifan Wang,Vítor Albiero,Benjamin Newman,Edoardo Debenedetti,Ivan Evtimov,Ninareh Mehrabi
类目: Artificial Intelligence (cs.AI)
备注: 18 pages. Project page: this https URL
Abstract:Personal agents increasingly connect to services across the web and applications by using tools. As the effects of their actions accumulate and interact across services, unintended or harmful outcomes can arise when agents fulfill benign user requests. Proactively identifying these compositional failures requires systematically exploring diverse cross-service paths. Existing red-teaming methods often simply prompt LLMs to identify potentially harmful paths from task and environment descriptions or decompose harmful objectives specified by humans or LLMs into seemingly benign action combinations. However, generation is biased toward patterns learned during training, potentially favoring familiar tool combinations and leaving novel cross-service interactions underexplored. To address this, we propose X-AgentRed, a self-evolving red-teaming framework that discovers harmful tool call paths through a graph of tool dependencies and expands and refines them using execution feedback. By analyzing each tool’s effects, potential harms, and preconditions for execution, the red-teaming agent constructs a directed graph that captures how one tool’s effects can satisfy another’s execution preconditions. Recipes sampled from this graph are instantiated as realistic scenarios in which agents can produce harmful outcomes. Execution feedback enables self-improvement by diversifying paths that produce harm through tool substitution and refining preconditions at blocked steps in unsuccessful paths to enable further execution. Across four frontier agentic models, X-AgentRed achieves 1.77\times the harmful path rate of STAC and explores a more diverse set of tools, yielding 2.99\times the tool coverage on average.
[AI-2] MC-EvoBench: Auditing Experience-Driven Self-Improvement in Minecraft Agents
链接: https://arxiv.org/abs/2610.13829
作者: Jingwei Song,Zhisheng Chen,Bingfan Zeng,Jing Tang,Yubo Hou,Jinhao Jing,Zhengwei Xie,Linfeng Zhang
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注: 39 pages, 6 figures
Abstract:A central challenge in embodied recursive self-improvement is enabling agents to convert interaction history into capabilities that persist beyond one world and transfer to later tasks. A saved memory or successful final action does not by itself establish that a reusable capability was acquired; evaluation must separate capability change from carried-over resources, unequal source exposure, and early execution failures. We construct MC-EvoBench as a controlled Minecraft benchmark with a fixed catalog of 19 registered evolution chains, including 12 primary evaluation chains and seven calibration or probe chains, together with three graph-aligned paired probe families for transfer. The benchmark represents each task as a task-state graph, defines stage-level environment verifiers, assigns matched source and target roles, resets the target world, and permits only a declared agent artifact to cross the source-target boundary. For each probe, no-prior, related, unrelated, and shuffled source conditions are evaluated under matched environment-step budgets and five seeds; we report TSR, WGP, and VMP and retain provenance records. The benchmark reveals a consistent direct-capability gap between controller and planner-backed variants, while related experience yields no stable transfer: it does not improve either tool probe, its small wood-species gain hinges on one seed, and all intervals include zero. Stage audits further show that early wood-collection and crafting bottlenecks often leave later capabilities unobserved. MC-EvoBench thus offers a controlled testbed for durable, transferable embodied capabilities. Code and data are available at this https URL
[AI-3] Same Query Different Answer: Run-to-Run Variance in Semantic Query Processing
链接: https://arxiv.org/abs/2610.13823
作者: Oktie Hassanzadeh,Dharmashankar Subramanian
类目: Databases (cs.DB); Artificial Intelligence (cs.AI)
备注: Code and data: this https URL
Abstract:Semantic query engines ask a large language model (LLM) to judge individual rows, and benchmarks compare these engines on the quality of a few executions at temperature 0. We measure how much another execution changes. We re-execute the text and tabular workloads of SemBench, LRO-Bench, and UDA-Bench through their own harnesses, log every one of 1.2 million model calls, and reanalyze SemBench’s published executions. At temperature 0, between 0.07% and 10.2% of rows change their operator output over five executions, depending on the model, and up to 24.0% on one task. Plans amplify these changes exponentially in the number of rows an answer exposes, as a possible-worlds model predicts: on UDA-Bench, a few percent of extracted values change, but about two thirds of the answers do. In SemBench’s published results, 21% of text results change quality between executions, including on engines whose plans are deterministic. Several per-query system comparisons, and 16 of 28 tests of LRO-Bench’s implementation recommendations, are not settled by the executions the benchmarks run. Changing rows are rows on which models disagree with each other; identical requests within one execution disagree as often as across executions; and one execution’s decision margin or reasoning length predicts which rows change. Voting reduces the variance but does not remove it, and a calibrated cascade keeps its guarantee while the rows it returns change. We derive reporting rules for benchmarks and design rules for engines.
[AI-4] FORTE: A Production Framework for Feature Evaluation and Deprecation in Industrial Recommender Systems
链接: https://arxiv.org/abs/2610.13806
作者: Vishnu Arun,Adam Obeng,Tianyou Wang,Zilin Ren,Mukuntha Narayanan Sundararaman,Han Wang,Shivin Thukral,Zhixiang Wang,Saurabh Vishwas Joshi,Darren Reger
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Production recommender systems have feature-lifecycle asymmetry: adding new features must produce gains on some metric, while feature removal must not regress any metric. In practice, feature deprecation is hard to prioritize as a feature can fail to be removed if it interacts with other features, its importance changes daily, it cannot be evaluated before production models change or data drift occurs, it is in contention for A/B test space with other launches, it causes regressions in an online A/B test, or it is consumed by multiple models that need to coordinate its deprecation. We present FORTE, a model-agnostic production framework for discovering, validating, and removing features. Its efficient perturbation implementation allows daily feature evaluation. To account for interactions, it evaluates candidate feature sets constructed from all the low-rank features through grouped ablation and its offline results are sufficiently predictive of online A/B tests to allow deprecations to proceed to online testing with confidence. Lineage tracing identifies all downstream consumer models to realize the full savings of removing a feature from the training set. We validate FORTE over 2 large-scale recommender systems and find that it identifies deprecable feature sets which do not cause online regressions, while the impact on efficiency depends on model characteristics. On a search-relevance model, FORTE resulted in 3 nested candidate sets of 32, 48, and 59 features. Online guardrails rejected the largest treatment. The 48-feature set was selected for deprecation, removing 43.3% of the model’s features. On a large ranking model, FORTE identified 8 candidates for removal. Retraining and A/B testing confirmed no regression. Its launch reduced the trainable parameters by 29.9%, improved serving throughput by 19.8-25.5%, and reduced annual training costs by hundreds of thousands of dollars.
[AI-5] Your Discrete Graph Diffusion Model is Secretly Memorizing NEURIPS2026
链接: https://arxiv.org/abs/2610.13786
作者: Adarsh Jamadandi,Nicolas Keriven
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Accepted at NeurIPS 2026 Workshop BeNTo: Beyond Next Token Prediction
Abstract:Discrete graph diffusion models (GDMs) corrupt the graph structure by adding noise independently to nodes and edges under a Markovian noise model. In the unconditional setting without node features, an equivariant denoiser trained on a single graph is able to generate novel graphs and sample-level metrics such as edge overlap and WL kernel similarity find no evidence of memorization. In this work, we challenge this view and show for the first time that graph diffusion models indeed exhibit memorization. Analyzing the reverse diffusion trajectories of GDMs trained on two-block stochastic block models (SBMs), we find a strong train-data bias: the model recovers a corrupted training graph almost perfectly compared to a held-out test graph. We term this conditional memorization, as it surfaces only when the reverse trajectory is conditioned on a corrupted training graph and is not apparent during inference. It coincides with a growing generalization gap, where the training loss improves as the loss on held-out graphs degrades, and it cannot be mitigated by early stopping. The onset of memorization always precedes the emergence of community structure in the generated graphs, thus every checkpoint earlier produces structureless graphs. This behavior holds across all node sizes we test.
[AI-6] ReplaySSM: Cache SSM Inputs Not State
链接: https://arxiv.org/abs/2610.13778
作者: Ze-Wei Liou,Harris Nover,Amey Naik,Andrii Skliar,Igor Shovkun,Ido Shahaf,Tri Dao
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 11 pages (35 pages counting references and appendix), 6 figures, 2 tables. Code: this https URL
Abstract:State-space models (SSMs) maintain a fixed-size recurrent state, but reading and writing it at every decoding step can bottleneck hybrid models. This eager state management causes large state I/O with low arithmetic intensity, leaves speculative decoding no cheap rollback, and feeds state quantization error into subsequent recurrent updates. We introduce ReplaySSM, which unrolls the recurrence to represent the state as a checkpoint and a buffer of recent SSM inputs. This separates output computation from checkpoint updates. By updating the checkpoint periodically, ReplaySSM avoids state writes on most steps and roughly halves the dominant state memory traffic. Keeping recent inputs also makes speculative rollback a buffer-pointer operation and enables output-only verification without materializing intermediate states. The same separation allows a low-precision checkpoint to serve output computation on most steps while a higher-precision checkpoint serves recurrent updates, so rounding error in the low-precision copy never enters later updates. We implement ReplaySSM in vLLM for Mamba-2 and Gated DeltaNet. At serving batch size 256, it accelerates standard decoding by 1.20 – 1.47\times over a tuned vLLM baseline across four hybrid models, and delivers about 1.8\times the throughput of vLLM’s speculative decoding on the two 120B-class models. Separate state precisions also reduce output KL divergence and downstream accuracy losses compared with a shared low-precision checkpoint.
[AI-7] DualQuant: Dual-scale Calibration-free Weight-and-Activation Quantization for LLM s
链接: https://arxiv.org/abs/2610.13767
作者: Mahsa Salmani,Sayeh Sharify,Hesham Mostafa
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Low-bit inference on accelerators with native 4-bit support requires quantizing both weights and activations to realize the full throughput gains these formats provide. While post-training weight quantization has been extensively studied, activation quantization remains considerably more challenging and typically requires calibration data. In this work, we introduce DUALQUANT, a dual-scale, calibration-free post-training quantization framework that directly minimizes the weight-reconstruction Mean Squared Error (MSE) and, as an immediate by-product, yields per-channel activation rescalings prior to activation quantization. Our key observation is that the scaling factors obtained by minimizing weight-reconstruction error provide effective activation rescalings, enabling competitive activation quantization without calibration data. We formulate DUALQUANT as a non-differentiable weight-reconstruction problem and develop an efficient solver based on variable splitting and block coordinate descent, where each subproblem admits a closed-form update. DUALQUANT provides a unified algorithm supporting a wide range of formats, including the full MX family and NVFP4. To our knowledge, DUALQUANT is the first dual-scaling method to formally support MX and NV block formats. Across Llama and Qwen models evaluated on WikiText-2, C4, and zero-shot downstream tasks, DUALQUANT matches or exceeds the accuracy of calibration-based SmoothQuant across most models and formats, and substantially outperforms calibration-free baselines, with large gains for MX and NV block formats. We validate these gains with a real packed W4A4 inference path for Llama-3.1-8B on an RTX 4090. The resulting implementation closely matches the accuracy of fake quantization while delivering up to 2.61x memory reduction and up to 2.46x throughput speedup over BF16.
[AI-8] When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors NEURIPS2026
链接: https://arxiv.org/abs/2610.13765
作者: Adarsh Jamadandi,Nicolas Keriven,Aline Roumy
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Accepted at NeurIPS 2026
Abstract:Discrete graph diffusion models corrupt graph structure through independent edge updates with a Markovian noise model. Combined with the exchangeability requirement on the output distribution, the terminal prior is necessarily an Erdős–Rényi (E-R) random graph. This has a fundamental consequence for unconditional graph generation without node features: in the large graph limit, any GNN denoiser applied to an E-R graph approximately outputs an E-R graph, making effective denoising difficult. In practice, generated graphs fail to recover meaningful node heterogeneity and higher-order structure. Previous models introduced specialized node features to compensate, framing this as an expressivity problem, while the role of the prior remained unexamined. We instead address the root cause by introducing the Latent Sociability Prior (LSP) and a join diffusion process that co-evolves latent node sociability variables and graph structure, removing edge independence while preserving exchangeability. Unlike existing latent graph diffusion methods, the sociability mechanism requires no complex encoder: its sole role is to guide edge updates and preserve node heterogeneity throughout the trajectory. We validate our approach on multiple graph generation datasets and show that the proposed framework more accurately captures graph distributions than baseline methods without node features.
[AI-9] Matched-Context Group Policy Optimization for LLM Agent Training
链接: https://arxiv.org/abs/2610.13755
作者: Chenxu Zhang,Yaorui Shi,Wenlong Zhang,Jianchao Tan,Zihan Wang,Yiming Cheng
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 29 pages, 9 figures
Abstract:Training long-horizon language model agents requires assigning credit to intermediate decisions from sparse terminal feedback. Within a finite group of sibling rollouts, useful action comparisons depend on their context, evidence for both alternatives, and how that evidence enters learning. We propose Matched-Context Group Policy Optimization (MCGPO), a procedure for constructing weighted action preferences from already collected trajectories. MCGPO defines comparison contexts with pre-action state summaries and observed rubric progress, annotated by task rules. Two-action support selects among ordered exact and coarse matching rules. Fixed folds separate candidate decisions from the terminal outcomes used to orient their preferences, and support-dependent evidence weights scale an auxiliary pairwise objective alongside shared GraphGPO task learning. MCGPO reuses rollout data and each response’s original history, preserving critic-free training. Across six environment-backbone settings with three training seeds each, MCGPO improves mean success over matched GraphGPO: by 0.47-1.46 percentage points on ALFWorld and WebShop with Qwen2.5-1.5B and 7B, and by 3.96 and 5.16 points on WebShop with Qwen3-4B and 8B. The ALFWorld gains build on baseline success above 92%, where remaining headroom is limited. Integrated success improves in three of four Qwen2.5 settings. Three-seed factorial controls support opposite-fold evidence and evidence weighting; joint state-rubric matching achieves the highest mean in all four representation-control settings.
[AI-10] SafeDiSTL: Decomposing Joint Constraints for Safe Multi-Agent Reinforcement Learning
链接: https://arxiv.org/abs/2610.13737
作者: Hongrui Zheng,Aditya Singh,Rahul Mangharam
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Cooperative multi-agent tasks often impose constraints on a shared objective or collective safety. A team level violation cost function can measure this constraint outcome, but does not distinguish which agents’ actions most strongly influence that violation. We present SafeDiSTL, a constrained multi-agent reinforcement learning framework that allows for credit assignment even with joint constraint measurements. We use Signal Temporal Logic (STL) robustness to measure episode-level violation through running-maximum cost increments. Smooth full-episode robustness and differentiable dynamics provide action sensitivities, which allocate each cost increment across agents at the same decision time. These sensitivities account for delayed effects when weighting agents’ shares of each cost increment. We study the framework in cooperative payload transport, connected navigation, and networked traffic control tasks. SafeDiSTL achieves 1.6-5.1x the safe-success rate in transport, improves navigation safe-success by 11.1%, and delivers 50-68% more throughput in traffic when compared to constrained baselines. Results demonstrate a strong improvement of the learned policy in dealing with shared constraint while retaining the performance of unconstrained policies.
[AI-11] Orthros: Phase-Aware Heterogeneous Attention for Efficient Transformers NEURIPS2026
链接: https://arxiv.org/abs/2610.13735
作者: Yuhong Chou,Zehao Liu,Yuqi Pan,Qian Liu,Xianwei Chen,Zhongzhu Zhou,Jibin Wu
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: neurips 2026 paper, preprint version with lab’s template
Abstract:Efficient attention mechanisms, such as linear and sliding window attention, aim to reduce the computational complexity of Transformers from quadratic to linear. However, their degraded in-context recall often necessitates interleaving full attention layers, leaving the quadratic bottleneck unresolved in long-context processing. To address this, we introduce Orthros attention, which shifts the efficiency paradigm from structural allocation to phase-aware decoupling. As a unified module, it dynamically switches its computation pattern across different phases of sequence processing, enabling linear complexity prefilling and full attention decoding. Our design grants Orthros attention a lower asymptotic complexity compared to vanilla Transformers in prevalent long-context scenarios characterized by heavy prefilling and light decoding. Beyond theoretical formulation and complexity analysis, extensive empirical evaluations demonstrate Orthros’s superiority across multiple dimensions. First, we validate its fundamental language modeling capabilities, demonstrating scalability across varying model sizes and strong competitiveness in comprehensive architectural comparisons. Second, Orthros exhibits exceptional conversion feasibility via a data-efficient Transformer-to-Orthros conversion, yielding performance that even surpasses the original Transformer. Finally, Orthros achieves a 21.9\times prefilling speedup over Transformers with end-to-end inference gains, while preserving long-context capabilities, as demonstrated by near-perfect 128K needle-in-a-haystack results and Transformer-level performance on real-world in-context recall tasks. Overall, these advantages in high performance, flexibility, and efficiency position Orthros as a promising candidate to succeed the Transformer in industrial applications.
[AI-12] Amortized Counterfactual Prediction with Graph Neural Networks
链接: https://arxiv.org/abs/2610.13724
作者: Hendrik Stumpf,Francesco Quinzan
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Counterfactual inference asks how an observed outcome might have differed under different circumstances, such as whether a patient would have recovered had they received a different treatment. Such questions arise whenever decisions depend on the outcomes of alternatives that were not observed. Answering counterfactual queries generally requires knowledge of the underlying causal structure, which is often unavailable in practice. A common approach is therefore to first estimate the causal graph from observational data and then perform counterfactual inference. However, errors in the estimated causal graph can propagate to downstream counterfactual predictions. To address this challenge, we introduce the Counterfactual Graph Neural Process (CFGNP), an end-to-end approach that answers counterfactual queries directly from observational data without first estimating a causal graph. CFGNP uses Graph Neural Networks (GNNs) to exploit the dual-graph structure by restricting cross-world message passing to corresponding factual–counterfactual variables. Across synthetic and image-based benchmarks, CFGNP achieves stronger predictive performance than existing approaches, including on the German Loan benchmark, where it reduces MSE from 4.51 \times 10^-2 to 0.19 \times 10^-2 . Furthermore, on synthetic causal graphs, a model trained only on 10-node graphs maintains strong predictive performance on graphs with up to 30 nodes, without retraining.
[AI-13] A Baseline Assessment for the Agent ic Web Technology Stack
链接: https://arxiv.org/abs/2610.13703
作者: Vagner Figueredo de Santana,Diogo Cortiz
类目: Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET); Software Engineering (cs.SE)
备注:
Abstract:The fast pace in which protocols, frameworks, and technologies are being proposed for LLM-based agents results in a complex scenario for anyone aiming to create state-of-the-art AI solutions. Without an assessment on how different protocols, frameworks, and libraries work together to compose an Agentic Web solution, developers and organizations face different challenges (e.g., skilling, governance, infrastructure) even before becoming part of the Agentic Web ecosystem. In this context, we propose a system for performing Agentic Web evaluations called MASTIF (Multi-Agent System TestIng Framework) and present a baseline assessment of Agentic Web technologies, including 3 LLMs, 3 protocols, and 4 agent implementation frameworks, against 300 Mind2Web benchmark tasks. Results suggest that selecting a task-specific technology stack may result in gains of task completion rate, efficiency score, and social value stability scores; and reductions in verbosity and time to complete tasks. With the presented results, we expect to present a baseline in terms of metrics and results for this complex and fast evolving scenario for those aiming at designing, assessing, and developing multi-agent systems.
[AI-14] Calibration in One Go: Jointly Learning Accurate and Calibrated Neural Networks
链接: https://arxiv.org/abs/2610.13693
作者: Nektarios Kalampalikis,Pablo M. Olmos,Isabel Valera
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Machine Learning (stat.ML)
备注: 27 pages, 7 figures
Abstract:Neural networks (NNs), while highly flexible and versatile, are often poorly calibrated. Post-hoc calibration methods adjust the outputs of an already trained model using a separate calibration dataset and additional calibration parameters. This process adds overhead that requires separate optimization of the calibrator and subsequent model selection. In this paper, we show that standard (post-hoc) calibrators can be trained end-to-end with the backbone via a bilevel Stackelberg formulation. This formulation eliminates the need for a separate calibration set or a dedicated calibration loss by jointly optimizing accuracy and calibration using cross-entropy, introducing only one additional hyperparameter: the calibrator learning rate. Although our framework supports calibrators ranging from temperature and matrix scaling to NN layers, our results show that using the final classification layer itself as the calibrator yields accurate, well-calibrated models with no additional parameters. Our approach outperforms SOTA calibrators with minimal added complexity, while also avoiding the multiplicative overhead of separate calibration components in settings such as multi-task learning.
[AI-15] Variance-Reduced Policy Gradient is Nearly Minimax-Optimal
链接: https://arxiv.org/abs/2610.13692
作者: Leonardo Cesani,Matteo Papini,Marcello Restelli
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Standard Policy Gradient (PG) algorithms suffer from high estimation variance because they rely on Monte Carlo updates. While off-policy variance reduction mitigates this problem, establishing optimal sample complexity currently requires either restrictive assumptions, such as uniformly bounded importance weights, or impractical second-order operations. In this work, we introduce Loopless Variance-Reduced PG (LVR-PG), a unified theoretical framework that abstracts a class of first-order estimators that integrate recursive updates with defensive importance sampling, including known estimators such as PAGE-PG and STORM-PG. We prove that this algorithmic class achieves \tilde\mathcalO(\epsilon^-2) last-iterate global convergence under weak gradient domination for general parametric policies. We establish this guarantee using purely first-order updates, with minimal assumptions and without gradient preconditioners. By extending state-of-the-art lower bounds to continuous parametric policies, we establish an \Omega(\epsilon^-2) sample complexity limit, confirming our framework is minimax-optimal up to logarithmic factors and horizon terms.
[AI-16] A Step Harder Not a Step Too Far: The Benefits and Limits of Curriculum Difficulty Progression in GRPO
链接: https://arxiv.org/abs/2610.13669
作者: Ronghan Li,Fei Chen,Mingyu Lu
类目: Artificial Intelligence (cs.AI)
备注: 30 pages, 8 figures, 19 tables
Abstract:Curriculum learning typically organizes training samples from easy to hard. In GRPO, medium-difficulty samples are attractive for online selection because they are more likely to yield informative group-relative learning signals, and prioritizing them can improve training efficiency. However, it remains unclear whether persistently selecting such samples also leads to the strongest final model performance, or whether training can benefit from progressing toward harder samples. Meanwhile, sample difficulty changes as the policy evolves, so fixed difficulty estimates can become misaligned with the current policy. We therefore re-estimate sample difficulty under the current policy and, inspired by the easy-to-hard principle of curriculum learning, design and evaluate a staged curriculum that progressively shifts the active difficulty band toward harder samples. Experiments on GSM8K show that persistent medium-difficulty selection does not achieve the strongest observed performance. Across three random seeds, progressing to a moderately harder difficulty band improves test accuracy to 0.6591 \pm 0.0077 , compared with 0.6449 \pm 0.0024 for the fixed-medium curriculum. However, further progression to a harder difficulty band reduces accuracy to 0.6405 \pm 0.0053 . These results show that staged difficulty progression can outperform persistent medium-difficulty selection, but its benefit is non-monotonic. Effective GRPO curricula can therefore benefit from progressing beyond medium difficulty, while avoiding excessive progression toward overly difficult samples.
[AI-17] Pretraining and Test-Time Training Budgets Matter for ARC: A Controlled Study of VARC and TRM
链接: https://arxiv.org/abs/2610.13660
作者: Adrien Deliege,Marc Van Droogenbroeck
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: Accepted at BNAIC/BeNeLearn 2026
Abstract:The Abstraction and Reasoning Corpus (ARC) is increasingly used to evaluate whether neural networks can infer task-specific transformations from few demonstrations. Recent ARC models differ in architecture, but also in broader training and evaluation protocols, including pretraining data, data augmentation, test-time setup, and optimization budgets, making conclusions about architecture benefits debatable. In this work, we study how the performance of the vision-inspired VARC and recursion-based TRM models is affected by pretraining and test-time training (TTT) budgets under a common inductive protocol on ARC-AGI-1. We cross five pretraining budgets with four TTT budgets for each test task. Each budget specifies a task-variant count and total sample presentations, defining the controlled training budgets. We observe that increasing TTT sample presentations improves the standard ARC pass@2 metric in all settings for both models. Increasing the TTT task-variant count consistently helps only TRM, whereas VARC often performs better with fewer variants. VARC also remains competitive without pretraining, while TRM benefits much more from it. These results show that pretraining and TTT budgets affect ARC evaluation and motivate reporting at comparable budgets.
[AI-18] SelectArena: A Modern Benchmark for Feature Selection on Real-world Tabular Data
链接: https://arxiv.org/abs/2610.13644
作者: Bastian Schäfer,Dominika Matus,Lennart Purucker,Ricardo Knauer,Erik Rodner,Frank Hutter,Anton Sokolov,Arnaud Liefooghe
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: 9 pages, 6 figures, 2 tables
Abstract:Selecting a subset of features (columns) from a tabular dataset is a ubiquitous challenge in real-world applications. Industry experts seek to minimize model training costs, climate scientists require an interpretable subset of factors to understand extreme weather events, and clinicians need to choose among diagnostic tests due to financial and time constraints. When looking at the scientific literature to determine which feature selection method to use, practitioners across domains face an unrepresentative landscape of benchmarking. Despite extensive research, existing feature selection benchmarks provide limited guidance because they rely on outdated models, ad hoc evaluation protocols, or artificially generated data that do not reflect real-world problems. To close the gap between scientific benchmarking and real-world applications, we introduce SelectArena, a modern benchmark for feature selection. We compare 15 widely used feature selection methods on 71 manually curated real-world tabular datasets, covering classification and regression problems, using standardized evaluation protocols and state-of-the-art tabular (foundation) models. Our results reveal clear trade-offs across predictive performance, runtime, stability, and validity. Tree-based methods, CART and RFImportance, along with F-Test are Pareto-optimal when taking into account predictive performance and runtime. F-Test, information-theory-, and distance-based methods lead on stability and validity, with F-Test emerging as a balanced choice across our metrics. Search-based methods are slow, unstable and achieve low performance. SelectArena turns these findings into practical guidance and, as an extensible platform, supports future feature selection research.
[AI-19] Learning Size Independent Constraint Models from Input Data and Positive and Negative Example Solutions
链接: https://arxiv.org/abs/2610.13640
作者: Helmut Simonis
类目: Artificial Intelligence (cs.AI)
备注: 19 pages
Abstract:In this paper we describe a Constraint Acquisition Tool that generates size independent constraint programs from input data and positive and negative example solutions of multiple problem instances. The system finds size specific models based on typical constraint patterns over global and binary constraints, then generalizes the models to a size independent model that can be run on unseen input data. The system produces MiniZinc code as well as a textual description of the model. We evaluate the tool on the example problems of the PTHG21 Challenge and show the feasibility of the approach.
[AI-20] Humanize Olympiad Agents : A Multi-Session Workflow for Olympiad Problem Solving with Solve Review Wiki Verify
链接: https://arxiv.org/abs/2610.13632
作者: Zhengyang Zhang,Jing Xiong,Hongzhou Lin,Juihui Chung,Zijian Zhang,Song Han,Sihao Liu,Ligeng Zhu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large language model (LLM) agents are rapidly improving on long-horizon scientific and olympiad tasks. Recent systems have produced a Lean-formalized resolution of the Navier–Stokes problem and autonomous solutions to four open questions in the Erdős Conjectures database. Yet neither system releases both its underlying model and complete inference stack. More broadly, a single agent session remains brittle on difficult problems: early errors can propagate, missing domain knowledge can stall progress, and apparent success can mask a misinterpretation or weakening of the original task. We introduce HOA (Humanize Olympiads Agent), an open, flow-level framework that coordinates multiple agent sessions through three complementary feedback channels. First, an independent reviewer evaluates each candidate and provides actionable feedback. Second, a structured wiki supplies task-specific knowledge that may be missing or unreliable in model pretraining. Third, a verifier checks generated Lean proofs against trusted challenge statements. With GPT-5.6 Sol, HOA achieves perfect scores on the IMO, IPhO, and IOI 2026, near-full marks on the IChO 2026 problem set, and solves all 672 problems (100%) on PutnamBench. On the Lean-Eval leaderboard, HOA ranks first, solving 251 of 304 problems (82.6%). We further evaluate HOA with open models. Using Kimi-K3, HOA achieves full scores on the IMO, IPhO, and IOI, and a gold-level score of 97.1% on the IChO. These results closely match the closed-source GPT-5.6 Sol + /Goal baseline on the IMO and IPhO, while exceeding it on the IChO and IOI, demonstrating that systematic feedback can help bridge substantial differences in base-model capability.
[AI-21] SWE-DeceptionBench: Benchmarking Deceptive Behaviors of LLM s Across the Software Development Lifecycle
链接: https://arxiv.org/abs/2610.13626
作者: Xiting Liu,Lin Yang,Yitong Zhang,Jia Li,Shi-Min Hu
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注:
Abstract:Large Language Models (LLMs) are increasingly used throughout the software development lifecycle. This growing reliance on LLMs raises concerns about their trustworthiness, with deception posing a particularly important risk. Deceptive behavior takes the form of misleading responses or assistance in fabricating, concealing, or distorting information. To study this behavior, we introduce SWE-DeceptionBench, a benchmark for evaluating LLM deception in software engineering. The benchmark covers six lifecycle stages and two deception triggers: Active Deception, where models recognize infeasible or conflicting requirements but still present them as achievable, and Passive Deception, where models help fulfill explicit user requests to mislead others. We further introduce Neutral, Reward, and Pressure conditions to study the effect of external inducements, resulting in 720 test instances in Chinese and English. Evaluating seven mainstream LLMs, we find substantial deception even under the Neutral condition, with aggregate rates of 49.88% for Active Deception and 64.29% for Passive Deception. Deception rates vary across lifecycle stages, and external inducements affect Active and Passive Deception to different extents. We also evaluate lightweight defenses, finding that guard models miss many deceptive requests, and Self-Reminder reduces but does not eliminate deceptive responses. These findings highlight the need for more effective deception detection and mitigation methods to support trustworthy LLM-based software engineering.
[AI-22] AudioTETRIS: Token Elimination via Transitional Importance Signals for Efficient Audio LLM s
链接: https://arxiv.org/abs/2610.13600
作者: Shreya Sajid,Anna Vettoruzzo,Joaquin Vanschoren
类目: ound (cs.SD); Artificial Intelligence (cs.AI); Audio and Speech Processing (eess.AS)
备注:
Abstract:Large Audio Language Models (LALMs) achieve strong performance on speech-text tasks, but standard audio encoders produce hundreds of tokens for even short audio clips. Because self-attention scales quadratically in sequence length, this inflates inference-time compute substantially. Current training-free token compression methods prune or merge tokens based solely on coarse attention or feature similarity. However, treating audio tokens as generic, isotropic features smooths over spectral transitions, destroying fine-grained phonetic transitions essential for decoding speech. In contrast, speech signals exhibit highly structured temporal patterns where information density peaks at acoustic transitions. We propose AudioTETRIS, a training-free, two-stage framework that uses the audio encoder’s representation geometry as an acoustic prior for token importance before applying attention-based compression. Instead of discarding encoder structure after the encoding stage, AudioTETRIS propagates this prior directly into the LLM decoder to compute a per-token fused score. This score drives progressive top- k token selection across decoder layers without requiring additional training or auxiliary models. Evaluated on Qwen2-Audio-7B, Phi-4-Multimodal, and Audio Flamingo 3, AudioTETRIS retains near-uncompressed performance on several speech tasks using only 25% of audio tokens, matches or surpasses full-token accuracy at moderate compression rates, and consistently outperforms existing training-free baselines.
[AI-23] MENTOR: Learning from Failure with On-Policy Pedagogical Intervention
链接: https://arxiv.org/abs/2610.13594
作者: Guanlan Yue,Hang Yu,Xiaoyong Huang,Ruipeng Li,Wei Zhang,Bingchang Liu,Rui Wang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Reinforcement Learning from Verifiable Rewards (RLVR) is a key driver for Large Reasoning Models, but it is vulnerable to “zero-reward collapse”, a training failure where a sudden increase in task difficulty causes the learning signal to vanish. We argue that the conventional approach of discarding these failed trajectories is wasteful, as they contain valuable diagnostic information about the model’s cognitive gaps, a bright side that can be leveraged for recovery. Existing solutions, however, often regress to static, “off-policy-style” interventions like pre-defined hint libraries or perform post-hoc refinement, failing to provide the adaptive, forward-looking guidance needed to escape the collapse. To address this, we propose a paradigm shift towards on-policy pedagogical intervention and introduce MENTOR, a multi-agent framework that acts as a live mentor. MENTOR diagnoses the root cause of failure in real-time and dynamically generates targeted, instructional prompts to guide the learning agent’s next attempt. As a plug-and-play module, MENTOR integrates seamlessly into existing policy optimization pipelines like GRPO without modifying the training infrastructure. Extensive experiments on math and code generation show that MENTOR effectively mitigates zero-reward collapse, outperforming state-of-the-art baselines. Notably, it achieves massive average relative gains of up to 78.3% on Llama-3.2-3B-Instruct over its base model.
[AI-24] Constructing Pareto Frontiers of Optimal Reasoning Termination Methods for Overthinking in Reasoning Models
链接: https://arxiv.org/abs/2610.13570
作者: Weixin Guan,Liang Li,Shiyu Xie,Jiapeng Liu,Bing Li,Peng Fu,Chengyang Fang,Xiaoshuai Hao,Can Ma,Weiping Wang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Reasoning models can benefit from test-time scaling, but continued reasoning may become ineffective or harmful, a phenomenon termed overthinking. Evaluations against full thinking compare accuracy and token usage but lack references for overthinking severity and strategies’ theoretical mitigation potential. To characterize overthinking at the model-task level, we first introduce Step-wise Truncation Probing (STP), repeatedly generating answers from multiple retained prefixes along each fixed sampled reasoning trajectory. Using each trajectory’s earliest measured position attaining maximum empirical accuracy as a reference, we define Overthinking Ratio and Accuracy Degradation as the fraction of thinking tokens generated afterward and the accuracy decrease from this reference to full thinking, respectively. Secondly, we then formulate dynamic routing, fixed budgets, and dynamic early exit within a unified framework to quantify the theoretical mitigation potential of different termination strategies. Based on this unified framework, we use the complete STP measurements to construct a token-accuracy Pareto frontier for each strategy under a common normalized thinking-token budget. We further develop OTBench, a reusable benchmark built from the STP process, which produced 70.5B reasoning tokens and the corresponding probing measurements across six models and four benchmark groups.
[AI-25] MAGMA-Bench: Evaluating Long-Horizon Embodied Agents under Dynamic Tasks and Execution Failures
链接: https://arxiv.org/abs/2610.13534
作者: Loan Bernat(LAAS-GEPETTO),Matthieu Grard,Ariane Herbulot(LAAS-RAP),Florent Lamiraux(LAAS-GEPETTO)
类目: Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注:
Abstract:Long-horizon embodied agents must maintain task-relevant information, coordinate heterogeneous robots, and adapt their decisions as execution unfolds. Existing benchmarks investigate dynamic task execution and embodied multi-agent coordination, but provide limited evaluation of their intersection. We introduce MAGMA-Bench, an architecture-agnostic benchmark for persistent task reasoning in dynamic multi-robot environments. MAGMA-Bench evaluates agents across increasing task horizons and controlled online perturbations, including execution failures, task interruptions, and mission updates, with scenarios requiring coordination across robots with heterogeneous capabilities. It uses a structured skill-level interface to separate task-level reasoning from perception and low-level control. We evaluate locally deployable open-weight planners, multi-agent state-tracking strategies, and frontier models. Even the strongest evaluated models fail on a substantial fraction of clean episodes, and their success rates decrease further under online perturbations. Supervised adaptation greatly improves a small model, but performance remains substantially lower on longer and multi-robot missions. We release the benchmark, 261,646 task-level training examples, and an architecture-agnostic expert-trace generation pipeline.
[AI-26] Beyond Domain-Routed Supervision: Cross-Teacher Guarding for Multi-Teacher On-Policy Distillation
链接: https://arxiv.org/abs/2610.13521
作者: Shi-Yu Tian,Yong Liu,Ximan Liu,Tianrui Zhu,Sule Bai,Xinwei Yang,Ruiqi Liu,Kun-Yang Yu,Ming Yang,Zhi Zhou,Yu-Feng Li,Yipeng Sun,Gu Simiu
类目: Artificial Intelligence (cs.AI)
备注: 30 pages, 9 figures, 10 tables, including references and appendices
Abstract:Multi-teacher on-policy distillation (MOPD) extends on-policy distillation (OPD) by routing domain-specific data to specialized teachers, integrating their capabilities through dense token-level supervision on student-generated trajectories. However, domain routing only distinguishes the supervision sources for different domains; updates from all domains still act on shared parameters. When teachers differ substantially in response style and domain expertise, supervision that is effective in isolation may still lead to persistent gradient conflicts and capability degradation during joint optimization. To address this challenge, we propose Cross-Teacher Guarding for MOPD (Road MOPD), which introduces non-routed teachers as auxiliary cross-domain critics on the same student trajectories and coordinates multi-teacher supervision through token-level credit assignment and gradient updates. Specifically, cross-teacher-guided credit assignment uses teacher agreement to strengthen token-level corrections jointly supported by the teachers and attenuate conflicting signals; preventive multi-teacher gradient projection uses auxiliary gradients from the same trajectories to constrain potentially conflicting updates and adaptively controls projection strength to retain target-domain learning signals. In experiments, Road MOPD mitigates degradation in the disadvantaged domain, gains over 5 percentage points under high conflict, and improves overall performance in low-conflict and three-domain settings.
[AI-27] Causal Effect Identifiability in Causal Abstractions: A Strict Hierarchy of Criteria
链接: https://arxiv.org/abs/2610.13520
作者: Clément Yvernes,Marianne Clausel,Emilie Devijver,Eric Gaussier
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Identifying causal effects from observational data typically requires a fully specified causal graph, an assumption that is often unrealistic in complex or high-dimensional settings. Causal abstractions address this limitation by retaining only partial causal information, thereby defining equivalence classes of compatible causal graphs. In this paper, we study causal effect identifiability directly at the level of these graph collections, rather than at the level of individual causal diagrams. We formalize several notions of identifiability in this setting and organize them into a hierarchy that clarifies their relationships and differences. In particular, we establish that a causal effect may be identified over a collection of graphs without admitting a single causal derivation that holds uniformly across all compatible graphs. These results help reveal gaps and clarify ambiguities in the existing literature.
[AI-28] RESCUE: Is This Alarm Worth Acting On? Counterfactual Evaluation of VLA Runtime Monitors
链接: https://arxiv.org/abs/2610.13516
作者: David Ahmedt-Aristizabal,Abdelwahed Khamis,Mohammad Ali Armin,Lars Petersson
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Runtime failure monitors for robot policies are typically evaluated by how accurately they distinguish failed from successful executions. Yet an accurate alarm may arrive too late for recovery, while an unnecessary intervention may disrupt an execution that would otherwise succeed. We introduce RESCUE, a counterfactual framework for evaluating whether a monitor’s alarms enable useful interventions. By restoring simulator and policy states at execution checkpoints, RESCUE compares alternative actions, identifies the latest checkpoint satisfying a specified recovery criterion, and evaluates whether acting on alarms reduces expected task-completion cost. We evaluate RESCUE with OpenVLA-OFT and \pi_0.5 over LIBERO-Spatial and LIBERO-Plus using 128,340 counterfactual branches. Recoverability depends on the state–intervention pair rather than on robot state alone: at \tau=0.5 , 14 of 66 OpenVLA-OFT/LIBERO-Plus failures contain a recoverable checkpoint under continuation, compared with 34 of 66 under continuation or scripted recovery, while recovery reduces recoverability in other conditions. On the primary strong-policy conditions, favourable detection scores do not establish lower intervention cost. Under the evaluated stop-and-reset model, even an idealised detector can afford only a 2.0–3.3% false-alarm rate before unnecessary resets outweigh the savings from stopping failures early. These results show that monitor value depends jointly on the intervention available and the workload in which it is deployed.
[AI-29] Humanize MLE Agents : Multi-Agent Agent s: Multi-Agent Session Alternation Beyond Single-Agent Limits
链接: https://arxiv.org/abs/2610.13494
作者: Changye Li,Zijian Zhang,Muheng Li,Yiduo Pang,Tingjun Wu,Menghan Li,Yitong Liu,Hongkai Guo,Mengchi Chen,Chenyu He,Kaisheng Ma,Wei Xu,Song Han,Sihao Liu,Ligeng Zhu
类目: Artificial Intelligence (cs.AI)
备注: 32 pages, 10 figures. Code: this https URL
Abstract:Existing LLM-based agent approaches for long-horizon machine learning engineering (MLE) often use context engineering, implemented through custom harnesses that manage tools, skills, and accumulated experience. However, we find that as single-session execution lengthens, the agent’s reasoning intensity declines alongside slowing progress, summarized as long-horizon deceleration, and the benefits of these custom harnesses vanish as the underlying model improves, summarized as harness staleness. These findings suggest that their benefits may not persist across versions, which motivates a workflow-level approach in which agents build on one another’s work across sessions. We model these alternating agent sessions as a context-reset semi-Markov decision process (CR-SMDP) and establish sufficient conditions for alternation to exceed single-agent reference limits, derive an explicit experiment-budget bound, and characterize when session caps preserve this advantage. Guided by this analysis, we introduce Humanize MLE Agents (HMA), which alternates two agents on a shared workspace, limits each session to at most k experiments and resets the context between sessions, without additional task-specific harness or prior knowledge supplements. Across 75 Kaggle tasks in MLE-bench, HMA reaches a state-of-the-art any-medal rate of 78.2%, exceeding the strongest open-source baseline by 8.0 points with a quarter of its time budget. Moreover, among six configurations spanning five heterogeneous agent pairs, HMA improves any-medal rate over the constituent baselines by 6.4 points on average, demonstrating cross-pair generality. A supplementary case on kernel optimization reaches 878 cycles, within 1.6% of the community leaderboard leader, demonstrating applicability beyond MLE.
[AI-30] Branching On-Policy Distillation
链接: https://arxiv.org/abs/2610.13481
作者: Dongyang Chen,Shudong Liu,Shubo Li,Duoxun Tang,Jinwei Liang,Zehuan Wu,Lewei Lu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:On-policy distillation (OPD) provides teacher supervision on student-generated trajectories, but a single trajectory realizes only one continuation at each decision, limiting supervision coverage under a finite sampling budget. We propose BranchOPD (Branching On-Policy Distillation), which selects informative decision points using student uncertainty and teacher-student disagreement, resamples student-policy continuations from shared prefixes, and applies token-level teacher supervision to both main trajectories and branches. BranchOPD operates at token-level decisions in mathematics and within-turn decisions in agent tasks. Shared-prefix reuse reduces student-generated token costs by approximately 19% on ALFWorld and 31% on WebShop relative to seven independent trajectories. We also introduce protocol-boundary repair (PBR), which uses targeted supervision under protocol constraints to mitigate repetition and wasted generation. BranchOPD outperforms Vanilla OPD and Multi-Rollout OPD (n=7) across all evaluated benchmarks, with gains over Vanilla OPD of 18.55 percentage points in mean mathematics accuracy over 16 sampled answers (avg@16) and 13.8 points in mean ALFWorld ID/OOD success. Mechanistic analyses and selection ablations show that branching at uncertain decisions expands subsequent behavior coverage and outperforms random selection and turn-initial branching.
[AI-31] A Local Agent ic AI Framework to Generate Edge Case Scenarios for Safety Assurance
链接: https://arxiv.org/abs/2610.13479
作者: Victoria J. Hodge,Colin Paterson,Rob Alexander
类目: Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注:
Abstract:Generating edge case scenarios is crucial for training, testing and safety assuring autonomous systems. This identifies hazardous failures to increase system reliability and robustness, ensures the system can still function safely on the boundaries of its operational design domain and learns the expected system behaviour for these edge cases. The rapid advancement in the generation and analysis capabilities of language models (LMs) has expanded their applicability and recent work has investigated LM scenario generation. However, many recent approaches rely on human-in-the-loop or rule-based strategies. This restricts the LM’s ability to generate diverse and edge case scenarios; the long tail of the distribution. Our work uses local LMs in a laptop-based agentic AI framework for adaptive scenario generation. This is cheap, fully-controlled, ensures data privacy and security. It uses think, act, observe, update, and continue loops with lightweight JSON encoding to generate scenarios. We use the system requirements, system description and environment description as knowledge bases in contextual prompts for an LM to ensure scenario realism. A second, independent LM critiques each scenario using domain specific criteria so it can be refined. The refined scenarios are run in simulation and evaluation metrics collected. These metric scores are analysed and similar scenarios are created for edge cases (exploitation) or novel scenarios are generated to explore the scenario space. Post-hoc clustering using metric scores and thematic-type analysis of the rich-text scenario descriptions produced by the LM pinpoints functional gaps and their triggering conditions. This creates traceable evidence for the safety assurance case. Our work highlights the potential of a flexible and adaptive local agentic AI framework for automating edge case generation and producing traceable safety assurance evidence.
[AI-32] SqueezeBench: Saturation-Resilient Evaluation of Mathematical Capability
链接: https://arxiv.org/abs/2610.13461
作者: Pablo Manrique,Hai Xia,Stefan Szeider
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Logic in Computer Science (cs.LO)
备注:
Abstract:AI systems are making rapid progress in mathematics, but this progress is hard to measure. Benchmarks of solved problems saturate, and in benchmarks of open problems each problem can be resolved for the first time only once. We present SqueezeBench, a benchmark that is resilient to saturation: a success raises the bar instead of removing the problem. Each problem fixes an integer function f(n) whose values are known only for small n , and the benchmark keeps a lower and an upper record on it. A record is a computable Lean function with a machine-checked proof that it bounds f . A submission proposes a new function and proves that it bounds f , that it is no worse than the current record at any n , and that it is strictly better at some n . Once accepted, it becomes the record that the next submission has to beat. The system thus chooses the bound as well as its proof, and it may improve the record at a single n or its growth rate. At every n , the gap between the two records shows how far the certified bounds are from determining f(n) . Every proof is checked by two independent Lean kernels, so no referee needs to check the mathematics. The checks also reject a function that computes f by exhaustive search at small n , and a maintainer only reads the submitter’s report and looks for such a search at larger n . We release ten problems from extremal combinatorics with twenty proved initial records and the admission tools. As a baseline, agents based on a frontier language model, with at most one hour per record, had 82 submissions accepted and improved every record, without going beyond the published literature. Agents based on two newer models then started from these records, had 60 more submissions accepted and improved 19 of the 20 records again. For eight of the ten problems, at least one record is still asymptotically behind the best published bound.
[AI-33] Agent ic Large Language Models
链接: https://arxiv.org/abs/2610.13455
作者: Max van Duijn,Michiel van der Meer,Aske Plaat,Niki van Stein
类目: Artificial Intelligence (cs.AI)
备注: 472 pages, textbook
Abstract:Large language models (LLMs) have taken the world by storm. Their ability to communicate with us in our own language, and to reason about our world, has made them a favorite tool for writing, answering questions, and much more. Their answers already influence our decisions and our actions. What would happen if LLMs themselves could act in the world directly? What would happen if LLMs could interact with each other? Agentic LLMs combine the power of large language models with the ability to act in the real world. In this book we will discuss how agentic LLMs work, how they act, how they interact, and what this means for us, as users.
[AI-34] Rollout-Time Intervention: Unlocking Agent ic Reinforcement Learning Beyond Policy Limits
链接: https://arxiv.org/abs/2610.13438
作者: Chen Xi,Ding Ruixue,Wang Zhigaoyuan,Zhang Fanrui,Zhang Qiang,Chen Boli,Wang Shihang,Wang Tianfu,Ren Ailin,Wang Pengyong,Xie Pengjun,Xiong Hui
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Reinforcement learning (RL) has emerged as a key paradigm for improving large language model (LLM) agents, enabling stronger reasoning, planning, and tool-use in interactive environments. However, existing agent RL methods remain fundamentally constrained by an on-policy reasoning bottleneck: when tasks exceed the model’s current capability boundary, effective trajectories become extremely sparse and training often collapses. We introduce Rollout-Time Intervention (RTI), a technique designed to elicit successful trajectories beyond the policy’s intrinsic exploration capacity. RTI operates by leveraging reward-side evidence (i.e., evaluation rubrics) during rollout to convert erroneous trajectories into successful ones, providing effective learning signals for tasks that the policy rarely solves on its own. Although intervention trajectories are inherently off-policy, we find that they can effectively guide policy optimization when trajectories with excessive distributional shifts are filtered out. Extensive experiments across five benchmarks demonstrate that RTI consistently outperforms RL baselines, enabling the post-trained policy to approach the performance of substantially stronger contemporary LLMs and, more importantly, transcend its original capability boundary. The code is available at this https URL.
[AI-35] Local Diagnostics of Learned Event Representations for Anomaly Detection at the HL-LHC
链接: https://arxiv.org/abs/2610.13437
作者: Donatella Genovese,Philip Ploner,Simone Scardapane,Stefano Giagu,Thea Klaeboe Aarrestad
类目: Artificial Intelligence (cs.AI); High Energy Physics - Experiment (hep-ex); High Energy Physics - Phenomenology (hep-ph); Data Analysis, Statistics and Probability (physics.data-an)
备注: Submission to SciPost
Abstract:Anomaly detection, the identification of collision events that deviate from Standard Model expectations, is one of the most promising model-agnostic strategies for new-physics searches at the Large Hadron Collider. Searching for rare events in learned low-dimensional representations removes the need to commit to hand-crafted observables a priori, but sacrifices the immediate physical interpretation those observables provide. For anomaly detection to enter a discovery pipeline, flagged events must therefore be diagnosed locally, both to distinguish potential new physics from mismodeling or detector effects and to identify observables for targeted follow-up searches. We evaluate supervised and self-supervised neural embedding strategies on COLLIDE-2V, a 750-million-event dataset simulated under realistic High-Luminosity LHC conditions, using the reconstruction error of an autoencoder trained in the learned latent space as the anomaly score. Across the configurations and benchmark signals considered, supervised objectives, which exploit simulation process labels during training, generally outperform their self-supervised counterparts and, in their best configurations, improve on an autoencoder trained directly on kinematic features, raising the signal efficiency at 10% background acceptance on all held-out processes. We further introduce a local diagnostic pipeline that fits a Gaussian Mixture Model to the SM latent space, profiles each component through high-level observables without process labels, localizes the flagged events, and ranks observables by their local discriminating power. The ranking recovers the defining kinematics of the held-out processes, while correlating the anomaly score with the same observables quantifies how closely the score tracks them, revealing cases where the most discriminating observable is not the one the score follows most closely.
[AI-36] In-Context Learning for System Identification: Probabilistic Formulation Long-Sequence Handling and Benchmark Validation
链接: https://arxiv.org/abs/2610.13411
作者: Matteo Rufolo,Dario Piga,Filippo Pura,Marco Forgione
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Systems and Control (eess.SY)
备注:
Abstract:Traditional system identification typically involves two steps: initially, training data is processed to estimate a model of the system of interest; then, the model is used to predict outputs for new input queries. In contrast, recent in-context learning approaches learn a meta model that maps directly from training data and query inputs to outputs in a zero-shot fashion, bypassing explicit model estimation. This approach leverages a meta model trained offline, on large sets of synthetically generated data, to emulate the behavior of a system identification algorithm. In this work, we advance this meta-learning framework for system identification in three directions. First, we develop a unified probabilistic meta-identification architecture that combines a Transformer-based encoder-decoder with tailored mechanisms for handling long training sequences, enabling calibrated predictions over long horizons. Second, we show how a pre-trained meta model can act as an uncertainty-aware synthetic data generator for classical system identification, providing task-specific data that regularize parametric models when real data are scarce. Third, we systematically evaluate the framework on standard nonlinear system identification benchmarks and on a challenging out-of-distribution scenario, demonstrating competitive accuracy with state-of-the-art methods and strong generalization, including cases where input-only adaptation is sufficient to handle significant distribution shifts.
[AI-37] RegulaTutor: A Theory-Informed Framework for Long-Term Personalized Learning
链接: https://arxiv.org/abs/2610.13399
作者: Yonggang Li,Boqian Han,Rui Sheng,Yushi Sun,Zixin Chen
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Long-term personalized tutoring requires language models to translate a learner’s evolving history into appropriate instructional support. Existing LLM-based tutoring systems use memory and retrieval to personalize responses, but the pedagogical rationale linking historical evidence to teaching strategies is not always explicit. We introduce RegulaTutor, a theory-informed framework for long-term personalized tutoring that connects historical evidence, learner interpretation, and learner-facing instruction. Guided by self-regulated learning (SRL) research, its tutoring harness operationalizes a cognitive, affective, metacognitive, and motivational (CAMM) framework for deriving evidence-supported learner interpretations and teaching policies. The resulting policies retain links to their supporting evidence and are updated as new observations arrive. This staged workflow also supports systematic refinement through PairRoute, an offline procedure that uses intermediate execution records to distinguish harness, model, and mixed failures. PairRoute proposes and evaluates targeted harness revisions, then constructs reviewed stage-level supervision for confirmed model failures remaining under the selected harness. We focus this refinement on historical evidence acquisition, which underpins personalized instruction and allows outputs to be checked against learning records and reference answers. RegulaTutor improves historical-evidence accuracy, learner diagnosis, and judged teaching quality on average across evaluated model configurations. PairRoute results show an endpoint improvement in standalone-model historical-evidence accuracy over the refinement trajectory. Together, these results highlight RegulaTutor’s potential to support lifelong personalized education through instructional policies that evolve with learner histories and targeted improvements to the tutoring system.
[AI-38] AgentS WE: Can Coding Agents Agent s Build the Agent You Actually Want?
链接: https://arxiv.org/abs/2610.13361
作者: Jiahao Wang,Hongjin Qian,Yuyang Hu,Jiajun Zhang,Zheng Liu
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Code: this https URL
Abstract:As the production of software passes into the hands of software itself, coding agents are increasingly commissioned to build agents fitted to their users’ own workflows. This delegation carries a quiet assumption, that the delivered agent will faithfully serve the requirement it was built for, rather than merely appear to. No existing benchmark tests that assumption. We introduce AgentSWE, a benchmark for agent software engineering spanning three stages of the agent development lifecycle: Creation of a complete agent from a natural-language requirement, Editing of production agent codebases, and Optimization toward a measurable target. Each of its 25 tasks is framed as a commission rather than an exam: the builder iterates against a handful of illustrative cases, while acceptance exercises the frozen submission on held-out cases designed to span the full requirement, grading behavior against requirement-derived rubrics under hard pass/fail gates or, for Optimization, against the source benchmark’s own objective. Evaluating a range of coding agents across models and harnesses, we find that none comes close to delivering what a requirement asks for: the gap between what a builder demonstrates and what it delivers is the norm, not the corner case. An accompanying empirical analysis of the failure trajectories identifies recurring failure modes, among them overfitting to the visible cases, hollow runtimes behind code that looks complete, and unsupported claims of completion, each a signal by which coding agents can learn to build the agents they are asked for.
[AI-39] SWE-Critix: Post-Training Generalist Verifiers for Assessing Coding-Agent Trajectories
链接: https://arxiv.org/abs/2610.13356
作者: Jiajun Hu,Chun Yong Chong
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Coding agents are increasingly deployed for end-to-end software engineering tasks, where a readily available oracle evaluator that defines the success criteria is often absent. This motivates verifications for coding agents that can reliably judge and explain their behavior. However, verification is non-trivial as coding agents are increasingly capable of solving long-horizon software engineering tasks. Their execution trajectories can be extremely long, containing hundreds of iterative interactions with code repositories and external tools. Existing verifiers either rely on general-purpose LLMs without specialized training or train dedicated critics that predominantly focus on producing scalar rewards, highlighting the relatively limited exploration of training-based generalist verification. We introduce SWE-Critix, a post-training pipeline for training generalist verifiers of coding-agent trajectories. Given a task and its execution trajectory, the learned verifier predicts the completion label and generates a natural-language analysis that explains its judgment. Our pipeline combines supervised fine-tuning (SFT) with reinforcement learning (RL) and trains a series of 30B models on trajectories from CodeForge-Preview. On a held-out test set, SWE-Critix improves classification accuracy from 57% for the base Qwen3-30B-A3B reasoning model to 66% after SFT and 78% after RL. We release our models, datasets, and training code to facilitate further research.
[AI-40] AlphaNIST: Emergent Assembly Skills from Binary Task Rewards ICRA
链接: https://arxiv.org/abs/2610.13354
作者: Octi Zhang,Iretiayo Akinola,Rosario Scalise,Mateo Guaman Castro,Patrick Yin,Tobias Widmer,Miles Macklin,Chris Amevor,Dylan Turpin,Dirk Van Gelder,Jan Carius,Ankur Handa,Gavriel State,Yunrong Guo,Yashraj Narang
类目: Artificial Intelligence (cs.AI); Robotics (cs.RO)
备注: 8 pages, 9 figures, ICRA
Abstract:The NIST Assembly Task Board #1 remains a challenging benchmark for learning-based methods in robotic manipulation. Over short horizons, it demands precise, contact-rich control of small, tight-fitting parts. Over long horizons, it requires recovery and coordination across extended action sequences. Demonstrations, task decomposition, and dense progress rewards have enabled research advances by providing guidance on how to assemble. But how much of the strategy must be specified? The progression from AlphaGo to AlphaGo Zero showed that RL at scale can discover superhuman strategies without prescribing how to win. AlphaNIST asks whether a sparse binary task reward and task diversity admitted by this task-agnostic reward can similarly let a robot discover how to assemble. In simulation, we train a single policy from scratch across all 20 assembly tasks on the NIST Assembly Task Board #1, reaching 98.2% overall training success without demonstrations, progress shaping, scripted primitives, or per-task tuning. The framework also trains policies to complete ten assembly pairs in a single episode without a prescribed order, with task success rewarded only when all ten pairs are simultaneously complete. The learned policies discover dexterous and planning-like behaviors: choosing grasps for later assembly, using surrounding geometry to reorient parts, and preparing one part, assembling another, then returning to finish the first without an explicit planner. For videos, see our website: this https URL
[AI-41] Masked Diffusion Language Agents for Tool-Integrated Chemical Reasoning NEURIPS2026
链接: https://arxiv.org/abs/2610.13330
作者: Mengdi Liu,Chenghao Jia,Hong Chang,Shiguang Shan
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: Accepted at NeurIPS 2026
Abstract:Designing tool-integrated reasoning agent systems for complex chemical tasks remains a fundamental challenge. Although recent chemical agents have demonstrated promising performance through the integration of external tools, they are still built on the autoregressive paradigm, which is inherently constrained by causal attention and left-to-right generation. As a result, they often struggle with bidirectional molecular understanding, global coordinated tool planning and multi-source evidence integration. To address this challenge, we introduce ChemDiffAgent, the first masked diffusion language agent for tool-integrated chemical reasoning. It reformulates chemical reasoning as iterative denoising over interleaved reasoning and tool-use trajectories, enabling tool-use decisions to be jointly determined under full-trajectory context and thereby better aligning the agent’s decision boundary with its knowledge boundary. We further analyze how this paradigm benefits agentic reasoning through harder infilling subproblems during training and flexible arbitrary-order decoding during inference. Then we develop a two-stage post-training framework, comprising agentic supervised fine-tuning and variance-reduced preference optimization, to enhance tool-use and reasoning capabilities. We also construct a comprehensive benchmark covering six chemistry tasks across both single-turn and multi-turn tool-use scenarios. Under matched budgets and evaluation, ChemDiffAgent consistently outperforms autoregressive agents, achieving an overall improvement of approximately 20%. Notably, our 8B model achieves performance comparable to, in some cases surpassing, significantly larger frontier models, such as GPT 5.5 and Claude Opus 4.7. Code is available at this https URL.
[AI-42] Agent 4Spec: An LLM -based Agent ic System to Optimize API Specifications through Automated Validation and Market Analysis
链接: https://arxiv.org/abs/2610.13273
作者: Yongjian Tang,Costel Moraru,Doruk Tuncel,Hanya Elhashemy,Steffen Klepke,Thomas Runkler
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: Accepted to FLLM main track
Abstract:API specifications serve as critical documentation for modern software development, directly impacting integration efficiency and client code generation. While recent advancements have leveraged Large Language Models (LLMs) to generate initial specifications from source code, existing approaches treat this process as a one-time event - overlooking the needs for continuous validation, long-term maintenance, and market-driven evolution of these artifacts. To address this issue, we present Agent4Spec, an autonomous multi-agent framework featuring two distinct pipelines: (1) a validation pipeline that detects and self-corrects OpenAPI syntax errors, and (2) a market analysis pipeline that conducts competitive research, identifies functional gaps against industry leaders, and automatically generates missing API-spec functionalities. We evaluate Agent4Spec on two curated datasets of API specifications spanning both general-purpose and industrial scenarios. Among 9 SOTA LLMs, the top-performer achieves 100% syntax error detection rates and over 95% implementation success for proposed corrections, while securing over 50% adoption rates for suggested endpoint improvements, representing a practical tool for API development.
[AI-43] Forgetting is Not Always Bad: A Neuro-Inspired Memory Repair Mechanism for Poisoned LLM Agents
链接: https://arxiv.org/abs/2610.13267
作者: Lei Liu,Yunji Liang,Xiaowen Zhang,Jingqi Liu,Qi Li,Bin Guo,Zhiwen Yu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large language model (LLM) agents are highly vulnerable to memory-poisoning attacks. Existing defenses primarily rely on external modules for either static memory isolation or continuous online auditing, resulting in low memory efficiency and high computational overhead. To address these limitations, inspired by neuroscientific mechanisms that weak reactivation can destabilize memories and induce decay in the absence of reinforcement, we propose an agent-intrinsic training-free memory repair framework, DREAM (Dynamic Reactivation for Engram Attenuation in Memory), that enables selective functional forgetting of poisoned memories. Specifically, DREAM implements a three-stage pipeline: perturbation-induced implicit reactivation to reveal the structural fragility of malicious memories, adaptive anomaly diagnosis based on multi-dimensional activation patterns to detect topological anomalies, and a dynamic memory repair module that selectively suppresses harmful memories while reinforcing benign ones. Extensive experiments across diverse attackers and real-world tasks demonstrate that DREAM reduces attack success rates by over 95% against backdoor poisoning while preserving strong benign utility. DREAM also achieves competitive robustness against injection attacks. In terms of runtime and token consumption, DREAM achieves up to a 2.13 \times speedup and a 37.7% reduction in token consumption compared with A-MemGuard. Furthermore, DREAM also achieves a task success rate of 92.96% on poisoned multi-agent systems.
[AI-44] abular Foundation Models Are Effectively Shallow
链接: https://arxiv.org/abs/2610.13253
作者: Irene Cannistraci,Julia E. Vogt
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:In-context-learning Tabular Foundation Models (TFMs) are uniquely suited to scenarios with limited resources or privacy constraints, as they solve new tasks without additional training. However, their architecture consists of multiple transformer blocks, resulting in high computational and memory footprints. Meanwhile, traditional alternatives like Gradient-Boosted Decision Trees (GBDTs) remain highly competitive and run efficiently on CPUs, suggesting that tabular tasks may not inherently require deep architectures. This contrast raises a fundamental question: can TFMs be simplified by removing architectural redundancies without sacrificing performance? To answer this, we introduce a closed-form, label-free affine translator that replaces a contiguous window of up to 96% of the blocks, leaving the rest unchanged. Evaluating eight frontier TFMs on 171 classification datasets, we reveal that tabular transformers are vastly overparameterized: replacing half of a model’s blocks costs at most 0.002 median AUROC across all architectures, with the half-depth TabFM still outperforming every other full-depth TFMs and tuned GBDTs. Furthermore, different model families are overparameterized in different ways: TabPFN-3 relies on its encoders, maintaining performance regardless of which single block is retained. Other single-axis models spread computation thinly, needing only their first block, while dual-axis models concentrate it in one critical block. Ultimately, removing depth saves up to 1.5B parameters, speeds up GPU inference by up to 6\times at a median cost of 0.03 AUROC, while a single-block TabPFN-3 serves cached queries 2.4\times faster using 6\times less memory at negligible cost.
[AI-45] ReSFlow: Rectifying Categorical Flows on Statistical Manifolds for One-Step Generation
链接: https://arxiv.org/abs/2610.13225
作者: Xiaohuan Jia,Renzhe Xu,Xiao Wang,Jiayun Wu,Shaohua Fan
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Generative modeling for discrete data has been significantly advanced by learning continuous vector fields on the statistical manifolds to transport simple priors to target discrete distributions. However, because these continuous-time flows are not constrained to follow geodesics on the statistical manifold, thereby requiring multi-step numerical integration for simulation and leading to substantial computational costs during inference. In this work, drawing inspiration from the “straight and fast” properties of Rectified Flow in continuous Euclidean space, we propose the Rectified Statistical Flow (ReSFlow) model, which enables one-step categorical generation on statistical manifolds by explicitly learning geodesic trajectories that adhere to the intrinsic Riemannian geometry. By rectifying the flow on the statistical manifold, we theoretically guarantee that trajectories between prior and target distributions approximate geodesics. This rectification significantly reduces the transport cost by aligning the learned trajectories directly along geodesics on the statistical manifold, allowing the model to map pure noise to target discrete data in a single step. Through extensive experiments on diverse real-world generative tasks, ranging from image and text to biological domains, we demonstrate ReSFlow’s superior one-step generation quality, which truly embodies geodesically optimal and rapid categorical generation. Our code is available at this https URL.
[AI-46] Beyond Actions: Learning Future Operation Targets for Vision-Language-Action Models
链接: https://arxiv.org/abs/2610.13212
作者: Min Lin,Bokai Zhou,Jianqi Lin,Kaiyuan Yang,Yicheng Chang,Junjie Yu,Xiaofan Liu,Jianhua Han,Rui Li,Shen Zhao,Xiaodan Liang
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注:
Abstract:Actions specify what a robot should execute, but do not describe what those commands will achieve. Vision-language-action (VLA) policies nevertheless learn primarily by predicting action chunks from images, language, and state. We introduce Action–Future Coupled Effect Learning (AFCE), which makes a future-grounded physical Effect the policy’s primary prediction target. An offline tokenizer constructs temporally ordered Effect tokens from demonstrated actions, realized robot responses, and sparse visual transitions. Reconstruction objectives encourage the representation to retain executable detail and observed physical change. A flow-matching VLA predicts Effects from current images, instruction, and robot state, while a state-conditioned decoder converts them into action chunks. Embodiment-specific interfaces allow single- and dual-arm tasks to share the Effect model. On DexJoCo, AFCE achieves 50.97% overall success, improving over \pi_0.5 and UVT by 11.82 and 15.21 percentage points, respectively. It leads on all five bimanual tasks, highlighting the value of Effect supervision for coordinated dexterous manipulation. The project page is available at this https URL.
[AI-47] Does Learning Recurrent Networks Matter in Partially Observable RL?
链接: https://arxiv.org/abs/2610.13197
作者: Zekang Wang,Zhe He,Gaojie Jin
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Reinforcement learning (RL) under partial observability typically re- lies on recurrent networks to encode temporal information, with the recurrent module trained jointly with the policy or value function. This raises a natural question: is learning the recurrent network actually necessary? In this paper, we investigate whether a frozen recurrent network can provide sufficient memory for solving par- tially observable Markov decision processes (POMDPs). Motivated by the theoretical foundations of Reservoir Computing (RC) and Generalized Reservoir Computing (GRC), we study a simple archi- tecture that combines a fixed recurrent network with a trainable nonlinear output module. We evaluate this approach across tasks with varying memory demands, observation modalities, and action spaces. Surprisingly, frozen recurrent networks support recall over hundreds of steps and achieve competitive control performance across diverse POMDPs, while using less than half the number of trainable parameters required by their fully trainable counterparts. These results suggest that learning the recurrent memory module is not always necessary for solving POMDPs. Frozen recurrent networks therefore provide a simple, parameter-efficient, and sur- prisingly strong baseline for partially observable RL. Our source code is available at this https URL
[AI-48] AdaC-GRPO: Towards Mastering Long-Horizon Visual Sudoku Puzzles via Adaptive Curriculum Learning
链接: https://arxiv.org/abs/2610.13184
作者: Sida Li,Yuanxin Liu,Linli Yao,Shicheng Li,Xu Sun,Haoli Bai,Xiaohui Li
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:While reinforcement learning with verifiable reward (RLVR) enhances reasoning in large language models, its efficacy in long-horizon multimodal tasks remains underexplored. Visual Sudoku puzzles pose a representative challenge, requiring multi-step deductive reasoning over both local constraints and global dependency chains. To this end, we introduce FG-Sudoku, a fine-grained benchmark categorized by grid size and required deductive steps. Evaluations reveal that frontier MLLMs fail on complex long-range dependencies (e.g., 9*9 puzzles). During post-training, this near-zero success rate causes severe reward sparsity, halting standard RLVR. We propose Adaptive Curriculum Group Relative Policy Optimization (AdaC-GRPO) to overcome this. Unlike rigid or prior-based schedules, AdaC-GRPO dynamically constructs training batches by tracking the model’s “Zone of Proximal Development” via online rollout accuracy. Experiments demonstrate that AdaC-GRPO enables Qwen2.5-VL-7B to approach the performance of Gemini-2.5-Flash while bridging 62.2% of the overall accuracy gap to Gemini-2.5-Pro, with its generalizability further validated across InternVL-3.5 and Qwen3-VL.
[AI-49] RoleWorld: Knowledge Transfer in World Modeling with Functional Role Abstractions
链接: https://arxiv.org/abs/2610.13172
作者: Boyuan Xiao,Pu Wang,Ji Feng,Yao-Xiang Ding
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:World models enable large language model (LLM) agents to anticipate action effects and make informed decisions. For generalization, it is desirable for such world models to transfer efficiently to new environments with similar interaction structure and underlying dynamics. Recent approaches encode world dynamics as symbolic rules or executable programs, whose compositional structure in principle affords transfer, but still organize such knowledge around environment-specific objects. To address this limitation, we introduce RoleWorld, a symbolic world modeling approach which uses reusable prototypes and environment-specific parameter values as functional role abstractions to represent how objects behave in interactions. From interaction trajectories, a teacher LLM extracts role prototypes and executable transition rules defined over role instances, together with a skill that guides the actor LLM to use role information in decision making. In a target world, without the teacher, the actor uses this skill together with its current role assignments and parameter estimates, and actively tests a role instance hypothesis through interaction when its uncertainty affects the current decision. Feedback from each action refines role assignments and estimates parameter values online, with no LLM parameter updates and the transition rules held fixed. Experiments on MARS benchmark show that RoleWorld enables robust generalization across environments with significantly altered object behavior, suggesting that functional role abstractions can serve as an effective component for knowledge transfer in world modeling. Project Page: this https URL.
[AI-50] Quality Not Just Outcome: A Structural Scoring Framework for Selecting Coding-Agent Trajectories for Supervised Fine-Tuning
链接: https://arxiv.org/abs/2610.13152
作者: Sida Li,Yuanxin Liu,Shicheng Li,Linli Yao,Xu Sun,Haoli Bai,Xiaohui Li
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Open coding agents are commonly trained through supervised fine-tuning on interaction trajectories whose final patches pass the benchmark test suite. However, this outcome-level filtering criterion ignores process quality: trajectories that eventually succeed may still contain inefficient interaction patterns such as repetitive file inspection, unstable tool usage, or delayed modification behavior, all of which become part of the imitation target. We propose TQS (Trajectory Quality Score), a structural scoring framework for coding-agent trajectories that operates directly on trajectory structure, requires no LLM judge, and runs in linear time. TQS characterizes trajectory quality through structural signals organized around structured convergence: information focus, intent–action alignment, and policy dynamics. Using 155,144 successful trajectories from a public open-license corpus, we rank trajectories by TQS and fine-tune coding agents on filtered subsets. Models trained on top-ranked trajectories consistently outperform those trained on random or bottom-ranked subsets on SWE-Bench-Verified. Our results suggest that process-level trajectory quality is an important factor in coding-agent supervision and that structural trajectory filtering provides an effective and scalable alternative to LLM-based data selection.
[AI-51] VIGOR: Verifiable Industrial Geometry Optimization and Repair in Scene Programs
链接: https://arxiv.org/abs/2610.13145
作者: Fuqiang Wang,Zheng Guo,Xiaoming Wu,Hanlin Kong,Nayu Liu,Chuanting Zhang,Daojun Liang,Jingxuan Wei
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large language models (LLMs) increasingly generate structured layouts and executable scene programs from natural-language instructions. However, executability does not imply engineering feasibility: an industrial scene program may execute successfully while its final state still violates coupled boundary, collision, clearance, aisle, or structural constraints. We identify this mismatch as the executability-engineering-feasibility gap, where locally plausible placements can remain globally infeasible because corrections to one device may introduce violations elsewhere. To make this gap measurable in a controlled setting, we construct an execution-grounded industrial scene-program dataset with 1,749 constructible scenarios, complete executable programs, and 94 final-state geometric checks per scenario. We further propose VIGOR, which combines supervised scene-program generation with execution-grounded verification and staged geometric refinement. Supervised fine-tuning establishes complete program generation, local projection resolves independently correctable violations, and joint conflict-graph repair coordinates residual multi-object conflicts while preserving structural relations. Experiments show that VIGOR achieves 96.86% Complete Feasibility and an Overall score of 91.20, outperforming the strongest evaluated baseline by 10.42 points in Overall. These results show that, under controlled industrial layout conditions, reliable scene-program generation requires not only executable programs, but also explicit verification and coordinated resolution of coupled engineering constraints.
[AI-52] Competence-Aware Orchestration for LLM -Based Multi-Agent Systems
链接: https://arxiv.org/abs/2610.13144
作者: Songmiao Wang,Yuchen Wang,Chenglin Yu,Hongxia Yang,Ming Li
类目: Artificial Intelligence (cs.AI)
备注: 16 pages, 4 figures
Abstract:LLM-based multi-agent systems (MAS) have emerged as a promising paradigm for enhancing complex reasoning through role specialization and collaboration, yet a key challenge remains: how can collaboration be adapted to a backbone’s competence on the current query? This problem matters because more collaboration is not always better–richer coordination may help on difficult cases, but it also incurs additional token cost and redundant interactions. We propose a two-stage competence-aware framework for automatic MAS orchestration. It first models the LLM backbone’s task-conditioned competence for the current query, and then uses this signal to adapt role activation and the communication graph. Across six benchmarks, our method achieves an average score of 93.81%. Experiments with six LLM backbones of varying competence levels further show that our method adjusts collaboration according to the inferred competence: for higher-competence backbones, it improves average accuracy from 87.22 to 89.97 while reducing token cost by 36.26%; for lower-competence backbones, it yields a further average gain of 4.58 points over existing methods. The same trend also holds on unseen backbones.
[AI-53] DP-MIND: Differentially private memory-guided Long context Inference
链接: https://arxiv.org/abs/2610.13132
作者: Zhihao Liu,Yitian Cheng,Shuang Liu,Rui Wen,Yuke Hu,Zhan Qin
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:LLM-as-a-Service has become a dominant paradigm for accessing large language models without requiring local deployment. However, the process raises severe privacy concerns when user queries may include sensitive or confidential contexts. Differential privacy (DP) provides a principled approach to protecting such inputs, but existing DP inference methods are primarily designed for short- or moderate-context settings and struggle with million-token-scale inputs due to limited context capacity and severe utility degradation under DP perturbation. In this paper, we propose DP-MIND, a memory-guided framework that scales differentially private inference to million-token contexts. DP-MIND enables private long-context inference by locally perturbing the input and processing it chunk by chunk with a compact memory that preserves task-relevant information across the sequence. To make this memory robust to DP noise, we optimize the memory construction policy directly on perturbed inputs using reinforcement learning, guided by both final answer correctness and memory consistency. We further recover perturbation-corrupted answer spans through a local denoising module without exposing the original context to the external model. We provide theoretical privacy analysis of DP-MIND and further conduct extensive empirical analysis across multiple long-context benchmarks with context lengths up to the million-token scale, demonstrating that DP-MIND consistently outperforms existing DP and long-context inference baselines in both scalability and utility. Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2610.13132 [cs.AI] (or arXiv:2610.13132v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2610.13132 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-54] Looking Ahead and Back: Anticipatory Generative Modeling for Road-Network Trajectories
链接: https://arxiv.org/abs/2610.13131
作者: Zhenhao Huang,Li Sun,Philip S. Yu
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Trajectory generation underpins urban applications such as traffic management and urban planning. Within road networks, vehicle movement along road segments is largely deterministic, whereas transitions at intersections are critical–multiple outgoing paths may appear equally plausible, yet they can lead to substantially different downstream routes. Existing generative methods such as diffusion models simulate location sequences and fail short of next transition selection, even producing trajectories that drift off the road network. To fill this gap, we advocate a fundamental shift: moving beyond location simulation toward behavior modeling on the road network. In this paper, we revisit trajectory generation through the lens of generative route planning, and introduce a new graph-constrained generative paradigm, Anticipatory Generative Modeling, which resolves next transition selection by incorporating the Anticipation of how the future route may unfold toward the destination. Concretely, we propose a novel generative model named Foresight that formulates a probabilistic model for an “anticipate–select–update–re-anticipate” loop that enables longer-term foresight while continuing sequential generation along the historical trajectory. Extensive experiments demonstrate that Foresight wins state-of-the-art baselines.
[AI-55] DRYLAB-Bench: Benchmarking the Biosecurity Risk of Agent ic LLM Mutation Design
链接: https://arxiv.org/abs/2610.13116
作者: Yuzhen Wang,Chunxiao Li,Baichen Le,Lewen Yan,Jie Zhang,Yucheng T. Yang,Xing-Ming Zhao,Lijun Li,Jing Shao
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:As large language models (LLMs) acquire advanced biological design capabilities, they offer substantial research benefits but simultaneously introduce severe dual-use risks, such as engineering enhanced pathogens or drug-resistant bacteria. While biosecurity frameworks recognize these threats, the actual risk of LLMs executing dangerous biological modifications remains unquantified, particularly when augmented with specialized biological design tools (BDTs). Existing evaluations primarily assess hazardous knowledge possession rather than practical application, overlook risk amplification from BDTs, and rely on unreliable, expensive, or hazardous validation methods. To address these gaps, we introduce DRYLAB-Bench (Design Risk Yielded by LLM Agent in Biodesign), the first comprehensive benchmark evaluating the high-risk biological mutation design capabilities of LLM agents. Moving beyond basic question-answering, DRYLAB-Bench tasks agents with 30 genuinely hazardous mutation-design scenarios distilled from biosecurity guidelines. It evaluates models in a multi-round, tool-augmented environment where LLMs orchestrate BDTs to iteratively refine candidates. Crucially, it scores designs directly against 187,695 empirical wet-lab measurements from ProteinGym and ViroGym using our proposed Biosecurity Risk Score (BRS), quantifying risk-associated effects while enabling scalable and safe ground-truth verification. Evaluations of 15 frontier models reveal substantial baseline threats: without tools, 67.6% of one-shot designs exceed the average measured variant, and 21.4% reach the highest-risk decile. Equipping models with BDTs significantly amplifies this risk, raising the pooled risk by (\Delta BRS=+0.116) and the top-decile share to 23.5%. Code: this https URL
[AI-56] Continually Post-training Small Models via Synthetic Self-distillation
链接: https://arxiv.org/abs/2610.13113
作者: Woosung Koh,Hyunsoo Lee,Kyungjae Lee,Haeju Park,Dahyun Lee,Dasol Hwang,Moontae Lee
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Continual post-training faces a dual challenge of acquisition and retention: models must learn new capabilities while preserving prior knowledge. While Self-Distillation Fine-Tuning (SDFT) mitigates this using self-supervision with in-context demonstrations, it relies on strong in-context learning and instruction-following abilities. Consequently, SDFT fails on smaller models critical for low-latency, on-device use. To enable continual learning at smaller scales, we first identify the root cause of failure. We show that poor acquisition and forgetting correlate linearly with the post-trained model’s distribution shift, revealing the necessity of in-distribution learning. We thus introduce Synthetic Self-Distillation (SynthSelf), imitating SDFT’s in-distribution rewrite by outsourcing the task to a minimally larger, same-family aligner. Coupled with off-policy supervision and rejection sampling, this provides the high-quality supervision small models require without breaking their original distribution. Evaluations spanning 4 acquisition datasets (including a mixture) and 14 retention benchmarks show SynthSelf consistently outperforms 6 methods (including off- and on-policy distillation) across 3 small model scales. Extensive further analyses confirm SynthSelf paves the way toward effective small-model continual learning.
[AI-57] Does Location Matter? A Black-Box Causal Audit Reveals Model-Dependent Audio Grounding in LALM Hallucination ICASSP2027
链接: https://arxiv.org/abs/2610.13112
作者: Mohammad Khalooei,Mohammad Sabokrou
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Sound (cs.SD); Audio and Speech Processing (eess.AS)
备注: 5 pages, 1 figures, 4 tables. Submitted to IEEE ICASSP 2027
Abstract:Large audio-language models (LALMs) frequently exhibit object hallucination, affirming absent sounds. The dominant mitigation, Audio-Aware Decoding (AAD), contrasts logits under real audio against an all-zero “blank” waveform, flagged by prior review as out-of-distribution. We introduce a black-box causal test that isolates the claimed evidence itself: localize a claim’s evidence region via CLAP similarity, remove it by spectral gating, and compare against a random-window control across a 2x2x2 grid on three LALMs. On Qwen2-Audio-7B, localized ablation’s raw AUROC trails blank’s (0.613 vs. 0.721); this is a duration confound, not a localization failure, since blank removes the entire clip versus the grid’s 2-4 s. Holding duration fixed, localization beats random removal at every cell on both models. Raw detection value remains model-dependent, especially on Audio Flamingo 3. The same evidence corrects decoding: contrastive decoding combining blank and language-prior contrasts, gated and ensembled, raises Qwen2-Audio accuracy from 57.1% to 71.9%, beating AAD alone. A unified causal-grounding profile does not transfer between models, indicating different grounding regimes. The source code and a detailed report of our findings, including identified limitations, are available at this https URL.
[AI-58] VETR: Execution-Grounded Self-Improving Agent for Symbolic Graphics Reasoning
链接: https://arxiv.org/abs/2610.13098
作者: Yingbo Ma,Kuangshi Ai,Gordon Dai,Chenglong Yu,Chaoli Wang,Hua Shen
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Visual agents for symbolic graphics reasoning depend on executable world representations, yet continued improvement remains bottlenecked by ambiguous supervision from final renders. Recent agentic systems refine scenes through repeated interaction, but they lack mechanisms to recursively extract actionable evidence from execution traces, overlooking which proposed symbolic edits survived, disappeared, or interfered during program execution. To address this, we propose VETR (Verified Execution Trajectories for Refinement), a framework that enables agentic recursive self-improvement over executable world representations for symbolic graphics reasoning. Within each task, VETR retains aligned program/render records with bounded runtime observations and introduces an execution refiner that compiles observed writes and state changes into constrained alternative programs. The refiner validates their endpoints and preservation conditions against captured runtime state; the ordinary visual verifier then assesses goal relevance. Repair construction makes no additional language-model calls, but can require additional executions. Evaluations on BlenderGym (280 tasks) and BlenderBench (27 released tasks) with GPT-5.6-luna and Qwen3.8-27B show that VETR consistently outperforms existing refinement strategies, including BlenderAlchemy and VIGA. Controlled ablations evaluate the contributions of execution refinement and role-asymmetric evidence organization under fixed generator-interaction caps.
[AI-59] When Faster Decisions Do Not Make Better Agents : An Empirical Study of Jev in Agent Workflows
链接: https://arxiv.org/abs/2610.13092
作者: Yuchen Ling,Shengcheng Yu,Zhenyu Chen,Chunrong Fang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:AI agents depend on repeated decisions to accomplish tasks, with large language models (LLMs) commonly serving as their core decision makers. The recent emergence of Jev offers an opportunity to make these decisions faster and at lower cost. However, it remains unclear whether such local savings can be translated into efficient and reliable task completion. In this paper, we investigate this efficiency transfer across five agents in two representative application settings, embodied tasks in ALFWorld and mobile app use in AndroidWorld. Across 4,500 task executions, we jointly evaluate task effectiveness, decision-level and task-level resource use, and execution behavior. Experimental results show that Jev integration substantially reduces decision cost and latency across all five agents, with task-level gains varying by workflow. Task success remains close to baseline levels on ALFWorld and declines more substantially in two mobile agents. Auxiliary reasoning and additional interactions absorb decision savings, while failed recovery and premature completion limit successful delivery. Mean cost per successful outcome increases in one agent even as spending per attempt falls. These findings highlight the importance of preserving progress, supporting recovery, and verifying completion when integrating efficient decision models into agent workflows. Their practical value should be assessed through successful task delivery, recovery behavior, and resources per delivered outcome.
[AI-60] SWEAR: Section-Wise Efficient Audio Reasoning via Self-Rated Difficulty
链接: https://arxiv.org/abs/2610.13081
作者: Yixuan Li,Minghao Lv,Xuenan Xu,Zihao Zheng,Mengyue Wu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Recent work on large audio-language models (LALMs) explores adaptive reasoning to balance accuracy and efficiency. However, existing approaches often rely on coarse-grained difficulty estimation, overlooking the diverse factors that determine reasoning effort. We address this limitation by deriving five-dimensional difficulty scores and compressed reasoning traces from complementary offline assessments. Based on this characterization, we propose SWEAR, a difficulty-aware reasoning framework that learns difficulty signals during supervised fine-tuning and uses reinforcement learning to adapt reasoning allocation across reasoning stages. Experiments on MMAU-test-mini and MMAR show that SWEAR improves accuracy while substantially reducing generated tokens, shortening reasoning for easy instances without sacrificing performance on difficult ones.
[AI-61] Attention Sees MLP Refuses: Tracing the Attention-to-MLP Safety Pathway in LLM s
链接: https://arxiv.org/abs/2610.13078
作者: Zixuan Weng,Haoqi He,Weifei Jin,Yue Huang,Yang Bai
类目: Artificial Intelligence (cs.AI)
备注: Preprint
Abstract:Safety-aligned large language models (LLMs) remain vulnerable to jailbreaks and can over-refuse benign requests. Understanding these failures requires distinguishing harmfulness recognition from the computation that writes refusal. We reframe this as a pathway question and make it measurable on residual-stream updates in decoder-only Transformers, separating the harmfulness information a module update exposes from the change it produces in readable refusal evidence. Across 18 Base-Instruct pairs spanning Qwen, Llama, and Gemma, harmfulness is decoded more readily from attention updates, particularly in early layers, whereas MLP updates contribute more strongly to harm-selective refusal writing in aligned models. Post-training strengthens MLP refusal writing in all 18 pairs without systematically improving harmfulness decodability, while positive MLP writing becomes more concentrated in deeper layers after post-training. Across six reasoning-enabled models, harmfulness remains decodable during reasoning while strong refusal writing concentrates at answer onset, a pattern that persists with reasoning disabled. Causal interventions further support this pathway: resetting downstream MLP updates to their clean values substantially reduces the refusal shift caused by upstream attention interventions. Building on these findings, we introduce Sentinel, which combines an attention-derived perception score P with an MLP-derived decision score D. Their joint profiles characterize jailbreaks and over-refusals, and conditional routing with both signals achieves a lower aggregate error rate than single-signal routing and evaluated fixed reminders across eight models.
[AI-62] LongHarness: Advancing Agent ic Reasoning over 100M-Token Corpora via Stateful Evidence Management
链接: https://arxiv.org/abs/2610.13075
作者: Songtao Huang,Zhijie Zhong,Xiaohan He,Shuaiyu Zhang,Zhiyin Yu,Li Kang,Heng Zhou,Yutao Fan,Xiangchao Yan,Bo Zhang,Shiyang Feng
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Corpus-level long-context reasoning requires agents to acquire and integrate evidence across document collections that exceed their context windows. Existing agent harnesses enable incremental access to these corpora, but acquired evidence and evolving conclusions often remain entangled in a growing interaction history. This implicit state management can lead to two coupled failure modes: unbounded exploration, where retrieval expands the interaction history without resolving decision-relevant information gaps, and evidence-state drift, where previously acquired evidence or subsequent corrections fail to inform the current conclusion. We present LongHarness, a model-agnostic harness that makes the interaction between acquired evidence and evolving conclusions explicit. Its core mechanism, Evidence-Conclusion Coevolution, uses unresolved conclusions to guide exploration toward missing information, while newly acquired evidence strengthens or revises the conclusions that directed the search. LongHarness couples this process with Evidence Lifecycle Management, which keeps accumulated evidence current and traceable throughout the interaction. Together, these mechanisms focus retrieval on remaining information needs and keep conclusions aligned with current evidence. We evaluate LongHarness on OfficeQA Pro V1 and V2, AA-LCR, and LongBench v2 using GLM-5.3-Flash and Qwen3.8-Flash. Compared with direct reasoning using the same backbone, LongHarness improves GLM-5.3-Flash exact match on OfficeQA Pro from 15.8% to 60.2% on V1 and from 4.4% to 61.1% on V2. Against state-of-the-art agent harnesses, it surpasses Claude Code by 12.0 percentage points on V1 and Codex by 18.9 points on V2. With Qwen3.8-Flash, LongHarness reaches 61.7% on V1, outperforming Claude Code by 8.3 points and Codex by 12.0 points.
[AI-63] Dont Guess Just Ask: Evaluating Interactive Requirement Clarification for Repository-Level Software Development
链接: https://arxiv.org/abs/2610.13022
作者: Mingyu Chen,Zhiqing Zhong,Manyi Wang,Linxi Liang,Rouyu Chen,Pinjia He
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注:
Abstract:As LLMs become increasingly capable of implementing software, a critical bottleneck emerges: whether they truly understand what users want. Users often begin with vague intent, leaving important requirements to be clarified through interaction. In repository-level development, misunderstandings can propagate and cause costly rework. However, existing benchmarks typically evaluate implementation from complete specifications or underspecified requests, overlooking pre-coding requirement clarification. Prior clarification studies mainly focus on function-level tasks. It therefore remains unclear how well LLMs can transform vague intent into clear requirements through interaction and how this capability affects subsequent code generation. We introduce ReqClarifyBench, an interactive requirement clarification benchmark for repository-level software development. It contains 341 tasks spanning game, miniapp, and web development, each with a vague user intent, a human-validated requirement document, and code evaluation artifacts. We employ LLM-based user simulators with diverse personas derived from real-world conversations. We evaluate six LLMs in terms of clarification effectiveness and generated requirement document quality. Results show that stronger clarification effectiveness does not necessarily translate into higher document quality, and performance varies substantially across user personas. We also find that coding-agent harnesses do not further improve requirement document quality compared with their base LLMs. These findings offer insights for building LLM-based end-to-end software development systems. Subjects: Software Engineering (cs.SE); Artificial Intelligence (cs.AI) Cite as: arXiv:2610.13022 [cs.SE] (or arXiv:2610.13022v1 [cs.SE] for this version) https://doi.org/10.48550/arXiv.2610.13022 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-64] Generalized Proximal Policy Optimization: Unifying LLM RL Algorithms from the Perspective of Divergence
链接: https://arxiv.org/abs/2610.13015
作者: Zhicheng Cai,Xinyuan Guo,Hanlin Wu,Weinan Dai,Yuyan Zhou,Wei-Ying Ma,Ya-Qin Zhang,Hao Zhou
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Reinforcement learning has become the foundational paradigm for enhancing the reasoning capabilities of LLMs. Yet the dominant approach, Proximal Policy Optimization (PPO), relies on a geometrically degenerate clipping proxy that cannot adapt its resistance to policy shifts, leading to premature clipping and degraded exploration. Subsequent variants alleviate these issues through fragmented and heuristic modifications. We propose Generalized Proximal Policy Optimization (GPPO), a principled and unified framework for understanding and designing LLM RL algorithms through the lens of divergence. We establish a generalized f -divergence trust-region theory with a monotonic performance improvement guarantee, and show that different f -divergences induce distinct geometries and policy update dynamics. We further introduce novel estimator topologies that provide more faithful divergence estimates than the conventional single-sample Monte Carlo estimation. Under this framework, PPO and recent variants such as DAPO, DPPO, and RIPO emerge as special cases, establishing a principled two-dimensional design space of Divergence \times Estimator. Extensive experiments on eight competition-level math and coding benchmarks show that both dimensions are critical. The best-performing GPPO instantiation surpasses standard GRPO by up to 50% and 14% on math and coding, delivering SOTA performance.
[AI-65] Provenance-Aware Belief Updating in Human-AI Feedback Loops NEURIPS2026
链接: https://arxiv.org/abs/2610.13008
作者: Tianyi Huang,Eric Liu,Jay Chong,Emily Yin,Wanqi Zhao
类目: Artificial Intelligence (cs.AI)
备注: Accepted Oral at the NeurIPS 2026 Workshop on Dynamic Alignment in Human-AI Coupled Systems
Abstract:In repeated human-AI interaction, a single observation can be quoted, summarized, and returned to a model as multiple reports, making repetition look like independent corroboration. We study whether language models can use supplied report lineage to update according to evidence provenance rather than report count. We introduce Latent Quotient Evidence Training (LQET), a relational objective that combines sparse Bayesian supervision with constraints that encourage stable predictions when reports add no new evidence and consistent updates to the same new evidence across relay histories. On a controlled binary benchmark, LQET reduces new-evidence update RMSE by 41-44% and log-odds drift after eight relay steps by 89-91% relative to task-only training across Qwen3-4B and Phi-4-mini, with three paired training seeds per backbone. The gains extend to a closed-loop simulation in which model confidence controls how many relayed reports re-enter the model’s context in later rounds. By grounding belief updates in supplied provenance, LQET offers a route toward dynamic human-AI systems in which influence follows new evidence, not the number of times the same evidence returns.
[AI-66] Scaling Empowered Agents
链接: https://arxiv.org/abs/2610.13002
作者: Catherine Ji,Vivek Myers,Joshua Lin,Alexandra Wingate,Sergey Levine,Benjamin Eysenbach
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 30 pages, 13 figures
Abstract:Empowerment measures the capacity of an agent to actively control its environment. In this work, we explain the connection between skill learning and empowerment. While skill learning is not empowerment, we introduce a simple scalable recipe for empowerment maximization: empowerment corresponds to the number of executable skills from a state, so maximizing empowerment corresponds to reaching states that are good starting points for many skills. Our recipe applies to arbitrary underlying skill learning methods. Whereas most prior work on empowerment looks at tabular settings, this recipe enables us to study empowerment at a scale where we can realize theoretically-predicted but empirically-elusive properties of empowerment (e.g., gathering resources, environment modification, survival). Experiments show that empowerment maximization unlocks interesting emergent properties, such as building a house in Crafter. Website and code at \hrefthis https URLthis https url.
[AI-67] Hindsight Structured Advice Distillation: Steering Executor Agents with Advisors Trained on Their Failures and Task Characteristics
链接: https://arxiv.org/abs/2610.13000
作者: O. Ozan Koyluoglu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Language-model agents are used for specialized work such as financial research, healthcare and law. Such agents are often capable enough for a task but still miss its details. In finance, for example, these details include which filing reports a figure or how a company discloses a metric. Retraining the agent to learn these details is expensive, and often impossible when the agent is a closed or shared system. Writing the missing know-how into the agent’s prompt makes the prompt long and identical for every input, although different inputs need different guidance. We propose to learn to generate this guidance instead. A small advisor model reads each input and writes structured advice, which is appended to the prompt of a frozen executor. The advisor is trained with hindsight, following work on distillation with privileged information. On a training pool with graded answers, we analyse the executor’s failures, run it under several strategies to see which one worked on each input, and let a teacher that sees the grades and the traces write the advice that would have helped. The advisor then learns, by supervised fine-tuning, to write that advice from the input alone. Because the student is a separate small model rather than the executor, it is cheap to train and adds little latency. We call this approach hindsight structured advice distillation (HSAD). On FrontierFinance, a public benchmark of expert-written financial research queries, an 8B advisor raises the qualification rate of Samaya’s proprietary research agent, which already leads the benchmark’s leaderboard, from 52.9% to 56.6%. This is above the agent’s own high-effort configuration, at 37% lower cost per query. We study the generalization of the proposed approach, and in particular show that HSAD also improves results on WebShop, BIRD text-to-SQL and ExpertLongBench.
[AI-68] Beyond Semantic IDs: Finite-Beam Reachability and Continuous-Query Generation in Generative Recommendation
链接: https://arxiv.org/abs/2610.12977
作者: Yu Sun,Renkai Xiang,Zuodong Xiang,Junwei Zhou,Yike Zhang,Jianxin Zhang,Zhihao Zhu,Xiaoyu Cao,Hailu Xu
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Generative recommendation (GR) of social media platforms commonly retrieves items by autoregressively decoding discrete Semantic IDs (SIDs) with finite-width beam search. This work examines how this output interface constrains whether held-out targets enter finite returned lists, while distinguishing catalog-wide scoreability from empirical top-K support. We introduce two continuous-query paradigms: CQG-Single generates one retrieval query in a single pass, and CQG-AR autoregressively generates continuous residual updates, retaining step-wise decoding while removing the SID item-token vocabulary, code lookup, and discrete beam expansion. These designs thereby eliminate the SID-specific reachability constraint induced by finite-beam decoding and avoid the technical challenge of aligning a discrete SID vocabulary with the pretrained backbone’s vector space. Both methods make every encoded item directly scoreable through dense or approximate-nearest-neighbor retrieval. Under a unified protocol with valid-prefix constrained decoding, CQG-Single exceeds the TIGER-style baseline in all seven runs while using 55.3% as many trainable parameters. CQG-AR remains comparable on ML-1M and is numerically stronger on Beauty and Sports datasets. A controlled depth ablation further shows that additional continuous refinement does not monotonically improve shallow accuracy. These findings motivate decoupling output representation, autoregressive modeling, and retrieval budget when evaluating generative recommendation systems.
[AI-69] JoyInside-VLM-Agent : Product-Conditioned Multimodal Policy Learning for Embodied Agents
链接: https://arxiv.org/abs/2610.12957
作者: Gangyi Li,LuYao Wang,Jingfu Sun,Jingyi Yuan,Hang Liu,Hao Zong,Yujia Hu,Tingting Gao,Jianyong Wang,Xu Yang
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 23 pages, 6 figures, 5 tables; includes references and appendices
Abstract:Embodied agents must translate multimodal observations and user requests into executable actions while adapting to product constraints, changing goals, and execution feedback. We present JoyInside-VLM-Agent, a ReAct-style multimodal agent developed through product-conditioned trajectory construction and staged policy learning for robotic platforms and smart hardware. A closed-loop sandbox generates multimodal interaction trajectories covering goal revisions and failure recovery, which are checked against execution outcomes and semantic criteria. Supervised fine-tuning and multi-teacher on-policy distillation precede reinforcement learning with DPER (Dual-Source Privileged On-Policy Self-Distillation with Token-Level Evidence Routing). DPER routes token-level evidence between a frozen privileged teacher and a privileged student sharing the rollout policy’s parameters, modulating reward-derived token advantages while preserving their signs. Training rewards combine generative process evaluation, multi-judge rankings, and task-queue consistency. JoyInside-VLM-Agent achieves a BFCL v4 overall score of 77.44, exceeding the evaluated baselines; results on the other public benchmarks are mixed. On JoyInside-Devices and JoyInside-Robotics, the evaluated system, which includes domain-specific skill refinement, leads the baselines on all reported metrics. Two real-world quadruped case studies illustrate visually grounded search, replanning after execution failure, and explicit failure reporting.
[AI-70] MathVis: Can AI Reason through Drawing? A Benchmark for Mathematical Figure Generation
链接: https://arxiv.org/abs/2610.12954
作者: Jingjing Wei,Hao Zhao,Xinke Li,Linxi Yu,Xiaosong Gao,Shanshan Xiao
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:This paper introduces MathVis, a benchmark designed to evaluate LLMs’ ability to visualize frontier mathematical problems and perform diagram-assisted reasoning. The benchmark consists of 512 tasks, each comprising a mathematical statement, a reference diagram, executable TikZ or SVG code, a Gold Intermediate Representation (IR), atomic rubrics, and error codes. Through rigorous evaluation, GPT-6-Astra, Claude Fable 5, and Gemini 3.1 Pro Preview achieve pass@1 scores of 31.25%, 26.56%, and 22.85%, respectively. We found that although the tasks require visualization, LLMs produce outputs dominated by formal languages, symbols, and graphics programs, rather than explicit diagram-mediated reasoning. Furthermore, while the solutions generated by LLMs may contain all the necessary elements, they are often visually confusing to humans. Ultimately, this benchmark aims to visualize mathematical problems and promote research on enabling LLMs to simplify their reasoning via visual diagrams.
[AI-71] Learning More by Training Less: Uncertainty-Guided Progressive Contraction for Efficient Reasoning Post-Training
链接: https://arxiv.org/abs/2610.12933
作者: Suorong Yang,Jiaxin Wang,Jiaming Su,Chentao Yue,Furao Shen,Peng Ye,Soujanya Poria
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large language models have achieved remarkable advances in complex reasoning. However, scaling reasoning post-training with ever-larger corpora can substantially increase training cost without proportional performance gains. In this study, we therefore ask: how far can reasoning supervision be compressed without sacrificing capability? To this end, we propose an uncertainty-guided progressive contraction framework that concentrates supervision and optimization on the reasoning trajectories most valuable for learning. Specifically, rather than treating a teacher-generated chain-of-thought (CoT) as a single realized path, we construct uncertainty-profiled reasoning supervision by building Monte Carlo reasoning trees around intermediate reasoning states to expose process-level uncertainty. This uncertainty first contracts the original corpus into a compact teacher-informed pool. A second, learner-aware contraction then performs online routing during SFT, concentrating optimization according to the student’s evolving learning state. Together, the two stages progressively contract both supervision and optimization, substantially reducing the student training budget. Experiments across diverse reasoning benchmarks and LLM families show that our method uses as little as 0.22% of the optimization budget of full-data SFT, over 450x less training exposure, while maintaining or improving reasoning performance. Notably, our framework generalizes well across heterogeneous student families, black-box teachers, and weak-to-strong transfer. This indicates that it is not only a way to accelerate training but can also enhance reasoning capability.
[AI-72] Collaborative Learning and Reasoning over Model Slices
链接: https://arxiv.org/abs/2610.12927
作者: Yuheng Wang,Runde Yang,Zhuohan Bao,Qiran Zhang,Huatao Li,Yiyang Zheng,Lin Wu,Jingru Fan,Shu Yao,Yihan Li,Zhi Li,Chen Qian
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large language models (LLMs) excel across diverse tasks, benefiting from knowledge priors, in-context reasoning, and test-time computation. Despite these strengths, single-model reasoning remains vulnerable to error propagation, as later steps depend on the model’s earlier outputs, leaving reasoning blind spots difficult to independently reassess. To address this limitation, we develop \textitcollaborative learning, encompassing the construction of heterogeneous collaborators and the learning of effective cross-model collaboration. Specifically, \textitmodel slicing replaces a large model with smaller, heterogeneous models under a comparable parameter budget, enabling prior reasoning to be reassessed across distinct model parameterizations. \textitPyramid supervision combines protocol distillation with step-level supervision to refine reasoning and interaction decisions throughout collaboration. We evaluate our approach across four task categories: multi-hop question answering, mathematical reasoning, code generation, and open-ended constrained generation. The trained heterogeneous models achieve comparable or better task performance than the original large model and established multi-agent baselines, including reinforcement-learning-based methods, while also achieving higher inference efficiency than the multi-agent baselines and exhibiting differentiated collaboration patterns across tasks. These findings show that learned collaboration turns model heterogeneity into complementary reasoning capabilities.
[AI-73] aching neural decoders with language
链接: https://arxiv.org/abs/2610.12921
作者: Xuan Wen,Yonghao Song,Yuhong Zhang,Guoliang Li,Tzyy-Ping Jung,Xiaorong Gao
类目: Artificial Intelligence (cs.AI)
备注: 14 pages, 8 figures
Abstract:Brain-computer interfaces decode neural activity, yet class-label supervision (CLS) leaves relationships among classes implicit. We propose Language as Supervision (LaS), which aligns neural features with natural-language class descriptions through learned projections and predicts classes using candidate text prototypes. We evaluate seven encoder architectures with independently trained models for visual, motor, and speech decoding from scalp and intracranial recordings. LaS improves speech-decoding accuracy by up to 17.15~pp over matched CLS baselines. Its representations support candidate-set reuse and label-supervised subject and session adaptation, while LaS enables conditional unseen-frequency decoding in steady-state visual evoked potential (SSVEP) responses. Correct class-description correspondence supports this generalization, and dual-sided attribution visualization shows neural and textual contributions to the same class-matching score. These findings suggest that text descriptions can serve as general-purpose references for learning and interpretation in neural decoding.
[AI-74] AI-Mediation in Retail Markets: Revenue Effects and Assortment Optimization
链接: https://arxiv.org/abs/2610.12917
作者: Omar El Housni,Marouane Ibn Brahim
类目: Artificial Intelligence (cs.AI); General Economics (econ.GN); Optimization and Control (math.OC)
备注:
Abstract:AI shopping assistants increasingly influence which products consumers consider. We study retail assortment planning under AI mediation, where a retailer chooses a catalog, an AI intermediary forms a customer-facing shortlist, and the customer chooses from that shortlist according to a multinomial logit model. We consider both deterministic mediation, in which the AI follows a fixed segment-specific ranking, and stochastic mediation based on the Plackett-Luce model. Empirically, we construct a dataset of product rankings from leading AI models, estimate Plackett-Luce ranking models, and evaluate their predictive performance on held-out assortments. Combining these estimates with synthetic customer preferences, we find that accounting for AI mediation can materially change optimal assortments and revenue. Across the tested capacity configurations, ignoring mediation yields mean revenue losses between 2.52% and 11.37% relative to the PL optimum. A much simpler deterministic plug-in, based only on the ordering of fitted AI utilities, performs substantially better, with mean losses of at most 0.53%. Motivated by this performance, we study assortment optimization under deterministic mediation. We characterize its computational complexity and show that, for any fixed number of customer segments, the problem admits a fully polynomial-time approximation scheme. Subjects: Artificial Intelligence (cs.AI); General Economics (econ.GN); Optimization and Control (math.OC) Cite as: arXiv:2610.12917 [cs.AI] (or arXiv:2610.12917v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2610.12917 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-75] DeFiRank: Federated Pairwise Ranking for Governance in Decentralized Financial Networks
链接: https://arxiv.org/abs/2610.12916
作者: Zahra Batool,Michael Duchesne,Kaiwen Zhang,Ulrich Aivodji
类目: Artificial Intelligence (cs.AI)
备注: 8 pages
Abstract:Existing governance approaches in decentralized financial networks rely on manual review processes conducted by human committees, which introduces subjective bias, creates a scalability bottleneck under high network volume, and fails to capture complex behavioural patterns and evolving network dynamics. To address these limitations, we propose \name, a federated learning-based pairwise ranking framework in which multiple institutions collaboratively train a ranking model without sharing their private transaction data. This collaborative learning enables the model to capture network-wide behavioural patterns that signify strong network participation and directly contribute to the network effect, including diversity of counterparties, usage of multiple applications, and frequency of transactions. The proposed system ranks providers based on the authenticity of their actions, promoting genuine contributors and demoting those exhibiting suspicious behaviour. We evaluate \name\ on a real-world blockchain transaction dataset. Results demonstrate that the federated approach achieves ranking performance modestly below the centralized baseline (NDCG@15: \approx 0.87 vs.\ \approx 0.92) while preserving data privacy and matching its ranking stability (Kendall \tau : \approx 0.70 for both regimes), producing reliable governance decisions, including provider promotion and demotion (648 and 39 unique providers, respectively), without requiring centralized access to sensitive transaction data.
[AI-76] OGPO: Offline Goal-conditioned Policy Optimization for Recoverable Vision-Language-Action Models NEURIPS2026
链接: https://arxiv.org/abs/2610.12914
作者: Xule Gao,Xi Wang,Zehua Zang,Rui Wang,Changwen Zheng,Chuxiong Sun
类目: Artificial Intelligence (cs.AI)
备注: Accepted at NeurIPS 2026
Abstract:Vision-language-action (VLA) models have shown strong promise in robotic manipulation, yet their post-training still predominantly relies on trajectory-level supervised imitation over robot demonstrations. While effective for learning feasible actions, this paradigm supervises policies to reproduce expert actions at each step, biasing them toward demonstration-specific action paths and providing limited guidance for recovering toward task-progress states once execution deviates from demonstrated trajectories. To address this limitation, we propose OGPO, an Offline Goal-conditioned Policy Optimization framework for recoverable VLA post-training. Instead of treating offline demonstrations merely as step-wise action labels, OGPO adaptively relabels trajectories with semantic key states and constructs goal-conditioned process rewards to optimize the policy for reaching these task-progress states. In this way, OGPO shifts VLA post-training from trajectory-level action imitation to key-state reachability learning, enabling policies to acquire a more robust ability to complete goal states from feasible off-demonstration states without requiring additional online interaction. Experiments on LIBERO and MetaWorld show that OGPO consistently improves VLA policy performance over standard supervised fine-tuning. Moreover, evaluations on LIBERO-Plus and our proposed LIBERO-ReAct, a mid-execution perturbation benchmark, further demonstrate that OGPO achieves stronger robustness and goal-directed recoverability under distribution shifts and recoverable off-demonstration states.
[AI-77] Mind the Spatial Gap: A Benchmark for Geospatial Reasoning and Constrained Spatial Editing ICLR2027
链接: https://arxiv.org/abs/2610.12881
作者: Zheng Ren,Yanning Wang,Ziheng Huang,Fei Huang,Shiqi Wang,Ziqian Ye,Yang Yue
类目: Artificial Intelligence (cs.AI)
备注: 15 pages, 6 figures, 4 tables. Under Review at ICLR 2027
Abstract:Understanding and manipulating spatial relations is fundamental to AI systems that reason about physical environments and construct grounded world models. However, existing evaluations of multimodal large language models (MLLMs) for spatial reasoning rely predominantly on static question-answering (QA) over small-scale or synthetic scenes, rarely probing whether models can modify spatial configurations while satisfying explicit geometric constraints. We introduce GeoSpatialBench, a benchmark designed to evaluate an escalating progression of spatial cognition, ranging from spatial relation understanding and geometric reasoning to constrained spatial editing. Grounded in real-world urban data across six geographically diverse cities, GeoSpatialBench evaluates a comprehensive taxonomy of 28 topological, directional, metric, and ordering relations across structured GeoJSON and map image modalities, with ground-truth references and constraints verified via GIS operations. Our empirical evaluation across frontier MLLMs uncovers a stark spatial gap: structured GeoJSON consistently outperforms map images, with multimodal combinations offering no reliable gain over GeoJSON alone, and while models show reasonable competence on qualitative topological and ordering, performance drops on quantitative metric relations. Crucially, editing performance on ordering relations declines relative to QA, and most failed edits violate at least one specified spatial constraint. These results highlight a gap between passively recognizing spatial relations and actively manipulating geometric configurations. GeoSpatialBench provides an open, rigorous diagnostic testbed to benchmark these spatial limitations, laying essential empirical groundwork for physically grounded world models and embodied spatial AI.
[AI-78] One-Step Text Generation by Seq-Drifting
链接: https://arxiv.org/abs/2610.12879
作者: Jiayu Liu,Ruizhi Zhao,Tianyun Ji,Yee Whye Teh,Zhenya Huang,Ning Miao
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Diffusion language models generate tokens in parallel, but still require multiple sampling steps to produce high-quality text. In this paper, we investigate whether a model can learn to generate an entire sequence in a single forward pass. We propose Seq-Drifting, a framework that applies drifting to sequences of continuous token representations and directly learns a map from Gaussian noise to text. Unlike existing DLMs that derive the supervision at each position directly from the observed token in a training sequence, Seq-Drifting builds a drift field whose position-wise targets adapt to the current generated context. At each position, attraction guides each output toward a set of contextually plausible token representations, while repulsion discourages collapse across samples and repetition within sequences. The generator learns from this drift field during training and produces all tokens jointly in one pass at inference. Empirically, Seq-Drifting achieves a generative perplexity of 36.01 on LM1B in one step and performs competitively in both unconditional and conditional generation. Experiments on translation, summarization, and reasoning further demonstrate the applicability of the framework beyond open-ended generation. These results suggest that drifting over token sequences offers a promising path toward effective one-step text generation. Our code is available at this https URL.
[AI-79] Collaborative Theory of Mind: Learning to Self-Revise by Anticipating User Responses
链接: https://arxiv.org/abs/2610.12872
作者: Fanzhi Zeng,Anubrata Das,Maytal Saar-Tsechansky,Liu Leqi
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Large language models (LLMs) demonstrate strong individual task performance, yet still struggle to collaborate with users over extended, multi-turn interactions, for example by attempting solutions before understanding the user’s needs or by failing to revise mistaken assumptions after receiving feedback. We propose Collaborative Theory of Mind (CToM), a framework that addresses these challenges by explicitly training LLMs to anticipate user responses and to use those predictions to improve their own behavior. CToM drafts a response, predicts how the user will respond, and uses this prediction to guide internal revision before presenting a response. During training, the user’s reply to each draft serves as the target for predicting the next turn, and we train the assistant to minimize the negative log-likelihood of that reply. We combine this prediction objective with group-relative policy optimization (GRPO) to optimize both task performance and interaction efficiency. Across mathematical reasoning, coding, and writing tasks, CToM achieves higher collaborative task performance than all baselines; for example, on a collaborative mathematical reasoning task, it improves final accuracy from 74.1% to 79.6% compared with naive GRPO. Ablations show that predicting user responses also makes collaboration more efficient: under the same reward, adding prediction supervision reduces the number of user replies by 8% on coding and 17% on writing while improving task performance. Behavioral analyses of interaction trajectories show that user-response predictions become more accurate after training, and that more accurate predictions are associated with larger improvements in collaborative task performance through self-revision.
[AI-80] Mitigating Capability Degradation in LLM Self-Improvement via Representation Geometry Regularization
链接: https://arxiv.org/abs/2610.12855
作者: Jiaqi Tian,Ting Long
类目: Artificial Intelligence (cs.AI)
备注: 15 pages, 5 figures
Abstract:On-Policy Self-distillation is a self-improvement paradigm that enables large language models (LLMs) to improve their capabilities by leveraging the same model as both teacher and student under different conditioning contexts. However, we find that OPSD methods can progressively degrade previously acquired capabilities: queries that are correctly responded at earlier training stages may become incorrectly responded as optimization proceeds, even the overall performance continues to improve. Further analysis reveals that this degradation coincides with a deterioration of the geometry of hidden representations, characterized by reduced intra-cluster compactness and diminished inter-cluster separation. Motivated by this observation, we propose Representation Geometry Regularization (RGR), which preserves representation geometry during post-training by encouraging compactness within cluster and separation across cluster. RGR can be seamlessly integrated into existing OPSD methods without altering their core optimization procedures. Extensive experiments on multiple OPSD methods and benchmarks show that RGR generally alleviates capability degradation while retaining capability improvements. Our code is available in this https URL.
[AI-81] Co-Modifying Application Code and Deployment Infrastructure: A Causal Study of AI Agent Pull Requests
链接: https://arxiv.org/abs/2610.12849
作者: Mohammad Wathiq Soualhi,Basem Suleiman
类目: oftware Engineering (cs.SE); Artificial Intelligence (cs.AI)
备注: 21 pages, 2 figures
Abstract:Current software engineering agents are evaluated predominantly inside isolated sandboxes against synchronous local tests. However, deploying features in collaborative repositories requires modifying continuous integration (CI/CD) pipelines, containers, and provisioning manifests alongside application logic. Because agents lack deployment awareness, attempting cross-domain modifications introduces unverified dependencies into asynchronous integration pipelines. To isolate the causal integration overhead of dual-scope pull requests (PRs)-modifying both application code and deployment infrastructure-we evaluated 26,999 PRs across two large datasets (AIDev v5 and MOSAIC-3M) encompassing six agent architectures and an aligned human baseline. Using a deterministic four-tier file taxonomy and an exact 4D strata-matching framework, we isolated integration metrics under conditional exchangeability while controlling for application volume. We find agents operate primarily as application coders or chore workers, with maintenance tasks capturing 17.70% to 25.41% of agent PRs. Dual-scope modifications represent only 4.48% to 4.55% of agentic PRs, yet trigger bimodal integration outcomes. In the first mode, explicitly reviewed contributions experience protracted delays, adding a median penalty of +13.13 hours and multiplying time-to-merge by 3.24x, driven mechanically by CI/CD and provisioning manifests. In the second mode, maintainer gatekeeping exhibits a structural bypass: even for external contributors lacking repository write access, agent identity reduces the odds of human review by 63.7% compared to human peers. Consequently, 43.1% to 56.2% of dual-scope PRs bypass inspection to merge silently in a median of under 31 minutes. These uninspected modifications compromise build verification, demonstrating the need for deployment-aware benchmarks and strict path-based access controls.
[AI-82] When Generative Models Act as Simulators
链接: https://arxiv.org/abs/2610.12847
作者: Sevan Brodjian,Michael Hobley,Pietro Perona
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:A simulator summarizes an environment in a state that users can read and change. Generative models learn representations of the world without explicit specification, but offer no built-in way to edit that world’s state. We investigate the conditions under which a generative model can act as a simulator through \textiteditability : whether changing a model’s latent representation produces the next-step outputs we get by editing a simulator’s state. Plainly stated, our goal is to find a mapping between a generative model’s latent state and the simulator state, where the model is trained on observations alone and the mapping is learned afterward. We test two kinds of mappings, both learned from observations paired with simulator states. In one, we train probes to decode the simulator state from the model, then steer along them. In the other, we learn the mapping directly with an inverse map, which can succeed even where steering fails. We study both in two contrasting environments: the discrete board game Othello, and Rayworld, our own continuous world of moving discs seen through partial renderings, closer to physical scenes and video. We find that which mapping succeeds depends strongly on the environment, even though the state is decodable in every variant. In Othello, editability falls smoothly as the game is simplified, and even small rule changes have large consequences. In Rayworld, probes fail to steer along the simulator’s continuous state, yet an inverse map sets the model from that state anyway. A model can therefore be driven by a simulator it may have never learned.
[AI-83] owards Defining Measuring and Leverag ing Creativity in AI Applications IJCAI ECAI2026
链接: https://arxiv.org/abs/2610.12845
作者: Jingyi Yang,Alexander Tuzhilin
类目: Artificial Intelligence (cs.AI)
备注: Accepted at IJCAI-ECAI 2026; 10 pages;
Abstract:Despite extensive research, computational creativity still lacks a conceptually grounded, practically relevant, and empirically applicable formal definition across contexts such as art, scientific research, and games. Existing approaches to creativity often focus on proposing informal conceptual definitions without providing formal computational concepts. Alternatively, they propose formal definitions without carefully examining their underlying assumptions or providing validation of these definitions by testing their performance in specific application settings. To address these problems, this paper proposes several formal postulates of creativity grounded in prior psychological work on creativity, especially as related to Boden’s three core criteria of creativity: newness, value, and surprise. Furthermore, we propose a conceptual mathematical definition of creativity that aligns with these postulates. We also validate our proposed creativity formula in two applications: determining the creativity of particular chess moves, and assessing the creativity of paintings by some artists, such as Picasso, Renoir, and other painters. Experimental results demonstrate that our formula of creativity successfully captures creative patterns across both the chess and the art domains. This suggests that creativity can be effectively characterized through a unified mathematical structure based on three fundamental criteria, namely newness, value, and surprise, whose specific measurements are adapted to the particular domains.
[AI-84] Neural networks are more modular than single neurons suggest
链接: https://arxiv.org/abs/2610.12842
作者: Shreya Saha,Benjamin Bergen,Meenakshi Khosla
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Neural networks routinely develop representations in which individual neurons contribute to multiple distinct functions, leading to the widespread view that such networks lack modular organization. We challenge this conclusion by introducing a formally nested hierarchy of modularity: unit-level, which requires distinct computations to occupy disjoint neurons; orthogonal, which asks whether a rotation reveals functionally independent subspaces; and linear, which asks whether a bounded linear map can separate task-relevant computations into independent subspaces. We develop a unified framework for learning decompositions at each level and evaluating them causally through selective ablation. Across vision models, language models and multi-task Recurrent Neural Networks (RNNs), we find that networks which lack unit-level modularity nonetheless often exhibit clear functional modularity at the subspace level. In vision and language models, content versus style and syntax versus semantics respectively dissociate under subspace ablation despite sharing overlapping populations of neurons. These learned subspaces also align differentially with brain data, with content and style subspaces predicting higher and lower visual cortex respectively, and semantic subspaces outperforming syntactic ones in predicting language cortex activity. In RNNs trained on multiple cognitive tasks and previously shown to lack modular structure, our decomposition recovers sharp double dissociations between tasks. The absence of unit-level modularity frequently coexists with clear subspace-level modularity across domains, enabling targeted intervention on specific computations even in networks where no individual neuron is specialized, with broad implications for mechanistic interpretability and for understanding functional organization in both biological and artificial neural systems.
[AI-85] LeWAM: End-to-End World and Action Modeling with JEPAs
链接: https://arxiv.org/abs/2610.12818
作者: Minghao Fu,Tavis Siebert,Eryk Halicki,Randall Balestriero
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI)
备注: Project website: this https URL
Abstract:Joint-embedding predictive architectures (JEPAs) learn compact latent world models without pixel reconstruction. Existing JEPA pipelines typically train visual representations and action-conditioned dynamics before adding a control policy or solver. We introduce LeWAM, an end-to-end JEPA for control with: (1) a joint training objective over next latent state prediction and action flow matching, and (2) an isotropic Gaussian constraint on the latent state, enabling a single model to support direct policy execution and efficient planning by evaluating sampled actions with its learned latent dynamics. Compared with prior JEPAs in visual planning, LeWAM improves success rate from 28.6% to 89.7% on contact-rich tasks and from 10.9% to 46.2% on long-horizon tasks, and plans 32.3 times faster. On behavior cloning tasks in simulation and physical robots, LeWAM is also competitive with established methods. Interpretability analyses show that LeWAM learns control-relevant representations and action distributions effectively guiding test-time planning and control.
[AI-86] Efficient Audio-Visual Speech Enhancement via Reinforcement Learning-Based Neural Architecture Search
链接: https://arxiv.org/abs/2610.12796
作者: Khubaib Ahmed,Ahsan Adeel,Nasir Saleem,Kia Dashtipour,Ahsan Ulhaq,Amir Hussain
类目: ound (cs.SD); Artificial Intelligence (cs.AI); Audio and Speech Processing (eess.AS)
备注:
Abstract:Audio-visual speech enhancement (AVSE) improves speech intelligibility in noisy environments but often relies on computationally expensive models unsuitable for resource-constrained edge devices. This paper introduces a reinforcement learning-driven neural architecture search (RL-NAS) framework to discover compact, efficient AVSE architectures. The search space preserves temporal alignment between audio and visual streams, while a novel reward function jointly optimises speech enhancement performance, measured by SI-SNR improvement, and model compactness. Using proximal policy optimisation with constraint-aware action masking, the framework evaluates only 35 candidate architectures and identifies a model with 2.9 million parameters, compared with 22 million in the baseline. The proposed architecture achieves a 14.5 dB SI-SNR improvement, only 0.7 dB below the baseline, while reducing model size by approximately nine-fold. Evaluation on commercial mobile CPUs demonstrates a 4.3-fold reduction in real-time factor, supporting practical on-device deployment. Compared with random search, RL-NAS achieves 92% higher search efficiency. Architectural analysis reveals that shallower but wider temporal convolutional blocks and aggressive visual pathway pruning can maintain enhancement performance while substantially reducing computational requirements. These findings demonstrate the potential of reinforcement learning-guided architecture search for developing lightweight, efficient and deployable multimodal speech enhancement systems.
[AI-87] EvoBelief: Falsifiable World Models for Self-Improving LLM Agents
链接: https://arxiv.org/abs/2610.12789
作者: Janet Wang,Jiang Guo,Yi Xiang,Jiaqing Yuan,Mingwen Dong,Hideo Kobayashi,Shuaichen Chang,Chandan K. Reddy,Jiarong Jiang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Self-evolving LLM agents typically improve how they act through accumulated experience, reflection, or skills. Yet even procedurally capable agents can fail when their beliefs about environment dynamics are incomplete, incorrect, or outdated. We study a complementary axis of self-evolution: evolving those beliefs during deployment. Such beliefs can support multiple tasks, but incorrect ones can also propagate across them. We introduce EvoBelief, a self-evolving world model that represents environment knowledge as falsifiable hypotheses. Unexpected outcomes and decision-relevant unknowns trigger hypothesis formation. Later observations and controlled experiments provide independent validation before a rule can guide predictions or plans within its supported scope. Counterexamples narrow or retire rules as the environment changes. The language model remains frozen, and each rule remains linked to its evidence and the decisions it changes. Across four benchmarks spanning static dynamics, hidden drift, and scientific discovery, EvoBelief improves task performance and reuses learned rules across tasks. On ALFWorld without actor-side transition memory, it improves success over the matched Frozen World Model by 23.9% and 31.3% with Claude Haiku 4.5 and GPT-5.4, respectively. On MiniGrid, it revises stale rules and recovers after unannounced dynamics changes. In DiscoveryWorld’s Reactor Lab, it discovers and validates quantitative laws, completing 83.3% of Normal-tier and 58.3% of Challenge-tier instances, versus 0% for each evaluated baseline. These results demonstrate self-improvement through testable, revisable environment knowledge rather than model-parameter updates.
[AI-88] Representation Alignment from a Few Paired Data via Distilled Optimal Transport
链接: https://arxiv.org/abs/2610.12781
作者: Julien Kordes,Reuben Dorent
类目: Artificial Intelligence (cs.AI)
备注: Preprint
Abstract:Aligning two independently pretrained unimodal encoders typically demands millions of paired examples. In this paper, we study the regime where only N \sim 100 – 500 pairs are available, while unpaired data on either side is abundant. Our method expresses every representation by its similarities to the N paired anchors, which places both modalities in a common coordinate system; matches the two point clouds with a single entropic optimal transport problem solved over the entire pool, whose marginal constraints counteract the hubness that defeats nearest-neighbor matching; and distills the resulting plan into two lightweight encoders, so that the correspondence becomes inductive. We additionally put this marginal constraint in relation with the one-step hub corrections of the bilingual lexicon induction literature. Pairing is required only for the anchors: the unpaired collections may be drawn independently from the two marginals, so that no item outside the anchor set needs to have both of its modalities observed. We evaluate on image-text and molecule-text alignment, where our method outperforms existing approaches at the same anchor budget on Flickr30k, MS-COCO and ChEBI-20.
[AI-89] Semantic Views: Certified Reuse of LLM Labels Across Semantic Queries
链接: https://arxiv.org/abs/2610.12768
作者: Oktie Hassanzadeh,Dharmashankar Subramanian
类目: Databases (cs.DB); Artificial Intelligence (cs.AI)
备注: Code and data: this https URL
Abstract:Semantic query engines evaluate natural-language filters with a large language model, and every evaluation is a costly oracle call. Optimizers that reduce these calls face a dilemma: cascades that trust a cheap proxy miss their precision and recall targets on many queries, methods with finite-sample guarantees save little, and all of them discard the oracle’s labels when the query ends. We present SemViews, a certified semantic filter that orders tuples by signals that cost no oracle calls (the labels that earlier queries left behind as semantic views, a local embedding, and a helper model’s score), refines that order with labels it must pay for anyway, and certifies its answer with fresh stratified oracle samples. The answer meets user precision and recall targets with probability at least 1-\delta for every workload and every catalog, so a stale or misleading view can cost oracle calls but never accuracy. On four workloads replayed against 725,000 recorded oracle labels, SemViews meets both targets on 99.63% of queries and saves 28%-45% of the oracle calls, whereas the only prior method in our study with the same guarantee needs 1.32x-1.71x as many calls. When a question returns in different words, views cut its calls by a further 27%-36%, with both targets met on at least 99.8% of such queries; similarity caches and entailment-based reuse meet them on only 17%-47%.
[AI-90] Faithful and Complete LLM -Assisted Automated Construction of Hierarchical Hardware Knowledge Graphs
链接: https://arxiv.org/abs/2610.12762
作者: Haotian Qiao,Robert P. Dick
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:Hardware datasheets contain engineering specifications essential for component selection, system integration, and hardware compatibility verification. However, manual inspection is tedious and error-prone because datasheets are lengthy and heterogeneous, with dense information fragmented across tables, figures, and text. Although large language models (LLMs) can automate this process, naïve one-shot processing omits relevant specifications even when the document fits within the model’s context window. We present an automated LLM-driven pipeline that transforms hardware datasheets into general-purpose hierarchical hardware knowledge graphs through chunk-based property extraction, hierarchical routing, and iterative refinement. The framework uses LLMs for information extraction and semantic reasoning while preserving source provenance and applying graph updates through validated instructions and deterministic local execution. This staged design reduces per-query context and maintains traceable intermediate representations. The resulting knowledge graphs provide semantically organized, source-grounded hardware properties for downstream retrieval and reasoning. We evaluate the framework on 20 hardware datasheets spanning diverse component types and document lengths. We assess property faithfulness and introduce inter-graph completeness to measure relative semantic coverage without exhaustive ground truth. Our framework achieves 98.8% property faithfulness compared with 76.1% for the one-shot baseline, while fully covering 83.6% of faithful baseline properties; in the reverse direction, the baseline fully covers only 10.5% of ours. These improvements provide more reliable and comprehensive engineering information for downstream hardware design and verification, reducing the risk of overlooked constraints and incorrect decisions. Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2610.12762 [cs.AI] (or arXiv:2610.12762v1 [cs.AI] for this version) https://doi.org/10.48550/arXiv.2610.12762 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[AI-91] rajectory Prediction for Autonomous Driving in Road Construction Zones Using Human-in-the-Loop Driving Data
链接: https://arxiv.org/abs/2610.12747
作者: Shuo Zhang,Aman Sunesh,Semiha Ergan,Kaan Ozbay
类目: Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Ego-trajectory prediction in urban roadway work zones remains an underexplored topic in autonomous-driving research, with limited dedicated data and systematic evaluation. Roadway work zones involve temporary changes in the lane layouts and connectivity of the roads, complicating interactions with surrounding vehicles and workers. These changes make future vehicle trajectories difficult to predict. To address these challenges, we collect WZDrive-Data, a multimodal dataset comprising 1,183 work-zone driving segments from 33 drivers, using a human-in-the-loop driving simulator with prerecorded worker animations and VR-controlled workers. Driver control and gaze signals are recorded from human participants, while vehicle trajectories and scene information are obtained from the simulator. Our proposed multimodal ego-trajectory predictor, WZDrive, achieves a mean minADE (K=6) of 1.09 m and minFDE (K=6) of 2.12 m. Compared with the best-performing state-of-the-art baseline for each metric in our benchmark, WZDrive reduces minADE (K=6) by 7.18% and minFDE (K=6) by 13.18%. This research addresses a gap in autonomous-driving research on urban work zones by combining human-in-the-loop data collection with multimodal learning from human driving signals and in the context of work zones.
[AI-92] KITE: A Knowledge-Injected Temporal Encoder for Time-Series Event Forecasting NEURIPS2026
链接: https://arxiv.org/abs/2610.12738
作者: Jonas Petersen,Pratik Jawahar,Riccardo Maggioni,Gian-Alessandro Lombardi,Matteo Cozzi,Marek Gajewski,Federico Martelli,Camilla Mazzoleni,Philipp Christian Petersen
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注: FMTS, NeurIPS 2026
Abstract:Forecasting rare, high-cost events in multivariate time-series systems is hard because their precursors are seldom observed, so a purely data-driven model has little to learn from. The engineers who run these systems, however, hold knowledge that precedes such events, information absent from the scarce labels. We call this a semantic prior and inject it into a self-supervised event forecaster through two switchable mechanisms, a covariate mechanism and an attention-bias mechanism, each the identity at its null, so one architecture serves every prior type with no per-dataset architecture search. A prior helps when it supplies information the observed window does not already contain: in a short context an informative prior beats no prior in-domain (pooled h-AUROC over the no-prior baseline: a periodicity clock +14%, p0.001; a conservation residual +47% at a 0.25 label fraction), and a working prior transfers out-of-domain (+53%), substituting for feature transfer, while priors the window already recovers stay inert and the attention-bias mechanism shows no measurable gain. KITE is a switchable, attributable route to contextual conditioning, and a substrate for scaling toward cross-domain, pretrained time-series foundation world models that carry their governing structure explicitly.
[AI-93] MagicBeanStalk: Escaping the RLVR Zero Advantage Trap with Recursive Data Synthesis
链接: https://arxiv.org/abs/2610.12659
作者: Ximing Lu,Aviral Kumar,Jan Kautz,Yejin Choi,David Acuna
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Data-centric scaling of RLVR has focused on collecting or generating verifiable training problems. However, corpus size alone does not determine whether the dataset provides a useful learning signal for a target policy. To guide the synthesis of effective RLVR data, we experimentally characterize dataset effectiveness as a function of its problems, the target policy, and the training rollout budget. Under this characterization, we show that a large open-source math corpus pooled from widely used RLVR datasets falls almost entirely into a zero-advantage trap: for a fixed target policy and rollout budget, roughly 88% of its problems are solved in every rollout or failed in every rollout. Filtering concentrates what remains, but it can only select, discarding the hard problems. Effective synthetic problems should therefore require the reasoning operations and compositions required to solve those hard problems. Yet their difficulty must be calibrated, so that some rollouts succeed, some fail, and at least one correct solution fits within the training budget. Prompting a teacher to vary hard problems directly does not achieve this. Guided by these empirical principles, we introduce MagicBeanStalk, a top-down decomposition and bottom-up recursive data-synthesis algorithm that grows seed problems into families of substantively new, policy- and budget-calibrated training problems while preserving the seeds’ reasoning blueprints. Across 8 math benchmarks, continual RLVR on MagicBeanStalk problems improves gpt-oss-120b from 61.2 to 69.8 (+8.6) and DeepSeek v4Flash from 72.4 to 77.9 (+5.4) on a 16K-token budget. Training on the full 78K source corpus improves by only +1.1 and its best filtered real data subset by +5.8. In finance, we synthesize over 14K verifiable problems from only 340 solutions and improve over base by 6.9 and 2.4 points on SecQue and FinanceBench, respectively.
[AI-94] Kronecker Product Attention: Memory-Efficient KV Compression via Structured Factorization
链接: https://arxiv.org/abs/2610.12657
作者: Bahareh Nikpour,Hossein Rajabzadeh,Maryam Dialameh,Vahid Partovi Nia,Parsa Omidi
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Efficient autoregressive generation is increasingly limited by the memory footprint of the key-value (KV) cache, which grows linearly with sequence length, batch size, and model depth. Existing approaches such as Multi-Query Attention (MQA), Grouped-Query Attention (GQA), Multi-Head Latent Attention (MLA), and Tensor Product Attention (TPA) reduce this cost through different trade-offs, but often sacrifice expressivity, require additional positional-encoding machinery, or impose restrictive low-rank structure. We propose Kronecker Product Attention (KPA), which represents key and value activations as sums of Kronecker products of compact, token-dependent matrix factors. KPA strictly generalizes TPA: rank-one vector-outer-product factorization arises as a degenerate Kronecker split, while non-degenerate matrix factors can represent richer block-structured patterns. We further show that a structured rotary embedding operator matched to the Kronecker representation preserves the relative-position property of RoPE while rotating only the compact factors, removing the need for a decoupled RoPE branch as in MLA. Empirically, KPA matches or exceeds TPA, MHA, MQA, GQA, and MLA across four model scales and nine downstream benchmarks under identical training conditions, while achieving up to 10x KV cache compression. The Kronecker head split is a tuneable hyperparameter that allows practitioners to navigate the compression-accuracy trade-off at design time without architectural changes.
[AI-95] CLEAT: Learning Value-Guided Clarification for Interactive Agents
链接: https://arxiv.org/abs/2610.12655
作者: Jiatan Huang,Zheyuan Zhang,Ziming Li,Tianyi Ma,Mingchen Li,Yanfang Ye,Chuxu Zhang
类目: Artificial Intelligence (cs.AI)
备注:
Abstract:LLM agents can execute increasingly complex tasks, but effective assistance also requires aligning their actions with goals and constraints that users may leave unstated. We study this problem as interactive intent alignment through clarification. Yet clarification is useful only when the agent can turn the answer into better decisions. As training changes how the agent handles incomplete information and uses additional answers, the same clarification can become more or less useful. We introduce CLEAT (CLarification through valuE-guided Agent co-Training), a framework that co-trains a clarification-value controller and the task policy from shared interaction outcomes. We formulate residual query value to measure the task utility gained by asking rather than proceeding under the current policy, and estimate it through paired rollouts from the same interaction history. These paired returns train the controller to predict clarification value and the task policy to select useful questions and act on the answers. The controller guides subsequent rollout collection, while outcomes from the updated agent provide new value labels that allow clarification guidance to adapt as the agent learns. With Qwen3-4B, CLEAT achieves the highest mean score in all ten evaluation settings across four benchmarks. Gains over the strongest baseline reach 13.2 and 6.5 percentage points on UserGym Travel and IN3 underspecification judgment accuracy, respectively. Ablations show that co-training improves the task policy even when the controller is removed at inference, while adapting clarification guidance to the evolving policy yields further gains.
[AI-96] Machine Learning and Time-Series Foundation Models for Day-Ahead Electricity Forecasting in a University Building
链接: https://arxiv.org/abs/2610.12638
作者: Amey Vasulkar,Samuel Kernan Freire,Arie-Willem de Leeuw,Tadeo-Baldiri Salcedo-Rahola
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
备注:
Abstract:Day-ahead electricity forecasts can help building operators schedule heating, ventilation, and other services around anticipated demand. Choosing a forecasting model also requires balancing accuracy with its forecast-time inputs, local training, and computational requirements. We benchmark statistical, machine-learning, recurrent neural-network, and pretrained TimesFM models for a university building. We use chronological validation and evaluate all configurations on the same 57 test days, comparing accuracy across workdays, weekends, and holidays alongside local fitting and forecasting time. Weather covariates use retrospective observations. TimesFM 3.0 with covariates achieves the lowest overall errors, reducing mean absolute error by approximately 43% relative to weekly seasonal-naive forecasting. XGBoost remains competitive, although paired daily comparisons do not establish a clear mean-absolute-error advantage for TimesFM. TimesFM also performs strongly using only past electricity consumption. Adding covariates improves its holiday forecasts but slightly worsens workday and weekend forecasts, leaving overall mean absolute error almost unchanged. TimesFM requires no building-specific weight training, while XGBoost offers rapid local fitting and inference. The evaluated LSTM takes longer to fit without outperforming either approach. An exploratory historical evaluation reveals seasonal variation, while a separate weather-source comparison produces only small changes in the selected TimesFM configuration’s accuracy. These results support pretrained TimesFM as a strong initial forecasting baseline for this building, with XGBoost as a competitive locally fitted alternative. Covariates are particularly useful when improved holiday forecasts justify the additional input preparation. Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI) Cite as: arXiv:2610.12638 [cs.LG] (or arXiv:2610.12638v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2610.12638 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Amey Vasulkar [view email] [v1] Thu, 8 Oct 2026 19:00:09 UTC (2,871 KB)
[AI-97] Mesh-Native Tokenisation: Retrofitting Foundation Models to Unstructured Data
链接: https://arxiv.org/abs/2610.12618
作者: Georg Maierhofer,Miles Cranmer,Payel Mukhopadhyay
类目: Computational Engineering, Finance, and Science (cs.CE); Artificial Intelligence (cs.AI); Numerical Analysis (math.NA)
备注:
Abstract:Physics foundation models are an increasingly popular approach for building versatile emulators for spatiotemporal systems. They require tokenisation layers that lift physical field data into a latent representation suitable for dynamic processing. A typical choice for this layer is a convolutional encoder, which lifts field information in a locality-aware way and can be trained very efficiently. However, this choice cannot be applied to a large class of scientific computing problems where data are represented on unstructured meshes, for example simulations on domains with curved boundaries. Such data typically require graph neural network architectures, which are more expensive to train and, in the form currently used, encode information differently from their CNN counterparts, thus limiting the portability of physics emulators between these data regimes. In this work we introduce Mesh-Native Convolution (MNC), a locality-aware tokenisation layer that encodes unstructured mesh-based data in a way that is analogous to CNNs. This approach leads to models that can be trained once on mesh data and then deployed to arbitrary unstructured meshes, even if these are irregular, with minimal retraining. We show that this tokenisation approach can be used to retrofit grid-pretrained foundation models efficiently on unstructured meshes and provide theoretical results to confirm the consistency of this approach with classical CNN encoders. We demonstrate the favourable performance of this retrofitting approach, which in many cases reaches acceptable accuracy even in zero-shot deployment, and outperforms existing baselines after only a few epochs of fine-tuning, thus providing an efficient bridge between the two data regimes.
[AI-98] Beyond Binary Verifiable Rewards: Behavioral Self-Rewarding for SWE Agents
链接: https://arxiv.org/abs/2610.12598
作者: Yiran Wu,Andrew Zhao,Yurui Chang,Qingyun Wu,Xuan Feng
类目: Artificial Intelligence (cs.AI); Software Engineering (cs.SE)
备注:
Abstract:Reinforcement learning with verifiable rewards (RLVR) provides reliable supervision for software engineering agents through executable tests, but binary rewards fail to distinguish trajectories with substantially different debugging quality. We investigate whether the current policy can judge its own trajectories and use these judgments to improve task performance without a separately trained reward model. To this end, we introduce Behavioral Self-Rewarding (BSR), a reward-refinement method that reuses the policy to compare observable debugging behavior among trajectories from the same task with the same verifier outcome. BSR aggregates pairwise preferences into task-local scores and converts them into bounded auxiliary rewards, introducing reward contrast while preserving the verifier-defined pass/fail ordering. This provides additional supervision from already-collected trajectories without requiring new environment interactions. Experiments on SWE-bench Verified and SWE-bench-Live show consistent improvements across the evaluated Qwen3-14B and Qwen3-32B configurations, supporting using the policy’s own comparative judgments as a complementary learning signal for training software engineering agents.
[AI-99] Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study
链接: https://arxiv.org/abs/2610.12542
作者: Yuyu Zhang
类目: Artificial Intelligence (cs.AI); Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG)
备注: 19 pages, 4 figures. Preregistered negative result with an open evaluation protocol; companion artifacts archived at https://doi.org/10.5281/zenodo.22929494 and https://doi.org/10.5281/zenodo.22930513
Abstract:Monte Carlo Tree Search (MCTS) is often proposed for scheduling directed-acyclic-graph (DAG) workflows, yet most studies never run the comparison that could refute it - giving a much simpler method the same search effort. We run that comparison under a controlled protocol. All arms receive an identical budget - the same number of candidate schedules built and evaluated: an MCTS scheduling method, preregistered as the main arm; a randomized-restart list scheduler with no search tree as the control; and a textbook-UCT MCTS arm as a registered follow-up on the same domain. The analysis plan was locked before data collection; an independent checker confirmed all 768 confirmation-stage schedules valid with correct finish times. At the main budget of 2048 evaluated schedules, MCTS is 2.88% worse than the restarts (95% CI [-3.62%,-2.15%]; the 72 of 96 held-out instances with positive baseline-relative headroom). The deficit is not budget starvation: on the separate exploration pool restarts self-improve by 1.85% where MCTS gains 0.24%, and 700 of 720 of MCTS’s first results are merely the warm start it was handed. The studied selection rule locks deterministically onto the first-expanded child, keeping its trials correlated while restarts draw gains from the tails; the causal link to makespan remains an inference. A structural map locates where the tree stops paying: restarts win on sparse irregular workflows, no difference is detectable on regular layered ones, and dense ones leave no room to improve. Swapping the rule for textbook UCT removes most of the deficit (-0.26%, 95% CI [-0.71%,+0.23%]) without reversing its sign. Results are confined to a controlled synthetic domain (N in 8,16,32 tasks, 2-8 processors, budgets up to 2048); we make no claim about larger budgets.
[AI-100] EliteTable: Self-Improving Program Search for Executable Control Policies
链接: https://arxiv.org/abs/2610.12536
作者: Stuart Farmer
类目: Artificial Intelligence (cs.AI); Neural and Evolutionary Computing (cs.NE)
备注:
Abstract:EliteTable is a self-improving program-search algorithm guided by large language models (LLMs) that uses a fixed-capacity table of high-scoring solutions to guide new proposals, edits of existing solutions, and remixes of several solutions. Performance was evaluated across six Gymnasium control tasks, each with ten generations and fifty candidate slots per generation. Each task was evaluated across ten independently initialized searches. Candidate-score medians rose between the first and final generations in all six tasks, and selected-winner search-score medians rose in five. In CartPole-v1, the selected winner reached the search-score ceiling in the first generation of all ten searches. All ten paired held-out endpoints improved in four of the six tasks. BipedalWalker-v3 and CarRacing-v3 improved without reaching their reporting targets. Six of ten Acrobot-v1 searches declined on held-out episodes, and the median paired change was negative. The results document improvement during program search and the transfer of selected-winner gains to new episodes in some tasks. Comparisons and ablations are needed to establish EliteTable’s relative performance and the contributions of its components.
[AI-101] CircuitTree: Composing Circuits into A Syllable Transcriber
链接: https://arxiv.org/abs/2610.12520
作者: Jiankun Wei,Ewan Dunbar,Gerald Penn
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Sound (cs.SD)
备注:
Abstract:The goal of circuit discovery is to decompose a monolithic neural network into tiny modular subnetworks which are interpretable in the sense that each does an identifiable subtask. We develop a practical method for composing arbitrarily many circuits into a single model. We propose a greedy, density-scaled composition algorithm that overcomes limitations of previous attempts to compose circuits by naive union, then generalize it to N circuits via CircuitTree, a new data structure built on a \Theta(N\log N) tree-compose schedule. We compose circuits pruned from HuBERT for classifying individual phonemes into a syllable classifier, a capability none of the 39 phoneme circuits has individually. Chaining CircuitTrees into a hierarchy-of-circuits pipeline, we transcribe open syllables at 64.8% accuracy, within 1.2 points of a 66.0% ceiling that shares no circuitry at all, with 99.5% of circuit components shared.
[AI-102] Energy-Efficient Spiking Neural Networks for Sensing-Aided Beam Prediction
链接: https://arxiv.org/abs/2610.12507
作者: Nhan Thanh Nguyen,Phuong Nam Tran,Mengyuan Ma,Huy T. Nguyen,Ahmed Alkhateeb,Markku Juntti
类目: Neural and Evolutionary Computing (cs.NE); Artificial Intelligence (cs.AI)
备注: Submitted for possible publication
Abstract:Sensing-aided beam prediction can reduce the beam-training overhead of millimeter-wave (mmWave) systems by leveraging environmental information from complementary modalities such as vision and position. However, the resulting sensing and inference pipeline can be energy-intensive, motivating the use of energy-efficient spiking neural networks (SNNs) as an alternative to conventional artificial neural networks (ANNs). In this work, we develop SNN architectures for beam prediction and systematically compare them with ANNs using position-only, vision-only, and multimodal inputs. Our results show that compact ANNs consistently outperform SNNs for position-only sensing. In contrast, for vision and multimodal sensing, SNNs achieve higher accuracy than ANNs at similar energy costs and require up to an order of magnitude less energy at a comparable accuracy. For example, the multimodal SNN achieves 58.08% top-1 accuracy, outperforming the closest-energy ANN by 18.11 percentage points. We further show that SNN accuracy is limited by the binary communication between layers rather than by model size. These results demonstrate the potential of SNNs for energy-efficient sensing-aided beam prediction while highlighting their accuracy limitation.
[AI-103] Faithfulness Without Anchors: A Position Paper on the Structural Misalignments of Explainable AI Faithfulness Metrics for Feature Importance IJCAI ECAI2026
链接: https://arxiv.org/abs/2610.12493
作者: Marco Zullich,Emily Schiller,Ivan Gentile,David Dembinsky,Adriano Lucieri,Kilian Göller,Steffen Seitz
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Machine Learning (stat.ML)
备注: Presented at the IJCAI-ECAI 2026 Workshop on Explainable Artificial Intelligence (XAI)
Abstract:Explainable Artificial Intelligence (XAI) tools have often been presented as methods to increase trust in machine learning models by making aspects of their algorithms more human-understandable. However, evidence accumulated over the last decade points to an overall failure of this objective, instead promoting overreliance on incorrect predictions, which can subsequently lead to algorithmic aversion. Rather, XAI appears to function primarily as a debugging tool, useful for obtaining anecdotal insights into, for example, features learned by the model. One of the main issues underlying this limitation is that XAI methods often oversimplify the inner workings of the model, resulting in misalignment between the explanation and the model itself - a behavior referred to as unfaithfulness or infidelity. Faithfulness can be interpreted as the degree of approximation between an explanation and the model. Computing faithfulness in a rigorous manner would thus make it possible to quantify one of the various elements of trustworthiness of an explanation. However, existing metrics present significant limitations, making this quantification either infeasible or computationally expensive. In this position paper, we outline five major shortcomings of current faithfulness metrics and propose four possible avenues for research to bolster their reliability.
[AI-104] On the estimation and validity of AI time horizons—a statistical look at the METR plot
链接: https://arxiv.org/abs/2610.12466
作者: Drew T. Nguyen,William Fithian
类目: Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Machine Learning (stat.ML)
备注:
Abstract:METR’s 50% time horizon measures the human completion time of software tasks that an AI solves with 50% probability, allowing AI capabilities to be expressed in interpretable units. On 228 tasks and 26 AIs, we recompute the time horizons using splines and item-response theory to relax the assumption that the AI difficulty of a task depends linearly on the log of human time. Our fitted spline can be interpreted as a function that \emphconverts human time to AI difficulty; it is nearly flat in a region from 2–30 min but close to linear elsewhere. Hence, a time-horizon jump from 3 min to 30 min is much easier than one from 30 min to 5 hours despite the same multiplier of 10 \times . Overall, we contribute time-horizon point estimates that perform better under a cross-validated suite of proper scoring rules, as well as diagnostic plots for assessing time horizons’ construct validity. We suggest that time horizons be interpreted together with the diagnostic plots, especially as new time-horizon-based benchmarks are proposed or existing ones grow to include longer tasks.
[AI-105] Rethinking Neural Nonlinearity as Gating
链接: https://arxiv.org/abs/2607.03148
作者: Muhammad Sabih,Frank Hannig,Jürgen Teich
类目: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Hardware Architecture (cs.AR)
备注:
Abstract:Activation functions are considered an essential primitive for neural nonlinearity, i.e., they enable neural networks to serve as universal approximators. In this paper, we show that this nonlinearity can also be achieved by input-conditioned threshold gating through branches as a universal primitive. We demonstrate that standard activations – whether piecewise-linear (ReLU, PReLU, Hardtanh) or smooth (SiLU, Sigmoid, Tanh, GELU) – are in fact instances of a single Threshold Gating (TG) primitive. For softmax, we show that it admits an exact TG conversion via its equivalent per-element Sigmoid form. We then validate these equivalences by converting pretrained networks across CNNs, transformer-based models, and recurrent architectures, preserving model performance without requiring retraining. Threshold Gating also enables training from scratch that goes beyond replacing existing activations, enabling gains in model compression, performance, and shorter training. We also propose a ‘Minimal Branch Theorem’ which relates the minimum number of required branches in our primitive to the trainability of general deep neural networks. In terms of hardware implementation, TG maps to a unified implementation in the case of analog in-memory systems, addressing the bottleneck of analog-to-digital and digital-to-analog converters (ADC/DAC) that is known to significantly impact power consumption and on-chip area.
[AI-106] Not All Dimensions Are Equal: Outlier-Aware Attention Linearization with Grouped Quadratic Kernels
链接: https://arxiv.org/abs/2610.13674
作者: Weiqi Sun,Qianyue Wu,Wenjia Wang,Tianyang Hu
类目: Machine Learning (stat.ML); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注:
Abstract:Linearizing softmax attention offers a route to efficient Transformer inference, but preserving pretrained attention remains challenging. We identify an important source of approximation error overlooked by standard linearization methods: a small number of outlier dimensions contribute disproportionately to query-key dot products and account for a large fraction of the approximation error. Motivated by this heterogeneity, we propose Outlier-Aware Attention Linearization (OAL), a dimension-aware method for constructing quadratic attention approximations. Starting from a second-order Taylor approximation, we introduce a Hadamard-product formulation that makes individual query-key contributions explicit. This formulation relaxes globally shared coefficients to support dimension-specific linear terms and cross-dimensional quadratic interactions while preserving separable evaluation. To retain this flexibility with fewer parameters, OAL groups dimensions with similar contribution scales to share coefficients, while allowing distinct treatment of the few outliers. The resulting positive quadratic kernel is calibrated against pretrained attention outputs and admits linear-time evaluation with respect to sequence length for fixed head dimensions. On Qwen2.5-0.5B, OAL reduces frozen-attention output relative MSE by approximately 8.9% compared with DiJiang. Replacing middle-layer attention modules and jointly fine-tuning the kernel coefficients with LoRA further lowers WikiText-103 perplexity from 31.71 to 27.50 compared with a learned global quadratic, while improving accuracy on PIQA, HellaSwag, and ARC-E. These results demonstrate the value of outlier-aware dimension grouping for both attention approximation and pretrained-model conversion. The code is available at this https URL
[AI-107] Defence against the dark arts of distillation: Unsupervised discovery of subliminal learning
链接: https://arxiv.org/abs/2610.13536
作者: Joseph Egan,Ciarán M. Gilligan-Lee,Michael O’Riordan,Yuchen Zhu
类目: Machine Learning (stat.ML); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
备注: 9+12 pages, comments welcome
Abstract:When a language model is distilled from a teacher that shares its base parameters, the student can inherit behavioural traits of the teacher—including misalignment—even from data that is semantically unrelated to the trait (Cloud et al., 2026). All existing defences require knowing the trait. We remove this requirement and prove that a subliminally transferred trait can be recovered from the parameter updates alone, without supervision, by exploiting a single asymmetry: the trait is expressed consistently across diverse datasets generated by the teacher, whereas task-specific and shared capabilities vary. The resulting estimator returns a weight-space direction that can be amplified to discover and interpret the trait or projected out to suppress it. Applied to the subliminal-learning benchmarks of (Cloud et al., 2026), our method recovers the transmitted animal-preference traits without any trait labels and suppresses their expression with almost no impact to task performance.
[AI-108] CNN-Transformer with Sigmoid Label for High-Resolution Sub-Degree DOA Estimation
链接: https://arxiv.org/abs/2610.13433
作者: Lifeng Wang,Xintong Li,Aifei Liu
类目: ignal Processing (eess.SP); Artificial Intelligence (cs.AI)
备注:
Abstract:This paper addresses the grid quantization error of deep-learning (DL)-based direction-of-arrival (DOA) estimation. Classification- based DOA methods discretize the continuous angular space into a grid, so that with a peak-based read-out, the accuracy and resolution are limited by the grid step and by the width of the label peak. To address this issue, we propose a sigmoid label that encodes the sources’ DOAs as the sum of angle-shifted monotonic sigmoid functions. Differentiating the output of a CNN-Transformer network trained with the sigmoid label produces sharp spectral peaks at the source DOAs. Combined with a moderately refined grid step of 0.25 degrees, the CNN-Transformer with the proposed sigmoid label attains sub-degree accuracy and a 1-degree resolution, breaking the limit of the grid quantization error. Under the unified CNN-Transformer backbone, we compare the proposed Sigmoid label with the Gaussian label, the 0-1 hard label, and the binary cross-entropy (BCE) baseline. Numerical results demonstrate that the Sigmoid label attains the highest accuracy and superior resolution compared to other labels.
[AI-109] Localized Generative Design of Ship Hulls with Diffusion Models and High-Fidelity Assessment
链接: https://arxiv.org/abs/2610.12870
作者: Hadi Keramati,Mohammed A. Hannan,Patrick Kirchen,Sina Tousi,Joonas Riekkinen,Jim Pyra,Rajeev K. Jaiman
类目: Analysis of PDEs (math.AP); Artificial Intelligence (cs.AI); Mathematical Physics (math-ph)
备注:
Abstract:Practical ship design requires localized refinement and performance evaluation. This paper presents a reward-directed diffusion framework for localized hull optimization. Parametric masking during dataset generation restricts geometric changes to selected variables, including the bulbous bow and forebody, while preserving full-hull continuity. Surrogate-assisted sequential Monte Carlo sampling targets reduced predicted calm-water resistance, with stability retained through training data and displacement matched during screening. An automated viscous free-surface CFD pipeline, validated against measurements for two benchmark container ships, evaluates a generated variant and GenHull E, a hull refined by a naval architect within the same representation. At matched KRISO Container Ship (KCS) displacement, the generated variant has comparable total resistance at F_n=0.195 but 45-50% higher resistance at F_n=0.250 and 0.260 , missed by empirical screening. GenHull E achieves 6-8% lower total resistance up to F_n=0.240 but higher resistance above F_n=0.250 as opposing friction and pressure trends reverse the gains. Aggregating resistance across this crossover can conceal tradeoffs that emerge when friction and pressure components are evaluated separately. The assessment reveals an inability to represent a faired bulbous bow and a reward lacking viscous pressure and stability terms. These findings show how high-fidelity assessment informs improved representations and objectives for physically realizable generative designs.
机器学习
[LG-0] AI Models Can Provably Hide Arbitrary Capabilities NEURIPS2026
链接: https://arxiv.org/abs/2610.13928
作者: Andis Draguns,Sumeet Ramesh Motwani,Raymond Douglas,Christian Schroeder de Witt
类目: Machine Learning (cs.LG); Cryptography and Security (cs.CR)
*备注: 22 pages, 6 figures, 3 tables. Accepted at NeurIPS 2026
Abstract:Capability evaluations aim to surface dangerous model behaviors before deployment, but their reliability depends on the assumption that hidden capabilities can be elicited. We show this assumption does not hold under adversarial conditions by constructing backdoor attacks that embed encrypted neural networks within host model weights, decrypting and executing them only upon receiving a secret trigger. Using digital lockers, these hidden circuits remain provably hard to elicit and interpret under cryptographic assumptions, even given full access to model weights, extending prior work from hiding fixed strings to arbitrary computations. We implement our proof of concept constructions in PyTorch and evaluate elicitation through fine-tuning, weight noising, gradient-based trigger search, and latent adversarial training on a small chemical reaction prediction task - a proxy for CBRN-relevant capabilities. Our results demonstrate resistance to these methods and, together with our cryptographic guarantees, reveal a limit of elicitation-based capability audits. We release our models to support the improvement of defenses.
[LG-1] KL Before and After Mixing: A Round-Complexity Separation in Parallel Sampling
链接: https://arxiv.org/abs/2610.13924
作者: Tianyi Wu
类目: Machine Learning (cs.LG); Information Theory (cs.IT)
*备注: 15 pages of main text; 169 pages total including references and appendices; 7 figures. Formal proof materials included as ancillary files
Abstract:A parallel sampler can choose at random which coordinates to generate together. For a target p and the output law q_U of a schedule U drawn afresh for each output, we compare the schedule-averaged divergence \mathbbE_U D_\mathrmKL(p|q_U) with the output-law divergence D_\mathrmKL(p|\mathbbE_U q_U) , in nats. Rounds commit independent draws from exact conditional marginals frozen at the round’s start, each output’s schedule is drawn before sampling from a finite mixture of schedules, and every scheduled round is charged. For the uniform distribution on binary strings of even length n with n/2 ones, the least expected number of rounds at a fixed tolerance \varepsilon0 is \Theta_\varepsilon((\log n)^2) under the first criterion but (e^-\varepsilon+o(1))\log_2\ln n under the second, and the double-logarithmic order is attainable with the same round count on every run. For this target, a count-state recursion gives the exact least output divergence at every round cap over all causal randomized policies. The separation extends to weighted fixed-count targets with bounded weight ratios and quota fractions bounded away from zero and one, without permutation symmetry, and to the full-support Beta (1,1) --Bernoulli target, where the sharp expected cost under the output-law criterion is (e^-\varepsilon/2+o(1))\log_2\log_2n , attained with rare n -round runs. Prior work implies the order of the schedule-averaged cost on the balanced target and its O_\varepsilon((\log n)^2) upper bounds on both extensions.
[LG-2] Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
链接: https://arxiv.org/abs/2610.13923
作者: Sajjad Baghaeea,Aimin Lib,Shanmugarajan Balasubramanian,Elif Uysal
类目: Networking and Internet Architecture (cs.NI); Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注: 15 pages, 3 figures, 4 tables. Presented at the 77th International Astronautical Congress (IAC 2026), Antalya, Turkey, 5-9 October 2026. Paper ID: IAC-26-B2.5.8-x113206
Abstract:Deep-space communications operate under intermittent connectivity, long propagation delays, and relay storage constraints. In such networks, the Bundle Protocol enables store-carry-forward communication, requiring relay nodes to manage limited storage and scarce contact opportunities. Relay-side scheduling and dropping decisions are inherently goal-oriented: transmission resources should be allocated to bundles most valuable to downstream mission objectives. Conventional schedulers, such as FIFO, do not explicitly optimize task utility and may provide unfair service across heterogeneous planetary sources. This paper presents a closed-loop modeling and learning framework for relay-side bundle and flow management in a contact-driven deep-space network, where lunar and Martian updates are forwarded through a shared-buffer relay to Earth. We quantify destination-side information freshness using excess age \Delta_i^e(t)=[\Delta_i(t)-d_i(t)]^+ , where \Delta_i(t) denotes the Age of Information of source i and d_i(t) is a source-dependent delay baseline. Based on this metric, we define a goal-oriented loss that supports source-dependent nonlinear penalties, allowing prioritization according to mission relevance. We formulate relay control as a constrained semi-Markov decision process (CSMDP) and solve it using masked Lagrangian Proximal Policy Optimization (PPO). Feasibility-aware action masking restricts transmissions to bundles that can complete within the remaining contact window. DTNSim simulations indicate improved age-based utility and inter-flow fairness compared with baseline schedulers. The proposed framework jointly optimizes relay-side bundle scheduling, dropping, and flow control under contact-driven dynamics with explicit fairness considerations across heterogeneous sources.
[LG-3] DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
链接: https://arxiv.org/abs/2610.13918
作者: Daniel Szelogowski
类目: Neural and Evolutionary Computing (cs.NE); Emerging Technologies (cs.ET); Machine Learning (cs.LG); Neurons and Cognition (q-bio.NC)
*备注: 19 pages, 5 figures, 4 tables
Abstract:Clinical sleep medicine repeatedly documents profound divergences between objective sleep duration and subjective daytime impairment, notably exemplified by sleep state misperception in paradoxical insomnia and boundary instability in narcolepsy type 1. Here, we present DyssomniaNN: a multi-scale biophysical computational framework coupling Borbély’s two-process regulation of sleep homeostasis and circadian drive with Saper’s hypothalamic reciprocal flip-flop circuit and a recurrent corticothalamic leaky integrate-and-fire spiking neural network. We formalize five clinical cohorts across an identical 72-hour photoperiod: healthy control, circadian rhythm sleep-wake disorder (delayed-phase), chronic insomnia, paradoxical insomnia, and narcolepsy type 1. The synthetic local field potential converges closely with empirical human electroencephalography spectra from the PhysioNet Sleep-EDF database across all canonical frequency bands (spectral mean absolute error of 0.33–0.35). Furthermore, we introduce the Well-Rested Index to quantify restorative efficacy. Simulations reveal that sleep duration fails to predict restorative recovery: paradoxical insomnia achieves normal total sleep time (21.15 h) yet yields low restoration (37.6%) from unsuppressed cortical beta-band intrusion, whereas hypocretin deficiency in narcolepsy produces severe nocturnal fragmentation (781 min of wake after sleep onset) and 35 sleep-onset rapid eye movement periods. DyssomniaNN provides an in silico platform for mechanistic sleep research and virtual neuropharmacology.
[LG-4] Designing Protein Structures from Natural Language
链接: https://arxiv.org/abs/2610.13917
作者: Joseph Lee,Yanjing Li,Bo Qiang,Gregory Lau,Allyson Ettinger,Noah A. Smith,Rory Donovan-Maiye,David Baker,Hanna Hajishirzi,Pang Wei Koh
类目: Machine Learning (cs.LG); Biomolecules (q-bio.BM)
*备注: 53 pages, 9 figures. Code, data, and model weights: this https URL
Abstract:A central challenge in de novo protein design is generating proteins with desired structural and functional properties. Existing design models typically require a dedicated input representation for each property, limiting the design objectives they support. We develop Prompteina, the first all-atom structure generation model that supports new and broader design objectives specified in natural language, analogous to text-to-image generation. To train Prompteina, we construct Prompteina-Data, a paired text–protein structure dataset of 1.8M structures and 50M+ captions describing global and residue-specific structural and functional properties. We adapt Proteina-Complexa, a pretrained structure generation model, through text-conditioned pretraining and finetuning that aligns residues with their corresponding text. Prompteina outperforms baselines on 15 of 18 structural properties and generates proteins that more closely match descriptions of their intended functions. In binder design, it leads baselines on at least 13 of 20 targets and improves interface confidence by 14% over the strongest baseline. With iterative in silico feedback, Prompteina’s gain over non-iterative generation is 57% larger than the next-best baseline on the hardest targets. Finally, we experimentally validate Prompteina designs against GM2A, a target with no reported de novo binders. We identify nine binders, with the strongest at an apparent K_\mathrmD of 107 nM. These results establish natural language as an effective and powerful conditioning interface for protein structure generation.
[LG-5] Prediction Is Not a Sufficient Memory State
链接: https://arxiv.org/abs/2610.13881
作者: Robert Jenkinson Alvarez
类目: Machine Learning (cs.LG)
*备注: 35 pages
Abstract:A memory that reproduces every current prediction may still have forgotten how to learn from the next observation. We characterize this distinction for exact cumulative learning and attention. For smooth convex residual losses with unrestricted real features and labels, a continuous recurrent state of fixed dimension exists exactly when the loss is polynomial. With ordinary, unweighted observations, degree D requires precisely r=\binomd+DD-1 coordinates; even among histories with one fixed current predictor, exactly r-d coordinates can remain necessary for continuation. Nonpolynomial losses have unbounded requirements on such equal-prediction histories. Bounded scalar logistic examples retain this obstruction after fixing any finite derivative jet. For ridge regression, the hidden evidence is the design matrix: the exact state costs dp+d(d+1)/2 , versus dp for the predictor. On a well-conditioned zero-prediction family, optimal B -bit compression has average one-update error of order d^-12^-2B/s_d , s_d=d(d+1)/2 , even with arbitrary randomized codes. Kernel attention gives a second exact closure classification. The results identify what future updates reveal, rather than proposing a new regression algorithm or asserting trained-model gains.
[LG-6] Partially Informed Stochastic Optimization via Zeroth-Order Residual Tracking
链接: https://arxiv.org/abs/2610.13871
作者: El Mahdi Chayti,Alireza Mirrokni,Martin Jaggi
类目: Machine Learning (cs.LG)
*备注:
Abstract:Many optimization problems provide direct access to only part of the gradient, while the remaining component must be inferred from function evaluations. This structure arises in performative prediction, performative reinforcement learning, and bilevel optimization with a black-box lower level. We introduce Partially Informed Stochastic Optimization (PISO), which combines the available gradient component with a running estimate of the residual. By centring each zeroth-order observation on this estimate, PISO makes the variance due to random probing depend on the tracking error rather than the residual’s magnitude. This yields a randomized sketch iteration with an explicit contraction mechanism and a principled interpretation of momentum. For smooth nonconvex objectives, we establish convergence guarantees that depend on the residual’s variation and initial magnitude, without requiring a uniform bound on the unavailable gradient component. With independently sampled function evaluations and Gaussian or spherical probes, PISO attains leading function-evaluation complexities of (O(d^2\varepsilon^-6)) under Lipschitz gradients and (O(d^2\varepsilon^-5)) under an additional Lipschitz-Hessian assumption. These rates require only one probe direction, two function samples, and one known-component sample per update. The analysis also quantifies how batching trades observations for fewer deployments. Across five settings, PISO variants improve on the tested baselines with comparable oracle access in three, reach a comparable solution faster in bilevel routing, and perform best among methods without response-model derivatives in performative reinforcement learning.
[LG-7] Inference-Time Steering Across Scaffolds and Epitopes for Sample-Efficient De Novo Nanobody Design
链接: https://arxiv.org/abs/2610.13844
作者: Mason Minot,Simon Friedensohn,Cédric R. Weber
类目: Machine Learning (cs.LG)
*备注:
Abstract:Generative molecular design typically relies on over-generation and post-hoc filtering. Inference-time steering methods like Feynman-Kac (FK) steering improve efficiency by biasing trajectories toward high-reward candidates, yet they optimize within a single fixed configuration. In de novo nanobody design, upfront commitment to conditioning choices like scaffold identity or target epitope creates a bottleneck. Since yield varies across these conditions, steering unpromising setups wastes compute. We recast generative condition selection as an inference-time resource-allocation problem. We propose two dynamic budget allocators: a joint Global Sequential Monte Carlo (SMC) formulation that steers and allocates compute across configurations concurrently, and a decoupled approach adapting Batched Successive Elimination (BaSE). Empirically, these dynamic allocators increase the yield of designable candidates per GPU-hour nearly 5 \times without sacrificing diversity across distinct therapeutic targets and generative configurations.
[LG-8] Returning to Development States: When Full Sandbox Snapshots Help Coding Agents
链接: https://arxiv.org/abs/2610.13841
作者: Daniel Thi Graviet,Tanmay Shah
类目: Machine Learning (cs.LG); Software Engineering (cs.SE)
*备注: 7 pages, 6 figures. Preprint. Not peer reviewed
Abstract:Coding agents often make useful progress before they fail, but retry-from-scratch discards the machine state created along the way. This makes failure recovery an interesting search problem: if intermediate environment states preserve meaningful progress, restoring and branching from them could outperform repeatedly restarting from the initial state. We implement Go-Explore-style search over full Daytona snapshots and find that higher and more efficient solve rates depend mainly on progress that sits outside the repository, such as databases, services, and other runtime state. Our results suggest that full-snapshot search is most effective when long-horizon coding work spans multiple services whose state cannot be reconstructed from a single diff.
[LG-9] Specialists Learn Faster: Knowledge Organization in Pre-training Shapes Knowledge Update Efficiency
链接: https://arxiv.org/abs/2610.13835
作者: Sheng Zhao,Yuhao Zhu
类目: Machine Learning (cs.LG)
*备注: 25 pages, 12 figures, 11 tables. Project page: this https URL
Abstract:An ideal (language) model must continually update its knowledge. Existing work largely focuses on making these updates efficient after training. We investigate how the organization of time-varying knowledge during pre-training shapes the efficiency of subsequent updates. Models trained on chronologically ordered knowledge specialize in the most recently encountered knowledge; we call them specialists. In contrast, models trained on the same knowledge in randomly shuffled order perform well across all represented time periods; we call them generalists. Surprisingly, specialists require far fewer update steps than generalists to acquire new knowledge. To explain this advantage, we derive a law from first principles that relates update cost to the model’s optimization dynamics and that closely predicts empirical results. Guided by these findings, we design a strategy for organizing pre-training data that preserves stable historical knowledge while enabling efficient updates to current knowledge. We also show that the benefits of temporal knowledge organization extend to real-world pre-trained models and existing knowledge update tools, and generalize to other knowledge orderings. Project page: this https URL
[LG-10] On the Design Space of Continuous Diffusion Language Models
链接: https://arxiv.org/abs/2610.13834
作者: Oscar Davis,Daan Roos,Alice Bizeul,Amitis Shidani,Victor Turrisi,Louis Béthune,Pierre Ablin,Marco Cuturi
类目: Machine Learning (cs.LG)
*备注:
Abstract:Continuous diffusion language models (CDLMs) promise to bring the benefits of continuous flow modelling to language, including accelerated sampling and controllable generation. The field has grown rapidly, and the capabilities of CDLMs have begun to rival those of discrete diffusion. Yet, unlike for continuous modalities such as images or videos, our grasp of the levers that matter when training CDLMs remains limited. In this work, we focus on two of these levers, namely self-conditioning and embedding geometry, and shed light on some of the mechanisms behind them, which in turn suggest cheaper and more effective designs. We begin by showing that self-conditioning corrects a train/inference mismatch by exposing the model to inference-like states that are otherwise rare during training. These gains can be recovered without an extra forward pass by a two-level interpolant, coined \mathrmDoubleCat , which improves TinyGSM accuracy more than threefold. Self-conditioning also aids in recognising tokens dominated by large-norm Gaussians \unicodex2013 an issue known as token identifiability. To address it directly, we introduce discrete reveals to \mathrmDoubleCat , yielding \mathrmSemiCat , which achieves discrete diffusion-level performance on TinyGSM, reaching 49.94% with standard training hyperparameters and a tuned sampler. At the 1.7 B scale, \mathrmSemiCat outperforms discrete diffusion on four of six likelihood-based evaluations, and surpasses one-hot flows on unconditional generation. On embedded spaces, we find that cross-entropy drives embeddings towards a geometry whose decoding error rate closely matches the one-hot one. We briefly explore a range of further options, such as hybrid corruption processes and noise schedules, including asynchronous ones. We believe this exploration can help the community better understand and advance the design space of CDLMs.
[LG-11] Shared Canonical Component Removal Beyond Expert Views
链接: https://arxiv.org/abs/2610.13819
作者: Jose Roberto Tello Ayala,Akl C. Fahed,Roy Perlis,Finale Doshi-Velez
类目: Machine Learning (cs.LG)
*备注:
Abstract:In clinical practice, experts often begin by converting raw inputs into a set of expert features before making a decision. While black-box models trained on raw input can outperform models trained on expert views, it remains unclear what predictive signal the raw model exploits beyond what the expert view captures. We introduce an audit framework to quantify this gap using Shared Canonical Component Removal (SCCR). Unlike standard residualization or concept erasure, SCCR selectively removes only those directions strongly shared between learned raw and expert embeddings. Evaluations on synthetic data, coronary artery disease (CAD) detection, antidepressant treatment dropout prediction, and skin lesion classification using SkinCon annotations show that SCCR identifies the ways in which expert views are insufficient and recovers residual predictive signal while minimizing redundancy with the expert view. Subjects: Machine Learning (cs.LG) Cite as: arXiv:2610.13819 [cs.LG] (or arXiv:2610.13819v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2610.13819 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-12] abMF: Learning Dataset Representations with Tabular Foundation Models
链接: https://arxiv.org/abs/2610.13818
作者: Rafiq Kamel,Nicolas Atienza,Aziz Fouché,Nicola Cancedda,Josif Grabocka
类目: Machine Learning (cs.LG)
*备注:
Abstract:Representations of supervised datasets support higher-level machine-learning tasks such as dataset retrieval and distribution-shift monitoring. However, existing approaches typically rely either on hand-crafted meta-features or on dataset encoders trained specifically for representation learning. We introduce TabMF, a framework that repurposes pretrained tabular foundation models (TFMs) as encoders of supervised datasets. TabMF equips a predictive TFM with an architecture-aware dataset-level readout and adapts the model end-to-end using contrastive post-training on stochastic views of synthetic supervised datasets. We instantiate TabMF on TabICLv2 and TabPFN-2.5 and evaluate the resulting representations across six tasks on unseen real datasets. Simple frozen TFM readouts yield competitive representations, indicating that predictive pretraining already induces substantial dataset-level structure. The two TabMF encoders obtain the strongest aggregate performance among the evaluated learned and classical dataset representations, with particularly strong results in dataset retrieval, compact benchmark construction, and distribution-shift severity assessment.
[LG-13] Randomized Momentum Transport with Cheap Predictors
链接: https://arxiv.org/abs/2610.13789
作者: El Mahdi Chayti,Martin Jaggi
类目: Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注:
Abstract:Momentum methods such as STORM and second-order momentum track the gradient by adding a transport correction to momentum, at the cost of an extra oracle call per iteration. We introduce randomized momentum transport, which evaluates the correction with probability q and otherwise uses a cheap prediction, with importance weighting that preserves the conditional mean and adds (q^-1-1) times the prediction loss to the variance. Under transport-bias, second-moment, and residual-control assumptions, linear minimization oracle (LMO) updates, including normalized, sign, and exact spectral (Muon) directions, retain an O(T^-1/3) stationarity bound for each fixed q0 with a single-gradient initialization. For unnormalized STORM, some q1 lowers the leading coefficient of our sufficient gradient budget if and only if the gradient-difference noise modulus exceeds the smoothness constant, by at most about 10% . An online diagonal predictor admits a regret-to-convergence guarantee. At approximately equal oracle cost, querying a quarter of the corrections lowers the final training loss by 18 to 43% on MNIST1D and raises the test accuracy of Hessian-vector transport on CIFAR-10 by 1.5 points.
[LG-14] Studying the Effects of Task Diversity Using Small Mathematical Worlds NEURIPS2026
链接: https://arxiv.org/abs/2610.13750
作者: Emily Xia Meng,Xuanyu Yang,Junaid Hasan,Michael Ruofan Zeng,Henry Kvinge
类目: Machine Learning (cs.LG)
*备注: 17 pages, 13 figures. Accepted for poster presentation at the NeurIPS 2026 MATH-AI Workshop
Abstract:Basic mathematical tasks like modular addition have been a valuable tool for illuminating aspects of neural network behavior that are challenging to see in noisy, unverifiable, large-scale, real-world settings. These studies have typically focused on a single task. However, modern language models are exposed to a vast number of tasks despite being trained with a next-token prediction objective. In this work, we introduce two mathematical task ecosystems, IntWorld and PermWorld, built from distinct but related tasks on integers and permutations. Both are designed to simulate task diversity within a cohesive mathematical ‘world’ where tasks are distinct but related. Because the datasets are procedurally generated, we can precisely vary the number of tasks, allowing us to begin to disentangle the role of task variety from other factors in training. After describing the datasets, we provide some initial results obtained from these datasets which support the idea that increasing task diversity increases the richness of a model’s internal representations.
[LG-15] SmolWAM: A Latent World-Action Model for Robotic Manipulation on Edge Devices NEURIPS2026
链接: https://arxiv.org/abs/2610.13740
作者: Timi Owolabi,Hikmah Olawore,Frances Adelakun,Ayotomiwa Oyewumi
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注: Accepted at the NeurIPS 2026 Robot Learning with World Models Workshop. Code: this https URL Project: this https URL
Abstract:World-action models (WAMs) predict a robot’s actions together with the observations those actions will produce. However, the strongest models rely on video diffusion transformers that are far too computationally expensive for resource-constrained edge devices. We present SmolWAM, a latent WAM that we derive from the 2B-parameter Cosmos Policy by keeping its pretrained trunk and rebuilding its inference interface: single-frame visual latents, cached text features that preserve the trunk’s attention sinks, 12 of 28 transformer blocks, and 1,008 tokens from which actions and future visual latents are read out in one rectified-flow step. Trained in 3.6 GPU-hours, SmolWAM succeeds in 95.5% of 400 LIBERO episodes at 57 ms and 2.3 TFLOP per 16-action chunk with 2.4 GiB of GPU memory, 11x faster than its teacher with 18.5x fewer FLOPs and 3.2x less memory, and its world head still forecasts scene motion.
[LG-16] SeoulMMOD: A Large-Scale Multimodal Origin-Destination Flow Benchmark
链接: https://arxiv.org/abs/2610.13730
作者: Taeyoung Yu,Seonbin Jo,Jiwon Kim,Junyoung Byun
类目: Machine Learning (cs.LG)
*备注:
Abstract:Origin-destination (OD) flow forecasting supports urban mobility decisions by predicting the volume and patterns of human movement across a city. Most existing public OD benchmarks provide only a partial view of citywide mobility, covering a single transport service or at most two modes. With partial mode coverage, observed demand changes are difficult to separate into shifts across transport modes and changes in total travel. We introduce SeoulMMOD, a large-scale public benchmark for citywide multimodal mobility in Seoul. SeoulMMOD provides three years of hourly OD flows estimating total mobility for 6 urban travel modes across 25 districts and 426 sub-districts, together with travel-time, travel-distance, calendar, rainfall, and point-of-interest (POI) signals. Using SeoulMMOD, we benchmark 14 forecasting baselines under a common protocol and analyse the effects of spatial scaling, joint versus mode-separate training, and cross-year generalization. Results show that several spatio-temporal models that work at district level do not scale to sub-district OD forecasting, and that naive joint multi-mode training does not consistently improve accuracy. Together, the dataset and benchmark establish a reproducible testbed for multi-mode, multi-year OD forecasting at the city scale.
[LG-17] Machine Unlearning for Federated Socially Fair k-Means Clustering
链接: https://arxiv.org/abs/2610.13717
作者: Aravind Reddy,Deeraj S K,Mohd Wasif Raza,Saurav Prakash
类目: Machine Learning (cs.LG); Data Structures and Algorithms (cs.DS)
*备注: 53 pages, 7 figures, including appendices. The first three authors contributed equally. Supplementary code, data and scoped Lean proofs (v1.0.0): this https URL
Abstract:Federated clustering can support applications such as patient stratification across hospitals and customer segmentation across distributed financial datasets. Responsible AI calls for fair representation of demographic groups and support for data deletion, motivated in part by rights such as the GDPR’s right to erasure. These goals interact: deleting records can change the balance between groups and alter the clustering of the remaining population. We study exact machine unlearning for federated socially fair k -means, whose objective is to minimize the largest group-average squared distance to the nearest center. Our approach keeps separate local summaries for each group, so summaries at unaffected institutions remain valid as global fairness weights change. For two groups, we prove an initialization approximation guarantee independent of client group proportions under ideal sampling, and we show that same-seed replay reproduces retraining exactly. Reuse pays off most when a whole client withdraws: across three datasets, replay is 35.8\times faster than retraining for the initialization-only model and remains 2.4\times and 1.7\times faster with one and two fair-refinement rounds, which improve worst-group cost. For individual record deletions, gains are modest (about 1.06\times ), and certifying cached assignments can cost more than it saves. These results map where exact unlearning can profitably reuse computation. Code and reproducibility materials are available at this https URL.
[LG-18] owards Understanding the Training of GFlowNets: A Theoretical Perspective
链接: https://arxiv.org/abs/2610.13711
作者: Rui Hu,Yu Chen,Zhuoran Li,Longbo Huang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Generative Flow Networks (GFlowNets) learn policies that sample discrete objects in proportion to a positive reward. They are trained by minimizing balance objectives, whose exact satisfaction guarantees correct sampling. However, a comprehensive theory linking nonzero balance loss and approximate stationarity to sampling accuracy, especially under evolving sampling distributions and backward policies, is still lacking. To bridge this gap, we develop a unified theory for Flow Matching, Detailed Balance, and Trajectory Balance in this regime. We first bound terminal symmetric KL by the square root of the expected balance loss. Then, we show that approximate stationarity controls this distribution error up to a tangent-space residual measuring parameterization incompleteness. Finally, we establish finite-time convergence under fixed or controlled sampling and fixed, balance-trained, or separately updated backward policies. Under standard smoothness assumptions, with fixed or controlled sampling and a fixed or balance-trained backward policy, the expected loss is O(\bar\epsilon^2+T^-1) and expected terminal symmetric KL is O(\bar\epsilon+T^-1/2) under uniform coverage. For a separately updated backward policy, we characterize the sufficient update decay to approach the residual neighborhood and preserve these rates. These results connect balance objectives to sampling accuracy and clarify how parameterization, coverage, and moving components govern GFlowNet training.
[LG-19] ransformer-based In-Context Score Operator Learning for Diffusion Models
链接: https://arxiv.org/abs/2610.13690
作者: Wuzhe Xu,Zhaiming Shen,Yulong Lu,Wenjing Liao,Rongjie Lai
类目: Machine Learning (cs.LG)
*备注:
Abstract:Diffusion models typically learn the generative dynamics of a single target distribution or a family of distributions indexed by conditioning variables fixed during training. This limits their ability to adapt to a previously unseen distribution from only a small set of examples. We introduce an in-context solution operator learning framework for diffusion models, in which each target distribution is treated as a task drawn from a meta-distribution and is specified at inference time by an empirical context set. Our method learns an in-context score operator that maps the context samples, a noisy query point, and the diffusion time to the task-dependent score, enabling reverse-diffusion sampling on unseen tasks without retraining or parameter updates. A key observation is that the task-dependent score admits a Gaussian-kernel conditional-mean representation. Its empirical Nadaraya–Watson approximation can be represented exactly by a model in our constructed transformer class, providing a principled foundation for the proposed query-dependent attention architecture. The operator is trained through amortized denoising score matching across task distributions. We establish generalization-error bounds that quantify the effects of the context size, the numbers of training tasks and within-task samples, model complexity, and intrinsic and ambient dimensions. Numerically, we evaluate the method on a range of scientific and visual datasets, including Navier-Stokes, ERA5 climate data, QuickDraw sketches, and Food-101. The results show that the proposed method performs well on relatively simple task families, while its performance degrades as task complexity increases, thereby illustrating both the promise and the limitations of in-context learning for diffusion models.
[LG-20] VQIL: Visible Quantum Interference Learning for Perturbation Response Ranking on Graphs
链接: https://arxiv.org/abs/2610.13689
作者: Seokjun Lee,Sergio A. Ortega,Daniel K. Park,Namshik Han
类目: Machine Learning (cs.LG)
*备注: 25 pages, 6 figures, 10 tables
Abstract:Learning how local perturbations affect a network is important for identifying which components drive or absorb a system’s response. We formulate this as seed-conditioned response ranking: given a perturbation at one seed node, ranking all other nodes by response strength. This is challenging when the model is given only the interaction topology, while the mechanism governing how perturbations propagate must be learned from data. We present VQIL (Visible Quantum Interference Learning), a trainable Szegedy quantum walk for seed-conditioned ranking. Edge weights, link phases, and per-node phase rotations are optimized end-to-end by backpropagation while the walk operator remains unitary throughout training. Node scores are obtained from a geometrically discounted coherent sum of quantum-walk amplitudes, enabling quantum interference before the final squared-norm readout. Because each learned parameter is attached to a named edge or node, the trained model provides directly inspectable hypotheses about the roles of individual graph components in the propagation mechanism. On AC power-flow perturbations over six transmission grids, with electrical parameters withheld from the model, VQIL improves Spearman rank correlation from 0.147 for the untrained walk to 0.831 and outperforms an identically trained random-walk model. On gene perturbation over five protein-protein interaction networks with Perturb-seq supervision, VQIL improves rank correlation from 0.171 to 0.620, outperforming the strongest learned classical and neural baselines. These results show that trainable quantum-walk interference provides a scalable and interpretable inductive bias for learning seed-conditioned response rankings on graphs.
[LG-21] On the Encoding of Calendar Features in Covariate-Informed Time Series Foundation Models
链接: https://arxiv.org/abs/2610.13676
作者: Alexander Kreusel,Maximilian Beichter,Alexandra Nikoltchovska,Benjamin Schäfer,Ralf Mikut,Frederik Zahn,Veit Hagenmeyer
类目: Machine Learning (cs.LG)
*备注:
Abstract:Time series foundation models (TSFMs) increasingly offer covariate support, with calendar information being the most common type of categorical covariate in practice, as it is available for every point in time. However, how these features are encoded is largely treated as an implementation detail rather than as an object of study, despite encoding being one of the few design choices left for pretrained models at inference time. With the present study, we demonstrate that the way information is propagated into the model substantially affects forecast accuracy of TSFMs. Therefore, we systematically compare seven calendar encodings, including three conventional target-agnostic representations (ordinal, one-hot, and cyclic) and four target encodings, across four state-of-the-art TSFMs on nine datasets from multiple domains in a zero-shot rolling evaluation. The nine datasets are influenced by social activities, such as weekends and holidays, making calendar information particularly relevant for forecasting. We find that encoding choice affects forecast accuracy across all models, with MASE differences of up to 9.9 % on non-holidays and 83 % on holidays within a single model. Effectiveness and utilization vary substantially across models. Improvements are concentrated around holidays, where calendar information provides signals unavailable from target history, while some model encoding combinations also improve non-holiday forecasts. A SHAP-based attribution analysis locates the contribution of the covariates relative to the autoregressive component and explains why some model-encoding combinations degrade performance. Our findings suggest that current benchmarks for covariate-informed TSFMs can distort model comparisons by imposing fixed encoding strategies.
[LG-22] abReliBench: Evaluating Tabular Foundation Models Beyond Predictive Accuracy
链接: https://arxiv.org/abs/2610.13654
作者: Tianqi Zhao,Jia Guo,Yan Shuo Tan,Qiong Zhang
类目: Machine Learning (cs.LG)
*备注: 53 pages, including supplementary materials. Code: this https URL
Abstract:Tabular foundation models (TFMs) are increasingly popular for their strong predictive performance. Many also provide posterior predictive distributions (PPDs), whose reliability remains less studied. We assess reliability through point prediction, distributional quality, marginal and subgroup calibration, and interval efficiency. We then introduce TabReliBench, a large classification and regression benchmark for these comparisons and dataset-level analyses. We find that TFMs’ rankings change between TabArena and our benchmark and across reliability metrics. Regression TFMs usually achieve near-nominal marginal coverage and retain narrow intervals, but this favorable marginal behavior does not imply valid conditional coverage. Dataset-level analyses show that classification difficulty often accompanies poor calibration, whereas regression predictive performance is not a reliable indicator of calibration. Ensembling improves predictive performance but does not consistently improve calibration of PPDs; TFMs also benefit little from conformal post-processing, which does not reliably resolve subgroup gaps. Reliable TFM selection therefore requires multidimensional evaluation beyond aggregate rankings. Code is available at this https URL.
[LG-23] PANDA: Prior-guided Attentional Dual-path Architecture NEURIPS2026
链接: https://arxiv.org/abs/2610.13635
作者: Rishabh Jain,Federico Belotti,Stefano Coniglio,Pietro Lio,Stefano Fiorini
类目: Machine Learning (cs.LG)
*备注: Accepted at NeurIPS 2026
Abstract:Hypergraph Neural Networks (HNNs), designed to model higher-order relations beyond pairwise interactions, typically rely either on fixed structural weights or on normalised attention. Fixed weights can propagate misleading information in heterophilic settings, while normalisation makes attention coefficients competitive, in the sense that, in a message-passing framework, increasing the weight of one sender must reduce the weight of others in the same aggregation set. Our main contribution is the introduction of PANDA (Prior-guided AttentioNal Dual-path Architecture), a plug-in for two-stage message passing HNNs applicable to both undirected and directed settings. The main path interpolates between learned receiver-normalised attention and structural incidence priors, while a non-competitive (not normalised) auxiliary path lets each sender contribute its own transformed information. We also show that, with fixed structural coefficients, PANDA recovers a certain complex-valued convolution operator adopted in previous works. Across four HNNs spanning spatial and spectral methods in both directed and undirected settings, plugging PANDA in yields an average improvement of 5.18 percentage points across eight real-world benchmark datasets. The code is available at this https URL.
[LG-24] Private and Distributionally Robust Federated Multiclass Classification
链接: https://arxiv.org/abs/2610.13631
作者: Andrea P. Hernandez,Michael Ibrahim,Nagi Gebraeel
类目: Machine Learning (cs.LG); Optimization and Control (math.OC)
*备注:
Abstract:Fault diagnosis in asset-intensive industries requires multiclass models trained on noisy, sensitive data collected across geographically distributed client sites. Federated learning enables collaborative training without centralizing data, but most approaches do not provide formal privacy guarantees for individual records stored at client sites and can degrade under label noise. To address these limitations, we develop a differentially private, distributionally robust framework for federated multiclass classification that provides sample-level privacy for records stored at each client. We build on a federated Wasserstein distributionally robust multiclass objective with the Crammer-Singer loss, solved using an Alternating Direction Method of Multipliers (ADMM)-based algorithm. To protect the released client updates, our method injects calibrated Gaussian noise into the proximal linearized client updates of both the local model and the local distributionally robust variable before aggregation at the central server, and we quantify the cumulative privacy loss using the moments accountant. We provide per-round sample-level (\epsilon,\delta) -differential privacy guarantees and an overall composed privacy guarantee across all training rounds, together with convergence results and an explicit privacy-utility tradeoff. Experiments on simulated industrial fault data and UCI benchmark datasets show that our method outperforms differentially private federated empirical risk minimization and stochastic gradient descent baselines in most tested settings, with the largest gains under strong privacy-induced noise.
[LG-25] A small cognitive core explains human behavior at scale
链接: https://arxiv.org/abs/2610.13603
作者: Marcel Binz,Eric Schulz
类目: Machine Learning (cs.LG)
*备注:
Abstract:Psychology has proposed many principles of cognition. Each, however, was developed in isolation, leaving their combined explanatory power unknown. We assembled a small set of established principles into one model, which we call COntextual Retrieval and Encoding (CORE). CORE consists of a hierarchy of episodic memories into which prediction errors are written and whose encoding, retrieval, and forgetting depend on context. Fitted jointly to 7,036,442 choices from 137 experiments, the model predicts human choices better than black-box models and reproduces 75% of reported behavioral effects when simulated. Moreover, its latent variables show classic signatures of Bayesian learning and event segmentation. Taken together, these findings suggest that a small cognitive core accounts for much of human behavior. They also open a path toward making psychology more than the sum of its parts, by building computational models on the entire experimental record.
[LG-26] EchoTab: Learning Measurement-Grounded Representations for Echocardiographic Diagnosis through Tabular Reconstruction
链接: https://arxiv.org/abs/2610.13599
作者: Michelle Espranita Liman,Ioana Ionac,Alexander Müller,Eimo Martens,Daniel Rueckert,Philip Müller
类目: Machine Learning (cs.LG)
*备注:
Abstract:Diagnostic information in multi-view medical imaging studies, like echocardiography, is distributed across views, each capturing different aspects of cardiac structure and function. In clinical practice, these views are first interpreted through quantitative measurements, which then support specific diagnoses. However, existing echo representation learning methods do not explicitly model measurements as an intermediate representation between views and diagnosis. As a result, individual measurements are not explicitly represented in a form that downstream diagnostic tasks can selectively use, hindering accurate diagnosis. Inspired by this hierarchical clinical workflow, we introduce EchoTab, a measurement-grounded representation learning framework that represents multi-view echocardiography studies using measurement-specific tokens as an intermediate representation between echo views and diagnosis. Each measurement token selectively attends to the views relevant to its estimation and is trained through tabular reconstruction to predict the corresponding measurement value. The resulting tokens form a factorized echo representation, which encode clinically meaningful structural and functional properties and can be selectively used for downstream diagnosis. Unlike the commonly used contrastive approaches, EchoTab does not require negative samples or large batch sizes. Experiments on two datasets demonstrate that EchoTab learns effective measurement-grounded representations that improve diagnosis classification in multi-view echocardiography and its learned attention aligns with established measurement-view relationships used by cardiologists. Our code is accessible at this https URL. Subjects: Machine Learning (cs.LG) Cite as: arXiv:2610.13599 [cs.LG] (or arXiv:2610.13599v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2610.13599 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-27] L_0 Feature Selection via Monte Carlo Tree Search in High-Dimensional Financial Regression
链接: https://arxiv.org/abs/2610.13574
作者: Cameron Mouangue,Tristan Cazenave
类目: Machine Learning (cs.LG); Computational Finance (q-fin.CP); Statistical Finance (q-fin.ST)
*备注: Accepted at the 7th ACM International Conference on AI in Finance (ICAIF '26). 8 pages, 2 figures
Abstract:Feature selection is a central problem in high-dimensional financial regression, where large numbers of engineered variables and strong correlations among predictors reduce model stability and interpretability. L_1 regularization (Lasso) is widely used for sparse regression, but its shrinkage can be restrictive when informative signals are spread across correlated variables. Exact sparse regression avoids this shrinkage but requires solving a combinatorial optimization problem that is computationally difficult and is typically fit to minimize in-sample rather than out-of-sample error. This paper presents a feature selection framework based on Monte Carlo Tree Search with Generalized Nested Rollout Policy Adaptation (GNRPA). Feature selection is formulated as a sequential decision process, and candidate subsets are scored by their out-of-sample validation performance rather than training error. The method also supports a lexicographic objective accounting for subset size and multicollinearity. We study this approach on a contemporaneous explanatory regression task: explaining the weekly return of the NASDAQ-100 index from 1,072 engineered features spanning market, macroeconomic, and factor data. This isolates the value of subset selection under multicollinearity from the separate problem of predictive forecasting. On this task, the proposed method identifies sparse feature subsets with higher out-of-sample explanatory power than an optimized Lasso baseline, reaching an out-of-sample R^2 of 0.6961 versus 0.6313 for Lasso. These results suggest that Monte Carlo Tree Search is a practical alternative to convex regularization for sparse explanatory feature selection in financial regression, with potential value for factor attribution and risk decomposition where transparency matters as much as out-of-sample fit.
[LG-28] Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment
链接: https://arxiv.org/abs/2610.13571
作者: Tsubasa Harada,Yasushi Kawase,Hanna Sumita
类目: Machine Learning (cs.LG); Data Structures and Algorithms (cs.DS)
*备注: 20 pages
Abstract:We study simultaneous competitive and regret guarantees for TCP acknowledgment. Each acknowledgment serves all pending packets, and the objective is to minimize the total acknowledgment and waiting costs. It is well known that no deterministic online algorithm achieves a competitive ratio better than 2 . Given k randomized online experts and 0\varepsilon1 , we construct a randomized online algorithm whose realized total cost is always at most (2+\varepsilon) times the offline optimal cost \mathrmOPT and whose expected regret against the expert with the smallest realized cost is O(\sqrt\mathrmOPT\log(k+1)+\log(1/\varepsilon)) . The algorithm requires no advance knowledge of the number of packets or \mathrmOPT . Our algorithm controls switching costs between experts and uses the gap between the permitted competitive bound and its current cost to determine when to learn. We also prove lower bounds showing that, for k\ge 2 , this regret bound is asymptotically optimal in \mathrmOPT , k , and \varepsilon , and that \varepsilon0 is necessary for sublinear regret.
[LG-29] Rationally Linearized MLPs
链接: https://arxiv.org/abs/2610.13568
作者: Arijit Sehanobish,Byeongchan Kim,Avinava Dubey,Min-hwan Oh,Krzysztof Choromanski
类目: Machine Learning (cs.LG)
*备注: Preprint. Comments welcome
Abstract:We present Rationally Linearized Multilayer Perceptrons(RaLiMPs), a new approach to efficiently linearizing MLPs using low-degree rational approximations of standard activation functions. Inspired by polynomial-based MLP linearization, we show that rational approximations can provide accurate representations at substantially lower degree. RaLiMPs exploit these approximations to construct kernel representations with narrow bottlenecks, enabling efficient composition across MLP layers. We provide theoretical guarantees for the resulting approximation and evaluate RaLiMPs across applications ranging from implicit 3D models to large language models. Our experiments demonstrate favorable accuracy–efficiency tradeoffs, with RaLiMPs achieving competitive or improved accuracy while substantially reducing inference cost.
[LG-30] Probabilistic Ship Trajectory Forecasting using Transformer Models on AIS Data
链接: https://arxiv.org/abs/2610.13557
作者: Frederik E. T. Schöller
类目: Machine Learning (cs.LG); Robotics (cs.RO)
*备注: Manuscript written in 2021. 16 pages, 5 figures, 5 tables
Abstract:Anticipation of vessel trajectories is an essential task when navigating at sea. This applies to both human navigators and autonomous surface vessels. Trajectory forecasting enables sub-routines such as collision avoidance to assess the situation and react accordingly in time. This paper investigates Transformer and Performer models for trajectory prediction of surface vessels in confined waters. Using widely available position data from the Automatic Identification System (AIS), candidate models are trained and evaluated. Historical information on how other vessels have moved in the local area surrounding each agent is conveyed using positional heat maps. The heat maps are generated using Kernel Density Estimation (KDE) and encoded with a Convolutional Neural Network (CNN) before entering the Transformer models. The models are trained with quantile loss to efficiently obtain a model-aware prediction interval, as this is crucial for timely collision avoidance. The proposed model architectures are shown to greatly outperform previous work while the inclusion of local heat maps enables the prediction of vessel movement that is not otherwise indicated from the previous positions.
[LG-31] Simulating Training Spikes of Deep Neural Networks by Layer-wise Random Feature Models
链接: https://arxiv.org/abs/2610.13524
作者: Ran Tian,Courtney Paquette
类目: Machine Learning (cs.LG)
*备注:
Abstract:Intermittent ``spikes’’ in loss, during the pre-training of Large Language Models (LLMs), remains a mysterious phenomenon both theoretically and empirically. In this paper, we show that simple quadratic models with heavy-tailed, power-law distributed inputs can replicate these spikes. We introduce a theoretical framework and simulation algorithm to model per-layer training dynamics of Deep Neural Networks (DNNs), using such quadratic models. In a case study on an Adam hyperparameter configuration (where \beta_2 is set close to 1 ) known to induce spikes in Transformer LMs, our simulation successfully predicts bumps indicating spiky behavior from a given checkpoint. Furthermore, we derive an appropriate \beta_2 schedule from observed metrics, which empirically improves performance.
[LG-32] FedPCD: Priority-Constrained Federated Aggregation
链接: https://arxiv.org/abs/2610.13508
作者: Yousef Irshaid,Dara Varam,Mohamed I. AlHajri
类目: Machine Learning (cs.LG)
*备注: 30 pages, 17 figures, 5 tables
Abstract:Federated learning (FL) seeks to optimize a shared global model from decentralized client data. While effective for average performance, this process can produce unfair performance across clients, particularly under statistically heterogeneous data distributions. Existing fairness-aware and multi-objective FL methods address this through client re-weighting, gradient correction, or common-descent formulations, but often change the global optimization direction or treat client objectives symmetrically. We propose FedPCD, a priority-constrained federated optimization framework that separates the global optimization objective from client protection. FedPCD preserves the conventional federated aggregate as the primary objective, while allowing only the minimum correction necessary to meet client performance constraints. Across heterogeneous FL benchmarks, FedPCD consistently outperforms state-of-the-art baselines, achieving the highest global accuracy across all configurations and leading worst-10% client accuracy in nearly all. FedPCD further preserves competitive trade-offs between global accuracy and client performance variability. Beyond this trade-off, FedPCD demonstrates faster empirical convergence, reaching matching or superior performance in substantially fewer communication rounds.
[LG-33] PPG-Bench: A Unified Benchmark for PPG Foundation Models
链接: https://arxiv.org/abs/2610.13435
作者: Arvasu Kulkarni,Mahir Jain,Aditya Ray Mishra,Sandeep Singh,Siddharth Panwar
类目: Machine Learning (cs.LG)
*备注:
Abstract:Photoplethysmography (PPG) is increasingly recorded by wearable and clinical devices at enormous scale, and a growing number of PPG foundation models (FMs) have been developed to compute reusable representations for various downstream tasks. These models are difficult to compare: different evaluations use different datasets, task definitions, preprocessing, downstream heads, hyperparameter tuning, and baselines. We present PPG-Bench, a unifying open-source benchmark evaluating five public PPG FMs across nine open-access datasets and 26 tasks spanning cardiovascular state estimation, activity, sleep, screening, and identification. We evaluate models under four downstream regimes of increasing adaptability (linear probing, random forests, frozen MLP probes, and end-to-end finetuning), with model-specific hyperparameter optimization and subject-disjoint cross-validation. We also evaluate against three controls: random/constant baseline, a deterministic pulse-rate-variability (PRV) feature set, and a generic time-series FM (MOMENT). Across all 68 task-regime combinations, 35.3% show no meaningful FM advantage over the random/constant baseline, and in 83.8% no PPG-specific FM outperforms both PRV and MOMENT. We also find that added downstream head capacity generally improves performance, but can cause significant degradation if the model is performing at chance/constant level. Current PPG FMs therefore cannot yet claim to provide generalised and transferrable representations of PPG signals, and future evaluation in this field should include checks against simple, non-learned controls. Code for the benchmark and instructions to evaluate more models can be found here - this https URL.
[LG-34] Accelerating Linear Bandits with Persistent Candidate Sets
链接: https://arxiv.org/abs/2610.13407
作者: Bingkui Tong,Daria Korovaitceva,Marina Sheshukova,Sergey Samsonov,Junpei Komiyama
类目: Machine Learning (cs.LG)
*备注:
Abstract:Exhaustive optimistic scoring can make action selection costly in linear bandits with a large fixed set of K actions, requiring \mathcalO(K) score evaluations per round. We introduce Persistent Candidate LinUCB (\textscPC-LinUCB), which maintains k active actions and samples q challengers uniformly from the remaining K-k actions at each round. By scoring only these k+q candidates, \textscPC-LinUCB reduces the number of score evaluations per round to \mathcalO(k+q) . We establish problem-independent and problem-dependent high-probability regret bounds consisting of a standard linear-bandit learning term and an additive discovery cost of order \mathcalO\left((K-k)\log(K-k)/q\right) at fixed confidence. Notably, this additional cost does not grow with the horizon. For fixed gaps and sufficiently long horizons, we establish an \Omega\left((K-k)/q\right) regret lower bound under uniform challenger sampling, showing that partial candidate access itself imposes an unavoidable regret cost. Experiments show that \textscPC-LinUCB substantially accelerates LinUCB while maintaining comparable regret, and that the persistent candidate mechanism can extend beyond LinUCB.
[LG-35] Why Linear Models Can Still Work in a Complex and Changing World
链接: https://arxiv.org/abs/2610.13404
作者: Fangzhou Lin,Dengzhe Hou,Yinxing Li,Kazunori D Yamada
类目: Machine Learning (cs.LG)
*备注:
Abstract:Linear models can predict well in complex domains even when underlying mechanisms are nonlinear. We argue that this can occur because the complexity of the world exceeds the complexity that can be learned reliably from finite, partially observed data. Flexible models can exploit curvature, thresholds, and interactions that fit one hospital, period, population, policy setting, or measurement process but fail elsewhere. When this instability lies mainly in the nonlinear component, omitting it can give linear models lower prediction error in a new environment. We connect this claim to work on simple linear rules, bias and variance, regularization, best linear prediction, measurement error, distribution shift, invariance, Rashomon sets, and underspecification. Proposition 1 gives a simple squared-error case in which a nonlinear rule learned in the training environment raises target error because it transfers too weakly; finite-sample estimation error can strengthen this result. Partial observation alone is not enough: the link between observed variables and unobserved factors must vary across environments. Stable nonlinear structure favors flexible models, and linear models remain vulnerable to linear spurious relationships. Model complexity should therefore be chosen by cross-environment stability as well as training-data accuracy.
[LG-36] PlacePulse: Learning Transferable Place Representations from Structural Geographic Data
链接: https://arxiv.org/abs/2610.13390
作者: Lucía García-Duarte,Miguel Álvarez,Diego Vicente,Javier Pérez Trufero,Javier de la Torre
类目: Machine Learning (cs.LG)
*备注: 42 pages, 11 figures, 12 tables
Abstract:Geospatial machine learning often depends on task-specific feature engineering over large collections of sociodemographic, business, and environmental variables. Geospatial foundation models offer reusable representations of place, but leading approaches typically encode dynamic signals, such as mobility and search activity, or visual signals from satellite imagery. Few models represent the static structural composition of places (who lives and works there, which businesses operate there, and which risks they face) as transferable embeddings at fine spatial resolution. We introduce PlacePulse, a structural geospatial foundation model that compresses 572 attributes, expanded to 2,288 inputs through H3 neighborhood aggregates, into 256-dimensional unit-norm embeddings for 1,055,537 H3 resolution-7 cells in the United States. We also introduce a reusable two-axis benchmark that separates intrinsic representation quality from downstream predictive utility across multiple targets and spatial supports. Intrinsically, the embeddings reconstruct standardized inputs with mean R^2 = 0.853 , use 251 of 256 approximately decorrelated dimensions, and show strong spatial organization, with Moran’s I = 0.93 on the leading principal component and autocorrelation persisting beyond the input radius. Extrinsically, across 74 held-out targets from 12 external sources and four spatial supports, PlacePulse outperforms a dimensionality-matched feature-selection baseline on targets unrelated to the training inputs and is competitive with Google’s Population Dynamics Foundation Model, leading on health, economic, election, economic-mobility and social-vulnerability outcomes, with relative strengths that vary by domain. These findings position structural composition as a distinct and complementary modality for geospatial foundation models, not simply a fallback where behavioral or imagery data are unavailable.
[LG-37] BLOKS: Scaling Kernel Solvers with Sketched Block Preconditioning
链接: https://arxiv.org/abs/2610.13382
作者: Giordano Vitale,Giacomo Meanti,Marco Rando,Blanca Ayuso de Dios,Lorenzo Rosasco
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注: 29 pages, 7 figures, 9 tables
Abstract:Kernel Ridge Regression (KRR) is a theoretically sound algorithm for nonparametric learning, which is also often used to investigate properties of deep learning. However, the exact KRR formulation incurs time and memory costs preventing applicability to large datasets, motivating the development of approximate solvers. These algorithms rely on (i) iterative methods, to avoid the computational burden of direct solutions; (ii) sketching or batching, to reduce the problem size; and (iii) preconditioning, to accelerate convergence. While crucial for fast convergence, preconditioning incurs memory costs that can be managed by lowering the number of free parameters of the model, potentially at the expense of expressivity and hence accuracy. To address this challenge, we propose BLOKS, a Conjugate Gradient-based solver for Nyström-sketched KRR built around a novel preconditioner that combines a block Jacobi approximation with sketching. The BLOKS preconditioner has memory cost independent of both the dataset size and the number of parameters, allowing scaling to large models. We provide a memory-efficient, GPU-accelerated implementation and show that BLOKS achieves excellent accuracy while retaining favorable time/memory complexity. Indeed, on standard large-scale datasets used to benchmark kernel solvers, BLOKS achieves comparable or better performances than state-of-the-art methods.
[LG-38] Opening the Black Box of Classifier-Free Guidance via Information Bottleneck NEURIPS2026
链接: https://arxiv.org/abs/2610.13369
作者: Jiayang Gao,Tianyi Zheng,Jiayang Zou,Fengxiang Yang,Luyao Fan,Lv Tang,Bo Li,Jia Wang
类目: Machine Learning (cs.LG)
*备注: Accepted to NeurIPS 2026
Abstract:Classifier-free guidance (CFG) is a standard technique for improving conditional generation in diffusion models, yet its activation schedule is usually selected heuristically. In practice, most existing CFG-based methods rely on a pre-defined activation policy throughout inference, while recent dynamic variants often depend on hand-designed schedules without a principled theoretical explanation of when conditional information is most useful. In order to understand how the informational relevance between conditioning inputs and the score function evolves over the course of generation, we explore when guidance should be activated from an information-theoretic perspective. In this work, we formulate the diffusion trajectory as a time-dependent information bottleneck and show that the effectiveness of conditional information is not uniform throughout sampling, but becomes significantly stronger after a critical stage characterized by a Fisher-information balance condition. Motivated by this insight, we propose a training-free dynamic CFG strategy for inference. Rather than prescribing a fixed schedule in advance, our method constructs a stochastic process from conditional and unconditional score statistics and activates guidance when the estimated guidance gain crosses a prescribed threshold. This yields an adaptive activation rule that aligns condition injection with the underlying generation dynamics, while also recovering interval-based guidance as a limiting special case. Extensive experiments across diverse architectures and tasks, demonstrate that our method is effective, robust, and broadly applicable. Beyond empirical improvements, our framework provides an interpretation of dynamic guidance methods and a principled foundation for inference-time control in conditional diffusion models.
[LG-39] EmoGavel: Grounding-Aware Reinforcement Learning with Verifiable Rewards for Multimodal Emotion Preference Learning
链接: https://arxiv.org/abs/2610.13353
作者: Zilong Huang,Kong Aik Lee,Zezhong Jin,Man-Wai Mak,Tatsuya Kawahara
类目: Multimedia (cs.MM); Machine Learning (cs.LG); Audio and Speech Processing (eess.AS)
*备注:
Abstract:Multimodal emotion preference learning uses pairwise comparisons to identify which open-ended emotion descriptions align more closely with human judgments. However, existing methods primarily focus on the final preference decision and provide little explicit supervision for localizing and correcting erroneous content. To address this limitation, we propose EmoGavel, a Grounding-Aware reinforcement learning framework with Verifiable rewards for multimodal Emotion preference Learning. We first introduce grounded supervised fine-tuning (Grounded SFT), which exploits controlled-error construction information to jointly learn preference prediction, error localization, repair, and missing-evidence recovery. We then optimize these verifiable outcomes with grounding-aware group relative policy optimization (GA-GRPO), combining preference-gated grounding rewards with dynamic zero-variance rescue to prioritize preference correctness and recover learning signals from all-wrong groups. Experiments on EmoPrefer and controlled-error evaluation sets show that EmoGavel improves both natural preference prediction and controlled-error discrimination while maintaining strong error-grounding performance. Our code and model checkpoints will be released once the paper is accepted.
[LG-40] Hidden Data Challenges in Clinical Machine Learning
链接: https://arxiv.org/abs/2610.13350
作者: Carolin Cissée,Dennis Fast,Raneen Younis,Alexander Löser,Wolfgang Nejdl,Zahra Ahmadi
类目: Machine Learning (cs.LG)
*备注:
Abstract:Widely reused preprocessing pipelines for electronic health records can encode assumptions about when information became available, what clinical episode a label represents, and what missingness means. These assumptions are rarely audited systematically and may propagate across subsequent studies when preprocessing pipelines are reused or adapted. Using MIMIC-IV as a case study, we identify and quantify violations of three complementary forms of preprocessing alignment, i.e., temporal, semantic, and population alignment, which manifest as temporal leakage, feature-task misalignment, and biased imputation. We show how ambiguities in timestamp semantics, episode definitions, endpoint construction, modality selection, and missingness handling can alter the information available to a model and affect the interpretation of its predictions. Through analyses of MIMIC-IV data and empirical case studies, we demonstrate that such choices may remain largely invisible in aggregate predictive performance while changing the signals on which models rely. We derive practical recommendations for temporally valid, clinically aligned, and reproducible preprocessing of MIMIC-IV and related electronic health record datasets. The code for our experiments, including our proposed preprocessing, is available at: this https URL.
[LG-41] Understanding Mamba-3 Through Oscillatory Dynamics
链接: https://arxiv.org/abs/2610.13341
作者: Shutian Liang,Yue Song
类目: Machine Learning (cs.LG)
*备注:
Abstract:Mamba-3 introduces input-dependent rotations into recurrent state updates, but their contribution beyond state retention remains unclear. We interpret these ro- tations as underdamped second-order dynamics, providing a framework for in- vestigating the role of oscillation in sequence modeling. Controlled comparisons show that underdamped dynamics outperform non-oscillatory damping regimes on state-tracking tasks, while language-model pretraining demonstrates benefits for long-context prediction and length generalization. Interventions in pretrained models further establish the importance of learned phase, and state analysis sug- gests that rotation regulates how retained information combines with incoming up- dates. Taken together, these findings identify underdamped dynamics as a useful mechanism for recurrent computation and suggest that oscillation supports long- context processing by regulating how information accumulates.
[LG-42] Agent Tune: A Unified Training Lifecycle for Tool-Using LLM Agents
链接: https://arxiv.org/abs/2610.13335
作者: R E Zera Marveen Lyngkhoi,Abhivansh Gupta,Vidushee Vats,Ram Mohan Rao Kadiyala,Vinay Kumar Sankarapu,Pratinav Seth
类目: Machine Learning (cs.LG)
*备注:
Abstract:Tool-using agents increasingly require a common substrate for building, training, evaluating, distilling, and maintaining agentic systems, yet existing tooling typically addresses these stages in isolation. We present AgentTune, a source-available Python library that provides a unified framework for developing and optimizing tool-using agents. At its core, AgentTune introduces a two-tier EventLog representation that preserves agent trajectories while supporting consistent projections for training, evaluation, and auditing. Building on this substrate, the library provides a shared agent runtime, tool-calling reinforcement learning, agentic distillation, retrieval-augmented generation, decision workflows, evaluation utilities, and a designed path toward self-healing agents. These components are exposed through composable interfaces so that agent strategies, training methods, evaluation procedures, and recovery mechanisms can be combined without requiring separate representations or pipelines. We demonstrate the framework across agentic tasks including legal contract search and domain-specific applications, illustrating its use for trajectory-based optimization, tool-use evaluation, and cross-task agent development. AgentTune is released as a source-available library at this https URL
[LG-43] PDE-PFN: Prior-Data Fitted Neural PDE Solver NEURIPS2026
链接: https://arxiv.org/abs/2610.13334
作者: Jaehyeon Park,Mingu Kang,Dongseok Lee,Woojin Cho,Kookjin Lee,Anthony Gruber,Youngjoon Hong,Noseong Park
类目: Machine Learning (cs.LG)
*备注: NeurIPS 2026
Abstract:Motivated by the success of large language models (LLMs) with broad generalizability and robustness to noisy or unreliable pre-training data, we explore in-context prediction of PDE solution fields using approximate pre-training data. In addition, inspired by the posterior predictive mean-based inference mechanism of the in-context learning in prior-data fitted networks (PFNs), we propose PDE-PFN, a prior-data fitted neural solver that approximates the posterior predictive mean of PDE solutions via in-context learning. PDE-PFN builds on a PFN architecture with self- and cross-attention mechanisms of Transformer and is pre-trained on noisy approximate solutions generated by physics-informed neural networks, serving as diverse but not necessarily exact priors. Through experiments on a range of two-dimensional PDEs, we demonstrate that PDE-PFN achieves empirical generalization across heterogeneous equations, robustness under noisy priors, and zero-gradient-update in-context inference capability. PDE-PFN achieves competitive or improved predictive accuracy relative to the evaluated baselines while supporting flexible context and query representations.
[LG-44] DuoRate: Two-Rate Per-Expert Precision Allocation for Mixture-of-Experts Serving
链接: https://arxiv.org/abs/2610.13328
作者: Mengqi Guo,Zhe Wei,Yuan Yuan,Jiunn Bin Lim,Boyi Pan,Michael Bi Mi
类目: Machine Learning (cs.LG)
*备注: 29 pages, 13 figures, 12 tables
Abstract:Serving a Mixture-of-Experts (MoE) model pays for expert precision twice: the resident footprint pays for every expert the router can reach, while each batch-one decode step pays only for the experts it selects. These are two different rate functionals over the same per-expert widths, yet published per-expert MoE allocators constrain only the first. We call the difference the store-read gap; in the released BitsMoE checkpoint, 2.54 bits per weight (bpw) of storage become 7.50 bpw of decode traffic. We propose DuoRate, which stores once and reads per workload. Offline, it stores one uniform tier of a prefix-readable weight stream and bakes a distortion tensor. Online, it profiles a workload’s own prefill without labels and solves a Lagrangian rate-distortion allocation under the decode functional; routing frequency provably cancels from every per-expert decision, and the solve costs one dot product per expert and a bisection. A deployment therefore keeps a single artifact that prefill reads at the stored rate and decode reads at the workload’s own rate. On Qwen3-30B-A3B, DuoRate reading 2.3 bpw exceeds every 2-bit-class baseline by 6.3 to 47.0 points of average accuracy, and at 2.9 bpw it matches 4-bit formats that read 1.4-1.6 bpw more. The advantage is largest under long decoding: on GSM8K, DuoRate at 2.9 bpw matches or exceeds every 4-bit format and trails BF16 by only 0.25 points, and at 2.6 bpw it still matches or exceeds the 4.5-bit NF4 and FP4. Against controls in its own format, the allocation alone is worth 0.07-0.11 bpw of read rate. Code will be released upon publication.
[LG-45] SBNO : Schrödinger Bridge Neural Operator for the Forward and Inverse Problems under Missing Information NEURIPS2026
链接: https://arxiv.org/abs/2610.13317
作者: Jaehyeon Park,Inhyeok Jeong,Noseong Park
类目: Machine Learning (cs.LG)
*备注: NeurIPS 2026
Abstract:Partial differential equation (PDE) surrogate modeling often relies on either dense observations or access to governing equations/physics constraints. In practice, observations can be sparse and partial, and the underlying physics may be partially specified or unavailable. We introduce SBNO, an equation-free paired-data diffusion bridge matching framework that learns conditional operators for both forward and inverse PDE problems under partial observations. SBNO uses diffusion Schrödinger bridge matching to learn a pair of time-dependent drifts from a mask-aware endpoint coupling that preserves empirical input-solution pairing during training and supports both PDE-task directions within a single framework. At inference time, SBNO produces a deterministic point reconstruction by integrating the probability-flow ODE constructed from the learned drift pair, without inference-time observation or PDE guidance-weight tuning. On five PDE benchmarks with 5% observations, SBNO achieves superior or comparable accuracy to baselines while demonstrating lower test-instance error dispersion. Furthermore, SBNO is at least 9.7 \times faster and reduces GPU memory by at least 4.3 \times compared to guided-diffusion baselines.
[LG-46] Sustainable Cloud-Fog-Edge Systems for Smart Buildings: Algorithmic Adaptation under Memory Constraints and Dynamic Orchestration Strategies
链接: https://arxiv.org/abs/2610.13307
作者: Mamadou Sow,Christophe Cerin
类目: Machine Learning (cs.LG); Distributed, Parallel, and Cluster Computing (cs.DC); Numerical Analysis (math.NA)
*备注: 7 pages, 9 figures
Abstract:The escalating environmental footprint of the Information and Communication Technol- ogy (ICT) sectorwith global Data Center electric- ity usage potentially reaching 3% by 2030 and the imperative for real-time responsiveness in smart buildings demand a foundational shift towards Edge Computing. This article proposes a holis- tic architectural and algorithmic approach for cre- ating autonomous, resilient, and privacy-preserving learning systems within smart buildings, advancing the core concept of the building itself as the data center. Our contributions, demonstrating originality compared to conventional centralized systems, are structured around three main pillars: 1) Validation of resilient data acquisition chains using the af- fordable Arduino ecosystem (Uno R4 WiFi/BME280) and secure persistence solutions including centralized archiving (Node-RED/MySQL) and secure remote transfer (Python/rsync/SSH). 2). The proposal of a lightweight, KOptim orchestration framework, inter- operable with the FIWARE standard, for the dynamic management of Service Level Agreements (SLA). 3) The adaptation and experimental valida- tion of the Generalized Hebbian Algorithm (GHA) for Principal Component Analysis (PCA) on low- power microcontrollers,We introduce and compare an iterative learning strategy using data buffers, featuring sorting and explicit preservation of extreme samples to maintain diversity. Experimental results on the high-dimensional Tour Perret sensor data confirm that this novel method, despite introducing a necessary temporal complexity of O(W log W ) due to sorting, achieves convergence and final result quality that is visually equivalent to processing the entire dataset in full memory, reliably identifying two distinct operational states.
[LG-47] Structure-Aware Numerical Stabilization for Half-Precision Proximal Policy Optimization
链接: https://arxiv.org/abs/2610.13306
作者: Linxuan Wu,Liang Chen
类目: Machine Learning (cs.LG)
*备注:
Abstract:Local online training on resource-constrained platforms requires low computational and training-state overhead. We study the numerical stability and computational efficiency of half-precision proximal policy optimization (PPO) on commodity GPUs. Directly converting PPO training to FP16 is unreliable because numerical errors feed back through policy updates and subsequent data collection, while PPO repeatedly compares a current policy with a fixed behavior policy. We propose PPO-FP16 with three structure-aware modules. Global scalar protection stabilizes statistics shared across a minibatch or parameter update. Policy-change residual protection extracts and preserves small differences between the current and behavior policies. Efficient persistent-update protection stabilizes optimizer state and parameter writeback while reducing state storage. These changes preserve the PPO objective, hyperparameters, and training budget. Across six continuous-control tasks and five seeds, PPO-FP16 achieves the lowest mean return-AUC rank (1.90) among the four methods and ranks first in 17 of 30 environment-seed comparisons. Eight of nine performance configurations yield PPO update speedups ranging from 1.16 to 2.03 times. Relative to Full FP32 Adam, optimizer-state memory is reduced by 71.7 to 74.9 percent, and peak allocated GPU memory is reduced by up to 44.5 percent. The results show that protecting a small set of structurally important quantities can deliver stable, efficient FP16 PPO without retuning.
[LG-48] MORAD: Reinforcement Learning with Multi-Objective Rewards for RNA Inverse Design
链接: https://arxiv.org/abs/2610.13305
作者: Jixin Tang,Ji Guo,Jun Zhao
类目: Machine Learning (cs.LG); Biomolecules (q-bio.BM)
*备注: 18 pages, 5 figures. Jixin Tang and Ji Guo contributed equally. Project page: this https URL
Abstract:We introduce MORAD, an online reinforcement learning framework for backbone-conditioned RNA diffusion models that trains a single shared policy across diverse target backbones. Structure-conditioned RNA inverse design seeks nucleotide sequences compatible with a target three-dimensional backbone, yet existing reinforcement learning approaches either optimize a separate policy for each target backbone or rely on offline preference optimization, leaving online post-training of a reusable backbone-conditioned model largely unexplored. MORAD combines backbone-conditioned group sampling, group-relative reward normalization, and a forward-process diffusion objective. Beyond existing RL rewards that primarily target tertiary structural quality, MORAD jointly optimizes six measurements spanning tertiary geometry, base pairing, ensemble behavior, and sequence composition. To aggregate these heterogeneous objectives despite differences in scale and optimization direction, MORAD maps each measurement to a bounded desirability score and combines them with a weighted geometric mean. Compared with a tertiary-structure-only reward, this multi-objective formulation improves 10 of the 11 evaluation metrics that have a preferred direction. Applied to pretrained RIDE, MORAD improves GDT-TS by 16.0% (from 0.3300 to 0.3827) and pairing MCC by 19.4% (from 0.6110 to 0.7295), while reducing normalized ensemble defect by 27.5% (from 0.3906 to 0.2830). On the test set, MORAD outperforms RiboDiffusion, gRNAde, and RDesign across tertiary structural accuracy, secondary-structure pairing, and thermodynamic quality, establishing a new state of the art in structure-conditioned RNA inverse design.
[LG-49] DAG Structure Learning with Node-Varying Heavy-Tailed Disturbances
链接: https://arxiv.org/abs/2610.13304
作者: Robin Francis,Sundeep Prabhakar Chepuri
类目: Machine Learning (cs.LG)
*备注:
Abstract:DAG structures can be learned from observations by incorporating acyclicity via smooth constraints, such as DAGMA’s log-determinant function. Typically, observations and the underlying DAG are related through linear structural equation models, with Gaussianity assumption on the disturbances at each node. Extending DAG learning methods that account for scale and tail behavior of disturbances that vary across nodes remains a challenge. We propose a node-varying Student- t DAGMA that jointly estimates the graph structure, node-specific disturbance scales, and the degrees-of-freedom parameter. A Gaussian scale-mixture representation yields an iteratively reweighted formulation that down-weights large standardized residuals. Building on existing results, we also establish identifiability of the graph and disturbance parameters. Synthetic experiments demonstrate improved structural recovery under heterogeneous heavy-tailed disturbances, and experiments on real finance data show that the proposed method yields lower test negative log-likelihood than the evaluated baselines.
[LG-50] Recovering Irreducible Three-Body Interactions with Lagrangian Neural Networks
链接: https://arxiv.org/abs/2610.13292
作者: Sena Kalabalik,Sukru Caglar,Abdullah Umut Hamzaogullari,Arkadas Ozakin
类目: Machine Learning (cs.LG); Atomic Physics (physics.atom-ph); Computational Physics (physics.comp-ph)
*备注:
Abstract:Lagrangian Neural Networks (LNNs) learn mechanical systems from trajectory data by parameterizing a scalar Lagrangian and deriving the dynamics through the Euler-Lagrange equations, biasing the model toward motion that respects the variational structure of mechanics. The interactions studied so far have been pairwise-additive, leaving open whether LNNs can recover an irreducible many-body interaction from motion alone. We address this using the Axilrod-Teller triple-dipole interaction, the leading three-body dispersion term, whose dependence on the collective geometry of three particles cannot be represented by any sum of pairwise terms. We prescribe the kinetic energy exactly and learn only the potential, as a function of interparticle distances and angles. Combined with a signal-aware sampling strategy that concentrates training data where the three-body signal is strongest while preserving broad coverage of configuration space, this recovers the interaction from accelerations alone. The learned potential reproduces the radial scaling, angular dependence, and characteristic sign reversal of the Axilrod-Teller interaction, and generates stable trajectories. Embedding it within a pairwise Lennard-Jones potential lets us examine its observability: the three-body term is recovered once its dynamical signature exceeds the residual modeling error, which it does cleanly at amplified coupling but not at the coupling of a real noble gas, bracketing the transition between the two. Finally, symbolic regression on the trained potential, with no assumed functional form, returns the Axilrod-Teller expression with angular numerator, radial law, and coupling constant intact. An LNN with domain-specific structure can thus recover an irreducible three-body interaction from trajectories as a closed-form law, pointing toward learning interaction laws whose structure is not known a priori.
[LG-51] MHR-Router: Multimodal Heterogeneous Retrieval-Enhanced Adaptive Routing for VLM Inference
链接: https://arxiv.org/abs/2610.13278
作者: Wenjuan Zhu,Zheming Yang,Yunqing Hu,Qi Guo
类目: Machine Learning (cs.LG)
*备注:
Abstract:Vision-language models (VLMs) exhibit complementary capabilities, yet selecting the most suitable expert for a given image-question query remains challenging due to heterogeneous multimodal inputs and varying expert strengths. Existing routing approaches rely on text-based cues or static model profiles, failing to capture fine-grained visual evidence and expert-specific failure patterns. To address this, we propose MHR-Router, a multimodal heterogeneous retrieval-enhanced adaptive routing framework for VLM inference. It accurately dispatches each multimodal query to the most suitable VLM expert via local retrieval evidence. MHR-Router consists of two stages: (1) Multimodal Routing Representation, which fuses frozen multimodal features into a comprehensive query representation; and (2) Heterogeneous Retrieval-Enhanced Adaptive Routing, which retrieves expert-specific success and failure memories as local evidence and employs a shared scorer to adaptively select the optimal expert. Experiments show that MHR-Router effectively achieves heterogeneous modality routing and consistently improves accuracy over traditional baselines.
[LG-52] CopRoute: Dependence-Aware Conformal Routing for Language Models NEURIPS2026
链接: https://arxiv.org/abs/2610.13276
作者: Siva Rajesh Kasa,Santhosh Kumar Kasa,Karan Gupta
类目: Machine Learning (cs.LG)
*备注: 41 pages, 6 figures, 20 tables, accepted for poster presentation at the NeurIPS 2026 Workshop on On-Device Intelligence: Foundation Models under Real-World Constraints (ODI 2026)
Abstract:Set-based language model routing aims to increase the coverage of the event where at least one model answers a query correctly while controlling the number of inference calls made. Existing risk-controlled routing policies bound the all-miss risk (the probability that every model in the selected set fails) by calibrating a single conformal threshold and applying it to a nested family of model sets. Because each model is scored in isolation, these policies ignore the dependence structure of model failures. Models that share training data or architecture tend to fail on the same queries, so two individually strong models can be jointly redundant while a weaker but complementary model covers the queries that the others miss. To account for this dependence, which existing risk-controlled policies ignore, we propose CopRoute, which orders models by how many new queries each one answers correctly beyond those already selected, decides per query how far down that order to go, and then picks the smallest cutoff that still meets the target risk. We show that CopRoute’s ordering attains, on the design data, the best guarantee any efficient fixed-ordering algorithm can give for the average number of calls to the first correct model, and that a separate calibration step certifies the all-miss risk of the deployed sets. On RouterBench and RouterEval, CopRoute attains the fewest certified calls on nine of ten datasets at a target risk of 0.05 and on eight of ten at 0.10, making up to 79 percent fewer calls (median 24 percent) than the state-of-the-art risk-controlled policy at the same certified all-miss risk.
[LG-53] Data-Adaptive Mahalanobis Metric Learning for Cross-Head Attention in Transformers
链接: https://arxiv.org/abs/2610.13261
作者: Zhenke Duan,Xin Li,Jiqun Pan,Dong Xiaofei,Hanwen Ning,Xinyuan Song
类目: Machine Learning (cs.LG)
*备注:
Abstract:In this paper, we propose Data-Adaptive Mahalanobis Cross-Head Attention (DAMCHA), a simple and effective attention mechanism that generalizes Multi-Head Attention (MHA) through the lens of metric learning. Standard MHA implicitly learns a static, head-wise Euclidean similarity corresponding to the diagonal blocks of a unified cross-head metric matrix, discarding all off-diagonal interactions across heads. DAMCHA addresses this limitation via two key innovations. First, it learns the full cross-head metric matrix, inducing a Mahalanobis-like similarity that explicitly captures inter-head interactions beyond the restricted block-diagonal structure of MHA. Second, it parameterizes the metric matrix as an input-dependent function, enabling the attention geometry to dynamically adapt to the intrinsic manifold structure of the data rather than remaining fixed after training. We further introduce principled regularization strategies, most notably stack-wise parameter sharing, to ensure computational efficiency and stable optimization. DAMCHA serves as a drop-in replacement for MHA and its variants in various Transformer architectures, delivering superior expressive power and learning performance with comparable or reduced computational overhead. Extensive experiments demonstrate that DAMCHA-based Transformers consistently outperform competing baselines across a range of benchmark tasks. Code is available at this https URL.
[LG-54] Neural Surrogate Modeling of Ultrasonic Wave Propagation in Heterogeneous Media ICASSP2027
链接: https://arxiv.org/abs/2610.13258
作者: Burla Nur Korkmaz,Petro Moilanen,Ari Salmi,Harsha Vardhan Tetali,Arto Klami
类目: Machine Learning (cs.LG)
*备注: Submitted to IEEE ICASSP 2027
Abstract:Neural surrogates provide computationally efficient auto-regressive modeling of wave propagation, enabling e.g. fast inverse solutions. Despite recent progress, the current surrogates are not yet sufficient for the needs of ultrasonic sensing, characterized by high frequency and heterogeneous propagation media. We show how methods building on Fourier Neural Operators (FNO) fail to capture essential signal features, such as reflections, whereas U-Net -based methods learn the wave fields well but lack the ability to transfer information across different spatial scales. We then propose a new surrogate that captures the best of the two worlds, by integrating FNOs and local-integral resampling into a U-Net architecture. We show it can be trained on limited data, and that the predictions are robust to input noise and work across spatial scales.
[LG-55] State-OPD: State-Grounded On-Policy Distillation for Multi-Turn Agents
链接: https://arxiv.org/abs/2610.13238
作者: Zhentao Zhang,Yanzhao Zheng,Yanlin Liu,Yuanqiang Yu,Tianze Xu,Chao Ma,Jihuai Zhu,Lelun Wu,Baohua Dong,Hangcheng Zhu,Ruohui Huang,Gang Yu
类目: Machine Learning (cs.LG)
*备注:
Abstract:On-Policy Distillation (OPD) has emerged as a powerful paradigm for transferring reasoning capabilities from frontier models to smaller models, while extending its success to multi-turn agentic environments remains challenging. We study agentic OPD through interaction states, distinguishing the objective task and executed action-observation record from the internal semantic trajectory of student reasoning. Through this lens, we identify two roles of student reasoning in multi-turn OPD: prior reasoning distorts teacher supervision, while current reasoning shapes the action alternatives sampled at the same state. Specifically, at matched interaction states, removing prior student reasoning improves teacher continuation success and changes the teacher’s token-level targets, with larger continuation gains at later turns. Meanwhile, resampling complete reasoning-action responses yields greater action diversity at the same state than resampling actions under a fixed reasoning trace. We introduce State-Grounded On-Policy Distillation, a framework that grounds teacher supervision in interaction states and reallocates the sampling budget to generate multiple complete reasoning-action responses at states with high response entropy, while retaining full-history student generation. Comprehensive evaluations across ALFWorld, ScienceWorld and WebShop demonstrate that State-OPD achieves the highest macro-average success rate among the evaluated methods for both Qwen3-1.7B and Qwen3-4B students. Notably, for Qwen3-4B, State-OPD raises macro-average success from 26.07% with the strongest baseline to 31.74% and surpasses its Qwen3-32B teacher on ALFWorld Seen. Further analyses reveal that State-OPD achieves higher task success with fewer supervised turn responses and substantially reduces persistent failed-action repetition; qualitative traces illustrate decision revision based on interaction feedback.
[LG-56] Learning Schwarzschild Geodesic Motion with Lagrangian Neural Networks
链接: https://arxiv.org/abs/2610.13234
作者: Sukru Caglar,Sena Kalabalik,Abdullah Umut Hamzaogullari,Arkadas Ozakin
类目: Machine Learning (cs.LG); General Relativity and Quantum Cosmology (gr-qc)
*备注:
Abstract:Lagrangian Neural Networks (LNNs) learn dynamics from trajectory data by parameterizing a scalar Lagrangian and deriving accelerations through the Euler–Lagrange equation, providing a variational inductive bias that improves physical consistency over purely data-driven models. LNNs have recently been extended to general relativistic settings, leaving Schwarzschild geodesics as an open challenge. Training on complex relativistic systems is hindered by the diversity of the dynamics, as well as numerical instabilities and the difficulty of adequately sampling physically relevant, diverse orbital regimes. We introduce two coordinated improvements: a decoupled position–velocity normalization scheme that independently rescales each coordinate and its time derivatives, reweighting acceleration targets to balance contributions across all channels; and an energy-constrained log-uniformly sampled dataset generation strategy informed by the innermost stable circular orbit (ISCO) structure. With these improvements, our model accurately reproduces perihelion precession and relativistic time dilation, conserves energy and angular momentum to within a few percent even after completing multiple orbits around the central mass and predicts orbital trajectories across eight orbital scenarios in close, medium, and far-field regimes. These results establish that LNNs, augmented with physically motivated normalization and sampling, can reliably learn geodesic dynamics in curved spacetime. Our work also represents the first successful training of LNNs on Schwarzschild geodesics and offers a promising direction for data-driven modeling of complex relativistic systems.
[LG-57] nsor-based Fusion of Multi-modal Data for Predicting Cancer Risk Levels
链接: https://arxiv.org/abs/2610.13221
作者: Ali Anaissi,Yuanzhe Jia,Qishun Peng,Weidong Huang,Ali Braytee,Junaid Akram
类目: Machine Learning (cs.LG); Quantitative Methods (q-bio.QM)
*备注:
Abstract:Cancer diagnosis and treatment increasingly rely on multi-modal diagnostic technologies that generate high-dimensional datasets. Although these datasets are rich in pathological information, they pose considerable challenges in interpretation, dimensionality reduction, and clinical applicability. Conventional machine learning approaches often fail to extract meaningful cross-modal features, thereby limiting predictive accuracy in patient risk stratification. To address these limitations, this paper proposes an unsupervised machine learning framework that integrates feature extraction, tensor decomposition, and clustering to improve cancer risk prediction. The framework employs tensor decomposition to fuse heterogeneous genomic and clinical data, enabling the extraction of latent, biologically meaningful features that outperform unimodal feature sets. Multiple feature extraction strategies are investigated, and the resulting features are subsequently clustered using a range of clustering algorithms. Comparative evaluations based on internal and external metrics are then used to identify the most effective configurations. The framework is validated on LinkedOmics data comprising 11,158 patients across 32 cancer types. For patient risk stratification, clinically relevant attributes such as tumor purity, pathological stage, and survival outcomes serve as ground-truth indicators. Experimental results demonstrate the superiority of tSVD+GMM, which consistently outperforms other configurations across clinical benchmarks.
[LG-58] Monarch-MoE: Structured Experts for Multimodal Continual Instruction Tuning
链接: https://arxiv.org/abs/2610.13215
作者: Xi Zhang,Boyu Diao,Zesen Chen,Ruiqi Liu,Hangda Liu,Yongjun Xu
类目: Machine Learning (cs.LG)
*备注: 25 pages, 3 figures
Abstract:Learning new tasks in multimodal continual instruction tuning can cause catastrophic forgetting of previously acquired knowledge. Although multi-expert LoRA distributes learning across experts, updates to a dense low-rank expert can still affect many output features. We introduce Monarch-MoE, which replaces the dense factors in LoRA experts with block-diagonal factors connected by a fixed permutation. This structure provides blockwise gradient isolation: individual block-pair updates affect only one output block, while connections between all input and output blocks are maintained. To make these compact experts practical on memory-limited hardware, we combine batched computation, fused forward operators, and an optimized backward pass. Across three continual-learning methods evaluated on MLLM-DCL and UCIT with LLaVA-1.5-7B, Monarch-MoE improves first-task retention while reducing adapter parameters by approximately 75% and 50%, respectively. In the main comparison, first-task forgetting is as low as 0.52 percentage points on MLLM-DCL and 0.10 on UCIT, with method-dependent trade-offs in final performance. Our implementation supports fine-tuning and inference on a single 24 GB RTX 4090, with lower measured memory use and competitive runtime in the evaluated settings. Together, these algorithmic and systems improvements make structured experts a practical option for continual adaptation on memory-limited hardware.
[LG-59] How Much Computation Does Every Forecast Need? Structured Block Skipping in Two Time-Series Foundation Models
链接: https://arxiv.org/abs/2610.13208
作者: Max Bourgeat
类目: Machine Learning (cs.LG)
*备注:
Abstract:Time-series foundation models use the same network depth for every input, although forecasting windows differ in structure and difficulty. We test whether whole Transformer blocks can be removed at inference time in two pretrained models: Chronos-Bolt and TimesFM 2.5. Our bypasses avoid the original block computation and preserve the dense model exactly when all blocks are enabled. Masks are selected only on calibration windows and evaluated on 1,088 held-out windows from ETTh1, Traffic, Weather, and Exchange. At moderate sparsity, Chronos-Bolt with 7/11 candidate blocks and TimesFM with 16/20 blocks show little change in mean relative forecasting quality across datasets while reducing median A100 batch-1 latency by 11.2% and 13.4%. More aggressive TimesFM skipping accelerates inference further but substantially harms Traffic and Weather. Across both models, different equal-budget masks win on different windows, and a retrospective oracle significantly improves over the best static mask on every dataset. However, dataset-specific masks transfer inconsistently, and Chronos representations do not support reliable unseen-domain routing. These results establish cross-architecture structured redundancy and input-dependent opportunity, but not a deployable dynamic inference method.
[LG-60] Rethinking Relative Policy Differences Transfer of On-Policy Distillation
链接: https://arxiv.org/abs/2610.13205
作者: Rong Wu,Daocheng Fu,Yu Yang,Xuemeng Yang,Siqi Li,Shu Zou,Yao Zhu,Botian Shi,Bo Zhang,Cong Zhang,Pinlong Cai,Jianbiao Mei
类目: Machine Learning (cs.LG)
*备注:
Abstract:On-policy distillation (OPD) trains a target policy on its own rollouts using token-level supervision from a stronger teacher, but typically relies on the teacher being substantially more capable than the target. Recent work relaxes this requirement by transferring the relative policy difference between an expert and a reference policy rather than the expert’s absolute distribution. Yet it remains unclear which differences provide useful supervision and which targets can benefit from them. We develop a unified view in which the log-probability ratio between a proxy expert and a proxy reference defines an implicit reward for KL-regularized policy optimization. This formulation induces an on-policy update for the target, recovers conventional OPD as a special case, and enables any-to-any transfer across models that differ in scale, training stage or generation. Our systematic experiments yield three findings. First, a stronger expert is not necessarily a better source of supervision: differences induced by task-specific training, including reinforcement learning and supervised fine-tuning, transfer consistently, whereas those arising from model scale alone transfer weakly or not at all. Second, the expert and reference serve complementary roles: the expert provides the capability to be transferred, while the reference filters out shared behavior and isolates the relevant residual. Third, even a useful difference does not transfer to every target: success requires the induced update to move the target toward the expert and generalize beyond sampled rollouts. Raw policy distance does not predict transferability, whereas an appropriate reference can rescue otherwise unsuccessful transfer. These results characterize when relative policy differences provide effective supervision for OPD.
[LG-61] Prediction-Informed Landing Window Planning for UAV Landing on USV in High Sea States
链接: https://arxiv.org/abs/2610.13190
作者: Kaizhen Li,Xi Zhou,Dan Zhang,Xiaowei Li
类目: Robotics (cs.RO); Machine Learning (cs.LG)
*备注:
Abstract:Autonomous landing of unmanned aerial vehicle (UAV) on unmanned surface vehicle (USV) is difficult in high sea states. Existing hierarchical landing methods often infer future USV motion only implicitly from short observation histories, which limits their ability to adapt to severe and rapidly changing sea conditions. This paper presents a prediction-informed hierarchical control framework. A pretrained model is developed to explicitly predict the USV attitude during high-level landing decisions. The prediction helps identify suitable landing windows and choose the right touchdown time, while a conventional low-level flight controller maintains UAV stability and tracks motion commands. To evaluate the framework under realistic disturbances, a real-sim validation setup is constructed in which USV-motion data collected in real sea conditions are transferred to a MuJoCo USV. The experiments demonstrate the feasibility of using explicit attitude prediction to improve landing-window selection and support timing-aware UAV landing planning in rapidly varying marine environments.
[LG-62] WaSA: Wavelet Scattering Autoencoders for Unsupervised Offline Detection of Malicious Clients in Federated Learning
链接: https://arxiv.org/abs/2610.13186
作者: Alessandro Licciardi
类目: Machine Learning (cs.LG)
*备注: Accepted at IEEE International Conference on Omni-Layer Intelligent Systems (COINS) 2026, Bologna, Italy; September 7-9, 2026
Abstract:Federated Learning (FL) enables collaborative model training without exposing raw data, yet remains vulnerable to malicious clients injecting poisoned datasets. Existing defenses are typically reactive (operating during training) or supervised (requiring prior knowledge of attack types) - assumptions that rarely hold in open-ended IoT deployments. We propose WaSA, a fully unsupervised, offline framework for malicious client detection. Before training, each client transmits a single, privacy-preserving spectral summary of its data to the server. A denoising autoencoder, trained solely on clean auxiliary data, scores clients based on their deviation from the learned benign manifold, identifying corruptions regardless of the attack type. WaSA requires no attack labels, generalizes to unseen anomalies, and introduces a Boltzmann sampling strategy for client selection that smoothly interpolates between hard exclusion and standard aggregation. Experiments on MNIST, CIFAR-10, and CIFAR-100 under diverse attack scenarios (up to 90 % malicious clients) demonstrate consistent improvements over supervised baselines and robust aggregation methods, with negligible communication overhead. Code is available at this https URL.
[LG-63] Scaling RNA Foundation Models through Iterative Refinement
链接: https://arxiv.org/abs/2610.13106
作者: Pengan Chen,Liang Hong,Xinyuan Liu,Han Huang,Ziqian Lin,Jiayang Chen,Yimin Fan,Jiyue Jiang,Yu Li
类目: Machine Learning (cs.LG)
*备注: Technical Report. 20 pages, 5 figures, 9 tables
Abstract:Biological function in RNA is encoded across scales, from local sequence motifs to long-range structural dependencies. Conventional RNA foundation models couple parameter capacity and inference depth within a fixed architecture, prescribing a fixed computation graph for each inference. Here we present Eco-RNA, an 80M-parameter RNA foundation model that makes inference depth adjustable through learned iterative refinement. Its shared, input-conditioned Transformer core refines sequence representations through repeated application. The iteration count is selected after training and controls effective depth at fixed model parameters. We train across recurrent depths with masked reconstruction, state regularization, and a one-sided loss that anchors deeper reconstruction to a shallow reference. On the 70-assay RNAGym fitness benchmark, increasing refinement from one to four iterations raises aggregate absolute Spearman correlation from 0.242 to 0.286, with the gain retained through eight iterations. At four iterations, Eco-RNA surpasses the current SOTA Evo 2 40B on all three aggregate fitness metrics despite 500x fewer parameters. Its iteration configurations advance the compute-performance Pareto frontier among the evaluated models. It also outperforms the evaluated baselines in non-coding RNA family classification, RNA secondary-structure prediction, and chemical probing profile prediction. These results establish internal inference computation as an effective scaling dimension for RNA foundation models.
[LG-64] Can Failed Trajectories Reveal Where Agents Go Wrong? Agent ic Failure Attribution Without Step-Level Labels
链接: https://arxiv.org/abs/2610.13105
作者: Do Nguyen-Thanh,Junlin Fang,Bing Li,Zhen Fang,Sean Du
类目: Machine Learning (cs.LG)
*备注:
Abstract:Failure attribution for LLM agents aims to identify decisive steps responsible for task failure, which is critical for debugging and improving agentic systems. Existing methods rely on costly LLM prompting, step-level error annotations, or verified successful trajectories that lack failure signals for assistance. In this paper, we study failure attribution from step-unlabeled failure trajectories, where each trajectory is known to have failed but its decisive step is unknown. We propose SOAP (Spectral scOring with Attention-guided Propagation), an effective framework requiring neither step-level training labels nor a separate success-only reference set. SOAP first constructs a spectral reference space from LLM representations and assigns each step a base error score according to its projection behavior. Importantly, later steps may exhibit stronger failure signals because they inherit an earlier mistake, causing independent scorers to favor downstream consequences over the decisive error. To address this downstream contamination, SOAP derives soft step dependencies from attention patterns and propagates downstream error evidence toward its likely upstream sources. Extensive experiments show that SOAP consistently improves attribution performance over competitive baselines.
[LG-65] he Limits of Query Monitoring against Distributed Model Extraction
链接: https://arxiv.org/abs/2610.13083
作者: Snigdha Chandan Khilar
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注:
Abstract:Model providers now face distillation campaigns run through thousands of accounts, each of which looks like an ordinary user. When network and payment metadata cannot link those accounts, the only evidence left is what they ask. We study what a provider can and cannot learn from those queries alone, using one million real chat turns for development and 17 later weeks that no design choice touched for a single frozen evaluation. The answer is set less by anything specific to extraction than by benign coordination: a campaign is visible only if it is more distinctive than the most distinctive group of ordinary users in the same week. We make this precise, show that a small but positive difference between campaign and users buys a detection time rather than detectability, and identify the campaign that is hardest to detect. Empirically, a calibrated monitor catches naive distributed extraction that per-account monitors miss (0.86-1.00 of weeks), and one variant - selecting accounts that move together after discounting how topical each one is - still catches campaigns padded with natural text (0.50-0.96 of weeks) where the other two spectral detectors catch none. Distilling each campaign into a small student shows that, in our testbed, campaigns that evaded every detector kept at most 42% of the capability of a detectable one. The limits are equally concrete: a campaign that ramps up slowly poisons every detector’s calibration, benign evaluation pipelines look exactly like distillation, we found no deployable detector at colluder shares of 2.5% or below, and campaigns that relay real users’ requests may be invisible to any query-only monitor.
[LG-66] Human and LLM Facilitation in Collaborative Design Meetings: A Computational Behavioral Comparison
链接: https://arxiv.org/abs/2610.13082
作者: Mohammed Azeez Khan,Aaron Dsouza,Ashutosh Mishra,Ummul Faiz Z. Bibi,Neha K. Nair,Amar Kumar Behera
类目: Machine Learning (cs.LG)
*备注: 17 pages, 7 figures, 6 tables
Abstract:Large language models (LLMs) are increasingly being explored as facilitators of group discussion and collaborative work, but the behavioral differences between LLM-generated and human facilitation remain insufficiently characterized. We compare human Project Manager facilitation turns from scenario-based collaborative design meetings with Llama 3.1 8B Instruct responses across 199 paired contexts from the AMI Meeting Corpus. The analysis covers five confirmatory dimensions: contextual semantic distance, a lexical elaboration proxy, empathyand-hedge lexical density, topic divergence, and phase-vocabulary alignment. An exploratory directiveness measure failed domain validation and is not interpreted. The sampled human Project Manager turns were higher on contextual semantic distance (r = 0.644) and on empathyand-hedge lexical density (r = 0.203). The second contrast is carried mainly by hedge terms, so we read it as lexical hedging rather than psychological empathy. Llama-generated facilitation was higher on topic divergence (r = 0.703), the lexical elaboration proxy (r = 0.288; lengthconfounded), and instruction-conditioned phase-vocabulary alignment (r = 0.382). A secondary no-phase check left the Llama-higher phase contrast in place. The system prompt still requested a facilitation move, so that check is not evidence of spontaneous phase awareness. These differences should not be interpreted as a ranking of facilitation quality. The resulting behavioral profile provides a reference point for later comparisons of LLM facilitators, human facilitators, prompts, models, and collaborative settings.
[LG-67] Double-Take: Improving Capacity Binding and Selectivity In Long-Context Within Bidirectional Memory
链接: https://arxiv.org/abs/2610.13073
作者: Vakul Raghavan,Utkarsh Grover,Mingyang Mao,Chengwen Wang,Xiaomin Lin
类目: Machine Learning (cs.LG); Genomics (q-bio.GN); Quantitative Methods (q-bio.QM)
*备注: 23 pages, 4 figures, 15 tables
Abstract:Processing a long sequence does not guarantee that distant information remains usable. As context grows, a fixed-size memory must retain many associations, connect information across positions, and preserve relevant structure without being overwhelmed by everything it observes. These are distinct requirements: a memory may store more information without representing the relationships needed for retrieval, and it may transport those relationships without preserving the ones that matter. Thus, the challenge is not simply extending context length, but constructing a memory that remains usable as context grows. We study this problem in large-chunk test-time training (TTT) and identify two basic failures: single-step writes accumulate interference, limiting capacity, while self-associative writes cannot form cross-position bindings. We introduce Double-Take (DT), which repairs these failures with multi-step unpinned updates and cross-position mixing, and adds bidirectional change-sensitive writes for selective retention. Capacity alone leaves end-to-end recall at the 0.10 chance floor; adding binding raises it to 0.92 . Trained only on 32,\mathrmkb genomic contexts, DT reaches 0.927 AUROC at 131,\mathrmkb and 0.856 near 1,\mathrmMb , while transferring zero-shot from human to mouse. Together, these results identify capacity, binding, and selectivity as three requirements for usable long-range memory.
[LG-68] CB-Orchestrator: Adaptive Workflow Optimization for LLM Agents via Contextual Bandits ICML2026
链接: https://arxiv.org/abs/2610.13064
作者: Jiahang Sun,Zhiwei Shang,Zhipiao Liu,Hongwei Yang,Guoqing Xie,Shuang Qiu,Zhongxiang Dai
类目: Machine Learning (cs.LG)
*备注: Presented at ICML 2026 Workshop on Compositional Learning: Safety, Interpretability, and Agents
Abstract:Large Language Model (LLM) agents have demonstrated remarkable capabilities in tackling complex tasks through agentic workflows. However, manually designing these workflows is labor-intensive and lacks flexibility to adapt to diverse queries. While automated workflow optimization is a promising direction, existing methods often incur expensive API costs during training-phase feedback collection. Furthermore, they fail to adaptively reuse high-quality workflows, which creates a bottleneck for both performance and cost-effectiveness. To address these limitations, we propose CB-Orchestrator, an adaptive framework that decouples workflow generation from selection. In the first stage, we construct a diverse pool of candidate workflows via evolutionary search. In the second stage, we formulate workflow selection as a Contextual Bandit problem, which enables sample-efficient learning by balancing exploration and exploitation, thereby significantly reducing the feedback required for training. During inference, the model adaptively selects the optimal workflow tailored to each query. Evaluations across five diverse benchmarks demonstrate that CB-Orchestrator consistently outperforms all baselines. Notably, on the MATH dataset, CB-Orchestrator achieves better performance than strong recent baselines while reducing training-phase API token overhead by no less than 40.55% and total end-to-end training (including workflow pool generation) token overhead by no less than 29.73%.
[LG-69] owards Easier-to-Tune Training Algorithms: New Results from AlgoPerf
链接: https://arxiv.org/abs/2610.13036
作者: Priya Kasimbeg,Ahmed Khaled,Aahlad Chandrabhatta,Yifan Wang,Andy Liu,Niccolò Ajroldi,David Tweedle,Xingyu(Alice)Yang,Isaac Patole,Frank Schneider,George E. Dahl
类目: Machine Learning (cs.LG)
*备注:
Abstract:Evaluating deep learning optimizer is challenging because confounding factors such as hyperparameter tuning and optimizer-model co-design often obscure true algorithmic performance. We present results of the updated AlgoPerf V1 benchmark, in which we evaluate a new set of training algorithms on wall-clock time-to-target across nine workloads on fixed hardware. This report focuses on the results of the benchmark’s self-tuning ruleset, which requires submissions to use a single configuration across all workloads. Out of the 13 submissions in PyTorch and JAX, Schedule-Free AdamW ranked first. In addition to the wall-clock scores, we also analyze the trade-offs between step efficiency and wall-clock execution, revealing that matrix-preconditioned and two-loop methods achieve good sample efficiency but require more aggressive computational optimizations to be competitive in runtime. Finally, our hyperparameter saliency and retention analyses show that the learning rate and momentum are highly sensitive across domains and algorithms, highlighting the need for methods that are more robust against hyperparameter tuning and can generalize well to new tasks.
[LG-70] arget-Constrained Pooling for Trajectory Extrapolation
链接: https://arxiv.org/abs/2610.13034
作者: Ning Wang,Claire Cardie,Sainyam Galhotra
类目: Machine Learning (cs.LG)
*备注:
Abstract:Trajectory extrapolation from a partial target trajectory is underdetermined, but completed related trajectories provide information about the unresolved continuation. We propose target-constrained pooling (TCP), which separates the finite-horizon endpoint from continuation shape and estimates that endpoint from two complementary source signals. Uniform pooling captures final response levels, while matched-increment pooling captures the remaining change after aligning source and target states. TCP selects representative sources, projects both endpoint estimates onto a target-consistent region, converts them into corrections of the free forecast, and controls their influence through strength calibration and degradation-aware weighting. Across 25,245 targets from five domains and both forecasting directions, TCP reduces mean RMSE by 35.8% to 42.1% for all ten target-only forecasters and improves all 100 forecaster, dataset, and direction comparisons. The two endpoint signals consistently outperform either alone, while representative selection remains within 0.64% to 1.02% of the full donor pool using 12.7x fewer donor inputs and 138.8x fewer matching distance computations.
[LG-71] Low-Rank Kolmogorov-Arnold Generator Flows for Interpretable Operator Learning
链接: https://arxiv.org/abs/2610.13028
作者: Minjong Cheon
类目: Machine Learning (cs.LG); Computational Physics (physics.comp-ph)
*备注:
Abstract:Neural operators that learn physical laws from data should generalize beyond their training distribution and expose the learned law in closed form. The Kolmogorov-Arnold neural operator achieves both for position-dependent dynamics by learning a dense pseudo-differential symbol over all positions and frequencies, at a cost that grows with the square of the resolution and with closed forms that must be read out by hand. This dense symbol is unnecessary: a finite-order variable-coefficient differential operator has a symbol whose separation rank is bounded by the number of its coefficient functions, independently of the resolution, and the symbols that this network learns on its own benchmarks have rank two. We introduce the Kolmogorov-Arnold flow (KAFlow), which learns the generator of a physical operator as a low-rank symbol built from univariate Kolmogorov-Arnold functions, fixes the gauge of these functions so that every term has a unique place, integrates the dynamics with exact exponential integrators, and distills its closed form automatically. On the synthetic benchmarks of the Kolmogorov-Arnold neural operator, KAFlow lowers the out-of-distribution loss by 3.4 to 11 times and recovers every coefficient to within 10^-4 without symbolic templates, reaching the precision floor of the data. On long-horizon quantum dynamics, it lowers the state infidelity by up to 6 orders of magnitude, and by 30 times when trained only on position and momentum measurements. KAFlow also learns a variable-order fractional operator 15 times more accurately than existing operator networks and discovers nonlocal, fractional and non-polynomial dispersion relations on which sparse regression fails.
[LG-72] rajectory-Aware Policy Optimization: Closing the State Distribution Gap in Long-Horizon LLM RL
链接: https://arxiv.org/abs/2610.13020
作者: Zhicheng Cai,Weinan Dai,Yuyan Zhou,Wei-Ying Ma,Ya-Qin Zhang,Hao Zhou
类目: Machine Learning (cs.LG)
*备注:
Abstract:Reinforcement learning (RL) has become a dominant paradigm for enhancing LLMs’ reasoning capabilities. Yet long-horizon autoregressive rollouts introduce a fundamental limitation: local policy mismatch can compound into severe state distribution shift over trajectories. Existing LLM RL methods, such as GRPO and GSPO, control policy mismatch at the token or sequence level, but overlook this trajectory-induced shift, causing training instability and eventual collapse as the horizon grows. To close the state distribution gap, we propose Trajectory-Aware Policy Optimization (TAPO), a principled framework that theoretically derives the state-distribution correction from the off-policy policy gradient and incorporates it into the RL objective. TAPO further employs a geometric-mean estimator for variance reduction, together with a length-aware dynamic clipping that prevents overly deviated updates across the trajectory. Extensive experiments demonstrate that TAPO significantly surpasses existing LLM RL algorithms across eight competition-level benchmarks, achieving up to 48% and 12% improvement over GRPO on mathematical reasoning and algorithmic coding, with substantially enhanced training stability.
[LG-73] Evidential Multimodal Transformers with Dempster-Shafer Fusion for Emotion Recognition
链接: https://arxiv.org/abs/2610.13013
作者: Muhammad Usama,Yeoreum Jung
类目: Machine Learning (cs.LG)
*备注: Accepted in IEEE Transactions on Affective Computing. 18 pages, 9 figures, plus 5 pages of supplementary material
Abstract:Softmax-based multimodal emotion recognition methods often assign high confidence even when sensor data are corrupted or contradictory, for example when facial expressions suggest positive valence while vocal prosody indicates negative arousal. We present an Evidential Multimodal Transformer with Dempster-Shafer Fusion (EMT-DS) that addresses this problem through formal uncertainty quantification. EMT-DS models predictions as Subjective Opinions (Dirichlet distributions), separating epistemic uncertainty (lack of evidence) from aleatoric uncertainty (sensor noise). Modality-specific transformer encoders produce belief mass distributions that are fused with Dempster’s Rule of Combination, which normalizes the joint belief mass by a conflict coefficient 1/(1-c), so that contradictory evidence is explicitly quantified as conflict and the fused prediction becomes diffuse rather than being forced into an unjustified consensus. Under subject-independent and speaker-independent evaluation on four benchmarks, EMT-DS achieves 84.3% accuracy on IEMOCAP versus 81.7% for the best baseline (p 0.01), 82.4% on DEAP under leave-one-subject-out evaluation versus 78.1%, and 96.8% on the highly imbalanced KEMDy20, and it improves accuracy on CMU-MOSEI by 2.4 points over the strongest evidential baseline. In controlled ablation, it reduces Expected Calibration Error from 0.153 (softmax transformer) to 0.042. It maintains 71.2% accuracy under severe Gaussian noise on audio features (sigma = 1.0), where attention baselines drop to 45.3%, and degrades gracefully when entire modalities are absent. The fusion step has O(MK^2) complexity, compared with O(M^2 d^2) for cross-modal attention. The learned conflict metric also flags likely errors: reviewing 20% of samples captures 80% of misclassifications, which supports selective prediction in clinical and safety-critical systems.
[LG-74] Gaussian-Width Bounds for Offline-to-Online Linear Bandits
链接: https://arxiv.org/abs/2610.12990
作者: Kushagra Chandak,Volodymyr Tkachuk,Xiaoqi Tan,Csaba Szepesvári
类目: Machine Learning (cs.LG)
*备注:
Abstract:We study how offline data can help online learning in stochastic linear bandits. We focus on partially covered offline data, where only k of the d feature directions are poorly covered. Existing analyses of algorithms based on phased elimination and optimism give regret bounds of order \widetilde O(\sqrtdkT) in this regime. We show that this dependence arises from loose control of the reward prediction error, and obtain tighter bounds using concentration of Lipschitz functions of Gaussian vectors. Based on this analysis, we develop a phased elimination algorithm with regret \widetilde O(k\sqrt T) . For the unit Euclidean ball, we prove a matching regret lower bound under partial coverage, as well as matching upper and lower bounds under uniform offline coverage. We also study pure exploration with offline data, providing algorithms and matching upper and lower bounds on simple regret for fixed-design algorithms and also for adaptive algorithms under partial and uniform coverage of offline data.
[LG-75] Diffusion Precipitation Generation with Medium-range Weather Forecasting
链接: https://arxiv.org/abs/2610.12976
作者: Guowen Li,Yang Liu,Mengxuan Chen,Jiashun Cheng,Haoyuan Liang,Shilei Cao,Yujie Wang,Juepeng Zheng,Fang Wang,Yerong Feng,Meng Jin,Hong Cheng,Yutong Lu,Haohuan Fu
类目: Machine Learning (cs.LG)
*备注:
Abstract:Accurate daily precipitation forecasts are important for weather-sensitive decisions. Although recent Weather Foundation Models (WFMs) have achieved significant progress, they are trained on reanalysis data, which exhibit regional and intensity-dependent biases. Since retraining WFMs on observation-based targets is costly, we study Dynamics-Precipitation Decoupling, a plug-and-play framework that uses a separately trained generator to map non-precipitation forecasts from a frozen weather model to observation-aligned daily precipitation. Its key challenges are to capture heterogeneous rainfall distributions and align daily accumulations with atmospheric signals that evolve across space and time. To address them, we train a diffusion generator conditional on atmospheric states and satellite-gauge estimates of precipitation. A multi-scale recurrent encoder summarizes atmospheric evolution, while cross-attention aligns atmospheric and precipitation features during denoising. Extensive evaluation of various backbones, including Pangu-Weather, GraphCast, and HRES, on global and regional forecasting shows improved daily precipitation accuracy and event detection, with better representation of localized accumulation patterns. Global ensemble evaluation shows lower Brier scores than ENS and training-from-scratch GenCast at all reported lead times, with lower CRPS in most comparisons. Remarkably, a heavy-rainfall case study using 2,288 stations in China further supports improved daily accumulation patterns and event detection against ground observations.
[LG-76] Minions: A Dynamic and Distributed Virtual GPU Cloud Built on Idle Apple Silicon Devices
链接: https://arxiv.org/abs/2610.12970
作者: Jianhua Li,Yun Xing,Girisha De Silva,Ryan Flint,Kai Yuan,Sean Suchter
类目: Distributed, Parallel, and Cluster Computing (cs.DC); Machine Learning (cs.LG)
*备注: 3 pages, 1 figure, 1 table
Abstract:The increasing demand for GPU-accelerated machine learning inference has exposed limitations in centralized GPU infrastructures, including high cost, limited elasticity, and long wait times under resource constraints. At the same time, modern Apple Silicon-based macOS devices are equipped with powerful GPUs that remain largely idle during normal usage. This paper presents Minions, a dynamic and distributed virtual GPU cloud that aggregates idle Apple Silicon GPUs across macOS devices to execute large-scale machine learning inference workloads. Minions enables teams to leverage existing hardware without requiring additional GPU procurement. The system provides flexible GPU inference task execution, fault tolerance, and efficient resource utilization. Our experience shows that idle macOS devices can be transformed into a practical distributed GPU inference platform in environments where centralized GPU resources are constrained.
[LG-77] DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback
链接: https://arxiv.org/abs/2610.12960
作者: He Sun,Junyuan Mao,Wenhao Jiang,Mingjun Xiao,Shinan Liu
类目: Machine Learning (cs.LG); Information Theory (cs.IT)
*备注: 2 figures, 8 tables
Abstract:Matching repair after utility changes can reuse valid observations, but new evaluations must respect matching capacity and may return out of order. We study announced invalidations with bounded, possibly reward-dependent reporting delays and pending evaluations that do not occupy future matching capacity. Residualload repair (RLR) combines sound outcome certificates with batched matching schedules for unequal sample deficits. Its complete dyadic quota schedule admits a sharp issue-round bound with coefficient cb 1.607 relative to the terminal residual endpoint load, together with separate delay and evidence-lifetime bounds. RLR-P monitors complete issue-order prefixes without changing the sampling plan before acceptance. With a deterministic pure oracle, a single-repair coupling from the same drained initial state guarantees no increase in certification time, issued observations, or time to a reusable checkpoint. We also derive an information-load lower bound. On fixed priority-star markets with unknown Bernoulli gaps, PrioritySearch attains the history-adjusted first-order constant for expected certification time as \delta \sim 0, under hypothesis-independent linear history scaling and sublogarithmic reporting delays. Paired simulations and measured-feedback replay quantify the trade-offs: in the replay, RLR-P has lower mean capped update-certification time than a monitored width-based baseline, at higher oracle CPU cost.
[LG-78] Controlled-Minimax: Stabilizing Adversarial Optimization via Control Theory
链接: https://arxiv.org/abs/2610.12915
作者: Tianjiao Luo,Jianfei Chen,Jun Zhu
类目: Machine Learning (cs.LG)
*备注:
Abstract:Minimax optimization is fundamental to adversarial learning yet suffers from severe stability challenges, often manifesting as persistent limit cycles or divergence. This paper investigates these instabilities through the lens of continuous-time dynamical systems. By modeling training dynamics as a second-order Ordinary Differential Equation (ODE), we rigorously identify the root cause of non-convergence: the problematic eigenstructure of the loss function’s Hessian near equilibrium points. To address this, we introduce Controlled-Minimax, a novel stabilization framework that reformulates the optimization trajectory as a controllable physical system. Unlike heuristic regularization techniques, our approach derives a specific feedback controller that provides theoretical guarantees of local exponential stability, regardless of the underlying Hessian spectrum. Consequently, our method stabilizes general minimax problems where traditional gradient descent-ascent methods fail. Extensive experiments on pathological benchmarks including the Dirac-GAN, 2D Gaussian mixtures, and Swiss Roll datasets, as well as high-resolution image synthesis with StyleGAN2-ada, demonstrate that Controlled-Minimax effectively suppresses oscillatory behavior while ensuring fast and robust convergence.
[LG-79] GIST: Generator-state-Informed Supervision for Tabular Foundation Models
链接: https://arxiv.org/abs/2610.12904
作者: Zhangyang Peng,Jingze Shi,Tongyi Zhang,Yuyu Luo
类目: Machine Learning (cs.LG)
*备注:
Abstract:Tabular foundation models (TFMs) based on prior-data fitted networks typically use sampled hard query labels, leaving avoidable sampling variability in pretraining. A key observation is that intermediate generator states can reveal label uncertainty beyond a sampled outcome. We propose Generator-state-Informed Supervision for TFMs (GIST), which uses these states to average query losses over conditional label distributions. GIST jointly designs task generation and query supervision, using entropy-calibrated encodings to obtain tractable, input-consistent targets on supported label-dependent branches. We show that this averaging preserves the population objective and yields no larger gradient covariance at fixed parameters within each generating distribution. Under matched pretraining schedules, GIST improves mean rank across three architectures on both TabArena and TALENT without changing architecture or inference. Across these benchmarks and architectures, GIST wins 62.1% of paired dataset-level comparisons against the corresponding hard-label controls.
[LG-80] Personalized Federated Direct Preference Optimization via LoRA Adapters AAAI
链接: https://arxiv.org/abs/2610.12885
作者: Zhanhong Jiang,Soumik Sarkar
类目: Machine Learning (cs.LG)
*备注: 15 pages, 11 figures, AAAI Fall Symposium Series 2026
Abstract:Federated Direct Preference Optimization (FedDPO) enables privacy-preserving alignment of language models across distributed agents without centralizing sensitive preference data. However, existing FedDPO analysis assumes all clients converge to a single shared policy, which is fundamentally at odds with the heterogeneous preference distributions present in practice. We propose Personalized FedDPO (pFedDPO), in which each client maintains a small private LoRA adapter atop a shared global base model. In pFedDPO, the base model is synchronized via FedAvg each round, while LoRA adapters remain local and capture client-specific preference patterns. We prove that this decomposition replaces the gradient diversity \kappa^2 in the FedDPO bound with a residual heterogeneity \kappa^2_\mathrmeff , which is no larger than \kappa^2 when adapters absorb client-specific directions, at the cost of an additive adapter-bias term that vanishes as adapters converge. Experiments on preference datasets show that pFedDPO consistently attains a lower gradient norm than vanilla FedDPO while remaining competitive in training loss and per-client reward accuracy.
[LG-81] CoGameReg: Cooperative-Game-Based Collaborative Semi-Supervised Regression for Seismic Reservoir Property Prediction
链接: https://arxiv.org/abs/2610.12884
作者: Zhiyu Guo,Jiwei Jia,Lei Li
类目: Machine Learning (cs.LG)
*备注:
Abstract:Accurate estimation of reservoir properties from seismic data remains challenging when well-log labels are sparse but three-dimensional seismic observations are abundant. We present CoGameReg, a cooperative-game-based semi-supervised regression framework that uses contribution-weighted predictions of heterogeneous regressors to construct shared pseudo-labels. This design makes each regressor’s influence explicit in the learning targets generated for unlabeled seismic samples under sparse well control. The Tri-Game Shapley mechanism combines a rank-MSE performance game with a pairwise consistency game to estimate nonnegative regressor weights from labeled training data. These weights remain fixed during collaborative training and are reused for final prediction fusion. Candidate pseudo-labels are screened using a common local k-nearest-neighbor error-reduction criterion before retraining. We evaluate CoGameReg on 10 public regression datasets, a synthetic three-dimensional P-wave velocity prediction task, and a field water-saturation application. The benchmark advantage is most pronounced at the 2.5% labeled-data ratio and decreases as supervision increases. CoGameReg obtains the best blind-well metrics in the synthetic experiment. In the field application, predictions clipped to 0-100% yield a pooled coefficient of determination of 0.5942, a root mean square error of 5.7441 percentage points, and a Pearson correlation of 0.8265 across three blind wells. CoGameReg has the highest Pearson correlation among the four field methods. The results support the use of CoGameReg to integrate sparse well labels with dense seismic attributes, with performance varying across metrics and well locations.
[LG-82] HART: Hybrid Attention-RWKV Time series Foundation Model
链接: https://arxiv.org/abs/2610.12883
作者: Qingwen Lin,Boyan Xu,Shifeng Xie,Zhifeng Hao,Keli Zhang,Ruichu Cai
类目: Machine Learning (cs.LG)
*备注:
Abstract:Non-autoregressive multi-step forecasting (NAF) enables time series foundation models to predict an entire future horizon in a single forward pass. Despite its strong sequence modeling capabilities, RWKV-7 exhibits long-horizon degradation in our NAF experiments. In this setup, future patches are represented as missing inputs, requiring the recurrent state to evolve across the prediction horizon without new observations. Our analysis of RWKV-7’s generalized delta rule suggests a mechanism we term Placeholder Idling Decay (PID): repeated state transitions can attenuate historical information when placeholder-driven writes provide insufficient compensation. Layer-wise analysis reveals reduced state-injection norms in most layers, while transition-matrix norms remain similar between historical and prediction regions, consistent with PID. Motivated by this analysis, we propose HART, a Hybrid Attention-RWKV Time-series Foundation Model that alternates attention and RWKV blocks, combining direct access to historical tokens with recurrent temporal modeling. Controlled experiments on GIFT-Eval and TIME-Benchmark show that HART improves over pure RWKV at medium and long horizons while maintaining comparable short-horizon performance, and achieves better aggregate performance than a comparably sized pure Transformer. With 36M parameters, HART achieves long-horizon MASE comparable to Toto-2.0-1B on GIFT-Eval (0.752 vs. 0.754), using approximately 1/28 of its parameters.
[LG-83] Robust Langevin Sampling under State-Dependent Heavy-Tailed Noise with Applications to LLM Fine-Tuning
链接: https://arxiv.org/abs/2610.12865
作者: M. Berk Sahin,Ege C. Kaya,Arda Fazla,Behzad Sharif,Abolfazl Hashemi
类目: Machine Learning (cs.LG)
*备注:
Abstract:Existing convergence guarantees for non-log-concave sampling with stochastic gradient Langevin Monte Carlo (SG-LMC) typically assume globally Lipschitz gradients and uniformly bounded noise variance. Both assumptions can fail even in elementary sampling problems, and relaxing them better reflects practical applications such as Bayesian fine-tuning of large language models (LLMs). We relax both assumptions through generalized smoothness and our proposed state-dependent heavy-tailed oracle with finite p -th moments, 1p\leq 2 . The oracle permits infinite variance when p2 and includes the Blum-Gladyshev (BG-0) condition. We study these relaxations separately and jointly, proposing three methods. Under globally Lipschitz gradients, robust LMC (R-LMC) handles the proposed oracle through geometric-median centering and residual clipping. With exact gradients, adaptive LMC (A-LMC) controls discretization error under generalized smoothness. Robust adaptive LMC (RA-LMC) addresses both relaxations through robust estimation and a noise-aware step size. For all three methods, we establish non-asymptotic convergence guarantees in Fisher information (FI) without assuming dissipativity or a functional inequality. Synthetic experiments demonstrate FI convergence and the benefit of each mechanism. Bayesian fine-tuning experiments with LLMs and vision-language models support our oracle model and show that RA-LMC matches or outperforms state-of-the-art baselines in accuracy and uncertainty quantification.
[LG-84] Reinforcement Learning via Fixed-point Flow Matching
链接: https://arxiv.org/abs/2610.12848
作者: Denis Blessing,Onur Celik,Gerhard Neumann
类目: Machine Learning (cs.LG); Robotics (cs.RO)
*备注:
Abstract:In maximum entropy and behavior-constrained reinforcement learning (RL), the optimal policy is given by a Boltzmann distribution. Generating samples from this distribution can be challenging, as it is often complex and multimodal. While flow policies trained with flow matching provide a powerful framework for representing such distributions, they traditionally rely on access to training data, which is generally unavailable in online RL. To address this limitation, we propose fixed-point flow matching (FFM), a data-free procedure for training and fine-tuning flow policies in RL. FFM leverages the target flow identity to formulate the actor update as a fixed-point iteration, utilizing a flow-matching-style regression objective where the critic’s action gradients serve as regression targets. We show that the optimal policy is a fixed point of this iteration. Through extensive experiments, we demonstrate that FFM effectively fine-tunes pretrained flow policies in the offline-to-online setting and enables efficient and accurate training of flow policies from scratch in online RL. These results establish fixed-point flow matching as a principled approach for learning expressive flow-based policies without requiring training data.
[LG-85] Cross-Behavior Policy Optimization: Unified Learning from Offline Demonstrations and On- and Off-Policy Rollouts via a Shared Regression Target
链接: https://arxiv.org/abs/2610.12830
作者: Du Cheng,Junyu Lu,Jingfan Zhang,Yuzhuo Zhang,Haoxuan Jia,Shichao Weng
类目: Machine Learning (cs.LG)
*备注:
Abstract:Reasoning post-training draws on offline demonstrations and policy-generated rollouts, yet conventional supervised fine-tuning (SFT) followed by reinforcement learning (RL) separates their objectives and limits continued reuse of collected responses. We propose \textbfCross-Behavior Policy Optimization (CBPO), which makes these sources compatible with one regression loss through a fixed-reference target. Because the generating policy does not enter this target, positive and negative offline completions, reference responses, and current and historical rollouts can share a common reward-labeled record format and replay buffer. As new responses enter the buffer, optimization retains the same regression objective without coordinating separate SFT and RL objectives or requiring stored behavior-policy probabilities, importance weighting, or a learned critic. Restricting the available sources gives offline, on-policy, and off-policy variants, while CBPO-Unified combines them. Across two model scales and four mathematical reasoning benchmarks, CBPO delivers leading \textttavg@32 and \textttpass@32 performance across benchmarks and data regimes. On Qwen3-1.7B, CBPO-Unified improves benchmark-averaged \textttavg@32 and \textttpass@32 over SFT DAPO by 2.33 and 4.44 percentage points, respectively. In the replay ablation, retaining historical rollouts improves these metrics by 1.87 and 3.72 percentage points over the no-history configuration.
[LG-86] reeHCA: Hindsight-Guided Exploration and Credit Assignment for Multi-Turn LLM Agents
链接: https://arxiv.org/abs/2610.12828
作者: Debajoy Mukherjee,Jeremy Carleton,Sushil Vemuri,Srinivas Shakkottai,Dileep Kalathil
类目: Machine Learning (cs.LG)
*备注:
Abstract:Outcome-supervised group-relative policy optimization (GRPO) assigns the same advantage to every token in an LLM agent trajectory, leaving useful and unhelpful decisions undifferentiated. Hindsight credit assignment (HCA) can refine this feedback, but its estimates rely on trajectories containing informative alternatives at consequential histories. We introduce TreeHCA, which couples hindsight-guided exploration with hindsight credit assignment. TreeHCA uses changes in reference-answer likelihood to revisit intermediate histories and sample alternative continuations, forming a tree of reasoning and tool interactions. Because this exploration changes the distribution of sampled continuations, we derive the corresponding inverse-hindsight importance correction, including an exact finite-pool identity. We use this structure in a normalized tree backup that propagates terminal outcomes into turn-level advantages. This shared hindsight structure is TreeHCA’s central design principle, linking informative exploration with hindsight-guided credit assignment. Across seven question-answering benchmarks and three Qwen backbones, TreeHCA outperforms all baselines in aggregate exact match, validating the effectiveness of paired exploration and credit assignment for multi-turn LLM agent training. Our code is available at this http URL.
[LG-87] Inverse Synthesis of Shock Time Series from Shock Response Spectra Using Ensembles of Conditional Variational Autoencoders
链接: https://arxiv.org/abs/2610.12820
作者: Adam Watts,Charles Young,Ryan Bowering,Andrew Jeon,Destry Newton
类目: Machine Learning (cs.LG); Signal Processing (eess.SP)
*备注: 28 pages, 12 figures
Abstract:The shock response spectrum (SRS) characterizes the peak responses of single-degree-of-freedom systems to transient acceleration. Because the mapping from an acceleration time series (waveform) to its SRS is many-to-one, inverse synthesis seeks candidate waveforms consistent with a prescribed spectrum. We extend an earlier conditional variational autoencoder (CVAE) framework with a recurrent decoder that predicts multiscale wavelet coefficients and reconstructs waveforms through an inverse discrete wavelet transform. Individual models exhibit limited variability under latent sampling, motivating an ensemble of independently trained models spanning different mother wavelets and decomposition levels. Each member produces a separate candidate waveform for the same target SRS. Evaluation on four held-out benchmark datasets shows lower mean and median spectral errors for the illustrated wavelet model than for the earlier direct time-domain CVAE and a sum-of-decayed-sinusoids (SDS) baseline. A conditioning study examines frequency-grid and encoding choices. Comparisons with published inverse-SRS methods demonstrate superior performance across four holdout benchmark datasets (two operational shock datasets, one earthquake dataset, and one synthetic shock dataset) and competitive performance on synthetic targets reported by Brake. Single-model inference requires approximately 0.1-0.6 ms per waveform during batched inference compared with 5-8 s for SDS, excluding offline training. This low inference cost enables rapid generation of distinct SRS-compatible candidate waveforms across the ensemble, although their physical suitability requires assessment beyond spectral agreement.
[LG-88] Deploying RDMA for Large-Scale Inference and Training Workloads
链接: https://arxiv.org/abs/2610.12815
作者: Yibo Huang,Yi Cui,Yukai Huang,Huaping Zhou,Jiancong Tong,Zhaoyu Wu,Gen Miao,Haoran Wei,Boyan Ding,Zhuo Jiang,Jianxi Ye,Yibo Zhu,Chuanxiong Guo,Yang Xu,Jie Wu
类目: Machine Learning (cs.LG); Distributed, Parallel, and Cluster Computing (cs.DC); Networking and Internet Architecture (cs.NI); Systems and Control (eess.SY)
*备注: 14 pages, 16 figures
Abstract:RDMA can reduce communication overhead in distributed machine learning systems, but realizing these benefits in production requires more than replacing TCP. Variable-size messages, concurrent connections, bursty incasts, and service failures introduce challenges that hardware offload alone cannot address. This paper reports our experience deploying ByteExpress, a software communication layer over hardware RDMA, in ByteDance’s parameter-server-based inference and training systems. We present three lessons from the deployment: efficient RDMA requires buffer management across application and transport layers; scalable communication requires coordinated management of connections, receive capacity, and outstanding data; and service availability requires recovery above the transport layer. ByteExpress combines an RDMA-aware allocator, zero-copy transfers, QP multiplexing, receive-credit flow control, a software send window, and RPC-assisted recovery. In production inference, ByteExpress reduces mean and P99 model parameter fetch latency by 35.7% and 43.7%, respectively, and total CPU usage by 10.69% compared with kernel TCP. In training, ByteExpress reduces P99 model parameter push latency by up to 74.0% compared with TCP, with no PFC pauses observed at runtime.
[LG-89] he Expressive Power of Random-Feature MPNNs Across Graph Sizes
链接: https://arxiv.org/abs/2610.12809
作者: Robert R. Nerem,Mitchell Black,Antonis Vasileiou,Christopher Morris,Yusu Wang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Continuous random node features increase the expressivity of message-passing neural networks (MPNNs), but existing theoretical analyses are not fine-grained enough to capture their limitations, particularly in approximating functions across graph sizes or under a fixed number of random bits. We develop a population-level framework for size-uniform approximation. For MPNNs with a graph-size-independent Lipschitz bound in their initial features, including standard mean, max, and order-normalized sum architectures, we show that continuous random features can be quantized to finitely many colors with arbitrarily small uniform error in expected output. This reduction lets us transfer limitations on finite-color distinguishability to limitations on size-uniform approximation with continuous random features. We use this framework to prove that these MPNNs are not size-uniformly universal, analyze the expressivity gains from colors and independent trials, and establish incomparability between random-color MPNNs and higher-order Weisfeiler-Leman methods. We also give finite-color MPNN constructions for tree subgraph isomorphism via color coding and a local MST task.
[LG-90] Coordinate-Free Automatic Differentiation
链接: https://arxiv.org/abs/2610.12776
作者: Alex Guerra,Joshua Aduol,Yaqian Tang,Daniel Williams,Ryan P. Adams,Peter Orbanz
类目: Machine Learning (cs.LG); Mathematical Software (cs.MS); Differential Geometry (math.DG)
*备注: 34 pages, 18 figures
Abstract:Automatic differentiation (AD) is a cornerstone of modern machine learning. Since all AD frameworks implicitly fix a basis of Euclidean space to define gradients and Jacobians, they natively process mathematical objects that are arrays of a fixed set of coordinates. This makes it awkward to express objects such as rotations, volume forms, and curvatures that arise, for example, in applications of AI to science. Bespoke workarounds lack reusability. We show that (i) a single, basis-independent derivative operator can represent many geometric differential operations, and (ii) this operator can be expressed entirely in terms of existing AD primitives. This reusable transformation can be composed with JAX batching, compilation, and hardware acceleration. Geometry enters as algebraic data. We experimentally demonstrate its reuse across different manifold operators, its composition through a spacetime inverse-problem pipeline, and its use in optimization over different rotor subgroups.
[LG-91] Credit Attribution in Timestamped Soccer Networks Using Multivariate Hawkes Processes
链接: https://arxiv.org/abs/2610.12775
作者: Phillip W. Kornberg,Kevin S. Xu
类目: ocial and Information Networks (cs.SI); Machine Learning (cs.LG); Physics and Society (physics.soc-ph); Applications (stat.AP)
*备注:
Abstract:The two main traditional player statistics used in soccer are goals scored and assists, with an assist credited when a player’s pass immediately leads to a teammate scoring. Attributing credit solely to the player who makes the final pass before a goal fails to account for the contributions of multiple players in the buildup to the goal. Consequently, traditional statistics provide only a limited view of player involvement. In this paper, we use multivariate Hawkes processes (MHPs) to model timestamped sequences of passes and shots, which form continuous-time networks. MHPs provide a branching mechanism where an event (a pass or shot) can be generated as a child of a previous event, which allows us to quantify each pass’s contribution to a subsequent pass or shot. This approach distributes credit across multiple passes within an attacking sequence, making it applicable across a wide range of situations. Building on this framework, we propose expected goal involvements (xGI), a metric that measures a player’s involvement in creating goal scoring opportunities based on their passes. This metric identifies players who play key roles in creating goal scoring opportunities even if they do not make the final pass, offering a more comprehensive measure of attacking involvement and player performance.
[LG-92] Provenance-grouped protocol for evaluating machine learning in perovskite photovoltaics
链接: https://arxiv.org/abs/2610.12766
作者: Qiwei Han,Chi Zhou
类目: Machine Learning (cs.LG)
*备注: perovskite solar cells, provenance-grouped protocol, state of art, benchmark
Abstract:Machine-learning models for perovskite solar cells are typically evaluated using random data splits, which we show systematically leak information through massive internal duplication. Because nearly two-thirds of curated devices share their exact recipe with another, random splits primarily reward the mere recall of historical data rather than testing true physical generalisation. To solve this, we mapped the institutional provenance of the Perovskite Database and established a rigorous hierarchy of grouped splits that progressively isolate duplicate devices, publications, and institutions. Benchmarking thirteen models establishes new state-of-the-art performance across all splits and reveals a critical regime shift: while tree ensembles dominate random splits by recognising familiar recipes, their ranking collapses on genuinely unseen institutions and future discoveries, where composition-aware neural architectures excel. Furthermore, feature importance demonstrates that the device architecture and fabrication methodology dictate final efficiency just as strongly as the absorber chemistry. This standardised protocol empowers the community to separate memorisation from true physical discovery.
[LG-93] NV-Tesseract-AD: Curriculum-Enhanced Conditional Diffusion for Multivariate Time-Series Anomaly Detection
链接: https://arxiv.org/abs/2610.12754
作者: Aditi Gautam,Manikandan Ravikiran,Saira Qureshi,Sena Fatma Ekiz,Charan Jagwani,Mahmoud Elhadidy,Sanjeev Roka
类目: Machine Learning (cs.LG)
*备注:
Abstract:We propose NV-Tesseract-AD, a curriculum learning-enhanced conditional diffusion framework for multivariate time-series anomaly detection. Our central hypothesis is that reconstruction difficulty can be explicitly structured along two complementary axes, masking severity and diffusion noise level, and that training from easier to harder tasks along both axes simultaneously stabilizes optimization and improves residual discriminability. We integrate a Transformer-based diffusion backbone with a three-stage dual curriculum over masking ratios and diffusion timesteps, retaining anomalous samples throughout training and relying on structured corruption to drive self-supervised representation learning. We evaluate NV-Tesseract-AD under two regimes: in-distribution training on the TSB-UAD-M corpus and strict zero-shot transfer to ten EasyTSAD benchmark families without per-dataset tuning. The dual-axis curriculum produces masking-invariant reconstruction, confirmed by a near-zero loss gap between complementary masking strategies within the first training stage, and yields an approximately 3.7-fold improvement in F1 and a 56 percent reduction in MSE relative to a non-curriculum baseline. Zero-shot performance reaches F1 = 0.984 on NAB and F1 = 0.948 on NormA. Weaker results on heterogeneous families are traced to unsupervised threshold calibration rather than reconstruction quality, identifying calibration as the dominant remaining detection bottleneck. Accelerated inference via DPM-Solver++ reduces sampling cost by a factor of 3.5 to 5.7 at the dataset level but couples to thresholding behavior, establishing that the sampler and threshold must be validated jointly. Together, these findings demonstrate that aligning diffusion denoising difficulty with curriculum learning principles provides a principled and practical approach for robust anomaly detection in complex multivariate time series.
[LG-94] Static Gradient Attribution Underperforms a Density-Matched Random Mask on Loss-Based Forgetting Within LoRA B-Matrix
链接: https://arxiv.org/abs/2610.12744
作者: Yu Sun,Junwei Zhou,Zuodong Xiang,Yike Zhang,Pengcheng Xu,Xinyu Guan,Ruoyun Ma,Hailu Xu
类目: Machine Learning (cs.LG)
*备注:
Abstract:Parameter-efficient continual learning updates a restricted subset of adapter parameters to incorporate sequential tasks while limiting catastrophic forgetting. Gradient attribution is a common rule for selecting that subset, but it requires an additional backward pass over calibration data. We identify a parameter-pool confound in comparisons between initialization-time gradient masks and unrestricted random masks under standard zero-initialized LoRA ( B=0 ): the gradient with respect to A is identically zero ( \partial\mathcalL/\partial A=0 ), so gradient masks select strictly from the B matrix whereas unrestricted random masks draw from both A and B . Such a comparison changes both the selection rule and the candidate parameter pool. Isolating the selection criterion by restricting both approaches to the same parameter pool, we find a negative result: a uniform random mask consistently achieves lower loss-based backward transfer than gradient attribution across seven seeds on Qwen2.5-3B. The effect is concentrated on the medical task, which contributes 80% of the aggregate; code and math move in the same direction, and legal shows no reliable difference. This advantage is consistent with a stability–plasticity trade-off under the tested task sequence, in which random masking slightly reduces single-task fitting. On the two discrete-option tasks (Medical and Legal), the mean accuracy-BWT difference is not statistically distinguishable from zero.
[LG-95] Neural expectation-maximization and meta-models
链接: https://arxiv.org/abs/2610.12741
作者: Zhuolin Fu
类目: Machine Learning (cs.LG)
*备注:
Abstract:We interpret Transformer networks as learned approximations to a hybrid probabilistic-inference procedure that combines max-product Loopy Belief Propagation (LBP) with Expectation–Maximization (EM). In this view, a Transformer performs inference in partially observed Markov Random Fields (MRFs) whose structure and parameters are not given a priori but are inferred from data. We show that self-attention implements a differentiable approximation to max-product LBP on an input-conditioned, dynamically structured MRF, with attention weights encoding learned structural affinities. We further establish an EM correspondence at the level of depth: each layer updates latent representations in an E-step-like forward pass, while the transition \theta^(l) \to \theta^(l+1) across layers acts as an implicit M-step. Building on this interpretation, we introduce \emphmeta-models, a design paradigm in which inputs generate instance-specific parameters, unifying mechanisms such as self-attention, mixture-of-experts, and gated units within a single framework. Empirical results support the proposed perspective.
[LG-96] A Categorical Atlas of Parameter-Efficient Fine-Tuning: Cones Orbits and Gauges
链接: https://arxiv.org/abs/2610.12728
作者: Xiaoyu Li,Zhizhou Sha,Chiwun Yang,Dai Shi
类目: Machine Learning (cs.LG)
*备注:
Abstract:Parameter-efficient fine-tuning has hundreds of methods, usually compared by parameter count and benchmark score. We compare them as maps. A pretrained checkpoint is a base point in weight space, and a weight-space method is a smooth map from a small parameter space that starts at that point. These maps form a slice category in which the frozen model is initial and full fine-tuning terminal. Three invariants of the map do most of the work. Its image near the base point governs expressivity, through the first-order image, the dimension, a min-cut bound on rank and whether that point is smooth or an apex. Its fibres, with the optimizer’s metric, govern training dynamics. Base change moves the base point and covers splitting initialisations, quantisation, restarts and merging. We prove, for example, that zero-initialised LoRA, and Householder reflection adaptation at its default start under stated rank and parity conditions, begin at the apex of a cone; that no exact initialisation lets LoRA reach an update of rank above twice its own; that exactly orthogonal methods never change a weight’s singular values in exact arithmetic, however often they are merged; that under Adam with no epsilon, weight decay or clipping and one shared schedule, LoRA+ from the standard zero initialisation follows exactly the trajectory of plain LoRA with its scale multiplied by the learning-rate ratio; that Adam with shared hyperparameters respects only the signed permutations inside LoRA’s continuous symmetry group of full-rank factors; and that the activation function decides when a scaling adapter folds into preceding weights. We classify 382 methods from 138 papers by seven coordinates read off their formulas, with 403 simulation arrows and 485 obstructions. Every numbered result is proved in full, and results due to others are credited where we re-derive them.
[LG-97] Spatial Context or Memory? Sizing the Inputs of Neural Surrogates for Partially Observed Fields
链接: https://arxiv.org/abs/2610.12723
作者: Ruige Kong
类目: Machine Learning (cs.LG)
*备注: 26 pages, 11 figures, 8 tables. Code: this https URL
Abstract:Neural surrogates that forecast a physical field from sparse, noisy sensors read a window of nearby sensors and a history of past snapshots. Practitioners choose both by comparing fitted models with each other. Such comparisons cannot tell a model’s shortfall from missing information. We measure the trade-off between window and history against the Bayes-optimal error of the same readings. An exact Gaussian analysis shows that noisy or sparse observation of a field with local dynamics makes the optimal forecast read distant sensors only through spatial correlation. On a forced linear field with a known optimum, trained models that read only the window come within 1% of it. We then train such models on viscous Burgers flow and the chaotic Kuramoto-Sivashinsky (KS) equation, with every deciding comparison fixed before any test evaluation. In every field except KS, eight snapshots remove a smaller fraction of the one-snapshot error as the lead time, the number of steps to the forecast target, grows. In KS, for windows up to one correlation length, they remove a larger fraction. This lead-time inversion persists across sensor densities, three architectures and a two-dimensional domain. It shrinks as damping lowers the Lyapunov exponent. Damping also removes the linear instability of KS. We therefore tie the inversion to instability and leave chaos and linear amplification unseparated. For surrogate design the results give two rules. Size the window in correlation lengths of the field. Split a fixed input budget between window and history for the lead time the model will serve, because the best split moves toward wider windows as the lead time grows. In Burgers flow the split chosen at lead time one ends with 13.5 times the best error at lead time eight.
[LG-98] Byzantine-Resilient Federated Large Language Model via Hypergraph Message Passing
链接: https://arxiv.org/abs/2610.12711
作者: Kai Li,Hanlin Cai,Zihao Liu,Yichen Li,Jose Alcaraz Calero,Wei Ni,Falko Dressler,Özgür B. Akan
类目: Machine Learning (cs.LG); Cryptography and Security (cs.CR)
*备注:
Abstract:Federated Large Language Models (FedLLMs) are promising to deliver privacy-preserving, collaborative intelligence. The decentralized training process is vulnerable to Byzantine attacks that corrupt semantic consistency and factual resilience through malicious model updates. This paper presents a new resilience strategy that prevents semantically corrupted knowledge from propagating during federated aggregation. A defense problem is formulated to jointly maximize global accuracy and suppress manipulated model updates, enabling trustworthy knowledge aggregation without accessing private local data. To strengthen the resilience of FedLLMs, we develop a novel Hypergraph Message Passing Graph Autoencoder (HMP-GAE) framework, where low-rank model updates are represented as nodes in a hypergraph and high-order semantic relationships among multiple agents are exploited through iterative message passing. By leveraging historical checkpoints and cross-agent relational reasoning, HMP-GAE identifies and suppresses semantically inconsistent updates while preserving knowledge alignment among agents throughout federated training. HMP-GAE is implemented using Qwen-2.5 and Llama-3.2 as pretrained FedLLM backbones and evaluated on AG News and Yahoo! Answers datasets. Compared to existing defenses, HMP-GAE improves global accuracy by 1.21 %, reduces final-model classification semantic entropy by 44.08 %, and lowers perplexity by 13.34 %. HMP-GAE outperforms the GAE-based defense by improving the accuracy 1.39 %, reducing the semantic entropy by 54.5 %, and lowering perplexity by 35.5 %.
[LG-99] PVBRF-ID: Private Verifiable and Byzantine-Robust Federated Intrusion Detection for Oilfield Enterprise Networks
链接: https://arxiv.org/abs/2610.12704
作者: Mustafa S. Aljumaily,Ali Ataeemh Allami,Mustafa N. Mnati,Nawar S. Alseelawi,Shahab Abdulla
类目: Cryptography and Security (cs.CR); Machine Learning (cs.LG)
*备注: 19 pages, 5 figures, 5 tables, 3 supplementary tables. Simulation study on public Edge-IIoTset traffic; code and raw results: this https URL
Abstract:Federated learning allows dispersed oilfield sites to train a shared intrusion detector without pooling network traffic, yet its aggregation step forces a choice between privacy and robustness. Byzantine-robust rules must read each update in the clear, whereas secure aggregation hides updates from the checks that detect poisoning. We present PVBRF-ID, a two-server protocol in which sites secret-share their updates and the servers jointly test each update’s norm and its cosine similarity to a reference computed on a small clean root set, revealing one accept bit per site. Commitments, Merkle roots and a homomorphic audit make the inclusion of accepted updates publicly verifiable. On a 15-class Edge-IIoTset task with ten sites holding differently distributed data and ten random seeds, PVBRF-ID matched FedAvg on clean data (macro-F1 0.708 vs. 0.706) and withstood sign-flip attacks (0.696 vs. 0.091). Against an adaptive attacker controlling 30% of sites, PVBRF-ID with secure clipping reached 0.641, whereas FedAvg fell to 0.046; plaintext multi-Krum remained higher by 0.052. An update-inference attacker recovered each site’s class mix from plaintext updates (Spearman correlation 0.81) but not from one server’s view. Backdoors passed the filter, and noise-based mitigation gave only heuristic protection. The implementation uses Python 3.13, NumPy 2.3, 30 rounds and 10 seeds.
[LG-100] Primal-Dual Flow Matching for Sample-Wise Constrained Generation NEURIPS2026
链接: https://arxiv.org/abs/2610.12699
作者: Zhengyan Huan,Peter Y. Lu,Shuchin Aeron
类目: Machine Learning (cs.LG)
*备注: Accepted at NeurIPS 2026
Abstract:We consider the problem of learning to generate data while satisfying a prescribed \emphsample-wise constraint with a user-specified probability of constraint satisfaction. Starting with a population-level constrained negative log-likelihood minimization and using a flow-matching (FM) parameterization, under regularity assumptions and sufficient expressivity of the velocity field family, we derive guarantees on the probability of constraint satisfaction for the corresponding primal-dual optimization algorithm. We provide a practical implementation of this approach, called Primal-Dual Flow Matching (PDFM), which has direct control over constraint satisfaction rate and requires only binary membership oracle feedback for constraint satisfaction, avoiding the need for differentiable distances, projections, or special structure of the constraint set, such as convexity. We show that PDFM improves constraint satisfaction over vanilla FM and achieves competitive performance against constraint-aware baselines while maintaining distributional fidelity. Our code is available at this https URL.
[LG-101] Critical Mass: Structure-Disjoint Splits Drift With the Libraries They Are Built On NEURIPS2026
链接: https://arxiv.org/abs/2610.12694
作者: Tomo Oga,Devesh Shah,Cailum M. K. Stienstra,Gabriel Asher,Antonio H. de O. Fonseca,Niall O’Connor,Michael Widrich
类目: Machine Learning (cs.LG); Computational Engineering, Finance, and Science (cs.CE)
*备注: Accepted at 40th Conference on Neural Information Processing Systems (NeurIPS 2026). Workshop: AI Data Readiness for Scientific Discovery
Abstract:Molecular machine learning evaluates out-of-distribution performance with structure disjoint splits, a construction rule fixed once at the scale its library happened to have: threshold a pairwise distance, then assign whole connected components to folds. For predicting structures from mass spectra, the field has converged on single-linkage clustering under the myopic Maximum Common Edge Subgraph (MCES) distance at a threshold of 10. This convention was set on 29,000 molecules but public libraries now hold 227,690 molecules. MCES is NP-hard per pair over a quadratically growing set, and so the criterion has never been evaluated at that scale. We propose an optimized version of this criterion, allowing for computationally feasible application on the public libraries: Admissible bounds and a union-find skip reduce 2.6 \times 10^10 molecular pairs to only 1.15 \times 10^7 integer programs, a 2,259\times saving, while provably producing the lossless partition. We find that at this scale the graph percolates. A single component holds 95.5% of the library, capping any test set at 4.5% . What remains is not merely smaller, but systematically different: a held-out compound outweighs a training compound 88.1% of the time, because a fixed absolute budget is a tighter relative tolerance on a larger molecule. Large library benchmarks using this splitting rule naively therefore conflate structural novelty with extrapolation to larger, more complex chemistry.
[LG-102] Expert-level detection of low-voltage intervals in EEG as a robust biomarker of neonatal encephalopathy
链接: https://arxiv.org/abs/2610.12680
作者: John M. O’Toole,Sean R. Mathieson,Aurel Luca,Soraia Ventura,Sean Griffin,Geraldine B. Boylan,Robert Hogan
类目: Machine Learning (cs.LG); Signal Processing (eess.SP); Medical Physics (physics.med-ph)
*备注: 22 pages, 8 figures, and 9 tables including the appendix. Under review
Abstract:Background: Discontinuity in neonatal EEG is a critical marker of brain dysfunction but can be difficult to quantify visually. Inter-burst intervals (IBIs) are a key characteristic of discontinuity, yet their definition does not easily translate to AI detection. Objectives: To introduce low-voltage intervals (LVIs), defined exclusively by amplitude and duration, as a context-independent alternative to IBIs, develop an AI detection method for LVIs, and assess their clinical utility as a marker of brain injury. Methods: We developed a ConvNeXt model to detect LVIs and compared its performance with existing methods. We then tested the clinical relevance of detected LVIs across four applications: 1) grading background EEG abnormalities on an open benchmark dataset, 2) classifying clinical hypoxic-ischaemic encephalopathy (HIE) grades and comparing with a normal EEG dataset, 3) seizure prediction, and 4) association with seizure burden. Results: For training and validation, 654 hours of per-channel EEG from 123 neonates were reviewed and 51,162 LVIs were annotated. On held-out validation, ConvNeXt had an AUC of 0.996 and a Matthews correlation coefficient of 0.926. Model-reader agreement exceeded inter-reader agreement ( \Delta \kappa = 0.025 , 95% CI: 0.007 to 0.045, p0.001 ), attaining expert-level equivalence. On a combined dataset of 444 neonates, percentage LVI showed a strong association with EEG grades (Spearman’s \rho=0.801 ), a moderate association with HIE grades ( \rho=0.384 ), a weaker association with seizure burden ( \rho=0.244 ), and a strong seizure prediction capacity (AUC =0.872 ). Conclusion: AI detection of LVIs achieves expert-level equivalence, whereas quantitative features do not. Automated LVI quantification provides a robust clinical biomarker of neonatal encephalopathy associated with background EEG activity, HIE severity, and seizure risk.
[LG-103] Amortised Inference through One-Step Implicit Sampling
链接: https://arxiv.org/abs/2610.12679
作者: Vincent Pauline,Kirill Tamogashev,Arran Carter,Sanghyeok Choi,Stefan Bauer,Esmeralda S. Whitammer
类目: Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Efficient sampling from Bayesian posterior distributions in high dimensions remains a hard problem, despite advances in theory and algorithms. Multiple steps are usually required to draw unbiased samples, for example, iterations of an MCMC algorithm or integration steps in a diffusion-based amortised sampler. However, scalable one-step amortised inference remains a challenging open problem. In this work, we build upon recent progress in data-driven generative modelling to offer a possible solution for one-step amortised sampling. Our one-step implicit sampler (OSIS) uses short-time MCMC dynamics to define a local target for the evolution of an implicitly modelled distribution. In the asymptotic limit, the modelled distribution is a fixed point of the MCMC kernel and thus samples from the target. We analyse the convergence properties of OSIS and show connections with other generative modelling and sampling algorithms. We study various design choices and show that OSIS performs well compared to multi-step amortised samplers and non-amortised MCMC baselines while being far more efficient at sampling time.
[LG-104] Data-driven Optimal Sensor Placement for Aerosol Monitoring in the UK
链接: https://arxiv.org/abs/2610.12658
作者: Talha Ansar(1),Waqar Muhammad Ashraf(2),Alejandro Coca-Castro(2),Manvendra Janmaijaya(2),Ramit Debnath(3),J. Scott Hosking(2) ((1) University of Engineering and Technology, Lahore, Pakistan, (2) The Alan Turing Institute, London, UK, (3) University of Cambridge, Cambridge, UK)
类目: Machine Learning (cs.LG)
*备注:
Abstract:We develop a data-driven sensor-placement framework and apply it to aerosol monitoring in the United Kingdom (UK). A trained convolutional Gaussian neural process is embedded within the DeepSensor optimisation framework. Genetic optimisation with lazy evaluation and caching reduces mean computational time by 60% (10 \pm 3 versus 25 \pm 7 minutes) while producing sequential placement performance comparable to the greedy solver. Using the CAMS reference field to construct a retrospective oracle benchmark, Joint NLL improves by about 22% for Joint-MI-driven genetic placement after five locations for aerosol stations are identified. Seasonal and wind-regime analyses show that agreement between model-based criteria and oracle benchmarks varies with meteorological transport conditions. These results show a computationally efficient approach for data-informed expansion of environmental observing systems.
[LG-105] SynAct: Synergistic Active Feedback Learning for LLM Agents
链接: https://arxiv.org/abs/2610.12651
作者: Ning Liu,Ian Li,Kristina Klinkner
类目: Machine Learning (cs.LG)
*备注:
Abstract:LLM agents executing multi-step workflows fail in two fundamentally different ways: recoverable slips, which further attempts can repair, and knowledge gaps, which retrying cannot resolve. Expert feedback can address the latter, but expert attention is scarce. The key challenge is therefore not whether to ask for feedback, but where feedback can change the outcome. Existing approaches either avoid expert feedback, allowing agents to reinforce their own errors, or allocate feedback at the task level without identifying consequential decisions. We present SynAct, an active learning framework that treats expert attention as the binding constraint and allocates feedback at the level of individual decisions. SynAct ranks decisions by the mutual information between the selected action and the terminal outcome across repeated rollouts, queries an expert at the highest-value decisions, and distills the resulting corrections into transferable rules that the agent can reuse without expert access at deployment. We theoretically characterize what this signal identifies under finite repeated sampling: with k rollouts and at least m observations per action, outcome-constant decisions have zero mutual information, while outcome-separating decisions have mutual information at least H2(m/k) bits, yielding exact separation for any threshold t in (0,H2(m/k)). This also explains why success-based acquisition can be blind when all rollouts fail: success is constant even when failed runs reach different outcomes. Across four agent benchmarks and four models spanning three families, SynAct improves held-out accuracy in all 16 evaluated settings, by +11.7pp on average. The same signal transfers to inference-time routing, where SynAct outperforms budget-matched cascade, uncertainty, and expert-judge routers in 15 of 16 settings, while a single targeted correction outperforms seven additional unaimed retries.
[LG-106] STAPLE: Static Sparse Upcycling of Pretrained Checkpoints via Embedding Modules
链接: https://arxiv.org/abs/2610.12599
作者: Ranajoy Sadhukhan,Euijin Hong,Sheng Cao,Zechun Liu,Shuowei Jin,Sha Li,Changlong Yu,Xin Liu,Qin Lu,Zhenyu Shi,Priyanka Nigam,Beidi Chen
类目: Machine Learning (cs.LG)
*备注:
Abstract:Sparse computation can scale the parametric capacity of LLMs without proportionally increasing active computation, but pretraining sparse architectures remains expensive and data-hungry. Existing sparse upcycling methods mainly target Mixture-of-Experts models, where expert homogeneity, sample inefficiency, and system overheads can limit practical scalability. Static sparse memory offers predictable access and token-specific updates that can help address these challenges, but naively integrating it into pretrained computation yields poor returns. In this work, we introduce STAPLE, a recipe built upon STEM for integrating static sparse memory into pretrained models. Whereas STEM replaces FFN up-projections with token-indexed embeddings, STAPLE retains them and adds the embeddings as a residual pathway, preserving pretrained computation while learning complementary token-specific information in a scalable manner. On OLMo-2 1B, STAPLE improves over continued dense training by 4.27 points on HumanEval, 2.80 on MBPP, 2.27 on GSM8K, and 1.65 on DROP. Average performance increases with static capacity, and improvements persist on the larger OLMo-2 7B backbone. STAPLE also outperforms static sparse baselines such as STEM and an Engram-style model, and achieves a higher average score than an MoE upcycling baseline while decoding 2x faster with less than half its GPU model memory and measured GPU energy per token in our throughput-oriented decoding evaluation. Importantly, despite introducing billions of parameters late in training, our host-offloaded implementation keeps generation throughput within 1.5% and training throughput within 3% of the dense baseline, while caching only the ~5% most frequent embeddings on GPU. These results show that static sparse memory can provide a sample-efficient, scalable, and sustainable path for expanding pretrained models without sparse pretraining from scratch.
[LG-107] Realism VS Accuracy: Event Sequence Forecasting from a Generative Modeling Perspective NEURIPS2026
链接: https://arxiv.org/abs/2610.12586
作者: Dmitry Osin,Egor Surkov,Petr Mokrov,Igor Udovichenko,Ivan Karpukhin,Evgeny Burnaev,Egor Shvetsov,Alexander Korotin
类目: Machine Learning (cs.LG)
*备注: Spotlight at the NeurIPS 2026 Track on Evaluations and Datasets. Code: this https URL
Abstract:Event sequences are chains of random events, each described by heterogeneous (numerical and categorical) features. The problem of event sequence forecasting occurs in finance, healthcare, business process intelligence, and other fields. In this work, we study multi-horizon forecasting of event sequences as a conditional generative modeling problem. We evaluate forecasts not only for prediction accuracy, but also for distributional realism. To this end, we present a benchmark comprising metrics for both quality aspects, strong statistical baselines, recent models adapted from adjacent fields, and curated real-world datasets. Careful evaluation reveals that no method excels at both accuracy and realism, highlighting a fundamental trade-off between the two. Finally, we introduce Wasserstein BaryBooster, an algorithm that aggregates samples from a realism-strong diffusion model into a state-of-the-art predictor, demonstrating that distributional realism can be converted into prediction accuracy. Code is available at this https URL.
[LG-108] DiffusionART: Efficient Stable and Scalable Reinforcement of Diffusion Models
链接: https://arxiv.org/abs/2610.12572
作者: Zhenglin Wan,Jiayu Chen,Zhengfeiyang Zhang,Pengfei Zhou,Wangbo Zhao,Fangyuan Kong,Pengfei Wan,Kun Gai,Yang You
类目: Machine Learning (cs.LG)
*备注: Project page: this https URL ; Code: this https URL
Abstract:Online reinforcement learning (RL) fine-tunes diffusion models with black-box rewards, but reverse-process methods such as Flow-GRPO are limited in efficiency by poor credit assignment, while forward-process methods such as DiffusionNFT are efficient yet unstable without carefully tuned exponential-moving-average (EMA) off-policy training. We show that NFT-style objectives contain a hidden forward–reverse consistency force that joint positive–negative training cancels only partially, and that EMA stabilizes training through restoration rather than off-policy rollouts. We introduce DiffusionART (Diffusion Reinforcement with Aggregation-First Reward Tilting), which aggregates each prompt’s rewards into a shared reward-improving direction for reverse-process states, removing the consistency force by construction, and adds a trust-region-masked second update for drift-adaptive restoration without EMA tuning. It requires no differentiable reward model, remains effective with fewer samples per prompt, and supports pairwise reward models (DiffusionART-Pairwise). Across image and video generation, DiffusionART trains efficiently and stably without per-task tuning. In particular, on HunyuanVideo-13B with equally weighted visual and motion quality rewards, DiffusionART reaches the late-stage mean reward levels of DiffusionNFT and Flow-GRPO-Fast with 12.02 and 11.72 times fewer GPU hours, respectively, while achieving 28.8% and 53.0% higher mean training rewards.
[LG-109] An all-transistor physical-learning transformer can be trained to perform in-context learning
链接: https://arxiv.org/abs/2610.12571
作者: Michael C. Abbott,Benjamin B. Machta
类目: Machine Learning (cs.LG); Soft Condensed Matter (cond-mat.soft)
*备注: 18 pages, 11 figures, plus appendices
Abstract:Most systems trained by equilibrium propagation or coupled learning are in the same class as multi-layer perceptrons: while they may be universal function approximators, they struggle to learn associative tasks which are easy for transformers. Equilibrium propagation relies on a bidirectional flow of information through the physical system between input and output. The reverse flow is broken by more complex nonlinear systems, such as those performing multiplication which is needed to express dot-product attention. Here we explicitly restore this bidirectional flow by introducing extra circuit elements for this purpose into a double or dyadic circuit. We then use these ideas to construct an attention mechanism exploiting the exponential current law of sub-threshold MOSFET devices. We show that in simulations this circuit can be trained to perform a simple in-context learning task, despite using realistic reverse components which transmit only an approximate gradient. For this training to succeed we need cross-entropy loss (not mean squared error). We generate nudges appropriate for this loss using a novel floating circuit element, based on the same MOSFET sub-circuit used for softmax. We train the resistors in this circuit using the Lion optimiser, which can be implemented using one capacitor per parameter to store local memory of past gradient estimates.
[LG-110] Sample-Adaptive Zeroth-Order Post-Training
链接: https://arxiv.org/abs/2610.12566
作者: Haiyuan Wan,Yanyi Li,Weicheng Lin,Cong Fang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Zeroth-order (ZO) optimization offers a memory-efficient alternative to backpropagation for fine-tuning large language models. However, existing ZO methods typically sample training examples uniformly, overlooking their evolving importance and leaving avoidable estimation variance. To address this limitation, we propose Sample-Adaptive Zeroth-Order Optimization (SAZO), which learns sample importance online and adaptively allocates queries to accelerate convergence. SAZO extracts gradient-norm information from existing directional differences to estimate sample importance without access to true gradients. Furthermore, to track evolving importance from sparse minibatch feedback, SAZO maintains per-example exponential moving averages that aggregate observations across updates. The method requires no additional model evaluations and only O(N) additional scalar state compared with MeZO. We prove that SAZO asymptotically matches the leading convergence term of the minimum-variance sampling oracle, and achieves a strictly faster convergence rate than standard methods. Extensive experiments across four model families demonstrate improved average downstream performance and up to 6\times faster convergence to the same training loss in terms of query count.
[LG-111] ransformer-Based Masked Diffusion Models Provably Learn Distributions with Latent Structure
链接: https://arxiv.org/abs/2610.12544
作者: Jingda Wu,Changxiao Cai
类目: Machine Learning (cs.LG); Information Theory (cs.IT); Statistics Theory (math.ST); Machine Learning (stat.ML)
*备注:
Abstract:Masked diffusion models (MDMs) generate discrete data by iteratively unmasking multiple tokens in parallel using a learned mask predictor. Their output carries two errors: parallelization error due to parallel sampling, and estimation error from the mask predictor learned with finite samples. Existing theory treats these errors separately, and the available statistical bounds typically scale with the number V^L of length- L sequences over a vocabulary of size V , suffering from the curse of dimensionality. In this work, we establish end-to-end statistical guarantees showing that transformer-based MDMs learn structured distributions with a sample complexity governed by their latent structure. Specifically, we model this structure through mixtures of hidden Markov trees, which capture latent dependencies within components and heterogeneity across components. When the data distribution is well approximated by such a mixture, a transformer-based MDM with parallel unmasking schedules achieves \varepsilon -accurate sampling in KL divergence with \widetildeO(LK_\mathrmpar/\varepsilon) training samples, where K_\mathrmpar is polynomial in L , V , the number of hidden states, and the number of mixture components. The transformer network and sampling procedure require no knowledge of the tree topologies or component parameters, thereby adapting to the unknown latent structure automatically. Overall, our results provide theoretical justification for the empirical effectiveness of MDMs on real-world data.
[LG-112] Enriched Holomorphic Neural Networks for 2D and 3D Laplace Problems
链接: https://arxiv.org/abs/2610.12541
作者: Kalp Shah,Andrei Vlad Nicula,Mihnea Andrei Bârsan,Robert-Stefan Sofroni,Agneya Bhardwaj,Jan Jelínek,Alejandro Valverde Mahou
类目: Machine Learning (cs.LG)
*备注:
Abstract:Boundary-value problems for the Laplace equation develop singular behaviour near corners, edges and junctions that smooth approximators resolve poorly. We combine holomorphic neural networks with singular functions derived from the local geometry and boundary conditions. The representation is harmonic by construction, so no interior residual is needed: the network fits the smooth remainder from boundary data alone, and the enrichment terms capture the singular behaviour. Singular exponents are trainable, so the construction also applies when the local expansion is not known in advance. We extend the approach to three dimensions using independent networks evaluated along complex null directions. The enriched model is the most accurate tested method on every problem. Its margin is several orders of magnitude where the enrichment captures the singularity exactly, and a factor of about 1.7-2.1 over the next-best method on a CdZnTe radiation detector with many singular sites, in both two and three dimensions.
[LG-113] Efficient Learning of Survival Analysis Models Under Outcome-Dependent Truncation and Censoring
链接: https://arxiv.org/abs/2610.12538
作者: Itai Zilberstein,Ioannis Anagnostides,Arman Kilic,Tuomas Sandholm
类目: Machine Learning (cs.LG)
*备注:
Abstract:Modern machine learning models are typically trained on data assumed to be representative of the predictive tasks the model will face in the future, but practical datasets violate this assumption. We focus on outcome-dependent truncation in which an observation appears in the training data depending on its label. Our work connects two largely distinct literatures: efficient learning under truncation and survival analysis. Existing methods for truncated survival analysis do not characterize the optimization landscape and instead rely on iterative procedures such as expectation maximization. We address this gap and prove that Cox regression can be efficiently learned under truncated and right-censored data using first-order optimization when the baseline hazard is known (despite nonconvexity). In contrast, when the baseline hazard is learned jointly, we construct identifiable and correctly specified models whose negative log-likelihood contains strict suboptimal local minima. On experiments with four survival datasets, we show that accounting for truncation reduces the prediction bias induced by naive Cox regression and extends to neural networks. We also show orders of magnitude speedups compared to standard expectation maximization.
[LG-114] Market Impact Estimation via Causal Foundation Models
链接: https://arxiv.org/abs/2610.12537
作者: Dennis Thumm,Ying Chen
类目: Machine Learning (cs.LG); Computational Engineering, Finance, and Science (cs.CE); Trading and Market Microstructure (q-fin.TR)
*备注: In 7th ACM International Conference on AI in Finance (ICAIF '26), November 14-17, 2026, Milan, Italy
Abstract:When a trader executes a large order, the relevant question is not \emphwhat will the price be? but \emphwhat would the price have been had I not traded? Market impact is thus a causal quantity, yet classical models (Almgren–Chriss, propagators) regress price on flow, which is biased whenever informed flow moves prices through information as well as trading. We present a proof-of-concept \emphCausal Market Simulator: a continuous-time causal prior-data fitted network (PFN) trained on a synthetic market prior in which a hidden informational flow confounds the flow–price relation by construction, with confounding strength an exact per-episode knob. On this prior, the naive estimator’s bias follows a closed form we confirm empirically (up to 68% overestimation), while the PFN tracks the unbiased true-parameter oracle at high confounding. Its \emphdo-ablated twin, the same model with the intervention inputs removed, collapses onto the pre-window mean. Zero-shot, the model responds at the ground-truth scale to metaorders in an ABIDES limit-order book ( +0.38 pre-onset standard deviations against seed-replay counterfactuals), and its intervention response replicates on about 2,300 detected flow bursts in BTC/ETH/SOL perpetuals and 3,800 on Nasdaq equities, evidence consistent with, though not proof of, causal transfer. Off-prior the response degrades gracefully, and split-conformal recalibration repairs interval calibration. Transfer hinges on encoding the metaorder as added flow rather than a clamped price level, not on more training. A recurrent state-space variant closes the remaining shape gap: its impact accrues over execution duration where the transformer’s stays flat, raising the correlation with measured metaorder impact from +0.68 to between +0.92 and +0.96 , at the cost of weaker on-prior deconfounding that traces to the training recipe rather than to recurrence.
[LG-115] CacheScope: Exact-Compute Allocation for Training-Free Diffusion Acceleration
链接: https://arxiv.org/abs/2610.12530
作者: Qinhan Lyu,Jusheng Zhang,Zhixing Zhang,Hao Liu,Zijie Liang,Jin Jiang,Keze Wang
类目: Machine Learning (cs.LG)
*备注:
Abstract:Training-free feature reuse accelerates diffusion transformer inference by replacing full denoising computation at selected steps with cached approximations. Existing methods mainly improve the reconstruction of skipped features, but we find that once a stable first-order reconstructor is used, increasing reconstruction complexity brings limited gains, whereas the placement of exact-computation steps has a much larger effect on fidelity. More importantly, absolute shallow-probe variation is jointly affected by input-trajectory displacement and network response strength, and therefore does not directly reflect cache risk. We address this confounding by normalizing probe-output variation with the corresponding input displacement, yielding a directional gain per unit trajectory movement. Based on this signal, we propose CacheScope, which identifies high-risk reuse steps online and selectively falls back to full denoising computation while leaving the underlying cache reconstructor unchanged. CacheScope requires no additional training, gradients, auxiliary networks, or prompt-specific offline schedule optimization. Across FLUX.1-dev, Wan2.1-T2V-1.3B, and Open-Sora 1.2, CacheScope achieves up to 3.57x acceleration and reduces median LPIPS by up to 70.1% over the strongest probe-based baseline.
[LG-116] GlucoPRISM: Protocol-Supervised Pretraining for Cross-Cohort Glucose Transfer
链接: https://arxiv.org/abs/2610.12528
作者: Adinath Madhavrao Dukre,Abdullah Mohammad,Yifan Lu,Eran Segal,Ahmed Metwally,Imran Razzak
类目: Machine Learning (cs.LG)
*备注:
Abstract:Continuous glucose monitoring (CGM) foundation models encode each day as one vector that mixes who the person is, what happened that day and how the sensor measured it, so measurement differences travel with the representation into new cohorts. We ask whether pretraining can place the measurement component that harms transfer in known coordinates, so that deployment drops them with a fixed projection and no target data. GlucoPRISM supervises a GlucoFM backbone with response contracts, rules for how each part of the representation should change when only the day or only the sensor changes: a 64-dimensional Trait band should change with neither, a 48-dimensional State band only across days, and a 16-dimensional Sensor band should track the device. Synthetic sensor views calibrated on paired Dexcom and Libre recordings, different-day pairs and glucose-summary targets supply this supervision without clinical labels. Across twelve cross-cohort directions, dropping the Sensor band from the same frozen encoder raises mean transfer AUROC from 68.75 to 73.57, against 69.3 for GlucoFM. The gain has two parts. Into CGMacros, the one target cohort recorded with two sensor types, filtering adds 11 to 19 points, and this holds when the generator is recalibrated on half of the participants and scored on the other half. On the other eight directions filtering is neutral and the encoder itself exceeds GlucoFM by 3.5 points. The device remains linearly decodable after filtering, so the filter removes a device-related component that harms transfer rather than all measurement information. The retained bands improve window AUROC on thirteen of fourteen public task–cohort cells (Holm-adjusted p=0.031) and correlation on fourteen of fifteen clinical endpoints in an external cohort of 9,303 participants.
[LG-117] Behind-the-Meter Photovoltaic Visibility from Net Smart Meters: Deployment Regimes and Operational Insights
链接: https://arxiv.org/abs/2610.12527
作者: Jack Zheng,Hao Wang
类目: Machine Learning (cs.LG)
*备注: 6 pages, 5 figures, 6 tables. Accepted at the 10th IEEE Conference on Energy Internet and Energy System Integration (IEEE EI2 2026). IEEE Xplore publication pending
Abstract:Distribution operators need visibility of behind-the-meter photovoltaic (PV) generation, yet most residential customers are observed only through net smart meters. Deep-learning-based PV disaggregation can restore this visibility, but its operational value depends on whether the model serves known customers, new customers, future periods, or new regions. We quantify this dependence using four deployment regimes that separate household transfer from temporal extrapolation, applied to Ausgrid smart-meter data with cross-dataset adaptation to the Pecan Street data. Using a fixed training protocol, we benchmark representative deep sequence architectures for PV disaggregation under regime-matched evaluation. At a fixed 48-hour context length, daylight mean absolute error (MAE) of the best model rises from 0.104~kW on seen households in the future test period to 0.185~kW on unseen households over the same period, and under a fixed training contract the deployment regime explains far more of the error variation than model choice. Under target-domain normalization, fine-tuning on five target-region households reduces source-model transfer error by 28%–36%. Long input windows help known-customer extrapolation, while their new-customer benefits vary by model. These findings suggest regime-matched error budgets, limited target supervision for model adaptation in new regions, and use-case-dependent context selection for energy data analytics.
[LG-118] Algebraic Integer Quantization for Machine Learning Applications
链接: https://arxiv.org/abs/2610.12494
作者: Anthony Kostal-Vazquez,Vassil Dimitrov,Branden Butler
类目: Machine Learning (cs.LG)
*备注:
Abstract:In this article, we propose algebraic integer number formats (AINF) as a framework for highly configurable and accurate compressed computation. A key property of AINF is its straightforward reduction to purely integer arithmetic, enabling error-free multiply-accumulate operations. We develop a matrix multiplication engine that exploits this property, obtaining performance within a predictable factor of the most efficient numerical counterparts on modern hardware accelerators. Another key advantage of AIQ is the freedom to select algebraic integers tailored to the numerical characteristics of a given use case, offering optimization opportunities that are fundamentally unavailable in floating-point or fixed-point formats. Motivated by these properties, we introduce algebraic integer quantization (AIQ), a lossy compression format for large language model (LLM) inference, and provide results demonstrating that AIQ achieves competitive accuracy compared to the industry-standard MX format across a diverse set of models and benchmarks at equivalent bit-per-parameter budgets. The experiments presented in this article employ algebraic integers of degree two (quadratic integers); generalizations to higher-order and, in particular, multidimensional algebraic integers promise even greater computational advantages and remain a promising direction for future work.
[LG-119] S-Q: Perception-Guided Post-Training Quantization of Text-to-Speech Diffusion Transformers
链接: https://arxiv.org/abs/2610.12474
作者: Xiaoqin Feng,Yuqi Li,Weilun Feng,Yi-Cheng Lin,Kai Li,Xianglong Wang,Kuo Yang,Chuanguang Yang,Yingli Tian,Wei Li,Zhongwei Cheng,Lin Chen
类目: ound (cs.SD); Machine Learning (cs.LG); Audio and Speech Processing (eess.AS)
*备注:
Abstract:Zero-shot text-to-speech (TTS) can clone a voice from seconds of audio. Yet the quality comes from billion-parameter diffusion transformers whose size and multi-step sampling put them out of reach of the on-device, assistive, and real-time applications that need them most. Post-training quantization (PTQ) shrinks such models without retraining, but it has been built for language and vision, not speech. At 4 bits, a strong quantizer leaves intelligibility close to full precision but consistently erodes speaker timbre, so error rates stay low while the voice drifts from the target speaker. We ask why quantization hurts speech, where the damage lives, and whether it can be repaired without retraining. To find out, we run the first 4-bit weight-and-activation (W4A4) PTQ study of a TTS diffusion transformer at 1B and 3.5B. The timbre cost comes from both the weight and the activation quantization, but only the activation part has the timestep structure a precision schedule can exploit. We therefore introduce TTS-Q, which selects hard-to-quantize items from task-matched calibration candidates and applies a budget-balanced mixed-precision schedule that assigns higher precision to late-step feed-forward activations. TTS-Q recovers timbre best at both scales, at no cost to intelligibility. Separately, the deployed calibrated-W4A4 reference reduces peak memory on GPU, providing a practical reference for resource-constrained TTS deployment.
[LG-120] Neuromorphic Satellite Intelligence: A Formal Framework for Event-Driven Architectures Spike-Based Algorithms and Quantitative Energy-Accuracy Trade-offs
链接: https://arxiv.org/abs/2610.12471
作者: Suresh Kumar TP,Vikas Agnihotri
类目: Neural and Evolutionary Computing (cs.NE); Machine Learning (cs.LG)
*备注:
Abstract:Satellite onboard computing faces an irreducible tension: mission intelligence requirements grow monotonically while power, mass, and radiation budgets remain fixed. This paper advances the state of the art on three fronts. First, we develop a formal mathematical model of spiking neural computation for satellite workloads, deriving closed-form expressions for energy consumption as a function of network sparsity, firing rate, and synaptic fan-out. Second, we propose three original algorithms – a Spiking Kalman-Complementary Filter (SKCF) for attitude estimation, a Temporal Contrast Anomaly Detector (TCAD) for spacecraft health monitoring, and a Spike-Based Adaptive Modulation and Coding (SAMC) scheme for cognitive satellite links – each with pseudocode and analytical complexity bounds. Third, we introduce a quantitative Energy-Accuracy-Latency (EAL) trade-off surface and populate it with numerical estimates derived from published silicon measurements of Loihi and SpiNNaker, enabling direct comparison with FPGA and GPU baselines. A taxonomy of four radiation-aware neuromorphic architecture classes is refined with fault-rate models. Continual on-orbit learning is formalized through a constrained Spike-Timing Dependent Plasticity (STDP) rule that provably bounds weight drift. Case studies for a 12U CubeSat Earth observation mission, a GEO communications payload, and an autonomous deep-space probe provide concrete, quantified design points. Our analysis shows that neuromorphic implementations can achieve 8 to 47 times energy reduction over GPU baselines while maintaining inference accuracy within 2.1% for representative satellite workloads.
[LG-121] A Sampling Complexity-aware Framework for Discrete-time Fractional-Order Dynamical System Identification
链接: https://arxiv.org/abs/2501.17499
作者: Xiaole Zhang,Vijay Gupta,Paul Bogdan
类目: ystems and Control (eess.SY); Machine Learning (cs.LG)
*备注:
Abstract:A variety of complex biological, natural and man-made systems exhibit non-Markovian dynamics that can be modeled through fractional order differential equations, yet, we lack sample comlexity aware system identification strategies. Towards this end, we propose an affine discrete-time fractional order dynamical system (FoDS) identification algorithm and provide a detailed sample complexity analysis. The algorithm effectively addresses the challenges of FoDS identification in the presence of noisy data. The proposed algorithm consists of two key steps. Firstly, it avoids solving higher-order polynomial equations, which would otherwise result in multiple potential solutions for the fractional orders. Secondly, the identification problem is reformulated as a least squares estimation, allowing us to infer the system parameters. We derive the expectation and probabilistic bounds for the FoDS parameter estimation error, assuming prior knowledge of the functions ( f ) and ( g ) in the FoDS model. The error decays at a rate of ( N = O\left( \fracd\epsilon \right) ), where ( N ) is the number of samples, ( d ) is the dimension of the state variable, and ( \epsilon ) represents the desired estimation accuracy. Simulation results demonstrate that our theoretical bounds are tight, validating the accuracy and robustness of this algorithm.
[LG-122] Constructive Bounds for the Topological Expressivity of Neural Networks
链接: https://arxiv.org/abs/2610.13931
作者: Kosio Beshkov
类目: Algebraic Topology (math.AT); Machine Learning (cs.LG)
*备注:
Abstract:The expressivity of a neural network \Phi describes the class of functions that a network can express. The term topological expressivity refers to a family of measures particularly suited to understand binary classification and is often formulated in terms of the Betti numbers of a decision boundary \beta (\Phi^-1(0)) . Despite its popularity, this measure is not as useful for regression and other problems that do not involve a decision boundary. Instead, we propose to study topological expressivity in terms of the Betti numbers of the output of a neural network \beta(\Phi(X)) . We formally prove that a ReLU network with architecture (d,\sum\limits_k=1^d \beta_k(3k+2),\sum\limits_k=1^d\beta_k(k+1)) can express spaces homotopy equivalent to wedge sums of spheres with arbitrary Betti numbers. This gives upper bounds for any arbitrary connected ( \beta_0=1 ) sequence of Betti numbers, but by constructing spaces homotopy equivalent to products of N spheres of dimension d_1,…,d_N we achieve much better bounds (\sum\limits_n=1 d_n, 3\sum\limits_n=1\limits^N d_n + 2N, \sum\limits_n=1\limits^N d_n + N) for Betti numbers given by \prod_n (1+x^d_n) . Finally we conjecture a much stronger tight bound which gives the architectural bound (d,d+1,d+1) for a space homeomorphic to the sphere. Subjects: Algebraic Topology (math.AT); Machine Learning (cs.LG) Cite as: arXiv:2610.13931 [math.AT] (or arXiv:2610.13931v1 [math.AT] for this version) https://doi.org/10.48550/arXiv.2610.13931 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-123] Hitting-Time Bounds for Asynchronous Q-Learning
链接: https://arxiv.org/abs/2610.13901
作者: Yang Peng
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:We study the last iterate of standard asynchronous Q-learning from a single trajectory of a finite Markov decision process. The trajectory follows a fixed behavior policy whose state–action chain is irreducible and may be periodic. For discount factor \gamma , write H=(1-\gamma)^-1 , and let \mu_\min be the minimum stationary state–action probability and \mathfrak h_\star the largest expected hitting time of the reverse state–action chain. We prove that zero-initialized Q-learning with a constant step size achieves sup-norm error at most \varepsilon with high probability using \widetildeO(H^4/(\mu_\min\varepsilon^2)+\mathfrak h_\star) transitions, for 0\varepsilon\le1 . The statistical term retains the quartic effective-horizon dependence of standard Q-learning, while initialization cost is additive in \mathfrak h_\star . For aperiodic behavior chains, a comparison with mixing time yields a transient term \widetildeO(t_\mathrmmix/\mu_\min) . An empirical state–action count rule selects a constant step size for a subsequent training run and attains the same rate without prior knowledge of model parameters, target accuracy, or confidence level. The output is the last training iterate, with both stages included in the sample count. The proof uses two deterministic Bellman envelopes to separate statistical error from fixed-policy initialization error and adapts reverse-time hitting-cost compensation from TD learning to state–action propagation. An exploration lower bound holds for arbitrary predictable step sizes. Together with the existing statistical lower bound and its extension to pilot-selected constant steps, it yields matching mean-square rates up to logarithmic factors on the stated large-sample parameter classes.
[LG-124] Finite-Sample Guarantees for Fully Discrete Conditional Diffusion Models
链接: https://arxiv.org/abs/2610.13851
作者: Qiuyun Zhu
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: 31 pages
Abstract:We establish finite-sample guarantees for conditional diffusion models learned from data and implemented with finitely many denoising steps. Our approach aligns the score-training objective with the sampling grid, allowing statistical estimation and numerical discretization errors to be analyzed together. Under a smooth conditional density model, we derive high-probability bounds on the generated distribution’s error and quantify the required number of score evaluations. For every smoothness index \beta0 , a suitable grid yields averaged conditional Kullback–Leibler (KL) divergence \widetilde O_p(n^-2\beta/(d_x+d_y+2\beta)) relative to the original target with or without early stopping. Both the full and early-stopped samplers attain average target total-variation (TV) error \widetilde O_p(n^-\beta/(d_x+d_y+2\beta)) . Here n is the sample size, d_x,d_y are the data and conditioning dimensions, and errors are averaged over the conditioning variable. The total-variation bound matches the rate established in existing conditional distribution-estimation theory, up to logarithmic factors.
[LG-125] Diversity-Aware Ensemble of Quantum-Classical Models via Combinatorial Fusion
链接: https://arxiv.org/abs/2610.13808
作者: Jingyan Xu,Yuanhong Wu,Samuel Yen-Chi Chen,Sean Patten,Christina Schweikert,D. Frank Hsu
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG)
*备注: 12 pages, 4 tables, 6 figures; Accepted to the 2026 IEEE Conference on Quantum Computing and Engineering (IEEE Quantum Week 2026/QCE26)
Abstract:Variational quantum circuits (VQCs) are highly sensitive to circuit architecture, yet most quantum machine learning pipelines select a single best design and discard the remaining candidates. This paper addresses whether the structural diversity across quantum circuit search spaces can be used to produce stronger predictions through model fusion. We apply Combinatorial Fusion Analysis (CFA), a model fusion framework that selects and combines multiple scoring systems using rank-score function (RSF) and cognitive diversity (CD), to a pool of 29 architecturally diverse classical models and quantum circuits. Using a diversity-aware model selection method, we identify subsets of maximally diverse models and combine them with both score and rank combination. Experiments on four binary classification benchmarks covering different domains demonstrate that CFA-based hybrid classical-quantum fusion consistently outperform the best individual model on every dataset considered with improvements up to 6.03% in accuracy. When comparing with relevant literatures, the CFA framework further achieves superior performance across all four datasets.
[LG-126] Constrained Probabilistic Numerics: Gaussian Process Solvers for Linear PDEs under Linear Inequality Constraints
链接: https://arxiv.org/abs/2610.13804
作者: Boyuan Deng,Kshitiz Upadhyay,Michael Shields
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Numerical Analysis (math.NA)
*备注: 9 figures, 3 tables. Code available at this https URL
Abstract:Gaussian process solvers for linear partial differential equations (PDEs) return posteriors rather than point estimates, but they condition only on equality information: the PDE residual, boundary data, and measurements. Many solutions of interest also obey inequality constraints, including nonnegativity, monotonicity, and absence of arbitrage, which equality conditioning cannot enforce. We prove that conditioning a Gaussian process prior jointly on linear equality observations and a finite-dimensional inequality event is equivalent to conditioning sequentially in terms of Borel measures on the solution space. The physics-informed posterior is therefore a valid prior for the inequality update at virtual points. The combined law is non-Gaussian yet computable through truncated-Gaussian moments, and neither the PDE conditioning nor the inequality update requires modification. We evaluated the construction on a Poisson benchmark, option-price surfaces, and air-quality fields. Under incomplete boundary data, a monotonicity constraint lowered the error of a two-dimensional Poisson reconstruction by 63% . On a real SP 500 option chain thinned to 20 retained quotes, no-arbitrage constraints reduced held-out extrapolation error by 22% and cut the calendar-arbitrage rate from 10% to 1% . On four real air-quality snapshots, nonnegativity reduced a Gaussian moment-based sub-zero-tail proxy by 74% at the sparsest monitor count. Changes in mean accuracy and constraint diagnostics differed across data regimes. The probability of the noisy virtual constraint event under the equality posterior measures agreement with the specified bounds before the update. The construction turns admissibility from a post-processing step into conditioning information for probabilistic PDE solvers.
[LG-127] Adaptive Variance Reduction without Knowing Oracle Smoothness
链接: https://arxiv.org/abs/2610.13799
作者: Wei Jiang,Yibo Wang,Zechao Li
类目: Optimization and Control (math.OC); Machine Learning (cs.LG)
*备注:
Abstract:Variance reduction improves the convergence rate of stochastic non-convex optimization under the average smoothness condition. Existing adaptive variance reduction methods are especially designed for average smoothness and do not adapt to standard smoothness. In this paper, we study how one algorithm can adapt to these two settings and the noiseless setting without knowing the smoothness constants or the variance bound. Given the gradient budget T , we develop a two-phase method. The first phase compares two independent gradients and switches to normalized momentum when their difference exceeds a threshold. This phase provides both a candidate with standard smooth and noiseless guarantees and also ensures a bounded expected function gap for the second variance reduction phase. The resulting rates are O(T^-1/3) under average smoothness, O(T^-1/4) under standard smoothness, and O(T^-1/2) without noise. When T is unknown, we propose a method with two paths that attain the corresponding rates with logarithmic factors in the stochastic settings. Here, we use a variance reduction path to deal with average smoothness and employ the AdaGrad-Norm for standard smoothness and noiseless setting. Neither method restarts from the initial point or requires a growing number of oracle calls in each round.
[LG-128] Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints
链接: https://arxiv.org/abs/2610.13787
作者: Gon Buzaglo,Guy Kornowski
类目: Optimization and Control (math.OC); Machine Learning (cs.LG)
*备注:
Abstract:We present new algorithms for stochastic optimization problems in which the objective is neither smooth nor convex, subject to a convex constraint set. Our algorithms return a (\delta,\varepsilon) -Goldstein stationary point, as recently defined for constrained problems by Liu et al. (2024), with improved complexities, and are the first to achieve optimal convergence rates for this task in several settings. In particular, we design projection-based and projection-free algorithms that achieve a \widetilde O(\delta^-1\varepsilon^-3) rate using stochastic gradients, which we show to be optimal, and a \widetilde O(d\delta^-1\varepsilon^-3) rate using zeroth-order queries, which is also optimal in its dependence on the dimension d and improves over prior work. Notably, our lower bound is given in terms of the Frank-Wolfe gap and holds even for smooth problems, which is of independent interest. These results show that in nonconvex stochastic optimization, the convergence rate is degraded neither by the presence of constraints nor by nonsmoothness. Our analysis is based on a reduction to online linear optimization, extending a related technique from unconstrained optimization.
[LG-129] Geometry-Aware Multi-Objective Optimization: Norm-Constrained Oracles with Entropic Weight Updates
链接: https://arxiv.org/abs/2610.13773
作者: El Mahdi Chayti,Alireza Mirrokni,Martin Jaggi
类目: Optimization and Control (math.OC); Machine Learning (cs.LG)
*备注:
Abstract:Multiple-gradient descent is typically formulated in Euclidean geometry, whereas matrix-aware optimizers use directions induced by other norms. We analyze a single-loop multi-objective method combining a norm-constrained linear minimization oracle with entropic updates of task weights. For any finite-dimensional norm pair, we establish an O(T^-1/2) ergodic stationarity rate in the deterministic setting, deriving the required trajectory gradient bound from smoothness and lower-boundedness in the unregularized case. With stochastic gradients and a bounded-gradient assumption, one persistent blended-gradient momentum buffer yields an O(T^-1/4) rate whose leading term has no explicit dependence on the number of tasks. We also establish static regret for the inner weighting objective on arbitrary bounded gradient sequences and, with entropy regularization and a weight floor, iteration-wise inner-gap control after burn-in while retaining ergodic stationarity, conditional on a trajectory gradient bound. The optimal blended gradient can be nonunique in spectral and sign geometries, motivating a selection-independent inner gap. Our analysis extends the spectral construction studied by concurrent MOON to general norms. Experiments compare the method with existing multi-task optimizers and examine its oracle, weighting, and momentum choices.
[LG-130] From Pixels to Privacy-Sensitive Features: An Information-Theoretic Framework for Reconstruction Bounds
链接: https://arxiv.org/abs/2610.13768
作者: Henry Bourne,Robert F. Allison
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: 40 pages, 9 figures
Abstract:What can an adversary recover from a model trained with DP-SGD? Its (\varepsilon,\delta) guarantee does not answer this question directly. We derive a distortion bound that can be computed before training and applies even to an adversary who observes the parameter trajectory during training, knows every other training record and the population distribution from which the training records are drawn. The analyst may choose the representation in which error is measured, allowing the bound to target the aspects of reconstruction that are privacy-sensitive in a given application. Our information-theoretic framework separates two contributions: the information about a record revealed by training, measured through conditional mutual information, and the uncertainty already present in the data distribution, measured through source entropy. Rate-distortion theory combines them into a lower bound on the expected error of every reconstruction attack. For DP-SGD, the leakage bound depends only on the sampling rates and noise multipliers, while the source entropy is lower-bounded from a sample with finite-sample confidence. An orthogonal block construction keeps the resulting bound informative for high-dimensional images. We instantiate the framework in pixel space and in LPIPS feature space, obtaining, to our knowledge, the first lower bound on reconstruction distortion measured directly by LPIPS. On a range of image datasets the bounds establish non-trivial unavoidable expected reconstruction error within heuristically recommended privacy-budget ranges and beyond. Experiments compare the bounds with strong reconstruction attacks and identify the principal sources of the remaining slack.
[LG-131] How Well Do Prior-Data Fitted Networks Amortize Bayesian Inference?
链接: https://arxiv.org/abs/2610.13764
作者: Manuel Hülskamp,Julius Kobialka,Emanuel Sommer,Thomas Nagler,David Rügamer
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Prior-data fitted networks (PFNs) are trained to approximate the Bayesian posterior predictive distribution (PPD) of a synthetic prior, yet results about the approximation quality are surprisingly thin. Taking an empirical risk minimization perspective, we decompose the deployment error of PFNs into prior, context, and amortization error, and measure the latter against a reference PPD under a realistic prior. Results show that PFNs generally recover the targeted PPD very well. Nevertheless, we find that parts of the residual amortization error persist, especially in \textitrare settings under the prior pretraining distribution, even when scaling the model size, which manifests in disagreement between independently pretrained PFNs and leaves uncertainty about the predictor at inference time. As a remedy, we study multiple types of Bayesian model averages and find that these can consistently reduce this uncertainty and improve predictions up to full-size TabICLv2 models.
[LG-132] Scalable Sparse Autoregressive Variational Inference for Non-Gaussian Spatial Fields
链接: https://arxiv.org/abs/2610.13656
作者: Paul F.V. Wiemann,Matthias Katzfuss
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Computation (stat.CO); Methodology (stat.ME)
*备注: Short paper for the Joint Meeting SIS-FENStatS 2026, Rome, June 22-25, 2026
Abstract:Latent field models are essential for spatial statistics, but the posterior distribution of the latent field, even with a Gaussian process (GP) prior, is analytically intractable whenever the likelihood is non-Gaussian. Existing approximations are either too slow or too restrictive for large non-Gaussian datasets. We present a scalable variational inference framework that mirrors the sparse nearest-neighbor autoregressive structure of the prior in the variational family, uses normalizing-flow conditionals for expressiveness, and amortizes all variational parameters via a single shared neural conditioner. Doubly stochastic optimization with reduced ancestor sets achieves polylogarithmic complexity per iteration.
[LG-133] A Critical Look at Power Sampling when Test Time Sharpening LLM s
链接: https://arxiv.org/abs/2610.13653
作者: Abiel Malkani Talwar,Christopher Nemeth,Henry Moss
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Reinforcement learning with verifiable rewards (RLVR) has substantially improved LLM reasoning, yet growing evidence suggests it mainly performs distribution sharpening: concentrating probability mass on reasoning paths the base model already produces. Recent work therefore seeks RLVR’s gains without needing reward signals, by sampling from the power distribution \pi_\alpha \propto \pi_\textbase^\alpha via Markov chain Monte Carlo or sequential Monte Carlo. We show that these samplers fail to converge to \pi_\alpha under realistic compute budgets, and that their gains are largely recreated via simple Best-of- N with appropriate grading . This suggests they succeed by selecting high-probability sequences, not by approximating \pi_\alpha , raising a natural question: is the power distribution itself a worthwhile target? We test this hypothesis directly by fine-tuning the base model to match \pi_\alpha , sidestepping sampler convergence issues entirely. Despite approximating the target far more faithfully than existing samplers, this strategy yields gains that are noisy and specific to certain models and sampling tasks. Together, our results suggest that the value of power sampling lies not in faithfully targeting \pi_\alpha , but in the simpler goal of extracting sequences the base model already deems likely.
[LG-134] Electron-Density-Informed Molecular Property Prediction Using Surrogate Functionals
链接: https://arxiv.org/abs/2610.13649
作者: Manuel V. Klockow,Simon Wagner,Roman Remme,Dominic Plein,Fred A. Hamprecht
类目: Chemical Physics (physics.chem-ph); Machine Learning (cs.LG)
*备注:
Abstract:Machine learning methods are increasingly used to predict chemical properties directly from the molecular structure to bypass the often prohibitive cost of quantum mechanical calculations. Recent work has shown that including the ground-state electron density as input to the machine learning model can improve accuracy in this setting. This work employs the recent surrogate functional framework originally developed for orbital-free density functional theory and extends it to predicting molecular properties. We show that passing the ground-state density as input to the model, while simultaneously enforcing it to be the minimum of the surrogate functional, surpasses state-of-the-art performance for six out of seven extensive properties of the QM9 dataset. Additionally, the approach shows improved generalization to larger molecules taken from the QM40 dataset. On all extensive properties of both datasets, our approach outperforms models that are informed by the ground-state density but do not enforce the surrogate functional constraints.
[LG-135] Kernel-based External Validity of Experimental Studies
链接: https://arxiv.org/abs/2610.13625
作者: Federico Matteucci,Gerhard Neumann
类目: Methodology (stat.ME); Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:The external validity of a study is the extent to which its findings generalize to unseen experimental conditions, such as datasets. We formalize the results of a study together with its research question, and define external validity as the probability that two independent and same-sized replications of the study produce results whose maximum mean discrepancy (MMD) is below a given tolerance. This approach, centered on the choice of a space of results and of an appropriate reproducing kernel for the MMD, is flexible enough to be deployed on multiple different types of results and research questions. Additionally, we establish an asymptotic power-law relation between the size of a study and the quantiles of the MMD, which we use to estimate the desired size of an externally valid study from a small-scale preliminary study. We deploy our framework to rankings with ties and discuss kernels suited to different research questions. Experiments on existing case studies and on a simulated newly designed study illustrate the applicability of the framework. We release our code as part of the genexpy Python module.
[LG-136] Some remarks on the connection between generative diffusion and optimal transport
链接: https://arxiv.org/abs/2610.13614
作者: Giulio Biroli,Marc Mézard
类目: Machine Learning (stat.ML); Disordered Systems and Neural Networks (cond-mat.dis-nn); Machine Learning (cs.LG)
*备注:
Abstract:We discuss three simple connections between generative diffusion and optimal transport. First, the joint law of the data and of their Ornstein-Uhlenbeck noising is, at every time, the solution of an entropic optimal-transport problem, at a temperature set by the noise level. Backward diffusion can consequently be read as an annealing which gradually decreases the entropic regularization. Second, we study the speciation transition–how the modes of the data distribution emerge during generation–and compare how it happens in diffusion and flow matching with respect to optimal transport. Using Gaussian mixtures as high-dimensional example, we show that the dynamical instability through which diffusion and flow matching separate the modes becomes, for optimal transport, an exponentially thin boundary layer at the beginning of generation, which is rounded by entropic regularization. Third, considering a generic forward dynamics with a general confining potential, we show that the backward process driven by the score also satisfies a drift-based variational principle whose minimal cost is the entropy difference between initial and final distributions.
[LG-137] Vocal Intensity Conversion with Continuous SPL Control via Adversarial Training ICASSP2027
链接: https://arxiv.org/abs/2610.13608
作者: Quentin Le Tellier,Albert Rilliard,Olivier Perrotin,Marc Evrard
类目: Audio and Speech Processing (eess.AS); Machine Learning (cs.LG); Sound (cs.SD)
*备注: 5 pages, 2 figures, 1 table. Submitted to IEEE ICASSP 2027. Code: this https URL . This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible
Abstract:Vocal intensity conversion renders a recorded utterance at a different vocal intensity, rather than simply scaling its amplitude, while preserving its content and speaker identity. Existing systems control intensity through a reference utterance or a few discrete categories. Instead, we control the conversion with any target sound pressure level (SPL) on a continuous dB scale. A lightweight converter, trained as a conditional cycle-consistent GAN without parallel data, transforms the features of a frozen speech encoder, from which a pretrained vocoder resynthesizes the speech. We compare three representations, log-mel spectrograms, WavLM, and SpeechTokenizer, and introduce an objective protocol that measures the achieved intensity change against the target one on a calibrated corpus. With WavLM, the converter achieves a measured 83% of the target change in intensity and also shifts the fundamental frequency. A perceptual evaluation confirms that perceived vocal intensity increases with the target level on amplitude-normalized stimuli.
[LG-138] CorrFlow: Exact and Permutation-Equivariant Flow Matching on the Correlation Elliptope NEURIPS
链接: https://arxiv.org/abs/2610.13606
作者: Gautier Marti
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Risk Management (q-fin.RM)
*备注: Accepted at NeurReps 2026, the NeurIPS workshop on Symmetry and Geometry in Neural Representations. Code: this https URL
Abstract:Correlation matrices combine nonlinear positive-definiteness constraints with a simultaneous row-column permutation symmetry. Their generation therefore involves two distinct problems. First, every output must remain on the correlation elliptope, irrespective of how its variables are ordered. Second, the generator must learn the domain-specific distribution occupied by empirical data inside that valid space. Existing financial image generators mix these problems: they learn ordered matrix entries and repair invalid draws afterward. We introduce CorrFlow, which separates them. A generalized Fisher transform maps full-rank correlation matrices bijectively to unconstrained coordinates, guaranteeing valid outputs without projection. A graph flow-matching network learns the empirical distribution in those coordinates and is permutation equivariant: reordering the variables only reorders the output. We compare a conditional CorrGAN reimplementation, image diffusion, and CorrFlow on 80\times80 Taiwan equity matrices using five seeds per neural method. CorrFlow produces 100% valid draws without repair and obtains feature sliced-Wasserstein distance .712\pm.141 , versus 4.339\pm.252 for CorrGAN and 4.610\pm.191 for image diffusion after their invalid outputs are projected back to the correlation space. It also improves this distance over historical lookup, while lookup retains higher local coverage. These results support the combined construction under the evaluated training budget; they do not establish superiority over fully tuned image models or isolate the contribution of each component.
[LG-139] Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
链接: https://arxiv.org/abs/2610.13590
作者: Sebastian Pokutta
类目: Optimization and Control (math.OC); Machine Learning (cs.LG)
*备注:
Abstract:Recent results [arXiv:2602.04378, arXiv:2602.22608] have established worst-case objective-error lower bounds of order 1/T^2 after T linear minimization oracle (LMO) calls, matching the upper bound [arXiv:1406.1305] in its dependence on T and thereby resolving a long-standing open question. Upon close inspection, however, both lower bounds are somewhat brittle. The first [arXiv:2602.04378] applies only to the standard Frank–Wolfe algorithm, and, as we show, its prescribed slow exact-line-search trajectories can amplify sufficiently small initialization errors exponentially, corresponding to roughly one additional bit of initialization accuracy per iteration. The second [arXiv:2602.22608] obtains lower bounds for any deterministic LMO-based first-order method via a resisting oracle that adversarially adapts to the queries of the algorithm. In both cases it is conceivable that randomization may circumvent these lower bounds; in particular, neither establishes a lower bound for unrestricted randomized first-order LMO methods. We close this gap by proving an \Omega(L\operatornamediam(S)^2/T^2) distributional lower bound for randomized first-order linear minimization oracle methods over strongly convex sets. While our construction reuses the family of [arXiv:2602.22608], our proof characterizes the conditional distribution of the hidden permutation after adaptive queries and bounds the expected decrease of a combinatorial statistic controlling optimizer variance. We further show that the same error threshold holds with probability at least 3/4 and yields a stopping-time tail bound.
[LG-140] Probabilistic Forecasting of Electric Vehicle Charging in a Time-varying Hierarchical Infrastructure
链接: https://arxiv.org/abs/2610.13588
作者: Guillaume Principato,Yvenn Amara-Ouali,Yannig Goude,Bachir Hamrouche,Jean-Michel Poggi
类目: Applications (stat.AP); Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注: 34 pages, 11 figures, 6 tables
Abstract:Uncertainty quantification for electric vehicle (EV) charging demand is essential to turn the increasing pressure of EV adoption on power systems into a source of flexibility. We study a large-scale dataset of public charging stations in Scotland, where demand exhibits a hierarchical structure, organized across multiple aggregation levels, from individual charging points to regional and national scales. The charging infrastructure is continuously evolving, with new stations deployed and existing ones occasionally removed, which calls for forecasting and uncertainty quantification methods tailored to this evolving structure. To address these challenges, we combine hierarchical forecasting with recent advances in conformal prediction with missing data. The conformal procedures considered produce valid prediction intervals at every node of the hierarchy and the algorithm CP-MNR-Nested successfully accounts for the time-varying hierarchical structure of the data.
[LG-141] Asymptotic Analysis of Discrete-Time Self-Attention Dynamics in Transformers
链接: https://arxiv.org/abs/2610.13518
作者: Claudio Altafini
类目: Dynamical Systems (math.DS); Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注: 16 pages, 3 figures
Abstract:In machine learning, a self-attention dynamics describes the attention mechanism of transformers, and is obtained treating the layer index of a transformer as time index. Even though naturally discrete-time, this dynamical system is most often studied in continuous-time. Scope of this paper is to provide a thorough investigation of the discrete-time version of the self-attention dynamics: a complete classification of its equilibria is given, and their stability properties are studied, in both the single-head and the multihead case. We show that in both cases the main attractor of the dynamics is a consensus equilibrium aligned with the principal eigenvector of the value matrix (in the single-head case, a corresponding matrix of weights in the multihead case), even though other locally asymptotically stable bipartite equilibria can be show to exist at least in the single-head situation. The behavior is confirmed by looking at the learned weight matrices of a real transformer.
[LG-142] A Scalable Learned Iterative Solver for Nonlinear MPC via Temporal Decomposition
链接: https://arxiv.org/abs/2610.13480
作者: Lukas Lüken,Sergio Lucia
类目: Optimization and Control (math.OC); Machine Learning (cs.LG); Systems and Control (eess.SY)
*备注: 16 pages, 7 figures, 7 tables
Abstract:Nonlinear model predictive control (NMPC) can be applied to large nonlinear systems with complex objectives while enforcing constraints, but the cost of solving the underlying optimization problems limits real-time application for systems with fast dynamics or many states. Neural networks can reduce this online cost by approximating the control law, but may violate constraints and typically require many precomputed optimizer solutions for training. The learning-based iterative solver for constrained optimization (LISCO) instead learns to predict primal-dual steps toward satisfaction of the Karush-Kuhn-Tucker (KKT) conditions through self-supervised training without precomputed solutions, but its dense, monolithic architecture grows with the prediction horizon. We remove this horizon dependence by exploiting the temporal structure of the problem in the solver architecture, which makes the network size independent of the horizon while leaving the training loss and the solver iteration unchanged. A closed-loop resampling strategy further aligns the training distribution with closed-loop operation at no additional sampling cost. On an economic NMPC benchmark of a CSTR cascade, the proposed solver scales to larger problems than monolithic LISCO and achieves median speedups of up to a factor of four over IPOPT. In closed loop, it achieves comparable control performance to IPOPT with no observed constraint violations.
[LG-143] Harmonic analysis and circuit approximation of Sobolev functions on quantum input spaces
链接: https://arxiv.org/abs/2610.13477
作者: Philipp Schmocker
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG); Representation Theory (math.RT); Spectral Theory (math.SP)
*备注: 27 pages, 2 figures
Abstract:We derive approximation rates for Sobolev functions defined on the complex unit sphere and complex projective space, representing quantum states, and on the special and projective unitary groups, representing quantum unitary operations. By using harmonic analysis on compact groups and compact homogeneous spaces, we characterize the corresponding Peter–Weyl decompositions and Sobolev spaces via irreducible representations and the Laplace–Beltrami operator. Combining spectral truncation with finite-depth quantum-circuit approximation, invoking the Solovay–Kitaev theorem, we establish quantitative rates that separate the spectral truncation error from the circuit approximation error.
[LG-144] Learning by Compression: Risk Estimates Attain the Law-of-Large-Numbers Rate
链接: https://arxiv.org/abs/2610.13442
作者: Simone Garatti,Marco C. Campi
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Statistics Theory (math.ST)
*备注:
Abstract:Compression schemes provide a general framework for deriving data-dependent risk bounds for learning algorithms. For learning rules based on preferent compression, existing results upper-bound the risk in terms of a sample-dependent complexity \boldsymbolk , defined as the cardinality of the compression augmented by the training examples on which the reconstructed hypothesis is inappropriate. These results, however, yield a margin of order O(\sqrt\ln N/N) above \boldsymbolk/N . In this paper, we establish that the logarithmic factor is not intrinsic. We prove that, for every fixed confidence level 1-\delta , the risk is bounded with probability at least 1-\delta by \frac\boldsymbolkN + O\left(\frac1\sqrtN\right), uniformly over all possible values of \boldsymbolk . Thus, risk estimates for learning algorithms based on preferent compression attain the same law-of-large-numbers rate as the empirical estimate of the probability of a fixed event. We also show that the leading term \boldsymbolk/N is necessary and investigate its relation to the empirical risk. In particular, we identify regimes in which the empirical risk retains the O(1/\sqrtN) convergence rate, as well as regimes in which it converges more slowly or ceases to be consistent, while the complexity-based estimator preserves the O(1/\sqrtN) rate.
[LG-145] One Thing Leads to Another: The Essentials of Time Series Causal Discovery
链接: https://arxiv.org/abs/2610.13430
作者: Kurt Butler,Damian Machlanski,Michael P.J. Camilleri,Zhihua Liu,Panagiotis Dimitrakopoulos,Feng Chen,Ricardo Silva,Sotirios A. Tsaftaris
类目: ignal Processing (eess.SP); Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注: 16 pages, 3 figures, accepted for publication in the IEEE Signal Processing Magazine
Abstract:Time series causal discovery — the process of detecting causation between time series — has its roots in signal processing research from over a half century ago. It has since received active and widespread interest, evolving into different forms across domains such as statistics, dynamical systems and machine learning. Entering this fragmented and constantly evolving research landscape can be daunting. This tutorial provides a unified overview of time series causal discovery across research communities. We introduce the key principles invoked by modern discovery methods, and we discuss their limitations and assumptions. We also discuss how discovery methods are evaluated, benchmarked and fine-tuned. We further discuss how causal discovery for time series is becoming crucial for downstream tasks in agriculture and Earth science, in healthcare, and in artificial intelligence systems. We believe that this tutorial will serve as a valuable resource in navigating the deluge of recent causality research, as well as an invitation to signal processing audiences to contribute to causal problems. To further help readers, we host a companion repository to link to useful code packages and resources at this https URL.
[LG-146] Desertification Forecasting in Semi-Arid Regions: Using Deep Learning to Probe the Observability Limits of Land Degradation Dynamics
链接: https://arxiv.org/abs/2610.13406
作者: Filipe Moura Da Silva,Cláubio Landney Lima Bandeira
类目: Image and Video Processing (eess.IV); Machine Learning (cs.LG)
*备注: 14 pages, 10 figures, 7 tables
Abstract:Forecasting desertification has received far less attention than mapping it. We use a convolutional LSTM (ConvLSTM) trained on ten annual Earth Observation (EO) variables (2000-2023) over the semi-arid state of Ceará, Brazil, on a 256x206 grid at roughly 2.2 km resolution, to measure how much of the year-to-year evolution of a MapBiomas-derived degradation index (IDV) can be predicted from satellite data. The network predicts a bounded change on top of the last observed state, is trained in two stages (single-step, then recursive rollout) and is evaluated on a contiguous spatial and temporal holdout. State-wide mean IDV rose from 0.238 to 0.350 between 2000 and 2023, about 0.005 per year, but cell-level change is dominated by year-to-year jumps, and a gradient-boosting model given all channels explains only 4.7% of its variance. Against this ceiling, the ConvLSTM lowers RMSE relative to persistence by 1.6% one year ahead and 4.4% four years ahead in a held-out southern band (p 0.001), beats persistence with a constant drift and reproduces 53-69% of the regional drift. Drift-aware baselines only help from the third year onward, by up to 4.4% in RMSE at six years. An earlier formulation that redrew the whole field each year predicted changes unrelated to the observed ones (correlation -0.06) and produced a spurious decline when run recursively. Channel knockouts suggest that elevation and EVI degrade the forecast, while slope and aspect have no measurable effect. Monte Carlo dropout and stochastic scenario maps convey the uncertainty that the expected-value forecast hides. Under climatological forcing, mean IDV rises from 0.350 in 2023 to 0.370 in 2030. EO-based desertification forecasting is therefore reliable for the regional trend, not for individual cells.
[LG-147] Model-free Bayesian Clustering and Multimodal Posterior Summarisation
链接: https://arxiv.org/abs/2610.13397
作者: Qing Li,Sara Wade
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:We develop a model-free, noise-aware Bayesian clustering framework that constructs a martingale posterior over clusterings from a predictive Bayesian perspective. This avoids explicit likelihood-prior model specification, expensive MCMC sampling, and mode-seeking variational approximations, while accommodating irregular cluster shapes and enabling parallel generation of posterior draws. To interpret the posterior over high-dimensional, noise-aware clusterings, we introduce a Wasserstein-type summarization method. Using a novel noise-aware loss, this approach compresses the large collection of posterior draws into a small set of weighted representatives, capturing distinct cluster structures and noise assignments. Further, we marginalise the uncertainty in the density level, avoiding reliance on a specific choice. We establish theoretical properties of the proposed loss and guarantees for the level-marginal posterior approximation. Results demonstrate the framework’s effectiveness in capturing clustering and noise uncertainty.
[LG-148] JEPA-kMMVAE: CSI Prediction for Time-Varying Wireless Channels
链接: https://arxiv.org/abs/2610.13315
作者: Efstathios Chatziloizos,Konstantinos Vandikas,Aneta Vulgarakis Feljan,Zheng Chen,Nikolaos Pappas
类目: ignal Processing (eess.SP); Information Theory (cs.IT); Machine Learning (cs.LG)
*备注: 5 pages, 3 figures, 1 table
Abstract:This paper considers channel state information (CSI) prediction using neural networks for time-varying multi-antenna channels from noisy historical observations. The main challenge is to exploit temporal correlation while distinguishing channel evolution from observation noise. We propose JEPA-kMMVAE, which combines a joint-embedding predictive architecture with a k-memory Markov variational autoencoder to predict future CSI through temporally structured latent representations. The framework supports direct prediction and residual corrections relative to the latest latent state and noisy CSI observation. Simulation results show that the residual configuration outperforms the evaluated baselines at moderate and high input CSI signal-to-noise ratios, while sequence baselines remain more accurate under stronger noise.
[LG-149] Verifiable Sampling for Delegated Generative Quantum Machine Learning
链接: https://arxiv.org/abs/2610.13211
作者: Matteo Inajetovic,Anna Pappa,Petros Wallden
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG)
*备注: 6 pages, 1 figure, 1 table. Accepted at the 2026 IEEE 2nd International Conference on Quantum Artificial Intelligence (QAI 2026). \c{opyright} 2026 IEEE
Abstract:Generative machine learning has shown remarkable results across a wide range of interdisciplinary tasks, motivating significant efforts toward Quantum Generative Models as a path to beyond-classical performance, given their capability of generating classically intractable distributions. However, comparatively little attention has been paid to securely delegating such computations to a powerful remote quantum server. In this work, we propose a blind and verifiable protocol for sampling that can be used for the inference phase of such quantum models. Such a protocol inherits blindness from Universal Blind Quantum Computing and achieves verifiability by exploiting known approaches based on trapification schemes. Alongside, to delegate the training phase, we discuss an extension of the previously proposed verifiable end-to-end Delegated Variational Quantum Algorithms (Inajetovic et al., Phys. Rev. Research, 2026). Beyond the usual Accept/Abort outcome characterizing verification protocols, the sampling protocol for inference also provides, even against a malicious server, an estimation of the amount of corrupted generated samples, i.e., a fine-grained feature describing the quality of the outcome connecting verification protocols and application-level benchmarking. Comments: 6 pages, 1 figure, 1 table. Accepted at the 2026 IEEE 2nd International Conference on Quantum Artificial Intelligence (QAI 2026). \copyright 2026 IEEE Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG) Cite as: arXiv:2610.13211 [quant-ph] (or arXiv:2610.13211v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2610.13211 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
[LG-150] Fast Gradient-Based Approximation of Continuous Dynamic Time Warping
链接: https://arxiv.org/abs/2610.13129
作者: Pierre Houedry,Romain Tavenard,Nicolas Courty,Romaric Gaudel
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Dynamic Time Warping (DTW) is a common choice for measuring the discrepancy between time series. It proceeds by finding an optimal warping between timestamps through dynamic programming, which can be slow and is not differentiable. Consequently, several variants have been proposed. Among them, Soft-DTW proposes a smooth formulation of DTW, amenable to gradient computation, while Continuous-DTW (CDTW) introduces a continuous formulation through parametrizable warping functions. Yet, computational costs remain high for both methods and impractical for large datasets in modern machine learning pipelines. This paper revisits CDTW in several ways. After establishing its differentiability under mild conditions, we introduce FastCDTW, which is an efficient approximate solver with two different computational strategies: an exact closed-form scheme for piecewise-linear warping functions, and an unbiased Monte Carlo estimator for smooth ones, such as implicit neural networks. Both strategies provide gradients with respect to the warping function and the input time series, and the resulting algorithm is GPU-friendly. We demonstrate its benefits through its integration into more complex learning problems, including time series averaging, classification and deep domain adaptation.
[LG-151] Why Heavy-Tailed Weight Spectra Predict Model Quality NEURIPS2026
链接: https://arxiv.org/abs/2610.13123
作者: Joseph Wilson,Chris van der Heide,Liam Hodgkinson,Zhichao Wang,Fred Roosta,Michael W. Mahoney
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: Accepted at NeurIPS 2026. 34 pages, 11 figures, 4 tables
Abstract:A solid understanding of the predictive success of deep neural networks (DNNs) remains elusive. For example, while many data-dependent metrics exist that seek to predict model quality of DNNs, these metrics may be expensive to compute for large datasets and/or may be impossible to compute when training datasets are not released. A practical and effective predictor of model quality involves analyzing DNN weight matrices, as prior work has established that heavy-tailed spectral distributions in trained weight matrices can be strongly predictive of model quality. However, such metrics lack a rigorous statistical justification. In this work, we aim to understand why these metrics perform well, from a statistical perspective. To do so, we employ a probabilistic framework to derive the marginal likelihood for a DNN, evaluated using only the final layer weights. Across large-scale convolutional DNNs and LLMs, we find that this marginal likelihood predicts model quality. To understand the role heavy-tailed spectra play in predictive performance, we derive the limiting log-marginal likelihood for spectra that follow the (heavy-tailed) High-Temperature Marchenko-Pastur (HTMP) distribution. We show that this limiting quantity is convex in a heaviness parameter, and we derive an optimal heaviness that empirically predicts over-fitting for large-scale DNNs.
[LG-152] Lightweight Time-Frequency Vibration Sensing for Consumer Device Condition Monitoring
链接: https://arxiv.org/abs/2610.13040
作者: Po-Heng Chou,Jen-Yu Chiu,Chun-Yu Yeh,Wei-Lung Mao,Walid Saad
类目: ignal Processing (eess.SP); Machine Learning (cs.LG)
*备注: 6 pages, 3 figures, and 4 tables. Submitted to the 2027 IEEE International Conference on Consumer Electronics (ICCE 2027)
Abstract:Consumer rotating devices, including washing machines, air conditioners, electric fans, robotic vacuum cleaners, and home fitness equipment, increasingly rely on vibration sensing for intelligent condition monitoring and predictive maintenance. Ensuring reliable operation in these resource-constrained appliances requires efficient, lightweight artificial intelligence (AI) solutions capable of processing non-stationary signals under real-world operational interference. This paper proposes a lightweight AI-assisted vibration sensing framework that employs continuous wavelet transform (CWT) and Hilbert-Huang transform (HHT) to convert one-dimensional (1-D) vibration time-series signals into two-dimensional (2-D) time-frequency representations. These representations are subsequently analyzed using lightweight deep learning architectures, specifically MobileNetV3-Small, ConvNeXt-Tiny, and the You Only Look Once version 11 classification model (YOLOv11-cls). Public bearing benchmark datasets, including Case Western Reserve University (CWRU), Paderborn University (PU), and Intelligent Maintenance Systems (IMS), are utilized as representative rotating components to investigate model generalization. The proposed framework is designed with eventual embedded deployment in consumer electronics in mind. Experimental results demonstrate that CWT combined with YOLOv11-cls achieves high diagnostic accuracy, while MobileNetV3-Small provides an attractive low-latency alternative for computationally constrained edge platforms. Conventional random splitting is also compared with dataset-specific structured isolation. The results highlight the importance of avoiding data leakage and quantify tradeoffs in classification accuracy, parameter count, floating-point operations (FLOPs), model footprint, preprocessing cost, and central processing unit (CPU) inference latency.
[LG-153] Scan-Parallel Variational Inference for event-driven Latent Jump Models
链接: https://arxiv.org/abs/2610.12986
作者: Vansh Bansal,Min Chen,James G. Scott
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Continuous-time latent state-space models are widely used for irregularly observed time series, typically representing uncertainty through a random initial state followed by smooth ordinary differential equation (ODE) dynamics, or Brownian perturbations accumulated by a stochastic differential equation (SDE). While these constructions are natural for smooth or diffusive systems, they do not directly encode a finite set of unobserved shocks whose timing, magnitude, and effect on memory are themselves uncertain. We instead introduce latent jump models (LJMs): the latent state follows closed-form deterministic dynamics between Poisson-driven event times and undergoes a learned instantaneous jump at each event, with state-dependent intensity and mark distributions. This defines a time-homogeneous Markov process whose jumps are intrinsic state transitions rather than numerical integration steps. For training, we derive a tractable event-augmented path-space evidence lower bound (ELBO) and introduce Scan-Parallel Variational Inference (SPVI): an observation-conditioned variational posterior samples the complete latent event configuration before the state recurrence is evaluated using triangular affine scans. This enables fast and scalable training for LJMs in logarithmic temporal depth. Across synthetic stochastic systems and real irregular time series, LJMs remain competitive with continuous-time latent baselines in forecast accuracy, often with fewer latent updates than numerical solver evaluations, while training one to two orders of magnitude faster than the sequential baselines.
[LG-154] NucleoNet: A Nuclear-Aware Determinant Ansatz for Multi-Geometry Neural Variational Monte Carlo
链接: https://arxiv.org/abs/2610.12985
作者: Qiao Gao,Yang Huang,Enze Hou,Yuzhi Liu,Jingrun Chen,Han Wang
类目: Chemical Physics (physics.chem-ph); Machine Learning (cs.LG)
*备注: 10 pages, 7 figures
Abstract:Neural-network variational Monte Carlo provides an accurate route to solving the electronic Schrödinger equation, but many neural wavefunctions are optimized for a single nuclear geometry, requiring separate calculations to map out a potential energy surface. We introduce NucleoNet, a nuclear-aware determinant ansatz in which electrons and nuclei form a unified particle set propagated through a shared electron–nucleus backbone that jointly evolves one-particle and two-particle representations. Nuclei carry learned representations that evolve alongside the electronic representations and condition orbital construction, while antisymmetry is imposed only by electronic determinants. On equilibrium small-molecule benchmarks, NucleoNet achieves accuracy comparable to established neural-wavefunction baselines with substantially fewer parameters. For each molecular system, a single model optimized jointly across geometries describes the N _2 dissociation curve, Li displacement in LiCN, and the ethane and formamide minimum-energy paths for bond dissociation. Sparse-geometry training generalizes to unseen geometries for N _2 and LiCN without further optimization, and N _2 ablations show that nuclear streams substantially improve this interpolation. These results show that a compact wavefunction with jointly evolved nuclear representations can describe the geometries of a molecular system with a single set of parameters.
[LG-155] From Imbalance to Evidence: Deep Nonparametric Testing for Complex Data under Severe Sample Imbalance
链接: https://arxiv.org/abs/2610.12946
作者: Guanhao Zhou,Xiufan Yu
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Methodology (stat.ME)
*备注:
Abstract:Comparing distributions under severe sample imbalance requires effectively using abundant majority observations while retaining sensitivity to differences involving the smaller sample. This challenge is particularly relevant for complex, non-Euclidean data, such as graphs, whose structural characteristics call for flexible testing procedures. Classifier two-sample tests (C2STs) provide such flexibility, but existing procedures are primarily designed for balanced or comparably sized samples. In this paper, we study C2STs in a highly imbalanced regime, and show that severe sample imbalance may substantially degrade testing performance. Different from conventional imbalanced learning approaches that treat sample imbalance merely as a nuisance for classifier training, we turn it into a source of repeated testing evidence. Building on this insight, we propose an Enhanced Imbalance-Aware Deep Classifier Two-Sample Test (EIAD-C2ST), a classifier-agnostic framework designed for sample imbalance that accommodates diverse data modalities by tailoring classifiers to data structure. For computationally expensive deep classifiers, we further develop a scalable representation-amortized implementation strategy. Theoretically, we establish rigorous guarantees on asymptotic size and characterize conditions for power consistency, allowing the imbalance ratio to diverge. We demonstrate the empirical gains using simulations and an application to blockchain forensics. The results reveal that the majority-sample surplus, when properly leveraged, can be organized into useful statistical evidence, rather than an obstacle, for distributional comparisons with complex data.
[LG-156] Sparse Dictionary Learning for Measure-Valued Data via Linearized Optimal Transport: Efficient Algorithms and Sample Complexity
链接: https://arxiv.org/abs/2610.12924
作者: Brendan Mallery,Shuchin Aeron,James Murphy
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:We study dictionary learning for probability measure-valued data by embedding measures into Hilbert spaces using features derived from optimal transport geometry. We learn data-adapted dictionaries through sparse autoencoder parameterizations, producing fast, scalable representations of probability measures as sparse finite-dimensional codes. The resulting framework combines the rich, geometric structure of optimal transport with the interpretability and efficiency of sparse representation learning. We demonstrate its utility across diverse data modalities, including hyperspectral images, geometric point clouds, and document embeddings in large language model latent spaces. We also prove generalization bounds for sparse dictionary learning objectives on broad classes of L^2 -valued measure embeddings, expressed in terms of the metric complexity of the atom class. For optimal transport and entropic transport map dictionaries, we derive new covering number bounds that yield explicit rates. Together, our computational and theoretical results support a new, scalable model for representation learning in the space of probability measures via embedding into Hilbert spaces.
[LG-157] Beyond Second-Order Information: Paid Logistic Regression with Noisy Features
链接: https://arxiv.org/abs/2610.12919
作者: Sanghwa Kim,Kyoungseok Jang,Se-Young Yun
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注: 37 pages, no figure
Abstract:We consider online binary prediction with paid stochastic features, where the learner can spend resources to obtain better observations of the underlying features. This setting is motivated by applications such as medical testing, where additional cost can provide more precise measurements of patient’s features for predicting a binary outcome. At each round, a latent feature is drawn i.i.d., the response is generated through a logistic model, and the learner chooses how much to pay before observing a noisy version of the feature. The goal of learner is to jointly control prediction loss and acquisition cost. In contrast to the former result on the online linear regression with paid features, covariance information alone is no longer sufficient: two noise distributions with the same covariance may induce different optimal logistic losses, and lower variance can even lead to higher loss. Under a structural ordering in which larger payments yield better observations by removing independent noise, we obtain \widetilde O(\sqrtT) regret when the noise structure is known and \widetilde O(T^2/3) regret when it is unknown, with matching lower bounds up to logarithmic factors.
[LG-158] Generalized Determinantal Point Processes for Attraction and Repulsion with Distinct Interaction Kernels
链接: https://arxiv.org/abs/2610.12894
作者: Hideaki Ishibashi,Takahiro Kawashima,Hideitsu Hino
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Computation (stat.CO)
*备注:
Abstract:Determinantal point processes (DPPs) model subset selection probability with repulsion, but many applications also exhibit attraction arising from pairwise relations or shared latent structures. Nonsymmetric DPPs (NDPPs) capture both effects, but their kernels are difficult to interpret and specify. We propose the determinant-ratio point process (DRPP), which models repulsion and attraction via a ratio of the determinants of two symmetric positive-definite kernels. This formulation preserves the feature-based interpretation of standard DPPs while allowing the two effects to be specified separately. Furthermore, we introduce an auxiliary-variable representation that enables efficient MCMC sampling and yields tractable expectation formulas for key statistics including the normalizing constant, which together facilitate maximum-likelihood learning. We theoretically characterize the interaction structures well suited to DRPPs: for clustered attraction with C latent groups, DRPPs exactly realize the target pairwise interactions with an attraction rank C , whereas NDPPs can require a rank that grows with the number of items given the same repulsion component. Conversely, nontransitive pair-specific attraction may require compensation through the DRPP repulsion kernel. Experiments support these predictions, showing that DRPPs fit transitive attraction with substantially fewer parameters than NDPPs.
[LG-159] When Solvers Get Moody: Quantifying and Predicting Performance Variability in Mixed Integer Programming
链接: https://arxiv.org/abs/2610.12876
作者: Mourchid Adegbindin,Brenda Dietrich,Jamol Pender,Andrea Lodi
类目: Optimization and Control (math.OC); Machine Learning (cs.LG)
*备注: 21 pages, including a 3-page electronic companion. An earlier conference version appeared in the IOS 2026 proceedings. this https URL
Abstract:Mixed-integer programming (MIP) solvers are widely used, yet their performance can vary substantially even under seemingly neutral perturbations. Such variability complicates benchmarking, and the interpretation of computational studies. We introduce the Weighted Variability Score (WVS), a robust multi-component metric that aggregates dispersion in normalized runtime, final optimality gap, LP iterations, and branch-and-bound nodes across repeated runs. On a large subset of MIPLIB 2017 instances, each solved in 100 randomized runs under a four-hour limit, WVS reveals a right-skewed distribution with a substantial upper tail: many instances are essentially stable, but some exhibit large variability that is not explained by basic properties alone. Notably, this experiment proved optimality for the open instance ‘neos-5045105-creuse’ in two SCIP runs. Using static descriptors and root-level features, a tree-based predictor with a gated tail uplift achieves a mean absolute error of 0.058 and Spearman rank correlation of 0.65 on a sealed test split. Feature-importance analysis highlights root degeneracy, matrix structure, coefficient ranges, and presolve reductions as the main drivers of high WVS. Because variability is systematic and partially predictable from inexpensive early-run features, our findings offer a practical tool for preemptive tuning and lay a foundation for fairer evaluation of new algorithms.
[LG-160] Universal Bounds for Self-Normalized Kullback-Leibler Estimation
链接: https://arxiv.org/abs/2610.12851
作者: Buu Phan,Lester Mackey,David Alvarez-Melis
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:This work studies an entropy-based estimator of Kullback-Leibler (KL) divergence constructed from normalized importance weights. We prove a universal finite-sample bound showing that its expectation can exceed the target-proposal KL divergence by at most \log 2 for any sample size. We then characterize the KL divergence between the distribution induced by importance-weighted resampling and the proposal, showing that it is upper bounded by both the expectation of the entropy-based estimator and the target-proposal KL divergence. Importantly, these bounds require neither bounded importance weights nor finite higher moments. We apply these results to test-time alignment of generative models via Soft Best-of- N sampling, an importance-sampling-based scaling technique proposed by Verdun et al. (2025), and to relative entropy coding, obtaining finite-sample policy-divergence certificates and moment-free bounds on coding cost.
[LG-161] wo-way Guidance: Simultaneous Learning of Summary Statistics for Generative Bayes
链接: https://arxiv.org/abs/2610.12850
作者: Percy S. Zhai,Max Pachman,Peverel D. Shipley,Jungeum Kim
类目: Machine Learning (stat.ML); Machine Learning (cs.LG); Computation (stat.CO); Methodology (stat.ME)
*备注:
Abstract:Bayesian simulation-based inference (SBI) can struggle to recover increasingly concentrated posteriors as observation size grows. We consider learning sufficient summary statistics jointly with the posterior as a general principle for scalable inference in various SBI methods. A common measure taken in SBI is dimension reduction through predetermined summaries, which may partially discard posterior information. Our approach instead imposes structure on how the posterior learner depends on a learned summary (e.g., affinity), and learns the summary simultaneously with the posterior. We identify an important mechanism named two-way guidance: under a structural restriction on the summary, the posterior sufficiency of the learned summary simplifies posterior learning, whereas a suitable posterior objective guides the learned summary towards posterior sufficiency. This mechanism explains a counterintuitive finding that the structural restriction on the summary statistics improves posterior learning, rather than limit its performance. We establish theoretical guarantees on both posterior estimation error and the learned summary’s departure from sufficiency, thus identifying conditions on the simulation budget for recovering increasingly concentrated posteriors as observation size grows.
[LG-162] Scalable Learning of Determinantal Point Processes with Kernel-Structured Interactions
链接: https://arxiv.org/abs/2610.12829
作者: Takahiro Kawashima,Hideitsu Hino
类目: Machine Learning (stat.ML); Machine Learning (cs.LG)
*备注:
Abstract:Determinantal point processes (DPPs) on a finite set are probability models that exhibit repulsion where inter-item similarities are encoded by a positive definite kernel matrix. Scaling DPP learning to large datasets typically requires imposing structural constraints on the kernel matrix, such as a low-rank-plus-diagonal form. However, structural assumptions introduce a severe trade-off between expressive power and computational scalability. Our study addresses this challenge by (a) modeling the full-rank interactions via a nonlinear kernel function and latent features, (b) designing a surrogate function for the maximum likelihood estimator, and © adopting stochastic optimization using random features of the nonlinear kernel. Numerical experiments on real-world datasets demonstrate that our method significantly improves this trade-off, achieving better generalization performance with remarkable parameter efficiency.
[LG-163] rainable Quantum-Native Language Models: Dissipative Memory Capacity Limits and Hardware Validation
链接: https://arxiv.org/abs/2610.12806
作者: Deniz Yunus Göğüş
类目: Quantum Physics (quant-ph); Machine Learning (cs.LG)
*备注: 22 pages, 6 figures, 1 supplementary figure
Abstract:We study byte-level autoregressive language models whose hidden state is a small quantum register, whose transitions are learned token-conditioned quantum channels, and whose next-byte probabilities come directly from Born-rule measurements without a learned classical vocabulary projection or softmax. In the fixed-width recurrent setting, unitary dynamics cannot contract or reset stored distinctions; experimentally, unitary recurrence loses to its retrained one-token control in every tested variant. Introducing learned dissipation, then token-conditioned dissipative gating, yields useful memory beyond one token. The gated model improves test negative log-likelihood by 0.20 +/- 0.03 nats/byte over retrained parameter-matched one-token controls at context length 12, and by 0.29-0.33 at longer contexts, but never beats retrained two-token controls. A key-value recall benchmark shows a width-dependent threshold: one stored pair meets the pre-registered accuracy bar at 4-5 memory qubits, two pairs at 6-7, and three pairs remain unsolved. This is consistent with, but does not establish, a capacity explanation for the short effective memory horizon. As a secondary result, one-qubit models reach lower stationary memory entropy than a heuristically optimized classical predictive frontier at matched error in 9/9 seeds. On IBM Heron hardware, computational-basis memory-register distributions show signal against a uniform null in 12/12 circuits across prefixes of up to 12 tokens, next-bit probabilities pass pre-registered accuracy bars at four-token prefixes, and bytes are generated autoregressively by sampling physically measured bit probabilities. The tested models are classically simulable and substantially worse than classical n-gram baselines. We claim no computational quantum advantage.
[LG-164] Polyconvex neural-network surrogates with learned paired directional features for anisotropic hyperelastic homogenization
链接: https://arxiv.org/abs/2610.12801
作者: S. Ares de Parga,A. Cornejo,J. A. Hernández,R. Rossi
类目: Computational Physics (physics.comp-ph); Machine Learning (cs.LG); Numerical Analysis (math.NA)
*备注: 38 pages, 15 figures
Abstract:Approximating the effective anisotropic hyperelastic response of a representative volume element (RVE) requires constitutive expressiveness, mechanical consistency, and computational efficiency. This work develops a polyconvex physics-augmented neural network (PANN) construction based on paired directional features whose orientations, stretch powers, and determinant exponents adapt to the RVE response. The features are composed with convex, componentwise nondecreasing cores, realized as an input-convex neural network (ICNN) or an input-convex Kolmogorov-Arnold network (ICKAN). The complete energies satisfy objectivity, an exactly stress-free reference, two-dimensional polyconvexity, and prescribed growth conditions by construction, and nonnegative energy is certified separately for the selected models. On a multicavity and a single-cavity periodic cell, these energies are compared with an Unconstrained energy, trained identically without the curvature and growth constraints, and with three hyperreduced projection-based reduced-order models (HPROMs), which serve as physics-based references. On the first cell, learning the features lowers the stress error sevenfold, and six features suffice on both. The constrained energies remain below one percent in stress error and in the displacement error of a tensile-coupon FE ^2 application with a full-order reference, whereas the Unconstrained energy and the HPROMs are more accurate inside the data. Beyond the data, however, the Unconstrained energy loses rank-one convexity, and under confined compression it stops below half of the 500 MPa that the constrained energies reach. These results quantify what the guarantees cost in accuracy and what they secure beyond the data.
[LG-165] Minimax Rates for Estimating Powered Sliced Wasserstein Functionals
链接: https://arxiv.org/abs/2610.12740
作者: Binh Thuan Tran
类目: atistics Theory (math.ST); Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:We study the two-sample estimation of the powered Sliced Wasserstein functional under projected r -th moment assumptions. Let N=n\wedge m , where n and m are two sample sizes. We establish the minimax rates in the noncritical regimes. When pr2p , the minimax risk is of order N^-(r-p)/r , while for r2p it is of order N^-1/2 . In both cases, the natural plug-in estimator is minimax rate-optimal. At the endpoint r=p , the minimax risk is bounded away from zero, so uniformly consistent estimation is impossible. At the critical order r=2p , we obtain the exact worst-case rate of the plug-in estimator and a lower bound for the minimax risk, leaving a logarithmic gap between the lower and upper bounds. The exact minimax rate in this critical case remains open.
[LG-166] A Distributional Framework for Behavioral Characterization and Risk Management of Large Language Models
链接: https://arxiv.org/abs/2610.12718
作者: David García-Lorite,Raul Merino
类目: Risk Management (q-fin.RM); Machine Learning (cs.LG); Machine Learning (stat.ML)
*备注:
Abstract:Large language models are stochastic by nature. Repeated executions under the same experimental conditions may produce different responses. We propose a framework that can be applied across the model lifecycle, from task design to residual behavior and continuous monitoring. The method consists of building an empirical response distribution estimated through Monte Carlo simulation. Semantic interventions are introduced to study how these distributions change. We illustrate the framework with two different tasks, borrower classification and music album recommendation, and quantify the resulting distributional changes. The framework is linked to model risk management and governance by measuring robustness and control effectiveness, and characterizing residual behavior. Since it relies only on observed responses, it can also be applied to black-box models accessed through commercial APIs.
[LG-167] Product Monte Carlo: Expectation Under a Product of Densities
链接: https://arxiv.org/abs/2610.12702
作者: Pietro Carlotti,Sifan Liu,Yuling Yao
类目: Methodology (stat.ME); Machine Learning (cs.LG); Computation (stat.CO)
*备注:
Abstract:Aggregating independently computed sub-sample inferences is a well-known challenge in large-scale Bayesian computation, federated learning, and opinion pooling. The core problem is to approximate a distribution whose density is proportional to a product of individual densities. We propose Product Monte Carlo (PMC), an algorithm for computing arbitrary expectations under a product of densities using only Monte Carlo draws from individual densities. We turn the intractable product expectation into a regression problem by expressing it through a family of computable conditional expectations. Besides the point estimate, our fully Bayesian regression formulation provides coherent uncertainty quantification and principled diagnostics. We establish theoretical guarantees on consistency and characterize convergence rates for the PMC estimator. Across simulated and real-data experiments varying the number, dimensionality, and heterogeneity of the component distributions, PMC achieves higher estimation accuracy, better-calibrated uncertainty coverage, and improved scalability at a lower computational cost than existing methods. In addition, PMC requires no density evaluation, making it applicable to simulation-based inference, as we demonstrate in an application with protein images.
[LG-168] oward Maximizing Algebraic Connectivity via Density-Dependent Backbone Construction and Reinforcement Learning Completion
链接: https://arxiv.org/abs/2610.12697
作者: Zeru Zhu,Marco Gamarra,Ji Liu
类目: Optimization and Control (math.OC); Machine Learning (cs.LG); Combinatorics (math.CO)
*备注:
Abstract:This paper studies an open network design problem of constructing graph topologies with maximum algebraic connectivity under fixed numbers of vertices and edges. A density-dependent approach is proposed that decomposes the design task into two stages: a high-quality, low-cost structural backbone construction and a reinforcement learning completion stage. The method selects the backbone based on density, using complete multipartite graphs in dense regimes and Cayley graphs in low-to-intermediate regimes, and then refines the remaining edges through a learning-based procedure. Numerical results show that the proposed method achieves high algebraic connectivity with favorable runtime scalability, outperforming existing methods. These results support a structural-family-first strategy for scalable network design.
[LG-169] MolP2SBench: Do LLM s Really Reason from Molecular Properties to Structure?
链接: https://arxiv.org/abs/2610.12522
作者: Yuhang Xie,Zhiyi Shi,Zeyi Zhang,Zhisheng Qi,Yushun Dong,Yu Wang,Xiongye Xiao
类目: Chemical Physics (physics.chem-ph); Machine Learning (cs.LG)
*备注: 44 pages
Abstract:Large language models (LLMs) are increasingly used in molecular discovery and structure elucidation, where decisions depend on physical observations. Existing evaluations primarily focus on end-to-end molecular reconstruction, where correct predictions do not necessarily indicate reliance on the supplied properties. We introduce MolP2SBench, a benchmark for molecular property-to-structure (P2S) reasoning in LLMs. Each task presents a masked molecular scaffold with given properties and asks the model to select the missing structure from plausible candidates. We shuffle or replace properties to test reliance on correct property-structure pairing and responsiveness to counterfactual property changes. A channel-wise leaderboard uses Property-Grounded Recovery (PGR), giving equal weight to source and counterfactual recovery. Evaluating seven models, we find that LLMs can use physical properties for structure prediction, but performance varies substantially across property types. Higher accuracy with a property does not necessarily imply greater responsiveness to it: a model may benefit more from ^1 H NMR than from ^13 C NMR, yet be less likely to change its prediction when the ^1 H data is replaced. LLM performance also need not reflect the relative difficulty of these properties for human chemists. Although UV-Vis spectra provide less direct structural information than NMR spectra, Astra achieves higher accuracy with UV-Vis data than with NMR peaks. MolP2SBench supports studying how LLMs extract and use physical-property information, revealing patterns that may differ from conventional chemical intuition and providing a foundation for more reliably property-grounded models for molecular and quantum-chemical inference. Code and dataset: this https URL.
[LG-170] Looking Under the Streetlight: Evaluation in Generative Molecular Dynamics NEURIPS2026
链接: https://arxiv.org/abs/2610.12518
作者: Simon Olsson,Frank Noé,Grant M. Rotskoff,Kresten Lindorff-Larsen
类目: Chemical Physics (physics.chem-ph); Machine Learning (cs.LG)
*备注: NeurIPS 2026, Position track
Abstract:This position paper argues that the generative molecular dynamics (GenMD) community is not properly evaluating its progress: current evaluations let a model match what is reported while being arbitrarily wrong on what was claimed, which risks over-claiming advantage over classical baselines. This reflects a structural misalignment between common evaluation practices and the scientific tasks the field sets for itself. The reason is that the ground truth—exhaustive molecular dynamics on the systems of interest—is computationally costly, and this cost is what motivates the field. With ground truth inaccessible, evaluation drifts toward convenient proxies, and the resulting norms entrench easily. We identify misaligned evaluation patterns that persist as a community-level equilibrium, and propose concrete observables, reporting standards, and benchmark designs, both computational and experimental, that better reflect what GenMD aspires to deliver. Our aim is to give the field shared language and tools for evaluation that match its scientific ambitions before today’s conventions calcify into norms.
[LG-171] EarLog: Opportunistic Ear Physiology Sensing toward Personalized Hearing Risk Awareness
链接: https://arxiv.org/abs/2610.12501
作者: Yongzhi Huang,Jiayi Zhao,Kaishun Wu
类目: Audio and Speech Processing (eess.AS); Machine Learning (cs.LG); Sound (cs.SD); Signal Processing (eess.SP)
*备注: 22 pages. Accepted at ACM MobiCom 2026. Includes appendix
Abstract:Many headphone users risk irreversible hearing damage during high-load listening, yet current protection still relies on sound-pressure limits. Clinical tests detect damage after it becomes measurable, leaving the risk-accumulating process unobserved. The acoustic reflex (AR), an involuntary response to high acoustic load, marks when the ear enters a protective state. AR traces are weak, and existing measurements require dedicated probes and controlled conditions that are difficult to maintain during everyday audio. We present EarLog, which turns playback, the dominant interference, into an opportunistic probe. EarLog introduces content-conditioned residual sensing to suppress variations caused by nonstationary content, individual ear acoustics, and device response. It identifies weak AR through loudness-dependent changes and localized spectral irregularities in the residual. A resonance-constrained sparse finite impulse response (FIR) model captures the short-window response. Dual-microphone observations, mild-distortion recovery, and cross-session reference updates keep detection usable under low signal-to-noise ratio (SNR), fit changes, and environmental drift. EarLog runs in real time on an embedded controller using a low-cost dual-microphone add-on. We evaluate it with 81 participants, 16 headphone models, and more than 400 hours of recordings. EarLog achieves 99.0% sensitivity and 98.7% specificity on a clinically referenced benchmark. EarLog records listener-specific AR events during everyday listening, providing data for future longitudinal studies of hearing risk.
[LG-172] Acoustic Biomarkers for Alzheimers Disease Detection from Spontaneous Speech
链接: https://arxiv.org/abs/2610.12500
作者: Anh L Tran,Arjee Javellana Restar,Bereket Kindo
类目: Audio and Speech Processing (eess.AS); Machine Learning (cs.LG); Sound (cs.SD)
*备注:
Abstract:Alzheimer’s disease (AD) remains a major public health challenge, and early identification is crucial for timely intervention and care planning. Recent work has shown that speech-based digital biomarkers can capture subtle changes in vocal production, prosody, and timing that often precede or accompany cognitive decline. In this study, we investigate whether acoustic features extracted from spontaneous speech can reliably distinguish individuals with AD from healthy controls. Using a structured speech dataset derived from the Cookie Theft picture-description task, we extract clinically informative low-level descriptors spanning prosodic, spectral, and temporal domains, and evaluate a range of machine learning classifiers. Our results indicate that acoustic biomarkers carry strong discriminative value, with the best-performing models achieving clinically meaningful separation between diagnostic groups. These findings support the use of non-invasive, low-cost audio-based screening tools and motivate further work on multimodal and longitudinal assessment frameworks for dementia risk detection.
附件下载
