View Single Post
  #5  
Old 08-24-2012, 12:17 PM
magdon's Avatar
magdon magdon is offline
RPI
 
Join Date: Aug 2009
Location: Troy, NY, USA.
Posts: 595
Default Re: Problem 2.9 : Growth function of perceptron, seems incorrect

Thanks for catching this erratum. The problem shows the upper bound based on the VC dimension. The actual growth function is given by:

2\sum_{i=0}^d \left({N-1}\atop i\right).

Our appologies.

Quote:
Originally Posted by vsthakur View Post
The problem says that in case of perceptron in d-dimensional 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.
__________________
Have faith in probability
Reply With Quote