跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 10:52 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-15 10:52最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

找到 23,348 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 10:50(北京时间)
新论文 · v1arXiv:2605.16191Google Research

Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search

Michael P. Brenner, Lizzie Dorfman, John C. Platt

原文摘要

We present a case study for how AI coding systems can be used to generate novel scientific hypotheses. We combine a generic coding agent (Google's AntiGravity) with an LLM-driven tree search algorithm (Empirical Research Assistance / ERA) to autonomously generate high-efficiency three-dimensional photovoltaic (3DPV) structures that overcome losses limiting flat solar panels at mid-latitudes. These structures operate by presenting favorable angles to the sun throughout the day, and for illustrative purposes we focus on optimizing performance for a single solar day. Our workflow begins by using AntiGravity to reproduce calculations \cite{bernardi2012solar} showing that 3DPV can have energy densities much higher than stationary flat PV panels. We use these initial designs as the starting point for large scale tree search, where we seek improved solutions and score them for their diurnal yield. The initial tree search leads to nominally more efficient solutions, yet they are caused by algorithmic reward hacking, arising from non-physical design features such as structurally levitating disconnected tiers and exploitations of the discretizations in the optics solver. To counteract this, we develop a workflow where the coding agent iteratively patches the physics engine with constraints to eliminate reward hacking. With reward-hacking eliminated, ERA discovers a series of designs with various constraints and improved performance, including optimal designs with different fixed collector areas, optimizing zenith tracking and avoiding self shadowing. Combining coding agents with tree search (ERA) provides a powerful platform for scientific discovery, for problems whose solutions can be empirically evaluated with a score function.

cs.CL · cond-mat.other · physics.comp-ph

新论文 · v1arXiv:2605.14718Google DeepMind

Adapting AlphaEvolve to Optimize Fully Homomorphic Encryption on TPUs

Shruthi Gorantala, Jianming Tong, Asra Ali, Baiyu Li, Jonathan Katz, Jeremy Kun, Thomas Steinke, Abhradeep Thakurta 等 10 位作者

原文摘要

The deployment of Fully Homomorphic Encryption (FHE) at scale is hindered due to its heavy computational overhead. While specialized hardware accelerators like Google Tensor Processing Units (TPUs) can help, mapping complex cryptographic kernels onto such architectures remains a challenge. Efficient execution requires co-optimization between the systolic array-based Matrix Multiplication Unit (MXU) and Vector Processing Units (VPUs), as well as the orchestration of data movement across the vector register files. Existing compiler stacks often abstract low-level hardware utilization, requiring developers to adopt a manual trial-and-error process that often results in fragmented execution and underutilized resources. To accelerate this development process, we use AlphaEvolve to automate the exploration of hardware-aware cryptographic-kernel optimizations. We frame optimization as an evolutionary search problem, utilizing the closed-loop system provided by AlphaEvolve, that leverages LLM-driven code generation. We use real-world feedback from hardware execution and rigorous correctness testing to guide the evolution process. We evaluate AlphaEvolve optimization on primitives for both the TFHE (Jaxite) and CKKS (CROSS) FHE schemes on Google Cloud TPUv5e, a contemporary TPU architecture. Within 24 hours of automated exploration, AlphaEvolve discovered implementation-level optimizations that improve TFHE bootstrap latency by 2.5x and CKKS rotation and multiplication latency by 1.31x and 1.18x, respectively, relative to human-engineered state of the art. These results demonstrate that AlphaEvolve can be used to enable researchers to navigate the optimization trade-offs between cryptography, compilers, and hardware accelerators.

cs.CR

新论文 · v1arXiv:2605.13225Apple ML Research

混合而非调参:数据受限场景下双语预训练优于超参数搜索

Mix, Don't Tune: Bilingual Pre-Training Outperforms Hyperparameter Search in Data-Constrained Settings

Paul Jeha, Anastasiia Sedova, Louis Béthune, Skyler Seto, Jes Frellsen, Pierre Ablin, Natalie Schluter

AI 速读 基于摘要

在数据受限的低资源语言预训练中,混入高资源语言数据比激进超参数调优更有效,且优势随模型规模增大。

cs.LG

查看原文摘要

For most languages of the world, language model pre-training operates in a data-constrained regime where models must repeat their training data many times, degrading generalization. Two remedies exist: aggressive hyperparameter tuning such as high weight decay, and mixing in data from a high-resource auxiliary language to directly aid the low-resource target. While hyperparameter tuning regularizes the model by shrinking weights to restrict network capacity, auxiliary data mixing uses a tunable mixing ratio to expand the training distribution and diversify the training signal with new knowledge. Both offer a principled way to improve training in a data-constrained domain. We compare these levers systematically across four model scales from 150M to 1.43B parameters, using Arabic as the low-resource target and English as the auxiliary, over approximately 1000 pre-training runs. Three findings emerge. First, mixing yields larger improvements than hyperparameter tuning on both validation loss and downstream task accuracy, and the gap grows with model size. Second, we quantify how much mixing helps: it boosts performance by an amount equivalent to 2--3$\times$ the unique target data on validation loss and 2--13$\times$ on downstream task accuracy, with the gain scaling steeply with model size. Third, this divergence reveals that target-language validation loss systematically underestimates mixing's value. Mixing regularizes by diversifying the training signal and contributes knowledge the repeated target corpus cannot supply; validation loss captures only the first effect. Our practical recommendations are: mix in a high-resource language, prioritize the mixing ratio over hyperparameter tuning, and transfer hyperparameters from a small proxy model via $μ$P.

首次观测 · 记录 #1软件学报:jos:7635软件学报

ToxiHeap: LLM制导和毒性标记的JavaScript引擎模糊测试框架

沙乐天, 龙章伯, 丁加宇, 黄海平, 肖甫

原文摘要

现有浏览器JavaScript引擎模糊测试工具在检测潜在漏洞方面仍存在局限, 尤其对不触发崩溃的堆内存错误识别能力不足. 为此, 提出ToxiHeap, 一种将内存毒性标记(toxic labeling)的运行时监测和大语言模型(large language model, LLM)制导语义生成, 设计为并行核心轨道的JavaScript引擎模糊测试框架. 检测轨在目标引擎的堆分配与访问路径上插桩, 通过影子内存与细粒度毒性标记统一刻画释放后使用(use-after-free, UAF)、double free、堆越界读写(out-of-bounds read/write,OOB-R/W)、内存泄漏(memory leak)和未初始化堆内存读(uninitialized memory read,UMR)等多类堆错误, 并将对已释放内存等非法状态的访问转化为可消费的异常信号, 弥补传统依赖崩溃信号方法对非崩溃漏洞缺乏有效检测信号的不足; 生成轨采用“蒸馏-激励”两阶段的LLM变异器, 从历史PoC中提炼语义特征并定向构造状态依赖的测试用例, 突破仅依赖语法或轻语义变异在深路径覆盖上的局限. 两条轨道以覆盖增益和非崩溃命中信号在反馈环路中汇合, 协同驱动样本保留、路径权重更新和知识库自增, 同时引入隔离重放验证机制, 在干净进程中二次确认异常, 显著降低非确定性误报. 实验结果表明, 在JavaScriptCore (JSC)引擎上, ToxiHeap在24 h运行下的分支覆盖率由31.17%提升至33.52%, 在V8、SpiderMonkey (SM)和ChakraCore (CH)等其他主流引擎上同样取得了最高或接近最高的分支覆盖率, 有效样本占比稳定在91%以上. 在覆盖UAF等多类缺陷模式的50条PoC参考集上, 4个引擎综合平均的整体检出率达到89.18%.

cs.* · cs.CL

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7644软件学报

GCC编译优化选项关系的分析应用

高秉玉, 姚梦雨, 王子铭, 李锭, 陈向群, 郭耀

原文摘要

编译优化选项作为编译器与开发者之间的核心交互接口, 其合理配置直接影响软件质量与开发效率. 然而, 编译选项的数量庞大且关系复杂, 优化效果同时受到程序特征和机器架构的动态影响, 官方文档难以满足实际应用场景的配置指导需求. 针对上述挑战, 结合静态和动态分析技术, 基于GCC编译器源码深入探讨影响编译器选项效果的两类关系: 内部约束关系和外部环境依赖关系. 首先基于静态分析识别出选项间68对内部约束关系(涉及84个选项)以及103对外部环境依赖关系(包括51个机器架构敏感选项与52个程序特征敏感选项), 并进一步基于动态分析技术验证选项在不同外部环境下的有效性. 然后, 将选项关系的分析结果应用于3个编译相关技术场景: 1)提高选项自动调优效率, 设计基于选项关系感知的遗传调优算法, 相较于不考虑选项关系的其他算法(如遗传算法), 性能平均提升3.65%; 2)提高编译器测试效率, 设计基于选项关系的测试序列生成方法, 生成效率相较于随机方法提升了51.7%; 3)为开发者提供更有效的选项配置方案, 帮助其合理使用选项以达到预期优化目标. 通过这3个应用, 表明编译选项关系在自动调优、编译器测试及实际配置中具有关键作用.

cs.*

软件学报 · 2026 · 正式发表

版本更新 · v3arXiv:2512.24601Berkeley BAIR

递归语言模型

Recursive Language Models

Alex L. Zhang, Tim Kraska, Omar Khattab

AI 速读 基于摘要

提出递归语言模型(RLM)推理范式,让 LLM 把超长提示当作外部环境,通过编程式检查、分解并递归调用自身来处理远超上下文窗口的输入。

cs.AI · cs.CL

查看原文摘要

We study allowing large language models (LLMs) to process arbitrarily long prompts through the lens of inference-time scaling. We propose Recursive Language Models (RLMs), a general inference paradigm that treats long prompts as part of an external environment and allows the LLM to programmatically examine, decompose, and recursively call itself over snippets of the prompt. We find that RLMs can successfully process inputs up to two orders of magnitude beyond model context windows and, even for shorter prompts, dramatically outperform the quality of vanilla frontier LLMs and common long-context and coding scaffolds (e.g., on GPT-5 by a median across the evaluated benchmarks of $26\%$ against compaction, $130\%$ against CodeAct with sub-calls, and $13\%$ against Claude Code) across four diverse long-context tasks while having comparable cost. At a small scale, we post-train the first model around the RLM. Our model, RLM-Qwen3-8B, outperforms the underlying Qwen3-8B model by $28.3\%$ on average and even approaches the quality of vanilla GPT-5 on three long-context tasks. Code is available at https://github.com/alexzhang13/rlm.

版本更新 · v3arXiv:2406.12708Google Research

AgentReview: Exploring Peer Review Dynamics with LLM Agents

Yiqiao Jin, Qinlin Zhao, Yiyang Wang, Hao Chen, Kaijie Zhu, Yijia Xiao, Jindong Wang

原文摘要

Peer review is fundamental to the integrity and advancement of scientific publication. Traditional methods of peer review analyses often rely on exploration and statistics of existing peer review data, which do not adequately address the multivariate nature of the process, account for the latent variables, and are further constrained by privacy concerns due to the sensitive nature of the data. We introduce AgentReview, the first large language model (LLM) based peer review simulation framework, which effectively disentangles the impacts of multiple latent factors and addresses the privacy issue. Our study reveals significant insights, including a notable 37.1% variation in paper decisions due to reviewers' biases, supported by sociological theories such as the social influence theory, altruism fatigue, and authority bias. We believe that this study could offer valuable insights to improve the design of peer review mechanisms. Our code is available at https://github.com/Ahren09/AgentReview.

cs.CL

版本更新 · v2arXiv:2605.04012Google Research

SymptomAI: Toward a Conversational AI Agent for Everyday Symptom Assessment

Joseph Breda, Fadi Yousif, Beszel Hawkins, Marinela Cotoi, Miao Liu, Ray Luo, Po-Hsuan Cameron Chen, Mike Schaekermann 等 33 位作者

原文摘要

Language models excel at diagnostic assessments on curated medical case-studies and vignettes, performing on par with, or better than, clinical professionals. However, existing studies focus on complex scenarios with rich context making it difficult to draw conclusions about how these systems perform for patients reporting symptoms in everyday life. We deployed SymptomAI, a set of conversational AI agents for end-to-end patient interviewing and differential diagnosis (DDx), via the Fitbit app in a study that randomized participants (N=13,917) to interact with five AI agents. This corpus captures diverse communication and a realistic distribution of illnesses from a real world population. A subset of 1,228 participants reported a clinician-provided diagnosis, and 517 of these were further evaluated by a panel of clinicians during over 250 hours of annotation. SymptomAI DDx were significantly more accurate (OR = 2.56, p < 0.001) than those from independent clinicians given the same dialogue in a blinded randomized comparison. Moreover, agentic strategies which conduct a dedicated symptom interview that elicit additional symptom information before providing a diagnosis, perform substantially better than baseline, user-guided conversations (p < 0.001). An auxiliary analysis on 1,509 conversations from a general US population panel validated that these results generalize beyond wearable device users. We used SymptomAI diagnoses as labels for all 13,917 participants to analyze over 500,000 days of wearable metrics across nearly 400 unique conditions. We identified strong associations between acute infections and physiological shifts (e.g., OR > 7 for influenza). While limited by self-reported ground truth, these results demonstrate the benefits of a dedicated and complete symptom interview compared to a user-guided symptom discussion, which is the default of most consumer LLMs.

cs.AI

版本更新 · v2arXiv:2605.04665Google Research

改写引发的输出模式崩溃:当大语言模型在语义等价输入下脱离角色

Paraphrase-Induced Output-Mode Collapse: When LLMs Break Character Under Semantically Equivalent Inputs

Aofan Liu, Jingxiang Meng

AI 速读 基于摘要

作者报告,语义等价但措辞不同的提示改写会让大语言模型放弃原本要求的封闭式输出格式,转而输出对话式散文,从而在精确匹配评测中被误判。

cs.CL

查看原文摘要

When the substantive content of a request is rewritten, do large language models still answer in the format the original task asked for? We find that they often do not, even at temperature zero. On a 150-query evaluation over five compact 2025-era LLMs and four task types, we observe a systematic failure mode we call prompt-variant output-mode collapse: when a closed-form prompt asks for a bare label or a single choice token, content-preserving prompt variants can push the model into conversational prose, the requested format dissolves, and exact-match evaluation pipelines silently misjudge the result. To make this measurable, we release PARACONSIST, a 900-prompt benchmark of 150 base queries with five lexical, syntactic, and semantic-expansion prompt variants each, and a Semantic Consistency Score that decomposes prompt-variant robustness into answer consistency, sentence-BERT semantic similarity, and length stability. Under a whole-word answer-set match, only ~22% of closed-form variant responses preserve the ground-truth label inside their output, while ~78% drift away from the answer space entirely. In our pool, the dominant predictor of collapse is task structure rather than model identity, with model differentiation jointly carried by answer consistency and length stability. Robustness audits should therefore track response-mode preservation as a first-class reliability target alongside answer accuracy.

版本更新 · v2arXiv:2512.15840Berkeley BAIR

Large Video Planner Enables Generalizable Robot Control

Boyuan Chen, Tianyuan Zhang, Haoran Geng, Caiyi Zhang, Peihao Li, Kiwhan Song, William T. Freeman, Jitendra Malik 等 12 位作者

原文摘要

General-purpose robots require decision-making models that generalize across diverse tasks and environments. Recent works build robot foundation models by extending multimodal large language models (MLLMs) with action outputs, creating vision-language-action (VLA) systems. These efforts are motivated by the intuition that MLLMs' large-scale language and image pretraining can be effectively transferred to the action output modality. In this work, we explore an alternative paradigm of using large-scale video pretraining as a primary modality for building robot foundation models. Unlike static images and language, videos capture spatio-temporal sequences of states and actions in the physical world that are naturally aligned with robotic behavior. We curate an internet-scale video dataset of human activities and task demonstrations, and train, for the first time at a foundation-model scale, an open video model for generative robotics planning. The model produces zero-shot video plans for novel scenes and tasks, which we post-process to extract executable robot actions. We evaluate task-level generalization through third-party selected tasks in the wild and real-robot experiments, demonstrating successful physical execution. Together, these results show robust instruction following, strong generalization, and real-world feasibility. We release both the model and dataset to support open, reproducible video-based robot learning. Our website is available at https://www.boyuan.space/large-video-planner/.

cs.RO · cs.CV

新论文 · v1arXiv:2605.07105Apple ML Research

Theoretical Limits of Language Model Alignment

Lucas Monteiro Paes, Natalie Mackraz, Barry-John Theobald, Federico Danieli

原文摘要

Language model (LM) alignment improves model outputs to reflect human preferences while preserving the capabilities of the base model. The most common alignment approaches are (i) reinforcement learning, which maximizes the expected reward under a KL-divergence constraint, and (ii) best-of-$N$ alignment, which selects the highest-reward output among $N$ independent samples. Despite their widespread use, the fundamental limits of reward improvement under a KL budget remain poorly understood. We characterize the information-theoretic limits of KL-regularized alignment by deriving the maximum achievable expected reward gain for a fixed KL-divergence budget. Our first result provides a closed-form expression for the optimal reward improvement, governed by a Jeffreys divergence term rather than the $\sqrt{\texttt{KL}}$ used in prior analyses. We further reformulate this expression as a covariance under the base model, yielding a practical estimator that predicts achievable alignment gains from base model samples alone. We extend our analysis to the proxy reward setting, showing that the gap between ideal and proxy alignment (reward hacking) grows with the magnitude of reward error and when the KL penalty factor decreases. We then prove that reward ensembling mitigates reward hacking, providing a theoretical justification for this technique used in practice. Empirically, we compute the KL-reward Pareto frontier for two tasks for LMs, safety and summarization, and show that best-of-$N$ closely approaches the theoretical limit, while PPO and GRPO remain substantially suboptimal. Our theoretical results shed light on several empirically observed phenomena in the alignment literature and suggest that algorithmic improvements are needed to achieve optimal alignment without high inference costs.

cs.LG · cs.CL · cs.CY · cs.IT

新论文 · v1arXiv:2605.06924Google Research

A²RD:面向长视频一致性的智能体自回归扩散方法

A$^2$RD: Agentic Autoregressive Diffusion for Long Video Consistency

Do Xuan Long, Yale Song, Min-Yen Kan, Tomas Pfister, Long T. Le

AI 速读 基于摘要

提出 A²RD,将长视频合成拆解为“检索—合成—精炼—更新”的闭环智能体自回归扩散流程,以缓解长时程语义漂移与叙事崩塌。

cs.CV · cs.AI

查看原文摘要

Synthesizing consistent and coherent long video remains a fundamental challenge. Existing methods suffer from semantic drift and narrative collapse over long horizons. We present A$^2$RD, an Agentic Auto-Regressive Diffusion architecture that decouples creative synthesis from consistency enforcement. A$^2$RD formulates long video synthesis as a closed-loop process that synthesizes and self-improves video segment-by-segment through a Retrieve--Synthesize--Refine--Update cycle. It comprises three core components: (i) Multimodal Video Memory that tracks video progression across modalities; (ii) Adaptive Segment Generation that switches among generation modes for natural progression and visual consistency; and (iii) Hierarchical Test-Time Self-Improvement that self-improves each segment at frame and video levels to prevent error propagation. We further introduce LVBench-C, a challenging benchmark with non-linear entity and environment transitions to stress-test long-horizon consistency. Across public and LVBench-C benchmarks spanning one- to ten-minute videos, A$^2$RD outperforms state-of-the-art baselines by up to 30% in consistency and 20% in narrative coherence. Human evaluations corroborate these gains while also highlighting notable improvements in motion and transition smoothness.

新论文 · v1arXiv:2605.00933Google Research

CGM-JEPA:通过预测式自监督预训练学习一致的连续血糖监测表征

CGM-JEPA: Learning Consistent Continuous Glucose Monitor Representations via Predictive Self-Supervised Pretraining

Hada Melino Muhammad, Zechen Li, Flora Salim, Ahmed A. Metwally

AI 速读 基于摘要

提出预测掩码潜在表征的自监督预训练框架 CGM-JEPA 及其跨视图扩展 X-CGM-JEPA,用于学习可跨模态迁移的连续血糖监测表征。

cs.LG · cs.AI

查看原文摘要

Continuous Glucose Monitoring (CGM) can detect early metabolic subphenotypes (insulin resistance, IR; $β$-cell dysfunction), but population-scale deployment faces two coupled problems. First, the same physiological state appears through multiple views (CGM time series, venous OGTT, Glucodensity summaries), so single-view representations fail to transfer when deployment shifts the modality or setting. Second, baselines perform inconsistently across these shifts. Both problems point to one remedy: representations that abstract away from any single view to capture higher-level temporal and distributional structure. We propose CGM-JEPA, a self-supervised pretraining framework which predicts masked latent representations rather than raw values, yielding abstraction that transfers across modalities. X-CGM-JEPA adds a masked Glucodensity cross-view objective for complementary distributional information. We pretrain on $\sim$389k unlabeled CGM readings from 228 subjects and evaluate on two clinical cohorts ($N=27$ and $N=17$ public-release subsets) across three regimes (cohort generalization, venous-to-CGM transfer, home CGM) under 20-iteration $\times$ 2-fold cross-validation. X-CGM-JEPA ranks first or second on AUROC for both endpoints across all three regimes while no baseline does, exceeding the strongest baseline by up to $+6.5$ pp in cohort generalization and $+3.6$ pp in venous-to-CGM transfer (paired Wilcoxon, $p<0.001$). Under modality shift, it matches mean AUROC while redistributing toward weaker subgroups (ethnicity AUROC gap shrinks 25-54%); on sparse in-domain venous data, the distributional view lifts label-aware clustering (ARI $+39\%$, NMI $+40\%$). Code and weights: https://github.com/cruiseresearchgroup/CGM-JEPA

首次观测 · 记录 #1软件学报:jos:7641软件学报

OpenSwap: 基于先锁后绑模式的跨链资产交换协议

卓凤, 段田田, 贾林鹏, 李忠诚, 孙毅

原文摘要

跨链资产交换是资产跨区块链流通的典型模式之一. 以哈希时间锁(hashed timelock contract, HTLC)协议为代表的现有跨链资产交换方案普遍采用“先绑定跟随方、跟随方再锁定资产”的先绑后锁模式. 在该模式下, 一旦已绑定的跟随方退出, 发起方将无法更换交换对象, 只能等待时间锁超时后回收资产并重新发起交换, 从而显著延长交换周期并带来高额的链上开销. 为此, 提出一种先锁后绑的跨链资产交换新模式, 即交换开始前不在合约中预设跟随方, 而是由符合条件的响应方先行锁定资产, 再将其绑定为跟随方. 该模式可避免绑定对象退出带来的多次重试与资产长期锁定问题. 在该模式下, 提出一种基于地址签名锁的跨链资产交换协议——OpenSwap. OpenSwap设计了一种地址签名锁, 通过将跟随方身份信息嵌入锁结构, 使其随着资产的锁定与解锁过程在两条链之间同步, 从而确保两条链对跟随方绑定的一致性. 此外, OpenSwap还通过挑战期、协助解锁等设计, 提升协议安全性和执行效率. 理论分析与实验结果表明, OpenSwap在保证原子性的同时, 显著降低了交换延迟, 并在低用户响应场景下降低了链上开销, 为跨链资产交换提供了更灵活与高效的解决方案.

cs.*

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7645软件学报

KubeEdge平台软件老化状态判定与抗衰策略生成

刘靖, 谭雪勇, 唐志伟, 牛超煜

原文摘要

边缘计算因其低延迟和高效的处理能力而被广泛应用于各个领域, 而KubeEdge平台系统作为边缘智能场景的核心基础软件, 其运行时可靠性至关重要. 然而, 边缘系统上的软件在长期运行后可能会出现软件老化问题, 导致系统响应延迟甚至服务中断, 进而影响用户体验乃至事故. 抗衰操作可以消除老化现象, 但目前针对边缘系统的老化研究相对较少, 且现有抗衰方法无法直接应用于边缘系统. 为解决上述问题, 针对KubeEdge边缘系统提出了一种称为GIP-MI的老化判定与抗衰综合方法, 该方法首先采用GCN-Informer方法对系统指标的空间关联和时序依赖进行建模, 相较于传统方法, 能够更精准、稳定地预测各指标的未来变化趋势; 进而将预测数据送入深度学习方法ParNet, 通过多时间点切片与多分辨率特征融合, 实现对系统资源动态老化状态的更精准判定; 最后, 提出一种基于分解和信息反馈模型的多目标进化算法(MOEA/D-IFM)的任务卸载方法作为抗衰策略, 有效避免系统停机, 保证服务连续性. 实验结果表明, GIP-MI在老化预测和状态识别精度上均优于基线方法, 并且与传统抗衰方法相比, 在停机时间等关键指标上均表现出显著优势, 能够有效恢复系统状态.

cs.*

软件学报 · 2026 · 正式发表

新论文 · v1arXiv:2604.24842Google Research

Co-Director:智能体式生成视频叙事

Co-Director: Agentic Generative Video Storytelling

Yale Song, Yiwen Song, Nick Losier, Nathan Hodson, Ye Jin, Rhyard Zhu, Yan Xu, Daniel Vlasic 等 16 位作者

AI 速读 基于摘要

提出分层多智能体框架 Co-Director,将视频叙事生成形式化为全局优化问题,以缓解链式生成中的语义漂移与级联失败。

cs.AI · cs.MA · cs.MM

查看原文摘要

While diffusion models generate high-fidelity video clips, transforming them into coherent storytelling engines remains challenging. Current agentic pipelines automate this via chained modules but suffer from semantic drift and cascading failures due to independent, handcrafted prompting. We present Co-Director, a hierarchical multi-agent framework formalizing video storytelling as a global optimization problem. To ensure semantic coherence, we introduce hierarchical parameterization: a multi-armed bandit globally identifies promising creative directions, while a local multimodal self-refinement loop mitigates identity drift and ensures sequence-level consistency. This balances the exploration of novel narrative strategies with the exploitation of effective creative configurations. For evaluation, we introduce GenAD-Bench, a 400-scenario dataset of fictional products for personalized advertising. Experiments demonstrate that Co-Director significantly outperforms state-of-the-art baselines, offering a principled approach that seamlessly generalizes to broader cinematic narratives. Project Page: https://co-director-agent.github.io/

新论文 · v1arXiv:2604.21428Google DeepMind

Decoupled DiLoCo for Resilient Distributed Pre-training

Arthur Douillard, Keith Rush, Yani Donchev, Zachary Charles, Nova Fallen, Ayush Dubey, Ionel Gog, Josef Dean 等 17 位作者

原文摘要

Modern large-scale language model pre-training relies heavily on the single program multiple data (SPMD) paradigm, which requires tight coupling across accelerators. Due to this coupling, transient slowdowns, hardware failures, and synchronization overhead stall the entire computation, wasting significant compute time at scale. While recent distributed methods like DiLoCo reduced communication bandwidth, they remained fundamentally synchronous and vulnerable to these system stalls. To address this, we introduce Decoupled DiLoCo, an evolution of the DiLoCo framework designed to break the lock-step synchronization barrier and go beyond SPMD to maximize training goodput. Decoupled DiLoCo partitions compute across multiple independent ``learners'' that execute local inner optimization steps. These learners asynchronously communicate parameter fragments to a central synchronizer, which circumvents failed or straggling learners by aggregating updates using a minimum quorum, an adaptive grace window, and dynamic token-weighted merging. Inspired by ``chaos engineering'', we achieve significantly improved training efficiency in failure-prone environments with millions of simulated chips with strictly zero global downtime, while maintaining competitive model performance across text and vision tasks, for both dense and mixture-of-expert architectures.

cs.CL

首次观测 · 记录 #1软件学报:jos:7621软件学报

基于异构依赖网络的开源AI资源可信性风险量化

姚思梦, 张洋, 赵佳林, 李俊辰, 沈阳, 王涛, 张迅晖

原文摘要

随着开源模型与数据集规模快速扩张, Hugging Face生态中资源之间形成了复杂的模型-数据集为主体的异构依赖网络, 元数据缺失、依赖集中度等问题使链式风险更易累积与传播. 为刻画这一风险基础, 基于Hugging Face快照构建了一个AI资源依赖网络, 并从全局拓扑与时间演化两个维度分析其结构和演化特征; 进一步提出融合属性完整性、社区反馈的“可信风险”指标, 对模型与数据集节点进行连续化风险量化与排序. 结果表明, 该依赖网络呈显著“尖峰+长尾”结构, 依赖高度集中于少数枢纽节点, 大量资源在关键数据流关系中处于孤立或半孤立状态; 同时, 模型规模爆炸式增长而数据集与贡献者扩张滞后, 导致生态对有限核心数据源的路径依赖持续增强, 形成结构性系统风险. 在节点层面, 可信风险指标对参数扰动保持稳健, 能够在多类风险来源下显著区分高/低风险节点并优于基线方法; 风险耦合分析与专家盲评进一步验证了高风险数据集与高风险模型在局部结构中的聚集与传播效应. 为开源AI生态的风险筛查与治理提供了可复现的量化依据.

cs.*

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7624软件学报

面向轻量级节点的数据跨域安全传输方案

芦静文, 宋雅晴, 张源, 何欣雨, 龚竞, 李洪伟

原文摘要

针对数据跨域传输中面临的用户隐私安全与传输数据安全问题, 以及跨域通信系统要求的用户便携性与节点轻量化等实用性问题, 分析现有方案, 提出强对抗环境下面向轻量级节点的数据跨域安全传输方案, 实现: 1)去中心化公钥与身份认证; 2)用户便携式系统访问; 3)通信节点可信密钥协商; 4)抗密钥泄露的数据跨域传输. 形式化证明所提方案的安全性, 并进行原型系统实现与性能评估, 实验结果表明系统计算开销与通信开销是高效的.

cs.*

软件学报 · 2026 · 正式发表

首次观测 · 记录 #1软件学报:jos:7626软件学报

面向共享账户序列推荐的提示增强图注意力网络

赵中英, 王莹, 张劲羽, 周慧, 李超, 曾庆田

原文摘要

共享账户是指多个用户通常共享同一电子账户(智能家居系统往往以一个家庭为一个账户), 因此, 同一账户下的行为序列往往包含多个用户的交互记录. 面向共享账户场景的序列推荐成为近年来的研究热点, 但仍然面临以下挑战: (1) 现有方法难以有效解耦同一账户下的不同潜在用户偏好, 导致用户表示学习出现偏差. (2) 现有方法通常采用固定的超参数来模拟共享账户中的潜在用户数量, 难以自适应地确定潜在用户数量, 易导致欠拟合或噪声干扰问题. 为了解决上述挑战, 提出一种面向共享账户序列推荐的提示增强图注意力网络(PE-GAT). 具体而言, 该方法首先通过设计动态加权密度聚类算法来确定账户中的潜在用户数量, 构建用户级序列图, 以显式区分不同潜在用户的交互行为. 在此基础上, 提出基于图注意力网络的预训练模型, 通过解耦混合序列中的用户偏好来学习初始序列表示. 随后, 受预训练-提示调优范式启发, 设计了基于注意力机制的提示增强模块, 通过提示模板优化序列表示并指导模型再训练. 最终, PE-GAT通过融合账户级表示与提示增强后的序列表示, 以生成个性化的推荐结果. 在HVIDEO-E和HVIDEO-V两个真实共享账户数据集上的实验表明, PE-GAT优于14种基线方法, 在MRR和Recall指标上分别最高提升4.73%和5.59%.

cs.*

软件学报 · 2026 · 正式发表

版本更新 · v5arXiv:2603.09172Google DeepMind

Reinforced Generation of Combinatorial Structures: Ramsey Numbers

Ansh Nagda, Prabhakar Raghavan, Abhradeep Thakurta

原文摘要

We present improved lower bounds for nine classical Ramsey numbers: $\mathbf{R}(3, 13)$ is increased from $60$ to $61$, $\mathbf{R}(3, 18)$ from $99$ to $100$, $\mathbf{R}(4, 13)$ from $138$ to $139$, $\mathbf{R}(4, 14)$ from $147$ to $148$, $\mathbf{R}(4, 15)$ from $158$ to $159$, $\mathbf{R}(4, 16)$ from $170$ to $174$, $\mathbf{R}(4, 18)$ from $205$ to $209$, $\mathbf{R}(4, 19)$ from $213$ to $219$, and $\mathbf{R}(4, 20)$ from $234$ to $237$. These results were achieved using AlphaEvolve, an LLM-based code mutation agent. Beyond these new results, we successfully recovered lower bounds for all Ramsey numbers known to be exact, and matched the best known lower bounds across many other cases. These include bounds for which previous work does not detail the algorithms used. Virtually all known Ramsey lower bounds are derived computationally, with bespoke search algorithms each delivering a handful of results. AlphaEvolve is a single meta-algorithm yielding search algorithms for all of our results.

math.CO · cs.AI · cs.CC

新论文 · v1arXiv:2604.19292Google Research

Location Not Found: Exposing Implicit Local and Global Biases in Multilingual LLMs

Guy Mor-Lan, Omer Goldman, Matan Eyal, Adi Mayrav Gilady, Sivan Eiger, Idan Szpektor, Avinatan Hassidim, Yossi Matias 等 9 位作者

原文摘要

Multilingual large language models (LLMs) have minimized the fluency gap between languages. This advancement, however, exposes models to the risk of biased behavior, as knowledge and norms may propagate across languages. In this work, we aim to quantify models' inter- and intra-lingual biases, via their ability to answer locale-ambiguous questions. To this end, we present LocQA, a test set containing 2,156 questions in 12 languages, referring to various locale-dependent facts such as laws, dates, and measurements. The questions do not contain indications of the locales they relate to, other than the querying language itself. LLMs' responses to LocQA locale-ambiguous questions thus reveal models' implicit priors. We used LocQA to evaluate 32 models, and detected two types of structural biases. Inter-lingually, we show a global bias towards answers relevant to the US-locale, even when models are asked in languages other than English. Moreover, we discovered that this global bias is exacerbated in models that underwent instruction tuning, compared to their base counterparts. Intra-lingually, we show that when multiple locales are relevant for the same language, models act as demographic probability engines, prioritizing locales with larger populations. Taken together, insights from LocQA may help in shaping LLMs' desired local behavior, and in quantifying the impact of various training phases on different kinds of biases.

cs.CL · cs.AI

版本更新 · v2arXiv:2603.28846Google Research

Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations

Ryan Babbush, Adam Zalcman, Craig Gidney, Michael Broughton, Tanuj Khattar, Hartmut Neven, Thiago Bergamaschi, Justin Drake 等 9 位作者

原文摘要

This whitepaper seeks to elucidate implications that the capabilities of developing quantum architectures have on blockchain vulnerabilities and mitigation strategies. First, we provide new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem, the core of modern blockchain cryptography. We demonstrate that Shor's algorithm for this problem can execute with either <1200 logical qubits and <90 million Toffoli gates or <1450 logical qubits and <70 million Toffoli gates. In the interest of responsible disclosure, we use a zero-knowledge proof to validate these results without disclosing attack vectors. On superconducting architectures with 1e-3 physical error rates and planar connectivity, those circuits can execute in minutes using fewer than half a million physical qubits. We introduce a critical distinction between fast-clock (such as superconducting and photonic) and slow-clock (such as neutral atom and ion trap) architectures. Our analysis reveals that the first fast-clock CRQCs would enable on-spend attacks on public mempool transactions of some cryptocurrencies. We survey major cryptocurrency vulnerabilities through this lens, identifying systemic risks associated with advanced features in some blockchains such as smart contracts, Proof-of-Stake consensus, and Data Availability Sampling, as well as the enduring concern of abandoned assets. We argue that technical solutions would benefit from accompanying public policy and discuss various frameworks of digital salvage to regulate the recovery or destruction of dormant assets while preventing adversarial seizure. We also discuss implications for other digital assets and tokenization as well as challenges and successful examples of the ongoing transition to Post-Quantum Cryptography (PQC). Finally, we urge all vulnerable cryptocurrency communities to join the ongoing migration to PQC without delay.

quant-ph · cs.CR

新论文 · v1arXiv:2604.13452Google Research

CANVAS:通过视觉智能体分镜实现连续性感知叙事

CANVAS: Continuity-Aware Narratives via Visual Agentic Storyboarding

Ishani Mondal, Yiwen Song, Mihir Parmar, Palash Goyal, Jordan Boyd-Graber, Tomas Pfister, Yale Song

AI 速读 基于摘要

CANVAS 是一个多智能体框架,通过显式规划角色、背景与场景转换的连续性,来生成多镜头长篇视觉故事分镜。

cs.CL

查看原文摘要

Long-form visual storytelling requires maintaining continuity across shots, including consistent characters, stable environments, and smooth scene transitions. While existing generative models can produce strong individual frames, they fail to preserve such continuity, leading to appearance changes, inconsistent backgrounds, and abrupt scene shifts. We introduce CANVAS (Continuity-Aware Narratives via Visual Agentic Storyboarding), a multi-agent framework that explicitly plans visual continuity in multi-shot narratives. CANVAS enforces coherence through character continuity, persistent background anchors, and location-aware scene planning for smooth transitions within the same setting We evaluate CANVAS on two storyboard generation benchmarks ST-BENCH and ViStoryBench and introduce a new challenging benchmark HardContinuityBench for long-range narrative consistency. CANVAS consistently outperforms the best-performing baseline, improving background continuity by 21.6%, character consistency by 9.6% and props consistency by 7.6%.

版本更新 · v4arXiv:2603.25326Google DeepMind

Evaluating Language Models for Harmful Manipulation

Canfer Akbulut, Rasmi Elasmar, Abhishek Roy, Anthony Payne, Priyanka Suresh, Lujain Ibrahim, Seliem El-Sayed, Charvi Rastogi 等 12 位作者

原文摘要

Interest in the concept of AI-driven harmful manipulation is growing, yet current approaches to evaluating it are limited. This paper introduces a framework for evaluating harmful AI manipulation via context-specific human-AI interaction studies. We illustrate the utility of this framework by assessing an AI model with 10,101 participants spanning interactions in three AI use domains (public policy, finance, and health) and three locales (US, UK, and India). Overall, we find that that the tested model can produce manipulative behaviours when prompted to do so and, in experimental settings, is able to induce belief and behaviour changes in study participants. We further find that context matters: AI manipulation differs between domains, suggesting that it needs to be evaluated in the high-stakes context(s) in which an AI system is likely to be used. We also identify significant differences across our tested geographies, suggesting that AI manipulation results from one geographic region may not generalise to others. Finally, we find that the frequency of manipulative behaviours (propensity) of an AI model is not consistently predictive of the likelihood of manipulative success (efficacy), underscoring the importance of studying these dimensions separately. To facilitate adoption of our evaluation framework, we detail our testing protocols and make relevant materials publicly available. We conclude by discussing open challenges in evaluating harmful manipulation by AI models.

cs.AI · cs.CY

新论文 · v1arXiv:2604.09852Berkeley BAIR

MEMENTO:教会大语言模型管理自身上下文

MEMENTO: Teaching LLMs to Manage Their Own Context

Vasilis Kontonis, Yuchen Zeng, Shivam Garg, Lingjiao Chen, Hao Tang, Ziyan Wang, Ahmed Awadallah, Eric Horvitz 等 10 位作者

AI 速读 基于摘要

通过将推理过程分块并压缩为稠密摘要(memento),让模型仅依赖摘要向前推理,从而降低上下文、KV 缓存与计算开销。

cs.AI · cs.LG

查看原文摘要

Reasoning models think in long, unstructured streams with no mechanism for compressing or organizing their own intermediate state. We introduce MEMENTO: a method that teaches models to segment reasoning into blocks, compress each block into a memento, i.e., a dense state summary, and reason forward by attending only to mementos, reducing context, KV cache, and compute. To train MEMENTO models, we release OpenMementos, a public dataset of 228K reasoning traces derived from OpenThoughts-v3, segmented and annotated with intermediate summaries. We show that a two-stage SFT recipe on OpenMementos is effective across different model families (Qwen3, Phi-4, Olmo 3) and scales (8B--32B parameters). Trained models maintain strong accuracy on math, science, and coding benchmarks while achieving ${\sim}2.5\times$ peak KV cache reduction. We extend vLLM to support our inference method, achieving ${\sim}1.75\times$ throughput improvement while also enabling us to perform RL and further improve accuracy. Finally, we identify a dual information stream: information from each reasoning block is carried both by the memento text and by the corresponding KV states, which retain implicit information from the original block. Removing this channel drops accuracy by 15\,pp on AIME24.

首次观测 · 记录 #1软件学报:jos:7614软件学报

TLS 1.3协议安全研究综述

柏军洋, 张宇, 张宾, 张伟哲

原文摘要

TLS协议在保障网络通信的隐私性、完整性和可靠性方面发挥着至关重要的作用. 近年来, 工业界和学术界积极推动TLS协议相关研究和发展, 尤其在TLS 1.3中取得了巨大进展. 然而, 随着网络环境的日益复杂化和攻击手段的不断进步, TLS 1.3的安全性也面临着严峻挑战, 如重放攻击、前向安全风险, 以及OpenSSL软件实现漏洞. 这些攻击和漏洞不仅严重威胁用户隐私与企业数据安全, 也对互联网的信任体系乃至整个社会的数字经济产生深远影响. 首先对TLS 1.3协议发展历程和原理进行详细介绍. 其次, 对TLS 1.3协议相关安全研究进行分类梳理和对比分析, 从协议机制、软件实现和应用配置这3个方面系统分析和归纳. 最后, 总结TLS 1.3协议安全研究现状和瓶颈挑战, 为未来的研究方向提供建议.

cs.*

软件学报 · 2026 · 正式发表

版本更新 · v3arXiv:2512.08296Google Research

Towards a Science of Scaling Agent Systems

Yubin Kim, Ken Gu, Chanwoo Park, Chunjong Park, Samuel Schmidgall, A. Ali Heydari, Yao Yan, Zhihan Zhang 等 20 位作者

原文摘要

Agents, language model-based systems capable of reasoning, planning, and acting are widely adopted in real-world tasks, yet how their performance changes as these systems scale across key dimensions remains underexplored. We introduce quantitative scaling principles for agent systems as a predictive model, capturing how performance varies with coordination, model capability, and measurable system and task factors. Across 260 configurations spanning six agentic benchmarks, five canonical architectures (Single-Agent and four Multi-Agent: Independent, Centralized, Decentralized, Hybrid), and three LLM families, we perform controlled evaluations, standardizing tools, prompts, and compute to isolate architectural effects. The resulting model achieves a cross-validated R^2=0.373 across all six benchmarks (R^2=0.413 with a task-grounded capability metric). We identify a robust capability-saturation effect and additional patterns: (1) a coordination yields diminishing returns once single-agent baselines exceed certain performance; (2) tool-heavy tasks appear to incur multi-agent overhead; and (3) architectures without centralized verification tend to propagate errors more than those with centralized coordination. Relative performance change compared to single-agent baseline ranges from +80.8% on decomposable financial reasoning to -70.0% on sequential planning, demonstrating that architecture-task alignment determines collaborative success. The framework identifies the best-performing architecture for 87% of held-out configurations and shows consistent relative architecture preferences on unseen frontier models. Agent effectiveness depends on alignment between coordination and task structure, and that mismatched coordination degrades the performance.

cs.AI

版本更新 · v4arXiv:2507.05201Google Research

MedGemma Technical Report

Andrew Sellergren, Sahar Kazemzadeh, Tiam Jaroensri, Atilla Kiraly, Madeleine Traverse, Timo Kohlberger, Shawn Xu, Fayaz Jamil 等 81 位作者

原文摘要

Artificial intelligence (AI) has significant potential in healthcare applications, but its training and deployment faces challenges due to healthcare's diverse data, complex tasks, and the need to preserve privacy. Foundation models that perform well on medical tasks and require less task-specific tuning data are critical to accelerate the development of healthcare AI applications. We introduce MedGemma, a collection of medical vision-language foundation models based on Gemma 3 4B and 27B. MedGemma demonstrates advanced medical understanding and reasoning on images and text, significantly exceeding the performance of similar-sized generative models and approaching the performance of task-specific models, while maintaining the general capabilities of the Gemma 3 base models. For out-of-distribution tasks, MedGemma achieves 2.6-10% improvement on medical multimodal question answering, 15.5-18.1% improvement on chest X-ray finding classification, and 10.8% improvement on agentic evaluations compared to the base models. Fine-tuning MedGemma further improves performance in subdomains, reducing errors in electronic health record information retrieval by 50% and reaching comparable performance to existing specialized state-of-the-art methods for pneumothorax classification and histopathology patch classification. We additionally introduce MedSigLIP, a medically-tuned vision encoder derived from SigLIP. MedSigLIP powers the visual understanding capabilities of MedGemma and as an encoder achieves comparable or better performance than specialized medical image encoders. Taken together, the MedGemma collection provides a strong foundation of medical image and text capabilities, with potential to significantly accelerate medical research and development of downstream applications. The MedGemma collection, including tutorials and model weights, can be found at https://goo.gle/medgemma.

cs.AI · cs.CL · cs.CV

版本更新 · v6arXiv:2411.07207Google Research

通用地理空间推理的人口动态基础模型

General Geospatial Inference with a Population Dynamics Foundation Model

Mohit Agarwal, Mimi Sun, Chaitanya Kamath, Arbaaz Muslim, Prithul Sarker, Joydeep Paul, Hector Yee, Marcin Sieniek 等 34 位作者

AI 速读 基于摘要

提出人口动态基础模型(PDFM),通过图神经网络融合多源地理数据生成嵌入,在27个地理空间任务上取得领先表现。

cs.LG · cs.CY

查看原文摘要

Supporting the health and well-being of dynamic populations around the world requires governmental agencies, organizations and researchers to understand and reason over complex relationships between human behavior and local contexts in order to identify high-risk groups and strategically allocate limited resources. Traditional approaches to these classes of problems often entail developing manually curated, task-specific features and models to represent human behavior and the natural and built environment, which can be challenging to adapt to new, or even, related tasks. To address this, we introduce a Population Dynamics Foundation Model (PDFM) that aims to capture the relationships between diverse data modalities and is applicable to a broad range of geospatial tasks. We first construct a geo-indexed dataset for postal codes and counties across the United States, capturing rich aggregated information on human behavior from maps, busyness, and aggregated search trends, and environmental factors such as weather and air quality. We then model this data and the complex relationships between locations using a graph neural network, producing embeddings that can be adapted to a wide range of downstream tasks using relatively simple models. We evaluate the effectiveness of our approach by benchmarking it on 27 downstream tasks spanning three distinct domains: health indicators, socioeconomic factors, and environmental measurements. The approach achieves state-of-the-art performance on all 27 geospatial interpolation tasks, and on 25 out of the 27 extrapolation and super-resolution tasks. We combined the PDFM with a state-of-the-art forecasting foundation model, TimesFM, to predict unemployment and poverty, achieving performance that surpasses fully supervised forecasting. The full set of embeddings and sample code are publicly available for researchers.