atlas

Research map / Architectures and efficiency / Attention and transformers

Chain of Thought Empowers Transformers to Solve Inherently Serial Problems

ICLR 2024 · Architectures and efficiency › Attention and transformers · approach: Transformer expressivity and learnability · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Shows via circuit complexity that constant-precision, constant-depth transformers are limited to AC^0 without CoT, while polynomial CoT steps let them solve any poly-size circuit problem, and validates this empirically on S_5 composition, iterated squaring, and circuit value.

Problem

Why chain-of-thought improves LLM reasoning: the expressiveness limits of constant-depth, finite-precision decoder-only transformers with and without intermediate CoT steps.

Approach

Tightens the expressiveness upper bound for constant-depth, constant-precision transformers to AC^0 (from TC^0) by handling per-step rounding, and shows that T steps of CoT let constant-depth transformers simulate any size-T boolean circuit, so CoT supplies serial computation that parallel depth lacks.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add chain-of-thought supervision and autoregressive CoT generationLow-depth transformers · Permutation composition (S5)accuracyHelped
Add chain-of-thought supervision and autoregressive CoT generationLow-depth transformers · Iterated squaringaccuracyHelped
Add chain-of-thought supervision and autoregressive CoT generationLow-depth transformers · Circuit value problemaccuracyHelped
Provide chain-of-thought steps as hint labelsTransformers · Arithmetic and symbolic reasoning tasksaccuracyHelped
Use CoT instead of hint supervisionLow-depth transformers · Modular addition (C7)accuracyHelped

Surprising findings

Limitations

Experimental setup

Datasets: synthetic modular addition data synthetic permutation composition data synthetic iterated squaring data synthetic circuit value problem data

Benchmarks: modular addition permutation composition S_5 iterated squaring circuit value problem

Metrics: accuracy probability of predicting all CoT tokens correctly

Baselines: no-CoT (BASE) training hint-only training

Builds on: Krohn-Rhodes decomposition theorem Transformers as parallel computers (TC^0 bounds) Adam

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy