Thanks for catching this erratum. The problem shows the upper bound based on the VC dimension. The actual growth function is given by:
.
Our appologies.
Quote:
Originally Posted by vsthakur
The problem says that in case of perceptron in ddimensional space, growth function is equal to B(N,k). Consider the following case :
d = 2, implies dvc = 2+1 = 3
N = 4
B(N,k) = 15
but the maximum no. of dichotomies possible in this case is only 14
Can someone please comment if i am missing something.
Thanks.
Vishwajeet.
