Google 開源 Harness²:遞迴代理程式框架,無需新模型也能提升效能
Google Cloud AI Research has open-sourced Harness².It is a recursive agent harnessing framework that improves the code and files around a frozen model.For developers, the pitch is simple.Your agent may get better without a better model.TL;DR Size: A framework, not a model.
0 parameters trained; 8 editable harness components.Version 0.1.0.Runs on: Linux with Python 3.12 or 3.13 and uv.Model runs call models through Vertex AI.GPU requirement: Not disclosed.Performance: 1 refinement step improved all 4 model and harness setups on all 3 benchmarks.
Best: GLM-5 under OpenCode rose from 64.2 to 75.7 on WorkBuddy-Bench (+11.5 points).Worst: GLM-5 under Codex gained only 1.2 points on JobBench (23.6 to 24.8).What is Harness²?Harness² is a plug-and-play framework from Google Research that refines an agent’s harness during deployment.
A harness is everything around the model: prompts, tools, memory, skills and orchestration.Harnessing is the process of optimizing that system.Model weights never change.The target setting is the open world.Tasks arrive unseen, and no verifier says whether an answer is right.
The research team argues that most self-improvement methods assume labels or test cases.Harness² is built to work without them.What are the 8 harness components?
Harness² exposes 8 editable components, each mounted as a file: System prompt Guardrails Memory Tool guidance Subagents Skills Scripts Plugins (middleware) They cover context construction, the tool interface, delegation and behavior inside the tool loop.
The layout extends the 7-file split from earlier Agentic Harness Engineering work by 1 component.How does recursive agent harnessing work?The framework runs two linked levels of recursion: Task-level recursion uses a contrastive Propose, Probe, Compose step.
First, the agent runs the task once with the base harness.An editor then proposes 2 candidates.The invariant candidate targets general agent failures such as planning or tool use.The domain candidate targets knowledge and procedures for the current domain.Both candidates run on the same task.
The composer compares their trajectories against the reference and keeps only edits backed by observed behavior.Harnessing-level recursion happens after each task.A reflector stores the adopted harness plus an EXPERIENCE.md file of lessons.This library guides future proposals.
Each new task still starts from the base harness.The budget k scales the search.Parallel mode probes k invariant and k domain candidates, then makes k compositions.Sequential mode chains k refinement steps.PlayStep →↺ Reset At k=1: 1 reference + 2 probes + 1 final run per task.
Parallel mode probes k invariant and k domain candidates; sequential mode chains k steps.Click a component to see its runtime role.
Context constructionTool interfaceOrchestrationMiddleware Single improvement step (k=1).Means over 3 runs.LAB = Partial pass rate (%).Source: Harness2 paper, Tables 1 and 2.Gemini 3.5 Flash executor.Bar axis starts at 50.Meta-Harness is optimized offline on separate training tasks.
Scores as measured in the Harness2 paper.Sources: arXiv 2610.14224 · github.com/google-research/harness2© Marktechpost
(function(){ var R=document.getElementById('mtp-h2x'); function $(s){return R.querySelector(s)}function $$(s){return R.querySelectorAll(s)} function sz(){try{parent.postMessage({mtpH2xHeight:R.offsetHeight+40},'')}catch(e){}} $$('.tab').forEach(function(t){t.onclick=function(){$$('.tab').
forEach(function(x){x.classList.remove('on')});$$('.pn').forEach(function(x){x.classList.remove('on')});t.classList.add('on');$('#h2-'+t.dataset.t).classList.add('on');if(t.dataset.t==='p3')drawB();if(t.dataset.t==='p4')drawR();setTimeout(sz,50)}}); / pipeline / var nd=$$('.
nd'),i=-1,tm=null; var notes=["Reference.The frozen model runs the task with the base harness H0.This shows how the harness behaves, not whether the answer is correct.", "Propose.
An editor drafts 2 candidates: an invariant one for general agent failures (planning, tool use) and a domain one for task knowledge and procedures.", "Probe.Each candidate runs on the same task.Comparing trajectories against the reference gives a behavioral contrast.No ground-truth labels needed.
", "Compose.The composer reads all evidence and diffs.It may merge, revise, adopt 1 candidate, or keep the current harness.", "Execute.The composed harness runs and returns the final deliverable.", "Reflect.The full improvement record is reviewed.
Lessons are kept only if execution contrasts support them.", "Update.The adopted harness and an EXPERIENCE.md of lessons join the improvement library.", "Next task.The executor resets to H0, but the library now guides proposals and composition.Removing it cut WorkBuddy from 77.5 to 74.4.
"]; function show(k){nd.forEach(function(n,j){n.classList.toggle('lit',j<=k)});$('#h2-note').innerHTML=k<0?"Press Play or Step to walk through 1 Harness2 improvement step.":notes[k];$('#h2-prog').style.width=((k+1)/nd.length100)+'%';sz()} function step(){i=(i+1)%nd.length;show(i)} $('#h2-step').
onclick=function(){stop();step()}; $('#h2-reset').onclick=function(){stop();i=-1;show(-1)}; function stop(){if(tm){clearInterval(tm);tm=null;$('#h2-play').textContent=' Play'}} $('#h2-play').onclick=function(){if(tm){stop();return}if(i>=nd.length-1)i=-1;step();tm=setInterval(function(){if(i>=nd.
length-1){stop();return}step()},1900);this.textContent='❚❚ Pause'}; / components / var C=[["System prompt","Context construction","#4285F4","Persona and top-level procedure followed on every call."], ["Guardrails","Context construction","#4285F4","Process rules, e.g.verify outputs before finishing.
"], ["Memory","Context construction","#4285F4","Persistent context made available to the agent."
Related
相關文章
如何利用NVIDIA結構化資料模型進行零訓練表格預測
In this tutorial, we implement Structured Data Models, NVIDIA’s new library that puts several pretrained foundation models for tables behind one PyTorch interface, and use it to make predictions without training.
認識 Kyutai REKI:2.4B VLA 模型為機器人操控帶來高效記憶
Kyutai 與 Inria 及 École des Ponts 合作,推出了 REKI——一個用於機器人操控的 2.4B 參數視覺-語言-動作模型(VLA)。該模型僅使用公開數據進行預訓練,並配備了輕量級的近期記憶功能。在三個分佈外基準測試中,僅有規模約為其兩倍的模型能超越它。所有模型權重已於今日在 Hugging Face 上公開。核心資訊:規模:2.4B 參數(2.2B Qwen3.5-2B VLM + 0.2B 流匹配動作專家)。記憶涵蓋最近 3 幀,間隔 1 秒。運行環境:在 1 張 NVIDIA H100 上進行基準測試。從兩個 256×256 攝像頭輸入,編譯後每個動作區塊耗時 21.8 毫秒。權重以 BF16 格式提供,暫無量化版本。性能:在 LIBERO-Plus 和 RoboTwin Clean2Rand 基準測試中,為公開數據預訓練的 VLA 模型中最優;在 LIBERO-Plus 上達到 90.4% 的最高分。
DeepSeek 發布 V4.1-Flash-1017,DeepSWE 得分 77.0,並開放搜尋 API
DeepSeek 剛發布 DeepSeek-V4.1-Flash-1017,這是其 V4.1-Flash 模型的新檢查點,現已在 DeepSeek 網站、應用程式及 API 上線。DeepSeek 宣稱該版本在性能、任務完成速度與輸出簡潔度上均優於 9 月發布的 V4.1-Flash,並稱之為性能與成本的帕累託改進。同時,DeepSeek 也向所有開發者開放了搜尋與擷取 API。對代理建構者而言,這意味著更便宜的編碼模型加上單一 API 金鑰即可使用的第一方網路層。重點摘要:骨架參數 552B,另加 196B 的 Engram 參數;預填充階段每 token 啟用 8B 參數,解碼階段啟用 16B 參數;上下文長度達 1M tokens,最大輸出 384K tokens。運行於 DeepSeek API 的 deepseek-flash 模型。9 月版的 V4.1-Flash 權重(763B 參數,FP8)採 MIT 授權。
2026年20款Jev替代方案:挑戰TypeSafe的決策模型
TypeSafe於2026年9月15日推出Jev,這是一款決策模型而非聊天機器人。使用者可定義允許的答案,Jev將回傳標籤、分數或是否的機率。約4週內,至少20款Jev替代方案相繼問世,來自Cloudflare、OpenAI、Perplexity、Liquid AI、AWS的Strands Labs及獨立開發者。本指南比較各方案在規模、授權、硬體、價格、Jev API相容性及已發布基準測試的表現。重點摘要:規模範圍從287M(GLiNER2.5-multi-Decide)到35B-A3B(Mapika Decider),Jev規模未公開。執行環境:Von和Laya等編碼器可在CPU上運行,4B適配器適用24 GB GPU或32 GB Mac。效能:多數開源模型在困難推理上落後Jev,但在狹窄分類任務上數款與之匹敵或超越。最佳表現:Cloudflare Clef在BANKING7取得94.20分。
長鑫科技市值兩月內跌去1萬億;阿里加碼AI硬件品牌,天貓、速賣通聯動;國行版蘋果AI有望12月上線,百度、阿里參與合作丨雷峰早報
要聞提示1.長鑫科技市值兩月內跌去1萬億2.年內已至少18次故障!DeepSeek發放宕機補償,有人拿到3000元3.阿里加碼AI硬件品牌,天貓、速賣通聯動4.國行版蘋果AI有望12月上線,百度、阿里參與合作5.可靈AI新一代模型Kling 4.
Meta 發布 Muse Spark Open:816B 參數開源 MoE 模型,支援百萬級上下文
Meta 超級智慧實驗室正式釋出 Muse Spark Open,這是其 Muse Spark 模型的開源權重版本。Muse Spark Open 為一款 816B 參數的混合專家(MoE)模型,每個 token 啟動 42B 參數。它支援文字、圖片、影片與音訊輸入,輸出文字,並具備 100 萬 token 的上下文視窗。Meta 團隊宣稱,這是迄今為止美國效能最強的開源權重模型。對開發者而言,真正的重點在於部署:NVFP4 版本可在 2 臺配備 Apple M5 Ultra 的 Mac Studio 上運行。重點摘要:參數量為 816B 總參數/42B 啟動參數(256 個專家,每個 token 啟動 8 個);100 萬 token 上下文。運行需求:透過 MLX 框架,2 臺 Mac Studio(M5 Ultra,各 512 GB 記憶體);4 張 Blackwell Ultra GPU 或 8 張 H200(使用 NVFP4);或透過 Unsloth 2-bit GGUF 量化,約需 300 GB 配置。效能表現:在代理式工具使用上表現強勁;在大型開源模型中位居中段班。