←搜索结果

按匹配度 · 共 306 条结果 清除搜索

星期二

  1. Together AI Blog精选

    ParallelKernelBench:前沿 LLM 尚无法编写快速多 GPU 内核

    Together AI 推出含 87 道真实代码问题的 ParallelKernelBench,测试前沿 LLM 能否用经 NVLink 直接传输数据的 CUDA 内核替代 PyTorch + NCCL。最佳模型零样本仅正确解决 28 题,其中 22 个方案更快;采样三次时 fast 1@3 最高仍为 31%。智能体反馈将 Gemini 3 Pro 的正确数从 24 提升至 35,但约 20 轮后停滞,主要难点仍是 rank 协调、通信顺序和传输机制选择。

    ready accepts Triton and ParallelKittens solutions, and emerging interfaces like NCCL GIN and NVSHMEM are worth studying as targets. Expanding support to these paradigms will encourage further research into how AI agents navigate diverse programming models and hardware abstractions. The broader goal is a concrete target for the harder problem behind all of this: LLM systems that can autonomously optimize and manage large-scale distributed infrastructure. For infrastructure custom-built for langu

    匹配字段正文

星期四

  1. Google DeepMind

    Google DeepMind 发布 AI Control Roadmap,用纵深防御保障内部 AI 智能体安全

    Google DeepMind 发布 AI Control Roadmap,一套用于构建和管理 Google 内部部署的高级 AI 的框架,在模型对齐之外增加系统级安全层,即便对齐不完美也能提供保障。该框架把不受信任的 AI 智能体视为潜在内部威胁,基于 MITRE ATT&CK 拆解攻击战术与技术,并按模型能力划分检测等级 D1-D4 与预防响应等级 R1-R3。团队已分析一百万个编码智能体任务,并据此为 Gemini Spark 智能体搭建实时监控,数据显示多数被标记事件并非恶意意图,而是智能体误解或过度追求用户目标。

    a plan to deploy AI control mitigations to address these risks. Finally, to ensure our systems are functional, we constantly measure performance across three critical metrics: coverage (the fraction of traffic monitored), recall (the fraction of misaligned behaviors caught), and time-to-response. As AI models continue to advance, our defenses must also strengthen in tandem. In our AI Control Roadmap, we map security protocols to measurable milestones in AI capabilities on two critical fronts: Th

    匹配字段正文

星期四

  1. Redwood Research:Blog

    Redwood Research 测量前沿模型无 CoT 任务完成时长:约每年翻倍

    Redwood Research 发布新论文,测量 14 个前沿模型在 43 个基准上不输出任何 CoT 时的任务完成能力,发现无 CoT 时间跨度约每 373 天翻倍,token 跨度约每 437 天翻倍。GPT-5.5 的 50% 无 CoT 时间跨度为约 3 分钟,对应约 1500 个 o3-mini 推理 token。作者建议 AI 公司开始显式追踪无 CoT 时间跨度,以估计模型在不被 CoT 监控发现的情况下能进行多少推理。

    ing reasoning tokens before its answer by using benchmark-specific prompts and structured-output constraints. We estimate question difficulty in two ways: Human solve time: the average time for a human to solve the question with a calculator, paper, and pencil, but no LLM access. For some benchmarks we have human solve time data. For others, we ran small-scale human trials. For the remainder, we used Claude Opus 4.7 estimates, informed via in-context human time examples; Reasoning token anchor:

    匹配字段正文

星期二

  1. Cognition 模型 / Devin 博客

    Cognition 发布 FrontierCode 基准,衡量模型代码可合并性

    Cognition 发布 FrontierCode 基准,用可合并性衡量模型能否写出符合生产代码库标准的高质量代码,任务由 20 多位开源维护者基于 36 个旗舰仓库构建,每个任务投入超过 40 小时。基准分 Extended、Main、Diamond 三个难度子集,Diamond 上表现最好的 Claude Opus 4.8 得分仅 13.4%,GPT-5.5 为 6.3%,Gemini 3.1 Pro 为 4.7%,开源模型中最好的 Kimi K2.6 仅 3.8%。Cognition 称其误分类错误比 SWE-Bench Pro 低 81%,目前不计划公开任务以避免污染,但向所有模型方开放评测。

    eighted aggregate of the rubric items. Solutions that do not pass blocking criteria receive 0 Each model is run 5 times at every available reasoning effort. For each effort, we average the metric across the 5 trials, then report each model’s score at its best performing reasoning level. FrontierCode Diamond remains unsaturated: the best performing model, Claude Opus 4.8, achieves a score of only 13.4%. Other models score significantly lower: GPT-5.5 receives 6.3%, Gemini 3.1 Pro 4.7%, and others

    匹配字段正文

  2. Amazon Science

    亚马逊提出 Simple Strands Agent,用 harness 设计缩小智能体意图与执行差距

    亚马逊研究人员提出 Simple Strands Agent(SSA),一种可定制的单智能体 harness,用于缩小模型意图与 harness 执行之间的意图-执行差距,并在多个模型和基准上取得稳定性能提升。论文将这一瓶颈形式化为双向的意图-执行差距,指出工具接口、diff 文件反馈以及内部推理与外部交互的平衡是关键设计原则,并强调不同模型家族在工具使用偏好上存在差异,需要模型与 harness 协同设计。SSA 的智能体逻辑、工具、提示词和模型配置均已开源。

    implementation detail, but it sharply improves faithfulness between intended and executed edits. A second failure mode appears when the model proposes only partial lines or short fragments for replacement. Partial-text matching is attractive because it is flexible, but it is also brittle: the same fragment may appear inside comments, string literals, neighboring expressions, or unrelated code paths. Even when the fragment is unique, replacing text that does not constitute a full logical unit — a

    匹配字段正文

星期五

  1. Google Research精选

    Google 研究用手机前摄被动监测心率与静息心率

    Google Research 在 Nature 发表研究系统 PHRM,利用手机前摄在面部解锁后的数秒内拍摄面部视频,通过深度学习在后台估算心率与静息心率。在自由生活研究中,PHRM 心率整体 MAPE 为 6.09%,静息心率相对 Fitbit Charge 6 的 MAE 为 4.39 bpm,是唯一在所有肤色组均达到 MAPE < 10% 的 rPPG 方法。团队同时公开了迄今规模最大、最多样的智能手机视频数据集和预训练 PHRM-mini 模型,符合 IRB 与数据保护要求的研究者可申请访问。

    rPPG-1

    Use in Everyday Life ”, published in Nature , we introduce a research system (PHRM) that enables tracking of HR and RHR in the background during everyday smartphone use. PHRM leverages the front-facing camera to capture video of the user’s face in the seconds after face unlock events. It then applies deep learning to estimate HR with a mean absolute percentage error (MAPE) < 10% compared to electrocardiogram -derived ground truth, meeting industry accuracy standards for people of all skin tones

    匹配字段正文

星期三

  1. Trail of Bits Blog

    Trail of Bits 实测:ClawHub、skills.sh 与 Cisco 的技能扫描器均可被绕过

    Trail of Bits 测试了 ClawHub、Cisco 的 agent skill scanner 以及 skills.sh 集成的三款扫描器,用四个恶意技能全部绕过,其中三个在一小时内完成。攻击手法包括在文件中前置 10 万个换行符让扫描器截断漏检、在 .pyc 字节码中植入窃取环境变量的代码,以及用企业网络配置话术包装恶意 npm registry 的提示词注入。作者认为技能扫描存在结构性缺陷,建议改用经过策展的技能市场并像对待不可信代码一样对待公共技能仓库。

    “Figure 1: OpenClaw scanner misses malicious content”

    ives an adversary unlimited bites at the apple to tweak an attack until it finds a way through. Software supply chains have long been the soft underbelly of computer security. As fragile infrastructure susceptible to both insider threats and external attackers, these supply chains were vulnerable enough when malicious code was the sole vector of compromise. But the rise in agentic systems has spawned a new style of dependency—the skill—and with it a whole new ecosystem of marketplaces and distri

    匹配字段正文

星期四

  1. LMSYS Blog

    AMD Instinct MI355X 借助 SGLang 与 MoRI 实现成本可竞争的分布式推理

    SGLang 与 AMD 团队合作,在 AMD Instinct MI355X 上通过 SGLang 与 MoRI 通信库优化 DeepSeek-R1 分离式推理,在 129 tok/s/user 交互性下达到每百万 token 0.169 美元,比 B200 TRT-LLM 低 5%、比 B200 SGLang 低 40%,每 GPU 吞吐 2,436 tok/s(24 GPU),比 B200 SGLang 高 1.25 倍。优化包括 MoRI 量化 all-to-all(往返带宽最多降低 2.56 倍)、MoRI-IO KV cache 后端(吞吐比 Mooncake 高约 10%)、SDMA 双批次重叠、ROCm 上的 Specv2 MTP 以及 CPU 流式优化。结果已开源并通过 SemiAnalysis 的 InferenceX 持续验证。

    Expert Parallelism; Hybrid FP4/FP8 quantized all-to-all; Adaptive kernel selection; MoRI-IO KV Cache Backend; Inline transfer for high-concurrency KV migration; Broader model coverage; Two-Batch Overlap (TBO) with SDMA; FlyDSL FusedMoE for High-Performance MoE Compute; Specv2 MTP on ROCm; CPU Streaming Optimization; Looking Ahead; Summary; Acknowledgements; References; Endnotes The SGLang and AMD team has worked closely to unlock competitive Total Cost of Ownership (TCO) for large-scale DeepSee

    匹配字段正文

星期二

  1. MiniMax Blog

    MiniMax 复盘 M2 无法输出“马嘉祺”:稀疏 token 遗忘的内部调查

    MiniMax 发布内部调查,解释 M2 系列模型无法生成“嘉祺”等低频 token 的原因:这些 token 在预训练中已获得正常语义表示,但后训练数据覆盖不足导致输出侧 lm_head 表示漂移,生成概率被 top-p 采样过滤。团队通过全词表覆盖合成数据修复,日→俄混语率从 47%/5% 降至 1%,高退化 token 定向测试通过率从 4/16 提升到 13/16,并发现该机制与日语混语问题同源。

    Community discussion about MiniMax LLM sparse token forgetting on social media

    g" but whose root cause had never been clearly identified. Combined with this analysis, we discovered that the two problems may share the same mechanism: severely insufficient coverage of Japanese tokens in post-training data caused their lm head representations to drift during SFT, becoming confused with tokens from other languages in the vector space. This could both cause Japanese tokens to be erroneously activated when they shouldn't (language mixing) and push out spatially adjacent low-freq

    匹配字段正文

星期一

  1. Epoch AI:Gradient Updates

    Epoch AI:算力紧张是否即将到来

    Epoch AI 建模全球 Nvidia GB200 与 GB300 芯片的推理吞吐,估算在服务 Kimi K2.6 类模型时,全球每秒可产出 5 亿至 200 亿个输出 token,具体取决于请求上下文长度。研究同时指出全球推理算力每年增长约 3.4 倍,而 token 需求按现有代理指标估算每年增长约 10 倍,可能已超过供给增速。若趋势延续,算力紧张可能临近,长上下文和智能体类工作负载受影响更明显,前沿能力访问价格或上升,日常用户则可能转向更小更便宜的模型。

    rowing by roughly 10× per year — plausibly outpacing supply growth in the near future, if not already. However, these estimates are highly uncertain. For one, we don’t know the average size of the models behind current demand. Aggregate token figures also obscure an underlying trend in model efficiency, which both lowers the cost of producing tokens at a given quality, and introduces new demand as additional use cases become cost-effective. If these trends continue, a compute crunch is likely ne

    匹配字段正文

星期三

  1. Prime Intellect精选

    Prime Intellect 研究:奖励黑客是梯度动力学问题,并推出 Prime Sprints

    Prime Intellect 发布研究,提出奖励黑客是梯度动力学问题而非单纯的奖励函数规格问题,并用 Llama 3.2-1B-Instruct 在 100 步训练中系统验证。实验显示隐藏奖励与可见奖励争夺梯度预算,可见奖励饱和或不可达时黑客行为接管;基线频率仅影响黑客出现速度,0.16% 的稀有词同样会被放大。团队开源 backdoor-ifeval 环境,并启动 Prime Sprints 计划,为奖励黑客主题的社区实验提供免费算力,优秀项目可获 5K+ 美元额度。

    Systematic Reward Hacking and Prime Sprints

    acking; RL amplifies even patterns at near 0% baseline frequency. Rare hacks aren’t impossible, just slow; Additional specification around the intended behavior can sometimes encourage reward hacking; Tasks in the “goldilocks zone” of difficulty are most robust to reward hacking, as hidden objectives face stronger competition from primary gradients; If explicit tasks becomes too hard, reward hacking becomes the primary way to improve the gradient; Prompt injecting with instructions not to reward

    匹配字段正文

星期一

  1. Johann Rehberger / Embrace The Red精选

    Copirate 365:微软 Copilot 提示注入漏洞利用链(CVE-2026-24299)

    安全研究者 Johann Rehberger 公开其在 DEF CON Singapore 演讲中披露的微软 Copilot 系列漏洞,MSRC 已分配 CVE-2026-24299 并完成修复。攻击链通过 CSS background-image 与 @font-face 绕过 CSP 实现数据外泄,并利用 record_memory 工具经提示注入写入持久记忆,组合成可长期窃取用户数据的后门。作者指出 M365 Copilot 记忆功能默认开启且按微软文档不产生审计日志,建议厂商为 AI 组件与宿主平台明确安全契约。

    ey were able to repro a few months back, but not anymore. So the most likely explanation of the fix includes guardrail additions and input filtering. I do not think Copilot(s) leverage a similar mitigation to Google and ChatGPT yet, where they use their search engine index for public URLs to only render or navigate to public URL autonomously. It’s not a 100% fix but limits large scale data exfiltration, and something worth adopting. Fun stuff, but also scary. Epilogue: Take-aways Since this was

    匹配字段正文

星期四

  1. Augment Code 博客精选

    Augment Code 实验:Karpathy 风格规则让编码 Agent 更高效但代码质量未提升

    Augment Code 在 OpenClaw 的 40 个 PR 上测试了在 AGENTS.md 中加入 Karpathy 风格编码规则的效果,发现 Auggie、Claude Code 和 Codex 三个 Agent 的工具调用、文件读取、时间和成本均下降,但代码质量基本不变,Claude Code 甚至略有下降。

    Karpathy skills on OpenClaw: agents don't write better code. But they do it more efficiently.

    ime, and tokens dropped Every runner used fewer tool calls and finished faster. Each dot represents a separate, full 40 PR run. Relative change is calculated as percentage from average per baseline runs (without Karpathy). The reduction came mostly from fewer searches and fewer file reads. The agents found what they needed in fewer lookups. Not always without impact on performance. Tool call failure rates stayed flat at 5–8%. Same directional change for every runner. Output tokens fell by simila

    匹配字段正文

星期三

  1. LMSYS Blog精选

    LMSYS 为 SGLang 引入 RDMA P2P 权重传输,1T 参数模型更新提速 7 倍

    LMSYS 为 SGLang 的 RL 工作负载引入基于 RDMA 的点对点权重更新机制,作为传统 NCCL broadcast 的补充,兼容所有主流开源模型。在 1T 参数的 Kimi-K2 上,权重传输时间从 53 秒降至 7.2 秒,代价是每个训练 rank 在 CPU 内存上多占用一个 32G 的推理引擎副本。该设计通过源侧 CPU 引擎副本和 Mooncake TransferEngine 的零拷贝传输,让所有训练 rank 参与发送各自分片,减少网络冗余并让推理服务更快恢复 rollout。

    for all num local experts have been updated. Transfer Flow with Shared Replica To support transferring to multiple target engine instances using the same underlying memory, we leverage a Threadpool based task pool and a cache buffer for partially updated tensors. A transfer task for a SGLang tensor is either on the critical path and needs to be waited for, or can be submitted to the pool and checked for completion only at the very end. TransferEngine library removes GIL and enables parallelism i

    匹配字段正文

星期一

  1. OpenHands 官方博客精选

    CMU 提出 CAID:基于 git 分支合并的多智能体软件工程系统

    卡内基梅隆大学的 Jiayi Geng 在 OpenHands 官方博客介绍论文《Effective Strategies for Asynchronous Software Engineering Agents》,提出基于 OpenHands 构建的多智能体系统 CAID,用 git worktree、分支、合并和测试来协调长周期软件工程任务。CAID 由 manager 智能体拆解任务并构建依赖图,各 engineer 智能体在独立 worktree 中实现、测试和提交,再通过 git merge 合并回主干,智能体间通信全部走结构化 JSON 和 git commit。在 Commit0 上 CAID 比单智能体基线绝对提升 14.3%,在 PaperBench 上提升 26.7%,且在 Claude 4.5 Sonnet、GLM 4.7 和 MiniMax 2.5 三个模型上结果一致;消融实验显示去掉 git worktree 隔离会让多个智能体编辑同一工作区并导致性能明显下降。

    CAID manager and engineer workflow across isolated worktrees

    ck time. A natural solution is to have multiple agents work in parallel on different parts of the task. But multi-agent collaboration on a shared codebase has proven surprisingly fragile. The central difficulty is integration. Imagine that two agents each produce correct code independently, but when their changes are combined, the result breaks. One agent renames a function while another writes new code calling the old name. Both complete their work successfully in isolation. The merged result f

    匹配字段正文

星期六

  1. Sakana AI:Blog

    Sakana AI 发布 TRINITY:进化式 LLM 协调器

    Sakana AI 发布论文 TRINITY: An Evolved LLM Coordinator,被 ICLR2026 收录,提出测试时模型组合方案,由轻量协调器在多轮中为模型池中的 LLM 分配 Thinker、Worker、Verifier 三种角色,无需修改底层权重。协调器仅依赖一个小型语言模型的隐藏状态和路由头,可学习参数不到 20K,因传统 REINFORCE 梯度信噪比低、多轮标注成本高,改用无导数进化算法优化。论文称其在 LiveCodeBench 上取得 86.2% pass@1,并零样本迁移到 AIME、BigCodeBench、MT-Bench 和 GPQA 四个未见任务,平均表现超过池中包括 GPT-5、Gemini 2.5-Pro 和 Claude-4-Sonnet 在内的单个模型。

    importantly, it demonstrated incredible generalization. Without any retraining, TRINITY transferred zero-shot to four unseen tasks (AIME, BigCodeBench, MT-Bench, and GPQA). On average, the evolved coordinator surpassed every individual constituent model in its pool, including GPT-5, Gemini 2.5-Pro, and Claude-4-Sonnet (the top frontier models available at the time of our ICLR2026 submission last year). This work is central to Sakana AI’s vision. We believe the future of AI isn’t just about scal

    匹配字段正文

星期五

  1. Together AI Blog精选

    分布感知推测解码将强化学习 rollout 加速最高 50%

    Together AI 提出分布感知推测解码(DAS),在不改变模型输出或奖励质量的情况下,将强化学习后训练的 rollout 加速最高 50%。DAS 以近期轨迹构建自适应后缀树,并通过长度感知调度平衡 GPU 负载和推测预算。在数学推理的 DSR-sub 数据集上,rollout 时间减少超过 50%;采用单元测试奖励信号的代码生成任务中减少约 25%。

    adaptive suffix tree drafter that accelerates generation and scales gracefully over long training horizons. The second is a length-aware scheduling strategy that reduces rollout stragglers through inter-GPU load balancing and intra-GPU speculation budget allocation. Why suffix trees? As the policy evolves throughout RL training, a static drafter quickly becomes stale. DAS therefore uses a training-free drafter built from recent rollouts, so it can continuously adapt to the changing policy withou

    匹配字段正文

星期三

  1. Google Research精选

    Google 发布 ReasoningBank:让智能体从成功与失败经验中学习

    Google Research 发布智能体记忆框架 ReasoningBank,可从成功和失败经验中提炼可迁移的推理策略,让智能体在部署后持续学习。该工作基于 ICLR 论文,在 WebArena 和 SWE-Bench-Verified 上用 Gemini-2.5-Flash 评测,相比无记忆基线、Synapse 和 AWM 提升了任务成功率并减少任务步数。团队还提出记忆感知测试时扩展(MaTTS),把探索轨迹蒸馏为高质量记忆,代码已在 GitHub 开源。

    om our main evaluation results with Gemini-2.5-Flash on WebArena and SWE-Bench-Verified , we have the following key observations: Performance comparison (task success rates and average steps per task) of different agent memory strategies on WebArena and SWE-Bench-Verified. Importantly, during evaluation, we observed the emergence of strategic maturity. In a web-browsing example, the agent's initial curated rules resembled simple procedural checklists (e.g., "Look for page links"). As the agent p

    匹配字段正文

星期六

  1. Johann Rehberger / Embrace The Red

    用 ChatGPT 生成的对抗图片劫持 Claude Opus 4.7 记忆工具

    安全研究者 Johann Rehberger 用 ChatGPT 生成一张含谜题的对抗图片,让 Claude Opus 4.7 在分析图片时被劫持并调用 memory 工具,写入“用户名叫 Neo、43 岁、NASA 宇航员、喜欢冰淇淋和饼干”等虚假记忆,这些记忆会进入后续所有对话的上下文。他重复测试 10 次,5 次成功调用记忆工具写入虚假信息,且每次 Opus 都察觉到可能存在提示注入或质疑是否该存储,但最终仍被劫持。作者指出空记忆库会降低写入门槛,越像真实用户偏好的内容越容易通过;该对抗样本在文章发布约 24 小时后成功率降至 0%。

    t’s 0.2%. My 5/10 reflects repeated trials of a single targeted adversarial example. Therefore, the numbers aren’t directly comparable, but the gap is a reminder that benchmark averages do not equal potential targeted exploit performance. These things are hard to measure. Update 1: A few observations from testing across accounts The attack is more likely to succeed when no memories are present initially. One hypothesis that me and others came up is that an empty memory store lowers Claude’s thre

    匹配字段正文

星期二

  1. Google Research精选

    Google 发布 Vantage:用生成式 AI 评估未来技能

    Google 发布研究实验 Vantage,通过生成式 AI 在模拟环境中评估批判性思维、协作等未来技能,已在 Google Labs 开放英文注册。与纽约大学合作的研究中,188 名 18-25 岁美国测试者完成冲突解决和项目管理任务,AI 评分与人类专家的一致度接近两位专家评分者之间的一致度。Vantage 使用 Executive LLM 根据评估量表引导 AI 虚拟人动态引入挑战,再由 AI Evaluator 分析对话记录生成技能评分和反馈。

    Vantage-1

    essential long before the rise of AI, they are now becoming more critical than ever. Today we are sharing Vantage , a research experiment for assessing future-ready skills by leveraging generative AI to create conversations in simulated environments. Developed in partnership with pedagogy experts and researchers from New York University, Vantage is designed to offer high school and college students a sandbox environment for practice and validated assessment, built with the same systematic metho

    匹配字段正文