Ex. 2.1
Ex. 2.1
Suppose each of -classes has associated target , which is a vector of all zeros, except a one in the -th position. Show that classifying to the largest of amounts to choosing the closet target, , if the elements of sum to one.
Soln. 2.1
We need to prove:
By definition of , we have
Given , it's straightforward to see that indeed holds because only depends on .
Remark
The assumption is actually not required.