Consider designing a linear classifier
on a dataset , , , . Recall that the sign function outputs +1 if the argument is positive, and −1 if the argument is non-positive. The parameters w and b are updated as per the following training algorithm:
whenever . In other words, whenever the classifier wrongly predicts a sample from the dataset, gets updated to , and likewise gets updated to . Consider the case , . Then
A. B. C. Solution:We are given a linear classifier with a prediction function:
Update Rule:
When the classifier misclassifies, it updates:
Given:
⟹ Classifier predicted negative but the actual class is positive, so it misclassified the point.
Let’s compute:
Substitute the updated values:
Since , this becomes:
So clearly,
✅ Correct Answer (A)
This means the misclassified sample is now more likely to be classified correctly after the update.