LFD Book Forum

LFD Book Forum (http://book.caltech.edu/bookforum/index.php)
-   Chapter 1 - The Learning Problem (http://book.caltech.edu/bookforum/forumdisplay.php?f=108)
-   -   Hoeffding inequality and noisy targets (http://book.caltech.edu/bookforum/showthread.php?t=4852)

v_venky 09-04-2018 10:44 PM

Hoeffding inequality and noisy targets
I found the jump from learning a deterministic target function to learning a probability distribution a big jump. The treatment of this concept in the book was a bit too fast for me and not detailed. Also the "intuitive" justification of hoeffding in this case also was not clear to me at all -- Hoeffding seems to be a tricky concept in the sense that it's application is prone to error if one is not careful. Is there a more step-by-step explanation of this section somewhere?

One starter question in this regard is that in the basic hoeffding derivation, we have used a binary classifier i.e. the target function returns +/-1 (or possibly a multi-class classifier). In the noisy target case should the understanding be that it returns a number 'p' signifying the probability of +1 at x?

htlin 09-08-2018 04:26 PM

Re: Hoeffding inequality and noisy targets
This lecture


contains some materials related to noisy targets, though not a lot.

The assumption here is that we still get a deterministic classifier (to predict a noisy target). There are other settings that allow us to get a probabilistic classifier, but those are more complicated to analyze and not discussed in detail here.

Hope this helps.

All times are GMT -7. The time now is 02:44 PM.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.