二、GitHub 当日热点:Agent 与机器人方向的热门仓库与方法
Part 2 · GitHub: popular agent and robotics repositories
本期仓库集中在「把 Agent 管起来」:长驻多 Bot 的身份与记忆、契约化的领域工具、协议级浏览器执行、动态拓扑 harness、以及外部状态记忆与反虚报护栏这类可问责设计。
These repos are about governing agents: identity and memory for long-lived bots, contract-shaped domain tools, protocol-level browser execution, dynamic-topology harnesses, and accountable designs such as external state memory with anti-overclaim guardrails.
01
Fei2411/DeepSeek-Bot
Fei2411/DeepSeek-Bot
⭐ 2,018 · JavaScript · 2026-10-07 创建⭐ 2,018 · JavaScript · created 2026-10-07
这是一个面向 DeepSeek Harness 的「长驻机器人小队」项目:不只是单个助手,而是让多个 bot 长期在线、能在彼此之间传消息、也能进群聊协作[23]。它要解决的是多 Agent 协同里「谁记得什么」的问题:常规做法每次任务都新建一个无状态 Agent,上下文靠拼接;这里把 bot 做成有身份的常驻个体,会话历史与角色随之保留。实现上主线 bot 负责对外交互,bot-to-bot 消息构成内部通信层,群聊则是共享上下文空间,工程上比 LangGraph 式的单次编排更接近「组织结构」建模。值得借鉴的是把 Agent 的「身份与记忆」和「任务编排」拆开设计,让同一个 Agent 能跨任务复用;限制是项目创建于 2026-10-07、几乎没有长期运行的公开案例,多 bot 常驻的上下文膨胀与成本控制需要自行验证。
This project is a team of long-lived bots for DeepSeek Harness: not a single assistant but several bots that stay online, message each other and join group chats[23]. It addresses who remembers what in multi-agent collaboration: the usual pattern spins up a stateless agent per task and stitches context together, whereas here each bot is a persistent identity that keeps its history and role. The implementation makes a main bot the outward interface, bot-to-bot messages the internal channel and group chat a shared context space, which models something closer to an org chart than a single-run graph. Worth borrowing is separating agent identity and memory from task orchestration so one agent can be reused across tasks; the limitation is that the repo was created on 2026-10-07 with almost no public long-run evidence, so context growth and cost control for always-on bots are unverified.
02
kajisho5/ffmpeg-skill
kajisho5/ffmpeg-skill
⭐ 1,955 · Python · 42 个工具 + MCP⭐ 1,955 · Python · 42 tools + MCP
它把本地视频剪辑能力打包成编码 Agent 可直接调用的技能:42 个 FFmpeg 工具,带机器可读的契约与一个 MCP(Model Context Protocol,模型上下文协议)服务器,支持 Claude Code、Cursor 与 Codex[24]。它要解决的是视频处理这类「命令行很强大但参数极难记」的任务交给 Agent 时的可靠性问题:让模型自由拼 ffmpeg 参数极易报错,而把工具收敛成有类型、有校验的接口后,Agent 只需选工具、填参数。实现上的关键是「机器可读契约」——每个工具声明输入输出,Agent 才能在失败时判断是参数错还是任务理解错;全部本地执行、不需要 API key,也顺带解决了素材外流。值得借鉴的是把领域 CLI 封装成契约化工具而不是让模型写命令;限制是项目集中在 FFmpeg 这一个领域,42 个工具的覆盖度决定了复杂剪辑(多轨、变速、特效合成)仍要回落人工。
It packages local video editing as skills a coding agent can call directly: 42 FFmpeg tools with a machine-readable contract plus an MCP (Model Context Protocol) server, for Claude Code, Cursor and Codex[24]. It addresses reliability when agents take on command-line-rich tasks: letting a model improvise ffmpeg flags invites errors, while collapsing tools into typed, validated interfaces leaves the agent choosing a tool and filling parameters. The key design choice is the machine-readable contract — each tool declares inputs and outputs so the agent can tell a bad parameter from a misread task; running entirely locally without API keys also keeps footage from leaving the machine. Worth borrowing is wrapping a domain CLI into contract-shaped tools instead of letting the model write commands; the limitation is that the project covers only FFmpeg, and with 42 tools, complex edits (multi-track, speed ramps, compositing) still fall back to humans.
03
outcrawlai/scout
outcrawlai/scout
⭐ 803 · TypeScript · 自动镜像仓库⭐ 803 · TypeScript · auto-mirrored
Scout 是一个开源浏览器 Agent,用 TypeScript 实现,通过 Chrome DevTools 协议(CDP,Chrome DevTools Protocol)驱动真实浏览器完成网页操作,仓库由厂商自有仓库自动镜像[25]。它要解决的是网页 Agent 的可控性问题:完全依赖「截图+模型点击」的方案脆弱且难调试,而直接控制浏览器协议可以把每一步操作变成确定性的、可重放的动作。实现上把「理解页面」和「执行动作」分层,动作走标准 CDP 调用,出现异常时可以回放整条动作序列定位原因。值得借鉴的是给浏览器 Agent 保留协议级执行层,别让模型直接生成坐标;限制是仓库注明为自动镜像、issue 与 PR 可能不在 GitHub 上处理,社区支持路径不明确,且 CDP 驱动的方案仍需自行处理登录态与反自动化检测。
Scout is an open-source browser agent in TypeScript that drives a real browser over the Chrome DevTools Protocol (CDP) to perform web actions, with the repository auto-mirrored from the vendor's own host[25]. It addresses controllability in web agents: screenshot-plus-clicks is brittle and hard to debug, whereas driving the browser protocol turns each step into a deterministic, replayable action. The implementation layers page understanding separately from action execution, with actions going through standard CDP calls so an anomaly can be diagnosed by replaying the action sequence. Worth borrowing is keeping a protocol-level execution layer for browser agents instead of letting the model emit coordinates; the limitation is that the repo states it is an automatic mirror, so issues and PRs may not be handled on GitHub, and a CDP-driven approach still needs its own handling of login state and anti-automation defences.
04
DAGroup-PKU/ViGAR
DAGroup-PKU/ViGAR
⭐ 102 · Python · 世界—动作模型⭐ 102 · Python · world-action model
ViGAR 重新审视「世界—动作模型」(World-Action Model)该怎么组织,目标是组合式、可上下文泛化的机器人操作,配套在 RoboTwin 仿真与视频生成数据上做后训练[26]。它要解决的是长程操作任务里「会模仿但不会组合」的问题:把观测直接映射到动作的模型在训练分布内表现好,一旦要求把已学的子技能组合成新顺序、或按自然语言换一种执行方式,成功率就掉下来。做法上用世界模型的预测能力充当中间监督,让动作生成不只看当前观测,还看对下一步状态演变的建模,并用视频生成数据补足真机数据稀缺。值得借鉴的是把「预测」当成动作策略的辅助监督而不是独立任务;限制是仓库刚开源、只有论文配套说明,真机迁移效果与推理开销仍缺少第三方复现。
ViGAR rethinks how a world-action model should be organised for compositional, in-context robotic manipulation, with post-training on RoboTwin simulation and video-generated data[26]. It addresses imitation without composition in long-horizon manipulation: models that map observations straight to actions do fine inside the training distribution, but success drops once learned sub-skills must be reordered or executed differently per a natural-language instruction. The approach uses a world model's predictive ability as intermediate supervision, so action generation considers not just the current observation but the modelled evolution of the next state, with generated video filling in for scarce real-robot data. Worth borrowing is treating prediction as auxiliary supervision for the action policy rather than a separate task; the limitation is that the repo is newly open-sourced with only the paper's companion material, so real-robot transfer and inference overhead lack third-party reproduction.
05
DAGroup-PKU/PyRUA-Lean
DAGroup-PKU/PyRUA-Lean
⭐ 38 · Python · 自述 +14% 成功率 / −65% tokens⭐ 38 · Python · claims +14% success / −65% tokens
一句话概括它的主张:GPT-6 Astra 机器人 Agent 用少 65% 的 token 换来高 14% 的成功率,仓库是「递归自我改进 + 计算机使用 Agent」方向的复现与后训练代码[27]。它要解决的是机器人 Agent 的推理成本与动作精度之间的矛盾:多模态 VLA(Vision-Language-Action,视觉—语言—动作)模型做长程任务时,冗长的思维链会消耗大量 token 且引入噪声,反而降低动作稳定性。做法上把「少 token 但更好动作」当作优化目标,在 RoboDojo 等基准上用后训练与递归自我改进压缩推理长度。值得借鉴的是把 token 效率当作机器人 Agent 的一等指标做联合优化,而不是先追成功率再压成本;限制是数字来自项目自述、对比基线未在仓库说明中完整给出,且「GPT-6 Astra」属未广泛验证的模型命名,需以论文与复现结果为准。
The claim in one line: GPT-6 Astra robot agents achieve 14% higher success with 65% fewer tokens, and the repo holds the reproduction and post-training code for that recursive-self-improvement, computer-use agent direction[27]. It addresses the tension between inference cost and action precision in robot agents: on long-horizon tasks, a multimodal VLA (vision-language-action) model burns tokens on long chains of thought that add noise and destabilise actions. The approach makes 'fewer tokens, better actions' the optimisation target, compressing reasoning length through post-training and recursive self-improvement on benchmarks such as RoboDojo. Worth borrowing is optimising token efficiency jointly with success rate rather than chasing success first and cutting cost later; the limitation is that the numbers are self-reported, the full comparison baseline is not given in the repo description, and the 'GPT-6 Astra' naming is not widely verified, so the paper and reproductions are what count.
06
jaz-lang/jaz-evals
jaz-lang/jaz-evals
⭐ 35 · Python · 论文复现包⭐ 35 · Python · paper reproduction package
它是一篇论文的复现包:《Harness as a Language: A Minimalist Agent Framework With Maximal Expressivity》在 AppWorld 与 StuLife 两个长程 Agent 基准上跑了十种「agent arm」配置[28]。它要解决的是Agent 框架对比不可复现的问题:各家框架的论文里,脚手架、提示词与工具实现往往同时变化,读者分不清究竟哪一层带来了提升。做法上把 harness(脚手架)当成一门有表达力的语言来设计,用同一组基准、同一套环境变量对比不同 arm,复现包则把每个 arm 的配置与结果一起开源。值得借鉴的是做框架选型前先固定其他变量、只替换脚手架层做对照实验;限制是 AppWorld 与 StuLife 都是对话式任务域,结论能否外推到计算机操作、机器人等真实环境仍是未验证的问题。
This is a reproduction package for a paper: 'Harness as a Language: A Minimalist Agent Framework With Maximal Expressivity' evaluates ten agent arms across AppWorld and StuLife, both long-horizon agent benchmarks[28]. It addresses irreproducible agent-framework comparisons: in most framework papers the scaffolding, prompts and tool implementations all change at once, leaving readers unable to tell which layer produced the gain. The approach treats the harness as a language with deliberate expressivity and compares arms on the same benchmarks with the same environment variables, while the package open-sources each arm's configuration alongside its results. Worth borrowing is to fix every other variable and swap only the harness layer when choosing a framework; the limitation is that AppWorld and StuLife are conversational task domains, so whether the conclusions extrapolate to computer-use or robotics settings remains unverified.
07
jackispm/nausicaa-harness
jackispm/nausicaa-harness
⭐ 33 · TypeScript · 动态拓扑 harness⭐ 33 · TypeScript · dynamic-topology harness
Nausicaa 的核心主张是:把一次 Agent 运行看成一族动态拓扑的「车道」(Lane),而不是一个固定的线性循环——模型可以自己决定何时观察、何时扇出、何时授权给别的 Lane 或跨 Run 协作,而宿主负责把身份、权限、持久化与恢复当成显式事实来维护[29]。它要解决的是长任务 Agent 在中断与并行时的状态一致性问题:线性循环一旦进程挂掉就难以恢复,也无法表达「同一任务里两条分支各自进行」。实现上把身份与权限从模型手里拿到宿主层,模型只负责决定拓扑怎么长,这让持久化与恢复有明确的挂载点。值得借鉴的是把「谁有权限做什么」放在宿主而非提示词里,模型只决策结构;限制是仓库创建于 2026-09-05、提交量很少,尚无公开的规模验证,其拓扑模型的学习门槛也需要评估。
Nausicaa's core claim: treat one agent run as a dynamic topology of Lanes rather than a fixed linear loop — the model decides when to observe, fan out, delegate or collaborate across runs, while the host maintains identity, permissions, durability and recovery as explicit facts[29]. It addresses state consistency for long-running agents under interruption and parallelism: a linear loop is hard to resume once the process dies and cannot express two branches of the same task proceeding independently. The implementation moves identity and permissions out of the model and into the host, leaving the model to decide only how the topology grows, which gives persistence and recovery a clear attachment point. Worth borrowing is putting 'who may do what' in the host rather than the prompt and letting the model decide structure only; the limitation is that the repo was created on 2026-09-05 with very few commits and no public scale evidence, and its topology model carries a learning curve.
08
weidutech/PentestPi
weidutech/PentestPi
⭐ 26 · Python · 外部状态记忆 + 反虚报护栏⭐ 26 · Python · external state memory + anti-overclaim guardrails
PentestPi 是自主渗透测试 Agent 框架,两个设计点写在说明里:外部状态记忆与「反虚假申报」护栏[30]。它要解决的是攻击类 Agent 最容易出的问题——为了交差而虚报战果:渗透任务的奖励信号模糊,模型很容易把「尝试过」描述成「已拿下」,在真实红队场景里这会直接误导防守方。做法上把任务状态放在 Agent 之外持久化,让进度由外部记录而非模型自述决定,再用护栏拦截没有证据支撑的结论;主题标签也覆盖 CTF 与漏洞评估。值得借鉴的是凡是奖励信号模糊的 Agent,都要把状态与证据外置,并显式惩罚无证据断言;限制是项目 2026-09-09 创建后仅有当日一次提交,无生产使用记录,授权边界与合法性责任完全由使用者承担。
PentestPi is an autonomous penetration-testing agent framework whose description highlights two design points: external state memory and anti-false-claim guardrails[30]. It addresses the failure mode attack-oriented agents are most prone to — overclaiming results to close a task: penetration rewards are fuzzy, so a model easily reports 'tried' as 'owned', which in real red-team work directly misleads defenders. The approach persists task state outside the agent so progress is set by external records rather than the model's own account, then uses guardrails to block conclusions without supporting evidence; the topic tags also cover CTFs and vulnerability assessment. Worth borrowing is that any agent with a fuzzy reward signal should externalise state and evidence and explicitly penalise unsupported assertions; the limitation is that the project was created on 2026-09-09 with a single commit that day and no production record, so authorisation boundaries and legal responsibility rest entirely with the user.
三、每日论文:arXiv 上的 Agent 研究
Part 3 · Daily Papers: agent research on arXiv
本期 8 篇围绕「自进化与可验证」:具身 Agent 的按需 RSI 与失败归因、科学 Agent 群的反馈引导变异、机械检验取代 LLM 判官、机器人 harness 综述、跨接口一致性、文档级缓存压缩、行动与预测的共同演化,以及可验证停机的证据图。
These eight circle self-evolution and verifiability: on-demand RSI and failure attribution for embodied agents, feedback-guided mutation in scientific swarms, mechanical verification replacing LLM judges, a robotics harness survey, cross-interface consistency, document-level cache compaction, co-evolving acting and forecasting, and evidence graphs for certifiable stopping.
01
AdaRSI: On-Demand Recursive Self-Improvement for Embodied Agents
AdaRSI: On-Demand Recursive Self-Improvement for Embodied Agents
2610.20474 · cs.CL, cs.RO · 2026-10-142610.20474 · cs.CL, cs.RO · 2026-10-14
论文针对的是具身 Agent 的递归自我改进(RSI,Recursive Self-Improvement)该改哪一层这个问题:预训练 VLA(Vision-Language-Action,视觉—语言—动作)模型在没见过的长程任务里常常半途失败,而现有做法要么只改冻结执行器外面的脚手架(结果加不进缺失的动作),要么对持续失败盲目微调执行器权重(却没判断失败到底出在「怎么调用」还是「根本不会」)。AdaRSI 的做法是让编码 Agent 先改进自己的技能与 harness,再把持续失败的子步骤从保存的状态出发重试以做归因,只有在归因显示缺失能力时才更新执行器权重。它要解决的核心是「何时该改权重、何时只改调用方式」,把昂贵的权重更新留到真正必要的时候。效果上论文给出的对比基线是上述两类 RSI 方法,关键收益是避免了在脚手架可修的情况下误改权重;限制是归因依赖从保存状态重试,状态不可恢复的任务上该机制失效,且实验集中在仿真与有限真机任务,泛化性仍需验证。
This paper asks which layer recursive self-improvement (RSI) should change in embodied agents: pretrained VLA (vision-language-action) models often fail midway through unseen long-horizon tasks, and existing approaches either refine the harness around a frozen executor (so a missing motion can never be added) or train the executor on persistent failures without asking whether the failure lies in how it is called or in what it can do. AdaRSI has a coding agent first improve its own skills and harness, then attribute persistent failures by retrying failing sub-steps from saved states, updating executor weights only when attribution shows a missing capability. The crux is deciding when to change weights versus only how they are invoked, reserving expensive updates for cases that need them. Against those two baseline RSI families the reported gain is avoiding weight updates when the harness was the fixable part; the limitation is that attribution depends on replaying from saved states, so tasks without recoverable state break the mechanism, and the experiments concentrate on simulation plus limited real-robot tasks, leaving generalisation unverified.
02
SwarmRSI: Recursive Self-Improvement through Evolving Scientific Agent Swarm
SwarmRSI: Recursive Self-Improvement through Evolving Scientific Agent Swarm
2610.20431 · cs.AI, cs.CL · 2026-10-142610.20431 · cs.AI, cs.CL · 2026-10-14
论文针对的是科研多 Agent 系统里「实验失败之后该改哪里」的归因难题:科学 Agent 群(swarm)可以把不同研究方向的证据与实现组合起来指导后续实验,但实验结果差的时候,无法判断该修订假设还是修订实现,而整体评分又会掩盖对别的 Agent 有用的局部组件。SwarmRSI 给出的框架包含 Feedback-Guided Swarm Mutation:用带引导的反馈同时精修假设与其实现,而不是把两者当成同一个黑箱,从而让「假设错了」和「代码写错了」在变异算子里被区别对待。它要解决的是多 Agent 自我改进中的信用分配问题,把可复用的中间实现保留下来而不是随整体分数一起被淘汰。效果上论文给出的对比基线是既有的科研 Agent 与 RSI 方法;限制是这类方案的评测高度依赖任务域的评分函数,换到没有稳定评分器的科研场景时引导信号可能失真,且算力开销随族群规模上升。
The paper addresses attribution in scientific multi-agent systems — where to fix things after an experiment fails: a scientific agent swarm can combine evidence and implementations from different research directions to guide later experiments, but weak results leave unclear whether to revise a hypothesis or its implementation, while aggregate program scores hide components that other agents could reuse. SwarmRSI introduces Feedback-Guided Swarm Mutation, refining hypotheses and their implementations together under guided feedback rather than treating both as one black box, so 'the hypothesis is wrong' and 'the code is wrong' are handled differently by the mutation operator. The problem it really solves is credit assignment in multi-agent self-improvement, keeping reusable intermediate implementations alive instead of discarding them with a bad aggregate score. Its comparison baseline is existing scientific-agent and RSI methods; the limitation is that such approaches depend heavily on the task domain's scoring function, so the guidance signal can distort in research settings without a stable scorer, and compute cost grows with swarm size.
03
Beyond LLM Judge: Mechanical Verification for Agentic Autoformalization
Beyond LLM Judge: Mechanical Verification for Agentic Autoformalization
2610.20573 · cs.LO, cs.AI · 2026-10-142610.20573 · cs.LO, cs.AI · 2026-10-14
论文针对的是「用模型判断模型」这一验证范式的不可靠:把自然语言数学自动形式化成 Lean 代码时,主流做法让 LLM 或训练过的模型来判断形式化是否忠实,但这类判官会漏掉空洞定义(vacuity)之类的错误——形式化在语法上成立、却什么都没约束。作者提出的做法是把 LLM 的语义审阅与机械的数值检验和空洞性检查结合,产出可被程序检查的反馈,从而抓到 LLM 判官漏掉的错误;配套的 Extract-Verify-Proof 流水线用于构建 FLMF(NIST 数字数学函数库 DLMF 的部分形式化)。它要解决的是自动形式化的可信度问题,把「可检查」而不是「看起来对」当作验收标准。效果上,在三个带标注的数据集上,该方法取得了受评方法中最低的误接受率;限制是机械检查只覆盖能数值实例化的命题,深层的语义等价仍需人审,且该方法的效果依赖 Lean 生态与数值检验的可构造性。
The paper attacks the unreliability of using a model to judge a model: when auto-formalising natural-language mathematics into Lean, the standard approach has an LLM or trained model judge faithfulness, yet such judges miss errors like vacuity, where a formalisation is syntactically valid but constrains nothing. The authors combine LLM semantic review with mechanical numerical and vacuity checks, producing checkable feedback that catches mistakes LLM judges miss, and use an Extract-Verify-Proof pipeline to build FLMF, a partial formalisation of NIST's Digital Library of Mathematical Functions. The underlying problem is trustworthiness in autoformalisation, making 'checkable' rather than 'looks right' the acceptance criterion. Across three labelled datasets the method achieves the lowest accepted-error rate among the evaluated methods; the limitation is that mechanical checks only cover propositions that can be instantiated numerically, deeper semantic equivalence still needs humans, and effectiveness depends on the Lean ecosystem and the constructibility of those numerical checks.
04
Towards Agentic Robots: Model, Data, Environment, and Harness
Towards Agentic Robots: Model, Data, Environment, and Harness
2610.20442 · cs.RO · 2026-10-142610.20442 · cs.RO · 2026-10-14
这是一篇给「智能体式机器人」(agentic robots)搭统一框架的综述:基础模型正把机器人智能从底层动作预测推进到对数据采集、模型训练、任务规划与真实执行的目标导向编排,Agent 要能理解指令、与环境交互、自行纠正执行错误并动态调整策略[34]。它要解决的是研究方向之间缺乏共同语言的问题:各条线各做各的,研究者对「怎么把不同的 agentic 功能组合成一个完整机器人系统」没有一致看法,于是很难比较、也很难复用。论文把系统拆成模型、数据、环境与 harness 四个维度来梳理现有工作,这也是「Agent 的脚手架」这一概念第一次被系统地引入机器人栈。效果上它提供的是分类与对照而非新的 SOTA;限制是这是一篇综述,提出的框架尚未在统一基准上被验证,而且机器人领域的 harness 标准化仍处早期,四维度划分的边界在实际系统中会互相渗透。
This is a survey that builds a unified frame for 'agentic robots': foundation models are pushing robot intelligence beyond low-level action prediction toward goal-directed orchestration of data collection, model training, task planning and real-world execution, with agents that interpret instructions, interact with environments, correct execution errors on their own and adjust strategy[34]. It addresses the lack of a shared language across research lines: work develops separately, researchers hold no consistent view of how to combine different agentic functions into one complete robot system, so results are hard to compare or reuse. The paper organises existing work along four dimensions — model, data, environment and harness — and marks the first systematic introduction of the 'harness' concept into the robotics stack. Its contribution is a taxonomy and comparative map rather than a new state of the art; the limitation is that it is a survey whose frame has not been validated on a unified benchmark, and harness standardisation in robotics is still early, so the four dimensions blur together in real systems.
05
One Task, Many Interfaces: Cross-Interface Consistency Training Improves LLM Agent Robustness
One Task, Many Interfaces: Cross-Interface Consistency Training Improves LLM Agent Robustness
2610.20576 · cs.LG, cs.AI, cs.CL · 2026-10-142610.20576 · cs.LG, cs.AI, cs.CL · 2026-10-14
论文针对的是Agent 的能力被「训练时那套接口」绑死这一现象:把动作改个名字、把记号变一变(语义完全不变),Agent 的表现就会明显下降;而逐样本独立打分意味着接口随机化只是把依赖从单一接口扩大到训练接口分布,分布外扰动依旧会让性能掉下来。作者提出 CIPR(Cross-Interface Policy Regularization,跨接口策略正则),一个自监督目标:把动作名替换成无信息的标识符,并把同一条训练样本以两种等价接口同时呈现,用两者输出的一致性强加约束。它要解决的是接口漂移下的可靠性问题,让「同一个任务换个说法」不再变成另一个任务。效果上的对比基线是常规逐样本训练与接口随机化;限制是该方法只保证语义保持的等价变换下的一致性,真正改变任务语义的接口变动仍需重训,且一致性约束会增加训练成本。
The paper targets agents whose competence is bound to the interface they were trained on: rename an action or change notation with semantics preserved and performance drops, while scoring each sample independently means interface randomisation only broadens the dependence from one interface to the training interface distribution, so out-of-distribution perturbations still degrade the agent. The authors propose CIPR (Cross-Interface Policy Regularization), a self-supervised objective that replaces action names with uninformative identifiers and presents each training sample under two equivalent interfaces, constraining the two outputs to agree. The problem it solves is reliability under interface drift, so 'the same task phrased differently' stops being a different task. Its baselines are ordinary per-sample training and interface randomisation; the limitation is that it only guarantees consistency under semantics-preserving equivalent transformations — real semantic changes still require retraining — and the consistency constraint raises training cost.
06
Latent Compaction with Test-Time Training
Latent Compaction with Test-Time Training
2610.20582 · cs.CL, cs.LG · 2026-10-142610.20582 · cs.CL, cs.LG · 2026-10-14
论文针对的是长上下文把 KV 缓存撑爆的现实问题:上下文越长,键值(KV,key-value)缓存越大,生成阶段的内存占用与注意力开销同步上升,而在压缩缓存时又必须保住没被问到过的信息。作者提出 Latent Compaction:通过测试时训练(test-time training)学出一份针对具体文档的紧凑缓存,先用重建重要性、教师注意力与键空间多样性来初始化缓存条目,再分两阶段训练——先拟合全量缓存的注意力输出与对数归一化项(重建选中的条目保持固定),后对整份缓存做端到端的全缓存蒸馏;模型权重全程冻结,训练只用生成的 token。它要解决的是「压缩后还能回答新问题」这一验收标准。效果上的对比基线是固定压缩率下的既有缓存压缩方法;限制是测试时训练本身要付出额外计算,且缓存是针对单份文档定制的,跨文档复用能力仍需验证。
The paper targets long contexts overwhelming the KV cache: the longer the context, the larger the key-value cache, and memory use and attention cost during generation rise with it, while compression must still preserve information for questions never asked. The authors introduce Latent Compaction, learning a compact document-specific cache through test-time training: cache entries are initialised using reconstruction importance, teacher attention and key-space diversity, then trained in two stages — first fitting attention outputs and log-normalisers of the full cache with reconstruction-selected entries held fixed, then jointly optimising the entire cache through end-to-end distillation from the full-cache model. Model weights stay frozen throughout and training uses only generated tokens. The acceptance criterion it addresses is whether a compressed cache can still answer unseen questions. Its baseline is existing cache-compression methods at fixed compression ratios; the limitation is that test-time training itself costs extra compute and each cache is tailored to one document, so cross-document reuse remains unverified.
07
Co-Evolving Acting and Forecasting for Language Agents
Co-Evolving Acting and Forecasting for Language Agents
2610.20597 · cs.AI, cs.LG · 2026-10-142610.20597 · cs.AI, cs.LG · 2026-10-14
论文针对的是语言 Agent 训练里「中间步骤的监督被浪费」:长程 rollout 成本高,而标准的 Agent 强化学习只从终局标量奖励学习,中间每一步的监督信息基本没被用上。已有做法用价值目标(估计每步成功概率)或观测目标(拟合环境响应)来利用它,但两者都难做好——价值目标对同一条轨迹的每一步来自同一个标量信号,观测目标(网页、终端日志)又长又噪且只能看前一步。作者加入第三类多步动作目标,让「行动」与「预测」在同一条轨迹上共同演化,从而在不增加 rollout 次数的前提下获得更密的步级监督。它要解决的是长程 Agent 的样本效率与信用分配问题。效果上的对比基线是仅用终局奖励的 Agent RL 以及前述两类辅助目标;限制是多步预测目标仍依赖对环境的建模假设,在环境响应不可预测(如真实网页)时收益会缩小,且实现复杂度高于标量奖励基线。
The paper targets wasted intermediate supervision in language-agent training: long-horizon rollouts are expensive, yet standard agentic reinforcement learning learns only from a terminal scalar reward, leaving per-step supervision largely unused. Prior work exploits it through value targets estimating per-step success probability or observation targets fitting environment response, but both are hard to build well — value targets derive every step from the same single scalar per trajectory, and observation targets such as web pages and terminal logs are long, noisy and only reach one step ahead. The authors add a third kind of multi-step action target, letting acting and forecasting co-evolve along the same trajectory to obtain denser step-level supervision without extra rollouts. The problem it addresses is sample efficiency and credit assignment for long-horizon agents. Its baselines are agent RL with terminal reward only and the two earlier auxiliary targets; the limitation is that multi-step prediction still assumes a model of the environment, so gains shrink where responses are unpredictable (real web pages, for instance) and the implementation is more complex than a scalar-reward baseline.
08
ActiveEvidence: Decision-Focused Evidence Graphs with Verifiable Acquisition Gaps
ActiveEvidence: Decision-Focused Evidence Graphs with Verifiable Acquisition Gaps
2610.20532 · cs.AI, cs.CV, cs.LG · 2026-10-142610.20532 · cs.AI, cs.CV, cs.LG · 2026-10-14
论文针对的是多模态 Agent「值不值得再去看一眼」的判断问题:Agent 需要决定视觉证据是否值得获取、该查哪个候选或分辨率、以及何时继续交互已经无法改变决策。作者把这一情形形式化为决策可证明的主动证据获取,前提是严格的「免费元数据/付费观测」边界、随机向量成本,以及冻结的执行轨迹(可重放)。方法上用反事实证据交互图(CEIG,Counterfactual Evidence Interaction Graph)同时表示证据的一阶价值、带符号的二阶交互与有向条件性损害,并为未解决的交互保留显式的分数包围区间,再用决策加权的包围目标收紧那些可能改变动作身份的边界;缺口导向的采集则优先去补能翻盘决策的证据。它要解决的是 Agent 在成本约束下「何时停」的可验证性问题。效果上的对比基线是贪心/不确定性驱动的证据采集;限制是形式化依赖冻结轨迹与成本模型正确,现实系统中这两者都难以严格成立,且二阶交互的估计在候选集很大时计算开销显著。
The paper targets a multimodal agent's decision about whether more evidence is worth fetching: it must judge whether visual evidence merits acquisition, which candidate or resolution to query, and when further interaction can no longer change its decision. The authors formalise this as decision-certifiable active evidence acquisition under a strict free-metadata/paid-observation boundary, stochastic vector costs and a frozen, replayable execution trace. Their Counterfactual Evidence Interaction Graph (CEIG) represents unary evidence value, signed second-order interaction and directed conditional harm together, keeps explicit score enclosures for unresolved interactions, and uses a decision-weighted enclosure objective to tighten the bounds that could change action identity; gap-directed acquisition then prioritises evidence that could flip the decision. The problem solved is verifiable stopping under cost constraints. Its baselines are greedy and uncertainty-driven evidence acquisition; the limitation is that the formalisation assumes frozen traces and a correct cost model, neither of which strictly holds in real systems, and estimating second-order interactions gets expensive as candidate sets grow.
📅 覆盖口径
📅 Coverage
覆盖口径:北京时间 2026-10-15 00:00–23:00。
Coverage window: 2026-10-15 00:00–23:00 (UTC+8).
本文由自动化「AI资讯速递」工作流抓取公开信息后整理,评价与分析部分为个人观点,不构成投资或技术选型建议。
Compiled by an automated daily-trends workflow from public sources; the analysis reflects the author's personal views only.