Two Frozen Models Learn to Whisper: Coupling Through Hidden States

Two Frozen Models Learn to Whisper: Coupling Through Hidden States Source: https://arxiv.org/abs/2605.11167 Paper was published on May 11, 2026 This episode was AI-generated on May 13, 2026. The script was written by an AI language model and the host voices were synthesized by Eleven Labs. The producer is not affiliated with Anthropic or Eleven Labs. Two small language models, both frozen, are wired together through a tiny bridge between their hidden states — and they invent their own communication protocol from task loss alone. The result: a half-billion-parameter model jumps from 36% to 96% on arithmetic, and a pair of sub-billion models beat GPT-4o on logic puzzles. But the conceptual payoff matters more than the numbers, and the caveats matter more than the headline. Key Takeaways: - How a 1%-parameter bridge between two frozen copies of the same model lifts arithmetic accuracy from 36% to 96.5% - Why a structured communication protocol — quiet on routine tokens, loud on semantically critical ones — emerges from next-token loss with no protocol specified - The training phase transition: accuracy sits at zero for 28,000 samples before all three required skills click into place at once - Why the auxiliary model can write correct Python for a problem it never saw, reconstructing operands purely through activations - Where the technique underperforms its own base model (general MATH reasoning) and why the gap-to-tool size predicts when coupling helps - The ablation that rules out 'it's just an adapter': bypassing the auxiliary's computation collapses arithmetic gains from 96% to 48% 00:00 - A model writes correct code for a problem it never read: The opening puzzle: an auxiliary model produces problem-specific Python without seeing any of the problem's tokens, setting up the question of what channel is actually carrying that information. 03:38 - The architecture: a co-pilot with a volume knob: How the bridge works at each decoding step — forward translation, a per-token learned gate, reverse translation, and both models emitting tokens in lockstep. 07:17 - The phase transition during training: Tracking forward coupling, reverse coupling, tool recall, and accuracy reveals a long flat period followed by a sudden jump once all three prerequisite skills align. 10:56 - What the gates actually do: Token-by-token analysis showing the forward channel firing on task words and the reverse channel staying silent until the moment a tool returns its result. 14:35 - The steelman: where the technique doesn't win: Honest accounting of the MATH aggregate underperformance, the 'best of 890 configurations' framing of the headline number, and the doubled compute cost. 20:34 - The ablation that earns the architecture its keep: An adapter-equivalent control that bypasses the auxiliary scores 48% on arithmetic versus 96.5% for the full system — showing the auxiliary is doing real work. 21:53 - Identity bridges and the Platonic Representation Hypothesis: A bridge with no translation network generalizes better out-of-distribution, suggesting matched-depth representations across copies of the same model are already in compatible spaces. 25:32 - What this is evidence for: Framing the paper as an existence proof that activation-level coupling between frozen models is learnable, and naming the obvious next experiment: trying it across different models. Recommended Reading: - The Platonic Representation Hypothesis: Directly relevant to the episode's closing thread about why the identity-bridge variant works — argues that capable models converge on shared representational geometries. (https://arxiv.org/abs/2405.07987) - Representation Engineering: A Top-Down Approach to AI Transparency: Background for the broader research program the episode situates this paper within — manipulating model behavior through hidden-state interventions rather than tokens. (https://arxiv.org/abs/2310.01405) - Toolformer: Language Models Can Teach Themselves to Use Tools: The canonical token-based approach to tool use, useful contrast to the bicameral paper's claim that activations can carry tool-call information without text. (https://arxiv.org/abs/2302.04761) - Communicating Agents Solve Mathematical Problems with Multi-Turn Interactions (MathChat) : Representative of the text-passing multi-agent paradigm the episode frames as the status quo this architecture challenges. (https://arxiv.org/abs/2306.01337)