liveBook · Manning

Compute

As explained in Sutskever's List

Test-time compute is the allocation of additional computation during inference so a model can perform more extensive internal processing before producing an output.

Test-time compute allocates more computation during inference so a model can do additional reasoning before answering. It reflects a shift from relying on pretraining scale alone toward organizing computation for tasks that require reasoning. section 7.0

Ways to add reasoning at inference include:

  • Chain-of-thought prompting decomposes a query into subtasks and gives the model an internal scratchpad, without changing its architecture or parameters. section 7.5.3
  • A model can generate several reasoning chains, search among them, and select the answer that appears most consistent—a vote among its candidate thoughts. section 7.5.3

Extra deliberation can strengthen performance, but prompting is a limited lever when a task requires recomputation under novel constraints; it cannot substitute for mechanisms that search or enforce invariants. section 7.5.3 section 7.5

How Sutskever's List covers it

How deep it goes
Explains scratchpads and multi-chain selection, but does not specify how to implement or schedule additional computation.
Examples
Illustrates scratchpad prompting through query subtasks and multi-chain reasoning through search and consistency voting.
What you can do after
Evaluate how additional inference-time deliberation may improve reliability and where prompting falls short on novel constraints.
How it connects
Connects test-time compute with chain-of-thought prompting, inference, and scaling.

Also explained in

Compare how 2 books explain compute →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.