Which loss function punishes large errors more heavily than small errors?

Get ready for the GARP Risk and AI Exam with flashcards and multiple choice questions. Each question comes with hints and explanations. Prepare for success!

Multiple Choice

Which loss function punishes large errors more heavily than small errors?

Explanation:
Squaring the error makes bigger deviations stand out more. In a loss that averages squared deviations, a mistake of size 2 contributes 4 to the loss, while a mistake of size 1 contributes only 1. Doubling the error more than doubles the penalty, so large errors are punished disproportionately compared to small ones. This direct emphasis comes from the squared-error approach, which is what mean squared error uses. By contrast, mean absolute error grows linearly with error, so large and small errors are penalized more evenly; RMSE applies a square root to those squared errors, reducing the emphasis a bit; mean absolute percentage error is based on relative error, not just magnitude. So the function that weights large mistakes most strongly is the squared-error loss.

Squaring the error makes bigger deviations stand out more. In a loss that averages squared deviations, a mistake of size 2 contributes 4 to the loss, while a mistake of size 1 contributes only 1. Doubling the error more than doubles the penalty, so large errors are punished disproportionately compared to small ones. This direct emphasis comes from the squared-error approach, which is what mean squared error uses. By contrast, mean absolute error grows linearly with error, so large and small errors are penalized more evenly; RMSE applies a square root to those squared errors, reducing the emphasis a bit; mean absolute percentage error is based on relative error, not just magnitude. So the function that weights large mistakes most strongly is the squared-error loss.

Subscribe

Get the latest from Examzify

You can unsubscribe at any time. Read our privacy policy