←搜索结果

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

星期五

  1. The Register

    测试游戏显示人工审批漏掉约三分之一危险 AI 编码智能体请求

    比利时开发者 Alex Wauters 制作的浏览器游戏让玩家在 60 秒内审批模拟的 Claude Code 权限请求,超过 4 万次运行、40.9 万条命令的数据显示,平均约三分之一的恶意命令被放行。最常被漏掉的是范围越权类请求,占比 35%,例如读取 Kubernetes 配置文件或 AWS 凭据;被漏掉最多的单条命令是 npm run analyze,近 65% 的玩家批准了它。Wauters 认为反复审批会带来疲劳,建议把编码智能体放进沙箱和云端 devcontainer,并配合 auto mode 与钩子来拦截风险动作。

    ng agent requests suggests humans in the loop aren't as good at spotting dangerous commands as one might hope, with players approving roughly one in three malicious requests on average. The results also suggest that repeatedly having to approve an agent's actions can lead to sloppy decisions. It’s a quick, simple game on the surface (give it a try - you know you want to): A small window shows up on the screen with simulated permissions requests like one would get from Claude Code as it executes

    匹配字段正文

星期三

  1. NVIDIA Developer · Generative AI精选

    NVIDIA 解析世界动作模型如何重塑机器人操作

    NVIDIA 技术博客介绍世界动作模型(WAM),即用视频世界模型替代视觉语言模型骨干,为机器人策略提供预测场景演变的物理先验。文章称 WAM 能从多样交互数据中学习、泛化到未见环境,并以更少演示适配新机器人本体。其开源基础模型 Cosmos 3 基于 Mixture-of-Transformers 架构,训练数据含约 7.67 亿张图像、3.48 亿段真实动态视频和 800 万条动作样本,提供 4B Edge、16B Nano 和 64B Super 三种规模;其中 Cosmos3-Nano-Policy-DROID 与 Cosmos3-Edge-Policy-DROID 分别可在 RTX PRO 6000 工作站和 Jetson Thor 上以 15 Hz 控制频率部署。

    Technical Blog sessionStorage.removeItem('facets.search.text'); sessionStorage.removeItem('facets.search.text-copy'); sessionStorage.removeItem('facets.search.filters'); World action models (WAMs) replace vision-language model backbones with video world models to give robot policies a physics prior for predicting how scenes evolve. NVIDIA research shows WAMs learn from diverse interaction data, generalize to unseen environments through learned dynamics, and adapt to new robot embodiments with fe

    匹配字段正文

星期五

  1. NVIDIA Developer · Generative AI精选

    NVIDIA AI Red Team 总结部署更安全 AI 智能体的四种方式

    NVIDIA AI Red Team 在六个月内评估了多个 AI 智能体,归纳出四类反复出现的失效模式:缺少访问控制、工具允许任意代码执行、缺少网络出口控制、密钥以明文暴露。团队指出基于提示词的护栏和 LLM-as-a-judge 模式常被社会工程、渐进式操纵和恶意包安装等合法工作流绕过,有效防护需要模型控制面之外的确定性控制,包括严格访问控制、Docker 或 NVIDIA OpenShell 等加固沙箱、默认拒绝的网络出口以及通过专用密钥管理器让密钥远离智能体。

    Technical Blog sessionStorage.removeItem('facets.search.text'); sessionStorage.removeItem('facets.search.text-copy'); sessionStorage.removeItem('facets.search.filters'); Related Resources Trustworthy AI / Cybersecurity English 中文 The NVIDIA AI Red Team shares how access controls, sandboxing, network egress restrictions, and secret management can reduce the risks of deploying AI agents at enterprise scale. AI-Generated Summary The NVIDIA AI Red Team assessed multiple AI agents over the past six m

    匹配字段正文

星期四

  1. A6 a6-052 · Fireworks AI

    Fireworks 实验:从 LoRA 切换到 FullFT 前该做的三项测试

    Fireworks AI 在 Qwen3.5-9B 上用 SFT 对比 LoRA 与 FullFT,通过 placement、寄存器分配和 Nexa VM 三个可自动校验的合成任务,检验数据覆盖、优化配置和 rank 各自能解释多少质量差距。结论是多数场景下差距来自训练数据和学习率而非适配器容量,例如把数据扩大 10 倍使 LoRA 有效率从 34.33% 升到 68.33%,学习率调优又补上 6.34 个百分点;只有在寄存器分配任务上提高 rank 才明显有效。作者建议先用覆盖度、训练配方和 rank 三项测试排查,再决定是否承担 FullFT 的额外训练与独立部署成本。

    6 If training with LoRA isn't producing the results you were expecting, the adapter itself may not be the problem. We did controlled experiments on Qwen3.5-9B showing how data coverage, optimization, and rank can create or close the quality gap to Full Parameter Fine-Tuning, or FullFT. Which lever moved? Within-experiment changes; gray cells were not tested In our earlier Kimi K3 work , LoRA was fast, inexpensive, and effective for bounded objectives, and we drew a line: broad or genuinely novel

    匹配字段正文

  2. NVIDIA Developer · Generative AI

    如何用 NVIDIA NeMo Guardrails 自托管经过校验的 AI 编码助手

    NVIDIA 发布教程,介绍如何用 StarCoder2-7B NIM 在自有 GPU 上自托管编码助手,并在其前面部署 NeMo Guardrails 拦截认证、支付、加密等人工专属路径的请求。方案还包括带 ai-assisted 标签的 CI 校验门,运行单元测试、SAST、密钥扫描、幻觉依赖检测和许可证检查,以及通过 commit trailer 追踪 AI 辅助改动,并用 Prometheus 与 Grafana 对比 AI 辅助与基线的缺陷逃逸率、回滚频率和评审延迟。

    workflow that runs only when the PR carries an ai-assisted label. Rather than reinventing each check, wire in maintained open-source tools: The dependency scan is the highest-leverage step because it targets a failure mode unique to code models, now commonly called slopsquatting. The model invents a plausible-looking package name, an attacker registers that name in a public registry, and the hallucinated dependency ships real malware to anyone who installs the suggestion. Several maintained sca

    匹配字段正文

星期三

  1. A6 a6-052 · Fireworks AI

    Fireworks 教你用一杯咖啡的成本把 LLM 微调成嵌入模型

    Fireworks 发布教程,介绍如何用对比学习把 Qwen3-Embedding-8B 微调成领域嵌入模型,训练约 150 步即可完成。在 LegalBench 法律引用检索上 nDCG@10 提升 36%,全判决案件匹配约提升 2 倍;LoRA rank-32 与全参微调差距约 1 个点,训练窗口从 512 扩到 8k–16k 时 nDCG 和 MRR 接近翻倍。Fireworks Training 同时预览 embedding、cos_similarity_matrix、contrastive_loss 三种模式,分别权衡损失自定义自由度与训练效率。

    The Needle; Getting Started; Three Fireworks Training Modes: Flexibility vs. Efficiency; Interested in Fireworks Training? Table of Contents TL;DR Retrieval-augmented generation (RAG), semantic search, reranking, recommendation, intention classification, deduplication, clustering — an enormous share of production AI boils down to one primitive: turning text into a vector so that related things land close together and unrelated things land far apart. The quality of that vector space is the ceili

    匹配字段正文

星期二

  1. Trail of Bits Blog

    Trail of Bits 如何用 Codex 的 /goal 在 Patch the Planet 中找漏洞

    Trail of Bits 分享了在 Patch the Planet 项目中用 Codex 的 /goal 功能挖掘开源软件漏洞的三条经验:让 Codex 自己写目标提示词、只定义结果不规定路径、每个智能体只分配一个目标。团队把威胁模型文件作为目标提示词的核心输入,并指出把找漏洞和覆盖率放进同一个提示词会导致优化不均,改为先让 Codex 找出五个最有希望的攻击面,再为每个攻击面单独开一个 /goal 会话。工程师 Kevin Valerio 基于 /goal 搭建了针对 Rust 编译器的自动化变体分析流水线,所有提交给 Patch the Planet 的 Rust 漏洞都出自该系统。

    “Figure 3: Rust maintainers assumed we had a team of engineers working on finding bugs. It was just one engineer with a strong handle on Codex’s /goal.”

    n-source project create one. Putting two competing outcomes in one /goal prompt results in uneven optimization. We ran into this repeatedly when a goal asked for both bugs and coverage. When we put “find bugs” and “achieve high coverage” in the same prompt, the run ended up doing one of them far better than the other. This was our experience while using /goal to audit zlib. Codex kept gravitating to the same part of the codebase, fuzzing the areas the model found first without reaching the rest.

    匹配字段正文

  2. Cartesia 产品与研究

    Cartesia 解析如何判断 TTS 模型是否真正优秀

    Cartesia 发布技术博客,系统拆解 TTS 模型评测的多维挑战,指出 WER 饱和、上下文正确性、文本归一化、自动质量分数局限、人工评测偏差、长音频与流式失败模式、领域差异及多语言难点。文章强调 TTS 质量不是单一维度,需按产品体验构建多维评测,并介绍了 Cartesia 在低延迟、清晰度、自然表达、上下文正确性、一致性和流式鲁棒性上的优化方向。

    by sentence. It also needs to stay coherent over time. Common drift patterns include: Speaker identity changes; Accent drift; Speaking rate changes; Emotional consistency across paragraphs Streaming adds another layer. Streaming means the system starts playing audio before the full response has been generated. Instead of waiting for the whole paragraph or answer to be ready, the model produces speech in small pieces and sends them to the listener right away. This is what makes a voice assistant

    匹配字段正文

星期日

  1. Together AI Blog

    Together AI 对比 Kimi K3 与 GPT-5.6 Sol 在 DeepSWE 上的表现与路由策略

    Together AI 在 DeepSWE 上对比 Kimi K3 与 GPT-5.6 Sol:Sol 以 72.7% 拿下 pass@1,Kimi K3 以 89.4% 拿下 pass@4,且每次 rollout 成本 4.65 美元对 8.37 美元。两者逐任务相关性仅 0.46、失败方式不同,先用 Kimi K3 再在测试套件拒绝时升级到 Sol 的级联可达约 85.6%,高于任一单模型和完美一次性路由的 83.4%。两者合计覆盖 113 个任务中的 108 个,剩余 5 个需引入第三个模型。

    the board. The two are tied on Go (79 each). Sol leads Python (74-68), TypeScript (66-60), and JavaScript (75-65). Kimi K3 takes Rust (65-60). Decompose pass@1 and pass@4 into coverage (tasks solved at least once across four tries) and reliability (tasks solved on all four), and the two models sit in opposite corners. Sol posts 84.5% reliability with 61 tasks solved four-for-four, across a modest 85.8% of the benchmark. Kimi K3 reaches 89.4% coverage, wider than any flagship, but only 76.6% reli

    匹配字段正文

星期五

  1. Anthropic:Claude.dev 开发者博客精选

    Claude 5 代模型的上下文工程新规则

    Anthropic 总结了面向 Claude 5 代模型和 Claude Code 的上下文工程方法,称其删减超过 80% 的 Claude Code 系统提示词后,编码评测未出现可测量的损失。新方法强调让模型运用判断、设计更具表达力的工具接口,并通过 Skills、延迟加载工具和文件树渐进披露上下文。Claude Code 还提供 claude doctor,可用 /doctor 精简 Skills 和 CLAUDE.md 文件。

    One assembled context holding a system prompt line “leave documentation as appropriate”, a skill line “do not add comments”, and a user request “just make it work like the old one”.

    uld give particularly strong guidance that might not always be true. For example, in the system prompt we used to say: In code: default to writing no comments. Never write multi-paragraph docstrings or multi-line comment blocks — one short line max. Don't create planning, decision, or analysis documents unless the user asks for them — work from conversation context, not intermediate files. But for a certain subset of prompts, this guidance would be wrong. In the case of documentation, the user m

    匹配字段正文

  2. Together AI Blog

    Together AI 对比 Kimi K3 与 Claude Fable 5 的 DeepSWE 编码表现与成本

    Together AI 在 DeepSWE 基准上对比 Kimi K3 与 Claude Fable 5:Fable 5 在 xhigh 设置下 pass@1 为 69.9%,Kimi K3 max 为 68.5%,但 Kimi K3 在 pass@2(82.0 对 80.2)和 pass@4(89.4% 对 88.5%)上反超。成本方面,Kimi K3 每次 rollout 为 4.65 美元,Fable 5 为 13.41 美元,每 100 美元分别完成 14.7 与 5.3 个任务。Kimi K3 是 Moonshot AI 的开源权重模型,可自托管或通过推理服务商部署。

    Fable’s 88.5 and Sol’s 85.8; across the entire 44-config export, only two cheap GPT configs (Luna max and GPT-5.5 high, at 90.3) have ever reached more. Decompose pass@1 into coverage (tasks solved at least once) and reliability (pass rate on those tasks) and the two models occupy different corners. Kimi reaches 89.4% of the benchmark - higher than any peak, with only 12 tasks it never cracks (Fable: 13). But it's less reliable on 4/4 tries: 76.6% reliability and only 45 tasks solved four-for-f

    匹配字段正文

星期六

  1. Ahead of AI

    如何控制大语言模型的推理力度

    文章解释了大语言模型如何通过不同推理力度,在回答质量、token 消耗、成本和延迟之间进行权衡。其实现通常结合混合 SFT 数据、按模式调整的 RL 奖励、长度惩罚、独立专家模型或硬性 token 预算;DeepSeek V4、Nemotron 3 Ultra、Kimi K3、GLM-5、Qwen3 和 Inkling 采用了不同组合。模型规模与推理力度是两套独立控制方式,较小模型提高推理力度有时可达到与较大模型降低推理力度相近的基准成绩。

    ing reward during the RLVR stage. So instead of just rewarding the model based on answer correctness, one would provide additional reward for the use of tokens, which in turn encourages the model to use those. In DeepSeek-R1, for example, the overall reward was calculated as R total = R accuracy + R format where the format reward was a simple rule-based check that encouraged the model to place its reasoning inside: reasoning trace . The first generation of reasoning models was dedicated reasonin

    匹配字段正文

星期五

  1. Hugging Face

    PyTorch 性能分析(第三部分):剖析注意力后端

    本文通过 PyTorch Profiler 对比朴素注意力与 SDPA 的 math、efficient、flash 和 cuDNN 后端,揭示不同实现的执行开销。原地 masked_fill_ 可在无梯度前向中消除一次 Memcpy;math 后端因 FP32 转换、重复构造掩码等操作启动 20 个 GPU kernel,慢 3.7 倍,而其余后端将计算融合为单个 kernel。测试形状下 FlashAttention-2 最快,其低占用率源于大量使用片上资源,并不代表优化不佳。

    n.py uvx trace-util -f traces/ -b /traces The in-place version (Figure 5) wraps far fewer CPU ops inside the masking step than the out-of-place version (Figure 4). This is an encouraging signal. Let's unfold the GPU lane to confirm what happened there. On the GPU lane the Memcpy kernel is gone for good (Figures 6 and 7). With a one line change we shaved a whole kernel off each forward pass. This may not look like much on its own, but remember this is a single attention operation. In the context

    匹配字段正文

星期一

  1. Hugging Face精选

    PRX 第4部分:我们的数据策略

    Photoroom 为 7B 文生图模型 PRX 构建了兼顾规模与多样性的预训练数据管线,以 Lance 完成探索和整理,再转换为 MDS 供分布式训练。团队用 Qwen3-VL-8B 重新生成详细图像描述,并采用 quality 92 的 JPEG、分辨率与宽高比分桶。文本分类和感知哈希通过跳过列表过滤文本密集、NSFW 及近重复样本,无需重写数据集。

    earning how the world looks: the visual concepts, the objects and scenes, how things are composed and lit, and the sheer range of what images can contain. That is a problem of coverage and diversity, not of per-image perfection. A broad, representative corpus teaches the model far more about the structure of the visual world than a smaller, prettier one would, even if many of the individual images are ordinary snapshots or slightly compressed. Over-filtering for aesthetics at this stage would ac

    匹配字段正文

星期四

  1. Trail of Bits Blog

    GPT-5.5-Cyber 一天内为 zlib 搭建模糊测试实验室

    Trail of Bits 在 Patch the Planet 项目中用 Codex 的 /goal 命令驱动 GPT-5.5-Cyber,一天内为 zlib 搭建了覆盖十余个入口的模糊测试流程,包括 harness、sanitizer 构建和种子,并发现多个待协调披露的漏洞。模型自行判断静态审查价值有限,转而构建动态测试工具,并主动放弃一个在真实条件下难以触发的 inflateBack 空回调崩溃。作者认为,定制化模糊测试的专家门槛正在消失,攻防双方都能更快发现漏洞。

    hand-holding. /goal forced the objective to live across multiple turns and compactions so the model held scope, and 5.5-Cyber was smart enough to reject weak findings, expand coverage when a line of investigation died, and keep running until it had workable proof-of-concepts backed by sanitizer output. Over the next several hours, it built the campaign out one piece at a time: Each of these decisions is routine on its own, but stringing them together in the right order across a dozen entrypoint

    匹配字段正文

星期六

  1. Ahead of AI精选

    Sebastian Raschka:如何用开源工具搭建本地编码智能体

    Sebastian Raschka 演示了如何用 Ollama、本地开放权重 LLM 和 Qwen-Code 搭建可读写文件、运行命令并验证修改的本地编码智能体。文章还介绍了安全审计、性能测试及 Codex、Claude Code 的接入方式;其小规模评测中,Codex 使用更少 token,而 Claude Code 在部分模型组合上取得更高任务成功率。

    It probably has a much higher token usage. So, below, I additionally looked at the token usage of all three harnesses. As we can see, Claude Code uses by far the most tokens on average, Codex the least. When it comes to the little agent capability assessment benchmark, the Qwen and North Mini Code models also get 5/5, and even the small Gemma 4 model does ok! Interestingly, we can also see that the token usage is largely driven by the harness, not the LLM itself. I.e., among all three LLMs that

    匹配字段正文

星期四

  1. Air Street Press精选

    Revolut 如何规模化运行 AI

    Revolut 通过统一网关和按 AI 用例治理的控制层,在受监管的银行环境中运行生成式 AI,并为每个生成式产品设置模型回退链。其平台支撑的生成式用例约为传统机器学习用例的两倍,按任务选择满足要求的较小模型可将成本最多降低 8 倍且不损失质量。语音服务已覆盖 20 个国家、每月处理约 25,000 通电话,AIR 则结合交易数据分析支出并回答金融相关问题。

    s. Revolut ships more than 200 products and has handled over a trillion dollars in transactions, with a machine learning model now in the path of almost every one of them. The leverage, in Donets’s telling, has moved from the model to everything around it. Four constituencies, one bottleneck For years, Revolut’s AI was classical machine learning: fraud and transaction models shipped through three internal libraries, one each for training, serving, and performance monitoring. Then, in 2022, the g

    匹配字段正文

星期三

  1. Browser Use精选

    Claude Fable 5 在 BU Bench 拿下 80% 高分

    Browser Use 用开源 Browser Use 库在 BU Bench V1 上测试 Anthropic 的 Claude Fable 5,得分 80.0%,比第二名 GPT 5.5 高出 12 分。100 个任务中通过 80 个,20 个失败里 16 个判定错误、4 个触发 30 分钟超时,平均每任务耗时 6 分 53 秒,100 个任务 API 成本为 580.87 美元。Fable 的失败主要来自提取错误事实或选错实体、无法充分访问或搜索来源、答案缺乏轨迹支撑,与 GPT 5.5 常因多步骤任务未完成而失败的模式不同。

    open- and closed-source models. Result Fable passed 80 of 100 tasks. Of the 20 failures, 16 were judged incorrect, and four hit the 30-minute task timeout. Tasks took 6m 53s on average. That makes Fable slower per task than GPT 5.5, Opus 4.7, and BU 2.0, but faster than Gemini 3 Pro, Qwen 3.6 Plus, Kimi K2.6, and DeepSeek V4 Pro. The cost comparison makes the tradeoff clear. Fable completed many of the long research and browsing tasks that usually separate stronger web agents from weaker ones. T

    匹配字段正文

星期三

  1. Anthropic:Claude.dev 开发者博客精选

    Anthropic 构建 Claude Code 的经验:如何设计和使用技能

    Anthropic 总结了内部构建和扩展数百个 Claude Code 技能的经验,将其归纳为九类,并介绍设计、分发、组合与衡量方法。团队发现产品验证类技能对 Claude 输出质量的改善最易衡量,而高质量技能应突出易错点,利用文件系统渐进披露上下文,并通过脚本、配置和按需 hooks 提升可靠性。

    A three-by-three grid of skill categories with example skill names: Library and API Reference, Product Verification, Data and Analysis, Business Automation, Scaffolding and Templates, Code Quality and Review, CI/CD and Deployment, Incident Runbooks, Infrastructure Ops.

    s/volumes → posts to Slack → soak period → user confirms → cascading cleanup; dependency-management — your org's dependency approval workflow; cost-investigation — "why did our storage/egress bill spike" with the specific buckets and query patterns TIPS FOR MAKING SKILLS Once you've decided on the skill to make, how do you write it? These are some of the Claude Code team’s best practices, tips, and tricks for making skills. Don’t state the obvious Claude already knows how to code and can read yo

    匹配字段正文

星期二

  1. Together AI Blog精选

    Together AI 如何高效服务 MiniMax M3:支持 1M-Token 上下文与原生多模态

    Together AI 优化了 MiniMax M3 的生产级推理服务,使其支持 1M-Token 上下文、原生多模态与智能体工作流。MiniMax Sparse Attention 让预填充和解码分别提速超过 9 倍和 15 倍,其他优化使常见智能体流量下的性能提升 81%–125%。M3 开放权重发布后,Together AI 将提供开发者端点。

    MiniMax Sparse Attention into the engine. During decode, we first build a page table based on the selected blocks, flatten the KV-group dimension into the batch dimension, and leverage the strided view of a KV cache tensor to provide the attention kernel with the pointer needed to retrieve the KV page. The trick is the stride: page addresses advance by D to choose a virtual page start, while tokens advance by Hkv D. That deinterleaves one physical tensor into per-head pages, so each flattened ro

    匹配字段正文