![]() |
#1
|
|||
|
|||
![]()
It's clear for me how inequality works for each hypothesis separately. But I don't understand why we need Hoeffding inequality for multiple hypothesis. If i have training data set of size 'N' then (for fixed tolerance 'e') Hoeffding upper bound is determined for each hypoyhesis. The only thing that remains is to find hypothesis with minimal in-sample rate. Why do we need to consider all hypothesis simultaneously? What information gives us Hoeffding inequality with factor 'M' in it? I undetstand example with coins but I can not relate it to learning problem.
Sorry for my english and thanks. |
#2
|
||||
|
||||
![]()
Hoeffding for a single hypothesis
![]() ![]() As you point out, "The only thing that remains is to find hypothesis with minimal in-sample rate." Why would one do this? Because one is confident that Ein is close to Eout for every hypothesis, and so if we find the the hypothesis with minimum Ein, it will likely have minimum Eout. So, to be justified in picking the hypothesis with minimum Ein, we require that ![]() Equivalently, for no ![]() The factor of M comes from using the union bound ![]() ![]() Quote:
__________________
Have faith in probability |
#3
|
|||
|
|||
![]()
Thank you, Professor!
I do not quite understand the following: I thought that the goal is to get the upper bound for probability of event ![]() ![]() ![]() My last question is as follows. The LHS of Hoeffding inequality for M hypothesis is ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
#4
|
||||
|
||||
![]()
Sorry, there was a typo in my previous message. Yes they are different events. But they are very related events.
![]() ![]() P[B]=1-P[A]>=1-M*... Quote:
__________________
Have faith in probability |
![]() |
Thread Tools | |
Display Modes | |
|
|