全部动态

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

EmoGavel: Grounding-Aware Reinforcement Learning with Verifiable Rewards for Multimodal Emotion Preference Learning

arXiv:2610.13353v1 Announce Type: cross 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.

arXiv cs.LG74

面向工具集成化学推理的掩码扩散语言智能体

arXiv:2610.13330v1 公告类型:cross 摘要:针对复杂化学任务设计工具集成的推理智能体系统,仍然是一项根本性挑战。尽管近期的化学智能体通过集成外部工具展现出了良好的性能,但它们仍然建立在自回归范式之上,而该范式天然受到因果注意力和从左到右生成的限制。因此,它们往往难以实现双向分子理解、全局协调的工具规划以及多源证据整合。为应对这一挑战,我们提出了 ChemDiffAgent,这是首个用于工具集成化学推理的掩码扩散语言智能体。该方法将化学推理重新表述为对交错的推理轨迹和工具使用轨迹进行迭代去噪,使工具使用决策能够在完整轨迹上下文中联合确定,从而更好地使智能体的决策边界与其知识边界相匹配。我们进一步分析了这一范式如何通过训练期间更具挑战性的填空子问题,以及推理期间灵活的任意顺序解码,来提升智能体推理能力。随后,我们提出了一个两阶段后训练框架,包括智能体监督微调和方差缩减偏好优化,以增强工具使用与推理能力。我们还构建了一个综合基准,涵盖单轮和多轮工具使用场景下的六项化学任务。在预算和评测条件匹配的情况下,ChemDiffAgent 始终优于自回归智能体,整体性能提升约 20%。值得注意的是,我们的 8B 模型达到了与 GPT 5.5 和 Claude Opus 4.7 等规模显著更大的前沿模型相当的性能,在某些情况下甚至超过了它们。代码见 https://github.com/bilemond/ChemDiffAgent。

arXiv cs.LG81

将分词从主机端移出以服务智能体式 LLM

arXiv:2610.13325v1 公告类型:cross 摘要:智能体式工作负载会在多次调用之间重复发送几乎不变的长上下文。如今,前缀缓存可以跳过其中大部分预填充阶段,但每个请求仍必须先完成全部分词,之后才能查询缓存。分词这一长期以来被视为无关紧要的 CPU 阶段,如今却成为首 token 生成时间(TTFT)中占比最大的部分;而为整个 GPU 集群执行分词的前端,则限制了其能够供给的 GPU 数量。我们提出 GraphTok,这是一种 GPU 分词器,可将从预分词、字节对编码(BPE)合并到 token ID 组装的完整编码流程,作为一张可重放的 CUDA 图运行。GraphTok 在 GPT-2、Llama 3、Qwen 2.5、DeepSeek-V3 和 Gemma 3 上逐位复现参考 token ID;对于 GPU 无法占优的短输入,则将其交给 CPU 引擎处理;同时,它还可以接入未经修改的 vLLM 和 NVIDIA Dynamo。GraphTok 在包含数据传输的情况下,可在 1.7–3.2 毫秒内编码一百万个 GPT-2 token;在 Llama 3 上,其速度比最强的 CPU 分词器 gigatoken 快 4.7–6.0 倍。在 TokTier 自有的单请求基准测试中,其速度比 gigatoken 快 2.6–3.9 倍,最高比 TokTier 快 18.1 倍。在使用缓存前缀的 vLLM 中,它将平均 TTFT 降低了 2.1–2.4 倍。最大的提升体现在容量方面。在 2 秒 P99 目标下,配备 GraphTok 的单个 Dynamo 前端可持续处理 518 个请求/秒、每个请求包含 12.1 万个 token 的流量,相当于高峰时段 56 个 GPU 的负载;相比之下,使用 gigatoken 时为 296 个请求/秒,使用默认分词器时仅为 18.5 个请求/秒。在 12.1 万至一百万个 token 的范围内,其可承载负载是 gigatoken 的 1.75–2.5 倍;在 gigatoken 的尾延迟失控的情况下,P99 最多可降低 64 倍。

arXiv cs.LG67

JEPA-kMMVAE: CSI Prediction for Time-Varying Wireless Channels

arXiv:2610.13315v1 Announce Type: cross 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.

arXiv cs.LG76

Sonic-AMG:基于空间音频的流式人体动作生成

arXiv:2610.13300v1 公告类型:cross 摘要:对空间音频引发的人体反应进行建模,需要同时理解听到的内容及其来源方向。以往工作基于完整的声学与空间输入序列离线生成人体动作。然而,人类在对声音做出反应时,并不知道接下来会听到什么。我们提出 Sonic-AMG,据我们所知,这是首个基于空间音频进行流式人体动作生成的框架。该模型将声学内容和相对于身体的声源几何信息编码为独立的标记。以这些标记为条件,带有流模型头的因果 Transformer 生成连续的动作潜变量,随后由因果解码器重建动作片段。标准的教师强制训练从真实动作中获取动作历史和相对于身体的声源位置,而流式推理则依赖生成的动作来获取二者,从而导致训练与推理之间的不匹配。为减小这种历史信息差异,我们引入了 rehearsal training,将完整序列的教师强制监督与短程自回归自主滚动过程中的监督预测相结合。为使空间条件与生成的动作保持一致,我们提出了 spatial feedback,在 rehearsal training 和推理过程中,均根据生成的根部姿态重新计算相对于身体的声源位置。在 SAM 上,Sonic-AMG 取得了当前最佳的 FID 和 R-precision。该方法还支持实时在线生成跨不同声音事件和声源位置的连贯反应。项目页面:https://jingchengni.com/sonic-amg/。

arXiv cs.LG73

解码寄存器令牌保留全局场景细节

arXiv:2610.13299v1 公告类型:交叉 摘要:预训练视觉 Transformer 学习涵盖空间 patch 令牌和非空间令牌的结构化图像表示。近期分析表明,非空间寄存器令牌编码了光照、模糊和风格等全局场景属性。然而,基于 patch 的图像解码器会丢弃这些输出,使解码器只能从 patch 中恢复图像外观。我们研究了在完整的空间 patch 表示已经可用的情况下,保留寄存器特征是否能够改善解码。我们使用配备寄存器的冻结编码器和表示自编码器(RAEs)来探讨这一问题。我们的解码器通过联合自注意力同时处理四个寄存器令牌和全部 patch 令牌。我们采用外观探针、成对重建误差分析以及固定解码器下的寄存器替换实验,考察寄存器能够提供哪些全局图像属性,以及这些属性的取值如何影响重建像素。对于生成任务,我们训练了一个多头注意力池化(MHAP)预测器,从采样得到的 patch 中恢复寄存器特征,同时保持预训练扩散模型及其样本不变。在 ImageNet-1K 上,我们的 ViT-B 解码器使用 DINOv2 和 DINOv3 时,平均重建 FID 分别达到 0.472 和 0.442;相较于各自仅使用 patch 的基线,分别降低了 9.5% 和 5.2%。对应的 PSNR 分别为 19.73 和 20.54 dB。在生成任务中,在相同采样 patch 上,我们的 DINOv2 模型取得了 1.641 的平均 FID,比仅使用 patch 的基线低 9.8%。

arXiv cs.LG85

Do Prompt Optimizers Break Requirements They Are Not Scored On? A Preregistered Study

arXiv:2610.13287v1 Announce Type: cross 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.

arXiv cs.LG80

CV-OPD: Contrastive Vision On-policy Distillation

arXiv:2610.13264v1 Announce Type: cross 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.

arXiv cs.LG82

The Predictability Bias of Joint-Embedding Predictive Learning in Medical Imaging

arXiv:2610.13237v1 Announce Type: cross 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.

arXiv cs.LG76

视频生成的黄金锚点

arXiv:2610.13217v1 公告类型:cross 摘要:视频生成支持数字内容创作,应用于虚拟化身、AI驱动的电影制作、交互式游戏引擎和世界模型。当前最先进的系统主要通过图像到视频(I2V)生成实现可控性,其中注入的锚点图像决定生成视频的身份、构图和风格。在现代流程中,这一锚点由文本到图像(T2I)生成器合成。这引出了一个长期被忽视的问题:直接从T2I模型获得的图像,是否真正适合当前的视频模型?我们的分析表明,锚点的美学与质量评分同下游视频质量之间的相关性较弱。无论在视觉维度还是运动维度,结构与纹理评分都与I2V视频质量呈负相关。相应地,在图像奖励上对T2I模型进行微调,会生成结构和人物细节明显更加密集的锚点:它们在图像指标上的得分更高,却会降低我们测试的每个I2V模型的视频奖励,并使下游运动产生不可预测的变化。因此,我们提出Golden Anchor Learning(GAL)。据我们所知,这是首个通过利用下游视频反馈优化T2I生成器来学习黄金锚点的框架。GAL在冻结的I2V模型下,通过锚点所诱导生成的视频评估候选锚点,并将视频奖励转换为图像级偏好,用于对T2I生成器进行DPO微调。在全部四个I2V模型上,与未经调优的生成器相比,GAL将VBench平均分提高了$2.97\%$--$8.46\%$。渲染得到的视频片段在VideoReward-Overall下的得分也更高,其提取帧在HPSv3和UniPercept下的得分同样更高。根据VBench动态程度指标,GAL在全部四个I2V模型上均带来稳定的运动性能提升,增幅为$5.62\%$--$38.24\%$。尽管GAL仅基于HunyuanVideo-1.5的渲染结果进行训练,这些提升仍能推广到另外三个I2V模型。

arXiv cs.LG66

Verifiable Sampling for Delegated Generative Quantum Machine Learning

arXiv:2610.13211v1 Announce Type: cross 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.

arXiv cs.LG69

Prediction-Informed Landing Window Planning for UAV Landing on USV in High Sea States

arXiv:2610.13190v1 Announce Type: cross 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.

arXiv cs.LG70

Neurograf v1: An End-to-End Romanian-First Language Model Family

arXiv:2610.13134v1 Announce Type: cross 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.

arXiv cs.LG75

展望前方与回顾过去:面向道路网络轨迹的前瞻性生成建模

arXiv:2610.13131v1 发布类型:cross 摘要:轨迹生成是交通管理和城市规划等城市应用的基础。在道路网络中,车辆沿道路路段行驶的过程大体上是确定性的,而在交叉路口处的转向则至关重要——多个驶出路径可能看起来同样合理,但它们可能导致下游路线大相径庭。现有的生成方法(如扩散模型)会模拟位置序列,却无法妥善解决下一步转向选择问题,甚至会生成偏离道路网络的轨迹。为弥补这一不足,我们提出一种根本性的转变:从位置模拟转向道路网络上的行为建模。在本文中,我们从生成式路线规划的角度重新审视轨迹生成,并引入一种新的图约束生成范式——前瞻性生成建模。该范式通过纳入对未来路线如何向目的地展开的预判,解决下一步转向选择问题。具体而言,我们提出了一种名为 Foresight 的新型生成模型,将“预判—选择—更新—再次预判”循环构建为概率模型,使模型能够获得更长期的前瞻能力,同时沿着历史轨迹持续进行序列生成。大量实验表明,Foresight 优于当前最先进的基线方法。

arXiv cs.LG75

基于梯度的连续动态时间规整快速近似

arXiv:2610.13129v1 发布类型:cross 摘要:Dynamic Time Warping(DTW)是衡量时间序列差异的常用方法。它通过动态规划寻找时间戳之间的最优规整路径,但计算速度较慢且不可微。因此,人们提出了多种变体。其中,Soft-DTW 提出了 DTW 的平滑形式,便于计算梯度;Continuous-DTW(CDTW)则通过可参数化的规整函数引入了连续形式。然而,对于这两种方法,计算成本仍然较高,在现代机器学习流程的大规模数据集上难以实际应用。本文从多个方面重新审视 CDTW。在证明其在温和条件下具有可微性之后,我们提出了 FastCDTW,这是一种高效的近似求解器,包含两种不同的计算策略:针对分段线性规整函数的精确闭式方案,以及针对平滑规整函数(例如隐式神经网络)的无偏蒙特卡洛估计器。两种策略都能计算关于规整函数和输入时间序列的梯度,所得算法也适用于 GPU。我们将其集成到更复杂的学习问题中,展示了它的优势,包括时间序列平均、分类和深度领域自适应。

arXiv cs.LG75

为什么重尾权重谱能够预测模型质量

arXiv:2610.13123v1 公告类型:交叉收录 摘要:我们仍未能扎实理解深度神经网络(DNNs)为何在预测任务中表现出色。例如,尽管已有许多依赖数据的指标试图预测 DNNs 的模型质量,但对于大型数据集,这些指标的计算成本可能很高,而且当训练数据集未公开时,这些指标可能根本无法计算。一种实用且有效的模型质量预测方法是分析 DNN 权重矩阵,因为先前的研究已表明,训练后权重矩阵中的重尾谱分布能够有力地预测模型质量。然而,此类指标缺乏严格的统计学依据。在本研究中,我们旨在从统计学角度理解这些指标为何表现良好。为此,我们采用概率框架推导 DNN 的边际似然,并仅使用最后一层的权重进行评估。在大规模卷积 DNNs 和 LLMs 上,我们发现该边际似然能够预测模型质量。为理解重尾谱在预测性能中的作用,我们针对服从(重尾的)高温 Marchenko-Pastur(HTMP)分布的谱,推导了对数边际似然的极限。我们证明,这一极限量是尾部厚重程度参数的凸函数,并推导出一个最优尾部厚重程度,其在实证中能够预测大规模 DNNs 的过拟合。

arXiv cs.LG74

Does Location Matter? A Black-Box Causal Audit Reveals Model-Dependent Audio Grounding in LALM Hallucination

arXiv:2610.13112v1 Announce Type: cross 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 https://github.com/khalooei/causa.

arXiv cs.LG80

针对分布式模型提取的查询监测局限性

arXiv:2610.13083v1 公告类型:cross 摘要:如今,模型提供商面临着通过数千个账户发起的蒸馏活动,而每个账户看起来都像普通用户。当网络和支付元数据无法将这些账户关联起来时,剩下的唯一证据就是它们提出的问题。我们使用一百万条真实聊天轮次进行开发,并用之后17周内、未受任何设计选择影响的数据进行一次固定评估,研究提供商仅凭这些查询能够、以及不能够了解到什么。答案与提取行为本身的特殊性关系不大,更多取决于良性协调:只有当某项活动比同一周内最具鲜明特征的普通用户群体更加独特时,它才是可见的。我们对此进行了形式化,表明活动与用户之间一个微小但为正的差异带来的是检测所需时间,而不是可检测性,并确定了最难检测的活动。实证结果显示,经过校准的监测器能够捕捉到按账户监测器遗漏的朴素分布式提取活动(覆盖0.86至1.00的周数);其中一种变体——在扣除每个账户的主题性之后,选择行动步调一致的账户——即使活动中填充了自然文本,仍能捕捉到其中的活动(覆盖0.50至0.96的周数),而另外两个谱检测器一个也捕捉不到。将每项活动蒸馏成一个小型学生模型后发现,在我们的测试环境中,能够躲过所有检测器的活动,其能力最多只有可检测活动的42%。这些局限同样具体:缓慢升级的活动会污染所有检测器的校准,良性的评估流程与模型蒸馏看起来完全一样;当串通者所占比例为2.5%或更低时,我们没有找到任何可部署的检测器;而转发真实用户请求的活动,可能对任何仅依赖查询的监测器都不可见。

arXiv cs.LG75

CoBe:对话式反事实文本编辑基准

arXiv:2610.13057v1 公告类型:交叉发布 摘要:反事实文本编辑是指根据某个假设性变化修改给定文本,同时保留在因果上不受该变化影响的事实的能力。当被问及如果医生没有建议手术会发生什么时,模型的输出应保留患者的病史,仅修改该决定所带来的后果。这需要因果理解能力:模型必须在没有明确指示的情况下,判断哪些事件会受到假设性变化的影响,以及哪些内容应保持不变。这项能力是人类推理的核心,尤其是在医疗或法律等安全关键领域。相比之下,关联式文本生成任务仅生成与改变后的条件存在统计关联的文本。在上述医疗示例中,关联式回答可能会减轻患者的症状,因为病情较轻与不进行手术存在相关性。这类回答构造了一个看似合理的情境,却并非给定情境的反事实版本。以往的反事实文本数据集并未清晰区分这两种推理模式。我们提出 Counterfactual Benchmark(CoBe),用于测试模型在收到自然对话式提示时,对给定文本情境进行反事实编辑的零样本能力。CoBe 包含 2000 个问题,涵盖医疗、科学与工程、商业及日常情境。我们测试了一系列前沿模型和较小规模模型,其中前沿系统的平均得分为 $58.05\%$。研究结果表明,模型经常默认采用关联式生成,而非保留原始情境的因果结构。此外,性能并未随模型规模或输出词元长度的增加而稳定提升,这表明此类失败可能源于模型的训练目标,而非模型容量不足。

arXiv cs.LG77

空间重于统计量,重训练重于排序:仅标签后门下的训练标签审计

arXiv:2610.13051v1 公告类型:交叉发布 摘要:有些后门攻击从不改动图像。FLIP 只修改标签:在 CIFAR-10 上,翻转 3% 的标签,就能让 ResNet-32 将 99.7% 带有触发器的源类别图像归入攻击者指定的类别。常见防御方法会在使用这些相同标签训练的模型内部寻找投毒痕迹。因此,当这些方法效果不佳时,问题究竟出在所用的检验方法,还是执行检验的空间?我们通过受控替换来回答这个问题:保持检验方法、标签和指标不变,仅改变特征空间,并用各防御方法保留的数据重新训练受害模型,以此评估其防御效果。起决定作用的是空间。在狗$\to$猫的攻击中,同一种最近邻检验在投毒模型特征上的 AUROC 为 0.546,在从未接触过标签的冻结 DINOv2 特征上为 0.967,在使用干净标签训练的同一网络上则为 0.995;最后一种情况是理想参照对照,而非防御方法。我们复现了 FLIP 作者推荐的防御方法 SPECTRE,得到 90.94 / 0.97,与其公布的 91.47 / 1.7 相比接近,随后评估其代价:在卡车$\to$鹿的攻击中,它会删除每个类别 20% 的数据,而基于冻结特征的原型审计仅删除 6%,就能获得更高的干净样本准确率和更低的攻击成功率。在三个更难的类别对上,该审计仍留下约四分之一的攻击效果。在实施任何攻击之前,根据编码器几何结构和干净标签得出的一个计数,能够区分审计可消除攻击的类别对与只能部分消除攻击的类别对,不过这一观察仅涉及一个计数为零的类别对。三项结果提醒我们,不应轻率地下结论。更好的检测分数并不意味着更安全的模型:在四个类别对中的两个上,Confident Learning 的 AUROC 更高,但在狗$\to$猫的攻击中,其残留攻击成功率却是原型审计的 2.6 倍。原型方法族在我们的静态评估中表现最佳,却是自适应攻击者最先绕过的方法。而且,超过某个临界点后,检测出更多投毒样本也不再能降低攻击成功率。应在从未学习过这些标签的空间中检查标签,并根据重新训练后的模型,而非检测分数,来评判防御方法。

arXiv cs.LG56

Lightweight Time-Frequency Vibration Sensing for Consumer Device Condition Monitoring

arXiv:2610.13040v1 Announce Type: cross 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.

arXiv cs.LG69

Scaling Empowered Agents

arXiv:2610.13002v1 Announce Type: cross 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 \href{https://empowerment-geometry.github.io/scaling-empowerment/}{this https url}.

arXiv cs.LG76

SFT 应该学习什么?用于可泛化后训练的条件信息增益

arXiv:2610.12995v1 公告类型:交叉收录 摘要:监督微调(SFT)仍是大语言模型后训练中广泛采用的方法,因为固定的示范可以直接引入期望的推理策略和行为模式。然而,强制模型模仿外部提供的轨迹,也可能干扰预训练已支持的行为,从而限制模型在训练分布之外的泛化能力。近期的动态 SFT 方法根据预测概率、先验支持程度或分布兼容性等模型侧信号,对词元级监督进行重新加权,以缓解这一问题。但与模型的兼容性并不等同于学习价值:当前模型支持程度较低的词元,既可能是不期望的不匹配,也可能恰恰是示范旨在教授的任务特定决策。我们提出 CIG-SFT,这是一种信息论框架,用于估计每个示范词元所携带的、以任务为条件的信息。在教师强制机制下,我们保持标准解答前缀不变,比较冻结的参考模型在能够和不能访问任务输入两种情况下的词元似然。由此得到的条件信息增益,量化了任务本身在多大程度上降低了对示范决策的不确定性。随后,我们将这一信息转化为当前策略的 KL 正则化投影,并推导出等价的标量加权 SFT 目标,其 logit 梯度与投影目标的梯度完全一致。在数学推理和代码生成基准测试中,CIG-SFT 始终优于标准 SFT 和近期的自适应微调基线,尤其在对具有挑战性的评估分布的泛化方面取得了显著提升,同时既不需要额外训练数据,也不需要在线轨迹采样。

arXiv cs.LG67

Forecasting Corpus-Sampling Disagreement in Masked Text Reconstruction

arXiv:2610.12987v1 Announce Type: cross 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.

arXiv cs.LG72

用于事件驱动 Latent Jump Models 的 Scan-Parallel Variational Inference

arXiv:2610.12986v1 公告类型:交叉发布 摘要:连续时间潜在状态空间模型广泛用于不规则观测的时间序列,通常通过随机初始状态及其后平滑的常微分方程(ODE)动力学,或通过随机微分方程(SDE)累积的布朗扰动来表示不确定性。虽然这些构造对于平滑系统或扩散系统而言很自然,但它们并不能直接编码有限个未观测冲击,而这些冲击的发生时间、幅度及其对记忆的影响本身也具有不确定性。为此,我们提出 Latent Jump Models(LJMs):潜在状态在泊松过程驱动的事件时刻之间遵循闭式确定性动力学,并在每次事件发生时经历一个学习得到的瞬时跳变,其强度和标记分布均依赖于状态。这定义了一个时间齐次马尔可夫过程,其中的跳变是内在的状态转移,而非数值积分步骤。在训练方面,我们推导出一个易于计算的事件增强路径空间证据下界(ELBO),并提出 Scan-Parallel Variational Inference(SPVI):以观测为条件的变分后验先采样完整的潜在事件配置,再使用三角仿射扫描计算状态递推。这使 LJMs 能够以对数级时间维度计算深度实现快速且可扩展的训练。在合成随机系统和真实的不规则时间序列上,LJMs 的预测精度与连续时间潜变量基线模型相比保持竞争力,其潜在状态更新次数通常少于数值求解器的求值次数,同时训练速度比序贯基线模型快一到两个数量级。

arXiv cs.LG70

NucleoNet: A Nuclear-Aware Determinant Ansatz for Multi-Geometry Neural Variational Monte Carlo

arXiv:2610.12985v1 Announce Type: cross Abstract: Neural-network variational Monte Carlo provides an accurate route to solving the electronic Schr\"odinger 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.

arXiv cs.LG60

Minions: A Dynamic and Distributed Virtual GPU Cloud Built on Idle Apple Silicon Devices

arXiv:2610.12970v1 Announce Type: cross 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.

arXiv cs.LG66

JoyInside-VLM-Agent: Product-Conditioned Multimodal Policy Learning for Embodied Agents

arXiv:2610.12957v1 Announce Type: cross 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.

arXiv cs.LG68

From Imbalance to Evidence: Deep Nonparametric Testing for Complex Data under Severe Sample Imbalance

arXiv:2610.12946v1 Announce Type: cross 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.

arXiv cs.LG69

Sparse Dictionary Learning for Measure-Valued Data via Linearized Optimal Transport: Efficient Algorithms and Sample Complexity

arXiv:2610.12924v1 Announce Type: cross 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.

arXiv cs.LG65

Beyond Second-Order Information: Paid Logistic Regression with Noisy Features

arXiv:2610.12919v1 Announce Type: cross 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(\sqrt{T})$ 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.

arXiv cs.LG68

BLEND: Balancing Personalization vs. Generalization in Federated Vision-Language Models

arXiv:2610.12907v1 Announce Type: cross 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: https://github.com/payamsiabd/BLEND.git)

arXiv cs.LG77

重新思考扩散与解码的作用:用于并行语言生成的 Predictive-State Flows

arXiv:2610.12898v1 公告类型:交叉发布 摘要:在连续扩散语言模型(DLMs)中,扩散先验生成的潜变量通过解码器或词元嵌入矩阵,以近乎确定性的方式映射为词元。与视觉细节可以连续变化的图像生成不同,扩散先验必须在连续空间中捕捉细粒度的离散词元选择,这可能使潜变量的联合分布难以建模。我们认为,生成任务的职责应当重新划分:扩散先验应生成高层次的预测信息,而解码器则负责解决剩余的词元级选择。基于这一观点,我们提出 Predictive-State Flows(PSF),将序列划分为多个块,并为每个块关联一个仅根据前文上下文计算的预测状态。整流流先验生成预测状态序列,随后由块因果解码器并行生成所有块,仅在各块内部进行自回归生成。这一设计将扩散处理的状态从 L 个词元级状态减少为 K << L 个预测状态,并将词元级的顺序计算深度降至 L/K。在 OpenWebText 无条件生成任务中,一个拥有 1.97 亿参数、K=8 的模型,每生成一篇含 1024 个词元的文档仅需 0.31 TFLOPs,在熵为 5.16 时实现了 22.8 的生成困惑度;相比之下,采用 32 个采样步的 ELF-B 的生成困惑度为 24.0,计算量为 7.2 TFLOPs。在对应的实测运行配置下,两者的 MAUVE@512 分别为 0.93 和 0.73。受控比较进一步表明,额外编码了自身块信息的内容状态,其生成困惑度比预测状态高 8–16%;而将采样得到的预测状态轨迹替换为共享均值,会使 MAUVE@512 降低 0.11。这些结果表明,连续 DLMs 的潜变量设计不仅应考虑文本表示的紧凑程度,还应考虑先验与解码器之间的生成职责划分。

arXiv cs.LG67

Generalized Determinantal Point Processes for Attraction and Repulsion with Distinct Interaction Kernels

arXiv:2610.12894v1 Announce Type: cross 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.

arXiv cs.LG

When Solvers Get Moody: Quantifying and Predicting Performance Variability in Mixed Integer Programming

arXiv:2610.12876v1 Announce Type: cross 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.

arXiv cs.LG73

自归一化 Kullback-Leibler 估计的通用界

arXiv:2610.12851v1 公告类型:交叉发布 摘要:本研究考察了一种基于熵的 Kullback-Leibler(KL)散度估计量,该估计量由归一化重要性权重构造而成。我们证明了一个通用的有限样本界,表明对于任意样本量,该估计量的期望至多比目标分布相对于提议分布的 KL 散度高出 $\log 2$。随后,我们刻画了重要性加权重采样所诱导的分布与提议分布之间的 KL 散度,并表明,基于熵的估计量的期望以及目标分布相对于提议分布的 KL 散度均为其上界。重要的是,这些界既不要求重要性权重有界,也不要求高阶矩有限。我们将这些结果应用于通过 Soft Best-of-$N$ 采样实现的生成模型测试时对齐,以及相对熵编码,得到有限样本下的策略散度保证和无需矩条件的编码成本界。Soft Best-of-$N$ 采样是 Verdun 等人(2025)提出的一种基于重要性采样的扩展技术。

arXiv cs.LG71

双向引导:面向生成式贝叶斯的摘要统计量同步学习

arXiv:2610.12850v1 公告类型:交叉收录 摘要:随着观测样本量增大,基于模拟的贝叶斯推断(SBI)可能难以恢复日益集中的后验分布。我们将充分摘要统计量与后验分布的联合学习视为一项通用原则,以实现各种 SBI 方法中的可扩展推断。SBI 中的一种常见做法是通过预先确定的摘要统计量进行降维,但这可能丢失部分后验信息。相比之下,我们的方法对后验学习器依赖于所学摘要统计量的方式施加结构约束(例如仿射性),并将摘要统计量与后验分布同步学习。我们发现了一种重要机制,称为双向引导:在对摘要统计量施加结构约束的条件下,所学摘要统计量的后验充分性简化了后验学习,而恰当的后验目标函数则引导所学摘要统计量趋向后验充分性。这一机制解释了一个反直觉的发现:对摘要统计量施加结构约束能够改善后验学习,而非限制其性能。我们针对后验估计误差以及所学摘要统计量对充分性的偏离程度均建立了理论保证,从而明确了随着观测样本量增大,为恢复日益集中的后验分布,模拟预算需要满足的条件。

arXiv cs.LG75

APEX:用于极致压缩的异步前缀去噪

arXiv:2610.12843v1 公告类型:交叉发布 摘要:更少的潜在词元有望降低扩散模型的计算成本。然而,激进的潜在空间压缩会造成重建与生成之间的两难:增加通道数可以改善重建,却会使生成更加困难。我们提出 APEX,其全称为 Asynchronous Prefix denoising for EXtreme compression,将分层潜在空间与针对通道组的异步去噪相结合。我们的自编码器将通道前缀按从结构到细节的顺序排列,而一个共享去噪器则在错开的局部时间步生成这些通道组,无需增加词元。在 ImageNet-512 上,在 64 倍和 128 倍压缩条件下,APEX 在所有评估的通道数设置中均优于现有方法。在训练和引导采样计算量相同的情况下,它在所有评估的计算预算下也均优于一个 256 词元模型,且计算量越低,优势越明显。代码见 https://daviddinkevich.github.io/APEX。

arXiv cs.LG72

COFFEQA:用于大语言模型问答的反事实引导少样本蒸馏

arXiv:2610.12837v1 公告类型:交叉收录 摘要:知识蒸馏旨在训练较小的学生模型,使其模仿较大的教师模型,以适用于资源受限的环境。然而,蒸馏过程通常需要大量数据,且计算成本高昂,尤其是对于生成式任务。少样本蒸馏提供了一种替代方案,通过有限的训练样本迁移教师模型的知识。然而,我们观察到,少样本蒸馏的性能在很大程度上取决于这些训练样本的选择。事实上,我们证明,使用教师模型决策边界附近不确定性更高的样本,会显著降低蒸馏性能。受此观察启发,我们提出了用于开卷问答的反事实引导少样本蒸馏方法(COFFEQA)。这是一种新策略,能够巧妙利用反事实,为具有挑战性的事实样本提供额外监督。在生成式问答场景中,我们将反事实定义为经过最小幅度修改的上下文,该上下文会促使教师模型将其回答改为另一个答案。我们从几何角度阐释了事实—反事实样本对如何约束教师模型与学生模型决策边界之间的偏差。我们还引入了一项新指标——上下文遵循难度(CFD),根据回答与预期替代答案的一致性,以及对修改后上下文的依赖程度,在蒸馏前进一步验证反事实。COFFEQA 使用经 CFD 验证的事实—反事实样本对进行少样本蒸馏。采用 T5 和 Qwen2.5 系列模型,在五个域内和三个域外问答基准上开展的实验表明,在相同的少样本预算下,COFFEQA 优于仅使用事实样本的蒸馏基线。例如,在 TriviaQA 上,使用 T5 模型和 32 个少样本对时,COFFEQA 相较于仅使用事实样本的基线,平均 EM 分数提高了 8.77 分,平均 F1 分数提高了 9.98 分。

arXiv cs.LG61

Scalable Learning of Determinantal Point Processes with Kernel-Structured Interactions

arXiv:2610.12829v1 Announce Type: cross 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 (c) 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.