Problem 1.10 (b)
Hello,
I believe that the number of possible f that can generate D in a noiseless setting is infinite. For example, if I take a data set of 2 points, say (5,1) and (3,1), I can come up with any number of functions that will generate these two points. However, I'm confused as to how this reconciles with the example on p. 16 where the set of all possible target functions in the example is finite, namely 256. Is this because the input space X is limited to Boolean vectors in 3 dimensions? Thanks 
Re: Problem 1.10 (b)
Quote:

Re: Problem 1.10 (b)
Quote:
However, it is no where mentioned that ${\cal X}$ is a space of binary strings, and "$f$" is a logical operation. Therefore, is it still true that number of $f'$s that can generate D is finite? 
Re: Problem 1.10 (b)
I am sorry for the confusion. I got it.
Thanks. 
Re: Problem 1.10 (b)
Quote:

All times are GMT 7. The time now is 04:21 PM. 
Powered by vBulletin® Version 3.8.3
Copyright ©2000  2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. AbuMostafa, Malik MagdonIsmail, and HsuanTien Lin, and participants in the Learning From Data MOOC by Yaser S. AbuMostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.