Recurrent KV-cache sharing may undermine the bounded-depth argument for CoT monitorability

·LessWrong··

Recent discussion of recurrent-depth/looped transformers (especially in the context of OpenAI's Astra model) has mostly focused on the number of recurrent passes per token. The usual reassurance is that if this number is small, the model only gains a bounded amount of opaque computation before it must emit another readable CoT token.I think this may miss an important distinction: some recurrent KV-cache policies can create cross-token paths from later recurrent depths back to earlier recurrent d...

Read full article →

Related Articles

Measuring the sloppiness of code
doppp · Hacker News · 14h ago
Google will buy half the electricity from one of Finland's nuclear power plants
lukaspetersson · Hacker News · 1d ago
HuggingFace: Security.txt
yarapavan · Hacker News · 13h ago
Rune is now open source
ernestrc · Hacker News · 12h ago
The Deathray: A simple way for an untrusted site to freeze a Mac
auberonedu · Hacker News · 1d ago