全部动态

本页 40 条
10月9日 周五
arXiv cs.LG81

Curating Always-Loaded Context for LLM Agents: A Capacitated Assortment Model with Censored Feedback

arXiv:2610.11007v1 Announce Type: cross Abstract: At the start of every session, LLM agents load a fixed context file, such as $\texttt{AGENTS.md}$. Each loaded token in the file is charged again in every later round of the session, and these files can degrade performance as they grow in size. However, in practice, human or automated curators usually grow these files by appending. We formulate context curation as a capacitated assortment problem. Instructions consume tokens under a finite attention capacity; adding an instruction never raises the compliance of the others, while retained instructions incur a per-session setup cost. We prove an upper bound on the optimal file size, regardless of the number of available candidate instructions, and that appending every instruction with positive standalone value can be arbitrarily worse in net value than selecting an optimal subset. A token budget also limits the loss when the token price is underestimated. We then examine what can be learned from past sessions and how this information can guide decisions to add or remove instructions. Feedback is inherently censored: the benefits and harms of loaded instructions are observable, whereas missing instructions generate feedback only when their absence causes harm. In this setting, we show that deleting instructions ignored by agents can inevitably remove helpful ones. We characterize how much evidence should be collected before adding an instruction. Besides, we bound regret when human reviewers can inspect only a limited number of edits per period. Empirical experiments further show that irrelevant rules drawn from real context files reduce language-model compliance.

arXiv cs.LG79

面向区域的 CLS Token 增强用于细粒度图像检索

arXiv:2610.10991v1 公告类型:cross 摘要:图像检索方法通常依赖从图像中提取的单一全局语义描述符,例如视觉 Transformer 中的 [CLS] token。然而,试图将图像的全部语义信息压缩到单个描述符中,可能会损害下游检索性能,尤其是在细粒度检索任务中。在本文中,我们使用精心选择的空间 token 集合,对新型视觉 Transformer 中的语义 token(全局 [CLS] token 和四个寄存器 token)进行增强,旨在捕获刻画每个语义 token 所包含内容的空间区域表示。我们采用 DINOv2-reg 模型,该模型包含能够自发学习物体及其部件表示的寄存器 token。对于每个“提示”token([CLS] 以及每个寄存器 token),我们找到一个对应的图像“伙伴”图像块 token,并提取一个 N x N 的图像块区域,从而生成一组局部化 ROI token。我们的方法无需任何外部边界框或显著性模块,仅通过将语义 token 与其空间表示区域进行匹配,即可自动捕获重要的感兴趣区域。此外,我们将这些 token 融入受 ColBERT 启发的多向量检索框架,通过逐 token 对齐机制实现细粒度匹配,同时避免存储所有图像块嵌入所带来的巨大存储开销。通过大量实验,我们发现:(1)寄存器 token 编码了有用的细粒度细节,可以补充 [CLS] token;(2)自动池化得到的 ROI token 能进一步提升细粒度区分能力;(3)使用少量 token 的多向量检索性能优于 DINOv2-reg 单向量基线,同时对于大规模搜索仍具备可行性。代码可在 https://github.com/IdhcbIan/Augmenting_CLS_with_ROI_tokens 获取。

arXiv cs.LG77

Omni-Diffusion-Distill:统一多模态扩散大语言模型的少步蒸馏

arXiv:2610.10990v1 发布类型:cross 摘要:统一多模态扩散大语言模型(dLLMs)通过单一架构同时支持图像生成和多模态理解,但其迭代解码需要进行数十至数百次前向传播。现有的少步蒸馏方法大多聚焦于图像生成或文本生成中的一者,因此,如何在保留生成与理解能力的同时,将完全离散的多模态 dLLM 压缩为单一高效的学生模型,仍不明确。我们提出 Omni-Diffusion-Distill,一种统一的两阶段蒸馏框架,在大幅降低统一多模态 dLLM 推理成本的同时,保留强大的生成与理解能力。Omni-Diffusion-Distill 在离散 token 空间中,对图像和文本的生成与理解蒸馏进行统一。第一阶段中,学生模型通过重放缓存的教师模型轨迹进行训练,以跳过部分解码步骤;第二阶段中,学生模型沿自身 rollout 过程中的中间状态进行进一步优化。我们还通过一对碰撞惩罚和熵匹配引导,解决统一蒸馏中的两类性能退化问题:前者减少并行文本解码中的重复,后者防止图像生成中因拟合锐化后的教师分布而导致的熵坍缩。Omni-Diffusion-Distill 在多模态 dLLM 的解码效率与生成、理解性能之间实现了业界领先的权衡,将图像生成的解码步数从 128 步降至 8 步,并将多模态理解的解码步数从 512 步降至 64 步,实现 18.2 倍和 21.2 倍的实际运行时间加速。在这些步数预算下,其在文生图生成任务的 GenEval 和 DPG-Bench 上分别取得 0.828 和 83.0 的分数;在多模态理解任务中,其在 MM-Vet 和 COCO captioning 上的 GPT 评判分数分别达到 20.0 和 57.2(在相同步数下,教师模型为 28.4 的两倍)。

arXiv cs.LG83

AI4Fire: Evaluating Large Language Models on Wildfire Tasks

arXiv:2610.10946v1 Announce Type: cross Abstract: Large language models (LLMs) are entering wildfire management, where overstated evaluations can cost property and lives. How do they perform on wildfire tasks, with and without grounding? Bare means a model receives the task input alone. Grounded means it also receives one task-specific addition: for smoke detection, a smoke-free reference frame from the same camera. AI4Fire runs six core models bare and grounded on five wildfire tasks, zero-shot; a sweep adds 29 more. Our literature search on fire tasks found 138 works; none combines this roster, task coverage, and paired bare and grounded runs. We report three findings. (1) Grounding helped most where the addition carried the answer: a read-only SQL tool lifted every core model's database accuracy from at most 16 to at least 88 percent. (2) Simple rules were hard to beat: no core model outperformed repeating today's staffing count, and two open-weight models mostly copied the median of similar earlier fire-days, a worse forecast. (3) Public releases carry hazards: a fire-danger column separates the holdout perfectly, and 67 aerial fire frames carry smoldering or fire-free labels read from a clipped thermal maximum. We release prompts, responses, scores, code, and the survey record.

arXiv cs.LG76

GHARP: Real-time Gaussian Head Animation from Large-scale Reconstruction Prior

arXiv:2610.10945v1 Announce Type: cross Abstract: We present GHARP (Real-time Gaussian Head Animation from Large-scale Reconstruction Prior), a method that animates 3D human heads in real time from a few input images of a subject and a driving expression signal. We decouple the problem into an identity stage that builds a representation of the subject's geometry and appearance offline, and an animation stage that predicts expression-dependent residuals on top of it at runtime. This separation offers a favorable trade-off with respect to fidelity, quality and runtime: the identity stage can be expensive while the animation stage runs a lightweight network, optimized for mobile devices. Our method performs animation in a semantically structured latent space of a pretrained reconstruction model, where expression changes remain spatially contained, making residual prediction efficient. This reconstruction prior provides a consistent spatial layout, allowing fusion of multiple input views into a compact, fixed-size canonical Gaussian representation. While this two-stage design improves the runtime-quality trade-off, it still inherits a problem common to all expression-driven avatar methods: expression codes describe only the face and thus omit body pose and clothing position, making these regions underspecified in the input. The animation network faces an ill-posed mapping and resorts to averaging over conflicting body appearances, producing blur and temporal flicker. We address this with a body alignment network that learns to align the person's body in the target image with the input reference images, removing the ambiguity from the training signal. Our method achieves state-of-the-art quality on the Ava-256 benchmark while running up to 13x faster on an A100 GPU with 8x fewer Gaussians.

arXiv cs.LG80

StoreBench:用于评估和训练自主运营代理的实时电商环境

arXiv:2610.10942v1 公告类型:cross 摘要:强化学习环境如今已成为后训练阶段提升大语言模型(LLM)能力的主要手段之一,但大多数智能体基准仍然是静态的:世界只有在智能体采取行动时才会推进,奖励是终局判定,及格线也被任意设定。我们推出 StoreBench,这是一种实时电商环境,智能体在生产级电商后端上运营一家中型在线服装店,在不确定性下考验长期规划能力和经济判断力。顾客全天候下单,供应商重新定价并可能失效,市场冲击也会在几乎没有预警或完全没有预警的情况下到来。智能体通过与人类运营者所使用的相同的 29 个商家工具进行操作,并受窗口化操作预算约束,使模拟时间成为所采取行动的函数,因此模型延迟不会影响模拟时间。及格阈值依据脚本化锚定策略进行校准,奖励机制经过加固以抵御一系列奖励投机行为,并且在给定行动序列的情况下,每个回合都能被完全一致地重放。我们在 11 个持续 30 至 45 天的场景和一个完整模拟年度上,对七个前沿 LLM 进行了评估;所有评估均使用三个世界随机种子,并匹配推理投入。平均而言,没有任何模型能达到脚本化 smart-triage 策略的水平:表现最佳的 DeepSeek-V4-Pro 在任务—随机种子单元格中的通过率为 49%,而启发式策略为 97%。使用相同工具和预算的人类专家得分超过所有模型(综合平均分为 0.708,而模型为 0.700)。在 Claude Code 工具框架下运行完整模拟年度时,大多数模型的性能都出现了显著提升。在一次 GRPO 后训练实验中,仅使用五个互不重叠的任务训练的 Qwen3.5-27B,将其在留出的评估任务上的综合平均分从 0.136 提升至 0.373。我们发布了五个训练集示例任务、十条示例轨迹,以及评分和验证工具;为避免基准受到污染,完整环境和评估套件暂不公开。

arXiv cs.LG60

Higher-Order Morphology Priors for Quadruped Reinforcement Learning Under Actuator Degradation

arXiv:2610.10934v1 Announce Type: cross Abstract: Actuator degradation turns quadruped locomotion into a coordination problem requiring joints to compensate for lost actuation. Prior work suggests that morphology-aware graph policies improve learning and generalization under body perturbations. We ask whether these benefits can be strengthened by explicitly modeling higher-order mechanical structure. We represent the Unitree Go1 as a cell complex with limb- and body-level rank-2 cells and apply Hodge-based message passing. Under degradation training, the node-edge-face Hodge actor achieves the highest return on unseen actuator degradations, with higher survival and lower velocity-tracking error. These results support higher-order morphology as a useful inductive bias for whole-body compensation under actuator degradation.

arXiv cs.LG79

When Listening Becomes Easier: Scrubbing Visual Cues for Shortcut-Free VLAs

arXiv:2610.10912v1 Announce Type: cross Abstract: Shortcut learning is a prevalent issue in robot learning. The limited diversity of robot demonstration datasets can mislead policies into exploiting spurious correlations between tasks and irrelevant features, such as viewpoint or background. Collecting sufficiently diverse robot demonstrations is costly and inefficient, motivating algorithmic alternatives. We focus on vision-language-action (VLA) models and discover that different vision-language model backbones exhibit substantially different levels of susceptibility to visual shortcut learning. We find that model behavior correlates with our proposed representation-level metric, action margin, which requires no policy rollouts. Visual shortcuts consistently enter action representations in early layers, with models differing in the extent to which later layers correct them by incorporating language information. To boost models' attention to language, we introduce task scrubbing, a new domain-adversarial training method that decreases models' likelihood of using visual shortcuts and improves VLAs' generalization. Experiments in both simulation and the real world across multiple VLAs and visual cues show that task scrubbing improves out-of-distribution robustness and often eliminates visual shortcut learning.

arXiv cs.LG80

Power Side-Channel Membership Inference Attack on Embedded Machine Learning

arXiv:2610.10909v1 Announce Type: cross Abstract: Membership inference attacks (MIAs) threaten the privacy of machine learning (ML) training data by determining whether a sample was used to train a target model. Existing MIAs rely on model outputs, ranging from prediction probabilities to predicted labels, an assumption that can be restrictive for on-device ML systems with limited or inaccessible outputs. However, suppressing model outputs does not eliminate the data-dependent computations that produce them, which may remain observable through physical side channels. We present PSCMIA, a power side-channel membership inference attack against embedded ML models that can infer membership directly from power traces without requiring prediction probabilities or even the predicted labels. We evaluate PSCMIA across multiple datasets (MNIST, FMNIST, CIFAR10, CINIC10), fully connected (FC) and convolutional neural network (CNN) architectures, and two embedded platforms (STM32F3, XMEGA). PSCMIA achieves ROC-AUC values of up to 0.907 on FC models. For CNN models, the ROC-AUC gap between PSCMIA and probability vector-based shadow MIA ranges from 0.006 to 0.116. Across the FC and CNN evaluations, PSCMIA outperforms label-only MIA in 11 of 16 model-dataset-hardware configurations, demonstrating that physical execution can expose membership information even when conventional model outputs are unavailable through unintended power side-channel leakage.

arXiv cs.LG78

基于人类听众强化学习的对话式语音美学模型

arXiv:2610.10868v1 公告类型:cross 摘要:我们介绍了 Conversational Voice Aesthetic Model,这是一种语音大语言模型,用于描述自然对话场景中真实或合成语音回复的语音美学特征。给定上下文和回复语音,CVAM 会描述刻画声音特征的显著片段,并预测涵盖性别、音高、语速、情绪和表达方式的九项分类属性。其关键挑战在于情绪和表达方式等感知领域,这些领域本质上具有主观性,且缺乏明确的真实标签。因此,我们从 CANDOR 语料库中获取了 3,000 条真实和合成语音回复,并为每条回复收集了约 10 条人工标注。CVAM 首先基于合成的美学描述和标签进行监督微调,随后利用 Group Relative Policy Optimization 根据人类判断进行优化。实验表明,与 Gemini 3.1 Pro 和开源语音大语言模型相比,CVAM 与人类听众的判断更加一致,并且优于单个人类与其他所有人的一致性。总之,我们证明了以人类感知为基础来定义语音美学的重要性,并提出了一个系统的人类对齐框架。

arXiv cs.LG76

基于网格的神经能量方法用于异质复合材料模拟

arXiv:2610.10862v1 发布类型:cross 摘要:对于深度能量方法(DEM)等物理信息神经网络而言,异质材料的建模仍然是一项挑战。DEM及其变体在本文中统称为神经能量方法(NEM),提供了一个可微分的变分框架。然而,其传统的基于配点的实现(C-NEM)通常会受到物理上不可接受的位移振荡、积分误差以及自动微分带来的高计算成本等问题的影响。本文提出了基于网格的神经能量方法(M-NEM),通过对位移场进行基于网格的离散化扩展了NEM。M-NEM利用形函数对节点位移进行插值,从而施加运动学约束并抑制振荡。此外,该方法以代数形式的形函数导数替代自动微分来计算应变,并采用高阶高斯求积以实现精确的能量积分。在一个可直接比较的基准问题中,与C-NEM相比,M-NEM将应力误差最多降低了三个数量级,同时速度提高了一个至两个数量级。在另外两个涉及极端刚度对比的基准问题中,只有M-NEM能够收敛。对不同神经网络架构的比较研究表明,在M-NEM中,径向基函数神经网络(RBFNNs)表现最佳:与采用随机傅里叶特征(RFF)映射的多层感知机(MLPs)相比,RBFNNs能够以更高精度解析材料界面处的尖锐梯度;与Kolmogorov-Arnold网络(KANs)相比,其收敛速度更快。

arXiv cs.LG79

Enabling Preference-driven Unlearning in Few-step Distilled Text-to-Image Diffusion Models

arXiv:2610.10859v1 Announce Type: cross Abstract: Text-to-image diffusion models are increasingly distilled into few-step variants and being deployed to enable fast inference. However, their ability to generate harmful or undesired content poses significant safety risks. Data-driven unlearning methods suppress targeted generations by fine-tuning model weights using specialized unlearning objectives. Crucially, these objectives implicitly rely on multi-step denoising dynamics, an assumption that breaks down for few-step distilled (FSD) models, resulting in ineffective forgetting. Furthermore, performing unlearning on the non-distilled base model and subsequently re-distilling it to obtain an unlearned FSD model incurs substantial computational and time overhead, making it impractical in many settings. Hence, we address this limitation with a preference-driven unlearning framework that revisits Direct Preference Optimization (DPO) for diffusion models. We show that standard DPO and its unlearning derivatives, formulated around noise-prediction error, transfer poorly to FSD models due to their altered generation dynamics. To overcome this, we introduce a modified preference optimization formulation explicitly aligned with the few-step generation properties, enabling direct concept removal in FSD models while preserving few-step efficiency and maintaining strong retention of desirable (non-targeted) capabilities. We evaluate our framework primarily on identity and NSFW (nudity) removal tasks and also extend our method to object-level unlearning. Extensive experiments demonstrate consistent and effective forgetting, and strong retention performance, establishing our method as a practical and principled solution for unlearning in FSD models.

arXiv cs.LG78

RFChipAgent: Multi-Agentic AI Flow for Analog/RF Chip Design

arXiv:2610.10858v1 Announce Type: cross Abstract: Analog/RF circuits remain the critical interface between digital computation and the physical world, and emerging standards from Wi-Fi 7 to 6G place stringent demands on them, yet analog/RF design remains one of the most labor-intensive steps in chip development. We present RFChipAgent, a first-of-its-kind multi-agent flow of large language model (LLM) agents for end-to-end analog/RF circuit design automation, in which AI agents collaboratively orchestrate the complete design flow under human supervision. RFChipAgent is built around four technical pillars. First, a multimodal retrieval-augmented generation (RAG) subsystem with private per-document FAISS indexing extracts design knowledge from existing engineering documentation. Second, a topology agent drives topology selection, and a schematic and testbench agent automates circuit and testbench assembly. Third, a closed-loop hybrid circuit-sizing engine combines Tree-structured Parzen Estimator (TPE) and CMA-ES optimization, evaluating every candidate in a simulator-in-the-loop framework. Fourth, a trust-scored simulation database accumulates verified performance data and builds an adaptive optimization model that informs subsequent trials. We validate RFChipAgent on a family of GF22FDSOI 60 GHz wideband mm-wave low-noise amplifier (LNA) topologies, demonstrating automated topology generation, specification-driven design-space exploration, and simulator-guided optimization. Experimental results show substantial reductions in design effort while maintaining signoff-quality verification. This work establishes a foundation for LLM-driven multi-agent electronic design automation (EDA) for analog/RF circuits.

arXiv cs.LG63

Whose Ground Truth? Embracing Ambiguity in Human-Centered AI

arXiv:2610.10805v1 Announce Type: cross Abstract: As AI systems increasingly interact with people and make decisions about them, understanding human interpretations becomes an important part of developing human-centered AI. Conventional machine learning and AI systems are largely developed under the assumption that a single definitive ground truth exists, with variability in human annotations often resolved through aggregation or treated as noise. However, for many human-centered tasks, human interpretation is inherently ambiguous, and multiple interpretations of the same input may be simultaneously reasonable and valid. Reducing such ambiguity to a single target risks overlooking meaningful information about the diversity of human perception, judgment, and experience. In this position paper, we call for a shift towards modeling the interpretation space of plausible human judgments, while distinguishing meaningful ambiguity from annotation noise. We argue that this perspective should guide how AI systems are represented, learned, evaluated, deployed, and governed, supporting more human-centered AI that better reflects the diversity of human interpretation.

arXiv cs.LG74

Calibrating Ambiguity Set via Diagnostic Transport for Distributionally Robust Optimization

arXiv:2610.10793v1 Announce Type: cross Abstract: Distributionally robust optimization (DRO) protects decisions against distributional uncertainty by optimizing over an ambiguity set, but poorly aligned set geometry can require large radii and yield overly conservative decisions. We introduce diagnostic-transport DRO (DT-DRO), which uses held-out calibration data to adapt the ambiguity-set geometry to observed predictive errors. DT-DRO uses the conditional probability integral transform cumulative distribution function to diagnose systematic probability misallocation and translates this information into an outcome-level transport that jointly adjusts the ambiguity-set center and ground cost. The resulting formulation admits a computationally tractable dual reformulation. Theoretically, we derive valid ambiguity radii and decision-risk guarantees that tighten as estimation and approximation errors vanish, and show that DT-DRO can eliminate the nonvanishing robustness floor caused by model misspecification. Synthetic experiments and a power-outage application demonstrate improved decision quality, particularly under structural and tail misspecification.

arXiv cs.LG74

线性注意力能从非线性教师的上下文学习中学到什么?

arXiv:2610.10761v1 发布类型:cross 摘要:线性注意力是一种易于处理的模型,可用于理解 Transformer 中支配上下文学习的机制。对于线性回归任务,近期的渐近分析刻画了其学习行为和泛化行为。我们将这一理论扩展到非线性单索引目标 \(y=f(x^\top w)+\varepsilon\)。我们的主要结果确立了非线性—噪声等价性:线性注意力只能提取 \(f\) 的线性 Hermite 分量,而其余非线性结构则作为有效噪声,对泛化误差产生贡献。这一化简使得相应线性理论的结果能够迁移到非线性任务中。我们展示了该结论对有限预训练数据的影响,以及随着任务多样性增加,从任务记忆到任务泛化的转变。这些结果揭示了简化线性注意力模型的局限性,并为研究非线性上下文学习提供了一个易于处理的起点。

arXiv cs.LG67

Clarify, Then Focus: Statement Normalization for Conversation Analytics at Scale

arXiv:2610.10758v1 Announce Type: cross Abstract: Enterprise conversation analytics asks many questions of millions of interactions. Each question can require reconstructing what people mean and identifying which information matters, repeating costly interpretive work across the same transcripts. We propose a simple principle: clarify the text, then focus the reader. Statement normalization transforms dialogue into short, speaker-attributed statements with source references and semantic tags. The statements make meaning more explicit; the tags support selecting evidence for a particular question. Downstream models can use the full representation or a relevant subset, depending on what helps them make the decision. In an offer-suppression task on customer-service calls, normalization improves a supervised classifier without selection, while weaker prompted readers benefit from both normalization and selection. A small model can learn the normalization contract, while lightweight encoders handle tagging and downstream decisions. Sharing this preparation across questions supports an inference pipeline built entirely from small models, making analytics over millions of conversations substantially less expensive.

arXiv cs.LG76

二手电子产品多时间跨度价格预测中的深度学习与统计模型:系统性基准测试

arXiv:2610.10727v1 公告类型:cross 摘要:预测二手电子产品的转售价格对于订阅制平台至关重要,因为定价误差会直接转化为风险。不同于结构化金融市场,二手电子产品呈现出高波动性、稀疏的挂牌历史以及非正态价格动态,然而该领域尚不存在系统性的时间序列基准。本文提出首个用于二手电子产品价格预测的统计模型与深度学习模型多时间跨度基准。我们使用来自波兰在线市场的大规模每日价格挂牌数据集(2022年1月至2025年3月,涵盖100多种智能手机和笔记本电脑型号),并在从1天到365天的六个预测跨度上评估11种模型,包括经典方法(ARIMA、ETS、Theta)、循环网络和卷积网络(LSTM、TCN),以及现代深度架构(N-BEATS、N-HiTS、TFT、PatchTST、Informer)。三种互补的评估方案分别评估轨迹拟合度、一次性终点预测准确率和跨跨度迁移能力。在超过30天的预测跨度上,N-BEATS取得最低的MAPE,在365天时达到8.51%,而最佳统计基线为14.94%,降低了43%。在较短跨度(1—7天)上,所有模型的表现均趋近于0.72%的MAPE,朴素基线仍具有竞争力。一个在365天跨度上训练的N-BEATS模型能够泛化到所有更短跨度,从而无需针对不同预测跨度分别训练模型。N-BEATS和N-HiTS还展现出更优的超参数稳定性。

arXiv cs.LG69

On linearity or non-linearity in machine learning for quantum chaotic dynamics

arXiv:2610.10697v1 Announce Type: cross Abstract: Accurately simulating chaotic quantum many-body dynamics remains a major computational challenge for classical methods, due to the rapid buildup and spatial spreading of entanglement during the evolution. This raises the question of whether machine learning can provide an effective alternative for predicting quantum dynamics. We address this question by formulating quantum dynamics as a time-series forecasting problem, using a few-qubit PXP chain, realizable with Rydberg-atom arrays, as a benchmark. By varying the initial state, the system spans dynamical regimes ranging from ergodic behavior to quantum many-body scarring, providing a controlled setting for testing forecasting models across qualitatively different dynamics. We compare two contrasting architectures: an expressive nonlinear Transformer and DLinear, a simple linear forecasting model. The Transformer accurately predicts dynamics in the more ergodic regime, but its performance progressively deteriorates as the initial state approaches the scarred limit. In contrast, DLinear remains accurate across the entire family of initial states, with its main deviations consisting of small high-frequency oscillations that have little effect on the overall prediction error. Remarkably, these results show that observables generated by complex quantum many-body dynamics can be forecast with high accuracy through a simple linear mapping from past to future observations. This reveals that the complexity of the underlying quantum evolution need not translate into an equally complex forecasting problem.

arXiv cs.LG78

BEANS-Next and ROOTS: Broadening Audio-Language Capabilities for Bioacoustics

arXiv:2610.10663v1 Announce Type: cross Abstract: Bioacoustics and ethology encompass a wide range of audio understanding tasks, many of which stand to benefit from recent advances in large audio-language models. However, progress in the field has so far been assessed on a narrow set of tasks, primarily centered on label-centric biological category recognition, such as species and call-type classification. In this work, we introduce BEANS-Next, a benchmark grounded in a taxonomy of bioacoustics tasks spanning acoustic perception, biological category recognition, scene understanding, and in-context learning. Using BEANS-Next, we show that existing models exhibit limited performance beyond the task families emphasized by existing evaluations, constraining their usefulness for broader bioacoustic applications. To support progress on this broader task space, we also introduce ROOTS, a large-scale training resource built from expanded curated real-world data and previously underused behavioral and acoustic metadata, supplemented by audio-derived information and scalable synthetic generation where labeling is insufficient. We demonstrate that training on this dataset yields substantial progress across all task groups of BEANS-Next, moving audio-language models closer to their potential as general-purpose assistants for bioacoustics and ethology. To accelerate progress in the field, we open-source our benchmark, dataset, and data pipelines.

arXiv cs.LG75

Safe at One Loop, Risky at Another: Aligning Safety Across Recurrent Depths in Looped Language Models

arXiv:2610.10625v1 Announce Type: cross Abstract: Looped Language Models (LoopLMs) provide a parameter efficient approach to scaling model capabilities through repeated use of shared parameters across recurrent steps. Since each recurrent depth can be read out independently, a single LoopLM exposes a broader output space across inference depths, raising an important question: whether safety is preserved throughout recurrent computation. Prior evaluations suggest that deeper recurrence can improve safety on harmful queries, but robustness under jailbreak attacks remains unclear. We therefore conduct a comprehensive safety evaluation of LoopLMs under jailbreak attacks targeting different recurrent depths. We find that attack success can increase at deeper inference depths, the same query can elicit different safety behaviors across depths, and attacks constructed against one depth can transfer to others. Moreover, SFT and preference alignment do not eliminate these safety gaps, motivating an alignment method designed for LoopLMs. We introduce SafeBridge, which combines lightweight depth specific control of shared recurrent layers, selective state bridging, and joint safety supervision across recurrent depths. Across model scales, multiple attack methods, and safety benchmarks, SafeBridge substantially reduces attack success for both matched-depth and cross-depth attacks. It also improves general utility over the vanilla models while maintaining comparable over-refusal behavior. Our results show that the safety of a LoopLM cannot be inferred from a single recurrent depth, motivating safety alignment across recurrent computation. Our code and model checkpoints will be released upon acceptance.

arXiv cs.LG76

MRCert: Towards Post-deployment Patch Robustness Certification for Adversarially Patched Samples via Type-specific Masking

arXiv:2610.10617v1 Announce Type: cross Abstract: In post-deployment time, inputs to deep learning models may or may not be adversarially patched. Patch robustness certification on such inputs within a patch bound can verify their label benignity and should retain high prediction accuracy. However, existing smoothing-based and masking-based recovery defenders cannot achieve both simultaneously: they degrade the prediction accuracy much and cannot verify the benignity of the returned label of an adversarially patched input, respectively. We propose MRCert, the first masking-based certified recovery defender that shows the feasibility of achieving both. Unlike all existing works to apply a common condition across both types of input (benign and adversarially patched samples) for certification, MRCert infers type-specific necessary properties of deep learning models for both types in post-deployment time and formally relates them to verify the label benignity through a novel type-oriented design of label recovery and certification function pair. Without incurring the degradation in clean accuracy caused by smoothing, experimental results confirm that MRCert achieves 35.1\% adversarial certified accuracy on ImageNet at patch size 16 pixels, whereas the SOTA PatchCURE fails completely.

arXiv cs.LG60

JevForest: Path Voting for Budgeted Feature Acquisition

arXiv:2610.10615v1 Announce Type: cross Abstract: Choosing which information to observe is central to prediction under limited observation budgets. We study JevForest, a feature acquisition policy that aggregates path-dependent proposals from bootstrapped trees, weights them by global training information gain, and predicts from the acquired values with a shared masked classifier. An online implementation queries Jev for semantic answers selected by this policy. On small balanced held-out samples, four-question forest acquisition achieves accuracy $0.729$ on AG News ($n=48$), compared with $0.667$ for a static gain ranking and $0.583$ for random ordering. On TREC ($n=24$), the ordering reverses: forest accuracy is $0.667$, compared with $0.750$ and $0.833$. Asking all eight questions in one batch yields higher accuracy at lower measured cost and latency than four sequential forest queries; direct Jev classification matches the batch accuracy while costing less. Offline MiniBooNE experiments yield accuracy $0.845\pm0.010$ at ten features and $0.885\pm0.008$ at forty features over three jointly varying data and forest seeds (mean $\pm$ sample standard deviation). A companion Newton boosting implementation provides preliminary full-feature synthetic results. These exploratory findings establish a working Jev acquisition workflow but do not support a general advantage for path voting: its value depends on the task, predictor, and the distinction between question budgets and actual query costs.

arXiv cs.LG77

GaussianBench:高斯场景表示的物理保真度评估

arXiv:2610.10554v1 公告类型:交叉收录 摘要:3D Gaussian Splatting 已从静态重建发展为融合物理的表示,旨在预测场景在交互作用下如何变化。这带来了一个评估问题:推演过程可能看似合理,却依赖于错误的内部力学机制;而与观测运动在视觉上的一致性,并不能证明系统能够正确响应新的力、材料修改、接触或热干预。我们提出 GaussianBench,这是一个面向融合物理的高斯场景表示的物理保真度评估套件。它采用固定不变的文件化场景、独立于模拟器的评分器,以及解析或实测参考数据。该基准测试守恒性、连续介质响应、异质材料耦合、高斯协方差输运与渲染、热致相变,以及反事实响应。每项参考均声明其适用范围,测试结果分为 PASS、FAIL、NA 和 INVALID,从而将物理失效与不受支持的能力及无效比较区分开来。我们还提供 GaussianFlesh,这是一个热力耦合参考参评系统,其中持久化的三维高斯既充当渲染图元,也充当连续介质材料点,由共享网格 MPM 求解器推进,并支持逐粒子本构分派以及持久化的热状态和相态。我们评估了六个已发布的外部系统:PhysGaussian、GaussianFluent、OmniPhysGS、PhysDreamer、Physics3D 和 GASP。以相同方式测试所有系统,揭示了其原始评估所遗漏的失效:一个系统可能正确模拟单一材料,却在两种材料的交界处失效;也可能针对一种它从未产生过的形变,正确更新其高斯。匹配故障测试和容差审计证实,这些差异确实来自预期的测试机制。因此,必须针对融合物理的高斯系统的内部物理状态进行测试,而不能仅仅看其推演过程是否显得合理。

arXiv cs.LG74

SpectralCache:通过谱特征缓存加速基于扩散的世界模型

arXiv:2610.02660v1 公告类型:交叉发布 摘要:基于扩散的世界模型能够生成高质量的交互式环境,但由于在去噪过程中需要反复执行 Transformer 计算,推理开销较大。现有缓存方法主要利用特征或词元层面的时间冗余,而对扩散特征背后的数学结构仍缺乏深入探索。在本研究中,我们揭示了世界模型的特征在相邻去噪步骤之间呈现高度稳定的奇异子空间,而其奇异值则遵循可预测的演化规律。基于这一观察,我们提出了 SpectralCache,这是一种无需训练的谱缓存框架,可复用稳定的奇异子空间,并通过线性外推仅估计低维奇异值。我们进一步利用相邻完整计算所得特征之间的谱一致性,通过奇异值缩放跳过部分开销高昂的骨干网络计算。在代表性世界模型上开展的大量实验表明,SpectralCache 能够在保持生成质量的同时,持续提升推理效率。在 HunyuanWorld-Voyager-13B 上,SpectralCache 实现了 5.22 倍加速,同时在静态场景中保持 65.90 的 WorldScore,在推理效率方面显著优于现有的无需训练的缓存方法。

arXiv cs.LG74

Bi-FORK:高维分岔系统的生成式建模

arXiv:2610.12449v1 公告类型:新提交 摘要:从结构屈曲到流体与气候动力学,分岔在物理系统中无处不在,但在深度学习领域仍鲜有探索。在对称性破缺分岔处,单个输入对应多个同等有效的解,这违背了大多数基于学习的物理代理模型所依赖的一对一假设。我们提出 Bi-FORK,一种用于学习高维系统中此类一对多解映射的生成式框架。Bi-FORK 通过潜空间流匹配生成完整轨迹,保持空间和时间上的连贯性,并利用排斥引导采样,在单次摊销推断中恢复不同的解分支。我们在屈曲梁、机械超材料和 Allen-Cahn 相分离问题上评估了 Bi-FORK,涵盖连续、离散和场值分岔,离散化规模最高达 260,000 个点。Bi-FORK 能够恢复解的多模态结构,同时将可处理规模提升至以往方法的数个数量级以上,为高维分岔物理系统的生成式建模开辟了道路。

arXiv cs.LG77

Rounding in Preconditioner Space: Redesigning 4-bit AdamW Optimizer-State Quantization

arXiv:2610.12444v1 Announce Type: new Abstract: Quantizing AdamW's optimizer states reduces persistent storage, but quantization errors propagate through the moment recurrences and perturb subsequent adaptive updates. We redesign 4-bit optimizer-state quantization for AdamW from the perspective of \emph{rounding space}: the coordinate in which a quantizer chooses between adjacent reconstruction levels. For the second moment, a local analysis of the quantization cell adjacent to zero shows that small mean state error need not imply small mean preconditioner error at the next step. A one-dimensional quadratic construction further shows qualitatively different optimization dynamics under state-space and preconditioner-space rounding. These results motivate Zero-Inclusive Preconditioner-space Stochastic Rounding (\textbf{ZIP-SR}), which retains zero in the second-moment codebook and computes stochastic-rounding probabilities in preconditioner space. As a complementary route, Zero-Excluding EDEN calibration (\textbf{ZE-EDEN}) uses a zero-excluding second-moment codebook and rescales the quantized second-moment block to mitigate the preconditioner distortion caused by the positive quantization floor. Both configurations use 4-bit NormalFloat (NF4) for the first moment, with targeted stochastic rounding of the LM-head first moment during the final 10\% of training. Across GPT- and Llama-style pretraining experiments ranging from \textbf{130M} to \textbf{2.7B} parameters, both methods reduce TorchAO 4-bit AdamW's mean validation-loss gap to 32-bit AdamW at every evaluated model size, with the largest reported gap reduction reaching \textbf{70\%}. In full-parameter supervised fine-tuning, both recipes achieve lower validation loss than TorchAO while remaining close to 32-bit AdamW on downstream tasks.

arXiv cs.LG81

通过全球-区域对齐学习公里尺度天气预报

arXiv:2610.12401v1 公告类型:new 摘要:公里尺度的区域天气预报对于当地天气预警和对天气敏感的决策至关重要。现有的数据驱动方法通常依赖数值预报提供大尺度指导,或需要额外训练全球预报组件。预训练的全球天气模型能够高效地产生大尺度预报,因此可重复利用这些模型来指导高分辨率区域预报。然而,这种耦合需要在不同网格之间对齐全球和区域表征,并将全球指导信息与局地交互相结合,以推进区域状态的演变。我们提出了 ScaleCast,一种通过全球-区域对齐解决这些挑战的区域预报框架。其中,Global-Regional Conversion 模块将联合的全球和区域表征与区域位置对齐,而 Global-Regional Alignment and Dynamics 模块则将对齐后的指导信息与区域邻域交互相结合。基于0.25度网格的 ERA5 全球分析资料和5.5公里间距的 CERRA 区域再分析资料进行的实验表明,该方法在地面和高空变量上均能改善区域预报;单个训练模型即可支持多个全球预报驱动模型(即 Pangu-Weather、GraphCast 和 HRES),无需针对特定模型重新训练。在3公里间距的 HRRR 数据上进行微调,进一步展示了该框架对不同区域范围和空间分辨率的适应性。风暴案例研究显示,该方法改善了气旋位置和核心气压的估计;与 HadISD 台站观测结果的比较表明,该方法对当地温度和湿度变化的刻画更加一致。

arXiv cs.LG69

Prospective Prediction of OOD Degradation from Source-Side Training Dynamics

arXiv:2610.12397v1 Announce Type: new Abstract: We study whether persistent out-of-distribution (OOD) degradation can be predicted before it is directly observed using only source-side training dynamics. In a controlled shortcut-learning setting, a simple logistic regression predictor develops a clear prospective signal, while training time alone does not. Temporal summaries of the source-side quantities are substantially more informative than their current values. When transferred without additional training from a CNN to an MLP, confidence and entropy dynamics retain substantial predictive information. These results provide a proof of principle that source-side training dynamics can contain an early warning signal for future OOD failure.

arXiv cs.LG80

Long Text to Predictive Features: LLM-Guided Blockwise Feature Engineering via Executable Program Search

arXiv:2610.12390v1 Announce Type: new Abstract: Industrial risk-control systems typically rely on structured-data models for efficient prediction, yet substantial valuable information remains embedded in unstructured long text. Extracting this information through manual feature engineering is labor-intensive, while requiring a large language model (LLM) to process every real-time input may not meet practical deployment requirements. To address this challenge, we propose LLM-BlockFE, an LLM-guided offline feature construction framework that converts long text into executable feature programs, thereby avoiding LLM calls during online inference. LLM-BlockFE constructs feature programs by incrementally appending immutable code blocks and evaluates candidate features using a downstream model. To address the tendency of conventional greedy search to become trapped in suboptimal solutions, our method introduces a block-level rollback mechanism based on depth-calibrated credit allocation and advances multiple independent search trajectories in an interleaved manner, reducing redundant exploration by sharing fixed descriptions of each trajectory's exploration direction. After the search, the resulting programs are frozen and deployed to extract structured features for downstream prediction models. Across two public and two private datasets, LLM-BlockFE achieves absolute AUC improvements of 0.0069 to 0.0358 over the strongest baseline on each dataset in the full-dataset comparison. Post-launch monitoring across five deployed financial risk-control applications shows absolute KS improvements of 0.02 to 1.56 percentage points over the existing manually designed strategy.

arXiv cs.LG70

Bilevel optimization for data-driven learning of Koopman embeddings using kernel-based autoencoders

arXiv:2610.12370v1 Announce Type: new Abstract: Koopman operator theory provides a linear framework for analyzing nonlinear dynamical systems and has become a major tool for data-driven modeling. A central challenge, however, is that finite-dimensional approximations computed by methods such as extended dynamic mode decomposition (EDMD) require the dictionary to be specified a priori. Recent machine-learning approaches address this limitation by learning the dictionary from data, predominantly using artificial neural network (ANN) autoencoder architectures. Although kernel methods offer an alternative with greater interpretability and tractability for theoretical analysis, they have received little attention in this setting. We introduce extended dynamic mode decomposition with kernel-based dictionary learning (EDMD-kDL), a kernel-based method for learning finite-dimensional Koopman embeddings directly from data. The method combines ideas from collocation methods and bilevel optimization to simultaneously learn a kernel dictionary and the corresponding Koopman approximation. We evaluate EDMD-kDL against state-of-the-art ANN-based approaches on a range of numerical experiments, including global sea-surface-temperature forecasting and learning directly from video data. Across all tested settings, EDMD-kDL achieves performance comparable to or better than the ANN-based methods. Moreover, in contrast to standard kernel methods, the proposed approach is scalable to large datasets by design since the size of the required kernel matrices depends on the number of collocation points rather than the size of the training dataset.

arXiv cs.LG75

Closing the Horizon Gap in Policy Optimization for Adversarial MDPs

arXiv:2610.12362v1 Announce Type: new Abstract: We consider policy optimization for online episodic tabular Markov decision processes (MDPs) with adversarial losses and bandit feedback. Policy optimization updates the policy locally at each state and avoids optimization over the occupancy-measure polytope, but its existing regret bounds are larger by a factor of the horizon $H$ than those of occupancy-measure-based algorithms. We close this gap by using regularized $Q$-functions, which allow us to control the stability of the local updates jointly over all state-action pairs rather than separately at each state. The resulting algorithm attains high-probability regret bounds of $\widetilde O(\sqrt{HS(H+A)T})$ for known transitions and $\widetilde O(HS\sqrt{AT})$ for unknown transitions, where $S$ is the number of states, $A$ the number of actions, and $T$ the number of episodes. Both bounds improve the horizon dependence of existing policy optimization bounds, and the latter matches the best-known bound. We further extend the algorithm to adversarial linear-mixture MDPs and obtain the same improvement in the horizon dependence.

arXiv cs.LG77

环境离散扩散:在正确的时间使用错误的数据,实现数据高效学习

arXiv:2610.12340v1 公告类型:新 摘要:我们提出 RefineMix,这是一种在严重数据稀缺条件下训练离散扩散模型的框架,而数据稀缺是科学应用中的常见限制。RefineMix 在选定的扩散时间使用分布外数据,以提升泛化能力,同时不会对采样分布造成偏差。尽管这一策略已在连续扩散中得到探索,但离散扩散面临着一个独特挑战:与高斯噪声不同,掩码会保留幸存 token 中的领域信息,从而限制了在高噪声水平下使用相关数据的能力。然而,在低噪声水平下,各领域实际上互不相交的支撑集反而成为优势,使模型能够同时从域内数据和分布外数据中学习,而不会对采样器造成偏差。我们将这些直觉形式化,并对所提出的方法进行了理论分析。在实验中,跨越五种领域偏移设置,RefineMix 达到了与域内微调相当或更优的效果。在蛋白质序列生成任务中,仅使用 197 个域内样本进行微调,相较于标准微调,生成的同时具备新颖性、可折叠性并属于目标家族的蛋白质比例几乎翻倍。

arXiv cs.LG74

Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity

arXiv:2610.12328v1 Announce Type: new Abstract: We consider stochastic nonsmooth nonconvex composite optimization, which includes several important problems such as constrained optimization and the regularized training of neural networks. The objective is the sum of a possibly nonsmooth nonconvex Lipschitz function and a convex regularizer, and the function is accessed through stochastic gradients or function values. The goal is to find a point that satisfies a Goldstein-type stationarity condition designed for composite objectives. To our knowledge, no oracle complexity bound for this setting is known under first-order access, and existing complexities under zeroth-order access are suboptimal. To handle this issue, we employ the framework of online-to-nonconvex conversion, which chooses update directions by an online learner and is known to achieve optimal rates for noncomposite problems. We extend the framework to our composite scenario by introducing new losses for the learner, which contain the regularizer itself rather than its linearization and for which a variant of online mirror descent achieves low regret. We show that the resulting algorithm finds such a point with $O(\delta^{-1}\varepsilon^{-3})$ stochastic gradient queries or $O(d\delta^{-1}\varepsilon^{-3})$ function-value queries, where $\delta$ is the Goldstein radius, $\varepsilon$ is the stationarity tolerance, and $d$ is the dimension. These rates match the optimal ones for noncomposite nonsmooth nonconvex optimization, demonstrating that the additional convex regularizer does not worsen the oracle complexity. We also give rates for the smooth case and present numerical experiments.

arXiv cs.LG77

SparseDecoding:面向准确高效 LLM 推理的解码感知剪枝

arXiv:2610.12327v1 公告类型:新 摘要:大型语言模型(LLM)推理的解码阶段具有内存受限特性,会带来显著延迟。由 Hessian 引导的逐层免训练网络剪枝方法一直是解决这一问题的重要方案,因为剪枝能够减少解码过程中从内存读取的非零参数数量。然而,这类典型方法通常使用预先收集的自然序列计算 Hessian,而模型在解码过程中接收的是自行生成的 token,从而导致这两类序列之间出现分布偏移。在自然序列上计算得到的 Hessian 与在生成序列上计算得到的 Hessian 并不相同。我们观察到,这种差异会使生成过程中的激活分布偏离用于剪枝的激活分布,进一步降低剪枝模型的性能。此外,现有大多数能够带来实际加速的 LLM 剪枝方法主要针对稀疏矩阵-矩阵(SpMM)乘法,而对在解码过程中占主导地位的稀疏矩阵-向量(SpMV)运算支持有限。为解决这些问题,我们提出 SparseDecoding,这是一种面向准确高效 LLM 解码的原理性解码感知剪枝框架。具体而言,在算法层面,SparseDecoding 从稠密模型的自回归生成过程中收集逐层激活,并基于这些激活构建校准矩阵,同时排除 prefill 阶段,从而使剪枝目标与解码激活保持一致。在系统层面,我们开发了一种经过优化的 N:M 稀疏矩阵-向量内核,采用位掩码索引和固定步长遍历。针对代表性 LLM(Llama-3.1-8B、Llama-3.3-70B、Qwen3-14B / 32B)的大量实验证明,与标准固定文本校准相比,我们的方法在长文本生成基准测试中始终表现更优,并且在 A100 GPU 上实现了最高 1.48 倍的端到端实际解码加速。

arXiv cs.LG71

AdaptLSTM: Efficient Adaptive Online Learning for Cloud Workload Forecasting under Distribution Drift

arXiv:2610.12265v1 Announce Type: new Abstract: Accurate workload forecasting is critical for elastic resource provisioning in web-scale cloud services, where distribution shifts driven by viral content, product launches, and user behavior degrade offline-trained models rapidly. Naive online learning recovers accuracy but incurs prohibitive per-step compute cost. We propose AdaptLSTM, an adaptive online framework that detects drift via validation-calibrated thresholds and applies selective, targeted updates. On the Alibaba Machine Trace, AdaptLSTM recovers 54\% of Naive Online's improvement at 20\% cost ($2.7\times$ efficiency, $p=0.002$ over 10 seeds). On the more volatile Container Trace, it achieves 96\% at 20\% cost ($4.8\times$ efficiency, $+75\%$ MAE reduction over Static). Unlike classical drift detectors (ADWIN, DDM, Page-Hinkley) which fail to trigger on regression-scale error streams, AdaptLSTM fires 42 times over 301 steps and outperforms matched-budget baselines. Wall-clock profiling shows $1.33\times$ throughput gain and 45\% update-time reduction. The framework is model-agnostic: identical Pareto patterns hold for LSTM, GRU, and Transformer backbones.

arXiv cs.LG75

提升之前先分批:大图上的可扩展拓扑深度学习

arXiv:2610.12247v1 发表类型:新 摘要:拓扑深度学习将基于图的学习扩展到高阶域,例如超图、胞腔复形和单纯复形。这些域通常通过图提升过程,从输入图中的模式构建而成。全域训练会在模型执行前构建并存储完整的提升表示。在 Reddit(233k 个节点和 57.3M 条边)这类大规模且稠密的数据集上,这种全局实体化会成为严重的计算瓶颈,往往使训练无法进行。为解决这一局限,我们提出了 Cluster-TNN,这是一种与域无关的框架,通过进行局部提升来避免这一瓶颈。在预处理阶段对输入图进行划分后,Cluster-TNN 在运行时动态采样节点簇组,重建其诱导子图以形成小批次,并在每个小批次内执行所选的提升操作。保留采样节点之间的所有边,可以保留跨簇构建高阶结构所需的连通性,从而生成现有拓扑神经网络可以直接处理的拓扑小批次。在与全图执行的 21 组匹配比较中,Cluster-TNN 在每种配置下都降低了 GPU 峰值内存,平均降幅达 83.2%,同时保持了具有竞争力的预测性能。值得注意的是,据我们所知,这种内存降低首次使得在 Reddit 和 OGBN Products 等大型数据集上训练多种不同的高阶拓扑神经网络成为可能。这些结果表明,Cluster-TNN 是一种通用策略,能够突破全局域构建的限制,扩展拓扑深度学习。

arXiv cs.LG69

RIFT: Relative Isolation From Trees For Anomaly Detection

arXiv:2610.12244v1 Announce Type: new Abstract: Isolation Forest (IF) is a widely used baseline for unsupervised anomaly detection. Recent studies provide a closed-form expression for the infinite-forest limit for one-dimensional data. Inspired by the geometric interpretation of this formula, we introduce RIFT (Relative Isolation From Trees), a deterministic anomaly detection method that generates the minimum spanning tree and scores each point by the sum of the apparent sizes of tree edges as viewed from that point. For one-dimensional data, the RIFT score recovers the closed-form IF limit exactly. In higher dimensions, it provides a parameter-free generalization that is deterministic, robust to varying density and clustered anomalies and avoids the axis-parallel artifacts of IF. We further propose an ensemble variant for large datasets. Experiments on synthetic data and the ADBench benchmark demonstrate that the accuracy is comparable to IF, while the ensemble variant exhibits significantly lower variance across random seeds.

arXiv cs.LG69

AdaCast: Conditional Parameter Generation for Adaptive Time Series Forecasting

arXiv:2610.12240v1 Announce Type: new Abstract: Time-series foundation models (TSFMs) have achieved strong forecasting performance across domains. However, most adaptation methods remain static. Existing all-in-one methods learn a single set of dataset-level parameter updates and apply the same adapted model to every input. As a result, they cannot adapt the model parameters to the temporal patterns, seasonality and dynamics of each input time series. This limits their ability to produce forecasts that are tailored to heterogeneous inputs. To address this limitation, we propose AdaCast, a conditional parameter generation framework for time-series forecasting. AdaCast uses a generator to produce input-specific low-rank parameter updates for a frozen pretrained TSFM. These updates adapt the model to each input during both training and inference. Across six public benchmarks, AdaCast consistently outperforms static adaptation baseline in in-domain forecasting and improves zero-shot generalization to held-out datasets across domains. These results demonstrate that conditional parameter generation provides an effective approach for adaptive forecasting.

arXiv cs.LG80

面向未来的训练:时间序列预测测试时自适应的延迟感知审计

arXiv:2610.12232v1 公告类型:新 摘要:用于时间序列预测的测试时自适应(TTA)方法会根据不断到来的真实值更新已部署模型,或围绕该模型构建的小型适配器。然而,$H$ 步预测的标签只有在 $H$ 步之后才会生成,而真实数据管道还会引入额外延迟。我们构建了一个无数据泄漏的测试框架:只有在第 $s+d$ 步(其中 $d \ge H$)才释放预测起点 $s$ 的标签用于更新,并在四种近期 TTA 方法(TAFAS、COSA、PETSA 和 DynaTTA)的已发布代码中强制执行这一规则;这些方法均使用各自的骨干网络和检查点,并在五个基准数据集(ETTm1、ETTh2、Weather、Electricity 和 Traffic)上运行。作为参考,我们加入了两个闭式校正器:一个由递归最小二乘(RLS)滤波器组构成、再结合逐坐标中位数的校正器,它无需可调超参数,在 7 通道数据流上每步耗时 56 微秒;以及一个 ELF-style 线性校正器。在因果延迟标签条件下,结果呈现出不对称性。在 ETTm1 上,所有接受审计的方法都确实实现了自适应,但 RLS 滤波器组仍以远低于它们的成本击败了其中三种;只有 DynaTTA 能击败该滤波器组,而且仅在最小因果延迟下实现,其每次更新成本约为前者的 2,500 倍;ELF-style 校正器则击败了这四种方法。在其他四个数据集上,任何已发表方法相对于其自身冻结检查点所取得的最大统计显著提升均为半个百分点;在这四个数据集上,至少有一种已发表方法在最小因果延迟下显著差于冻结模型;而在漂移严重的 ETTh2 上,较长的标签延迟会使所有与冻结模型存在差异的适配器(包括我们的方法)显著有害。存在泄漏的下一步更新会使简单适配器的表观增益最多膨胀 110%;而骨干网络的训练方案会使冻结模型的在线误差最多相差 25 倍,这一影响超过了我们测得的任何自适应效果。我们发布了该测试框架、集成补丁以及所有缓存的运行结果。