logo
How it worksCoursesResearch CommunitiesBenefitsAbout Us
Schedule Demo
Learn Before
  • Next Token Prediction Formula

True/False

The formula ŷ = argmax_y Pr(y|cache) implies that the selection of the next token is a deterministic process, where the single token with the highest calculated probability is always chosen.

0

1

Updated 2025-10-08

Contributors are:

Gemini AI
Gemini AI
🏆 2

Who are from:

Google
Google
🏆 2

Tags

Ch.5 Inference - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Analysis in Bloom's Taxonomy

Cognitive Psychology

Psychology

Social Science

Empirical Science

Science

Related
  • An autoregressive language model is generating text and needs to determine the next token. After processing the existing context (which is stored in its cache), the model's final layer outputs the following probabilities for a small subset of its vocabulary:

    • P('mat' | cache) = 0.65
    • P('floor' | cache) = 0.25
    • P('sky' | cache) = 0.05
    • P('the' | cache) = 0.05

    According to the standard formula for selecting the single most likely next token, which token will be chosen?

  • Rationale for Conditioning on the Cache

  • Explaining the Token Selection Process

  • The formula ŷ = argmax_y Pr(y|cache) implies that the selection of the next token is a deterministic process, where the single token with the highest calculated probability is always chosen.

logo 1cademy1Cademy

Optimize Scalable Learning and Teaching

How it worksCoursesResearch CommunitiesBenefitsAbout Us
TermsPrivacyCookieGDPR

Contact Us

iman@honor.education

Follow Us




© 1Cademy 2026

We're committed to OpenSource on

Github