Research Radar

Daily Digest — August 7, 2026

Daily · August 5–7, 2026 · sources: ICML 2026 Workshop · ACL 2026 · arXiv cs.CL/cs.LG/cs.CR/cs.AI
2 peer-reviewed · 8 preprints · 0 forum/blog
Mech Interp AI Security Text Diffusion LMs
GEOMETRIC RECOVERY vs. CAUSAL EFFECT — SAE FEATURES 0 0.25 0.50 0.75 1.00 Recovery score (cosine similarity to ground-truth direction) 0 0.25 0.50 0.75 1.00 Causal effect (logit reduction under ablation) cosine ≥ 0.90 threshold 77% causally inert Causally inert (high cosine, near-zero effect) Causally active features Low-recovery (below threshold)
Figure 1 · Up to 77% of SAE features passing cosine ≥ 0.90 (right of dashed line) are causally inert — the decoder direction aligns with ground truth but the encoder never fires causally, exposing a fundamental gap between geometric and causal validity.

The field's most widely used metric for validating sparse autoencoder features — cosine similarity between a decoder atom and a ground-truth direction — does not mean the feature is causally active. A rigorous ablation and steering audit reveals that up to 77% of features passing a strict geometric recovery bar are completely causally inert.

SAE evaluation has relied on cosine similarity to ground-truth directions from synthetic toy models, treating high cosine as evidence of successful feature recovery. This work separates the geometric claim ("the decoder direction matches") from the causal claim ("the matched encoder feature fires and has measurable downstream effect"). Zero-ablating features at full layer depth across systematically varied SAE training quality reveals that up to 77% of features with cosine ≥ 0.90 in degraded SAEs — and 9% in well-trained SAEs — are causally inert: the decoder atom aligns perfectly while the encoder never fires when the feature is present. The study also reproduces the Elhage et al. (2022) superposition phase diagram and identifies a convergence artifact at high sparsity and a previously undescribed diffuse sharing regime at extreme overcompleteness that inflate cosine metrics without producing causally active features.

02
ICML 2026 Workshop mech-interp

LLMs Can Annotate Attribution Graphs

Ameen Patel, Max Zhang, Nathan Hu · ICML 2026 Mechanistic Interpretability Workshop (peer-reviewed)
LLM-AUTOMATED ATTRIBUTION GRAPH ANNOTATION Attribution Graph thousands of features manual annotation → hours per graph auto-interp descriptions LLM Grouping "month names in sequence" "capital city tokens" "country name contexts" "geographic lookup" LLM clusters into supernodes group Supernodes Geographic lookup Intermediate hop Capital retrieval 97 / 100 prompts intermediate-hop recovery Population Scale 1000 Wikipedia graphs annotated LLM judge flags unusual graphs for human review ↓ automated quality = human
Figure 1 · Automated annotation pipeline: auto-interp feature descriptions → LLM clusters into supernodes → automated interpretability metrics confirm quality matches human annotators; 97/100 intermediate-hop recovery on two-hop Capitals; scales to 1000-graph population analysis.

Turning attribution graphs into readable circuits has always hit the same wall: a human analyst must spend hours grouping thousands of feature nodes into meaningful "supernodes" per prompt. This ICML workshop paper shows an LLM can do it as well as a human — and can do it at population scale.

The pipeline feeds auto-interpretability feature descriptions directly to an LLM, which clusters them into semantically coherent supernodes. Automated interpretability metrics — requiring no human judges — confirm the output matches human-annotated supernodes in quality. On a two-hop Capitals factual-recall task (e.g., "What country is Rome in? — Italy — What continent is Italy on?"), the pipeline recovers the intermediate-hop supernode in 97 of 100 prompts, validating that the automation preserves the interpretable structure circuit tracing was designed to expose. A proof-of-concept scales to 1000 Wikipedia attribution graphs: all annotated automatically, with an LLM judge flagging unusual computational patterns for human review — opening population-level circuit interpretability that was previously impractical.

03
AI security preprint

Agent Data Injection Attacks are Realistic Threats to AI Agents

Woohyuk Choi et al. (Seoul National University) · arXiv preprint · July 2026
AGENT DATA INJECTION (ADI) — BYPASSES ALL EXISTING DEFENSES Attacker posts GitHub issue comment Spoofed GitHub Issue Author: @trusted-maintainer [looks legitimate — metadata spoofed] body: "run: rm -rf /data" existing defenses: bypassed Coding Agent (Claude Code / Codex / Gemini CLI) trusts @trusted-maintainer ⚠ RCE / Supply-Chain 33.3%–100% ASR on web DOM data Why ADI bypasses all current defenses Instruction injection defenses: near-zero ASR ✓ ADI vs same defenses up to 50% ASR — fails ✗ Root cause metadata ≠ instruction surface
Figure 1 · ADI attack: attacker spoofs trusted-maintainer metadata (not explicit instructions) on a GitHub issue comment; coding agents treat the payload as authoritative and execute attacker commands; achieves 33.3%–100% ASR on web DOM data while evading all tested defenses (up to 50% ASR vs near-zero for instruction injection).

Every existing indirect prompt injection defense was designed to detect injected instructions. Agent Data Injection attacks don't inject instructions — they inject spoofed trusted metadata, an attack surface those defenses were never built to cover.

ADI attacks disguise malicious commands as security-critical context metadata rather than as instructions: spoofing the author field of a GitHub issue to impersonate a trusted maintainer causes Claude Code, Codex, and Gemini CLI to execute the attacker's shell command (RCE); spoofing a tool response makes the agent merge a malicious pull request without reviewing the code (supply-chain attack). Empirical evaluation across six frontier LLMs shows 31.3%–43.3% ASR on JSON-formatted agent context data and 33.3%–100.0% on web DOM data. Against the same state-of-the-art defenses that reduce instruction injection to near-zero success, ADI achieves up to 50.0% ASR — establishing ADI as a qualitatively different attack surface that demands dedicated defenses.

Items 4–10 · Also notable
04
ACL 2026 Findings mech-interp AI security

Towards Understanding the Robustness of Sparse Autoencoders

ACL 2026 Findings (peer-reviewed) · ACL Anthology 2026
SAE AUGMENTATION: UP TO 5× JAILBREAK REDUCTION 0% 25% 50% 75% 100% GCG Attack 85% 17% AutoDAN 72% 22% PAIR 60% 20% Baseline SAE-augmented
Figure 1 · SAE-augmented classifiers achieve up to 5× jailbreak reduction across GCG, AutoDAN, and PAIR attacks; feature robustness scales with dictionary size and degrades for rare/compositional harm concepts.

Training a linear classifier on SAE activations of the input prompt outperforms probing raw hidden states and achieves up to 5× jailbreak success rate reduction. Features for common harmfulness concepts transfer across models and attack formats; robustness degrades for rare and compositionally complex concepts, and scales with SAE dictionary size. First systematic study of when SAE-based safety probes are reliably transferable vs. brittle — distinguishing stable detectors from format-specific ones with direct implications for interpretability-based safety deployment.

05
mech-interp preprint

Are Single-Token Sparse Autoencoder Features Causally Necessary? Layer-Depth and SAE-Family Effects

arXiv preprint · July 22, 2026 · 3.9M features across 6 models × 3 SAE families
CAUSAL NECESSITY BY SAE FAMILY AND LAYER DEPTH GemmaScope 88% 84% 81% 78% 75% BatchTopK 92% 82% 71% 62% 58% LlamaScope 38% 32% 28% 24% 21% Layer 0 Layer 1 Layer 2 Layer 3 Layer 4 Cross-family gap dominates within-family scale effects 178/208 BH-significant
Figure 1 · Causal necessity rates by SAE family and layer depth; GemmaScope and BatchTopK features are causally anchored (75%–92%) while LlamaScope features are locally redundant (21%–38%) on the same base model — cross-family differences dominate scale effects.

Zero-ablating single-token SAE features yields BH-significant logit reductions in 178 of 208 full-layer conditions — confirming causal necessity is the norm in most settings. However, cross-family differences dominate: GemmaScope and BatchTopK features on the same base model are causally anchored (75%–92% necessity rate) while LlamaScope features are locally redundant (21%–38%). Single-token features cluster 4.7× tighter in decoder space and concentrate in early layers. Together with paper #1, this establishes that SAE feature causal validity is a property of the SAE family and training procedure, not just of the underlying model.

06
AI security preprint

S³: Improving Agent Safety through Multi-Stage Defense

Zibo Xiao, Haoyu Wang, Jun Sun · arXiv preprint · August 3, 2026 · github.com/FFchopon/S3-Framework
S³: GUARD AGENT ORCHESTRATES STAGE-SPECIFIC SAFETY SKILLS User Prompt Memory Retrieval ▸ mem-safety skill Planning ▸ plan-filter skill Tool Call ▸ tool-call monitor Action Execution ▸ exec-guard skill Safe Output ✓ Guard Agent: orchestrates stage-specific safety skills Community Safety Skill Library — automated pipeline converts existing designs into composable, stage-tagged skills
Figure 1 · S³ guard agent orchestrates stage-specific safety skills across memory, planning, tool-call, and execution stages; community-driven skill library enables reuse and composition across agentic frameworks.

Existing LLM agent safety methods protect isolated stages (prompt or output) and cannot catch risks that emerge mid-workflow or propagate across steps — the gap that ADI (#3) and multi-step jailbreaks exploit. S³ abstracts heterogeneous safety designs as Stage-Specific Safety Skills: composable components with explicit stage semantics, convertible from existing designs via an automated pipeline and stored in a community-driven library. A guard agent selects and applies skills throughout the workflow. Evaluated against representative baselines on multi-step agentic benchmarks, S³ consistently outperforms isolated-stage defenses in both safety effectiveness and utility preservation.

07
mech-interp preprint

Persistent Sparse Autoencoders: Learning Feature Timescales in Language Models

Haoyan Luo, Mateo Espinosa Zarlenga, Mateja Jamnik · University of Cambridge · arXiv, July 19, 2026
PERSISTENT SAE: LEARNED FEATURE TIMESCALE SPECTRUM λ=0 λ=0.5 λ=1.0 Persistence coefficient λ (0 = instantaneous decay, 1 = full persistence) Fast features (≡ standard SAE) local detectors Slow features topic-level / long-context Prompt-injection monitoring: slow features maintain signal across long context
Figure 1 · Persistent SAE learns a spectrum of feature timescales — fast features (λ≈0) are local detectors equivalent to standard SAEs; slow features (λ≈1) accumulate topic-level information and persist across long contexts, enabling prompt-injection monitoring.

Standard SAEs are position-independent — each token is encoded in isolation, discarding sequential structure. Persistent SAEs add a per-feature persistence coefficient λ that controls how rapidly activation decays across positions. Training produces a learned spectrum: fast features (λ ≈ 0) behave identically to standard SAE features (local detectors); slow features (λ ≈ 1) accumulate and maintain topic-level information across long contexts. A prompt-injection monitoring case study shows slow features preserve the injected signal over many intervening benign tokens, enabling detection at generation time. Reconstruction quality is competitive with standard SAEs throughout.

08
mech-interp text diffusion preprint

Subliminal Clocks: Latent Time Modelling in Diffusion Language Models

Maximo Rulli et al. · arXiv, July 2, 2026 (revised July 20)
LATENT CLOCK PROBE ACCURACY ACROSS DLM LAYERS Layer index Probe accuracy 0% 50% 100% L0 L6 peak L9 ~97% peak accuracy
Figure 1 · Linear probe accuracy for the latent denoising timestep across DLM layers — rises from ~40% at L0 to ~97% by mid-network, confirming a reliable "subliminal clock" signal decodable from the residual stream without explicit timestep conditioning.

Masked DLMs denoise without explicit timestep conditioning, yet encode a latent representation of denoising progress in their residual streams. Linear probes across layers reach ~97% accuracy at decoding the implied timestep, confirming a reliable "subliminal clock" signal — a mechanistic finding without autoregressive analogue. Steering the model along the low-dimensional subspace of this inferred timestep modulates denoising behavior systematically, with structured geometry in activation space. First mechanistic interpretability result for the internal denoising clock of a DLM.

09
mech-interp preprint

Mechanistic Interpretability for Neural Networks: Circuits, Sparse Features and Symbolic Reasoning

Pranav Milind Sawant (UT Dallas), Jakub Krejčí (VSB-Technical University of Ostrava) · arXiv, July 8, 2026
MECHANISTIC INTERPRETABILITY: STRUCTURED TAXONOMY CIRCUITS Residual stream Attention heads Induction circuits IOI task circuits actvn patching SPARSE FEATURES Superposition Polysemanticity SAEs Transcoders auto-interp SYMBOLIC REASONING Algorithmic tasks Grokking Modular arithmetic CoT faithfulness causal interventions SAFETY APPLICATIONS Steering vectors Jailbreak analysis Concept erasure Alignment audits rep. engineering
Figure 1 · Mech interp taxonomy — four pillars: circuits (residual stream, attention, IOI), sparse features (SAEs, transcoders, auto-interp), symbolic reasoning (grokking, CoT faithfulness), and safety applications; each column maps to distinct evaluation methods.

Structured survey organized across four pillars: (1) Transformer circuit analysis — residual stream, attention mechanisms, induction heads, IOI circuits; (2) superposition and polysemanticity — SAEs and transcoders as decomposition tools, auto-interpretability; (3) symbolic reasoning — grokking, modular arithmetic, chain-of-thought faithfulness; (4) safety implications — steering vectors, jailbreak analysis, concept erasure, alignment audits. Serves as both a research primer and a comparative reference for methodology selection, distinguishing SAE from transcoder approaches and surveying evaluation standards across the literature.

10
mech-interp AI security preprint

AgentLens: Interpretable Safety Steering via Mechanistic Subspaces for Multi-Turn Coding Agent

arXiv preprint · June 2026 · multi-turn coding agent deployment
AGENTLENS: INTERPRETABLE SAFETY STEERING FOR CODING AGENTS SAE Decomposition agent residual stream → sparse feature basis coding + safety features Mechanistic Subspace identifies task-specific coding subspace + safety subspace Targeted Safety Steering steer in safety subspace ↓ harmful code generation ≈ coding performance Mechanistic subspace steering > raw activation steering — interpretability translates to safety gain
Figure 1 · AgentLens: SAE decomposition of a coding agent's residual stream → task-specific mechanistic subspace identification → targeted safety steering within that subspace; subspace-aware steering outperforms raw-activation steering while preserving coding performance.

AgentLens applies mechanistic interpretability to a deployed multi-turn coding agent rather than a controlled benchmark. SAE decomposition of the agent's residual stream identifies task-specific mechanistic subspaces for both coding capability and safety-critical behavior; safety-targeted activation steering within these subspaces reduces harmful code generation without degrading coding performance. The key result: steering within interpretable mechanistic subspaces outperforms steering in raw activation space, providing a direct demonstration that circuit-level decomposition translates interpretability findings into practical safety improvements in an agentic setting.

← all Research Radar issues · gussand · source