推論系統

推論 runtime、量化、 serving、KV cache、成本與效能。

代理工具

SKILL.state Discards Agent Execution History, Cutting Token Use for 100-Step Tasks to One-Sixteenth With Structured State

Researchers from Google and Purdue University designed an agent that reads only a fixed skill specification, its current state, and the latest observation at each step, immediately discarding its reasoning history after validating state updates. In a 100-step warehouse test, it achieved 0.94 accuracy using 65,408 tokens, but its effectiveness depends on a predefined state structure preserving information needed later.

AI 研究

CritICL Turns Small-Model Failure Modes Into a Prompt Library, Bringing Single-Generation Performance Close to Multi-Sample Test-Time Compute

CritICL first catalogs small-model errors, failure types, and critiques offline, then adds relevant examples to a large model’s prompt instead of repeatedly sampling for every question. The authors report slightly higher accuracy than self-consistency on Qwen2.5 math benchmarks, but the cost of building the library offline and the unreleased code limit reproducibility.

代理工具

PILOT Lets Supervisory Agents Reroute Mid-Task and Write Execution Experience Back into Persistent Skills in Real Time

PILOT connects a supervisor and a worker agent through a bidirectional channel, allowing the former to provide guidance or terminate an erroneous path before a long-running task is complete. The authors report improved accuracy and token efficiency across three agent benchmarks, but its “self-improvement” updates only the harness, skills, and memory—not the model parameters.

最新模型

TTPO Routes Positive and Negative Trajectories by Majority Vote, Enabling Models to Update at Test Time Without Ground-Truth Answers

Rather than treating the majority-vote answer as ground truth, TTPO distills trajectories that agree with the consensus and uses grouped reinforcement learning to penalize high-confidence disagreements. The authors report that Qwen3-1.7B’s Avg@12 across three mathematics competitions rises from 38.0 to 45.2, though this remains a transductive setting in which parameters are updated directly on the test problems.

推論系統

Prefix Sliding Preserves the Prompt Prefix and Recent Reasoning, Turning KV Memory for Ultra-Long Thinking into a Fixed Budget

During generation, Prefix Sliding evicts intermediate reasoning tokens while retaining the system prompt, task prefix, and the most recent several thousand tokens. It can be applied without retraining. The research reports that overall thinking time for long reasoning can be reduced by roughly threefold, but the current implementation depends on forked versions of vLLM and FlashAttention, with limited benefits for short outputs and tasks that require revisiting early details.