Fetching from the wire…
Public story · 2026-09-12 · high
A compact classifier reads that tensor and predicts whether the answer is correct in under a millisecond, without sampling the model multiple times.
Why now: As of September 12, there's no word yet on whether the fixed-tensor approach holds on models outside the paper's own benchmarks.
A new technique called ActMap compresses a model's full generation into a 96 KiB tensor, captured with no measurable slowdown during generation.
That matters because judging a single answer usually means sampling a model several times, or reading only the output-token probabilities and missing what happened inside. ActMap keeps the whole internal trajectory instead, across every layer and every generated token, then scores it with a classifier in under a millisecond.
The ActMap paper trains a compact Vision Transformer to read that tensor and return a correctness probability. Separately trained MLPs, matched for capacity, score about as well. That result puts the signal in the compressed representation itself, not in whichever classifier reads it.
96 KiB per generation is small enough to log for every answer a system produces, not a sampled subset of them. For anyone building correctness checks into a live generation system, the paper doesn't say whether a tensor this small still carries the signal on a different model or task than the ones it was tested on.
Each link below shares sources, entities, or timing with this story.
Built from 542 quality-controlled factual questions into 6,504 episodes with tool returns of known correctness, across five open-weight 7-9B models (arXiv 2608.26295). Models follow a correct tool 86.0-93.1% of the time and repeat the tool return in 78.4-86.0% of cases where b...
This one annoyed me, because I've been running the losing pattern. SWE-QA (arXiv 2608.01507) compares the sub-agent grep pattern that Claude Code, Codex and Antigravity all ship by default against a pre-built semantic index over the same repository. Semantic search answered 65...
Researchers reveal that Direct Preference Optimization implicitly operates over a full preference graph, meaning it extracts more signal from existing datasets than anyone realized. Practical implication: your existing RLHF data may be more valuable than you think.
Microsoft Research showed Qwen3-4B with a "Skeptical-Agent" outperforms 32B models and approaches 235B single-attempt performance. A 50x+ model size compression through inference-time self-refinement. Practical evidence that you can trade model size for inference-time compute...
157 tasks from 27 repos. Best resolved rate: 29.94%. Agents cause scope creep and regressions by diverging from user intent. Practical implication: agents need explicit scope constraints. arXiv 2509.22237 ---
Tackles cascading errors where one agent's bad output poisons downstream agents. A "rectify-or-reject" pruning framework acts as an active firewall between handoffs without retraining. Practical pattern: add quality gates between agent handoffs. arXiv 2602.23258
MindPattern daily
One email a day at 7 AM. Sources and a take on every story. Unsubscribe anytime.