TL;DR
This paper investigates whether depth-recurrent transformers internally develop latent chain-of-thought reasoning, finding limited evidence of such interpretability and only marginal benefits from increased recurrence depth.
Contribution
The study provides an empirical analysis of latent CoT in depth-recurrent transformers, revealing limited emergence of interpretable reasoning structures and highlighting inconsistencies across layers.
Findings
Limited evidence of interpretable latent CoT in Huginn-3.5B.
Significant probing inconsistencies across recurrent blocks.
Marginal gains from increasing recurrence depth.
Abstract
Chain-of-thought (CoT) reasoning has enabled transformer-based language models to excel at complex mathematics and multi-step planning. However, in standard decoder-only architectures, these reasoning steps are externalized in natural language, improving interpretability at the cost of efficiency. To capture reasoning that is not easily represented in words, many works have explored recurrent architectures that aim to internalize reasoning in latent space, potentially supporting latent CoT. In this paper, we investigate whether such reasoning structures emerge in Huginn-3.5B, a depth-recurrent Transformer that reuses layers at inference time without increasing parameter count. We examine the model's internal behavior on arithmetic tasks using a suite of probing techniques including the Logit Lens and Coda Lens. Our findings reveal limited evidence of interpretable latent CoT by tracking…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsDropout · Label Smoothing · Byte Pair Encoding · Absolute Position Encodings · Layer Normalization · Dense Connections · Softmax · Transformer
