Test-Time Compute refers to allocating additional computational resources during inference (test time) rather than training. By letting a model think longer, generate multiple paths, self-correct, or run search trees, it can solve significantly harder problems.
Directly governs the hardware efficiency and hardware-level token throughput when deploying complex mathematical proofs, competitive coding, and strategic decision making; optimizing Test-Time Compute is a major factor in compute cost budgeting.
Test-Time Compute refers to scaling computational resources during the generation/inference phase rather than the training phase. By embedding the LLM inside search trees, consensus voting algorithms, or multi-turn thinking paths, the system can explore alternative possibilities, self-correct errors, and arrive at highly accurate logical solutions, effectively letting the model "think longer" before answering.
By utilizing methods like Monte Carlo Tree Search (MCTS), majority voting (best-of-N), or chain-of-thought thinking token budgets.
It shifts model performance scaling from expensive training runs to dynamic execution budgets, allowing the system to use more compute only for difficult queries.
Reference this definition in your articles, research, or documentation to credit this source:
Recent progress on ARC-AGI-1 from disclosed architectures has come broadly from two regimes: heavy test-time compute over frontier models (evolutionary...
Modern reasoning model can allocate different amounts of test-time computation, such as thinking token, model