LFD Book Forum Problem 1.10 (b)
 Register FAQ Calendar Mark Forums Read

#1
04-01-2015, 06:06 PM
 NewtoML Junior Member Join Date: Mar 2015 Posts: 8
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
#2
04-02-2015, 09:53 PM
 yaser Caltech Join Date: Aug 2009 Location: Pasadena, California, USA Posts: 1,475
Re: Problem 1.10 (b)

Quote:
 Originally Posted by NewtoML 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?
Exactly, and the output is limited to a binary value, too.
__________________
Where everyone thinks alike, no one thinks very much
#3
11-23-2015, 08:13 AM
 c.thejaswi Junior Member Join Date: Nov 2015 Posts: 2
Re: Problem 1.10 (b)

Quote:
 Originally Posted by yaser Exactly, and the output is limited to a binary value, too.
Dear Professor,
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?
#4
11-23-2015, 08:18 AM
 c.thejaswi Junior Member Join Date: Nov 2015 Posts: 2
Re: Problem 1.10 (b)

I am sorry for the confusion. I got it.
Thanks.
#5
12-03-2015, 04:59 AM
 memoweb Junior Member Join Date: Dec 2015 Posts: 4
Re: Problem 1.10 (b)

Quote:
 Originally Posted by c.thejaswi I am sorry for the confusion. I got it. Thanks.
thanks
#6
04-01-2016, 05:32 AM
 MaciekLeks Member Join Date: Jan 2016 Location: Katowice, Upper Silesia, Poland Posts: 17
Re: Problem 1.10 (b)

IMHO, the answer to (b) is not an infinite number. As for part (a) the anwer is not , so here the anwer is not as simple as it seems.

My way of thinking is as follows:
We must recall that the assumption from (a) does not work here, and we still do not know function . We also do not know the dimensionality of the datapoint in the input space but we know that this input space is fixed (all for are already set). In this case we have of size N generated in a deterministic way, and () is not affected by any noise. So, how many possible can 'generate' ? The subtle point in this case is the assumption: “For a fixed of size ”, which means that is already generated. We can calculate how many possible outputs for we can get? Only 1. But there are remaining datapoints for which we can have possible values . So, the anwer is .

Am I wrong?

 Thread Tools Display Modes Linear Mode

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Forum Rules
 Forum Jump User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home General     General Discussion of Machine Learning     Free Additional Material         Dynamic e-Chapters         Dynamic e-Appendices Course Discussions     Online LFD course         General comments on the course         Homework 1         Homework 2         Homework 3         Homework 4         Homework 5         Homework 6         Homework 7         Homework 8         The Final         Create New Homework Problems Book Feedback - Learning From Data     General comments on the book     Chapter 1 - The Learning Problem     Chapter 2 - Training versus Testing     Chapter 3 - The Linear Model     Chapter 4 - Overfitting     Chapter 5 - Three Learning Principles     e-Chapter 6 - Similarity Based Methods     e-Chapter 7 - Neural Networks     e-Chapter 8 - Support Vector Machines     e-Chapter 9 - Learning Aides     Appendix and Notation     e-Appendices

All times are GMT -7. The time now is 01:33 AM.