跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+758新增论文
+578其中 AI 相关
+94已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-17 04:58 · 全站最近入库:2026-11-17 04:58各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 07:50 — 2026-11-17 07:50(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-17 04:58最近发现新增版本:2026-11-17 04:58库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

24,106 已收录论文20,158 AI 相关7,049 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 24,106 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-17 04:57(北京时间)
新论文 · v1arXiv:2611.09836

智能体系统能否借助生产级AI工具弥合放射学差距?

Can Agentic Systems Close the Gap in Radiology with Production AI Tools?

Aubin Charley, Julien Khlaut, Charles Corbière, Pierre Manceron, Corentin Dancette, Léo Machado

AI 速读 基于摘要

该研究构建了一个放射学智能体框架,在模拟报告生成中量化FDA已获批工具目录与编排能力对临床可操作发现召回的限制。

cs.AI · cs.LG

查看原文摘要

Radiology AI has developed along two paths: specialized models that perform well on narrow tasks but cover few clinical findings, and generalist models that address a broader range of tasks but remain prone to hallucination and inaccurate measurements. Combining the two through agentic systems offers a route towards comprehensive radiology reporting, but published systems are tied to one modality or body part. We describe a radiology agentic framework that standardizes how an orchestrator calls modular tools to produce a structured report, and use it to measure what such a system can do with the tools from FDA-cleared radiology AI devices. Report generation is simulated on a large multi-modality report corpus, with the orchestrator given either a catalog of finding classes consolidated from the cleared devices, each available on the modalities it is cleared for, or an unlimited catalog in which any class can be requested, and planning either from the clinical indication or from the target report. Tool outputs are simulated from the reference report, so the comparison isolates tool availability and orchestration from tool error. With the cleared catalog and the indication alone, the orchestrator recovers under a third of the clinically actionable findings; recovery improves substantially with the unlimited catalog, and further when the plan is written from the target report. Attributing every missed finding to a cause shows that most are classes no cleared device offers for the study's modality, and that a third are classes or tools that were offered and not called. Adding the most frequently missing tools closes most of the gap to the unlimited catalog on held-out reports, whereas a smaller orchestrator with the unlimited catalog gives up the whole gain. Tool availability and effective orchestration are thus complementary constraints on comprehensive AI-assisted radiology reporting.

版本更新 · v2arXiv:2611.05557

支持向量机直接最小化KL散度

Support Vector Machines Directly Minimise KL Divergence

Ivan Silajev

AI 速读 基于摘要

作者证明支持向量分类与回归的对偶目标等价于两个高斯测度间带约束的KL散度最小化,并据此将核岭回归纳入同一信息论框架。

cs.LG · stat.ML

查看原文摘要

Support vector machines (SVMs) are fundamentally grounded in geometric margin maximisation and currently lack a mainstream probabilistic interpretation. This keeps them theoretically isolated from probabilistic machine learning models that are naturally comparable and combinable. In this paper, we bridge this gap by proving that the dual objectives of both support vector classification and support vector regression are exact, constrained Kullback-Leibler (KL) divergence minimisation tasks between two Gaussian measures. We further show that this same divergence formulation recovers the exact objective function for kernel ridge regression when domain constraints are removed and $L^2$ regularisation is applied. By demonstrating that SVM duals directly minimise relative entropy, our results provide a unified information-theoretic model for standard kernel machines and lay the foundation for unifying broader kernel-based algorithms under probability theory.

版本更新 · v2arXiv:2609.00313

MUSES: A Benchmark for Prospective Intellectual-Roots Retrieval

Rohan Pandey, Sunjae Kwon, Hong Yu

原文摘要

Scientific discovery depends on finding prior literature that shapes what comes next. Existing retrieval systems optimize for relevance and popularity, often favoring central papers over less familiar works that later prove generative. We introduce \textbf{MUSES}, a million-instance benchmark for prospective intellectual-roots retrieval over a fixed 2.33M-paper corpus, with roughly 140K test instances per familiarity tier. To our knowledge, it is the first prospective benchmark at this scale with a shared retrieval task and author-confirmed paper-level root labels. Alongside it, \textbf{CiteRoots} pairs a scalable rhetorical layer over local citation text (LLM judge $κ= 0.896$ versus human gold) with a paper-level author-endorsed layer ($n = 1{,}518$ generative-inspiration pairs from 753 focal papers). MUSES organizes difficulty along two axes: a \emph{familiarity} axis spanning CiteNext, CiteNew, and CiteNew-Isolated, and a \emph{functional} axis spanning broad citations, rhetorical roots, and author-endorsed roots. Across 9 method classes, a lean multi-centroid retriever built on SPECTER2 is strongest. Hit@100 falls from 0.534 on CiteNext to 0.424 on CiteNew, 0.205 on rhetorical CiteNew, and 0.171 on author-endorsed CiteNew, a $3.1\times$ decline. In a registered eight-lens full-test audit, roughly half of broad-tier test instances remain unsolved at K=1{,}000. Rhetorical role and author endorsement are distinct: the same judge agrees with endorsement at $κ= 0.037$. We release MUSES, both CiteRoots layers, and a distilled open companion judge for future work on prospective retrieval and intellectual roots.

cs.IR

新论文 · v1arXiv:2611.10106

Beyond Prompt Attacks: Least-Action Auditing of Concept Erasure

Yifei Zhu

原文摘要

Concept erasure, or concept unlearning, in text-to-image diffusion models is usually audited with prompt attacks. A prompt attack tests whether one conditioning string still retrieves the erased concept. It does not measure the probability that the frozen generator still assigns to that concept. We introduce least-action auditing of this residual probability, and evaluate it on Stable Diffusion concept-erasure checkpoints. The least-action barrier is the minimum control cost of driving the frozen reverse process into a detector-defined concept event. This cost equals the path-space KL divergence of conditioning the model on the event, and therefore the event's negative log-probability. The estimate $ΔS_{\mathrm{rob}}$ uses a CLIP$\wedge$DINOv2 consensus terminal, with no retraining and no adversarial prompt. Across $18$ erased concept-mechanism pairs spanning object classes and NSFW nudity, $ΔS_{\mathrm{rob}}$ predicts deployment leakage counted on $1{,}500$ fresh samples per model by detectors excluded from the audit (pooled Spearman $ρ{=}{-}0.76$, $p{=}5{\times}10^{-4}$). Within every audited concept, the eraser with the higher barrier leaks less ($18/18$). On NSFW nudity the barrier orders the standard erasers exactly: UCE $ΔS_{\mathrm{rob}}{=}3.9$ (leak $16.4\%$) $<$ ESD $75.5$ ($9.8\%$) $<$ RECE $224.5$ ($1.4\%$), while Safe Latent Diffusion (SLD) stays near zero and leaks $85.5\%$ under explicit prompts. The same trajectories repair deployed checkpoints. An audit-guided closed-form patch reduces UCE nudity leakage from $16.2\%$ to $0/1{,}500$ and RECE church leakage by $3.3\times$, where direction-count-matched random edits fail.

cs.CR · cs.CV

版本更新 · v3arXiv:2606.15950

Spectral Similarity Weights for Adaptive Conformal Prediction: A Bias-Variance Account and a Benchmark

Jeffery Opoku, David Banahene

原文摘要

Conformal prediction intervals lose their guarantee when a series is not exchangeable. We study weighting calibration residuals by the similarity of local Fourier power features, combined with the adaptive level update of ACI. A two-term account of the coverage error, mismatch that falls and sampling error that rises as the bandwidth shrinks, holds with exogenous features and conditionally independent residuals, but not for features computed from the series itself, which is how the method is used. In four simulations, spectral weighting lowered the mean regime-level deviation of coverage by 17% to 19% when the features came from the response and by 75% when they were exogenous, and not clearly under gradual drift. In each recurring-regime design a scaled-error baseline or Conformal PID control calibrated better. On nine public series with 36 forecast origins, spectral weighting with the plain weighted quantile did not differ from projected ACI in coverage error, and Conformal PID and scaled ACI were the best calibrated methods. The features are blind to seasonal phase, so the weights act like a recency kernel. A pure recency kernel did at least as well, especially with a finite-sample rank correction (mean absolute coverage error 0.039 against 0.090 for ACI; a post hoc check). Calendar phase weights narrowed German electricity intervals by 23% at equal coverage, but were not better than ACI across the series. We suggest trying adaptive baselines first, and similarity weights only where regimes differ in spectral shape or season and the effective sample size stays large.

stat.ML · cs.LG

版本更新 · v2arXiv:2605.06136

Build-and-Find:一种评估智能体管理代码库的努力感知协议

Build-and-Find: An Effort-Aware Protocol for Evaluating Agent-Managed Codebases

Jhen-Ke Lin

AI 速读 基于摘要

提出 Build-and-Find 协议,将代码库视为面向后续智能体的沟通产物,用恢复准确率、稳定性与检查努力等指标评估生成仓库的可读性与意图可恢复性。

cs.SE · cs.AI

查看原文摘要

Most coding-agent benchmarks ask whether generated code behaves correctly. That remains essential, but repository-level engineering is increasingly agent-managed: one agent writes a repository, and later agents inspect, audit, or extend it as working context. In that setting, a generated repository is not only an answer to a task but also a communication artifact for future work. Even when strong agents nearly satisfy the visible behavioral objective, repositories can differ in how clearly they expose the intended behavior and design choices behind that behavior. We introduce Build-and-Find to evaluate whether downstream agents can efficiently recover intended choices from generated repositories. For each task, a builder creates a codebase from a hidden specification; a finder receives only the codebase and a specification-traced question bank. The protocol separates behavioral correctness from artifact-side recovery and reports recovery accuracy, repeatability, implementation coverage, and inspection effort. Evaluation proceeds in two stages: the first uses recovery accuracy and stability as gates to establish that finders can reliably recover the intended choices; the second compares inspection effort by the same finder across artifacts that pass these gates and allow the same intent to be recovered. Lower effort suggests that the artifact makes that intent easier to locate. We find that several frontier models approach saturation in intent recovery on our task pack, yet second-stage inspection effort reveals differences among their generated artifacts, providing a dimension beyond accuracy for comparing artifact legibility. We also audit artifacts to distinguish unimplemented specification claims from finder failures and check whether correct answers are supported by artifact evidence. We release the harness and benchmark data for reproducibility and extension.

新论文 · v1arXiv:2611.09828

设计有效的基于监控器的干预措施以缓解强化学习中的奖励黑客行为

Designing Effective Monitor-Based Interventions for Mitigating Reward Hacking During RL

Aria Wong, Joshua Engels, Neel Nanda

AI 速读 基于摘要

作者开源三个Qwen3-4B会发生奖励黑客的真实环境,研究如何有效使用监控器在RL训练中抑制奖励黑客,并总结出监控器设计与训练数据安排方面的经验。

cs.LG

查看原文摘要

Reinforcement learning (RL) rewards are notoriously difficult to design and control, often leading to the model learning unintended behaviors such as reward hacking. One potential solution is to monitor for reward hacking and penalize it when detected; however, training against a monitor could lead to evasive behavior, and our general understanding of how to apply monitors effectively during training is limited. To study how best to use monitors to mitigate reward hacking, we introduce and open source three realistic environments where Qwen3-4B reward hacks: a coding environment hackable via test overwriting, a medical chat environment hackable via sycophancy, and a biography generation environment hackable via hallucination. We first focus on the coding environment, where we find that: (1) models can learn to evade highly accurate monitors by exploiting systemic flaws in probes and LLM judges; (2) monitors that leak more learning signal during RL suppress reward hacking but are more often evaded; and (3) including easier problems in training can decrease reward hacking. We apply our findings to build better reward hacking monitors for the medical chat and biography generation environments that improve upon naive baselines to reduce reward hacking rates across seeds to before-training levels in some interventions. Our results demonstrate that our takeaways translate to new settings and that better monitor intervention designs are possible.

新论文 · v1arXiv:2611.09825

BitDecoding-FP4:通过算法-系统协同设计的原生FP4 KV缓存解码

BitDecoding-FP4: Native FP4 KV Cache Decoding via Algorithm-System Co-Design

Dayou Du, Woon Yee Ng, Guangming Sheng, Nick Lau, Jianyi Cheng, Luo Mai

AI 速读 基于摘要

提出算法与系统协同设计的原生FP4 KV缓存解码方案,在保持接近BF16精度的同时提升长上下文LLM服务吞吐。

cs.AI · cs.AR · cs.CL · cs.PF

查看原文摘要

The key-value (KV) cache dominates memory capacity and bandwidth in long-context LLM serving. While 4-bit microscaling formats (NVFP4, MXFP4) shrink the cache and run attention on FP4 Tensor Cores, a fundamental gap remains between algorithmic quantization and system-aware acceleration: existing FP4 KV systems use vanilla quantization that causes severe accuracy drops, whereas accuracy-oriented 4-bit algorithms rely on vector codebooks whose lookup overhead degrades decoding throughput. We present BitDecoding-FP4, an algorithm--system co-design for accurate and efficient native FP4 KV decoding. We mitigate three error sources: Dual-Residual Query Quantization splits queries into two FP4 tensors, cutting query logit error from 60% to 1%; Underflow-Aware Probability Scaling prevents E4M3 scales from rounding long-context probabilities to zero; and Outlier-Aware Key Quantization combines static smoothing, Hadamard rotation, and scale search to suppress key outliers under token-wise scaling. At the system level, we remove the softmax bottleneck via transposed softmax with fused probability quantization and stacked query MMA on paged KV caches. Across dense and MoE models with GQA and MLA, BitDecoding-FP4 stays within 0.5 points of BF16 KV accuracy with NVFP4 (1 point with MXFP4), and tracks BF16 KV in RL training rollouts. In end-to-end serving on NVIDIA B300 with Qwen3-4B and Qwen3-30B-A3B, it delivers 2.4-3.0$\times$ higher peak serving throughput than BF16 KV. The implementation is available at https://github.com/OpenBitSys/BitDecoding-FP4.

版本更新 · v2arXiv:2606.17241

超越基准:嵌入式车载硬件上交通标志识别的连续边缘推理

Beyond Benchmarks: Continuous Edge Inference for Traffic Sign Recognition on Embedded Vehicular Hardware

Aditya Mishra, Anushka Tailor, Haroon Lone

AI 速读 基于摘要

作者提出面向NVIDIA Jetson Orin Nano的连续边缘推理系统Edge-TSR,并在流式视频评测中揭示图像基准与真实部署之间的性能落差。

cs.CV · cs.RO · eess.SY

查看原文摘要

Traffic sign recognition (TSR) systems deployed on embedded vehicular hardware face deployment effects that image-based benchmark evaluation does not capture, including frame-to-frame prediction instability in streaming video and load-dependent throughput under sustained operation. We present Edge-TSR, a continuous edge inference system for TSR on the NVIDIA Jetson Orin Nano that combines sparse detection, multi-object tracking, region-level fine-grained classification, and a lightweight track-aware temporal stabilization mechanism adding only 0.07~ms per sampled frame. Evaluating on the source videos of the INTSD benchmark, we find that the state-of-the-art TSR models lose 20-30 percentage points of mAP@50 when moving from image-based to streaming evaluation. Edge-TSR achieves the best streaming classification performance among all evaluated baselines, and temporal stabilization improves accuracy by 10.58 percentage points over per-frame inference. We characterize latency, throughput, and thermal behavior across sampling intervals and four driving conditions, showing that throughput is load-proportional (20 ms per classified region) and that every-frame inference is limited by throughput rather than thermal throttling. A 55-minute, 26 km vehicular deployment demonstrates sustained online operation at 16.18 FPS within safe thermal limits without cloud offload. We also release the annotated 50,732-frame streaming evaluation dataset and full implementation.

新论文 · v1arXiv:2611.09818

生成式潜先验:用于解释与操控蛋白质语言模型

Generative Latent Priors for Interpreting and Steering Protein Language Models

Daniel Hinjos, Lucía Urcelay

AI 速读 基于摘要

作者将生成式潜先验(GLP)扩散模型移植到 ESM-2 激活上,评估其作为蛋白质表示解释工具与激活编辑先验的效果。

cs.AI · cs.LG

查看原文摘要

Dominant methods for interpreting large models impose strong structural assumptions. Generative Latent Priors (GLP) are a complementary approach: a diffusion model that learns the distribution of a frozen model's activations directly, imposing no assumptions. We port GLP to ESM-2 activations (UniRef50) and evaluate it at two host scales (ESM-2-8M and -650M), both as a lens for protein representations and as a prior for editing them. Generation quality scales smoothly with depth and compute. As a lens, single GLP "meta-neurons" are the strongest probes of discrete Swiss-Prot concepts at both hosts, beating InterPLM's released SAE features, and lead on continuous properties at 8M though not at 650M; falsification tests show this is mostly concentration, not new information. As an editing prior, the on-manifold correction makes DiffMean steering of three biochemical properties effective and restores on-manifoldness, but only in isolation: re-embedding the sequences actually produced after several rounds of decoding, the structural plausibility is compromised. This is mainly reproduced in additional SAE-based clamping structural steering experiments, where only Helix motif succeeds. The naturalness failure is traced to the rewriting coverage and the decoder rather than the prior, highlighting what the method must clear before it can serve for both discovery-by-editing and discovery-by-exploration. Trained GLPs are released on huggingface.co/collections/HPAI-BSC/glprot.

新论文 · v1arXiv:2611.09817

机器学习用于格点QCD

Machine learning for lattice QCD

Gurtej Kanwar, Scott Lawrence, Alessandro Nada, Phiala Shanahan

AI 速读 基于摘要

综述截至2025年底已确立的、在不引入不可控近似前提下用机器学习优化格点场论计算的方法。

hep-lat · cs.LG

查看原文摘要

Machine learning (ML) methods have been explored as a means of optimizing lattice field theory calculations, with increasing interest in recent years. This chapter gives an introduction and summary to the use of ML methods to optimize lattice field theory without introducing any uncontrolled approximations. We focus on those directions which are clearly established as of late 2025, marking the 50th anniversary of the beginning of the study of lattice gauge theory. This chapter is a contribution to the online book ``Lattice QCD at 50 years,'' (LQCD@50), edited by Tanmoy Bhattacharya, Maarten Golterman, Rajan Gupta, Laurent Lellouch, and Steve Sharpe.

版本更新 · v2arXiv:2610.19429

自动驾驶中强化学习算法的综合比较

A Comprehensive Comparison of Reinforcement Learning Algorithms in Autonomous Driving

Dechen Xie, Mushuang Liu

AI 速读 基于摘要

在同一无信号交叉口自动驾驶决策问题上,对FVI、RCPI、DQN和D-DDPG四种强化学习方法进行最优性、安全性、训练稳定性与成本比较。

cs.LG · eess.SY

查看原文摘要

This paper presents a comprehensive comparison of four representative Reinforcement Learning (RL) methods in autonomous vehicle (AV) decision-making, including Fitted Value Iteration (FVI), Rollout Classification Policy Iteration (RCPI), Deep Q-Network (DQN), and a discrete-action adaptation of Deep Deterministic Policy Gradient (D-DDPG). The four methods are applied to the same AV decision-making problem at an unsignalized intersection and are compared in terms of optimality, safety, training stability, and training and decision cost. Observations suggest that RCPI provides the closest estimation to the exact solution and has the most stable training curve; however, it is data-intensive and requires the largest volume of data. D-DDPG is the most data-efficient one, but at the price of the training stability. Based on the observations, we provide suggestions for the algorithm selection for AV decision making.

版本更新 · v2arXiv:2609.22183

CleanScore:带负对照与敏感性边界的黑盒基准审计

CleanScore: Black-Box Benchmark Audits with Negative Controls and Sensitivity Bounds

Jeffery Opoku, David Banahene

AI 速读 基于摘要

提出一种仅需答题对错的黑盒审计方法,用改写题与对照题库估计公开基准题的形式优势,并通过受控实验检验其检测污染的能力与盲区。

cs.LG · stat.ME

查看原文摘要

Public benchmark scores reflect skill, prior exposure to the questions, or both, and for most models the training data are unknown. CleanScore is a black-box audit: the estimator needs only a correct-or-incorrect score for each form, not training data or weights. Each benchmark question becomes a parent item with one public form and two independently written fresh forms that keep its numbers, facts and answer. The audit reports an interval for the public-form advantage, not a verdict, and a private control bank with an explicit transport radius provides a proxy for the ordinary form gap that a rewrite alone can produce. A registered controlled-exposure experiment, a preliminary validation, detects planted exposure in one of two model families. A registered audit of five open models on 200 GSM8K and 200 ARC-Challenge items (ARC with stem-only rewrites, scored by option log probabilities) finds no exposure-consistent advantage, and two reruns declared before they were run (GSM8K at a longer token budget, ARC scored from generated letters) leave that conclusion unchanged. For four of the ten model-benchmark pairs the upper end of the interval is about five points or less, and for none is it above 21 points. The registered claim rule is much less sensitive than the primary interval: it flags a planted ten-point advantage in 5% to 11% of audits. Registered positive controls show what a null can mean. In four models, each trained under four seeds, items leaked into fine-tuning gained 25 points on average over unleaked items on the leaked wording and 19 points on paraphrases the model never saw, so a substantial share of the effect, estimated at 76% (95% interval 50% to 113%), is invisible to a paraphrase audit. A null on surface form says much less about contamination than the name suggests.

新论文 · v1arXiv:2611.09816

BEV3SR:基于视频的证据感知三维空间推理

BEV3SR: Evidence-Aware 3D Spatial Reasoning from Video

Fan Zhu, Rui Yu

AI 速读 基于摘要

BEV3SR 是一个无需训练、与骨干模型无关的框架,它把 RGB-D 视频转换为可查询的度量鸟瞰图(BEV)场景记忆,并按查询所需的证据类型选择几何推理或视觉证据对齐路径,以支持显式三维空间推理。

cs.CV

查看原文摘要

3D spatial reasoning from video remains challenging for VLMs because videos provide sequential, view-local observations rather than persistent metric scene records. Many questions must be answered in a query-specified perspective rather than the observed camera viewpoint, and prompting with a fixed set of RGB views may miss sparse or occluded visual cues. To address these gaps, we introduce BEV3SR, a training-free and backbone-agnostic framework for RGB-D videos with camera parameters. BEV3SR turns video observations into queryable metric bird's-eye-view (BEV) scene memory and formalizes each query into an evidence-aware spatial task. The Spatial Task Formalizer specifies the query's reference frame, spatial constraints, objective, and evidence requirement. The evidence requirement determines the appropriate reasoning pathway. A query treated as requiring geometric evidence is handled by the Geometric Reasoner, which deterministically computes the answer using the metric BEV records in the query-specified reference frame. Otherwise, a query treated as requiring visual evidence is passed to the Visual Evidence Aligner, which uses BEV-indexed object records and their associated supporting views to retrieve object-consistent and scene-context RGB frames for VLM grounding. Within a standard 16-frame budget, BEV3SR consistently improves different VLM backbones across multiple 3D scene QA benchmarks, delivering large gains on spatially intensive questions and significant improvements on open-ended scene QA. These results demonstrate that BEV3SR offers an effective, efficient, and interpretable framework for explicit 3D spatial reasoning from video.

新论文 · v1arXiv:2611.09815

覆盖率的代价:为英国风电功率原生预测不确定性做共形校准

The Cost of Coverage: Conformalising Native Forecast Uncertainty for GB Wind Power

Carl Somers

AI 速读 基于摘要

作者将共形预测用于英国两座风电场六种预测器的原生预测区间,比较校准带来的收益与代价,并指出按风速情景区分校准可改善高风速下的覆盖率。

cs.LG · stat.AP

查看原文摘要

Uncertainty bands on wind forecasts help inform reserve sizing and commitments, but often fail to deliver their stated coverage. We apply conformal prediction to native bands to see what it adds and what it costs, comparing six forecasters, from ARIMA to a tabular foundation model, at two wind farms in Great Britain (GB) under operational conditions. We show that calibration repairs empirical marginal coverage with little or no Winkler Score penalty, but this apparent success conceals under-coverage in high winds. Calibrating by forecast wind regime turns marginal coverage into regime-level coverage, cutting day-ahead out-of-band volume in high winds by over 40% relative to pooled calibration while narrowing bands overall.

新论文 · v1arXiv:2611.09809

超越 n/2 阈值:计算汉明重量与对称函数的量子查询复杂度

Beyond the $n/2$ Threshold: Quantum Query Complexity for Computing Hamming Weight and Symmetric Functions

Yuan Deng, Zihan Hao, Honghao Lin, Qipeng Liu, Vahab Mirrokni, Jianan Shao, David P. Woodruff

AI 速读 基于摘要

作者构造了一类需要 n/2+Ω(n^{1/3}) 次量子查询的对称布尔函数,并给出用 n/2+O(n^{1/3}) 次查询精确恢复汉明重量的算法,从而确定该加性阶数的最优性。

quant-ph · cs.CC

查看原文摘要

The oracle-interrogation algorithm [van Dam, FOCS '98] computes every $n$-bit Boolean function with bounded error using $n/2+O(\sqrt n)$ quantum queries. In contrast, parity can be computed exactly using $\lceil n/2\rceil$ queries, but whether an additive overhead beyond $n/2$ is necessary for a single Boolean output has remained open. In this work, we construct an explicit family of symmetric Boolean functions requiring $n/2+Ω(n^{1/3})$ quantum queries at a fixed positive constant error. We also give an algorithm that recovers the exact Hamming weight using $n/2+O(n^{1/3})$ quantum queries with bounded error, and therefore computes every symmetric Boolean function within the same query bound. Together, these results determine the optimal additive order for Hamming weight recovery and for the worst case over symmetric Boolean functions at sufficiently small constant error.

新论文 · v1arXiv:2611.09808

补丁路径上的智能体:在 GitHub 安全公告中挖掘与 AI 相关的安全修复

Agents on the Patch Path: Mining AI-Associated Security Remediation in GitHub Security Advisories

Claudio Segal, Paulo Segal, Hudson Silva Borges, Paulo Silveira, Daniel S. Menasché, Eduardo Santana de Almeida, Felipe de Sant'Anna Paixão, Joanna C. S. Santos 等 11 位作者

AI 速读 基于摘要

作者通过本地 Git 挖掘流程,在经审核的 GitHub Security Advisories(GHSA)所引用的提交中识别编码智能体参与安全修复的可观察证据,并比较相关公告的审核时延。

cs.SE

查看原文摘要

Autonomous coding agents are increasingly involved in software development, but their participation in real-world security remediation remains poorly understood. We investigate observable evidence of coding-agent involvement in commits referenced by reviewed GitHub Security Advisories (GHSAs), characterize the associated vulnerabilities, and examine review timing in relation to advisory disclosure routes. We develop a local-Git mining pipeline that identifies agent evidence through known agent accounts, explicit commit-message attribution, repository instruction files, and agent configuration artifacts. Linking these findings to GHSA-referenced commits yields 469 valid candidate advisories across 189 repositories, including 448 with direct attribution and 21 supported only by repository-level evidence. Claude is the most frequently observed tool family, followed by Copilot and Cursor. We further compare review timing against other advisories and historical baselines using an exact route--timing decomposition. Relative to advisories published in the same months, candidate advisories exhibit a modestly longer mean review lag, primarily associated with within-route timing rather than disclosure-route composition. Compared with a historical baseline, they exhibit substantially shorter mean review lags, with both route composition and within-route timing contributing to the difference. These findings demonstrate that coding-agent involvement is already observable across hundreds of security advisories and repositories, including high- and critical-severity vulnerabilities. By distinguishing direct attribution from repository-level adoption evidence and separating route-composition effects from within-route timing differences, we provide an empirical characterization of agent-associated remediation in the GHSA review pipeline.

版本更新 · v3arXiv:2605.00222

CompleteRXN:迈向补全开放化学反应数据库

CompleteRXN: Toward Completing Open Chemical Reaction Databases

Gabriel Vogel, Minouk Noordsij, Evgeny Pidko, Jana M. Weber

AI 速读 基于摘要

作者构建了面向真实缺失数据条件的大规模反应补全监督基准 CompleteRXN,并比较了约束反应配平器 CRB、SynRBL 与一种带约束解码的编码器-解码器模型。

cs.LG · physics.chem-ph

查看原文摘要

Chemical reaction datasets such as USPTO suffer from substantial incompleteness, frequently missing byproducts, co-reactants, and stoichiometric coefficients. This limits their applicability and reliability in downstream applications. Here, we introduce CompleteRXN, a large-scale supervised benchmark for reaction completion under realistic missing-data conditions. We construct a dataset of aligned incomplete and atom-balanced reactions by mapping USPTO records to curated mechanistic reactions. We evaluate representative baselines, including a novel encoder-decoder reaction completion model with constrained decoding, the Constrained Reaction Balancer (CRB), and a recent algorithmic method, SynRBL. On our CompleteRXN benchmark, the CRB achieves high performance across splits of increasing difficulty, reaching 99.28% equivalence accuracy on the random split and 91.71% on the extreme out-of-distribution split. SynRBL produces many balanced and chemically plausible completions, but with lower accuracy on the benchmark test splits. Across all methods, performance degrades with increasing incompleteness. We observe a substantial drop when evaluating on reactions outside the benchmark (full uncurated USPTO), highlighting the gap between benchmark performance and practical robustness and motivating future work. Data, code and models can be found at: https://github.com/Intelligent-molecular-systems/CompleteRxn-Benchmarking.

新论文 · v1arXiv:2611.09807

两层对话记忆中的压缩、衰减与强化:与检索增强生成的配对评估

Compaction, decay and reinforcement in a two-tier conversational memory: a paired evaluation against retrieval-augmented generation

Osamudiamen Edogun, Joshua Obigwe, Irfan Mehmood

AI 速读 基于摘要

在LoCoMo上配对比较“逐轮压缩为原子事实”与“保留原文检索”两种对话记忆方案,发现压缩在事实型问题上占优、在措辞依赖型问题上落后。

cs.CL

查看原文摘要

A conversational agent that remembers has to decide what to keep. Retrieval-augmented generation keeps the transcript and searches it; the alternative is to compact each turn into atomic facts and search those. We compare the two on LoCoMo, with both arms answering all 1,985 questions in one window, against the same stores, with the same generator and judge, and both predictions on one row, which licenses McNemar's exact test on the 512 questions where they disagree. On the four categories comparable work reports, compaction scores 71.4 per cent against 64.6, a lead of 6.8 points (p = 5.5e-08) at 34 per cent fewer prompt tokens. On all five, including the adversarial set comparable work drops, the lead falls to 2.0 and stops being significant, because the baseline leads adversarial by 14.6. That loss has a structure. Our lead falls as the reference answer demands more source wording, 9.6 points ahead at one or two reference words and 3.1 behind past eight, with token overlap moving the same way, so the judge is not the cause. Compaction keeps what a fact asserts and discards how it was said, so it wins where the answer is a value and loses where it is a phrasing. We also report four negative results with their power calculations.

新论文 · v1arXiv:2611.09806

分布式多臂老虎机的一种高效同步方案

An Efficient Synchronization Scheme for Distributed Bandits

Raymond Zhang, Henrique Miyamoto, Richard Combes, Sheng Yang

AI 速读 基于摘要

该论文将分布式多臂老虎机中两名玩家的同步问题建模为通信问题,用随机编码集合与最大似然解码分析同步错误指数,并提出达到相同错误指数的通用解码器,进而给出同步方案的遗憾上界。

cs.IT

查看原文摘要

We study the problem of synchronizing two players in a \emph{distributed multi-armed bandit} setting. The probability of \emph{synchronization error} is analyzed by recasting synchronization as a \emph{communication problem}. Using a well-designed random coding ensemble, we derive error exponents for the maximum-likelihood decoder. We then introduce a \emph{universal decoder} that achieves the same error exponents as the optimal decoder. Finally, applying these results to distributed multi-armed bandits, we show an upper bound on the regret of our synchronization scheme.

新论文 · v1arXiv:2611.09805

基于图神经网络的可扩展图相似性学习

Scaling Graph Similarity Learning with Graph Neural Networks

Ahmet Tüzen, Helge Langseth, Kjetil Nørvåg

AI 速读 基于摘要

提出 FiLSim 框架,探索简化 GNN 流程能否在标准基准上保持竞争力并扩展到大规模图,同时用序列图编辑策略构造带可靠 GED 标签的大规模数据集。

cs.LG · cs.AI

查看原文摘要

Graph similarity computation is an important task in graph mining with many real-world applications, such as chemical compound analysis, program dependence comparison, and social network analysis. The problem is computationally challenging: Graph Edit Distance (GED) and Maximum Common Subgraph (MCS), which quantify the distance between graphs and identify their largest shared subgraph, respectively, are NP-hard to compute exactly. To address these computational challenges, Graph Neural Networks (GNNs) have been applied to this problem. However, existing GNN-based approaches have primarily focused on small-scale graph datasets, while scalability to larger scales remains underexplored. In this work, we propose FiLSim, a scalable GNN-based framework, and investigate whether a simplified GNN pipeline can maintain competitive performance on standard benchmarks while scaling to large graphs. We additionally propose a sequential graph-editing strategy to construct large-scale graph datasets with reliable GED labels to evaluate scalability. The proposed framework is evaluated on four benchmark datasets and four newly created large-scale datasets, demonstrating its effectiveness and scalability. FiLSim remains accurate on graphs with more than 150{,}000 nodes, where the baseline methods run out of memory or fail to learn, and scores all test pairs within seconds on a single GPU.

新论文 · v1arXiv:2611.09802

当指令文件过时:编码智能体中的文档债务与隐性成本

When Instruction Files Go Stale: Documentation Debt and Hidden Cost in Coding Agents

Tural Mehtiyev, Biruk Tadesse, Lawrence Arkoh, Wesley Assunção

AI 速读 基于摘要

研究过时的仓库指令文件(如 AGENTS.md、CLAUDE.md)如何影响 LLM 编码智能体的行为与成本,以及智能体能否自行恢复。

cs.SE · cs.AI

查看原文摘要

LLM-based coding agents such as Claude Code are guided by repository instruction files (also called context files or agent configuration files) like AGENTS.md and CLAUDE.md, which are read in every agent session. As any documentation artifact, these files can fall behind the code and become stale (e.g., a test folder moves, but the file still points to the old one). In technical debt terms, such a stale instruction is documentation debt, and its interest is the cost it adds to every later agent session. Evaluations that check only task success can miss this cost, and the stale file can persist. In this study, we ask what leads agents to act on a stale instruction, how it affects their behavior and at what cost, and how they recover. We study three real-world stale instructions from active open-source repositories in depth, each a different kind of guidance: a test command, a code location, and a procedure for adding a component. Agents fix 22 maintenance tasks under three versions of each instruction (left stale, corrected to the current path, and removed), with the code and the task held fixed, and we analyze 732 trajectories of two models at the level of individual tool calls. We find that agents follow stale guidance when it is relevant to their tasks, sometimes even when correct information is available elsewhere. On the stale test command, Claude Sonnet 5.5 needed about two extra tool calls per run, a third more than with the corrected command; in the other cases, we could not detect a difference. Although agents generally recovered from the immediate failures, none repaired the underlying instruction file. Correcting the instructions eliminated operations on obsolete paths, while removing them prevented most. Our findings show that task success alone can hide the costs of documentation debt, highlighting the need to evaluate agent behavior beyond final outcomes.

新论文 · v1arXiv:2611.09803

Maya a1:是选项内容还是选项位置在影响模型?非自回归决策模型中的顺序敏感性

Maya a1: Do the Options Read the Model, or Does Their Position? Order Sensitivity in a Non-Autoregressive Decision Model

Mohammed Nayeem Khan, Logesh L

AI 速读 基于摘要

作者重新工程化 Laya 检查点并测试选项排列顺序对答案的影响,发现发布版模型存在明显的顺序敏感性,而带选项打乱的微调可显著降低翻转率。

cs.AI · cs.CL

查看原文摘要

Laya answers typed multiple-choice questions in one forward pass by scoring a hidden state at one [MASK] marker per option. We re-engineer the checkpoint (421M parameters; a 2-layer option head with no positional tensor; a documented but unused parallel layout) and test whether the answer depends on where an option is listed. Presenting 951 Qwen-verified questions under every cyclic rotation of their options (or six random permutations for 12 options), the released checkpoint changes its answer for 25.8% [22.9-28.7] of questions (19.7% on the 605 English-language items alone); accuracy with the gold option first versus last differs by 10.1 points, and the flips concentrate where the model's own confidence is low (54% versus 8% across confidence terciles). Fine-tuning with Laya's trainer on 2,818 teacher-verified rows with option shuffling cuts the flip rate to 7.2%; the identical rows without shuffling give 11.4%, so shuffling is responsible for 4.2 points of the improvement. A confidence-weighted vote over orderings gives 69.7% against 69.1% for a single base pass at 4.1x the compute. Labels are LLM-made and the test sets are teacher-filtered. We also fine-tune with the authors' parallel layout on the same rows: flip rate 0.5%.

新论文 · v1arXiv:2611.09799

函数均值估计中隐私与平滑的次序问题

On the Order of Privacy and Smoothing in Functional Mean Estimation

Haotian Chen, Yu-Wei Chen, Qifan Song, Jordan Awan

AI 速读 基于摘要

在函数均值估计中比较“先平滑后加隐私”与“先加隐私后平滑”两种流程的均方误差,并给出Banach空间下高斯扰动的GDP保证。

math.ST · cs.CR

查看原文摘要

Differential privacy (DP) is a leading framework for privacy protection, yet privacy mechanisms tailored to functional data analysis (FDA) remain relatively underexplored. For functional mean estimation, we investigate a fundamental question regarding the ordering of privatization and estimation by comparing two canonical pipelines: Fit-Then-Protect (FTP), which smooths trajectories before privatization, and Protect-Then-Fit (PTF), which privatizes observations at discrete time points before smoothing. When data are observed without error, we prove that FTP achieves strictly smaller mean squared error than PTF asymptotically (as the sample size increases) under the same $μ$-Gaussian differential privacy ($μ$-GDP) budget in both finite-dimensional Hilbert spaces and infinite-dimensional reproducing kernel Hilbert spaces (RKHS). Simulation studies support our theory and explore settings with observation error and fitting constraints, demonstrating that FTP outperforms PTF under small observation noise, whereas PTF can become preferable in high-noise settings. In addition to this comparison, we establish a novel GDP guarantee for Gaussian perturbations taking values in a Banach space, extending existing results beyond the RKHS setting.

新论文 · v1arXiv:2611.09798

并行智能体团队:测试时计算扩展的更优方式

Test-Time Compute Scales Better with Parallel Agent Teams

Junlin Wang, Haozhe Chen, Ang Li, Rahul Chalamala, Zhuang Liu

AI 速读 基于摘要

作者提出并行智能体团队方法,通过并行采样多个小型协作团队并保留最佳团队结果,在长程任务上更有效地扩展测试时计算。

cs.AI

查看原文摘要

Test-time scaling improves the performance of a fixed model by spending more computation at inference. There are two common ways to spend it on agents when a verifier can score every attempt. Best-of-N sampling runs many independent agents and keeps the best result but saturates quickly. One large team of collaborating agents can score higher but stops improving as it grows. Can we get the best of both? Our method, parallel agent teams, does so by sampling many small teams in parallel and keeping the best team's result. We test it on 12 long-horizon tasks from GPU kernels and formal proofs to exploit development. With a 27B model and a budget of 100 agents, parallel teams of ten beat parallel agents on 10 of 12 tasks and beat one team of 100 on all four tasks where we ran such large teams. At equal dollar cost the same parallel teams beat a frontier model on half the tasks. A simple statistical model shows that individual agents lose because their many samples have a low mean and that one large team loses because a single sample gets no gain from variance. Sampling many small teams in parallel balances a high mean with the gain from variance. Parallel agent teams thus offer a more effective way to scale test-time compute.

版本更新 · v3arXiv:2505.20726

ManiTaskGen:用于评测与提升视觉语言智能体具身决策能力的综合任务生成器

ManiTaskGen: A Comprehensive Task Generator for Benchmarking and Improving Vision-Language Agents on Embodied Decision-Making

Liu Dai, Haina Wang, Weikang Wan, Hao Su

AI 速读 基于摘要

提出一个能为任意场景自动生成全面、多样且可行的移动操作任务的系统,并用于构建基准和提升视觉语言智能体的具身决策能力。

cs.RO

查看原文摘要

Building embodied agents capable of accomplishing arbitrary tasks is a core objective towards achieving embodied artificial general intelligence (E-AGI). While recent work has advanced such general robot policies, their training and evaluation are often limited to tasks within specific scenes, involving restricted instructions and scenarios. Existing benchmarks also typically rely on manual annotation of limited tasks in a few scenes. We argue that exploring the full spectrum of feasible tasks within any given scene is crucial, as they provide both extensive benchmarks for evaluation and valuable resources for agent improvement. Towards this end, we introduce ManiTaskGen, a novel system that automatically generates comprehensive, diverse, feasible mobile manipulation tasks for any given scene. The generated tasks encompass both process-based, specific instructions (e.g., "move object from X to Y") and outcome-based, abstract instructions (e.g., "clear the table"). We apply ManiTaskGen to both simulated and real-world scenes, demonstrating the validity and diversity of the generated tasks. We then leverage these tasks to automatically construct benchmarks, evaluating high-level embodied decision-making through a grounded skill interface for agents built upon existing vision-language models (VLMs). Furthermore, we propose a simple yet effective method that utilizes ManiTaskGen tasks to enhance embodied decision-making. Overall, this work presents a cross-scene task generation framework facilitating both benchmarking and improvement of embodied decision-making agents. Our code is available at https://manitaskgen.github.io.

版本更新 · v5arXiv:2404.15158

On the Monotonicity of Information Measures

Xiaoyu Cheng, Yonggyun Kim

原文摘要

We study the monotonicity of information measures, functions that assign a value to each statistical experiment, with respect to the Blackwell and Lehmann orders. We show that such monotonicity can be characterized by local, first-order conditions. Under natural invariance properties, a measure is Blackwell monotone if and only if it decreases in the direction of signal replacements, and Lehmann monotone if and only if it decreases in the direction of reverse signal replacements, which replace signals with higher ones only in low states or with lower ones only in high states. We translate both conditions into the space of posterior beliefs and apply them to likelihood-separable and posterior-separable measures, showing in particular that the entropy cost is Lehmann monotone. Among posterior-separable measures, we further identify a Lehmann monotone subclass, posterior-mean-ratio measures, that characterizes the Lehmann order.

econ.TH · cs.IT

新论文 · v1arXiv:2611.09795

AR-Edit:无需反演的训练无关自回归视频编辑

AR-Edit: Training-Free Autoregressive Video Editing without Inversion

Hovhannes Margaryan, Quentin Bammey, Christian Sandor, Vicky Kalogeiton

AI 速读 基于摘要

作者提出 AR-Edit,利用 DMD 蒸馏自回归视频扩散模型中自注意力 value 的稳定性,缓存并注入源视频 value,实现无需训练、无需反演的实时流式视频编辑。

cs.CV

查看原文摘要

Editing a video stream in real time, without access to future frames, is essential for interactive applications. Existing training-free video editing methods, however, assume full offline access to the entire sequence, while streaming approaches either rely on additional training or are limited to specific editing techniques. We show that this limitation can be removed by analyzing the self-attention dynamics of DMD-distilled autoregressive (AR) video diffusion models. We uncover a key asymmetry: queries and keys remain stable and aligned with their source counterparts across denoising timesteps, while values diverge and encode the evolving content. Inherited from the non-distilled bidirectional teacher, this asymmetry is strongest at high noise, where few-step streaming models operate. The resulting mechanism is simple: a single forward pass suffices to capture source identity in the value features, which can be reused throughout generation. Starting from pure Gaussian noise and injecting only these source values reconstructs the input with fidelity matching or surpassing inversion-based methods, effectively eliminating inversion. Based on this insight, we introduce AR-Edit, a training-free, inversion-free method that caches source values once and selectively injects them during denoising. Across multiple AR backbones, AR-Edit enables real-time streaming editing with superior source preservation and tonal fidelity at minimal overhead.

版本更新 · v3arXiv:2610.20970

A wind memory for odour source search in reversing wind

Junlong Shen, Shunsuke Shigaki

原文摘要

After wind reversals, old odour arrives while the sensed wind points away from the source, so wind followers, which surge upwind, are misled. A hold gate stores the wind at first odour contact and feeds it to an unchanged follower while the live wind points over 90° away. On 60 random simulated reversing flows it raised a published moth model's success by 10.8 points (95% CI 6.6 to 15.4) and four other followers' by 6.0 to 10.1, but cost the moth model 5 points in steady wind. A fixed wind delay was not resolvably worse at insect scale, but in simulation rescaled to a legged robot's sensors and turn rate the gate beat the best delay for two followers, only one margin surviving Bonferroni correction. As the robot never ran the gate and a plain spiral searcher beat the gated moth model, it is an add-on, not a better searcher.

cs.RO

新论文 · v1arXiv:2611.09791

评估检索增强生成对算法问题求解的影响

Assessing the Impact of Retrieval-Augmented Generation on Algorithmic Problem-Solving

Gabriel Souza Baggio, Gabriel Machado Lunardi, Guilherme Medeiros Machado, Subhankar Maity, Faiza Belbachir, José Palazzo Moreira de Oliveira

AI 速读 基于摘要

作者提出一种面向竞赛编程问题的检索增强生成方法,并在 CodeContests 数据集上比较原始描述、随机示例与相似示例三种条件,报告基于相似性检索能提升大模型表现。

cs.AI · cs.HC

查看原文摘要

Competitive programming problems pose distinctive challenges for Large Language Models, as they demand not only proficient code generation but also advanced algorithmic reasoning. This study presents a Retrieval-Augmented Generation approach specifically designed to enhance the capacity of Large Language Models to address such problems. Our approach integrates an embedding-based retrieval mechanism and a similarity search algorithm to identify analogous problems within a knowledge database, employing a dynamically adjusted threshold to mitigate retrieval noise. We conducted an evaluation using the CodeContests dataset, focusing on the test split problems that exhibit similarity to instances from the training split. The experimental framework considered three conditions: (i) problems provided solely with their original descriptions, (ii) problems supplemented with randomly selected examples from the training split, and (iii) problems augmented with similar examples retrieved through the proposed method. In addition, we incorporated a Min-K membership inference analysis to examine whether the generated code solutions were influenced by potential memorization of training data within the evaluated Large Language Models. This complementary perspective enables a deeper understanding of model behavior by distinguishing genuine generalization through retrieval from implicit recall of pretraining samples. Performance was assessed using both pass rates and the CodeForces Elo rating of the problems. The results provide empirical evidence that similarity-based retrieval substantially enhances Large Language Models performance in competitive programming scenarios, offering an scalable framework for improving code generation in algorithmic problem-solving contexts.