LFD Book Forum Exercise 1.12
 User Name Remember Me? Password
 Register FAQ Calendar Mark Forums Read

 Thread Tools Display Modes
#1
05-29-2016, 03:23 AM
 henry2015 Member Join Date: Aug 2015 Posts: 31
Exercise 1.12

Hi,

I thought I could only provide what Hoeffding Inequality's guarantee to my friend.

Ein(g) could be very bad (says 0.5) as my hypothesis set could be bad and so I can only pick g which has smallest Ein(h). And so I can only promise that P[|Eout(g)-Ein(g)| < e] has an upper bound by Hoeffding Inequality...

No?
#2
07-26-2016, 12:02 PM
 jeffjackson Junior Member Join Date: Jun 2016 Posts: 5
Re: Exercise 1.12

This is related to my Chapter 1 post about Section 1.3 being fundamentally flawed. You're correct, henry2015: You cannot promise any of the given answers (a) through (c) to Exercise 1.12.

What you can promise is this:

(d) With high probability, you will either produce a hypothesis g that approximates f well out of sample, or you will declare that you have failed.

You can promise this because Hoeffding guarantees that Ein will be close to Eout with high probability. So, with high probability, you will either produce a good-approximating g (Ein is small) or you will declare that you have failed (Ein is large).

Although (d) is similar to the textbook's answer (c), there is an important distinction: (c) promises that almost every time you output a hypothesis g, g is a good approximator to f. (d) does not make any such promise. In fact, (d) allows that it might be the case the every time you output a hypothesis, it is a poor approximator. What (d) does promise is that, if you are in such a learning scenario, you will normally declare that you have failed rather than outputting a poor hypothesis.
#3
08-01-2016, 11:08 AM
 magdon RPI Join Date: Aug 2009 Location: Troy, NY, USA. Posts: 597
Re: Exercise 1.12

You are right. Part (c) should be reworded to say:

With high probability: you will either say you failed or you will produce a good g.
__________________
Have faith in probability
#4
08-02-2016, 02:33 PM
 jeffjackson Junior Member Join Date: Jun 2016 Posts: 5
Re: Exercise 1.12

Following up on my earlier reply: In my thread regarding Section 1.3 I have presented an argument for the feasibility of learning that, if accepted, allows us to promise something a good bit stronger than what I offered earlier, which was based only on Hoeffding. The stronger promise is this:
(e) Assuming that you are given sufficient data and/or allowed a sufficiently large error so that the Hoeffding probability is ultra low, such as , you will either produce a hypothesis g that approximates f well out of sample, or you will declare that you have failed.
Put another way, given my argument for feasible learning and given the assumption above, I can in good conscience promise that whenever I produce a hypothesis, it is a good approximation to the target. That is, it is reasonable for me to promise that I will never output a poor-approximating hypothesis.

 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 10:15 PM.

 Contact Us - LFD Book - Top