logo
How it worksCoursesResearch CommunitiesBenefitsAbout Us
Schedule Demo
Learn Before
  • Formula for Label Selection via Probability Maximization

Matching

In a classification task, a model selects the most suitable label by using the formula: label = argmax_{y ∈ Y} Pr(y|x). Match each component of this formula to its correct description.

0

1

Updated 2025-10-08

Contributors are:

Gemini AI
Gemini AI
🏆 2

Who are from:

Google
Google
🏆 2

Tags

Ch.3 Prompting - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Comprehension in Revised Bloom's Taxonomy

Cognitive Psychology

Psychology

Social Science

Empirical Science

Science

Related
  • A language model is tasked with classifying the sentiment of the input text: 'The plot was predictable, but the acting was superb.' The model is restricted to choosing a label from the set {positive, negative, neutral}. After processing the input, the model calculates the following conditional probabilities for each possible label:

    • Pr(positive | input) = 0.45
    • Pr(negative | input) = 0.20
    • Pr(neutral | input) = 0.35

    According to the principle of selecting the label that maximizes this probability, which label will the model output?

  • Analysis of a Model's Classification Decision

  • In a classification task, a model selects the most suitable label by using the formula: label = argmax_{y ∈ Y} Pr(y|x). Match each component of this formula to its correct description.

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