全部动态

本页 40 条
10月12日 周一
arXiv cs.LG68

Hierarchical Experimentalist Agents

arXiv:2606.29315v2 Announce Type: replace-cross Abstract: Large language models (LLMs) are increasingly used to act in the real world and augment human decision-making, yet most systems rely on parametric knowledge acquired through imitation, optionally improved by post-training, retrieval, or search over fixed data. This paradigm struggles in novel domains or on complex queries that require information unavailable from prior knowledge alone; knowing the laws of physics, for example, does not by itself enable reliable reasoning or long-horizon actions in a complex physical system. We argue that agents need active experimentation: the ability to gather targeted query-specific evidence, discover general principles of unseen environments, and convert interaction experience into reusable skills. We introduce Hierarchical Experimentalist Agents (HExA), an in-context, experiment-centric self-improvement framework that (1) iteratively designs and refines query-relevant experiments, (2) incrementally distills experience into reusable and composable skills that accelerate experimentation within and across tasks, and (3) integrates experimental evidence to act or answer queries. HExA can work with any LLM including frontier black-box models, and requires no external supervision, oracle solutions, or offline data. We evaluate HExA on multi-step reasoning, interactive partially observable games, and physics law discovery tasks. To further evaluate when active experimentation is necessary, we introduce Interphyre, a set of hard procedural physics tasks where we enable tool-calling and intervention APIs. Current frontier LLMs including GPT-6 Astra fail in these settings: on the most challenging Interphyre tasks, we show that HExA can enable such models to near 100% success. Moreover, HExA improves token efficiency compared to naive agentic and memory baselines and enables generalization via hierarchical skill transfer from easier to harder tasks.

arXiv cs.LG75

RoboMME-Interference:干扰条件下的机器人记忆基准评测

arXiv:2606.22338v4 公告类型:替换并交叉列入 摘要:部署在真实环境中的机器人会在部署期间跨多个会话和任务积累经验。机器人的任务可能经常要求其记住多个会话之前的信息,因此,长上下文机器人记忆对于现实世界中的部署十分重要。然而,目前大多数机器人记忆基准都基于单个回合或较短的上下文。为了衡量当前机器人记忆系统在更长、干扰更多的会话中的表现,我们推出了 RoboMME-Interference,这是一个基于 RoboMME(Dai 等,2026)构建的跨会话基准。对于每个查询回合,我们使用与该查询相关的先前演示,并在其后接入数量可控的无关会话,构建会话历史,将其作为记忆提供给 VLA,并测量准确率。我们将 RoboMME 已发布的记忆增强型 $\pi_{0.5}$ 变体不加修改地用于这一基准,发现感知记忆变体在获得不含任何干扰项的历史时能够提高成功率,但随着无关会话的累积,其成功率会持续大幅下降。子目标变体使用视觉语言模型读取历史,并将文字形式的子目标传递给策略;这类变体在最佳情况下的提升幅度较小,但随着干扰项累积,能够保留更多的提升效果。我们为表现最强的感知记忆变体添加了检索步骤:从历史中选取与机器人当前视图在视觉上最相似的片段,并仅将该片段传递给策略。这使其在所有干扰水平下都恢复到了无干扰项时的成功率。通过此次发布,我们强调了长上下文记忆和抗干扰鲁棒性的重要性,并表明当前系统在这些能力上普遍表现不佳。项目主页、视频、代码和数据见 https://robotmemorybench.com。

arXiv cs.LG67

Decoupling the Declarative from the Procedural in Vision-Language-Action Models

arXiv:2606.21496v2 Announce Type: replace-cross Abstract: Deploying generalist robotic agents in the real world requires transferable skills. Specifically, a policy trained to clone a behavior from object-specific demonstrations must generalize beyond that object, otherwise data collection requirements become intractable. Recently, fine-tuning of pre-trained billion-parameter Vision-Language Models (VLMs), initially on large-scale robot datasets and then on fewer scenario-specific demonstrations, has emerged as the predominant paradigm for designing Vision-Language-Action (VLA) models. While these policies achieve state-of-the-art manipulation performance in-distribution, they remain brittle to minor spatial, semantic, and task variations. In this work, we address the inability of current models to decouple the declarative (i.e., concepts and entity semantics) from the procedural knowledge (i.e., how to do something) encoded in their parameters, which is a fundamental bottleneck for zero-shot skill transfer to novel objects. To address this, we propose w$^{2}$VLA, a new VLA model with restructured information flow. Rather than feeding all multimodal tokens from the VLM encoder into a large, opaque transformer-based action expert, our approach modulates the robot state sequence with visual, spatial, and skill information in a compositional and interpretable manner. Unlike popular, state-of-the-art VLAs, we show that our modular approach successfully decouples knowledge representations, enabling robust behavior cloning and unprecedented zero-shot skill transfer capabilities across dissimilar, unseen objects.

arXiv cs.LG70

TelcoAgent: A Scalable 5G Multi-KPM Forecasting With 3GPP-Grounded Explainability

arXiv:2606.19821v2 Announce Type: replace-cross Abstract: Key Performance Measurement (KPM) forecasting is essential for proactive network management of 5G and next-generation telecom networks. However, existing machine learning (ML) approaches face significant limitations in scalability and explainability, restricting their effectiveness in real-world deployments. We propose TelcoAgent, a foundation model-based framework that enables accurate, scalable, and explainable forecasting of multiple KPMs across diverse network cells without the need for site-specific training. Specifically, the framework comprises three key components: (i) an automated three-agent pipeline that constructs a 3rd Generation Partnership Project (3GPP) knowledge graph directly from specification documents, (ii) a scalable, time-series foundation model (TSFM)-based prediction pipeline to deliver accurate, zero-shot forecasting, and finally (iii) a reasoning and explanation pipeline that provides actionable, domain-grounded diagnostics. Evaluated using a 3-month, real-world, city-scale 5G KPM dataset from a U.S.-based network operator, TelcoAgent demonstrates high forecasting accuracy for all 7 considered KPMs per cell across 200 cells, while delivering explainable insights and actionable instructions to address network degradations.

arXiv cs.LG70

Bistable by Construction: Wall-Clock-Calibrated State Monitors Have No Moment-Detection Regime at Agent Cadence

arXiv:2606.19386v2 Announce Type: replace-cross Abstract: Runtime monitors for autonomous agents commonly threshold an accumulated internal state - a behavioural baseline, a drift statistic, or, in our prior work, a modelled affective state. We previously reported a State Saturation Trap: threshold-on-state triggers over a continuous affect engine become near-constant alarms on SWE-bench debugging agents (Modgil 2026). A post-release audit found the engine received dt=0 between actions, so its exponential decay never operated: the published trap is a pure-accumulator result. We correct the record (erratum, v2) and treat the flaw as an experiment. The key variable it exposes is whether a monitor's dynamics are calibrated in sample time (per observation, as in CUSUM) or wall-clock time (half-lives in seconds, as in affect models and EMA baselines). On fixed-rate streams these coincide; on agent streams, where inter-action time varies by orders of magnitude, they do not. A pre-registered sweep over uniform intervals (dt in {0..600}s) on 20 trajectories shows the wall-clock level trigger has two regimes: at dt<=1s a constant alarm (20/20; median 18 firings); at dt>=60s silent. Every critical dt lies in (1,30]s. A scriptable gpt-5.4-mini agent loop measures latency at median 1.53s (p90 2.33s), inside the trap regime, vindicating the empirical finding under a corrected mechanism. The structure is a property of the calibration class, not the engine: a minimal wall-clock accumulator over the raw error stream reproduces the same cliff, while a sample-time CUSUM over the identical stream is exactly dt-invariant (20/20). A rising-edge trigger with hysteresis fires 0-3 times per trajectory in every condition. We conclude that wall-clock-calibrated leaky-integrator monitors admit no regime in which they act as moment detectors on agent streams; transition detection escapes the trap at every cadence, but does not recover human intervention timing.

arXiv cs.LG73

PACT:面向多轮工具使用智能体的特权轨迹协同训练

arXiv:2606.16215v2 公告类型:替换并交叉发布 摘要:多轮工具使用智能体必须在多轮交互中进行推理、调用工具并根据观测结果作出调整。对此类智能体进行后训练颇具挑战:强化学习虽然与仅依赖提示的推理设置相匹配,却常常面临奖励稀疏和信用分配能力不足的问题;而基于专家轨迹的监督微调虽能提供密集的过程监督,却可能使模型过度受限于固定轨迹。为解决这些问题,我们提出 PACT,一种面向多轮工具使用智能体的特权轨迹协同训练框架。其核心思想是仅将专家轨迹用作训练时的优化信号,而非轨迹生成时的提示。PACT 在生成交互轨迹时仍仅使用提示,随后通过两种互补信号利用专家轨迹指导优化:一种是以轨迹为条件的强化学习代理目标,在专家轨迹上下文下评估仅基于提示生成的交互轨迹;另一种是组件感知的监督微调损失,对推理和工具调用组件提供逐步退火的过程监督。为减少对仅在训练时可用的轨迹上下文的过度依赖,PACT 引入了仅提示锚定机制,采用标准的仅提示强化学习更新。在 FTRL、BFCL 和 ToolHop 上的实验表明,PACT 始终优于基于监督微调和强化学习的强基线。进一步分析证实了这两种训练目标的互补性,以及组件感知监督和仅提示锚定机制的益处。这些结果彰显了特权轨迹协同训练在多轮工具使用学习中的有效性。项目页面:https://zhenbangdu.github.io/pact-project-page。

arXiv cs.LG72

Lesion-DDPM:用于多发性硬化 MRI 合成的病灶增强型三维扩散

arXiv:2606.15457v2 公告类型:replace-cross 摘要:三维 FLAIR MRI 被广泛推荐为多发性硬化(MS)脑成像的标准 MRI 序列之一,但公开可用的 MS 数据集规模仍相对较小,且在扫描仪、采集协议和病灶模式方面存在差异。这种数据稀缺性和变异性阻碍了稳健的神经影像机器学习模型的开发,对于旨在合成图像的同时保留微小、稀疏病灶的生成模型而言,挑战尤为突出。我们提出 Lesion-DDPM,这是一种用于病灶感知 FLAIR 合成的三维条件扩散框架,将多层级解剖掩膜注入与病灶加权重建损失相结合,在保持全局脑结构的同时强化对病灶体素的关注。我们使用经过整理的 MSLesSeg 数据集子集,将 Lesion-DDPM 与具有代表性的最先进 GAN 模型和扩散模型进行比较,同时评估图像生成指标和下游 3D U-Net 分割表现。在实验中,Lesion-DDPM 在所有方法中取得了最低的病灶区域重建误差。在下游 3D U-Net 病灶分割任务中,仅使用 Lesion-DDPM 生成的扫描图像训练、并在真实 MRI 上评估的模型达到了 0.616 的 Dice 分数,而表现最好的对比合成数据集对应的分数为 0.569。将 Lesion-DDPM 图像加入真实训练集后,Dice 分数进一步提升至 0.685。

arXiv cs.LG77

智能体的最后一场考试

arXiv:2606.05405v3 公告类型:replace-cross 摘要:近期,AI 系统在众多基准测试中取得了优异成绩,但这些进展尚未转化为众多专业领域中具有经济意义的实际部署。我们认为,这一差距在很大程度上源于评估问题:广泛使用的基准缺乏对真实且具有经济价值的工作流程的持续性能衡量。本文介绍 Agents' Last Exam (ALE),这是一个旨在评估 AI 智能体完成长周期、具有经济价值且结果可验证的真实世界任务的基准。ALE 与 250 多位行业专家合作开发,涵盖参照 O*NET / SOC 2018(美国联邦职业分类体系)界定的非体力劳动行业。其任务分类体系包含 55 个细分领域,归为 13 个行业集群,覆盖 1,000 多项任务。当前结果表明,最困难层级仍远未达到性能饱和:在各种主流运行框架与骨干模型配置下,平均完全通过率低于 1%。ALE 被设计为一个持续演进的基准:随着新工作流程和行业的纳入,其任务池不断扩展。更广泛而言,ALE 不仅旨在提供又一个排行榜,更希望成为缩小基准测试成功与 GDP 相关实际影响之间差距的工具。

arXiv cs.LG74

物理学的无形之手:当视频扩散模型知道的比展现的更多

arXiv:2606.05328v2 公告类型:replace-cross 摘要:现代视频扩散模型生成的视频日益逼真,且具有越来越强的时间连贯性,这促使人们将其视为世界模拟器的候选方案。然而,这些模型究竟是在内部编码了物理结构,还是仅仅复现了训练中见过的运动模式,目前仍不清楚。我们沿着与物理合理性已知的真实视频相对应的潜在轨迹,对视频扩散模型进行探测,以研究这一问题。为获得这些轨迹,我们从无噪声的视频潜在表示出发,对学习到的速度场进行反向积分直至噪声,从而近似逆转确定性采样过程,进而获取模型的中间状态和注意力图。利用这些恢复的轨迹,我们表明,在 IntPhys 和 InfLevel 上,均可从扩散 Transformer 的状态中线性解码出物理合理性,平均准确率达到约 81.27%,优于 V-JEPA 和 VideoMAE 等专门的表征学习基线。令人惊讶的是,VAE 的潜在输入中并不存在这一信号,它是在去噪 Transformer 内部涌现的,尽管该模型并未采用自监督预测目标进行训练。这些发现表明,具有物理意义的表征可以作为生成式去噪的副产物而产生。

arXiv cs.LG79

微调过程中虚假相关性的无监督识别与去除

arXiv:2605.27676v2 公告类型:替换并交叉归类 摘要:在经过筛选整理的数据集上微调预训练语言模型,可能会在微调任务与非预期的潜在因素(如失准人格或政治倾向)之间产生虚假相关性,因为数据筛选整理过程已将这些因素与任务纠缠在一起。模型可能会依赖这些虚假相关性,从而产生偏见并降低分布外泛化能力。我们证明,在对任务复杂度和虚假相关性作出合理假设的情况下,可以在没有监督的条件下,从朴素 LoRA 微调所得的权重中识别这些潜在因素。现有的偏见去除方法(如激活引导)会在推理或训练期间,从残差流激活中移除已识别的因素。然而,我们认为,目标应当是去除虚假相关性,而不是潜在因素本身,因为预训练模型可能依赖该因素来获取真正的任务信号。为此,我们提出 GRASP(GRadient projection of Associated Spurious Patterns),在保留预训练模型沿该潜在因素方向已有内容的同时,防止模型对已识别的潜在因素形成新的依赖。我们在三个微调任务上进行了验证。前两个任务涉及涌现性失准,即在狭窄任务上进行微调(在我们的实验中,分别是编写不安全代码和提供不当医疗建议),会导致模型在无关话题上给出失准回答。在这两种情形下,我们的方法分别完全消除了不安全代码场景中的失准,并将不当医疗建议场景中的失准降至约五分之一,在减少失准与保留任务能力之间的权衡上优于所有基线。最后一个任务是一项新的政治偏见实验:在右倾的 Reddit 财务建议数据上进行微调,会导致模型在无关话题上的政治倾向发生漂移。在该实验中,我们的方法将漂移幅度降低了一半以上,同时提升了财务任务表现,优于所有基线。

arXiv cs.LG72

TabPFN 是保险定价的万能解法吗?

arXiv:2605.22892v3 公告类型:replace-cross 摘要:非寿险定价中的索赔频率和索赔损失程度建模主要依赖广义线性模型(GLM),而梯度提升机是主要的机器学习替代方案。表格基础模型(TFM)提出了一种根本不同的推理范式。通过在大量合成数据集上进行预训练,TFM 能够借助上下文学习对新数据进行推理,无须针对特定数据集进行预处理、拟合或超参数调优。本文首次对 TabPFN 在机动车保险定价中的应用进行了实证评估,在两个公开可用的机动车第三者责任险(MTPL)数据集上,将两个版本的 TabPFN 与 GLM 和 XGBoost 进行了基准比较。结果表明,TabPFN 并未始终优于成熟的基线模型:在索赔频率建模方面,其表现不及 GLM,且性能取决于上下文训练集的规模;但在数据更为稀缺的索赔损失程度建模方面,它具有竞争力。其推理耗时则明显更长。尽管表格基础模型前景可期,尤其是在数据稀缺的场景下,但 TabPFN 尚不足以取代成熟的索赔频率精算建模方法。

arXiv cs.LG70

Cross-View Attention Fusion Net: A Prior-Guided Dual-View Representation Learning for Cardiac Output Estimation from Short-Term PPG Signals

arXiv:2605.19666v2 Announce Type: replace-cross Abstract: Accurate cardiac output (CO) estimation from photoplethysmography (PPG) is promising for unobtrusive hemodynamic monitoring, but remains difficult since CO is jointly determined by cardiac function and vascular tone. Conventional feature-based models use physiologically meaningful PPG descriptors, yet depend on accurate pulse detection and may miss latent temporal relationships. In contrast, fully end-to-end deep learning models learn directly from raw PPG but often underuse established PPG-derived prior information. Here, we introduce the Cross-View Attention Fusion Network (CVAF-Net), a prior-guided dual-view deep learning model for CO estimation from short, fixed-length PPG segments. CVAF-Net processes raw PPG as a temporal view and a feature sequence map (FSM) as a structured prior-guided view, and fuses the two representations through cross-view attention. The model was independently evaluated using 5-, 15-, and 30-s segments from three datasets: simulated pulse waves (3323 subjects), vasoconstriction provocation (79 subjects), and resting/cycling activities (10 subjects), and was compared with multiple machine learning and deep learning benchmarks. CVAF-Net outperformed most benchmark methods and achieved performance comparable to a state-of-the-art Transformer-based model, with a mean absolute error (MAE) of 0.19 L/min (MAPE: 3.95%) on simulated data and high accuracy in real-world settings (minimum MAE: 1.20 L/min). Importantly, CVAF-Net reduced FLOPs by twelvefold compared with the leading Transformer-based model. Plausibility analysis showed physiologically consistent CO estimates, with expected correlations with age ($\rho = -0.274$), heart rate ($\rho = 0.894$), and systemic vascular resistance ($\rho = -0.740$). These findings indicate that CVAF-Net provides an accurate, computationally efficient, and generalizable approach for continuous wearable-based CO monitoring.

arXiv cs.LG65

Stochastic Compositional Optimization via Hybrid Momentum Frank--Wolfe

arXiv:2605.15350v2 Announce Type: replace-cross Abstract: Stochastic compositional optimization minimizes $F(f(x), x)$ over a compact convex set when the inner map $f$ is available only through noisy samples. We propose Hybrid Momentum Stochastic Frank--Wolfe, a projection-free method for outer functions $F$ that are jointly convex and Lipschitz but not necessarily differentiable, such as maxima, CVaR, and norms. The method tracks the Jacobian and the value of $f$ with momentum, using a Taylor correction for the value, and passes the tracked linearization to a generalized linear minimization oracle. Under finite-variance noise, it attains an expected generalized Frank--Wolfe gap of order $K^{-1/4}$ for non-convex objectives and, when the linearized models minorize the objective, a last-iterate primal error of order $K^{-1/3}$. The analysis extends to heavy-tailed noise without clipping, with separate moment orders for values and Jacobians. With an exact oracle, the method reduces to the deterministic method of Vladarean et al. (2023).

arXiv cs.LG77

Vision2Code:用于评估图像到代码生成的多领域基准

arXiv:2605.11307v2 公告类型:replace-cross 摘要:我们研究视觉语言模型(VLM)能否通过编写可执行代码来生成图像,从而重建结构化的图形类图像。现有图像到代码生成基准通常覆盖的领域有限,依赖参考源代码进行评估,且未提供可量化领域特定问题的指标。为此,我们提出 Vision2Code,这是一个无需参考代码的多领域基准,包含来自 15 个不同数据集的 539 个测试样例,涵盖图表与绘图、几何图形、图结构、科学示意图、文档和三维空间场景。评估时,我们执行生成的程序,并让 VLM 评判模型依据针对各数据集和领域制定的评分准则,将程序的渲染输出与源图像进行比较。我们发现,以这种方式获得的最终分数与人类评分的相关性,显著高于使用通用 VLM 评分准则,或标准的基于像素、基于嵌入及感知相似性指标所获得的分数。我们进一步证明,在对 VLM 评判模型进行重复采样、调整评分准则权重以及引入受控错误的情况下,我们的评估仍然可靠。结果表明,现有图像到代码生成模型在不同领域的表现存在差异,其中在图表和图结构上的准确率显著高于其他领域。最后,我们展示了该评分方法在通过拒绝采样筛选生成程序以用于微调方面的实用价值:与各自的基础模型检查点相比,Qwen3.5-9B 的表现提升了 16%,Phi-4-MM 提升了 28%。我们的代码和数据已公开发布于 https://image2code.github.io/vision2code/。

arXiv cs.LG68

UxSID: Semantic-Aware User Interests Modeling for Ultra-Long Sequence

arXiv:2605.09040v4 Announce Type: replace-cross Abstract: Modeling ultra-long user sequences involves a difficult trade-off between efficiency and effectiveness. While current paradigms rely on either item-specific search or item-agnostic compression, we propose UxSID, a framework exploring a third path: semantic-group shared interest memory. By utilizing Semantic IDs (SIDs) and a dual-level attention strategy, UxSID captures target-aware preferences without the heavy cost of item-specific models. This end-to-end architecture balances computational parsimony with semantic awareness, achieving state-of-the-art performance and a 0.337% revenue lift in large-scale advertising A/B test.

arXiv cs.LG75

具有全局最优性与近似保证的脉冲神经网络凸优化

arXiv:2605.08022v3 公告类型:replace-cross 摘要:脉冲神经网络(SNN)被提出作为深度神经网络的节能替代方案。其训练是非凸的,并且涉及不可微的脉冲函数,因此现有方法无法保证达到全局最优。我们通过将 SNN 优化表述为等价的凸优化问题来解决这一问题。具体而言,我们证明,对于一类阈值 RNN(包括漏积分发放 SNN),其带权重衰减正则化的训练问题具有零对偶间隙,且最优值与一个凸规划相同。由于所得凸规划的变量数量可能随数据量呈指数级增长,我们引入了一种实用的随机化替代方案,并对其近似质量给出了高概率保证。实验表明,表现最佳的凸优化变体在加法和 first-last-XOR 任务上优于替代梯度训练,在序列 MNIST 任务上与其表现相当,但在三进制和五进制加法任务上落后于储备池基线。

arXiv cs.LG77

FactoryBench:评估工业机器理解能力

arXiv:2605.07675v2 公告类型:替换并交叉列出 摘要:我们提出 FactoryBench,这是一个基于工业机器人遥测数据、用于评估时间序列模型和大语言模型(LLM)机器理解能力的基准。问答对按照四个因果层级(状态、干预、反事实、决策)组织,具体体现 Pearl 的因果阶梯,并涵盖五种答案格式:四种结构化格式采用确定性方式评分,自由形式答案则通过以 LLM 为裁判的投票协议评分。我们提出了一个围绕结构化问题模板构建的可扩展问答生成框架,介绍了 FactoryWave(一个从 UR3 协作机器人和 KUKA KR10 工业机械臂采集的高密度、多任务、多变量传感器数据集),并基于 FactoryWave、AURSAD 和 voraus-AD 中约 1.5 万个标准化片段,构建了包含超过 7 万个问答条目的大规模基准 FactoryBench。对六个前沿 LLM 的零样本评估表明,没有任何模型在结构化层级上的得分超过 50%,也没有任何模型在决策层级上的得分超过 18%,这揭示了当前模型与实际运行所需的机器理解能力之间的巨大差距。

arXiv cs.LG62

Fairness-Guided DQN-Based TXOP Control for NR-U/Wi-Fi Coexistence

arXiv:2605.00457v5 Announce Type: replace-cross Abstract: New Radio operating in unlicensed spectrum (NR-U) and Wi-Fi employ different contention parameters and channel-occupancy durations, which can produce severe coexistence imbalance. This correspondence develops a fairness-guided deep Q-network (DQN) that adjusts the NR-U transmission opportunity (TXOP) using the observed per-node throughput ratio. Two reward designs, Q1 and Q2, expose complementary operating regimes. Q1 promotes strict per-node throughput balance, whereas Q2 admits a broader inter-radio-access-technology fairness region and rewards throughput improvement in an intermediate fairness band. The policies are compared with the default Third Generation Partnership Project (3GPP) listen-before-talk (LBT), an adapted multi-armed-bandit method, a utility-fairness-based tabular Q-learning comparator, and a default-referenced fixed-TXOP baseline. Experiments across four priority classes and asymmetric populations report aggregate throughput, user-level Jain fairness, and concave throughput utility over 20 independent trials. The results characterize the cost of strict fairness, efficiency recovery under moderate relaxation, and transfer from symmetric to asymmetric deployments.

arXiv cs.LG73

奥卡姆剃刀的锋利程度取决于你的 ELBO

arXiv:2604.25984v2 公告类型:replace-cross 摘要:边际似然又称证据,被视为奥卡姆剃刀原则的数学体现,能够实现避免过拟合的超参数选择。变分推断中的证据下界(ELBO)目标也被用于类似目的。本文根据控制信号和噪声方差的关键超参数,定义了贝叶斯线性回归的信噪比(SNR)。随后,我们研究了基于 ELBO 的超参数学习如何因高斯近似后验所假设的协方差矩阵结构不同而低估或高估 SNR。我们证明,假设协方差矩阵为对角矩阵或低秩加对角矩阵会低估 SNR,而假设其为低秩矩阵则会高估 SNR。低估 SNR 会使训练集上的均方误差高于最优水平(欠拟合),而高估 SNR 则会使误差更低(过拟合)。希望将贝叶斯方法扩展至大型模型的实践者应谨慎考虑:为确保计算可行性而采用的协方差假设可能如何影响模型选择。

arXiv cs.LG70

MVNN: A Measure-Valued Neural Network for Learning McKean-Vlasov Dynamics from Particle Data

arXiv:2604.00333v3 Announce Type: replace-cross Abstract: Collective behaviors that emerge from interactions are fundamental to numerous biological systems. To learn such interacting forces from observations, we introduce a measure-valued neural network that infers measure-dependent interaction (drift) terms directly from particle-trajectory observations. The proposed architecture generalizes standard neural networks to operate on probability measures by learning cylindrical features, using an embedding network that produces scalable distribution-to-vector representations. On the theory side, we establish well-posedness of the resulting dynamics and prove propagation-of-chaos for the associated interacting-particle system. We further show universal approximation and quantitative approximation rates under a low-dimensional measure-dependence assumption. Numerical experiments on first and second order systems, including deterministic and stochastic Motsch-Tadmor dynamics, two-dimensional attraction-repulsion aggregation, Cucker-Smale dynamics, and a hierarchical multi-group system, demonstrate accurate prediction and strong out-of-distribution generalization.

arXiv cs.LG68

Locally Private Parametric Methods for Change-Point Detection

arXiv:2602.13619v2 Announce Type: replace-cross Abstract: We study parametric change-point detection under local differential privacy, focusing on the offline localization of a single change point in a sequence of independent observations.~In the non-private setting, we derive improved finite-sample accuracy guarantees for a generalized likelihood-ratio estimator using martingale methods.~We establish finite-sample minimax lower bounds in both the non-private and locally private settings, showing that localization accuracy is fundamentally limited by the Chernoff information between the pre- and post-change distributions.~Guided by this, we design locally private CPD algorithms based on aggregated randomized response and binary mechanisms, which maximize the Chernoff information between the induced output distributions in low- and high-privacy regimes, respectively, and derive their finite-sample guarantees. Together, our upper and lower bounds quantify the statistical cost of privacy in change-point localization.~As part of our analysis, we also show that strong data processing inequality coefficients of R\'enyi divergence and Jeffreys--R\'enyi divergence of order infinity can be computed by restricting to pairs of input distributions with a common support of at most two symbols.~We corroborate our results through empirical evaluation on synthetic data.

arXiv cs.LG75

RanSOM:用于约束与无约束优化的随机缩放二阶动量

arXiv:2602.06824v3 公告类型:替换并交叉列出 摘要:二阶动量通过 Hessian 向量积(HVP)修正动量相对于当前梯度的滞后,但现有修正方法要么要求 Hessian 满足 Lipschitz 条件,要么需要在辅助点进行额外的前向和反向传播。我们证明,随机化步长可以消除这一权衡:如果步长服从均值为 $\eta$ 的指数分布,则一个 Stein 型恒等式表明,在新迭代点计算的一次 HVP 乘以 $\eta$,就是梯度变化的一个估计,且该估计关于步长的期望是无偏的;此外,该 HVP 与下一次梯度计算共享前向传播。由此得到的方法 RanSOM-E 适用于归一化步、符号步和 Muon 型步,而采用 Beta 分布的变体 RanSOM-B 则可使 Frank-Wolfe 迭代点保持可行。对于梯度满足 Lipschitz 条件、且梯度噪声和 Hessian 噪声具有重尾分布、尾指数为 $p, q \in (1,2]$ 的目标函数,RanSOM-E 无需 Hessian 满足 Lipschitz 条件,也无需裁剪,即可对每一对 $(p,q)$(包括 $p \neq q$)达到最优的预言机复杂度指数(当 $p = q = 2$ 时为 $\mathcal{O}(\varepsilon^{-3})$)。在 CIFAR-10 上使用 ResNet-20 的实验中,我们未检测到其与现有二阶动量方法之间的准确率差异,且其平均更新时间低于辅助点方法。

arXiv cs.LG71

非平稳加权风险最小化的快速收敛速率

arXiv:2602.05742v3 公告类型:replace-cross 摘要:加权经验风险最小化是分布漂移条件下进行预测的一种常用方法。本文研究其在非平稳条件下的样本外预测误差。我们给出将超额风险分解为学习项和分布漂移相关误差项的一般形式,并证明混合条件下学习误差的预言不等式。学习误差界对任意权重类一致成立,并考虑了权重向量所诱导的有效样本量、权重类与假设类的复杂度,以及潜在的数据依赖性。我们还分析了平方损失情形下的漂移误差,并为结构突变过程和平滑漂移过程给出显式界。随后,我们在采用线性模型、基函数近似和神经网络的(自)回归问题中,将学习误差分析与漂移误差分析相结合。在所有情形下,最优权重均由学习与漂移之间的偏差—方差权衡刻画;而在无权重且平稳的特殊情形下,则可恢复极小极大最优速率(相差至多对数因子)。

arXiv cs.LG77

HumanX:从人类视频中学习敏捷且可泛化的人形机器人交互技能

arXiv:2602.02473v2 公告类型:replace-cross 摘要:让人形机器人执行敏捷且自适应的交互,一直是机器人领域的核心挑战。当前方法受限于逼真交互数据的稀缺,或依赖精细的任务专用奖励设计,这限制了其可扩展性。为缩小这一差距,我们提出 HumanX,这是一个统一框架,可将人类视频转化为人形机器人可泛化的现实世界交互技能,无需针对每项任务单独设计。HumanX 集成了两个协同设计的组件:XGen 是一条以锚点为中心的数据生成流水线,从单目视频中生成符合物理规律的机器人交互数据,并通过数据增强构建多样化、可扩展的训练数据集;XMimic 是一个交互优先的学习框架,可从数秒的演示中学习可泛化的交互技能。我们在篮球、足球、羽毛球、货物拾取和反应式格斗五个不同领域进行评估,HumanX 成功习得了 9 种不同技能,并将其零样本迁移至实体 Unitree G1 人形机器人。习得的能力包括在不依赖任何外部感知的情况下完成投篮假动作接转身后仰跳投等复杂动作,以及仅从单段视频演示中学会连续超过 10 个回合的人机传球等交互任务。实验表明,HumanX 的泛化成功率高于以往方法,展示了在一类可锚定的交互中学习多样化现实世界机器人交互技能的可扩展路径。

arXiv cs.LG70

A Generalizable Machine Learning Framework for Half-Heusler Thermoelectrics

arXiv:2602.01149v2 Announce Type: replace-cross Abstract: Machine learning (ML) has emerged as a powerful approach for accelerating the discovery of thermoelectric (TE) materials, yet many models suffer from limited generalizability. Here we present a robust ML framework for predicting the thermoelectric figure of merit (zT) in half-Heusler (hH) compounds, emphasizing prediction of previously unseen compositions. A principal component analysis (PCA)-based train/test splitting strategy is introduced to generate representative partitions of chemical space. Bayesian hyperparameter optimization is combined with correlation-based k-best feature selection for Random Forest, XGBoost, and Neural Network models, together with the interpretable SISSO symbolic-regression method. Relative to the full set of 118 input features, the optimized feature subsets reduce the test RMSE by 16-27%. SHAP and SISSO analyses identify temperature, A-site dopant concentration, and A-site heat of vaporization as the most important descriptors of zT. The framework is validated through prediction of previously unexplored compositions, recovery of literature-reported optimal zT values for established hH systems, and first-principles calculations for the new compounds CeCoBi and CeIrBi, which exhibit favorable electronic transport properties. The framework is further applied to high-throughput screening of the doped hH chemical space, covering about 2.46 million elemental substitution combinations across 631 thermodynamically screened parent matrices under stability constraints. This screening yields a concise set of promising candidates for future study. Overall, the work establishes a generalizable workflow for reliable data-driven thermoelectric materials discovery.

arXiv cs.LG75

RPP:数据集不平衡条件下针对后门攻击的可认证投毒样本检测框架

arXiv:2602.00183v2 公告类型:replace-cross 摘要:深度神经网络极易受到后门攻击,但迄今为止,大多数防御方法都依赖平衡数据,忽视了现实场景中普遍存在、且可能放大后门威胁的类别不平衡问题。本文首次深入研究了数据集不平衡如何加剧后门脆弱性,结果表明:(i) 不平衡会导致多数类偏向,从而增加模型对后门攻击的易感性;(ii) 随着不平衡程度加剧,传统防御方法的性能显著下降。为解决这一问题,我们提出 Randomized Probability Perturbation(RPP),这是一种可认证的投毒样本检测框架,仅利用模型输出概率即可在黑盒环境下运行。对于任意待检测样本,RPP 能够判断输入是否经过后门操纵,同时提供可证明的域内可检测性保证以及误报率的概率上界。在五个基准数据集(MNIST、SVHN、CIFAR-10、TinyImageNet 和 ImageNet10)上开展的广泛实验涵盖了 10 种后门攻击和 12 种基线防御方法,结果表明,RPP 的检测准确率显著高于当前最先进的防御方法,尤其是在数据集不平衡的条件下。RPP 为在数据不平衡的现实环境中防御后门攻击奠定了理论与实践基础。

arXiv cs.LG68

Learning to accelerate Krasnosel'skii-Mann fixed-point iterations with guarantees

arXiv:2601.07665v2 Announce Type: replace-cross Abstract: We introduce a principled learning to optimize (L2O) framework for solving fixed-point problems involving general nonexpansive mappings. Our idea is to deliberately inject summable perturbations into a standard Krasnosel'skii-Mann iteration to improve its average-case performance over a specific distribution of problems while retaining its convergence guarantees. Under a metric sub-regularity assumption, we prove that the proposed parametrization includes only iterations that locally achieve linear convergence-up to a vanishing bias term-and that it encompasses all iterations that do so at a sufficiently fast rate. We then demonstrate how our framework can be used to augment several widely-used operator splitting methods to accelerate the solution of structured monotone inclusion problems, and validate our approach on a best approximation problem using an L2O-augmented Douglas-Rachford splitting algorithm.

arXiv cs.LG64

Probabilistic Multi-Agent Aircraft Landing Time Prediction

arXiv:2512.08281v3 Announce Type: replace-cross Abstract: Accurate and reliable aircraft landing time prediction is essential for effective resource allocation in air traffic management. However, the inherent uncertainty of aircraft trajectories and traffic flows poses significant challenges to both prediction accuracy and trustworthiness. Therefore, prediction models should not only provide point estimates of aircraft landing times but also the uncertainties associated with these predictions. Furthermore, aircraft trajectories are frequently influenced by the presence of nearby aircraft through air traffic control interventions such as radar vectoring. Consequently, landing time prediction models must account for multi-agent interactions in the airspace. In this work, we propose a probabilistic multi-agent aircraft landing time prediction framework that provides the landing times of multiple aircraft as distributions. We evaluate the proposed framework using an air traffic surveillance dataset collected from the terminal airspace of the Incheon International Airport in South Korea. The results demonstrate that the proposed model achieves higher prediction accuracy than the baselines and quantifies the associated uncertainties of its outcomes. In addition, the model uncovered underlying patterns in air traffic control through its attention scores, thereby enhancing explainability.

arXiv cs.LG

MetaJoin: Adaptive Join Selections for Heterogeneous Tables

arXiv:2512.02444v2 Announce Type: replace-cross Abstract: Joining heterogeneous tables requires different forms of correspondence, including exact agreement, syntactic transformation, semantic similarity, and entity-level matching. The appropriate join method is often unknown in advance, while running every candidate method incurs unnecessary cost. We introduce MetaJoin, a label-free framework for adaptive join selection. MetaJoin uses input evidence to choose an initial specialist, then uses specialist-specific output evidence to determine whether that result should be retained, compared with an alternative, escalated, or repaired. This allows join selection to adapt after execution rather than committing to a one-shot routing decision. We also introduce MNN Join, a transformation specialist that searches for string transformations by maximizing mutual-nearest-neighbor coverage between two unaligned columns and uses the same reciprocal structure to validate its output. We evaluate MetaJoin on 670 datasets from six benchmarks. It achieves 0.817 macro row-F1, slightly exceeding a benchmark-level oracle that is given the best standalone specialist for each benchmark (0.812), and outperforms label-free selection policies built from the same specialist portfolio by more than 0.13. Across the 609 datasets in the four transformation-dominant benchmarks, MNN Join outperforms every evaluated transformation baseline. Finally, MetaJoin's accuracy varies by only 0.015 as the controller backbone ranges from 3B to 14B parameters, showing that output validation and repair substantially reduce dependence on the initial routing decision.

arXiv cs.LG70

Infinitesimal Operator World Models: Finite-Sample Guarantees for Offline Reinforcement Learning

arXiv:2511.10383v2 Announce Type: replace-cross Abstract: Continuous-time stochastic processes underlie many natural and engineered systems. In healthcare, autonomous driving, and industrial control, direct interaction with the environment is often unsafe or impractical, motivating offline reinforcement learning from historical data. However, there is limited statistical understanding of the approximation errors inherent in learning policies from offline datasets. We address this by linking reinforcement learning to the Hamilton-Jacobi-Bellman equation and proposing an operator-theoretic algorithm based on a simple dynamic programming recursion. Specifically, we represent our world model in terms of the infinitesimal generator of controlled diffusion processes learned in a reproducing kernel Hilbert space. By integrating statistical learning methods and operator theory, we establish global convergence of the value function under sufficiently small generator-approximation error and derive explicit finite-sample guarantees with bounds tied directly to system properties such as smoothness and stability. Our theoretical and proof-of-concept results indicate that operator-based approaches may hold promise for solving offline reinforcement learning using continuous-time optimal control.

arXiv cs.LG

Second-Order Optimization with Asynchronous Curvature

arXiv:2510.15714v4 Announce Type: replace-cross Abstract: Second-order methods make fast progress per iteration, but forming and factorizing the Hessian often dominates their wall-clock time. We study \emph{Split-Client}, a task-parallel design in which a curvature client factorizes Hessians in the background while a gradient client takes cubic-regularized steps with the most recently published matrix, so that curvature cost appears as a delay rather than as blocking time. For delayed exact Hessians, we prove a first-order stationarity bound that depends on the average age of the curvature rather than its maximum, using an overlap count and a weighted Hardy inequality that allows any bounded-error initial matrix; the analysis extends to subsampled and uniformly inexact curvature. Under a fixed-cost model, the resulting wall-clock bound matches the scaling of optimally tuned Lazy Hessian without choosing a reuse period. In experiments on two LIBSVM datasets, an implementation decreases the objective earlier in wall-clock time than Lazy and Vanilla cubic Newton, with the largest gains at intermediate accuracy.

arXiv cs.LG79

ABLEIST:LLM 生成的招聘情境中的交叉性残障偏见

arXiv:2510.10998v2 公告类型:replace-cross 摘要:大型语言模型(LLM)因在招聘等高风险领域延续基于身份的歧视,尤其是针对残障人士(PwD)的歧视,正受到越来越多的审视。然而,现有研究仍主要以西方为中心,忽视了性别和种姓等相互交织的边缘化形式如何塑造全球南方残障人士的经历。我们对六个 LLM 进行了全面审计,涵盖 2,820 个招聘情境,涉及不同的残障、性别、国籍和种姓背景。为捕捉隐蔽的交叉性伤害与偏见,我们提出了 ABLEIST(健全主义、励志化、超人化和象征性纳入),这套指标以残障研究文献为基础,包括五项健全主义特定伤害指标和三项交叉性伤害指标。结果显示,针对残障候选人的 ABLEIST 伤害显著增加,而许多最先进的模型未能检测出这些伤害。对于因性别和种姓而被边缘化的残障候选人,交叉性伤害(例如象征性纳入)急剧增加,进一步放大了上述伤害。这凸显了当前安全工具的重大盲点,以及在招聘等高风险领域对前沿模型开展交叉性安全评估的必要性。

arXiv cs.LG61

Surrogate Graph Partitioning for Spatial Prediction

arXiv:2510.07832v2 Announce Type: replace-cross Abstract: Spatial prediction refers to the estimation of unobserved values from spatially distributed observations. Although recent advances have improved the capacity to model diverse observation types, adoption in practice remains limited in industries that demand interpretability. To mitigate this gap, surrogate models that explain black-box predictors provide a promising path toward interpretable decision making. In this study, we propose a graph partitioning problem to construct spatial segments that minimize the sum of within-segment variances of individual predictions. The assignment of data points to segments can be formulated as a mixed-integer quadratic programming problem. While this formulation potentially enables the identification of exact segments, its computational complexity becomes prohibitive as the number of data points increases. Motivated by this challenge, we develop an approximation scheme that leverages the structural properties of graph partitioning. Experimental results demonstrate the computational efficiency of this approximation in identifying spatial segments.

arXiv cs.LG67

Approximation of differential entropy in Bayesian optimal experimental design

arXiv:2510.00734v2 Announce Type: replace-cross Abstract: Bayesian optimal experimental design provides a principled framework for selecting experimental configurations that maximize obtained information. In this work, we consider settings where the likelihood entropy is independent of the design or can be evaluated explicitly, which applies, e.g. to additive noise models with design-independent or explicitly computable noise entropy. This reduces the problem to maximum entropy estimation, where the nested integral defining the expected information gain collapses into a single integral. Our study is motivated by large-scale inference problems, such as inverse problems, where the computational cost is dominated by expensive likelihood evaluations. Under additive Gaussian noise model, we propose a computational approach in which the evidence density is approximated by a Monte Carlo or quasi-Monte Carlo surrogate, while the differential entropy is evaluated using standard methods without additional likelihood evaluations. We prove that this strategy achieves convergence rates that are comparable to, or better than, state-of-the-art methods for full expected information gain estimation, particularly when the cost of entropy evaluation is negligible. Our approach relies only on mild smoothness of the forward map and avoids stronger technical assumptions required in earlier work. We also present numerical experiments, which confirm some of our theoretical findings.

arXiv cs.LG72

UniConFlow:用于可认证运动规划的统一约束流匹配框架

arXiv:2506.02955v3 公告类型:替换并交叉列出 摘要:生成模型已成为机器人运动生成领域日益强大的工具,能够在各种任务中灵活生成多模态轨迹。然而,大多数现有方法在处理多种类型的约束时仍存在局限,例如避碰、驱动限制和动力学一致性;这些约束通常被单独处理,或通过启发式方法处理。在本研究中,我们提出 UniConFlow,这是一种基于统一约束流匹配的轨迹生成框架,可系统地纳入等式和不等式约束。此外,UniConFlow 引入了一种新颖的预设时间归零函数,在推理过程中塑造时变引导场,使生成过程能够适应不同的系统模型和任务要求。为进一步应对长时域、高维轨迹生成带来的计算挑战,我们还针对终端约束施加和推理过程提出了两种实用策略:一种违规片段提取方案,可精确定位并仅优化轨迹中违反约束的部分;以及一种轨迹压缩方法,可在降维空间中加速优化,同时保持解码后重建的高保真度。我们在双倒立摆、从现实到仿真的赛车任务以及从仿真到现实的操作任务这三项实验中进行了实证验证,结果表明,UniConFlow 优于最先进的生成式规划器和传统优化基线,在安全性、运动学与动力学一致性以及动作可行性等可认证运动规划指标上取得了更优的表现。项目页面:https://uniconflow.github.io。

arXiv cs.LG61

Physics-inspired Generative AI models via real hardware-based noisy quantum diffusion

arXiv:2505.22193v2 Announce Type: replace-cross Abstract: Quantum Diffusion Models (QDMs) are an emerging paradigm in Generative AI that aims to use quantum properties to improve the performances of their classical counterparts. However, existing algorithms are not easily scalable due to the limitations of near-term quantum devices. Following our previous work on QDMs, here we propose and implement two physics-inspired protocols. In the first, we use the formalism of quantum stochastic walks, showing that a specific interplay of quantum and classical dynamics in the forward process produces statistically more robust models generating sets of MNIST images with lower Fr\'echet Inception Distance (FID) than using totally classical dynamics. In the second approach, we realize an algorithm to generate images by exploiting the intrinsic noise of real IBM quantum hardware with only four qubits. Our work could be a starting point to pave the way for new scenarios for large-scale algorithms in quantum Generative AI, where quantum noise is neither mitigated nor corrected, but instead exploited as a useful resource.

arXiv cs.LG83

在提示注入防御面向用户之前进行审计:强大对手揭示了什么

arXiv:2505.15738v3 公告类型:替换并交叉列出 摘要:大型语言模型日益广泛地部署于面向用户的产品中,这些产品在处理敏感个人数据的同时,还会与不可信的外部内容交互。这使它们成为提示注入攻击的主要目标:攻击者在这些内容中注入恶意指令,以劫持模型。已有研究提出基于微调的防御方法,通过训练模型遵循正常的用户指令并忽略注入的指令,来缓解此类攻击。由于缺乏形式化保证,这些防御方法通常使用当时可获得的、最有效且符合现实条件的攻击进行实证评估,并往往报告接近零的攻击成功率。这给开发者及依赖他们的用户带来了虚假的安全感,同时仍存在一种可能:未来更强大的攻击可能绕过这些防御,并在广泛部署的系统中造成严重后果。本文主张,开发者应在发布前对防御措施进行压力测试,并提出了一个审计框架,使防御方无需自行发明下一种最先进的攻击方法,就能完成这项测试。我们的关键洞见是,微调过程本身会产生有用的产物:中间检查点可作为基于优化的攻击的跳板。尽管真实攻击者无法获取这些产物,但我们证明,它们暴露的漏洞是真实存在的,并且可被现实条件下的攻击者利用。通过使用 GCG 和 BEAST 等基于优化的攻击来具体实现这一框架,我们将针对最先进防御方法的攻击成功率从接近零提高至最高 96\%,揭示了以往评估遗漏的弱点。我们的结果表明,当前的评估实践可能大幅高估防御的鲁棒性,而在部署前使用强大对手审计防御措施,能够缩短反馈循环,并有助于防止攻击在现实世界中对用户造成伤害。

arXiv cs.LG77

快速局地城市微气候模拟器:未见城市形态中的风场与温度场

arXiv:2503.19708v3 公告类型:replace-cross 摘要:城市微气候涵盖受建筑几何形态影响的风场和温度场,对建筑能耗、行人风舒适度、污染物扩散、城市热岛效应及公共健康具有重要影响。传统计算流体力学(CFD)的计算成本过高,难以用于快速评估;而许多深度学习方法需要大量训练数据,且难以泛化至未见过的布局。本研究提出 Fast Localized Urban Microclimate Emulator(FLUME),这是一个基于傅里叶神经算子的快速、数据高效且具备几何感知能力的框架,用于预测三维风场和温度场。FLUME 假设,在给定来流和热力强迫条件下,这些平均场的大部分空间变化由周围建筑的几何形态控制。该框架引入 Multi-Directional Distance Feature(MDDF),在由可见性界定的自适应空间尺度上捕捉几何信息。通过将仅包含 23 个城市街区的模拟数据分解为较小的三维局部块,并加入预先计算的 MDDF 信息,FLUME 能够利用有限的 CFD 数据进行学习。在未见过的城市布局上,该模型的流向速度平均绝对误差为 0.2 m/s,温度平均绝对误差为 0.19$^{\circ}$C。深度集成为认知不确定性提供了实用的代理度量,而保形预测则将这些估计转换为经过校准的预测区间。集成预测的离散程度与局部预测误差呈正相关,其中屋顶高度处的剪切层、建筑尾流以及近地面垂直速度的不确定性更大。这些结果表明,FLUME 有望用于城市设计和城市气候研究中的快速情景评估。

arXiv cs.LG65

Understanding Transformer-based Vision Models through Inversion

arXiv:2412.06534v5 Announce Type: replace-cross Abstract: Understanding the internal mechanisms of deep neural networks remains a central challenge in machine learning. In computer vision, one promising yet only preliminarily explored approach is feature inversion via inverse networks, which reconstructs images from intermediate representations using trained inverse networks. In this study, we revisit feature inversion via inverse networks, introducing a novel, modular variant that enables a computationally more efficient application of the technique while, in some cases, producing semantically more coherent image reconstructions. We apply our method to large-scale transformer-based vision models, specifically Detection Transformer, Vision Transformer, Swin Transformer, and Data-Efficient Image Transformer, analyzing the resulting reconstructions across network depth. Our main analysis compares Detection Transformer and Vision Transformer, which exhibit the most informative differences among the evaluated architectures. At the same time, results for Swin Transformer and Data-Efficient Image Transformer support the broader applicability of our framework. Our findings reveal gradual representational changes across transformer layers as a shared characteristic of Detection Transformer and Vision Transformer, as well as systematic differences in how they preserve contextual shape and fine-grained image details, and in their robustness to color perturbations. These findings deepen understanding of transformer-based vision models and demonstrate the utility of modular feature inversion as an interpretability tool.

arXiv cs.LG66

Data-Driven Stochastic Optimal Control in Reproducing Kernel Hilbert Spaces

arXiv:2407.16407v3 Announce Type: replace-cross Abstract: This paper proposes a fully data-driven approach for optimal control of nonlinear control-affine systems represented by a stochastic diffusion. The focus is on the scenario where both the nonlinear dynamics and stage cost functions are unknown, while only a control penalty function and constraints are provided. To this end, we embed state probability densities into a reproducing kernel Hilbert space (RKHS) to leverage recent advances in operator regression, thereby identifying Markov transition operators associated with controlled diffusion processes. This operator learning approach integrates naturally with convex operator-theoretic Hamilton-Jacobi-Bellman recursions that scale linearly with state dimensionality, effectively solving a wide range of nonlinear optimal control problems. Numerical results demonstrate its ability to address diverse nonlinear control tasks, including the depth regulation of an autonomous underwater vehicle.