Skip to main content

Let's think dot by dot: Hidden computation in transformer language models

Jacob Pfau, William Merrill, Samuel R. Bowman

Studies whether meaningless filler-token positions can provide transformers with additional hidden computation without carrying readable reasoning content.

First public:

Cite this paper

ArXiv preprint

arXiv:2404.15758 · Initial submission: 2024-04-24

BibTeX · CSL-JSON

A published-version citation has not been verified for this entry. This does not mean the paper is unpublished.

Choose the version you used. The arXiv link may serve a revision; check the original paper for the exact result, assumptions and limitations you cite.

Explore this approach

Thinking tokens — Give a model extra tokens for computation, such as pauses, filler symbols, or learned planning tokens. These tokens need not spell out the solution.

Read or reuse this entry

Plain-text Markdown · JSON record · Find in the full list

Our summary and categories are a reading aid, not the authors’ abstract. Use the original paper for research claims. Suggest a correction.