Google

In classification tasks where the goal is to select a single label word, such as filling in a blank, the chosen label is the one that maximizes the conditional probability given the input context $$\mathbf{x}$$. This selection process is formalized by the equation: $$\text{label} = \underset{y \in Y}{\arg\max} \, \text{Pr}(y|\mathbf{x})$$ In this formula, $$y$$ represents a candidate label word, and $$Y$$ is the predefined set of all possible label words. For example, in a polarity classification task, the set of labels could be $$Y = \{\text{positive, negative, neutral}\}$$.

Formula for Label Selection via Probability Maximization

A language model is designed to classify the primary topic of a given sentence from a predefined set of labels. Analyze the following scenario and explain why the model produced its specific output, based on the principle of selecting the label that maximizes the conditional probability.

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.

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 proba

Learn Before

Related