Skip to main content
← Choose a different target

Unlock: Test-Time Compute and Search

Spending more inference compute through best-of-N, verifier-guided search, tree search, process rewards, and latent/internal computation, with gains limited by verifier quality and base pass rate.

384 Prerequisites0 Mastered0 Working263 Gaps
Prerequisite mastery32%
Recommended probe

Universal Approximation Theorem is your weakest prerequisite with available questions. You haven't been assessed on this topic yet.

Not assessed5 questions
Not assessed5 questions
Not assessed1 question
Scaling LawsResearch
Not assessed3 questions
Not assessed3 questions

Sign in to track your mastery and see personalized gap analysis.